node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
3,185 | 4 | 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 | [
1249,
3165,
1809,
4759,
806,
994,
4492,
7351,
4138,
385,
7536,
2296,
2746,
5571,
6107,
578,
3637,
8100,
6456,
3551,
1291,
7275,
7744,
3394,
6560,
4977,
7289,
7478,
3223,
3484,
4091,
2790,
7683,
6235,
6149,
6951,
7597,
875,
6962
] | Validation |
3,186 | 9 | BlueDragon:bluedragon bluedragon coldfusion markup language cfml engine comparable adobe systems coldfusion licensed distributed new atlanta tagservlet ltd based scotland bluedragon also distributed supported bea systems oracle weblogic server server platform bluedragon applications run variety platforms including microsoft windows linux mac os x mostly compatible coldfusion mx 7 march 2008 new atlanta announced future versions bluedragon java ee editions would released open source products open source version released open bluedragon openbd december 2008 bluedragon available six editions first two editions standalone servers run windows linux os x bd j2ee cfml applications deployed j2ee server enabling integration cfml j2ee enabled coldfusion mx bd bea weblogic edition special edition based bd j2ee use bea weblogic server bd.net extends microsoft .net framework iis permit deployment cfml applications native ms .net web applications offering integration cfml asp.net possible coldfusion server jx j2ee ms .net bea weblogic editions bluedragon commercial products available 30-day unlimited trials convert single-ip developer edition expiration server edition hand free deployment—though hosting redeployment 6.2 release commercial use differences cfml tags supported free server edition supports odbc drivers ms windows mysql postgresql linux mac os x supports iis ms windows apache linux mac os x support secured ssl connections none limitations free server edition exist commercial server jx j2ee .net bea weblogic editions .net edition bluedragon runs microsoft .net platform bd.net enables cfml applications leverage .net platform allows integration cfml asp.net well .net objects open bluedragon open source version bluedragon released gnu general public license version 3 gplv3 chief differences open source j2ee version removal commercial libraries e.g. pdf generation jturbo jdbc driver microsoft sql server bluedragon administrator application runs standard j2ee application server tomcat jboss jetty original version bluedragon released 2002 myspace used .net version bluedragon power online applications 2007 though bluedragon 7.0 designed compatible adobe coldfusion mx 7.0.2 differences two cfml implementations bluedragon offers several advantages tags functions functionality found coldfusion similarly tags functions found coldfusion supported currently bluedragon new atlanta maintains complete list incompatibilities adobe coldfusion mx documentation number popular coldfusion frameworks fully supported bluedragon list useful resources developers see coldfusion development aids section | [
2456,
4759,
6704,
103,
3186,
4773,
6095,
5571,
5490,
578,
2752,
3543,
6362,
3915,
7689
] | Train |
3,187 | 3 | Windows_CE_5.0:windows ce 5.0 windows ce 5.0 codenamed macallan magellan brand gps units run successor windows ce 4.2 third release windows ce .net family first released july 9 2004 like predecessors windows ce 5.0 marketed towards embedded device market independent device vendors windows ce 5.0 billed low-cost compact fast-to-market real-time operating system available x86 arm mips superh microprocessor-based systems windows ce 5.0 builds previous windows ce releases adoption shared source since 2001 microsoft steadily expanding available windows ce source tree embedded system developers windows ce 5.0 open microsoft operating system date though system available shared source agreements developers freedom modify kernel level without need share changes microsoft competitors windows ce 5.x base os windows mobile 6.0 6.1 6.5 x86 platform windows ce 5.0 competes microsoft embedded operating systems windows xp embedded predecessor windows nt embedded platform builder ide windows ce 5.0 last builder tool available standalone product windows ce 5.0 currently available device emulator according microsoft windows ce preferable windows xp embedded situations demanding wireless multimedia requirements need met following primary considerations “ choosing right version ” also difference cost | [
448,
1522,
2452,
458,
4759,
5637,
895,
1536,
6256,
7616,
3180,
2472,
4500,
4687,
1097,
5571,
5313,
224,
5055,
7660,
8118,
2329,
3048,
6136,
3907,
2066,
5781,
2885,
6580,
7685,
3585,
352,
3751,
5442,
4377,
5794,
444,
447
] | Validation |
3,188 | 9 | 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 | [
2903,
7878,
1445,
5019,
1820,
6796,
6087,
2915,
5734,
1478,
2218,
4704,
5757,
6116,
1116,
6471,
7573,
2600,
5077,
1885,
5082,
1889,
4370,
6507,
795,
6876,
6882,
6888,
4408,
481,
1557,
5494,
5501,
6210,
144,
4074,
4085,
7298,
5515,
8025,
... | Test |
3,189 | 4 | Rogue_access_point:rogue access point rogue access point wireless access point installed secure network without explicit authorization local network administrator whether added well-meaning employee malicious attacker although technically easy well-meaning employee install soft access point inexpensive wireless router—perhaps make access mobile devices easier—it likely configure open poor security potentially allow access unauthorized parties attacker installs access point able run various types vulnerability scanners rather physically inside organization attack remotely—perhaps reception area adjacent building car park high gain antenna even several miles away prevent installation rogue access points organizations install wireless intrusion prevention systems monitor radio spectrum unauthorized access points presence large number wireless access points sensed airspace typical enterprise facility include managed access points secure network plus access points neighborhood wireless intrusion prevention system facilitates job auditing access points continuous basis learn whether rogue access points among order detect rogue access points two conditions need tested first two conditions easy test—compare wireless mac address also called bssid access point managed access point bssid list however automated testing second condition become challenging light following factors need cover different types access point devices bridging nat router unencrypted wireless links encrypted wireless links different types relations wired wireless mac addresses access points soft access points b necessity determine access point connectivity acceptable response time large networks c requirement avoid false positives negatives described false positives occur wireless intrusion prevention system detects access point actually connected secure network wired rogue frequent false positives result wastage administrative bandwidth spent chasing possibility false positives also creates hindrance enabling automated blocking wired rogues due fear blocking friendly neighborhood access point false negatives occur wireless intrusion prevention system fails detect access point actually connected secure network wired rogue false negatives result security holes unauthorized access point found connected secure network rogue access point first kind also called “ wired rogue ” hand unauthorized access point found connected secure network external access point among external access points found mischievous potential risk e.g. whose settings attract already attracted secure network wireless clients tagged rogue access point second kind often called evil twin soft access point soft ap set wi-fi adapter using example windows virtual wi-fi intel wifi makes possible without need physical wi-fi router share wired network access one computer wireless clients connected soft ap employee sets soft ap machine without coordinating department shares corporate network soft ap becomes rogue ap | [
4517,
1461,
3189,
558,
3426
] | Validation |
3,190 | 3 | Pooyan:pooyan pooyan ported atari 2600 atari 8-bit family tandy color computer 2 commodore 64 sord m5 msx apple ii tandy trs-80 tomy tutor pv-1000 famicom player controls mama pig whose babies kidnapped pack wolves must rescue using bow arrow slabs meat controls consist two-position up/down joystick moves elevator mama pig rides button fires arrows throws meat level consists two rounds first wolves descend slowly high ledge using balloons player must shoot order drop ground wolves reach ground safely climb set ladders behind elevator try eat mama pig moves front second round wolves start ground inflate balloons order ascend cliff boulder resting push toward edge airborne wolves throw rocks rounds trying hit mama pig addition balloon carrying last boss wolf second round must shot several times order defeat reaches cliff player must defeat additional enemies facing boss slab meat occasionally appears top elevator range motion picking allows player throw distracting wolves on/near trajectory causing let go balloons crash ground bonus points stray balloons dropped fruits also shot extra points every second round bonus screen played first screen requires player defeat group wolves using meat second awards points shooting fruits thrown wolves two screens alternate level player loses one life mama pig hit rock eaten wolf ladders first round crushed boulder many wolves reach cliff push edge second round lives lost game ends game starts day met bear heard opening scene wolves kidnap mama babies first stage theme bears slight resemblance main theme music frogger another konami arcade game song part desecration rag operatic nightmare felix arndt portion mimics beginning antonín dvořák humoresque opus 101 number 7 second stage cleared second time part oh susanna heard pooyan included compilation disc konami 80 arcade gallery playstation emulated version game released 2006 playstation 2 japan part oretachi geasen zoku sono -series famicom port released virtual console japan series extra ops known pooyan missions involves shooting fulton surface-to-air recovery balloons carrying abducted soldiers air sound effects music arcade game used throughout mission largely identical bootleg sold name pootan david hanzman rochester ny usa scored world record 1,609,250 points arcade version pooyan december 16 1983 | [
1237,
7388
] | Test |
3,191 | 2 | 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 | [
3932,
3256,
2182,
3613,
4670,
5021,
13,
7528,
3271,
7532,
3626,
5738,
5041,
5744,
6443,
7550,
405,
2942,
6117,
4341,
5762,
412,
415,
65,
3666,
5783,
2970,
5088,
6500,
785,
2266,
788,
7956,
1522,
5453,
7605,
4759,
5460,
7242,
1535,
1924,... | Test |
3,192 | 4 | Linux_Spike_Trojan_malware:linux spike trojan malware linux spike trojan malware widely known mrblack type malware infects routers eventually spreads routers incapsula internet security firm first saw malware december 2014 tool prone attack devices still use default credentials bot type malware allows attacker take control affected computer also known web robots bots usually part network infected machines known botnet typically made victim machines stretch across globe router infected attack injects malware order configure ddos attacks used mitm attacks cookie hijacking attacks targeted router infected mrblack regarded one widespread malware varieties infecting forty thousand routers | [
2789,
1691,
3426,
57,
578,
2535,
2693
] | Train |
3,193 | 3 | Socket_1:socket 1 socket 1 originally called overdrive socket second series standard cpu sockets created intel various x86 microprocessors inserted upgrade intel first standard 168-pin pin grid array pga socket first official designation socket 1 intended 486 upgrade socket added one extra pin prevent upgrade chips inserted incorrectly socket 1 169-pin low insertion force lif zero insertion force zif 17×17 pin grid array pga socket suitable 5-volt 16 33 mhz 486 sx 486 dx 486 dx2 486 overdrive processors | [
2541,
4123,
3849,
2997,
1729,
2828,
6173,
7974,
2830,
3002,
4314,
5379,
1841,
1645,
3203,
2036,
4968,
3385,
4972,
5853,
2685,
6935,
8021,
7302,
5963,
866,
3333,
7134,
262,
352,
6683,
5886
] | Test |
3,194 | 3 | Multikernel:multikernel multikernel operating system treats multi-core machine network independent cores distributed system assume shared memory rather implements inter-process communications message-passing | [
1522,
7325,
7605,
280,
2818,
4759,
190,
4670,
5021,
8066,
8167,
4397,
13,
5644,
3271,
5116,
6984,
299,
3531,
3626,
7142,
5571,
2300,
5041,
7827,
7453,
4786,
578,
7550,
4244,
5232,
1992,
405,
6367,
6922,
8115,
5161,
5865,
7396,
65,
861,
... | Test |
3,195 | 7 | PSSC_Labs:pssc labs pssc labs california-based company provides supercomputing solutions united states internationally products include high-performance servers clusters workstations raid storage systems scientific research government military entertainment content creators developers private clouds company implemented clustering software nasa goddard beowulf project supercomputers designed bioinformatics medical imaging computational chemistry scientific applications pssc labs founded 1984 larry lesser 1998 manufactured aeneas supercomputer dr. herbert hamber university california irvine physics astronomy department based linux maximum speed 20.1 gigaflops 2001 company developed cbest software packages utilities custom scripts used ease cluster administration process 2003 company released third version cluster management software support 32-bit 64-bit amd intel processors linux kernel open source tools 2005 pssc labs demonstrated new water-cooling technology high-performance computers acm/ieee supercomputing conference seattle washington 2007 company focused supercomputer development life sciences researchers announced technological solution full-genome data analysis including assembly read mapping analysis large amounts high-throughput dna rna sequencing data 2008 pssc labs designed powerserve quattro i/a 4000 supercomputer genome sequencing 2013 released cloudoop server platform big data analytics hadoop server offers 50tb storage space 1ru company joined cloudera partner program following year certified cloudoop 12000 2014 compatible cloudera enterprise 5 year mapr started using cloudoop 12000 platform record setting time series data base ingestion rate company joined hortonworks partner program 2015 company cloudoop 12000 certified compatible hortonworks hdp 2.2 | [
2008,
5889,
578
] | Test |
3,196 | 3 | Ultima_III:_Exodus:ultima iii exodus ultima iii exodus third game series ultima role-playing video games exodus also name game principal antagonist final installment age darkness trilogy released 1983 first ultima game published origin systems originally developed apple ii exodus eventually ported 13 platforms including nes/famicom remake ultima iii revolves around exodus spawn mondain minax ultima ultima ii respectively threatening world sosaria player travels sosaria defeat exodus restore world peace ultima iii hosts advances graphics particularly animation adds musical score increases player options gameplay larger party interactivity game world ultima iii followed 1985 exodus featured revolutionary graphics time one first computer rpgs display animated characters also exodus differs previous games players direct actions party four characters rather one regular play characters represented single player icon move one however battle mode character represented separately tactical battle screen player alternates commands character order followed enemy character turn differs two previous games ultima series player simply depicted trading blows one opponent main map either defeated enemies overworld map seen least temporarily avoided enemies dungeons appear randomly without forewarning party four player uses chosen beginning game choice 11 classes fighter paladin cleric wizard ranger thief barbarian lark illusionist druid alchemist player also chooses among five races human elf dwarf bobbit fuzzy players assign points statistics strength dexterity intelligence wisdom races determine limitations maximum stat growth thus case intelligence wisdom maximum spellcasting ability character classes differ terms fighting skill magical abilities thieving abilities varying degrees proficiency fighters example use weapons armor lack thieving magic abilities clerics use maces chain armor clerical spells alchemists use daggers cloth armor half wizard spells half thieving abilities character begins level 1 increases individually maximum effective level characters 25 beyond point level continue increase however number hit points fixed 2550 maximum hit points character calculated following formula hp 100 l 50 l current level character character gained enough experience points must transact lord british character level aside ability talk townspeople commands used commands player use bribe steal fight bribing used make certain guards go away post steal used townspeople enemies result conflict townspeople caught player choose fight townsperson prompt guards chase characters always come parties eight difficult defeat also choose fight lord british killed thus resulting long drawn-out fight player ultimately lose lord british temporarily killed cannon fire ship castle moat exiting re-entering castle restores unlike two previous ultima games wire-frame first-person dungeons exodus dungeons solid-3d appearance integrated game plot dungeons necessary obtain certain marks needed finish game dungeon 8 levels deeper level challenging enemies note monsters spawned dungeons based character level overworld monsters rather based dungeon level encountered going deep certain dungeons may hard characters early stages game one find many chests gold weapons armor inside dungeons many trapped aside chests marks one find fountains dungeons heal cure poison peering gems allows see map given dungeon level torches light-casting spells necessary able see inside dungeons three modes travel game foot horseback boat getting around foot slow often lead monsters catching horseback gives advantage moving faster consuming less food making getting away unwanted fights easier getting boat requires players reach certain level pirate ships begin appearing pirate ship defeated boat belongs player obtaining boat necessary order visit island ambrosia reach exodus thus win game denying player ability see behind mountain peaks forests walls overland maps contain many small surprises hidden treasure secret paths out-of-the-way informants look game longer based certain characteristics apple ii hardware rather carefully designed screen layout beating game requires player get four marks four prayer cards get altar exodus insert cards particular order thus defeat exodus set earth story exodus returns player sosaria world game named chief villain exodus creation minax mondain series later describes neither human machine although demonic figure appears cover game exodus turns something like computer possibly artificial intelligence defeat player acquire four magic punch cards insert mainframe specific order beginning game exodus terrorizing land sosaria stronghold isle fire player summoned lord british defeat exodus embarks quest takes lost land ambrosia depths dungeons sosaria receive powerful magical branding marks find mysterious time lord finally isle fire confront exodus lair game ends immediately upon exodus defeat unlike many games genre exodus simply killed battle strong party adventurers puzzle-solving paying attention clues given throughout game end game players instructed report thy victory origin received certificate completion autographed richard garriott although last game series take place sosaria places game ambrosia isle fire make appearances later games ultima vii ultima online ultima iii first game series published richard garriott company origin systems ports appeared many different systems 120,000 copies ultima iii sold video magazine listed game seventh list best selling video games march 1985 ii computing listing fifth magazine list top apple ii games late 1985 based sales market-share data exodus credited game laid foundation role-playing video game genre influencing games dragon quest final fantasy turn exodus influenced wizardry richard garriot credited inspiration behind party-based combat game computer gaming world stated february 1994 exodus game became known ultima hundreds thousands cartridge gamers softline stated ultima iii far surpasses predecessors praising masterfully unified plot individual tactical combat magazine concluded game upgrades market several ways sets new standards fantasy gaming state art happily also shows us maturing artistic discipline part imaginative author computer gaming world scorpia 1983 called ultima iii unquestionably best series far ... many hours enjoyment frustration although criticized ending anticlimactic magazine patricia fitzgibbons 1985 reviewed macintosh version complimented graphics criticized audio stated game adequately use computer user interface describing using mouse aggravating fitzgibbons concluded even though mac conversion far ideal ultima iii enjoyable game well worth hefty price 1993 scorpia stated ultima iii best first trilogy surprisingly quiet nonviolent defeat villain presaged later games resolutions less combative spirit magazine stated february 1994 exodus really first ultima coherent plot beyond typical dungeon romp compute 1984 stated ultima iii ushers exciting new era fantasy role-playing combination superb graphics music excellent playability makes exodus modern-day masterpiece noted cloth map extensive documentation thrilling 3-d dungeons game use time spell system magazine concluded lord british outdone latest work art ... delight play info stated lord british latest offering also best ... many wonderful hours spent unravelling secrets magazine gave amiga version four stars compared five stars 64 version stating graphics user interface could better amiga-tized chicago tribune called ultima iii one best computer games providing epic adventure last months famitsu reviewed 1987 famicom remake scored 32 40 1984 softline readers named game third most-popular apple eighth most-popular atari program 1983 adventure game year prize computer gaming world nowiki /nowiki 1985 reader poll editors wrote although ultima iii well year feel still best game kind score 7.55 10 1988 ultima iii among first members computer gaming world hall fame honoring games rated highly time readers 1996 magazine ranked 144th best game time featuring one nastiest villains grace computer screen demon figure appeared front box caused religious fundamentalists protest made accusations game corrupting youth america encouraging satan worshiping along factors led richard garriott develop next game based virtues ultima series became famous | [
4907,
6380,
3197,
3199,
3202
] | Validation |
3,197 | 3 | Ultima_I:_The_First_Age_of_Darkness:ultima first age darkness ultima later known ultima first age darkness simply ultima first game ultima series role-playing video games created richard garriott originally released apple ii first published united states california pacific computer company registered copyright game september 2 1980 officially released june 1981 since release game completely re-coded ported many different platforms 1986 re-code ultima commonly known available version game ultima revolves around quest find destroy gem immortality used evil wizard mondain enslave lands sosaria gem possession killed minions roam terrorize countryside player takes role stranger individual summoned another world end rule mondain game follows endeavors stranger task involves progressing many aspects game play including dungeon crawling space travel game one first definitive commercial computer rpgs considered important influential turning point development genre throughout years come addition influences rpg genre also first open-world computer game world ultima presented variety different ways overworld projected topdown third-person view dungeons displayed first-person one-point perspective scenarios player character controlled keyboard directional arrows shortcut keys used commands attack b board character creation start ultima unlike simplified version traditional tabletop role-playing games player presented number points distribute various statistics affect competence certain aspects gameplay example adding points strength statistic increase amount damage inflicted foe adding points charisma results cheaper deals merchants portion character creation completed player given choice four races human elf dwarf bobbit hobbit-like creature depending race picked points added various statistics e.g elves receive points agility statistic dwarves receive strength points race chosen player given list four classes choose distribute additional points appropriate statistics classes fighter cleric wizard thief player also asked choose gender player character though stat difference simple sprite character looks four statistics used gameplay hit points food experience points coin gold original release hit points determine health character fewer hp character closer death hit points obtained variety ways including acts emerging alive dungeon giving tribute payment one eight lords sosaria food consumed every two tiles character moves except castles towns food supply drops zero character die food bought towns prevent situation occurring experience points received successfully battle monsters determine character levels one thousand points needed progress new level vital item near end game obtained player reached eighth level coin used buy things game world weapons spells food obtained defeating monsters rescuing princesses castles game also sports arcade-like first-person space shooter section gameplay element appeared ultima subsequent games series player participates real-time space combat environment confronted enemy spaceships must shoot order progress along story richard garriott says added wanted fill every space disk everything possibly could ultima set fictional world sosaria land broken four different continents land ruled total eight different lords two world four land masses four continents contain two castles quests obtained player two types quests given castles—one entails visiting certain location main map killing specific type monster dungeons fulfilling former type quest gives stat boosts latter gains player important item needed reach endgame also variety towns different goods services purchased world dungeons explored populated forests mountain ranges lakes oceans towns exactly alike original release game dungeons maps different designed rather randomly created castles differ different quests may assigned 1986 remake variety added appearance content towns castles sosaria inhabited numerous monsters beasts attack player character sight also ruins places interest continent usually somewhat hard-to-reach places small islands player enter order receive rewards usually form weapon statistic boost order solve quests two main characters featured ultima mondain evil wizard antagonist induced reign terror world sosaria protagonist character player choosing game features lord british richard garriott first game akalabeth introduction characters iolo shamino three characters become staples nearly future ultima games see list ultima characters story ultima revolves around evil wizard mondain rule kingdom sosaria according game back story mondain created evil gem 1000 years ago granted immortality since mondain released monsters beasts upon land ravage villages towns sosaria cause nobles bicker amongst effort stop mondain dominion lord british searches person bring wizard end call answered player player informed way defeat mondain travel back time kill gem immortality created majority game spent searching time machine way activate four lords game one realm hold gem allow time machine work four gems found exchange gem lord ask player complete quest involves traveling dungeon killing specific creature achieved lord hand gem time machine also needs found purchasing space shuttle traveling outer space prerequisite —the player must become space ace destroying 20 enemy ships order complete game task completed rescuing princess reveal location time machine always appears north castle princess held prisoner main character travel back time face mondain completed gem immortality destroying gem requirement beating game well killing wizard mondain dead player transported one thousand years future rewarded lord british richard garriott started development ultima unexpected success previous game large sections akalabeth used subroutines within ultima create first-person dungeon sections game towns quests plot user interface added original akalabeth code ultima completed star wars elements also added including spaceships lightsabers development ultima done garriott freshman year university texas help friend ken w. arnold finished less year ultima coded applesoft basic apple ii computer arnold wrote code assembly language tile-based graphics system first game genre unlike akalabeth commercial sale afterthought hobbyist endeavor ultima approached much professional attitude right start project game first planned called ultimatum discovered name already use board game company shortened ultima garriott later commented title wrote first game course idea would ever second california pacific computer company published ultima 1981 apple ii june 1982 sold 20,000 copies went sell 50,000 copies sierra online re-released ultima atari 8-bit computers 1986 origin systems completely re-coded game assembly re-released 1986 remake re-coded entirely assembly significantly improved running speed able handle superior graphics small cosmetic changes content also made addition another castle map variant three new city maps introduction traveling monsters outdoors section division money player separate copper silver gold coins first released apple ii december 23 1986 ultima first age darkness ports commodore 64 dos/ega also released many subsequent releases made later years including 1989 version msx2 published japan pony canyon well apple ii specific port late 1994 vitesse 1997 dos/ega version ultima released electronic arts part ultima collection softline stated 1981 ultima seems best available apple ii role-playing game magazine called graphics impressive concluded retails 39.95 well worth price computer gaming world 1991 1993 called game truly epic scope stating among first outdoor settings npc conversations noting unbalanced combat system magazine concluded ultima classic missed | [
3196,
3199,
3202,
3796,
336
] | Test |
3,198 | 2 | Repair_permissions:repair permissions repairing disk permissions troubleshooting activity commonly associated macos operating system apple efficacy repairing permissions troubleshoot application errors debated bsd layer macos responsible file-system security including management unix posix permissions model applications depend correct assignment interpretation permissions order function properly repairing permissions involves checking permissions set files folders volume macos installed list correct posix permissions correcting discrepancies list correct permissions compiled consulting various bill-of-materials .bom files typically files stored within reduced-size installer package .pkg files receipts folder local library directory /library/receipts volume checked whenever user installs software uses macos installer package format bill-of-materials file created consulted future permission repair files whose permissions incorrectly altered administrator administrator operating root privileges poorly designed installer package installed similar privileges cause wide array problems ranging application errors inability boot macos repairing permissions become necessary become increasingly less versions panther 10.3 os x el capitan apple introduced security feature called system integrity protection enabled root privileges longer able change system files folders including permissions permissions repairs instead performed automatically upon system installs updates end disk utility well corresponding diskutil command-line utility lost ability repair permissions systems prior os x el capitan permissions repair performed selecting startup volume clicking repair disk permissions button first aid section disk utility operation also performed using diskutil command-line utility el capitan user instead use two command-line utilities pkgutil repair particular packages /usr/libexec/repair_packages repair standard set system packages cases user disable system integrity protection change permissions system files directories macos sierra /usr/libexec/repair_packages available permissions also repaired using third-party utilities apotek applejack prosoft engineering drive genius | [
1047,
569,
5571,
7000,
4376
] | Train |
3,199 | 3 | Ultima_II:_The_Revenge_of_the_Enchantress:ultima ii revenge enchantress ultima ii revenge enchantress released august 24 1982 apple ii usco pa-317-502 second role-playing video game ultima series second installment ultima age darkness trilogy also official ultima game published sierra on-line controversy sierra royalties pc port game led series creator richard garriott start company origin systems plot ultima ii revolves around evil enchantress minax taking world exacting revenge player player defeat mondain player travels time acquire means defeat minax restore world peace ultima ii larger game world ultima hosts advances graphics gameplay gameplay similar previous game series scope game bigger several places explore even though like solar system planets dungeons towers required complete game game player travel several different time periods earth using time doors periods time legends mythological period pangea 300 250 million years ago b.c 1423 dawn civilization a.d. 1990 aftermath 2112 player also travel space planets solar system visited game story player learns lover dark wizard mondain enchantress minax threatening earth disturbances space-time continuum player must guide hero time solar system order defeat evil plot young minax survived mentor lover death hands stranger went hiding several years later minax got older powerful mondain minax wanted avenge death lover used time doors created mondain defeat travel time legends place located origin times sent evil minions different time eras also used dark powers disturb fabric time influence men ultimately destroyed far future nearly wiping humanity lord british called hero crush minax evil plans stranger answered british call game begins stranger starting quest defeat minax minax castle named shadow guard reached time doors similar moongates later games even enchanted ring required pass force fields inside hero hunts sorceress time legends pursues teleports throughout castle destroys quicksword enilno even though ultima set fictional land sosaria ultima ii borrowed characters story ultima relocated earth garriott explained narrative perspective earth needed used basis comparison due time travel element later games ultima series ret-conned assumed ultima ii actually happened sosaria earth create continuity among games ultima ii garriott first program wrote completely assembly language instead interpreted basic playing speed reaction time vastly improved original release ultima since garriott attending university texas time took almost two years create ultima ii including learning assembly one month tom luhrs author popular apple ii arcade game apple-oids ultima ii first game series include cloth map inside box would become staple franchise map illustrated time doors linked inspired one seen film time bandits time doors california pacific computer published garriott first two games financial difficulties pay full royalties publishers approached garriott insisted including map sierra on-line agreed provided garriott left university technical assistance developed first major assembly-language project two versions map produced first version heavier thicker material map found large boxed 8 x11 apple ii atari 800 versions game later production runs game featured much smaller box lighter weight map despite reservations richard garriott chuck bueche original apple ii version game copy-protected using sierra new spiradisc system original apple ultima ii received audiovisual upgrade 1989 bringing graphics date recent games series much done ultima enhanced version available part ultima trilogy i-ii-iii box set released year discontinued months later commodore ibm versions ultima trilogy include original unenhanced versions game respective platforms game re-released several times later cd-rom pc compilations including 1998 ultima collection re-releases missing necessary map files planets earth however map planet x intact game still winnable modern fast computers also generate divide zero error attempting run game issues addressed fan patches created voyager dragon fan series available website exodus project game known run without errors acceptable speed dosbox environment provided missing map files present ultima ii first game series officially ported platforms apple ii atari version released late 1983 several months apple original requires atari 800 810 disk drive game mostly direct port apple ii utilizing computer high resolution graphics works similar manner apple ii hgr mode otherwise take advantage atari advanced features c64 port apparently released programmer credited bobbit could finish consequence missing gameplay elements also simplified title screen text characters instead dragon graphic versions otherwise commodore 64 version takes advantage platform advanced graphics sound ibm version ultima ii dos game run self-booting disk unusual game released 1983 supports cga graphics pc speaker sound also uses cpu timing hence run fast anything except 8088 pc ultima ii designed dos 1.x support subdirectories save games must directory game files pc port also prone generating divide zero errors crashing dos prompt 1985 sierra released port ultima ii macintosh 128/512 along ultima iii would classic ultima games available macintosh family game compatible mac os versions system 6 run system 7.5 patch atari st port one earliest commercially released games system coming shortly computer june 1985 launch utilizes mostly simple block graphics little enhancement st hardware capabilities runs within tos self-booting disk atari st games softline 1983 stated ultima ii continues interplanetary saga creative programming flair far beyond scope fantasy adventure games magazine concluded lord british another greater hit hands ... ultimate real-time type fantasy games micro computer gaming world 1983 gave ultima ii positive review noting many improvements predecessor particularly amount detail magazine praised large size game world even though little necessary complete game suggesting additional scenarios would added leading ultimate quest 1991 1993 magazine scorpia called good sequel original game k-power gave game 7 points 10 magazine described animated graphic adventure game stated ultima ii sophisticated quicker pace predecessor fascinating world concluded game unique storyline original pc magazine gave ultima ii 15.5 points 18 also praising game great big wonderful world ultima ii sold 50,000 1982 100,000 copies date nominated best adventure game home computer 1983 origins game fair losing knight diamonds | [
3196,
7288,
3197,
3202,
336
] | Validation |
3,200 | 3 | Link_register:link register link register special-purpose register holds address return function call completes efficient traditional scheme storing return addressed call stack sometimes called machine stack link register require writes reads memory containing stack save considerable percentage execution time repeated calls small subroutines link register used many instruction set architectures powerpc arm pa-risc architectures sparc register purpose another name case output register 7 o7 usage link register general-purpose register done instruction set architectures allows faster calls leaf subroutines subroutine non-leaf passing return address register still result generation efficient code thunks e.g function whose sole purpose call another function arguments rearranged way subroutines benefit use link register saved batch callee-used registers—e.g arm subroutine pushes registers 4-7 along link register lr single instruction codice_1 pipelining memory writes required | [
3747,
6236,
971
] | Validation |
3,201 | 2 | Job_Entry_Subsystem_2/3:job entry subsystem 2/3 job entry subsystem jes component ibm mainframe operating systems responsible managing batch workloads modern times two distinct implementations job entry system called jes2 jes3 designed provide efficient execution batch jobs job processing divided several phases provide parallelism pipelining phases include input processing jobs read interpreted execution phase jobs run output processing job output printed stored dasd jobs phase execution usually said reside particular queue example jobs currently executing execution queue improve i/o efficiency jes performs spooling provides multiple jobs simultaneous access common storage volume jes uses structure called checkpoint backup information currently executing jobs associated output checkpoint used restore jobs output event unexpected hardware software failures although jes2 jes3 provide core functionality certain features may present one jes differences one jes may favored certain customer installations jcl used define jobs jes2 jes3 small changes usually need made jcl get job written one jes run os/360 batch job processing limited operational flexibility performance addressed two field-developed packages called houston automatic spooling priority hasp attached support processor asp hasp developed ibm federal systems division contractors johnson space center houston originally managed job scheduling print punch output single os/360 computer multi access spool capability added let peer computers share common job queue print/punch output queues introduction system/370 1972 ibm rewrote hasp become standard part system renamed job entry subsystem 2 jes2 introduced os/vs2 release 2 also known mvs 1973 many years hasp labels removed source code messages issued jes2 still prefixed codice_1 several jes2 commands continue support specification either codice_2 codice_3 maintain backwards compatibility asp initially stood attached support processor developed provide efficient use multiple os/360 systems shared workload allowed one central system distribute jobs multiple connected systems asp announced march 1967 year reported running stably asp evolved design 7094/7044 direct coupled system using data channel data channel communication attaching ibm 7044 peripheral processor throughput doubled typical asp configuration small mainframe 360/40 called support system controlled one 360/65 larger processors called main systems computers connected selector channels host attached channel-to-channel adapters early form short distance point-to-point computer networking asp required purchase additional computer manage input output hosts running job workload economically justified high cost standalone byte-multiplexor channels needed drive printers punched card reader devices 360/50 smaller systems built-in byte multiplexor channel whereas faster 360/65 larger systems required relatively expensive standalone unit using asp made possible avoid cost byte multiplexor channel offloading job scheduling print card handling also offloaded functions larger machines increased reliability another advantage offset added hardware cost one main systems could fail taken offline maintenance without taking whole complex asp primarily targeted large government agencies defense contractors might many six 360/65s scheduled managed separate asp machine uncommon variant local asp lasp single large machine asp functions running machine 1970s notable installation asp princeton university controlling ibm 360/91 mainframe 1973 ibm rewrote asp renamed jes3 supporting mvs also jes os/vs1 often referred jes1 addition master mstr subsystem built modern z/os operating system start jobs run outside control jes including primary jes source code provided ibm customers asp hasp many customers made substantial enhancements programs incorporated official product far installations made use hasp asp contemporary z/os systems many jes2 installations jes3 unique history ibm continues ship jes2 jes3 source code instead object code unlike components operating system improve maintainability serviceability user-written enhancements jes provides set exit points pass control jes user programs key points processing extensions provide custom functionality special commands custom print page headings non-standard job processing 2017 ibm released statement direction jes2 strategic jes meaning future development efforts focused jes2 rather jes3 ibm reassured customers jes3 continue supported end-of-support date announced february 2019 ibm announced z/os 2.5 expected released 2021 last version z/os include jes3 | [
7783,
7858,
5606,
4428,
5502,
2769,
312,
6841,
1516
] | Test |
3,202 | 3 | Ultima_IV:_Quest_of_the_Avatar:ultima iv quest avatar ultima iv quest avatar first released 1985 apple ii fourth series ultima role-playing video games first age enlightenment trilogy shifting series hack slash dungeon crawl gameplay age darkness predecessors towards ethically-nuanced story-driven approach ultima iv much larger game world predecessors overworld map sixteen times size ultima iii puzzle-filled dungeon rooms explore ultima iv advances franchise dialog improvements new means travel exploration world interactivity 1996 computer gaming world named ultima iv 2 best games time list pc designer richard garriott considers game among favorites ultima series ultima iv followed release 1988 ultima iv among computer role-playing games perhaps first game story center asking player overcome tangible ultimate evil defeat members triad evil previous three ultima games world sosaria underwent radical changes geography three quarters world disappeared continents rose sank new cities built replace ones lost eventually world unified lord british rule renamed britannia lord british felt people lacked purpose great struggles triad concerned spiritual well-being unfamiliar new age relative peace proclaimed quest avatar needed someone step forth become shining example others follow unlike rpgs game set age darkness prosperous britannia resembles renaissance italy king arthur camelot object game focus main character development virtuous life—possible land peace—and become spiritual leader example people world britannia game follows protagonist struggle understand exercise eight virtues proving understanding virtues locating several artifacts finally descending dungeon called stygian abyss gain access codex ultimate wisdom protagonist becomes avatar conversely actions game could remove character gained virtues distancing construction truth love courage greater axiom infinity—all required complete game though avatarhood exclusive one chosen person hero remains known avatar throughout later games time passes increasingly regarded myth instead simply choosing stats assign points first three ultima games players asked various ethical dilemmas gypsy fortune-teller using remotely tarot-like cards eight virtues situations one correct resolution rather players must rank eight virtues whichever stands highest priority determines type character play example choosing compassion creates bard honor paladin sacrifice tinker also first ultima playing human necessary eliminating races elves dwarves bobbits found previous games however even first three ultima could chosen player characters never non-player characters non-human races although profession embodies particular virtue become avatar player must achieve enlightenment eight virtues virtue affects npcs interact player enlightenment virtues achieved player actions well meditation shrines shrines virtues scattered britannia requiring player possess corresponding virtue rune allowing entry meditation correctly repeating virtue mantra three times shrine player gains insight ultimately enlightenment virtue seer hawkwind lord british castle provides player feedback progress virtues offering advice actions improve standing eight virtues informing ready visit shrine elevation chastising character hath strayed far path avatar player may encouraged give alms poor improve sacrifice never flee battle improve honor players equally able lower virtue in-game actions stealing crops food lowering honesty selecting bragging response dialog certain characters lowers humility actions minor effect virtue progress certain actions immediate devastating effect player progress multiple virtues attacking npc sleep technically game similar although much larger first ultima feature real conversation system whereas npcs earlier games would give one canned answer talked players could interact specifying subject conversation subject determined either standard set questions name job health information gleaned previous answers characters many sub-quests arranged around users playing game second time could save considerable time knowing answers key questions frequently required travel another city talk another npc least one case player asked sent may require yet another round trip cities another addition dungeon rooms uniquely designed combat areas dungeons supplemented standard combat randomly appearing enemies ultima iv open world game quests completed order fetch quests although turn-based game clock runs game running player act npcs monsters may move time passes time important aspect game certain actions performed certain times world britannia first introduced full world map series greatly change later games player may travel britannia foot horseback across sea ship air lighter air device speed ease travel affected mode travel well terrain wind eight virtues avatar relationship three principles truth love courage gameplay designed around follows richard garriott stated receive customer feedback first three games neither california pacific computer sierra on-line forwarded mail company released ultima iii garriott—who attended interdenominational christian sunday school teenager—realized partly letters enraged parents earlier games immoral actions like stealing murder peaceful citizens necessary least useful actions order win game features might objectionable garriott stated wanted become good storyteller make certain story content 90 games including first three ultima games called go kill evil bad guy stories said ultima iv first one ethical overtones also better told story shay addams garriott official biographer wrote decided people going look hidden meaning work n't even exist would introduce ideas symbols meaning significance deemed worthwhile give something could really think encourage sense responsibility character actions players intended feel playing transported fantasy realm separate person garriott removed gameplay elements believed would prevent players identifying personally character playing non-human retrospect 1up.com described ultima iv direct barb self-appointed moral crusaders sought demonize rpgs complained irony seeing 'evil rpg better present christian admonition back faith works quiet modesty bible-waving watchdog decrying medium seems lost game moral dilemmas designed give players opportunity reap temporary rewards amoral behavior realize later penalized garriott hoped would approach later dilemmas thoughtfulness near end game took advantage encourage players overthink puzzles question morality choices one point players seemingly required murder innocents revealed demons disguise though one playtester threatened quit dilemma garriott refused remove game reasoning served purpose provoking emotional response concept virtues inspired tv show avatars hindu mythology described avatars master 16 different virtues eight virtues used game derived combinations truth love courage set motivators garriott found worked best also found one favorite films wizard oz game took two years develop twice garriott described playtesting slightly rushed make christmas season one finish playing game time went publishing like contemporary origin games ultima iv developed apple ii series ported computers partially garriott apple ii user/coder partially developing games first made ports easier garriott said 1984 commodore 64 atari 8-bit sprites hardware sound chips made porting apple far difficult perhaps even impossible ... apple version never get done like previous games ultima iv permit saving dungeons technical limitations garriott described non-trivial ankh used onward symbol avatar virtuous path chosen garriott saw film logan run like previous ultima richard garriott wrote core code however games getting complex one person handle required call outside assistance programming tasks familiar music optimized disk routines ultima iv first game series require 64k apple ii primarily targeted newer apple iie iic although still capable running apple ii+ language card used boost system 64k garriott still using ii+ time happened ultima iii ultima iv also included support mockingboard sound card enabled apple ii users 3-voice music custom disk routines allowed ultima iv faster disk access previous games also important growing size game caused use two floppy disks instead one dialog two npcs apple ii release accidentally entered leaving default test states one npcs elusive game provided player final answer would require complete game character responding properly players forced guess correct answer find sources outside game complete bug would later acknowledged ultima v npc appears admits mistake player c64 port first series take full advantage computer hardware rather simply converting sound graphics apple ii include in-game music came two 1541 disks like apple ii side 1 disk 1 labeled program copy protected disk sides overworld town dungeon user instructed make backups ultima iv also added support two disk drives case user would keep overworld side disk 1 drive 0 flip town/dungeon disk needed drive 1 overworld disk also used load/save player progress one biggest criticisms c64 port lack disk fast loader made extremely slow disk access speed-optimized disk routines apple version ultima iv final game series ported atari 8-bit family game still designed support 48k atari 800 even though four models 64k/128k atari 8-bit computers released one 64k-upgradable model starting two half years earlier order fit game 48k atari 8-bit version cut music support reason 48k made requirement instead 64k requirement apple ii version whereas earliest apple ii models upgradable 64k atari 400/800 officially upgradable 48k since apple version programmed require 64k apple 6502 code ported create atari 8-bit commodore 64 version would required extra programming selectively use 48k/64k including music support 64k machines since atari 8-bit market smallest installed bases game initially released special support provided similar reasons game distributed earliest 90k atari 810 disk format require disk drive upgrade players thus occupies four disks instead two disks apple ii commodore 64 versions similar c64 port ibm version ultima iv released two years 8-bit versions takes proper advantage hardware first time instead rushed conversion apple ii ega tandy graphics support added well proper hard disk support game finally supported dos 2.x subdirectories however music ibm version even though tandy 1000 series 3-voice sound chip atari st version ultima iv released 1987 amiga version 1988 extremely similar pc port fully utilize machines respective hardware features particular amiga version 16-color graphics although amiga could display 64 screen without using copper processor make color palette changes however atari st version support midi music one could play music connected midi synthesizer sampler ports made use mouse limited use native operating system windowing environment mouse cursor support dialog boxes requesting disks etc. like ultima iii ultima iv released nes fci pony canyon version titled ultima quest avatar released 1990 nes port ultima iv different versions graphics completely redone music dialogue options greatly reduced among gameplay changes player seven recruitable characters player party time one could versions character four player could would stay hostel castle britannia requiring player return change characters however combat system fairly close personal computer games additional option use automated combat additionally spell-casting simplified removing need mix spells puzzles removed well port also replaced character julia tinker male character named julius changes done memory limitations single cartridge instead multiple floppy diskettes ultima iv quest avatar master system ultima ported sega platform released 1990 ported published sega port features completely re-drawn graphics although unlike nes port style retained origin version simpler conversation system unlike nes version uses regular ultima iv background music although master system easily capable displaying complex first-person scenes found ultima iv see phantasy star version dungeons viewed top-down perspective much like ultima vi released year seems cartridges produced european market contain multi-lingual english french german manual books original version well folded paper map books different colour three editions blue uk version fully translated fit inside game box graphical error version gypsy picture man mustache even though gypsy referred throughout text xu4 cross-platform game engine recreation ultima iv development dreamcast linux mac os x risc os windows two remakes using neverwinter nights engine online version written adobe flash march 2011 electronic arts sent dmca cease desist notice fan project 2015 also fan-made remaster project commodore 64 version game released source code github addressing bugs improving aspects game ultima iv available free gog.com publisher ip owner electronic arts released game freeware 2011 promote free-to-play remake would release 2013 garriott stated 1985 interview working ultima iv part 2 ultima v ultima v appeared global sales ultima iv surpassed 400,000 copies mid-1989 scorpia computer gaming world 1986 called incredible game criticizing fact experience came combat stated became tedious scorpia concluded waiting classic ... go get game became first replace —the top-rated adventure game five years—in magazine reader poll named ultima iv game year 1986 1987 scorpia cited ultima iv taking genre away hack slash— first time crpg whose focus character development many monsters kill much loot pick —in 1991 1993 called favorite game 1994 stated maybe nothing ever surpass retiring reviewing games called all-time number one favorite rpg june 1986 dragon hartley pattie lesser called ultima iv impressive complex adventure date total adventuring environment takes place across entire continent september 1986 issue mike gray lauded game best computer simulation true fantasy role-playing experience ever seen apple ii commodore 64 128 treasure hoard computer frp games complete unless get hands one praised ultima iv incredible find store ’ pass ... ’ discouraged takes find copy — search easy one compared awaits start quest avatar famitsu reviewed nes/famicom version scored 31 40 ultima iv top game billboard list software best sellers february march 1986 co-creator dave arneson 1988 wrote ultima iv games stood pretty much alone quirks instead trend setters crpg industry games follow innovations score 7.80 10 1988 ultima iv among first members computer gaming world hall fame games rated highly time readers 1990 game received third-highest number votes survey readers all-time favorites 1996 magazine ranked second-best video game time second most-innovative computer game 2013 ign placed ultima iv 26 list top 100 rpgs time 2015 peter tieryas tor.com stated nes version represented different type ideal ... make narrative determine course journey engendering sense immersion effect making feel like control previous rpg | [
4759,
3196,
3197,
3199,
7848,
578
] | Validation |
3,203 | 3 | Socket_2:socket 2 socket 2 one series cpu sockets various x86 microprocessors inserted updated socket 1 added support pentium overdrive processors socket 2 238-pin low insertion force lif zero insertion force zif 19×19 pin grid array pga socket suitable 5-volt 25 66 mhz 486 sx 486 dx 486 dx2 486 overdrive 63 83 mhz pentium overdrive processors | [
4123,
6170,
2997,
1729,
2828,
6173,
7974,
2830,
3002,
4314,
5379,
3193,
1841,
1645,
2036,
4968,
3385,
4972,
5853,
2685,
6935,
8021,
7302,
5963,
866,
3333,
7134,
262,
352,
6683,
5886
] | Test |
3,204 | 7 | Apache_Hama:apache hama apache hama distributed computing framework based bulk synchronous parallel computing techniques massive scientific computations e.g. matrix graph network algorithms top level project apache software foundation created edward j. yoon named short hadoop matrix inspired google pregel large-scale graph computing framework described 2010 hama also means hippopotamus korean language 하마 following trend naming apache projects animals zoology apache pig hama consists three major components bspmaster groomservers zookeeper bspmaster responsible bsp master multiple grooms started script bsp master starts rpc server groom servers groom servers starts bsppeer instance rpc proxy contact bsp master started groom periodically sends heartbeat message encloses groom server status including maximum task capacity unused memory time bsp master receives heartbeat message brings up-to-date groom server status bsp master makes use groom servers status order effectively assign tasks idle groom servers returns heartbeat response contains assigned tasks others actions groom server fifo job scheduler simple task assignment algorithms groom server shortly referred groom process performs bsp tasks assigned bspmaster groom contacts bspmaster takes assigned tasks reports status means periodical piggybacks bspmaster groom designed run hdfs distributed storages basically groom server data node run one physical node zookeeper used manage efficient barrier synchronisation bsppeers | [
7238,
894,
4303,
5728,
7805,
2741,
7444,
7896,
917,
5571,
3463,
3542,
1286,
6821,
5054,
840,
1392,
3031,
5408,
3558,
5677,
3479,
5863,
6387,
5075,
6137,
7488,
7857,
5874,
3915,
1511,
4742,
5007,
1333,
702
] | Validation |
3,205 | 1 | 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 “ relevant information ” 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 | [] | Test |
3,206 | 3 | Front_Line_(video_game):front line video game game created tetsuya sasaki influenced space invaders galaga 1985 ikari warriors follows conventions established front line including vertically scrolling levels entering/exiting tanks dying occupied tank destroyed playing lone soldier player ultimate objective lob hand grenade enemy fort first fighting infantry units battling tanks finally reaching opponent compound player begins two weapons pistol grenades ammo limit player advanced far enough enemy territory tank warfare stage player hijack tank fight enemy tanks two types tanks available light tank armed machine gun heavy tank armed cannon light tank nimble easily destroyed enemy heavy tank slower sustain one hit light tank second hit light tank destroy single shot heavy tank destroy either type tank partially damaged tank evacuated player jump back resume normal operation however either type tank player must exit vehicle within seconds struck fatal shot player exit tank explodes loses life extra life awarded 10,000 15,000 none thereafter tank battle continues player reaches enemy fort fort brick-barricaded tank fires mortar rounds player attempts take order destroy tank player must toss grenade brick barricade accomplished foot done tank explode enemy soldier wave white flag signalling surrender plus 1,000 bonus points game repeats infantry level enemy soldiers become increasingly quicker deadlier successive rounds points multiplied based level played following release coin-op arcade platform game ported colecovision console pc-8801 sharp x1 computers 1983 atari 2600 msx 1982 fm-7 nintendo famicom 1985. famicom version taito first game console 1983 arcade awards front line runner-up coin-op game year behind pole position award given electronic games stated arcade approach dirty business infantry combat forces player keep moving firing constantly action non-stop attractive shoot 'em game boy color spin-off entitled sgt rock frontline published taito 2000 game follows template original arcade game set within dc comics universe arcade original included taito memories gekan playstation 2 console 2005 taito legends 2 playstation 2 xbox windows platforms 2006 famicom version released virtual console service japan june 5 2007 wii january 15 2014 nintendo 3ds | [
8052,
7859,
4759
] | Test |
3,207 | 5 | High-Level_Data_Link_Control:high-level data link control high-level data link control hdlc bit-oriented code-transparent synchronous data link layer protocol developed international organization standardization iso standard hdlc iso/iec 13239:2002 hdlc provides connection-oriented connectionless service hdlc used point-to-multipoint connections via original master-slave modes normal response mode nrm asynchronous response mode arm rarely used used almost exclusively connect one device another using asynchronous balanced mode abm hdlc based ibm sdlc protocol layer 2 protocol ibm systems network architecture sna extended standardized itu lap link access procedure ansi named essentially identical version adccp hdlc specification specify full semantics frame fields allows fully compliant standards derived derivatives since appeared innumerable standards adopted x.25 protocol stack lapb v.42 protocol lapm frame relay protocol stack lapf isdn protocol stack lapd original iso standards hdlc following iso/iec 13239:2002 current standard replaced specifications hdlc inspiration ieee 802.2 llc protocol basis framing mechanism used ppp synchronous lines used many servers connect wan commonly internet similar version used control channel e-carrier e1 sonet multichannel telephone lines cisco hdlc uses low-level hdlc framing techniques adds protocol field standard hdlc header hdlc frames transmitted synchronous asynchronous serial communication links links mechanism mark beginning end frame beginning end frame identified done using unique sequence bits frame delimiter flag encoding data ensure flag sequence never seen inside frame frame begins ends frame delimiter frame delimiter end frame may also mark start next frame synchronous asynchronous links flag sequence binary 01111110 hexadecimal 0x7e details quite different flag sequence consists six consecutive 1-bits data coded ensure never contains five 1-bits row done bit stuffing time five consecutive 1-bits appear transmitted data data paused 0-bit transmitted receiving device knows done seeing five 1-bits row following 0-bit stripped received data instead sixth bit 1 either flag seventh bit 0 error seventh bit 1 latter case frame receive procedure aborted restarted flag next seen bit-stuffing serves second purpose ensuring sufficient number signal transitions synchronous links data nrzi encoded 0-bit transmitted change signal line 1-bit sent change thus 0 bit provides opportunity receiving modem synchronize clock via phase-locked loop many 1-bits row receiver lose count bit-stuffing provides minimum one transition per six bit times transmission data one transition per seven bit times transmission flag frames transmitted simplex full-duplex synchronous link frame delimiter continuously transmitted link generates one two continuous waveforms depending initial state hdlc specification allows 0-bit end frame delimiter shared start next frame delimiter i.e 011111101111110 hardware support half-duplex multi-drop communication several transmitters share line receiver line see continuous idling 1-bits inter-frame period transmitter active hdlc transmits bytes data least significant bit first confused little-endian order refers byte ordering within multi-byte field using asynchronous serial communication standard rs-232 serial ports synchronous-style bit stuffing inappropriate several reasons instead asynchronous framing uses control-octet transparency also called byte stuffing octet stuffing frame boundary octet 01111110 0x7e hexadecimal notation control escape octet value 0x7d bit sequence '10111110 rs-232 transmits least-significant bit first either two octets appears transmitted data escape octet sent followed original data octet bit 5 inverted example byte 0x7e would transmitted 0x7d 0x5e 10111110 01111010 reserved octet values xon xoff escaped way necessary abort sequence 0x7d 0x7e ends packet incomplete byte-stuff sequence forcing receiver detect error used abort packet transmission chance partial packet interpreted valid receiver contents hdlc frame shown following table note end flag one frame may beginning start flag next frame data usually sent multiples 8 bits variants require others theoretically permit data alignments 8-bit boundaries frame check sequence fcs 16-bit crc-ccitt 32-bit crc-32 computed address control information fields provides means receiver detect errors may induced transmission frame lost bits flipped bits extraneous bits however given algorithms used calculate fcs probability certain types transmission errors going undetected increases length data checked errors fcs implicitly limit practical size frame receiver calculation fcs match sender indicating frame contains errors receiver either send negative acknowledge packet sender send nothing either receiving negative acknowledge packet timing waiting positive acknowledge packet sender retransmit failed frame fcs implemented many early communication links relatively high bit error rate fcs could readily computed simple fast circuitry software effective forward error correction schemes widely used protocols synchronous data link control sdlc originally designed connect one computer multiple peripherals via mutidrop bus original normal response mode master-slave mode computer primary terminal gives peripheral secondary terminal permission speak turn communication either primary terminal frames include one address secondary terminal primary terminal assigned address distinction commands sent primary secondary responses sent secondary primary reflected encoding commands responses indistinguishable except difference direction transmitted normal response mode allows secondary-to-primary link shared without contention primary give secondaries permission transmit one time also allows operation half-duplex communication links long primary aware may transmit given permission secondary asynchronous response mode hdlc addition use full-duplex links retaining primary/secondary distinction allows secondary transmit time thus must mechanism ensure multiple secondaries try transmit time one secondary asynchronous balanced mode adds concept combined terminal act primary secondary unfortunately mode operation implementation subtleties common frames sent care whether command response frame essential ones notably unnumbered frames frame p/f bit set address field received frame must examined determine whether contains command address received response address received terminal means address field optional even point-to-point links needed disambiguate peer talked hdlc variants extend address field include source destination addresses explicit command/response bit three fundamental types hdlc frames may distinguished general format control field also extended 2-byte forms frames least significant bit rightmost table sent first poll/final single bit two names called poll part command set primary station obtain response secondary station final part response set secondary station indicate response end transmission cases bit clear bit used token passed back forth stations one token exist time secondary sends final received poll primary primary sends poll received final back secondary timeout indicating bit lost operating combined station important maintain distinction p f bits may two checkpoint cycles operating simultaneously p bit arriving command remote station response p bit f bit arriving response frames contain receive sequence number n r n r provides positive acknowledgement receipt i-frames side link value always first frame yet received acknowledges frames n values n r −1 modulo 8 modulo 128 received indicates n next frame expects receive n r operates way whether part command response combined station one sequence number space incremented successive i-frames modulo 8 modulo 128 depending number bits sequence number 7 127 i-frames may awaiting acknowledgment time information frames i-frames transport user data network layer addition also include flow error control information piggybacked data sub-fields control field define functions least significant bit first transmitted defines frame type 0 means i-frame except interpretation p/f field difference command frame response frame p/f 0 two forms exactly equivalent supervisory frames 's-frames used flow error control whenever piggybacking impossible inappropriate station data send s-frames hdlc information fields although hdlc-derived protocols use information fields multi-selective reject s-frame control field includes leading 10 indicating s-frame followed 2-bit type poll/final bit 3-bit sequence number 4-bit padding field followed 7-bit sequence number first least significant 2 bits mean s-frame frames include p/f bit receive sequence number described except interpretation p/f field difference command frame response frame p/f 0 two forms exactly equivalent unnumbered frames u-frames used link management also used transfer user data exchange session management control information connected devices u-frames contain information field used system management information user data first 2 bits 11 mean u-frame 5 type bits 2 p/f bit 3 bit p/f bit create 32 different types u-frame link configurations categorized either three link configurations additional link configuration disconnected mode mode secondary station initialized primary explicitly disconnected mode secondary responds almost every frame mode set command disconnected mode response purpose mode allow primary reliably detect secondary powered otherwise reset minimal set required operation hdlc module end transmits ua frame request accepted request rejected sends dm disconnect mode frame unnumbered frames identified low two bits 1 p/f flag leaves 5 bits frame type even though fewer 32 values use types different meanings depending direction sent command response relationship disc disconnect command rd request disconnect response seems clear enough reason making sarm command numerically equal dm response obscure ui uih xid test frames contain payload used commands responses sm command frmr response also contain payload | [
1618,
6871,
4580,
7433,
3855,
3525,
1543,
4942,
6265,
5492,
1948,
3799,
5142,
3209,
7916,
1022,
3892,
7569,
2062,
768,
5880,
4101,
6062,
3597,
1709
] | Test |
3,208 | 1 | 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 | [] | Test |
3,209 | 2 | IBM_Systems_Network_Architecture:ibm systems network architecture systems network architecture sna ibm proprietary networking architecture created 1974 complete protocol stack interconnecting computers resources sna describes formats protocols piece software implementation sna takes form various communications packages notably virtual telecommunications access method vtam mainframe software package sna communications sna made public part ibm advanced function communications announcement september 1974 included implementation sna/sdlc synchronous data link control protocols new communications products supported ibm 3704/3705 communication controllers network control program ncp system/370 vtam software cics ims announcement followed another announcement july 1975 introduced ibm 3760 data entry station ibm 3790 communication system new models ibm 3270 display system sna mainly designed ibm systems development division laboratory research triangle park north carolina usa helped laboratories implemented sna/sdlc details later made public ibm system reference library manuals ibm systems journal sna still used extensively banks financial transaction networks well many government agencies ibm still providing support sna one primary pieces hardware 3745/3746 communications controller withdrawn market ibm estimated 20,000 controllers installed however ibm continues provide hardware maintenance service microcode features support users robust market smaller companies continues provide 3745/3746 features parts service vtam also supported ibm ibm network control program ncp required 3745/3746 controllers 2008 ibm publication said ibm mid-1970s saw mainly hardware vendor hence innovations period aimed increase hardware sales sna objective reduce costs operating large numbers terminals thus induce customers develop expand interactive terminal-based systems opposed batch systems expansion interactive terminal-based systems would increase sales terminals importantly mainframe computers peripherals partly simple increase volume work done systems partly interactive processing requires computing power per transaction batch processing hence sna aimed reduce main non-computer costs difficulties operating large networks using earlier communications protocols difficulties included result running large number terminals required lot communications lines number required today especially different types terminals needed supported users wanted use different types applications .e.g cics tso location purely financial terms sna objectives increase customers spending terminal-based systems time increase ibm share spending mainly expense telecommunications companies sna also aimed overcome limitation architecture ibm system/370 mainframes inherited system/360 cpu could connect 16 i/o channels channel could handle 256 peripherals i.e maximum 4096 peripherals per cpu time sna designed communications line counted peripheral thus number terminals powerful mainframes could otherwise communicate limited improvements computer component technology made feasible build terminals included powerful communications cards could operate single standard communications protocol rather stripped-down protocol suited specific type terminal result several multi-layer communications protocols proposed 1970s ibm sna itu-t x.25 became dominant later important elements sna include sna removed link control application program placed ncp following advantages disadvantages sna core designed ability wrap different layers connections blanket security communicate within sna environment would first connect node establish maintain link connection network negotiate proper session handle flows within session level different security controls govern connections protect session information network addressable units sna network components assigned address send receive information distinguished follows sna essentially offers transparent communication equipment specifics impose constraints onto lu-lu communication eventually serves purpose make distinction lu types application must take functionality terminal equipment account e.g screen sizes layout within sna three types data stream connect local display terminals printers sna character string scs used lu1 terminals logging sna network unformatted system services uss 3270 data stream mainly used mainframes system/370 successors including zseries family 5250 data stream mainly used minicomputers/servers system/34 system/36 system/38 as/400 successors including system ibm power systems running ibm i. sna defines several kinds devices called logical unit types primary ones use lu1 lu2 lu6.2 advanced protocol application application conversations term 37xx refers ibm family sna communications controllers 3745 supports eight high-speed t1 circuits 3725 large-scale node front-end processor host 3720 remote node functions concentrator router vtam/ncp pu4 nodes attached ibm token ring networks share local area network infrastructure workstations servers ncp encapsulates sna packets token-ring frames allowing sessions flow token-ring network actual encapsulation decapsulation takes place 3745 mainframe-based entities looked alternatives 37xx-based networks ibm partnered cisco mid-1990s together developed data link switching dlsw dlsw encapsulates sna packets ip datagrams allowing sessions flow ip network actual encapsulation decapsulation takes place cisco routers end dlsw peer connection local mainframe site router uses token ring topology connect natively vtam remote user end connection pu type 2 emulator sna gateway server connects peer router via router lan interface end user terminals typically pcs 3270 emulation software defined sna gateway vtam/ncp pu type 2 definition becomes switched major node local vtam without ncp line connection defined using various possible solutions token ring interface 3745 3172 lan channel station cisco escon-compatible channel interface processor | [
5714,
3172,
630,
4580,
3855,
27,
5571,
6276,
3874,
3297,
2667,
3799,
3207,
3209,
5142,
6025,
7278,
8111,
2054,
7024,
1226,
3821,
607,
3233,
3236,
7040
] | Test |
3,210 | 2 | Gary_Kildall:gary kildall gary arlen kildall may 19 1942 – july 11 1994 american computer scientist microcomputer entrepreneur created cp/m operating system founded digital research inc. dri kildall one first people see microprocessors fully capable computers rather equipment controllers organize company around concept also co-hosted pbs tv show computer chronicles although career computing spanned two decades mainly remembered connection ibm unsuccessful attempt 1980 license cp/m ibm personal computer gary kildall born grew seattle washington family operated seamanship school father joseph kildall captain norwegian heritage mother emma half-swedish gary grandmother born långbäck sweden skellefteå municipality emigrated canada 23 years age gary attended university washington uw hoping become mathematics teacher became increasingly interested computer technology receiving degree fulfilled draft obligation united states navy teaching naval postgraduate school nps monterey california within hour drive silicon valley kildall heard first commercially available microprocessor intel 4004 bought one processors began writing experimental programs learn processors worked intel consultant days kildall briefly returned uw finished doctorate computer science 1972 resumed teaching nps published paper introduced theory data-flow analysis used today optimizing compilers continued experiment microcomputers emerging technology floppy disks intel lent systems using 8008 8080 processors 1973 developed first high-level programming language microprocessors called pl/m created cp/m year enable 8080 control floppy drive combining first time essential components computer microcomputer scale demonstrated cp/m intel intel little interest chose market pl/m instead kildall wife dorothy established company originally called intergalactic digital research later renamed digital research inc market cp/m advertisements hobbyist magazines digital research licensed cp/m imsai 8080 popular clone altair 8800 manufacturers licensed cp/m became de facto standard support increasing number hardware variations response kildall pioneered concept bios set simple programs stored computer hardware rom eprom chip enabled cp/m run different systems without modification cp/m quick success took kildall surprise slow update high density floppy disks hard disk drives hardware manufacturers talked creating rival operating system kildall started rush project develop cp/m 2 1981 peak popularity cp/m ran 3,000 different computer models dri 5.4 million yearly revenues ibm presided john r. opel approached digital research 1980 bill gates suggestion negotiate purchase forthcoming version cp/m called cp/m-86 ibm pc gary left negotiations wife dorothy usually colleague developer mp/m operating system tom rolander used gary private airplane deliver software manufacturer bill godbout ibm representatives would explain purpose visit insisted dorothy sign non-disclosure agreement advice dri attorney gerry davis dorothy refused sign agreement without gary approval gary returned afternoon tried move discussion ibm forward accounts disagree whether signed non-disclosure agreement well ever met ibm representatives various reasons given two companies failing reach agreement dri products might unwilling sell main product ibm one-time payment rather usual royalty-based plan dorothy might believed company could deliver cp/m-86 ibm proposed schedule company busy developing implementation pl/i programming language data general also possible ibm representatives might annoyed dri spent hours considered routine formality according kildall ibm representatives took flight florida night dorothy took vacation negotiated flight reaching handshake agreement ibm lead negotiator jack sams insisted never met gary one ibm colleague confirmed sams said time accepted someone else group might flight noted flew back seattle talk microsoft sams related story gates already agreed provide basic interpreter several programs pc gates impression story gary capriciously went flying would later tell reporters sams left gates task finding usable operating system weeks later proposed using operating system 86-dos—an independently developed operating system implemented kildall cp/m api—from seattle computer products scp paul allen negotiated licensing deal scp allen 86-dos adapted ibm hardware ibm shipped ibm pc dos kildall obtained copy pc dos examined concluded infringed cp/m asked gerry davis legal options available davis told intellectual property law software clear enough sue instead kildall threatened ibm legal action ibm responded proposal offer cp/m-86 option pc return release liability kildall accepted believing ibm new system like previous personal computers would significant commercial success ibm pc introduced ibm sold operating system unbundled option one operating system options pc dos priced us 40 pc dos seen practically necessary option software titles required without ibm pc limited built-in cassette basic cp/m-86 shipped months later six times expensive 240 sold poorly dos enjoyed far less software support loss ibm deal gary dorothy found pressure bring experienced management gary influence company waned worked various experimental research projects version cp/m multitasking mp/m implementation logo programming language hoped logo educational dialect lisp would supplant basic education seeing demonstration apple lisa kildall oversaw creation dri graphical user interface called gem novell acquired dri 1991 deal netted millions kildall kildall also pursued computing-related projects outside dri seven years 1983 1990 co-hosted public television program side called computer chronicles followed trends personal computing 1984 started another company activenture adapted optical disc technology computer use early 1985 renamed knowledgeset released first computer encyclopedia june 1985 cd-rom version grolier academic american encyclopedia named electronic encyclopedia later acquired banta corporation kildall final business venture known prometheus light sound pls based austin texas developed home pbx system integrated land-line telephones mobile phones kildall colleagues recall creative easygoing adventurous addition flying loved sports cars auto racing boating lifelong love sea although kildall preferred leave ibm affair past known work afterward continually faced comparisons bill gates well fading memories contributions legend grew around fateful ibm-dri meeting encouraged gates various journalists suggesting kildall irresponsibly taken day recreational flight became tired constantly refute story later years occasional private expressions bitterness overshadowed microsoft kildall annoyed university washington asked distinguished graduate attend computer science program anniversary 1992 gave keynote speech gates dropout harvard response started writing memoir computer connections memoir distributed friends expressed frustration people seem value elegance software said gates divisive manipulative user taken much industry appendix called dos plain simple theft first 26 system calls worked cp/m accused ibm contriving price difference pc dos cp/m-86 order marginalize cp/m journalist harold evans used memoir source chapter kildall 2004 book made america concluding microsoft robbed kildall inventions ibm veterans pc project disputed book description events microsoft described one-sided inaccurate august 2016 kildall family made first part memoir available public selling dri novell made kildall wealthy man moved west lake hills suburb austin austin house lakeside property stalls several sports cars plus video studio basement kildall owned flew learjet least one boat lake austin also participated volunteer efforts assist children hiv/aids owned mansion panoramic ocean view pebble beach california near headquarters dri july 8 1994 kildall fell monterey california biker bar hit head exact circumstances injury remain unclear alcoholic later years various sources claimed fell chair fell steps assaulted walked franklin street bar grill wearing harley-davidson leathers checked hospital twice died three days later community hospital monterey peninsula autopsy next day conclusively determine cause death cp/m usenet faq says concussed fall died heart attack connection two unclear buried evergreen washelli memorial park north seattle following announcement kildall death bill gates commented one original pioneers pc revolution creative computer scientist excellent work although competitors always tremendous respect contributions pc industry untimely death unfortunate work missed march 1995 kildall posthumously honored software publishers association software information industry association contributions microcomputer industry april 2014 city pacific grove installed commemorative plaque outside kildall former residence also served early headquarters digital research | [
1339,
4291,
1442,
6075,
4843,
6160,
2280,
2010,
4939,
1361,
8087,
5571,
126,
5041,
5661,
6907,
5932,
1854,
4609,
7020,
1494,
4361,
7032,
3664,
4543,
1052,
5784,
1894,
2160,
6496,
6497,
8043,
4745,
2266,
1064
] | Test |
3,211 | 4 | Mark_Kriegsman:mark kriegsman mark edwin kriegsman born 1966 american entrepreneur computer programmer inventor writer director engineering veracode lives massachusetts favorite person world daughter eleanor kriegsman writing porting open-source software 30 years founded ran pioneering software companies including document.com later acquired merrill clearway technologies acquired mirror image internet college kriegsman worked cognitive systems inc. started notable ai researcher roger schank developing large scale rule-based statistical text-processing ai systems later integrated three technologies paper wrote ieee designing document management systems interleaf led found first startup document.com founding clearway kriegsman senior developer stake later acquired symantec clearway created firesite web accelerator content delivery network early webarcher internet search tool late 1998 clearway involved early ad-blocking controversy release ad blocking web software adscreen angered user base spurred lively discussion role advertisements web publishing based user feedback clearway pulled adscreen two days later kriegsman active participant several often overlapping areas software development one founders veracode reflecting long-standing interest software security also however interested secure information sharing open-access movement outspoken skeptic sees shady business practices computer industry kriegsman fascination computers caught attention local newspaper 1979 13 lucy meyer new jersey summit herald reported mark ... likes make programs sometimes patterns sometimes short programs 'that pop head parlayed skill interest writing computer games age 15 released first game starblaster later second panic button graduated hampshire college amherst massachusetts studied cognitive science graduation kriegsman worked cognitive systems inc. later went found several successful technology companies starting document.com later including clearway veracode kriegsman descendant william bradford leader plymouth colony massachusetts well early santa fe merchants willi flora spiegelberg willi mayor santa fe 1884–1886 kriegsman holds following patents patents concerning content delivery networks systems patent concerning dynamic web page assembly caching | [
3842,
4663,
7232
] | Test |
3,212 | 9 | 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 | [
7878,
1445,
5019,
1820,
6796,
6087,
2915,
6428,
5734,
1840,
2568,
1478,
4332,
2218,
4704,
405,
5757,
6116,
1116,
6471,
7573,
2600,
5077,
1885,
5079,
2249,
1889,
1890,
5786,
1895,
5787,
4017,
5091,
1152,
6507,
1154,
795,
6876,
4759,
6888,
... | Test |
3,213 | 3 | King's_Valley_II:king valley ii king valley ii seal el giza game msx1 msx2 computers konami sequel king valley 1985 msx2 version saw release japan goes rare contest version contest making levels games built-in level editor held four japanese msx magazines two msx.fan beep winners contest received gold cartridge twenty custom stages custom levels saved either disk tape levels interchangeable msx1 msx2 versions far far future inter-planetary archaeologist vick xiii makes choking discovery pyramids earth malfunctioning devices alien origin enough energy destroy earth vick switch core functions el giza game consists six pyramids wall engravings color pattern every pyramid contains 10 levels idea game collect crystals called soul stones level solving different puzzles evading killing enemies using many tools weapons available unlock exit door take next level later konami game nintendo ds reuses stage musics search secret spell sandfall egyptian area game msx 2 version game except minor changes like music remixed items backgrounds recolored | [
5359
] | Test |
3,214 | 3 | PDP-11_architecture:pdp-11 architecture pdp-11 architecture instruction set architecture isa developed digital equipment corporation dec implemented central processing units cpus microprocessors used pdp-11 minicomputers wide use 1970s eventually overshadowed powerful vax-11 architecture 1980s sixteen-bit words stored little-endian least significant bytes first thirty-two-bit data—supported extensions basic architecture e.g. floating point fpu instruction set double-words extended instruction set long data commercial instruction set —are stored one format including unusual middle-endian format sometimes referred pdp-endian pdp-11 16-bit addresses address 64 kb time pdp-11 yielded vax 8-bit bytes hexadecimal notation becoming standard industry however numeric values pdp-11 always use octal notation amount memory attached pdp-11 always stated number words basic logical address space 32k words high 4k physical address space addresses 160000 177777 absence memory management populated input/output registers bus respond addresses range originally fully loaded pdp-11 28k words processor reserves low memory addresses two-word vectors give program counter processor status word begin service routine i/o device interrupts program places address vector bus indicate service routine take control lowest vectors service routines handle various types trap traps occur program errors attempt execute undefined instruction also program executes instruction bpt emt iot trap request service operating system article pdp-11 describes 16-bit logical address space became insurmountable limitation life pdp-11 following techniques used work around limitation cpu contains eight general-purpose 16-bit registers r0 r7 register r7 program counter pc although register used stack pointer r6 stack pointer sp used hardware interrupts traps r5 often used point current procedure call frame speed context switching pdp-11 models provide dual r1-r5 register sets kernel supervisor present user modes separate memory maps also separate stack pointers user program cause system malfunction storing invalid value stack pointer register instructions allocate six bits specify operand three bits select one eight addressing modes three bits select one eight general registers use three-bit groups makes octal notation natural following sections item includes example operand would written assembly language prototypical single-operand instruction symbol opr rn means one registers written r0 r7 rn signifies contents register following eight modes applied general register effects applied r6 stack pointer sp r7 program counter pc set separately following sections index index deferred modes x 16-bit value taken second word instruction double-operand instructions operands use modes instructions three words long autoincrementation autodecrementation register 1 byte instructions 2 word instructions 2 whenever deferred mode used since quantity register addresses word pointer r7 program counter specified four addressing modes naturally yield useful effects common use absolute mode—whose syntax combines immediate deferred mode—is specify input/output registers registers device specific memory addresses relative mode simpler syntax typical referring program variables jump destinations program uses relative mode relative deferred mode exclusively internal references position-independent contains assumptions location loaded arbitrary memory location even moved need addresses adjusted reflect location relocated computing addresses relative current location processor performed relocation fly immediate absolute modes merely autoincrement autoincrement deferred mode respectively applied pc auxiliary word instruction table says pc next instruction automatically incremented past auxiliary word pc always points words autoincrementation always 2 r6 also written sp used hardware stack traps interrupts convention enforced set modes pdp-11 provides stack grows downward—toward lower addresses—as items pushed onto mode applied sp register programmer elects use software stack addressing modes following effects although software stacks contain bytes sp always stack words autoincrementation autodecrementation sp always 2 pdp-11 operates bytes words bytes specified register number—identifying register low-order byte—or memory location words specified register number memory location low-order byte must even number instructions take operands bit 15 set specify byte addressing clear specify word addressing lists following two sections assembly-language programmer appended b instruction symbol specify byte operation example mov became movb instructions example mark sob implemented pdp-11 models high-order four bits specify operation performed bit 15 generally selecting word versus byte addressing two groups six bits specify mode register defined two operands add sub instructions use word addressing byte-oriented variations additional two-operand instructions require register source operand register pair used written r r+1 first register contains low-order bits must even second register contains high-order bits remainder exception multiply instruction r may odd high 16 bits result stored high-order nine bits specify operation performed bit 15 generally selecting word versus byte addressing many operations seems combinations high-order four bits taken double-operand instructions single group six bits specifies mode register defined single operand branch instructions take conditional effect based state condition codes psw branch instruction typically preceded two-operand cmp compare bit bit test one-operand tst test instruction arithmetic logic instructions also set condition codes contrast intel processors x86 architecture mov instructions set branch instruction could used branch depending whether value moved zero negative high-order byte specifies operation bits 8 9 10 op-code bit 15 reversing branch sense low-order byte offset relative current location program counter offset number words multiplied 2 combined program counter signed number enabling branches forward backward code limited range branch instructions meant code grew target addresses branches would become unreachable programmer would change one-word br two-word jmp instruction next group jmp conditional forms programmer would change beq bne branched around jmp sob subtract one branch listed two-operand instructions another conditional branch instruction jsr instruction could save register stack programs need feature specified pc register jsr pc address routine returned using rts pc routine called instance jsr r4 address old value r4 would top stack return address jsr would r4 let routine gain access values coded in-line specifying r4 in-line pointers specifying r4 autoincrementation moved past data point caller code resumed routine would specify rts r4 return caller four condition codes processor status word psw instructions group digital called micro-programmed single bit instruction word referenced single condition code assembler define syntax specify every combination symbols scc ccc assembled instruction set cleared respectively four condition codes eis option 11/35/40 11/03 standard newer processors fis instruction set option pdp-11/35/40 11/03 optional floating point processor option 11/45 subsequent models cis implemented optional microcode 11/23/24 add-in module 11/44 one version 11/74 provided string decimal instructions used cobol dibol psw mapped memory address 177 776 instructions found earliest pdp-11s gave programs direct access register pdp-11s provided multiple instruction spaces data spaces set non-orthogonal move instructions gave access spaces example routines operating system handled run-time service calls would use instructions exchange information caller life pdp-11 subtle differences arose implementation instructions combinations addressing modes though implementation regarded correct inconsistencies affect ordinary use pdp-11 pdp-11 processor speed varied model memory configuration op code addressing modes instruction timing three components execute/fetch instruction access time source destination last two components depended addressing mode example pdp-11/70 circa 1975 instruction form add x r r n fetch/execute time 1.35 microseconds plus source destination times 0.6 microseconds total instruction time 2.55 microseconds case addressed memory cache added 1.02 microseconds register-to-register add r r n could execute cache 0.3 microseconds floating point even complex since overlap cpu floating-point processor general floating point significantly slower single-precision floating add instruction could range 2.4 5.5 microseconds plus time fetch operands pdp-11 operated priority level 0 7 declared three bits processor status word psw high-end models could operate choice modes kernel privileged user application sometimes supervisor according two bits psw request interrupt bus device would assert one four common bus lines br4 br7 processor responded higher numbers indicated greater urgency perhaps data might lost desired sector might rotate contact read/write heads unless processor responded quickly printer readiness another character lowest priority br4 would remain ready indefinitely processor operating level 5 br6 br7 would order processor operating 3 lower would grant interrupt 7 would grant none bus requests granted lost merely deferred device needing service would continue assert bus request whenever interrupt exceeded processor priority level processor asserted corresponding bus grant bg4 bg7 bus-grant lines common lines daisy chain input gate output previous gate chain gate bus device device physically closer processor earlier daisy chain device made request sensing bus-grant input could conclude control bus pass grant signal next device bus device made request propagated bus-grant input bus-grant output giving next closest device chance reply devices occupy adjacent slots processor board grant continuity cards inserted empty slots propagated bus-grant line control bus device dropped bus request placed bus memory address two-word vector processor saved program counter pc psw entered kernel mode loaded new values specified vector device br6 new psw vector would typically specify 6 new processor priority processor would honor urgent requests br7 service routine defer requests lower priority new pc processor jumped service routine interrupting device routine operated device least removing condition caused interrupt routine ended rti return interrupt instruction restored pc psw processor granted interrupt bus request made error device responded bus grant processor timed performed trap would suggest bad hardware macro-11 assembly language pdp-11 successor pal-11 program assembler loader earlier version pdp-11 assembly language without macro facilities macro-11 supported dec pdp-11 operating systems pdp-11 unix systems also include assembler called structurally similar macro-11 different syntax fewer features folk myth instruction set architecture pdp-11 influenced idiomatic use b programming language pdp-11 increment decrement addressing modes correspond codice_1 codice_2 constructs c. codice_3 codice_4 register variables expression codice_5 could compiled single machine instruction dennis ritchie says folk myth historically impossible however c programming language take advantage several low-level programming features pdp-11 resulting inclusion new processors | [
1339,
2226,
3557,
2567,
3747,
1237,
1435,
4236,
534,
7364,
8117,
4915,
336,
4589
] | Validation |
3,215 | 4 | 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 – 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–64 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–1981 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 | [] | Validation |
3,216 | 4 | ZMW_attack:zmw attack zmw attack hypothetical denial-of-service attack internet routing infrastructure named ying zhang z. morley mao jia wang researchers published original paper considered possibility relies using targeted denial-of-service attacks links carrying bgp connections autonomous systems attempt overwhelm routers default-free zone routing updates leading disruption forcing perform continuous route recalculations 2010 security researcher max schuchard published paper considering possibility using botnet perform zmw attack internet entire core infrastructure hypothetically allowing botnet 250,000 computers crash entire internet | [
1691,
1462
] | Validation |
3,217 | 4 | Invicta_Networks:invicta networks invicta networks computer security company founded victor sheymov former kgb officer exfiltrated moscow brought united states 1980 company products use technology shifts ip addresses company claims makes impossible hack company technology mentioned film breach film | [
3486,
1805
] | Test |
3,218 | 4 | First_Department:first department first department charge secrecy political security workplace every enterprise institution soviet union dealt kind technical scientific information plants r institutions etc printing capabilities e.g. publishing houses every branch central statistical administration successor state statistics committee goskomstat also first department control access distribution publication official economic population social statistics copies especially sensitive documents numbered labeled stamped secret official use cases official use version documents mimicked public use versions format provided much detailed information first departments part kgb subordinated management enterprise institution among functions control access information considered state secret foreign travel publications first department also kept account usage copying devices xerographers printing presses typewriters etc prevent unsanctioned copying including samizdat | [] | Test |
3,219 | 6 | Gzip:gzip gzip file format software application used file compression decompression program created jean-loup gailly mark adler free software replacement compress program used early unix systems intended use gnu g gnu version 0.1 first publicly released 31 october 1992 version 1.0 followed february 1993. gzip based deflate algorithm combination lz77 huffman coding deflate intended replacement lzw patent-encumbered data compression algorithms time limited usability compress popular archivers gzip often also used refer gzip file format although file format also allows multiple streams concatenated gzipped files simply decompressed concatenated originally one file gzip normally used compress single files compressed archives typically created assembling collections files single tar archive also called tarball compressing archive gzip final compressed file usually extension gzip confused zip archive format also uses deflate zip format hold collections files without external archiver less compact compressed tarballs holding data compresses files individually take advantage redundancy files solid compression various implementations program written commonly known gnu project implementation using lempel-ziv coding lz77 openbsd version gzip actually compress program support gzip format added openbsd 3.4 g specific version stands gratis freebsd dragonfly bsd netbsd use bsd-licensed implementation instead gnu version actually command-line interface zlib intended compatible gnu implementation options implementations originally come netbsd support decompression bzip2 unix pack format alternative compression program achieving 3-8 better compression zopfli achieves gzip-compatible compression using exhaustive algorithms expense compression time required affect decompression time codice_3 written mark adler compatible gzip speeds compression using available cpu cores threads tar utility included linux distributions extract .tar.gz files passing option e.g. zlib abstraction deflate algorithm library form includes support gzip file format lightweight stream format api zlib stream format deflate gzip file format standardized respectively rfc 1950 rfc 1951 rfc 1952 gzip format used http compression technique used speed sending html content world wide web one three standard formats http compression specified rfc 2616 rfc also specifies zlib format called deflate equal gzip format except gzip adds eleven bytes overhead form headers trailers still gzip format sometimes recommended zlib internet explorer implement standard correctly handle zlib format specified rfc 1950. zlib deflate used internally portable network graphics png format since late 1990s bzip2 file compression utility based block-sorting algorithm gained popularity gzip replacement produces considerably smaller files especially source code structured text cost memory processing time factor 4 advancecomp 7-zip produce gzip-compatible files using internal deflate implementation better compression ratios gzip itself—at cost processor time compared reference implementation | [
362,
5373,
2559,
7537,
1099,
1471,
4700,
7555,
3979,
7559,
3981,
2589,
7201,
2599,
1127,
4732,
6489,
7584,
1139,
5787,
2259,
6860,
84,
6505,
1523,
5454,
806,
807,
5485,
3383,
1955,
5147,
3032,
4070,
510,
2334,
6940,
1598,
166,
6232,
169... | Test |
3,220 | 4 | 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ïve 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 | [
449,
5627,
3932,
2549,
900,
1265,
6427,
113,
5381,
6989,
573,
310,
5397,
3635,
1658,
1019,
749,
3557,
755,
3486,
4729,
4990,
2883,
5697,
7217,
7494,
2618,
1805
] | Train |
3,221 | 6 | Cylinder-head-sector:cylinder-head-sector cylinder-head-sector chs early method giving addresses physical block data hard disk drive 3d-coordinate system made vertical coordinate head horizontal radial coordinate cylinder angular coordinate sector head selects circular surface platter disk one two sides cylinder cylindrical intersection stack platters disk centered around disk spindle combined together cylinder head intersect circular line precisely circular strip physical data blocks called track sector finally selects data block track addressed viewed sort angular component chs addresses exposed instead simple linear addresses going 0 total block count disk 1 early hard drives n't come embedded disk controller would hide physical layout separate generic controller card used operating system know exact physical geometry specific drive attached controller correctly address data blocks geometry became complicated example introduction zone bit recording drive sizes grew time chs addressing method became restrictive since late 1980s hard drives begun shipping embedded disk controller good knowledge physical geometry would however report false geometry computer e.g. larger number heads actually present gain addressable space logical chs values would translated controller thus chs addressing longer corresponded physical attributes drive soon hard drive interfaces replaced chs scheme logical block addressing many tools manipulating master boot record mbr partition table still aligned partitions cylinder boundaries thus artifacts chs addressing still seen partitioning programs 2010s early 2010s disk size limitations imposed mbr became problematic guid partition table gpt designed replacement modern computers without mbr longer use notions chs addressing chs addressing process identifying individual sectors aka physical block data disk position track track determined head cylinder numbers terms explained bottom disk addressing sector smallest unit disk controllers introduce address translations map logical physical positions e.g. zone bit recording stores fewer sectors shorter inner tracks physical disk formats necessarily cylindrical sector numbers track skewed floppy disks controllers use physical sector sizes 128 256 512 1024 bytes e.g. pc/ax whereby formats 512 bytes per physical sector became dominant 1980s common physical sector size harddisks today 512 bytes hard disks 520 bytes per sector well non-ibm compatible machines 2005 seagate custom hard disks used sector sizes 1024 bytes per sector advanced format hard disks use 4096 bytes per physical sector 4kn since 2010 also able emulate 512 byte sectors 512e transitional period magneto-optical drives use sector sizes 512 1024 bytes 5.25-inch drives 512 2048 bytes 3.5-inch drives chs addressing sector numbers always start 1 sector 0 lead confusion since logical sector addressing schemes e.g. logical block addressing lba relative sector addressing dos typically start counting 0 physical disk geometries maximal sector number determined low level format disk however disk access bios ibm-pc compatible machines sector number encoded six bits resulting maximal number 111111 63 sectors per track maximum still use virtual chs geometries tracks thin concentric circular strips sectors least one head required read single track respect disk geometries terms track cylinder closely related single double sided floppy disk track common term two heads cylinder common term strictly speaking track given codice_1 combination consisting codice_2 sectors cylinder consists codice_3 sectors cylinder division data disk drive used chs addressing mode fixed block architecture disk cylinder–head–record cchhr addressing mode ckd disk concept concentric hollow cylindrical slices physical disks platters collecting respective circular tracks aligned stack platters number cylinders disk drive exactly equals number tracks single surface drive comprises track number platter spanning tracks across platter surface able store data without regard whether track bad cylinders vertically formed tracks words track 12 platter 0 plus track 12 platter 1 etc cylinder 12 forms direct access storage device dasd drum memory devices ibm 2321 data cell might give blocks addresses include cylinder address although cylinder address n't select geometric cylindrical slice device device called head reads writes data hard drive manipulating magnetic medium composes surface associated disk platter naturally platter 2 sides thus 2 surfaces data manipulated usually 2 heads per platter one per side sometimes term side substituted head since platters might separated head assemblies removable media floppy drive codice_4 addressing supported ibm-pc compatible bioses code used eight bits theoretically 256 heads counted head 0 255 codice_5 however bug versions microsoft dos/ibm pc dos including 7.10 cause operating systems crash boot encountering volumes 256 heads therefore compatible bioses use mappings 255 heads codice_6 including virtual codice_7 geometries historical oddity affect maximum disk size old bios int 13h code well old pc dos similar operating systems codice_8 mb actually codice_9 mb yields known 8 gb limit context relevant definition 8 gb 8192 mb another incorrect limit would require chs codice_10 64 sectors per track tracks cylinders counted 0 i.e. track 0 first outer-most track floppy cylindrical disks old bios code supported ten bits chs addressing 1024 cylinders codice_11 adding six bits sectors eight bits heads results 24 bits supported bios interrupt 13h subtracting disallowed sector number 0 codice_12 tracks corresponds 128 mb sector size 512 bytes codice_13 codice_14 confirms roughly 8 gb limit chs addressing starts codice_15 maximal value codice_16 codice_17 bits codice_18 24 bits limited 255 heads chs values used specify geometry disk count cylinder 0 head 0 resulting maximum codice_19 codice_20 24 bits 256 255 heads chs tuples specifying geometry actually means sectors per track virtual geometry still matches capacity disk contains codice_21 sectors larger hard disks come use cylinder become also logical disk structure standardised 16 065 sectors codice_22 chs addressing 28 bits eide ata-2 permits eight bits sectors still starting 1 i.e. sectors 1…255 four bits heads 0…15 sixteen bits cylinders 0…65535 results roughly 128 gb limit actually codice_23 sectors corresponding 130560 mb sector size 512 bytes codice_24 bits ata-2 specification also covered ralf brown interrupt list old working draft expired standard published old bios limit 1024 cylinders ata limit 16 heads combined effect codice_25 sectors i.e. 504 mb limit sector size 512 bios translation schemes known echs revised echs mitigated limitation using 128 240 instead 16 heads simultaneously reducing numbers cylinders sectors fit codice_26 echs limit 4032 mb codice_27 revised echs limit 7560 mb given total number sectors disk unix communities employ term block refer sector group sectors example linux fdisk utility version 2.25 displayed partition sizes using 1024-byte blocks clusters allocation units data various file systems fat ntfs etc data mainly consists files clusters directly affected physical virtual geometry disk i.e. cluster begin sector near end given codice_1 track end sector physically logically next codice_1 track 2002 ata-6 specification introduced optional 48 bits logical block addressing declared chs addressing obsolete still allowed implement ata-5 translations unsurprisingly chs lba translation formula given also matches last ata-5 chs translation ata-5 specification chs support mandatory 16 514 064 sectors optional larger disks ata-5 limit corresponds chs codice_30 equivalent disk capacities 16514064 16383×16×63 1032×254×63 requires 24 14+4+6 bits 16383 1 2 chs tuples mapped onto lba addresses using following formula lba address n number heads disk n maximum number sectors per track c h chs address logical sector number formula ecma-107 iso/iec 9293:1994 superseding iso 9293:1987 standards fat file systems matches exactly lba formula given logical block address logical sector number lsn synonyms formula use number cylinders requires number heads number sectors per track disk geometry chs tuple addresses different logical sector numbers depending geometry examples help visualize sequencing sectors linear lba model note cylinder head record format used count key data ckd hard disks ibm mainframes since least 1960s largely comparable cylinder head sector format used pcs save sector size fixed could vary track track based needs application contemporary use disk geometry presented mainframe emulated storage firmware longer relation physical disk geometry earlier hard drives used pc mfm rll drives divided cylinder equal number sectors chs values matched physical properties drive drive chs tuple codice_43 would 500 tracks per side platter two platters 4 heads 32 sectors per track total 32 768 000 bytes 31.25 mb ata/ide drives much efficient storing data replaced archaic mfm rll drives use zone bit recording zbr number sectors dividing track varies location groups tracks surface platter tracks nearer edge platter contain blocks data tracks close spindle physical space within given track near edge platter thus chs addressing scheme correspond directly physical geometry drives due varying number sectors per track different regions platter many drives still surplus sectors less 1 cylinder size end drive since total number sectors rarely ever ends cylinder boundary ata/ide drive set system bios configuration cylinders heads sectors exceed capacity drive bios since drive convert given chs value actual address specific hardware configuration however cause compatibility problems operating systems microsoft dos older version windows partition must start end cylinder boundary modern operating systems windows xp included may disregard rule still cause compatibility issues especially user wants perform dual booting drive microsoft follow rule internal disk partition tools since windows vista | [
2717,
4291,
4759,
1534,
4494,
5571,
3866,
309,
126,
6907,
5397,
5852,
412,
6380,
3137,
3905,
4271,
8030,
1052,
1793,
2350,
1992
] | Test |
3,222 | 2 | AmigaGuide:amigaguide amigaguide hypertext document file format designed amiga files stored ascii possible read edit file without need special software since workbench 2.1 amiga guide system o.s inline help files reading manuals hypertext formatting elements launched amigaos based viewer called simply amigaguide included standard feature amiga system users earlier versions workbench could view files downloading program library amigaguide 34 distributed public domain collections floppy disks example fred fish collection could downloaded directly aminet software repository starting amigaos 3.0 amigaguide tool replaced complete flexible multiview amigaguide default tool viewing amigaguide files used amigaos 2.1 also basic text viewer ascii documents handle multiple files thanks cross-linking tables called xref multiview basically void container natural gui various datatypes open multiview default tool media file including amigaguide files invoked mouse clicking recognized existing correspondent datatype although amigaguide format almost solely used documenting amiga programs viewers available several platforms amigaguide document simple ascii-formatted document edited normal text editor viewed text reader software amigaguide commands begin pronounced 'at symbol recognized amigaguide document first line include text codice_1 three categories commands global node attributes global commands usually specified beginning document nodes defined apply nodes document technically anywhere many commands used globally nodes node commands usable inside node node endnode affect node used attributes may specified anywhere normal line addition symbol attributes always use pair braces enclose attribute name possibly additional arguments commands index help next prev toc all-purpose hypertext link specify nodes jump support naming nodes within current document also support path along name lets node located amigaguide document shown simply embossed text squared buttons page multiview access node another document simply required put amigados file path node name point view amigaguide simple hypertext language since amigaos 3.0 user jump file supported amiga datatypes – pictures animation anything uses multiview program handle internal support datatype amiga standard user must still give node name even though file amigaguide file nodes – syntax codice_2 | [
5,
97,
4759,
7710,
3688,
1534,
6431,
6009,
307,
5833,
5661,
578,
4244,
222,
7746,
7384,
1214,
594,
4354,
241,
4006,
7942,
7775
] | Test |
3,223 | 4 | 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 | [
1249,
3165,
1809,
4759,
806,
5813,
994,
3185,
4492,
1459,
7351,
4138,
385,
7536,
2296,
2746,
5571,
6107,
578,
3637,
8100,
6456,
3551,
1291,
7275,
7744,
3394,
6560,
4977,
7289,
7478,
3484,
6043,
4091,
2790,
7683,
6235,
6149,
6951,
7597,
... | Validation |
3,224 | 4 | Spanish_Network_of_Excellence_on_Cybersecurity_Research:spanish network excellence cybersecurity research spanish network excellence cybersecurity research renic research initiative promote cybersecurity interests spain | [] | Test |
3,225 | 9 | Type_safety:type safety computer science type safety extent programming language discourages prevents type errors type error erroneous undesirable program behaviour caused discrepancy differing data types program constants variables methods functions e.g. treating integer int floating-point number float type safety sometimes alternatively considered property computer program rather language program written languages type-safe facilities circumvented programmers adopt practices exhibit poor type safety formal type-theoretic definition type safety considerably stronger understood programmers type enforcement static catching potential errors compile time dynamic associating type information values run-time consulting needed detect imminent errors combination behaviors classified type errors given programming language usually result attempts perform operations values appropriate data type classification partly based opinion may imply operation leading program crashes security flaws obvious failures legitimate need considered error may imply contravention programmer explicit intent communicated via typing annotations erroneous type-safe context static compile-time type systems type safety usually involves among things guarantee eventual value expression legitimate member expression static type precise requirement subtle — see example subtype polymorphism complications type safety closely linked memory safety restriction ability copy arbitrary bit patterns one memory location another instance implementation language type formula_1 sequence bits appropriate length represent legitimate member formula_1 language allows data copied variable type formula_1 type-safe operation might assign non-formula_1 value variable conversely language type-unsafe extent allowing arbitrary integer used pointer memory-safe statically typed languages provide degree type safety strictly stronger memory safety type systems enforce proper use abstract data types defined programmers even strictly necessary memory safety prevention kind catastrophic failure type-safe code accesses memory locations authorized access discussion type safety specifically refers memory type safety confused type safety broader respect example type-safe code read values another object private fields robin milner provided following slogan describe type safety appropriate formalization slogan depends style formal semantics used particular language context denotational semantics type safety means value expression well-typed say type τ bona fide member set corresponding τ 1994 andrew wright matthias felleisen formulated standard definition proof technique type safety languages defined operational semantics approach type safety determined two properties semantics programming language properties exist vacuum linked semantics programming language describe large space varied languages fit criteria since notion well typed program part static semantics programming language notion getting stuck going wrong property dynamic semantics vijay saraswat provides following definition type safety ultimately aimed excluding problems e.g type safety usually requirement toy language proposed academic programming language research many languages hand big human-generated type safety proofs often require checking thousands cases nevertheless languages standard ml rigorously defined semantics proved meet one definition type safety languages haskell believed meet definition type safety provided certain escape features used example haskell unsafeperformio used escape usual restricted environment i/o possible circumvents type system used break type safety type punning another example escape feature regardless properties language definition certain errors may occur run-time due bugs implementation linked libraries written languages errors could render given implementation type unsafe certain circumstances early version sun java virtual machine vulnerable sort problem programming languages often colloquially classified strongly typed weakly typed also loosely typed refer certain aspects type safety 1974 liskov zilles defined strongly-typed language one whenever object passed calling function called function type must compatible type declared called function 1977 jackson wrote strongly typed language data area distinct type process state communication requirements terms types contrast weakly typed language may produce unpredictable results may perform implicit type conversion object oriented languages type safety usually intrinsic fact type system place expressed terms class definitions class essentially defines structure objects derived api contract handling objects time new object created comply contract function exchanges objects derived specific class implementing specific interface adhere contract hence function operations permitted object defined methods class object implements guarantee object integrity preserved exceptions object oriented languages allow dynamic modification object structure use reflection modify content object overcome constraints imposed class methods definitions ada designed suitable embedded systems device drivers forms system programming also encourage type-safe programming resolve conflicting goals ada confines type-unsafety certain set special constructs whose names usually begin string unchecked_ unchecked_deallocation effectively banned unit ada text applying pragma pure unit expected programmers use unchecked_ constructs carefully necessary programs use type-safe spark programming language subset ada eliminating potential ambiguities insecurities time adding statically checked contracts language features available spark avoids issues dangling pointers disallowing allocation run time entirely ada2012 adds statically checked contracts language form pre- post-conditions well type invariants c programming language type-safe limited contexts example compile-time error generated attempt made convert pointer one type structure pointer another type structure unless explicit cast used however number common operations non-type-safe example usual way print integer something like codice_2 codice_3 tells codice_4 run-time expect integer argument something like codice_5 tells function expect pointer character-string yet supplies integer argument may accepted compilers produce undefined results partially mitigated compilers gcc checking type correspondences printf arguments format strings addition c like ada provides unspecified undefined explicit conversions unlike ada idioms use conversions common helped give c type-unsafe reputation example standard way allocate memory heap invoke memory allocation function codice_6 argument indicating many bytes required function returns untyped pointer type codice_7 calling code must explicitly implicitly cast appropriate pointer type pre-standardized implementations c required explicit cast therefore code codice_8 became accepted practice features c++ promote type-safe code c type-safe statically type-safe support untyped pointers must accessed using unsafe keyword prohibited compiler level inherent support run-time cast validation casts validated using keyword return null reference cast invalid using c-style cast throw exception cast invalid see c sharp conversion operators undue reliance object type types derived runs risk defeating purpose c type system usually better practice abandon object references favour generics similar templates c++ generics java java language designed enforce type safety anything java happens inside object object instance class implement type safety enforcement object usage needs allocated java allows usage primitive types inside properly allocated objects sometimes part type safety implemented indirectly e.g class bigdecimal represents floating point number arbitrary precision handles numbers expressed finite representation operation bigdecimal.divide calculates new object division two numbers expressed bigdecimal case division finite representation one computes e.g 1/3=0.33333 ... divide method raise exception rounding mode defined operation hence library rather language guarantees object respects contract implicit class definition sml rigorously defined semantics known type-safe however implementations sml including standard ml new jersey sml/nj syntactic variant mythryl mlton provide libraries offer certain unsafe operations facilities often used conjunction implementations foreign function interfaces interact non-ml code c libraries may require data laid specific ways another example sml/nj interactive toplevel must use unsafe operations execute ml code entered user modula-2 strongly typed language design philosophy require unsafe facilities explicitly marked unsafe achieved moving facilities built-in pseudo-library called system must imported used import thus makes visible facilities used unfortunately consequently implemented original language report implementation still remained unsafe facilities type cast syntax variant records inherited pascal could used without prior import difficulty moving facilities system pseudo-module lack identifier facility could imported since identifiers imported syntax iso modula-2 standard corrected type cast facility changing type cast syntax function called cast imported pseudo-module system however unsafe facilities variant records remained available without import pseudo-module system recent revision language applied original design philosophy rigorously first pseudo-module system renamed unsafe make unsafe nature facilities imported explicit remaining unsafe facilities either removed altogether example variant records moved pseudo-module unsafe facilities identifier could imported enabling identifiers introduced order enable facility corresponding enabling identifier must imported pseudo-module unsafe unsafe facilities remain language require import unsafe pascal number type safety requirements kept compilers pascal compiler dictates strict typing two variables assigned unless either compatible conversion integer real assigned identical subtype example following code fragment strict typing variable defined twotypes compatible dualtypes identical even though components user defined type identical assignment t1 d2 illegal assignment t1 t2 would legal subtypes defined identical however assignment t1.q d1.q would legal general common lisp type-safe language common lisp compiler responsible inserting dynamic checks operations whose type safety proven statically however programmer may indicate program compiled lower level dynamic type-checking program compiled mode considered type-safe following examples illustrates c++ cast operators break type safety used incorrectly first example shows basic data types incorrectly casted example codice_9 explicitly prevents compiler performing safe conversion integer floating-point value program runs output garbage floating-point value problem could avoided instead writing codice_10 next example shows object references incorrectly downcasted two child classes members different types downcasting parent class pointer child class pointer resulting pointer may point valid object correct type example leads garbage value printed problem could avoided replacing codice_11 codice_12 throws exception invalid casts | [
1445,
1348,
7715,
7435,
8174,
6982,
7071,
1363,
2740,
304,
5397,
2662,
8097,
5751,
7005,
7460,
7009,
1019,
43,
5948,
4074,
7844,
2881,
256,
260,
6156,
3751,
1989,
2530,
1803,
1435
] | Test |
3,226 | 4 | Signed_and_Encrypted_Email_Over_The_Internet:signed encrypted email internet signed encrypted email internet seeoti initiative approach providing small medium enterprises ability communicate securely one another government defence ministries major aerospace defence contractors allowing play full part defence supply chain seeoti implements secure email specifications defined transglobal secure collaboration program tscp support interoperable signing encryption email messages federated environment addition security labelling email messages supported network border guard able check labels even though messages encrypted meets goal protecting intellectual property global business environment particular importance uk cyber security strategy intellectual property seen key growth economy deep-secure organised trial seeoti uk mod uk council electronic business integrated commercial shelf cots products titus boldon james deep-secure provide system email security functionality deep-secure selected overall winner ukceb excellence awards 2011 work seeoti february 2012 deep-secure partners adept4 intercede trustis providing seeoti solution service nexor provide compatible products | [
7725,
2779
] | Test |
3,227 | 4 | Initiative_for_Open_Authentication:initiative open authentication initiative open authentication oath industry-wide collaboration develop open reference architecture using open standards promote adoption strong authentication close thirty coordinating contributing members proposing standards variety authentication technologies aim lowering costs simplifying use name oath acronym phrase open authentication pronounced english word oath oath related oauth open standard authorization | [
2489,
3490,
1805,
7380,
5149,
7818,
2346,
5554
] | Test |
3,228 | 2 | Open_Programming_Language:open programming language open programming language opl embedded programming language portable devices run symbian operating system found nokia 9200 9300 9500 communicator series mobile telephone/personal digital assistant pda sony ericsson p800 p900 p910 series classic psion pdas series 3 5/5mx series 7 netbook/netpad well mc218 opl part standard application suite opl also included psion teklogix industrial handhelds workabout mx opl interpreted language similar basic fully visual basic-compatible language oval also developed language originally called organiser programming language developed psion ltd psion organiser designed colly myers first iteration implemented richard harrison martin stamp first implementation without graphics original psion organiser referred psion organiser 1984 came bundled science finance math data packs became truly accessible built-in software psion organiser ii 1986 language went used psion series 3 later psion retired portable digital assistant market project delayed 2003 fledgling symbian developer program released open source language developed sourceforge opl-dev project language available symbian os v8 later mainly due lack interest support major symbian licencees nokia sony ericsson hence opl likely never made available newer generation symbian os phones sony ericsson p990 m600 w950 p1i nokia e61i e90 2010 nokia device developers encouraged use python s60 instead see python s60 console version hello world program gui version nokia series 80 user interface opl structured programming language opl programs contain procedures much like functions programming languages example cruel interrogative program yes button assigned shortcut ctrl+y ctrl+n represented n respectively user input dialog tested statement printing appropriate responses screen note 'get keyword gets user input without using dialog box used simply wait keypress terminating program otherwise would end immediately without giving time user read text output dialog also stored variable variables specific procedure must declared local keyword global variables defined global keyword table uses example variable called 'var opl interfaced advanced psion series 3 features means operating system calls later psion series 5mx changed so-called 'opx library stored system rom z drive 'opx libraries also made available nokia 9210 nokia 9300 nokia 9500 communicators adding opxs routines handling sms managing bluetooth communication opl features include letter g beginning graphical functions letter 'm menus letter 'd dialogs | [
6507,
6486,
5965,
6465,
4194,
5571,
3772
] | Test |
3,229 | 9 | Martin_Odersky:martin odersky martin odersky born 5 september 1958 german computer scientist professor programming methods école polytechnique fédérale de lausanne epfl switzerland specializes code analysis programming languages designed scala programming language generic java pizza others implemented gj compiler implementation became basis javac java compiler 2007 inducted fellow association computing machinery 1989 received ph.d. eth zurich supervision niklaus wirth best known designer several programming languages including pascal postdoctoral work ibm yale university 12 may 2011 odersky collaborators launched typesafe inc. renamed lightbend inc. company provide commercial support training services scala currently serves chairman chief architect teaches two courses coursera online learning platform functional programming principles scala functional program design scala | [
5621,
5948,
5662,
1243,
2619,
718,
5424
] | Test |
3,230 | 2 | Open_Firmware:open firmware open firmware openboot sun microsystems parlance standard defining interfaces computer firmware system formerly endorsed institute electrical electronics engineers ieee originated sun used sun apple ibm arm non-x86 pci chipset vendors open firmware allows system load platform-independent drivers directly pci card improving compatibility open firmware may accessed forth language shell interface achieves essentially functionality later efi standard initiated intel lower overhead open firmware described ieee standard ieee 1275-1994 reaffirmed open firmware working group ofwg since 1998 therefore officially withdrawn ieee several commercial implementations open firmware released open source community 2006 including sun openboot firmworks openfirmware codegen smartfirmware source code available openbios project sun implementation available bsd license open firmware forth code may compiled fcode bytecode independent computer architecture details instruction set memory hierarchy pci card may include program compiled fcode runs open firmware system way provide platform-independent boot-time diagnostics configuration code device drivers fcode also compact disk driver may require one two kilobytes therefore many i/o cards used sun systems macintoshes used open firmware fcode implements ans forth subset open firmware library open firmware furthermore defines standard way describe hardware system helps operating system better understand host computer relying less user configuration hardware polling example open firmware essential reliably identifying slave i²c devices like temperature sensors hardware monitoring whereas alternative solution performing blind probe i²c bus done software like lm_sensors generic hardware known result serious hardware issues certain circumstances based upon interactive programming language open firmware used efficiently test bring new hardware allows drivers written tested interactively operational video mouse drivers prerequisite graphical interface suitable end-user diagnostics apple shipped diagnostic operating system many power macintoshes sun also shipped fcode-based diagnostic tool suite called openboot diagnostics obdiag used customer service support hardware manufacturing teams sun sparc systems open firmware interface displayed console terminal bootstrapping system software keyboard connected main video display used console terminal open firmware re-entered time pressing keyboard keyboard connected first serial line system usually used console open firmware re-entered sending break serial line system software running various open firmware settings read written using codice_1 command powerpc-based macintosh open firmware interface accessed pressing keys startup using standard pc usb keyboard intel-based macintoshes use open firmware use extensible firmware interface following apple transition intel processors also early versions powerbook 3400 connect open firmware input output modem port default functionality generally used developers troubleshooting i.t personnel common users mac os x operating system provides high level graphical user interface change commonly used open firmware settings instance possible specify boot disk partition without directly using open firmware interface limitations e.g possible select boot usb mass-storage devices open firmware allows imac boot using codice_2 command open firmware settings changed using codice_3 command system software running pegasos interface accessed pressing startup ibm power systems open firmware ok prompt accessed sms boot menu sms boot menu accessed pressing boot sequence hardware checking os boot olpc xo-1 laptop open firmware access requires developer key obtained registration olpc installing key upon power-on boot countdown interrupted upper left key get forth prompt | [
6071,
4926,
2992,
1447,
7064,
3012,
4321,
3105,
6188,
6014,
309,
2659,
6813,
1992,
3799,
2672,
6646,
6922,
7209,
4093,
1052,
2349,
352,
6778,
7777,
971,
4836,
2357,
2714
] | Test |
3,231 | 4 | Access_Control_Matrix:access control matrix computer science access control matrix access matrix abstract formal security model protection state computer systems characterizes rights subject respect every object system first introduced butler w. lampson 1971 access matrix envisioned rectangular array cells one row per subject one column per object entry cell – entry particular subject-object pair – indicates access mode subject permitted exercise object column equivalent access control list object row equivalent access profile subject according model protection state computer system abstracted set objects formula_1 set entities needs protected e.g processes files memory pages set subjects formula_2 consists active entities e.g users processes exists set rights formula_3 form formula_4 formula_5 formula_6 formula_7 right thereby specifies kind access subject allowed process object matrix example exists two processes file device first process ability execute second read file write information device second process read information first define granularity protection mechanisms access control matrix used model static access permissions type access control system model rules permissions change particular system therefore gives incomplete description system access control security policy access control matrix thought abstract model permissions given point time literal implementation two-dimensional array would excessive memory requirements capability-based security access control lists categories concrete access control mechanisms whose static permissions modeled using access control matrices although two mechanisms sometimes presented example butler lampson protection paper simply row-based column-based implementations access control matrix view criticized drawing misleading equivalence systems take account dynamic behaviour | [
2557,
2631,
4304,
6015,
700
] | Test |
3,232 | 4 | Chameleon_botnet:chameleon botnet chameleon botnet botnet discovered february 28 2013 security research firm spider.io involved infection 120,000 computers generated average 6 million us dollars per month advertising traffic traffic generated infected systems looked advertising parties regular end users browsed web seen legitimate web traffic affected computers windows pcs majority private pcs residential systems make actions software look like legitimate human behavior made mouse infected systems move around pages browsers rebooted system sessions crashed also sophisticated adobe flash javascript scripts executed infected systems least 202 websites targeted botnet 9 billion advertisements served side effect web traffic generated botnet infected systems likely suffered general operating lag slow network connectivity well symptoms indicators pc possibly infected malware removal software like clamwin exterminate infection could removed infected system also possible deactivate malware changing registry infected windows pc manually | [
4027,
2451,
4759
] | Test |
3,233 | 2 | Virtual_Telecommunications_Access_Method:virtual telecommunications access method virtual telecommunications access method vtam ibm subsystem implements systems network architecture sna mainframe environments vtam provides application programming interface api communication applications controls communication equipment adapters controllers modern terminology vtam provides communication stack device drivers vtam introduced 1974 series delays major component sna along 370x network control program ncp synchronous data link control sdlc ibm terminology vtam access method software allowing application programs read write data external devices called 'virtual introduced time ibm introducing virtual memory upgrading operating systems system/360 series virtual storage versions vtam supposed successor older telecommunications access methods basic telecommunications access method btam telecommunications access method tcam maintained compatibility reasons vtam comparable virtual storage access method vsam time new supposedly converged access method disk storage originally vtam provided free charge like systems software time however vtam 2 last version freely available acf/vtam advanced communication function/virtual telecommunications access method introduced 1976 provided licence fee major new feature acf/vtam multisystem networking facility introduced implementation intersystem communication among multiple s/370s. limited version acf/vtam known acf/vtame advanced communications function virtual telecommunications access method entry made available dos/vse systems running ibm 4300 vtam renamed sna services feature communications server os/390 software package also provides tcp/ip functions vtam supports several network protocols including sdlc token ring start-stop bisync local channel attached 3270 devices later tcp/ip vtam network communication took place integrated communication adapter mainframe separate programmable front-end processor ibm 3745/3746 communications processor operating system network control program ncp machines longer actively marketed ibm still supported ibm provides hardware maintenance microcode updates estimated 20,000 installed 3745/3746 controllers robust third party industry smaller 3745/3746 specialty companies provide controllers upgrades features related support services vtam sna still use many enterprises initially vtam allowed communication mainframes peripheral equipment terminals distributed processors minicomputers later 'cross-domain services introduced confused tcp/ip domains allowing sna networks one mainframe subsequent development sna network interconnect allowing networks different organizational entities firms interconnected high degree independence finally advanced peer peer networking functions appn added vtam appn mainframe longer heart network nodes network considered peers one reasons appn introduced act decnet-killer time appn actually shipped popularity decnet already declined appn considered overly complex 2012 largely superseded tcp/ip | [
3,
8159,
4580,
5105,
8066,
7264,
1851,
3209,
839,
7783,
5852,
7661,
6213,
2596,
7024,
607,
5081,
7040,
4647,
1516,
1994
] | Test |
3,234 | 3 | Gameframe:gameframe gameframe hybrid computer system first used online video games industry amalgamation different technologies architectures supercomputers mainframes namely high computing power high throughput 2007 hoplon ibm jointly started gameframe project used ibm system z mainframe computer attached cell/b.e blades eight-core parallel-processing chips power sony playstation 3 host online game taikodom project carried co-operation ibm university california san diego 2009 although cell blades account required computing power high data throughput mainframe particular interest system z provides high level security massive workload handling assuring execution administrative tasks guaranteeing enduring connectivity huge number clients cell/b.e takes resource demanding calculations thus enabling system z fulfill job combination effective financially attractive game server system computation-intensive tasks offloaded expensive cpu cycles system z carried much economical cell blades without offloading server system required would end costing much would financially feasible unlike typical game clusters gameframe handle required transactions e.g keeping track user spaceships weapons virtual money even players simulation trajectory objects checking collisions unified consistent fashion thus host thousand users time slow experienced users added games numerous players like world warcraft tackled problem splitting work among multiple clusters creating duplicate worlds n't communicate cell-augmented mainframe runs hoplon virtual-world middleware called bitverse uses ibm websphere xd db2 software around gameframe ibm virtual universe community evolved | [
6597,
450,
4408,
5042,
4242,
5665,
5666,
1388,
1023,
2139,
4718,
239,
763,
602,
2873,
2601,
4200,
1606,
1244,
4839,
2807
] | Test |
3,235 | 3 | 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 | [] | Validation |
3,236 | 5 | Network_socket:network socket network socket internal endpoint sending receiving data within node computer network concretely representation endpoint networking software protocol stack entry table listing communication protocol destination status etc form system resource term socket analogous physical female connectors communication two nodes channel visualized cable two male connectors plugging sockets node similarly term port another term female connector used external endpoints node term socket also used internal endpoint local inter-process communication ipc network however analogy strained network communication need one-to-one dedicated communication channel process refer socket using socket descriptor type handle process first requests protocol stack create socket stack returns descriptor process identify socket process passes descriptor back protocol stack wishes send receive data using socket unlike ports sockets specific one node local resources referred directly nodes sockets necessarily associated persistent connection channel communication two nodes necessarily single endpoint example datagram socket used connectionless communication multicast socket used send multiple nodes however practice internet communication sockets generally used connect specific endpoint often persistent connection practice socket usually refers socket internet protocol ip network socket may called internet socket particular transmission control protocol tcp protocol one-to-one connections context sockets assumed associated specific socket address namely ip address port number local node corresponding socket address foreign node node associated socket used foreign process associating socket socket address called binding note local process communicate foreign process sending receiving data foreign socket address access foreign socket use foreign socket descriptor internal foreign node example connection 10.20.30.40:4444 50.60.70.80:8888 local ip address local port foreign ip address foreign port also associated socket end corresponding internal representation connection protocol stack node referred locally numerical socket descriptors say 317 one side 922 process node 10.20.30.40 request communicate node 50.60.70.80 port 8888 request protocol stack create socket communicate destination created socket received socket descriptor 317 communicate via socket using descriptor 317 protocol stack forward data node 50.60.70.80 port 8888 however process node 10.20.30.40 request communicate based foreign socket descriptor e.g socket 922 socket 922 node 50.60.70.80 internal foreign node usable protocol stack node 10.20.30.40 protocol stack today usually provided operating system rather separate library instance set services allow processes communicate network using protocols stack implements operating system forwards payload incoming ip packets corresponding application extracting socket address information ip transport protocol headers stripping headers application data application programming interface api programs use communicate protocol stack using network sockets called socket api development application programs utilize api called socket programming network programming internet socket apis usually based berkeley sockets standard berkeley sockets standard sockets form file descriptor due unix philosophy everything file analogies sockets files functions read write open close practice differences strain analogy different interfaces send receive used socket inter-process communication end generally socket standard internet protocols tcp udp socket address combination ip address port number much like one end telephone connection combination phone number particular extension sockets need source address example sending data program binds socket source address socket used receive data sent address based address internet sockets deliver incoming data packets appropriate application process socket often refers specifically internet socket tcp socket internet socket minimally characterized following distinctions socket internal representation socket descriptor abstract identifier socket address public address subtle always distinguished everyday usage specific definitions socket differ authors ietf request comments internet standards many textbooks well article term socket refers entity uniquely identified socket number textbooks term socket refers local socket address i.e combination ip address port number original definition socket given rfc 147 related arpa network 1971 socket specified 32 bit number even sockets identifying receiving sockets odd sockets identifying sending sockets today however socket communications bidirectional within operating system application created socket socket referred unique integer value called socket descriptor unix-like operating systems microsoft windows command-line tools netstat ss used list established sockets related information example modeled according berkeley socket interface sends string hello world via tcp port 80 host address 1.2.3.4 illustrates creation socket getsocket connecting remote host sending string finally closing socket several types internet socket available datagram socket type network socket provides connectionless point sending receiving data packets packet sent received datagram socket individually addressed routed order reliability guaranteed datagram sockets multiple packets sent one machine process another may arrive order might arrive sending udp broadcasts network always enabled datagram socket order receive broadcast packets datagram socket bound wildcard address broadcast packets may also received datagram socket bound specific address stream socket type network socket provides connection-oriented sequenced unique flow data without record boundaries well-defined mechanisms creating destroying connections detecting errors stream socket transmits data reliably order out-of-band capabilities internet stream sockets typically implemented top tcp applications run across networks using tcp/ip protocol sctp may also used stream sockets raw socket network socket allows direct sending receiving ip packets without protocol-specific transport layer formatting types sockets payload automatically encapsulated according chosen transport layer protocol e.g tcp udp socket user unaware existence protocol headers broadcast payload reading raw socket headers usually included transmitting packets raw socket automatic addition header optional raw sockets used security related applications like nmap one possible use case raw sockets implementation new transport-layer protocols user space raw sockets typically available network equipment used routing protocols internet group management protocol igmpv4 open shortest path first ospf internet control message protocol icmp used among things ping utility socket application programming interfaces apis example based berkeley sockets support raw sockets windows xp released 2001 raw socket support implemented winsock interface three years later microsoft limited winsock raw socket support security concerns socket types implemented transport protocols systems network architecture sna see also unix domain sockets uds internal inter-process communication computer processes provide application services referred servers create sockets start listening state sockets waiting initiatives client programs tcp server may serve several clients concurrently creating child process client establishing tcp connection child process client unique dedicated sockets created connection established state socket-to-socket virtual connection virtual circuit vc also known tcp session established remote socket providing duplex byte stream server may create several concurrently established tcp sockets local port number local ip address mapped server-child process serving client process treated different sockets operating system since remote socket address client ip address and/or port number different i.e since different socket pair tuples udp socket established state since udp connectionless therefore netstat show state udp socket udp server create new child processes every concurrently served client process handles incoming data packets remote clients sequentially socket implies udp sockets identified remote address local address although message associated remote address communicating local remote sockets called socket pairs socket pair described unique 4-tuple consisting source destination ip addresses port numbers i.e local remote socket addresses seen discussion tcp case unique socket pair 4-tuple assigned socket number udp case unique local socket address assigned socket number term socket dates rfc 147 1971 used arpanet today implementations sockets based berkeley sockets 1983 internet winsock 1991 api implementations exist streams-based transport layer interface tli 1983 berkeley sockets also known bsd socket api originated 4.2bsd unix operating system released 1983 api 1989 however could uc berkeley release versions operating system networking library free licensing constraints copyright-protected unix 1987 tli networking application programming interface provided unix system v release 3 svr3 continued release 4 svr4 early implementations written tops-20 mvs vm ibm-dos pcip socket primarily concept used transport layer internet model networking equipment routers switches require implementations transport layer operate link layer level switches internet layer routers however stateful network firewalls network address translators proxy servers keep track active socket pairs also fair queuing layer 3 switching quality service qos support routers packet flows may identified extracting information socket pairs raw sockets typically available network equipment used routing protocols igrp ospf internet control message protocol icmp | [
1616,
1710,
4291,
6248,
4926,
1916,
3172,
4759,
190,
6976,
2639,
3775,
3855,
4771,
6984,
6620,
1001,
3531,
4685,
2650,
5566,
7637,
1554,
5485,
5571,
5041,
1942,
2118,
5931,
8194,
5933,
6367,
3209,
5847,
6472,
7760,
3820,
3821,
3666,
259,
... | Test |
3,237 | 3 | Architecture_of_Interoperable_Information_Systems:architecture interoperable information systems architecture interoperable information systems aios reference architecture development interoperable enterprise information systems enterprises public administrations want engage automated business processes organizations systems must able work together i.e need interoperable aios represents generic building plan organizations develop interoperable information systems systematically adjusting extending internal information systems aios described doctoral thesis based results various research projects interoperability independent specific products vendors describes generically different layers views relationships technical means needed efficiently establish interoperable information systems aim combines concepts service-oriented architecture collaborative business business process modelling seen complementary aris well-known architecture internal information systems business processes similar automation processes inside organizations automation cross-organizational business processes important trend endeavor collaborating organizations rather strive loose coupling information systems instead tight integration collaborating information systems able work together retain much independency possible characteristic also called interoperability context collaborating organizations business interoperability i.e capability autonomous organizations execute collaborative business process among information systems systems process information i.e capture transport transform store offer information following conception prevailing information systems research information system comprises hardware software enterprise also related human actors business functions processes well organization structures broad understanding example also embodied zachman framework architecture defined “ fundamental organization system embodied components relationships environment principles governing design evolution ” sinz defines information system architecture building plan information system sense specification documentation components relationships covering relevant viewpoints well constructions rules creation building plan accordingly architecture interoperable information systems defined building plan cross-organizational information system enables organizations execute collaborative business process among following work interoperable information systems conducted european research projects 2010 architecture interoperable information systems aios published reference construction loosely coupled interoperating information systems systematic model-based enactment collaborative business processes aios aims primarily large organizations want interoperate aim describes internal information system elements systematically connected information systems collaboration partners main elements aios one element comprised third category bii-repository organization publishes content business interoperability interface bii collaboration partners since comprises external views information system elements provides publishing discovery functionalities needed service-oriented architecture bii externally relevant processes services organization structures etc described various levels technical granularity enabling organizations search also business-level elements technical artifacts different traditional soa approach instead one central service directory various partner-specific repositories implemented static part architecture builds three orthogonal axes enterprise dimensions levels technical granularity colloborative views similar private public global views known business process workflow modeling aios corresponding private public global views information system elements provided describe business processes comprehensively axis provides distinct views processes functions data organizational elements thus combination axis collaborative views private public global views processes functions data organizational roles provided description system elements different levels technical granularity supports systematic development collaborative information systems starting business requirements definition going way code level apart construction aspect thereby also multi-dimensional interoperability description provided facilitating synchronization collaborating systems level similar example aris omg mda three levels used | [
2087,
7940
] | Validation |
3,238 | 9 | Thread_safety:thread safety thread safety computer programming concept applicable multi-threaded code thread-safe code manipulates shared data structures manner ensures threads behave properly fulfill design specifications without unintended interaction various strategies making thread-safe data structures program may execute code several threads simultaneously shared address space threads access virtually memory every thread thread safety property allows code run multithreaded environments re-establishing correspondences actual flow control text program means synchronization software libraries provide certain thread-safety guarantees example concurrent reads might guaranteed thread-safe concurrent writes might whether program using library thread-safe depends whether uses library manner consistent guarantees different vendors use slightly different terminology thread-safety thread safety guarantees usually also include design steps prevent limit risk different forms deadlocks well optimizations maximize concurrent performance however deadlock-free guarantees always given since deadlocks caused callbacks violation architectural layering independent library discuss two approaches avoiding race conditions achieve thread safety first class approaches focuses avoiding shared state includes second class approaches synchronization-related used situations shared state avoided following piece java code method thread-safe class counter c programming language thread stack however static variable kept stack threads share simultaneous access multiple threads overlap running function possible static variable might changed one thread another midway checking difficult-to-diagnose logic error may compile run properly time called race condition one common way avoid use another shared variable lock mutex mutual exclusion following piece c code function thread-safe reentrant int increment_counter codice_1 called different threads without problem since mutex used synchronize access shared codice_2 variable function used reentrant interrupt handler second interrupt arises mutex locked second routine hang forever interrupt servicing disable interrupts whole system could suffer function implemented thread-safe reentrant using lock-free atomics c++11 int increment_counter | [
790,
1254,
2827,
5209,
3623,
4318,
7537,
6997,
3307,
233,
3905,
1989,
1435,
4564
] | Test |
3,239 | 8 | Celtix:celtix celtix java enterprise service bus esb runtime set apis make easy add transports message formats security features goal simplify construction integration flexible reuse technical business components using standards-based service-oriented architecture celtix code base merged codehaus xfire form apache cxf project | [
5874,
1286,
5075
] | Validation |
3,240 | 5 | Pair_gain:pair gain telephony pair gain transmitting multiple pots signals twisted pairs traditionally used single traditional subscriber line telephone systems pair gain effect creating additional subscriber lines typically used expedient way solve subscriber line shortage problems using existing wiring instead installing new wires central office customer premises term invented middle 20th century analogy earlier use gain extend telephone local loops far telephone exchange pair gain system consists concentrators multiplexers combine separate signals single signal transmitted existing copper cable pair signals separated individual subscriber lines customer premises pair gain unit performs multiplexing simply provide second telephone connection single subscriber line called analog multi-line carrier aml circumstances customer wants add new phone line fax machine dial-up internet connection larger analog pair gain system made anaconda 1960s provided seven lines pair gain units expand number subscriber lines available single copper pair many sixty large pair gain units stored serving area interfaces metal cabinets typically resembling small apartment-sized refrigerators alongside near roadways overlie communications rights-of-way dacs digital access carrier system form pair gain used united kingdom uses form time division multiple access called isdn analog pair gain came disfavor 21st century detrimental high speed dial-up modem connections support 56k incompatible digital subscriber line dsl systems 20th century subscriber loop carrier systems similar problems recent digital pair gain systems however restore 56k dsl capabilities performing functions dslam pair gain device recently term pair gain used refer multiplex/demultiplex unit used central office end users equipment used copper twisted pair digital loop carrier called remote integrated multiplexer australia installed broadband internet subscribers may disappointed informed although initial line checks successful high speed connections adsl unavailable due infrastructure issues problem pair gain lines carry high speed data | [
7824,
1374
] | Test |
3,241 | 4 | 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–30 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 – 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 £850 million 1993 £ compared £125 million security service sis mi5 mi6 december 1994 businessman roger hurn commissioned begin review gchq concluded march 1995 hurn report recommended cut £100 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 £337 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 | [
6788,
7055,
1344,
803,
6419,
1353,
2913,
5029,
1544,
7815,
5654,
6100,
1552,
5568,
485,
7646,
5185,
4890,
147,
7754,
5766,
5509,
7479,
6756,
5689,
7120,
6049,
3241,
5973,
4648
] | Test |
3,242 | 3 | 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—each 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 | [
708,
5012,
1447,
5371,
3948,
7527,
7529,
5737,
2567,
4694,
5042,
1481,
5055,
2226,
1867,
2248,
6148,
441,
2266,
4047,
5483,
1556,
5487,
6198,
1568,
1570,
6922,
7666,
515,
8024,
5521,
1232,
3747,
1237,
6236,
534,
7314,
1252,
1254,
4847,
... | Validation |
3,243 | 4 | HEAT_LANrev:heat lanrev heat lanrev formerly absolute manage systems lifecycle management software used system administrators automate administration tasks product includes server client agent software runs windows mac os x. vancouver-based absolute acquired lanrev pole position software december 2009 us 12.1 million cash 500,000 shares absolute common stock lanrev rebranded absolute manage february 2010 july 2015 absolute announced intention divest absolute manage sale absolute manage heat software completed october 5 2015 us 11.0 million product renamed heat lanrev 2010 robbins v. lower merion school district case plaintiffs charged two suburban philadelphia high schools secretly spied students surreptitiously remotely activating webcams embedded school-issued laptops students using home therefore infringed privacy rights schools admitted secretly snapping 66,000 webshots screenshots including webcam shots students bedrooms lanrev software used lower merion school district student laptop program overseen network technician michael perbix february 2010 perbix administrators district accused using software take undisclosed unauthorized photographs students webcams macintosh laptops lawsuit brought parents 15-year-old sophomore blake robbins allegedly accused illicit behavior seen computer webcam bedroom photographs taken laptop reported stolen allegedly used evidence disciplinary action fbi investigated incident philadelphia federal judge intervened sort issues relating lawsuit perbix previously praised theft track name feature lets administrators remotely photograph potential thieves computer reported stolen noting youtube video produced ’ excellent feature yes used yes gleaned results us fantastic feature trying to—especially ’ school environment lot laptops ’ worried know laptops getting missing ’ actually laptops thought stolen actually still classroom misplaced time found back turn tracking know good twenty snapshots teacher students using machines classroom lanrev new owner absolute software denounced use software illegal purpose emphasizing theft recovery left law enforcement professionals denied knowledge complicity either perbix school district actions absolute stated next update lanrev would permanently disable theft track | [
7508,
4759,
5571
] | Validation |
3,244 | 1 | Database_engine:database engine database engine storage engine underlying software component database management system dbms uses create read update delete crud data database database management systems include application programming interface api allows user interact underlying engine without going user interface dbms term database engine frequently used interchangeably database server database management system 'database instance refers processes memory structures running database engine many modern dbms support multiple storage engines within database example mysql supports innodb well myisam storage engines transactional additional engine types include database bits laid storage data structures groupings take advantage known effective algorithms retrieve manipulate properties typically storage designed meet requirements various areas extensively utilize storage including databases dbms operation always simultaneously utilizes several storage types e.g. memory external storage respective layout methods principle database storage viewed linear address space every bit data unique address address space practice small percentage addresses kept initial reference points also requires storage data accessed indirection using displacement calculations distance bits reference points data structures define access paths using pointers needed data effective manner optimized needed data access operations database operation resides simultaneously several types storage forming storage hierarchy nature contemporary computers database part inside computer hosts dbms resides partially replicated volatile storage data pieces database processed/manipulated reside inside processor possibly processor caches data read from/written memory typically computer bus far typically volatile storage components computer memory communicating data transferred to/from external storage typically standard storage interfaces networks e.g. fibre channel iscsi storage array common external storage unit typically storage hierarchy fast cache typically consisting volatile fast dram connected via standard interfaces drives possibly different speeds like flash drives magnetic disk drives non-volatile drives may connected magnetic tapes typically least active parts large database may reside database backup generations typically correlation exists currently storage speed price faster storage typically volatile data structure abstract construct embeds data well defined manner efficient data structure allows manipulation data efficient ways data manipulation may include data insertion deletion updating retrieval various modes certain data structure type may effective certain operations ineffective others data structure type selected upon dbms development best meet operations needed types data contains type data structure selected certain task typically also takes consideration type storage resides e.g. speed access minimal size storage chunk accessed etc. dbmss database administrators flexibility select among options data structures contain user data performance reasons sometimes data structures selectable parameters tune database performance databases may store data many data structure types common examples following contrast conventional row-orientation relational databases also column-oriented correlational way store data particular structure general substantial performance improvement gained different types database objects usually utilized together laid storage proximity clustered usually allows retrieve needed related objects storage minimum number input operations sometimes substantially time consuming even in-memory databases clustering provides performance advantage due common utilization large caches input-output operations memory similar resulting behavior example may beneficial cluster record item stock respective order records decision whether cluster certain objects depends objects utilization statistics object sizes caches sizes storage types etc indexing technique storage engines use improving database performance many types indexes share common property reduce need examine every entry running query large databases reduce query time/cost orders magnitude simplest form index sorted list values searched using binary search adjacent reference location entry analogous index back book data multiple indexes employee database could indexed last name hire date indexes affect performance results database designers add remove indexes without changing application logic reducing maintenance costs database grows database usage evolves indexes speed data access consume space database must updated time data altered indexes therefore speed data access slow data maintenance two properties determine whether given index worth cost | [
3255,
1447,
1449,
7341,
1730,
3776,
1359,
3863,
6279,
4505,
7182,
2575,
4708,
7379,
3307,
5852,
4430,
1491,
2054,
6932,
5419,
519,
2429,
5778,
4363,
5780,
6056,
3412,
7498,
7499,
352,
2259,
4199
] | Test |
3,245 | 4 | BitSight:bitsight bitsight cybersecurity ratings company analyzes companies government agencies educational institutions based back bay boston security ratings delivered bitsight used banks insurance companies among organizations company rated 100,000 businesses respect cybersecurity bitsight founded 2011 currently united states-based international employees 2016 bitsight raised us 40 million funding month september 2014 bitsight acquired anubisnetworks portugal-based cybersecurity firm tracks real-time data threats september 2016 bitsight raised 40 million series c round led ggv capital participation flybridge capital partners globespan capital partners menlo ventures shaun mcconnon vc divisions comcast ventures liberty global ventures singtel innov8 shaun mcconnon stepped ceo bitsight july 2017 remains executive chairman board ceo position filled tom turner june 2018 bitsight closed 60 million series funding bringing company total funding 155 million bitsight series financing led warburg pincus participation existing investors menlo ventures ggv capital singtel innov8 2018 company located cambridge purchased property order shift back bay bitsight currently located forbes estimated bitsight revenue us 100 million 2018 organizations purchase bitsight services order understand security risks associated sharing sensitive data business partners 2018 bitsight serves clients including lowe aig safeway produced 100,000 ratings respect cybersecurity companies bitsight assembles models produce company ratings based scale enables insurers rule ability businesses receive coverage respect services amy feldman forbes writes customers pay subscription basis annual fees ranging thousand dollars analyze single company 1 million review thousands suppliers similar credit score bitsight ratings range 250 900 bitsight released report examining ransomware infection across six industry sectors compiled 18,996 companies security ratings included examination ransomware infection across sectors education energy/utilities finance government healthcare retail companies security rating services spaces include riskrecon securityscorecard upguard others | [] | Test |
3,246 | 4 | Joint_Cybernetic_Operations_Command_(Italy):joint cybernetic operations command italy joint cybernetic operations command cioc italian cyberwarfare military unit project italian cyber command modelled united states cyber command envisaged 2015 defence white paper joint cybernetic operations command established 30 september 2017 intended achieve initial operational capability end 2018 full operational capability 2019 joint cybernetic operations command tasks areas information security computer network operations cyber warfare cyber security designed force provider according cioc commander air brigade general francesco vestito command two operational focus cyber-defence cyber network-defence cyber defence related static defence protection network carried cooperation rest italian military order ensure integrity network availability data flows cyber network-defence related ability carry vulnerability assessment penetration test order provide quick intervention joint cybernetic operations command supports protects military operations conducts offensive operations functions coordinating body italian armed forces italian cyber security institutions according defence undersecretary gioacchino alfano command intended operate mainly joint inter-agency nato contexts well coordination university economic worlds regard domestic cyber security organization department information security leadership via deputy director responsible cyber security operational arms joint cybernetic operations command state police cnaipic centro anticrimine informatico per la protezione delle infrastrutture critiche critical facilities anti-informatic crime protection centre well national cert ministries linked national cert cyber infrastructures command directly dependent chief defence staff defence staff italian armed forces particular depends deputy commander operations joint cybernetic operations command consists command staff element personnel section operational unit training unit cyber branch tlc school chiavari experimental unit tasked study malaware countermeasures command recruit also personnel part military operational unit handles cyber operational cells actual operational pawns cells tasked operate field field commander may employ order achieve operational goals command located near military intelligence service centro intelligence interforze castel malnome near rome far leonardo da vinci–fiumicino airport | [
6756,
2684
] | Test |
3,247 | 6 | Tagsistant:tagsistant tagsistant semantic file system linux kernel written c based fuse unlike traditional file systems use hierarchies directories locate objects tagsistant introduces concept tags computing file system type data store could used store retrieve update files file uniquely located path user must know path advance access file path necessarily include information content file tagsistant uses complementary approach based tags user create set tags apply tags files directories objects devices pipes ... user search objects match subset tags called query kind approach well suited managing user contents like pictures audio recordings movies text documents incompatible system files like libraries commands configurations univocity path security requirement prevent access wrong content tagsistant file system features four main directories tags created sub directories codice_1 directory used queries complying syntax subquery arbitrarily long list tags concatenated directories portion path delimited codice_1 codice_5 actual query codice_6 operator joins results different sub-queries one single list codice_5 operator ends query returned result following query object must tagged codice_9 codice_10 codice_9 codice_12 object tagged codice_10 codice_12 codice_9 retrieved query syntax deliberately violates posix file system semantics allowing path token descendant like codice_16 codice_9 appears twice consequence recursive scan tagsistant file system exit error endlessly loop done unix codice_18 ~/tagsistant_mountpoint find tags/ tags/ tags/document tags/document/+ tags/document/+/document tags/document/+/document/+ tags/document/+/document/+/document tags/document/+/document/+/document/+ drawback balanced possibility list tags inside query order query codice_19 completely equivalent codice_20 codice_21 equivalent codice_22 codice_5 element precise purpose restoring posix semantics path codice_24 refers traditional directory recursive scan path properly perform tagsistant features simple reasoner expands results query including objects tagged related tags relation two tags established inside codice_25 directory following three level pattern codice_27 element includes is_equivalent include rock tag music tag unix command codice_28 used reasoner recursively resolve relations allowing creation complex structures web relations created inside codice_25 directory constitutes basic form ontology tagsistant features autotagging plugin stack gets called file symlink written plugin called declared mime type matches list working plugins released tagsistant 0.6 limited tagsistant file system corresponding repository containing codice_38 directory objects actually saved codice_39 file holding tagging information sqlite database mysql database engine specified codice_40 argument codice_39 file empty another file named codice_42 glib ini store repository configuration tagsistant 0.6 compatible mysql sqlite dialects sql tag reasoning tagging resolution porting logic sql dialects possible differences basic constructs especially intersect sql keyword must considered codice_38 directory introduced provide quick way access objects without using tags objects listed inode number prefixed codice_44 directory features read-only files containing usage statistics file codice_45 holds compile time information current repository configuration highlighted relying external database store tags tagging information could cause complete loss metadata database gets corrupted highlighted using flat namespace tends overcrowd codice_1 directory could mitigated introducing triple tags | [
1710,
1269,
3863,
5571,
2528,
1435,
1805
] | Validation |
3,248 | 3 | SSSE3:ssse3 supplemental streaming simd extensions 3 ssse3 sse3s simd instruction set created intel fourth iteration sse technology ssse3 first introduced intel processors based core microarchitecture june 26 2006 woodcrest xeons ssse3 referred codenames tejas new instructions tni merom new instructions mni first processor designs intended support ssse3 contains 16 new discrete instructions instruction act 64-bit mmx 128-bit xmm registers therefore intel materials refer 32 new instructions according intel ssse3 provide 32 instructions represented 14 mnemonics accelerate computations packed integers include table satsw x read 'saturate signed word takes signed integer x converts −32768 less −32768 +32767 greater 32767 leaves unchanged otherwise normal intel architecture bytes 8 bits words 16 bits dwords 32 bits 'register refers mmx xmm vector register nawaf 9 | [
6502,
5540,
2449,
2000,
1252,
2814,
3173,
2989,
4845,
6698,
3942,
4765,
3443,
4224,
6173,
6344,
5559,
6523,
6616,
4108,
1465,
2744,
5665,
5934,
742,
3717,
5669,
584,
3803,
5055,
2226,
5670,
6647,
1961,
1770,
3565,
4077,
6563,
2240,
6133,
... | Validation |
3,249 | 4 | Download_Valley:download valley download valley cluster software companies israel producing delivering adware installed alongside downloads software primary purpose monetize shareware downloads software items commonly browser toolbars adware browser hijackers spyware malware another group products download managers possibly designed induce trick user install adware downloading piece desired software mobile app certain source term refer actual geographical region valley pun based silicon valley common practice using downloads deliver bundled software users many companies located tel aviv surrounding region used israeli media well reports related business download managers download valley companies used major download portals software hosts including download.com cnet softonic.com sourceforge smaller adware companies sweetpacks smilebox purchased larger company perion networks 41 million 32 million ibario claimed worth 100 million early 2014 conduit valued 1.4 billion jp morgan 2012 revenues frequently near 100 million several 100 million large companies perion 87 million 2013 conduit claimed 500 million 2012 much lower operating net income perion 3.88 million operating 310.000 net income 2013 numbers highly volatile since technical legal preconditions quickly change profit opportunities 2013 2014 changes web browsers prevent unwanted toolbar installs new policy microsoft towards advertising lead expectation main profit methods companies would soon work longer perion stock lost roughly two thirds value 2014 13.25 january 4.53 december 29 many products may designed way install solicited user downloads desired product create revenue software usually distributed free may use invasive harmful techniques achieve installs installers may installed adware frequently attempts hide identity prevent disabling removal restoring previous settings spy user system browsing habits download install unwanted software open backdoors possibly malicious attacks many security software vendors list products category potentially unwanted programs pup also pus pua grayware offer detection removal category distinct genuine malware used software companies opposed criminal underground programmers threaten practice litigation 2013 download valley company ibario accused security software vendor trend micro distributing sefnit/mevade malware installer related ukrainian company considered immediately responsible malware unnamed download valley executive admitted wall street journal companies employ teams 15 developers break security suites try block software | [
3911,
73,
74,
2842,
716,
6305,
3486,
359,
88
] | Validation |
3,250 | 9 | CLX_(Common_Lisp):clx common lisp clx standard x window system client library common lisp equivalent xlib library c programming language clx written solely common lisp use xlib clx contains data types functions macros interact x server sending requests receiving events replies | [
1716,
6876,
1445,
6888,
2915,
6352,
3370,
6191,
4878,
4332,
5494,
5757,
6116,
3212,
7750,
6210,
1116,
6471,
940,
1676,
4535,
5077,
2249,
1890,
1989
] | Validation |
3,251 | 4 | MobileNotifier:mobilenotifier mobilenotifier free open-source alert messaging system written peter hajas jailbroken ios devices including iphone ipod touch ipad ios 4.0 mobile notifier written reproduction android notifications currently released bsd license lead developer peter hajas left work apple project continued developers software hooks operating system replace built-in modal notification user interface maintains queue unread messages user late may 2011 mobilenotifier 230,000 downloads mobilenotifier developed conjunction rensselaer center open source software rensselaer polytechnic institute mobilenotifier beta released 29 may 2011 included following new features solved following issues released 4 may 2011 included following new features solved following issues released 27 february 2011 included following new features solved following issues released 18 february 2011 included following new features solved following issues mobilenotifier beta1 officially released solved following issues | [
6788,
6489,
4575,
3940,
5571,
1435,
7848,
2327
] | Test |
3,252 | 9 | ALCOR:alcor alcor early computer language definition created alcor group consortium universities research institutions manufacturers europe united states founded 1959 60 members 1966 group aim common compiler specification subset algol 60 algol meeting copenhagen 1958 alcor acronym algol converter addition naming alcor astronomical reference algol named addition programming application star algol way alcor also named astronomical reference star alcor europe high level machine architecture algol 60 devised emulated various real computers among siemens 2002 ibm 7090 algol manual published provided detailed introduction features language many program snippets four appendixes | [
1361,
1114,
964
] | Test |
3,253 | 4 | Imprivata:imprivata imprivata security company based lexington massachusetts founded 2002 imprivata develops sells onesign platform securing employee access desktops networks applications using single sign-on 2017 imprivata 1,700 clients several offices across america europe australia imprivata customers primarily healthcare industries imprivata became public company june 25 2014 listed new york stock exchange acquired private equity investment firm thoma bravo llc 2016 imprivata founded phil scarfo david ting developed identity management technology working polaroid corporation ’ small business incubator company shipped first product onesign enterprise single sign-on appliance 2004 2005 imprivata expanded europe africa middle east 2006 imprivata founder david ting selected infoworld one top 25 chief technology officers year 2009 imprivata acquired assets identiphi manufacturer reseller biometric technology including safsolution product line 2011 acquired assets validus medical systems santa cruz california incorporated imprivata cortext technology july 2016 imprivata announced agreed acquired thoma bravo private equity firm based san francisco 19.25 per share estimated total 544 million omar hussain chief executive time imprivata onesign helps companies manage user access authentication product reviews suggest onesign allows companies enable enterprise applications single sign without requiring custom scripting modifications existing directories onesign also strengthen user authentication desktops networks replacing passwords range authentication options include finger biometrics proximity cards smart cards many national government id cards one-time-password tokens employee ’ physical location product reviews also comment onesign ability simplify compliance reporting consolidating employee strong authentication application access events single database | [] | Test |
3,254 | 9 | QED_manifesto:qed manifesto qed manifesto proposal computer-based database mathematical knowledge strictly formalized proofs checked automatically q.e.d means latin meaning demonstrated idea project arose 1993 mainly impetus robert boyer goals project tentatively named qed project project qed outlined qed manifesto document first published 1994 input several researchers explicit authorship deliberately avoided dedicated mailing list created two scientific conferences qed took place first one 1994 argonne national laboratories second 1995 warsaw organized mizar group project seems died 1996 never produced discussions plans 2007 paper freek wiedijk identifies two reasons failure project order importance nonetheless qed-style projects regularly proposed mizar library successfully formalized large portion undergraduate mathematics largest library another project metamath proof database 2014 twenty years qed manifesto workshop organized part vienna summer logic | [
3149,
260,
3895,
7428,
6611,
7713,
3141
] | Test |
3,255 | 1 | DBase:dbase dbase also stylized dbase one first database management systems microcomputers successful day dbase system includes core database engine query system forms engine programming language ties components together dbase underlying file format file widely used applications needing simple format store structured data dbase originally published ashton-tate microcomputer operating system cp/m 1980 later ported apple ii ibm pc computers running dos pc platform particular dbase became one best-selling software titles number years major upgrade released dbase iii ported wider variety platforms adding unix vms mid-1980s ashton-tate one big three software publishers early business software market others lotus development wordperfect starting mid-1980s several companies produced variations dbase product especially dbase programming language included foxbase+ later renamed foxpro clipper so-called xbase products many technically stronger dbase could push aside market changed disastrous introduction dbase iv whose design stability poor many users switched products time growing use ibm-invented sql structured query language database products another factor user adoption microsoft windows desktop computers shift toward sql windows put pressure makers xbase products invest major redesign provide new capabilities early 1990s xbase products constituted leading database platform implementing business applications size impact xbase market go unnoticed within one year three top xbase firms acquired larger software companies following decade original xbase products faded prominence several disappeared products known dbase still exist owned dbase llc late 1960s fred thompson jet propulsion laboratory jpl using tymshare product named retrieve manage database electronic calculators time expensive products 1971 thompson collaborated jack hatfield programmer jpl write enhanced version retrieve became jpldis project jpldis written fortran univac 1108 mainframe presented publicly 1973 hatfield left jpl 1974 jeb long took role working jpl contractor c. wayne ratliff entered office football pool interest game felt could win pool processing post-game statistics found newspapers order turned attention database system chance came across documentation jpldis used basis port ptdos kit-built imsai 8080 microcomputer called resulting system vulcan mr. spock star trek george tate hal lashlee built two successful start-up companies discount software one first sell pc software programs mail consumers software distributors one first wholesale distributors pc software world entered agreement ratliff market vulcan formed ashton-tate name ashton chosen purely marketing reasons ratliff ported vulcan ptdos cp/m hal pawluk handled marketing nascent company decided change name business-like dbase pawluk devised use lower case all-caps base create distinctive name pawluk suggested calling new product version two ii suggest less buggy initial release dbase ii result became standard cp/m application along wordstar supercalc 1981 ibm commissioned port dbase then-in-development pc resultant program one initial pieces software available ibm pc went sale fall 1981. dbase one professional programs platform time became huge success customer base included end-users increasing number value added resellers vars purchased dbase wrote applications sold completed systems customers may 1983 release dbase ii runtime entrenched dbase var market allowing vars deploy products using lower-cost runtime system although critics stated dbase difficult learn success created many opportunities third parties 1984 1,000 companies offered dbase-related application development libraries code add functionality applications using dbase ii runtime consulting training how-to books company san diego today known advisor media premiered magazine devoted professional use dbase data based advisor circulation exceeded 35,000 eight months activities fueled rapid rise dbase leading product type adam b green helped popularize dbase ii via legal difficulties ashton-tate publisher dbase ii software platforms operating systems proliferated early 1980s company found difficult port assembly language-based dbase target systems led re-write platform c programming language using automated code conversion tools resulting code worked essentially undocumented inhuman syntax problem would prove serious future resulting dbase iii released may 1984 although reviewers widely panned lowered performance product otherwise well reviewed rapid upgrades system stabilized best-seller throughout 1980s formed famous application trio pc compatibles dbase lotus 123 wordperfect fall 1984 company 500 employees taking 40 million year sales vast majority dbase products introduced 1988 delays dbase iv 300 new improved features foxpro made inroads even dbase iv support query example sql enough five years later top 3 implementations dbase language bought microsoft borland computer associates version called dbase plus 8 released used build ... web ... server-based applications along way borland bought ashton tate brought revised dbase iv 1992 focus described designed programmers rather ordinary users handling data dbase provided detailed procedural commands functions dbase application development language integrated navigational database management system ashton-tate labeled relational meet criteria defined dr. edgar f. codd relational model used runtime interpreter architecture allowed user execute commands typing command line dot prompt similarly program scripts text files prg extensions ran interpreter command dbase programs easy write test business person programming experience could develop applications time ashton-tate competitors introduced so-called clone products compilers robust programming features user-defined functions udfs arrays complex data handling ashton-tate competitors also began incorporate sql ansi/iso standard language creating modifying retrieving data stored relational database management systems eventually became clear dbase world expanded far beyond ashton-tate third-party community formed consisting fox software nantucket alpha software data based advisor magazine sbt application development firms major developer groups paperback software launched flexible fast vp-info unique built-in compiler community dbase variants sought create dbase language standard supported ieee committee x3j19 initiative ieee 1192 said xbase distinguish ashton-tate product a-t saw rise xbase illegal threat proprietary technology 1988 filed suit fox software santa cruz operation sco copying dbase structure sequence foxbase+ sco marketed xenix unix versions fox products december 1990 u.s. district judge terry hatter jr. dismissed ashton-tate lawsuit invalidated ashton-tate copyrights disclosing dbase based part public domain jpldis october 1991 case still appeal borland international acquired ashton-tate one merger provisions u.s. justice department required borland end lawsuit fox allow companies use dbase/xbase language without threat legal action end 1992 major software companies raised stakes acquiring leading xbase products borland acquired ashton-tate dbase products later wordtech xbase products microsoft acquired fox software foxbase+ foxpro products computer associates acquired nantucket clipper products advisor media built data based advisor magazine launching foxpro advisor clipper advisor developer magazines journals live conferences developers however planned dbase advisor magazine aborted due market failure dbase iv year 2000 xbase market faded developers shifted new database systems programming languages computer associates later known ca eventually dropped clipper borland restructured sold dbase major acquirers microsoft stuck xbase longest evolving foxpro visual foxpro product longer offered 2006 advisor media stopped last-surviving xbase magazine foxpro advisor era xbase dominance ended still xbase products dbase product line owned dbase llc currently sells dbase™ plus 12.3 dos-based dbase classic™ dbdos™ run 64-bit windows open source implementations available harbour xharbour also clip 2015 new member xbase family born xsharp x language open source project compiler ide well microsoft visual studio integration xsharp produces .net assemblies uses familiar xbase language xsharp product created group four enthusiasts worked vulcan.net project past compiler created top roslyn compiler code code behind c vb compilers microsoft today implementations dbase language expanded include many features targeted business applications including object-oriented programming manipulation remote distributed data via sql internet functionality interaction modern devices following example opens employee table empl gives every manager supervises 1 employees 10-percent raise prints names salaries note one keep mentioning table name assumed current table stays told otherwise origins interpreted interactive language dbase used variety contextual techniques reduce amount typing needed facilitated incremental interactive development also made larger-scale modular programming difficult tenet modular programming correct execution program module must affected external factors state memory variables tables manipulated program modules dbase designed mind developers careful porting borrowing programming code assumed certain context would make writing larger-scale modular code difficult work-area-specific references still possible using arrow notation b- customer multiple tables could manipulated time addition developer foresight name tables appropriately could clearly refer large number tables open time notation employee- salary vacation- start_date alternatively alias command could appended initial opening table statement made referencing table field unambiguous simple example one open table assign alias fashion use emp alias employee henceforth refer table variables employee- name another notable feature re-use clauses different commands example clause limits scope given command somewhat comparable sql clause different commands list delete replace browse etc could accept clause limit filter scope activity simplifies learning language dbase also one first business-oriented languages implement string evaluation tells interpreter evaluate string stored mymacro programming code example feature made dbase programming flexible dynamic sometimes called meta ability profession could allow programming expressions placed inside tables somewhat reminiscent formulas spreadsheet software however could also problematic pre-compiling making programming code secure hacking dbase tended used custom internal applications small medium companies lack protection copying compared compiled software often less issue addition dot-prompt dbase iii iii+ dbase iv came packaged assist application manipulate data queries well appsgen application allowed user generate applications without resorting code writing like 4gl dbase iv appsgen tool based largely portions early cp/m product named personal pearl although language fallen favor primary business language find dbase excellent interactive ad-hoc data manipulation tool whereas sql retrieves data sets relational database rdbms dbase one easily manipulate format analyze perform calculations individual records strings numbers step-by-step imperative procedural way instead trying figure use sql declarative operations granularity operations generally smaller sql making easier split querying table processing easy-to-understand easy-to-test parts example one could insert browse operation filtering aggregation step study intermediate table view applied filter aggregation step applied application development platform dbase fills gap lower-level languages c c++ java high-level proprietary 4gls fourth generation languages purely visual tools providing relative ease-of-use business people less formal programming skill high productivity professional developers willing trade low-level control dbase remained popular teaching tool even sales slowed text-oriented commands easier present printed training material mouse-oriented competitors mouse-oriented commands added product time command language remained popular de facto standard mousing commands tended vendor-specific major legacy dbase file format adopted number applications example shapefile format developed esri spatial data pc arcinfo geographic information system uses .dbf files store feature attribute data microsoft recommends saving microsoft works database file dbase file format read microsoft excel package available emacs read xbase files libreoffice openoffice calc read write generic dbf files dbase database system one first provide header section describing structure data file meant program longer required advance knowledge data structure rather could ask data file structured several variations .dbf file structure dbase-related products .dbf file structures compatible vp-info unique read variants dbf file structure second filetype file format memo fields character fields limited 254 characters memo field 10-byte pointer file include much larger text field dbase limited ability process memo fields xbase languages clipper treated memo fields strings like character fields purposes except permanent storage dbase uses files single indexes multiple-index files holding 1 48 indexes xbase languages vp-info include compatibility files others use different file formats used clipper used foxpro flagship later iterations clipper included drivers indexes jerry pournelle july 1980 called vulcan infuriatingly excellent software powerful documentation poor praised speed sophisticated queries said lot pounding table screaming rage documentation movie office space character peter gibbons programmer played ron livingston working make company systems y2k compliant bookshelf book understanding dbase iii plus alan simpson clearly seen | [
6507,
4290,
1526,
5898,
4759,
7618,
3757,
914,
5571,
6543,
6817,
7467,
4252,
6462,
7561,
5852,
2866,
6380,
7109,
2056,
6386,
336,
5252,
2515,
4454,
8144,
3244,
4915,
1435,
4653
] | Test |
3,256 | 3 | Linux_Virtual_Server:linux virtual server linux virtual server lvs load balancing software linux kernel–based operating systems lvs free open-source project started wensong zhang may 1998 subject requirements gnu general public license gpl version 2 mission project build high-performance highly available server linux using clustering technology provides good scalability reliability serviceability major work lvs project develop advanced ip load balancing software ipvs application-level load balancing software ktcpvs cluster management components lvs used building highly scalable highly available network services web email media voip services integrating scalable network services large-scale reliable e-commerce e-government applications lvs-based solutions already deployed many real applications throughout world including wikipedia lvs components depend upon linux netfilter framework source code available codice_1 subdirectory within linux kernel source lvs able handle udp tcp layer-4 protocols well ftp passive connection inspecting layer-7 packets provides hierarchy counters codice_2 directory userland utility program used configure lvs called ipvsadm requires superuser privileges run lvs implements several balancing schedulers listed relevant source files commonly used terms include following setting virtual http server two real servers ipvsadm -a -t 192.168.0.1:80 -s rr ipvsadm -a -t 192.168.0.1:80 -r 172.16.0.1:80 -m ipvsadm -a -t 192.168.0.1:80 -r 172.16.0.2:80 -m first command assigns tcp port 80 ip address 192.168.0.1 virtual server chosen scheduling algorithm load balancing round-robin codice_13 second third commands adding ip addresses real servers lvs setup forwarded network packets shall masked codice_14 querying status configured lvs setup ip virtual server version 1.0.8 size=65536 prot localaddress port scheduler flags tcp 192.168.0.1:80 rr | [
2182,
3613,
7528,
7532,
5744,
6443,
4341,
5762,
3666,
83,
5453,
5460,
7242,
1535,
1924,
6892,
1176,
1933,
7637,
3383,
1208,
6211,
5865,
7669,
1227,
1596,
165,
7312,
1607,
5884,
1991,
6984,
5571,
578,
4877,
5580,
2765,
2776,
4174,
7038,
... | Test |
3,257 | 4 | 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—or—imperceptible watermarks creation robust—and—imperceptible 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.. | [
6462,
7846,
287,
4420,
7392
] | Test |
3,258 | 7 | Douglas_Parkhill:douglas parkhill douglas f. parkhill canadian technologist former research minister best known pioneering work called cloud computing work canada telidon videotex project started working canadian ministry communications part department trade industry 1969 previously worked mitre corporation responsible many activities communications satellites computer communications command control systems telecommunications winner treasury board canada secretariat outstanding achievement award 1982 conestoga shield services government industry computer communications research development touche ross award telidon development author several publications including 1966 book challenge computer utility book parkhill thoroughly explored many modern-day characteristics cloud computing elastic provisioning utility service well comparison electricity industry use public private government community forms book mckinsey foundation award distinguished contributions management literature worked dave godfrey canadian writer novelist later book gutenberg two social political meaning computer technology charge research federal department communications time department funding development telidon videotext system heavily involved promoting system overall control program radio broadcast 1980 outlined potential system financial information theatre reservations ability pay print tickets system later documented history telidon project history videotex general | [
2961
] | Test |
3,259 | 9 | John_Wainwright_(computer_scientist):john wainwright computer scientist john wainwright computer scientist born australia pioneered development pure object-based computer languages principal architect two computer languages scriptx 1992–1996 maxscript 1996 1992 wainwright sold apple computer structural framework object based language virtual machine operating system called objects c. became lead architect scriptx language media player developed kaleida labs kaleida labs closed doors 1996 wainwright went serve principal architect maxscript scripting language autodesk 3ds max language used game development part maxis sims animation processing pipeline compared scriptx maxscript explicit syntax support 3d animation wainwright chief technology officer crowd science online advertising technology company co-founded 2007 nephew john martin paul neto crowd science funded granite ventures wainwright also first non-employee amazon.com customer ordering book fluid concepts creative analogies amazon building named | [] | Test |
3,260 | 4 | Snarfing:snarfing snarf term used computer programmers meaning grab large document file content data use without author owner permission unix community term means acquisition file set files across network also refers using command line tools transfer files http gopher finger ftp protocols without user interaction method achieving cache coherence multiprocessing computer architecture observation writes cached data example snarf evil twin attack using simple shell script running software like airsnarf create wireless hotspot complete captive portal wireless clients associate snarf access point receive ip dns gateway appear completely normal users dns queries resolve attacker ip number regardless dns settings website attempt visit bring snarf splash page requesting username password username password entered unsuspecting users mailed root localhost reason works | [
4808,
7494
] | Test |
3,261 | 7 | Appirio:appirio appirio wipro company information technology consulting company headquartered indianapolis indiana united states offers technology professional services companies wishing adopt public cloud applications includes software-as-a-service platform-as-a-service technologies like salesforce.com google apps appirio founded chris barbin former borland software cio narinder singh glenn weinstein mike ’ brien 2006 2007 appirio established headquarters salesforce.com ’ startup incubator san mateo california 2012 appirio moved headquarters san francisco california august 2015 appirio announced indianapolis office would named company headquarters early 2008 appirio secured series investment 1.1 million salesforce.com angel investors firm next secured 5.6 million series b funding sequoia capital july 2008 series c round came february 2009 10 million funding sequoia capital ggv capital series funding round 60 million followed march 2012 led private equity firm general atlantic october 2009 appirio chief architect jason ouellette released book titled development force.com platform building business applications cloud released addison-wesley professional april 2010 appirio named ondemand company year alwayson selected best place work bay area san francisco business times listed gartner cloud computing/saas integration july 2010 appirio featured new polymath profiles compound-technology innovations technology novel written vinnie mirchandani march 2011 appirio acquired infowelders salesforce consultancy based louisville ky december 2011 appirio acquired saaspoint provider cloud consulting services europe november 2012 went acquire knowledge infusion human resources talent management advisory consulting services firm september 2013 appirio acquired topcoder community 500,000 developers engineers designers find collaborate software development assignments ranging applications websites back-end corporate systems cloudspokes appirio competing platform 75,000 users merged topcoder january 2014 appirio currently headquartered indianapolis satellite offices san francisco california minato tokyo japan london uk dublin ireland sydney australia espoo finland stockholm sweden porto portugal pune bangalore greater noida hyderabad jaipur india appirio runs serverless company utilizing public cloud solutions in-house datacenter 20 october 2016 appirio announced acquired wipro indian information technology services corporation based bangalore india 500 million appirio ranks among firms like acumen solutions bluewolf acquired ibm cloud sherpas acquired accenture market cloud computing solutions increasingly appirio found primary competitor global system integrators accenture deloitte | [
2961,
7037
] | Test |
3,262 | 7 | 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×6 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 | [
6332,
3764,
3531,
7453,
1377,
578,
4879,
742,
496,
1670,
6133,
2332,
2961,
6945,
1237,
352,
4840
] | Test |
3,263 | 2 | 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–4 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ür 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 | [
7879,
3937,
378,
2198,
6092,
6096,
1475,
4697,
7553,
744,
7195,
5410,
7564,
2953,
422,
6844,
2245,
5429,
435,
2614,
5442,
4377,
5090,
3340,
7602,
6164,
4759,
1534,
6885,
7247,
7619,
2999,
5475,
6528,
2290,
4774,
5122,
1181,
3711,
5134,
... | Test |
3,264 | 4 | FBI_Criminal,_Cyber,_Response,_and_Services_Branch:fbi criminal cyber response services branch criminal cyber response services branch ccrsb service within federal bureau investigation fbi created 2002 part u.s. government post-9/11 response ccrsb responsible investigating financial crime white-collar crime violent crime organized crime public corruption violations individual civil rights drug-related crime addition branch also oversees computer-based crime related counterterrorism counterintelligence criminal threats united states ccrsb deploys fbi agents analysts computer scientists uses traditional investigative techniques sources wiretaps surveillance forensics ccrsb works conjunction federal state regional agencies 56 field offices national cyber investigative joint task force ncijtf ccrsb operates 24-hour cyber command center cywatch combine resources fbi ncijtf event significant cyber intrusion provide connectivity federal cyber centers government agencies fbi field offices legal attachés private sector also exchange information cyber threats private sector partnerships domestic security alliance council infragard national cyber forensics training alliance ncfta ccrsb maintains overseas legal attaché offices coordinate cyber investigations address jurisdictional hurdles differences law countries collaborating cyber crime centers interpol europol unit also maintains website called cyber shield alliance www.leo.gov provides access cyber training information public means report cyber incidents fbi fbi reports since 2002 seen 80 percent increase number computer intrusion investigations headed fbi executive assistant director ccrsb responsible fbi director deputy director current ccrsb executive assistant director amy hess ccrsb formed unification fbi various traditional crime fighting units speculated establishment national security branch traditional criminal investigations branch within fbi lead formation career paths fbi special agents meaning new agent completed special agent training fbi academy quantico virginia completed mandatory probationary period choose go national security branch go criminal part bureau focus crimes organized crime narcotics civil rights violations fraud violent crime advocates new program say re-organization help fight terrorism making less bureaucratic | [
7646,
2505,
2382
] | Train |
3,265 | 4 | Federal_Service_for_Technical_and_Export_Control:federal service technical export control federal service technical export control fstec fstek military agency russian federation russian ministry defence licenses export weapons dual-use technology items also responsible russian military information security fstec maintains data security threats database russia national vulnerability database requires western technology companies submit source code trade secrets allowing products imported russia fstec also liaises fsb controls cryptography russia 2019 fstec granted astra linux special status regarding use processing russian classified information | [
2864,
1722,
1805
] | Test |
3,266 | 9 | Visual_DialogScript:visual dialogscript visual dialogscript vds interpreted programming language microsoft windows used create small fast programs vds large number dialog graphical elements available create professional looking programs vds programs access windows api therefore possible write applications perform advanced tasks programming languages visual basic c++ delphi unlike programming languages syntax vds simple command occupies one line plain english name clearly describes purpose variables typeless hold many kinds information example numbers text functions clearly distinguishable names start like spreadsheet dialogscript language simple syntax unlike ms-dos batch language designed ease use efficiency interpreted run-time engine 10 system variables 0 9 initially script file name 0 command line parameters 1 9 batch file also 26 user variables z contents variables including system ones changed script running also 4032 global variables variables begin letter alphanumerics plus underscores e.g my_variable_1 limit length user-defined variable names comments simple information message box simple warning message box create custom dialog box write windows registry display input prompt dialog box storing result variable visual dialogscript created julian moss jm-tech 1998 version 3.0 emmanuel daunizeau s.a.d.e sarl took ownership development vds modifying improving syntax recently vds marketed british company commercial research ltd. still property emmanuel daunizeau continues develop several versions vds released time several versions available download | [
4759,
3772,
4017
] | Test |
3,267 | 7 | Distributed_R:distributed r distributed r open source high-performance platform r language splits tasks multiple processing nodes reduce execution time analyze large data sets distributed r enhances r adding distributed data structures parallelism primitives run functions distributed data task scheduler multiple data loaders mostly used implement distributed versions machine learning tasks distributed r written c++ r retains familiar look feel r. hewlett-packard hp provides enterprise support distributed r proprietary additions fast data loader vertica database distributed r begun 2011 indrajit roy shivaram venkataraman alvin auyoung robert s. schreiber research project hp labs open sourced 2014 gplv2 license available github february 2015 distributed r reached first stable version 1.0 along enterprise support hp distributed r platform implement execute distributed applications r. goal extend r distributed computing retaining simplicity look-and-feel r. distributed r consists following components hp vertica provides tight integration database open source distributed r platform hp vertica 7.1 includes features enable fast parallel loading vertica database distribute r. parallel vertica loader five times 5x faster using traditional odbc based connectors vertica database also supports deployment machine learning models database distributed r users call distributed algorithms create machine learning models deploy vertica database use model in-database scoring predictions architectural details vertica database distributed r integration described sigmod 2015 paper | [
3764,
4070,
5571,
7848,
578
] | Validation |
3,268 | 1 | Db2_(Formerly_Db2_for_LUW):db2 formerly db2 luw db2 database formerly known db2 linux unix windows database server product developed ibm also known db2 luw brevity part db2 family database products db2 luw common server product member db2 family designed run popular operating systems contrast db2 products specific single platform june 27 2019 ibm released db2 v11.5 artificial intelligence ai database version 11.5 ibm db2® extending legacy dependability adding ai functionality designed help optimize performance support data scientists ’ mission find deeper insights powered built ai db2 11.5 built ai enhancements support popular languages frameworks used ai developers db2 11.5 native language support python ruby go java php node.js sequelize supports popular frameworks visual studio code jupyter notebooks db2 11.5 powered ai since includes features machine learning-based ml optimizer augmented data explorer ade ml optimizer supplement existing cost-based optimizer ade uses natural language querying faceted search natural language generation capabilities make easy users easily explore data stored db2 db2 adds ai functionality top capabilities enterprises relied decades mission-critical transactional analytics workloads supported hardware acceleration in-memory technology db2 columnar data store functionality blu acceleration® feature uses advanced compression techniques deliver reliably faster response times without limitations in- memory-only systems db2 11.5 ’ ai enhancements designed help companies achieve deeper insights quickly support ai applications greater ease combined existing db2 performance-boosting technology new capabilities make db2 perfect solution help business climb ladder robust ai practice db2 part hybrid data management platform offering hybrid data management enables enterprises drive innovation seamlessly accessing sharing analyzing data higher level data management enables structured semistructured unstructured data easily accessed analyzed whether stored premises public cloud private cloud open source combination deployments first release advanced db2 luw db2 universal database version 5 available unix windows os/2 platforms new product stemmed two earlier products db2 common server version 2 db2 parallel edition db2 universal database version 5 continued ibm new direction using common code base support db2 different platforms incorporating shared nothing features db2 parallel edition support large data warehousing databases db2 luw initially called db2 universal database udb time ibm marketing started use term database products notably mainframe z-series db2 thus db2 linux unix windows moniker became necessary distinguish common server db2 luw product single-platform db2 products current db2 luw product runs multiple linux unix distributions red hat enterprise linux suse linux ibm aix hp-ux solaris windows systems earlier versions also ran os/2 multiple editions marketed different sizes organisation uses code base also marketed without db2 name ibm infosphere warehouse edition 2017 db2 udb name became db2 addition standard acid-compliant row-organized relational database functionality key features ibm offers three editions db2 community edition standard server edition advanced server edition ibm db2 community edition free download use redistribute edition ibm db2 data server xml database relational database management system features limited four cpu cores 16 gb ram database size 100 gb enterprise support fix packs db2 community edition limit number users june 27 2019 ibm released db2 v11.5 db2 update designed deliver enhancements help automate data management eliminate etl support artificial intelligence data workloads along update ibm unveiled streamlined offerings free version db2 community edition version db2 contains features include expiration caps version db2 four cpu cores 16 gb ram ibm db2 community edition replaces db2 express edition june 27 2019 ibm announced special free version db2 database called db2 community edition db2 community edition created 11.5 release ibm db2 db2 community edition replaced previously free version ibm db2 known db2 express-c. january 30 2006 ibm announced special free version db2 express edition called db2 express-c db2 express-c edition created 8.2 release ibm db2 db2 express-c created new db2 versions 9.1 codenamed viper 9.5 codename viper 2 9.7 codename cobra 10.01 codename galileo 10.5 codename kepler 11.1 ibm db2 purexml implementation xml database features introduced beta db2 9 community edition download available following platforms ibm® db2 11.5 edition aix® ibm® db2 11.5 edition windows® amd64 intel® em64t systems x64 ibm® db2 11.5 linux® amd64 intel® em64t systems x64 ibm® db2 11.5 linux® power little endian systems also docker image download available community edition ibm db2 community edition limited use 16 gb ram four cpu cores database engine limit number concurrent user connections prior version ibm db2 express-c limited use 16 gb ram increase 4 gb v10.5 two cpu cores db2 community edition feature set similar db2 standard advanced editions main difference community edition lower cpu memory limits supported unsupported following extra features enabled db2 community edition unsupported regular db2 fix packs applied ibm release fixes publish updated installation images remove old ones unix versions need reinstalled possible perform in-place updates windows versions running installation program newer version need access regular db2 fix packs released several times per year need buy db2 standard advanced editions installation images traditionally refreshed every major db2 release sync code second fix pack db2 community editions annual subscriptions instead free trial available indefinitely users want scale beyond four cores 16 gb ram need migrate workload upgraded environment instead users apply license key existing implementation access additional capacity | [
3514,
4759,
5810,
3268,
7341,
7067,
3005,
4408,
1466,
5571,
6543,
578,
7003,
3975,
4798,
3807,
3396,
6130,
336,
517,
3915,
4274,
2796,
6586,
352,
5617,
4743,
2803,
784,
1435
] | Test |
3,269 | 1 | 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 | [
593
] | Test |
3,270 | 2 | Memory_Technology_Device:memory technology device memory technology device mtd type device file linux interacting flash memory mtd subsystem created provide abstraction layer hardware-specific device drivers higher-level applications although character block device files already existed semantics n't map well way flash memory devices operate usb sticks mmcs sds compactflashes popular removable devices confused mtds although contain flash memory hidden behind block device interface using flash translation layer using mtd use mtd aware file system jffs2 yaffs recommended mtd subsystem exports block devices well allows use common filesystem like ext4 however using mtd way recommended since neither detection bad blocks kind wear leveling | [
4469,
1254,
5457,
578,
4375
] | Test |
3,271 | 2 | 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 | [
1807,
3599,
3602,
2179,
710,
4297,
4670,
5021,
13,
2193,
7528,
2559,
3276,
3626,
2566,
2930,
5041,
7546,
7550,
2577,
405,
1855,
7555,
4347,
6836,
65,
4733,
5783,
6853,
5088,
6500,
785,
2266,
788,
3682,
1522,
5453,
5803,
7605,
7611,
4759... | Test |
3,272 | 4 | RCCA_security:rcca security replayable cca security rcca security security notion cryptography relaxes older notion security chosen-ciphertext attack cca precisely adaptive security notion cca2 cca-secure systems rcca secure converse true claim lot use cases cca strong rcca suffices nowadays certain amount cryptographic scheme proved rcca-secure instead cca secure introduced 2003 research publication ran canetti hugo krawczyk jesper b. nielsen | [
125
] | Test |
3,273 | 8 | Web_log_analysis_software:web log analysis software web log analysis software also called web log analyzer kind web analytics software parses server log file web server based values contained log file derives indicators web server visited reports usually generated immediately data extracted log files alternatively stored database allowing various reports generated demand features supported log analysis packages may include hit filters use pattern matching examine selected log data | [
5891,
497,
2858,
4382,
5571,
4600,
5907,
3999
] | Test |
3,274 | 3 | IBM_Mwave:ibm mwave mwave technology developed ibm allowing combination telephony sound card features single adapter card technology centers around mwave digital signal processor dsp technology used time provide combination modem sound card ibm aptiva line thinkpad laptops addition uses specialized mwave cards handled voice recognition isdn networking connectivity similar adapter cards third-party vendors using mwave technology also sold however plagued consumer complaints buggy mwave software hardware ibm eventually turned audio telephony solutions consumer products malcolm ware former developer mwave dates technology back development ibm research lab zurich switzerland 1979 first prototype tested ibm pc 1981 utilized adapter cards mwave given official name used ibm windsurfer isa/mca card ibm manufactured mwave hardware microsoft windows os/2 another revision technology used ibm newly renamed aptiva line one revisions mwave card mwave dolphin card isa legacy card support plug play natively supported windows software featured 28.8k/second fax/modem sound blaster-compatible audio solution one card publicized features software upgradeability version mwave software upgraded modem function 33.6k addition card key support aptiva rapid resume features including wake-up ring various consumer complaints users reporting problems involving either sound modem features separately using time consumers offered check purchase hardware replace mwave card others offered replacement modem sound card one point class action lawsuit filed finally settled 2001 mwave dolphin drivers version 20d stingray version mwave adapter addressed shortcomings dolphin stingray added plug play support ibm eventually stopped using mwave adapter card aptiva computers resorted conventional sound card modem options mwave form another produced mca isa pcmcia busses select thinkpad 600 770 models pci version integrated mwave chip integrated select thinkpad 755 760 765 models isa-based certain sun sparcstation workstations incorporated mwave dsp chip sound card functionality although mwave adapter cards discontinued linux driver pci-based mwave thinkpad 600 770 models developed released ibm | [
2342,
4759,
5970,
578,
3755
] | Test |
3,275 | 3 | Leading_Edge_Model_D:leading edge model leading edge model ibm clone computer first released leading edge hardware july 1985 initially priced 1,495 configured dual 5.25 floppy drives 256 kb ram monochrome monitor manufactured south korean conglomerate daewoo distributed canton massachusetts-based leading edge engineer stephen kahng spent four months designing model cost 200,000 kahng later became ceo macintosh clone maker power computing august 1986 leading edge cut price base model 200 1,295 increased base memory machine 512 kb model immediate success selling 100,000 units first year production continued sell well several years dispute dealers forced leading edge bankruptcy 1989 model initially featured intel 8088 microprocessor 4.77 mhz although later models switch back run 4.77 mhz normal 7.16 mhz high earlier models turbo switch ran 4.77 mhz later ones seemingly rare 7.16 mhz four models known dc-2010 dc-2011 dc-2010e dc-2011e e seems correlate capability running 7.16 mhz unlike ibm pc ibm pc/xt model integrated video disk controller battery backed clock serial parallel ports directly onto motherboard rather putting plug-in cards allowed model half size ibm models four full-length isa expansion slots available motherboard came eight different revisions revision 1 5 7 8 cc1 cc2 wc1 wc2 list motherboard part numbers revision numbers found revisions 1 7 usually found models dc-2010 dc-2011 revisions 8 wc2 either 2010e 2011e wc1 presumably also wc2 7.16 mhz due tight integration model motherboard nonstandard form factor replacing motherboard off-the-shelf upgrade possible model came preinstalled 256 512 640 kb ram lower-capacity machines user upgradeable 640 kb motherboard revisions 7 8 wc1 wc2 came 768 kb ram installed 640 kb available user models featured monochrome/cga selection switch single port used modes models monochrome cga port also switch change modes ports model computers supported special extended graphics mode 640x200 buyer choice floppy disk model fixed disk hard disk model floppy disk model one two 360 kb drives user could run ms-dos programs primary drive work files secondary drive equipped fixed disk model one 360 kib floppy drive either 10 mb 20 mb 30 mb hard disk model 20 mb fixed disk initially released february 1986 cost 1,895 leading edge dealers difficulty keeping 20mb model stock time tandy 1200 equipped 10mb drive sold 1999 buyer also choice amber green monochrome crt monitor unit came ms-dos 2.11 later special edition gw-basic support extended graphics mode also came diagnostics disk disk contained diagnostics program park.com utility used park hard drive heads computer moved models also came word processing program developed leading edge titled leading edge word processor commonly referred acronym 'lewp computer supports microsoft windows operating system version 3.0 last version windows support real mode dataquest estimated model 1 american home-computer market 1986 first year availability 1,495 list price lowest seven compatibles comparable configurations september 1985 infoworld chart half price 2,820 ibm pc along tandy 1000 epson equity series model one first ibm pc compatible computers become popular home use due low price good reviews previously ms-dos ibm compatibles almost exclusively used businesses home computer market dominated commodore apple atari years afterward many home-oriented software packages pc specifically cited model along tandy epson models compatible hardware leading edge phoenix technologies first customer ibm-compatible bios model one first pcs market use phoenix bios although advertised 100 ibm compatible numerous letters published january 13 1986 issue infoworld identified compatibility issues several popular software packages aftermarket hard drives syndicated newspaper columnists t.r reid michael schrage writing april 1986 predicted popularity model would lead hardware software vendors specifically testing compatibility spite early reports model continued sell well early 1987 daewoo producing 13,000 units per month failing keep demand result buyers waited 2–8 weeks taking delivery model also distinction first korean-made pc sold united states time introduction undercut price similar ibm pc compatibles 500 pc magazine october 1985 called model clear winner among six inexpensive pc compatibles tested review noted computer many included hardware features concluded may represent next generation personal computing compact full ibm hardware compatibility allows full featured quite well made alluringly priced model received 4 5 stars infoworld praised computer value high level compatibility december 1985 concluded recommend highly especially budget-conscious beginner positive october 1986 review popular mechanics cited low price quality keyboard received good reviews computer magazines consumer reports magazine | [
3303,
4658,
1052,
4759,
6380,
1508,
4277,
5023,
3755
] | Test |
3,276 | 2 | BBN_Time-Sharing_System:bbn time-sharing system bbn time-sharing system early time-sharing system created bolt beranek newman bbn pdp-1 computer began operation september 1962 digital equipment corporation prototype pdp-1 ready november 1959 machine featured november/december issue datamation magazine bbner ed fredkin saw prototype system eastern joint computer conference boston december 1959 extremely interested given bbn interest dec founder president ken olsen visited explained dec completed construction prototype pdp-1 needed test site month bbn agreed test site regular hourly rates early 1960 obtained prototype pdp-1 first production pdp-1 arrived november 1960 formally accepted april 1961 pdp-1 installed bbn 1960 j.c.r licklider took mit john mccarthy marvin minsky consultants mccarthy advocating concept time-sharing computers found slow progress mit bbn licklider fredkin keenly interested particular fredkin insisted timesharing could done small computer namely pdp-1 fredkin recounts mccarthy recalled 1989 accordingly bbn team largely led sheldon boilen built custom hardware add-ons company second pdp-1 provide external interrupt system magnetic drum swapping storage end bbn acquired first univac fastrand rotating drum 45-mbyte storage capacity access time 0.1 second fall 1962 bbn conducted public demonstration bbn time-sharing system one operator washington d.c. two cambridge.. described mccarthy et al. computer hardware follows pdp-1 single address binary computer 18 bit word five microsecond memory cycle instructions require ten microseconds execute basic memory size 4096 words 65,536 words may addressed indirectly machine used 8192 words 4096 reserved time-sharing system user sees 4096 word memory ... attached computer high speed magnetic drum memory divided 22 fields 4096 words basic operation drum system memory-swap accomplished 33 milliseconds operation 4096 words transferred core memory drum field simultaneously core memory loaded different drum field ... 4096 word drum field allocated saving core image user program running user program run status run 140 milliseconds another user also run status state core memory stored first user core image drum simultaneously second user core image loaded core second user program started appropriate place | [
4566,
1522,
7325,
7605,
280,
2818,
4759,
190,
4670,
5021,
8066,
8167,
4397,
13,
5644,
3271,
5116,
6984,
299,
3626,
7142,
5571,
2300,
5041,
7827,
4786,
578,
7550,
4244,
5232,
1992,
405,
6367,
6922,
8115,
5161,
5865,
7396,
65,
861,
5962,
... | Validation |
3,277 | 4 | 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úš nemec marek sýs 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–hellman 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 | [
704,
3932,
2912,
376,
2560,
2923,
2587,
5773,
3323,
5779,
7600,
4025,
1528,
2991,
1173,
6526,
6904,
6541,
6194,
2678,
3038,
3047,
6569,
2693,
862,
7307,
1989,
6589,
5187,
1996,
7328,
208,
209,
2021,
5922,
6628,
924,
7380,
4531,
600,
130... | Test |
3,278 | 2 | Data_Control_Block:data control block ibm mainframe operating systems os/360 mvs z/os data control block dcb description dataset program dcb coded assembler programs using dcb macro instruction expands large number define constant instructions high level language programmers use library routines containing dcbs dcb one many control blocks used operating systems control block data area predefined structure similar c codice_1 typically related system functions dcb may compared file structure c much complex offering many options various access methods control block acted application programming interface logical iocs application program usually defined within resided within application program addresses i/o subroutines would resolved linkedit phase compilation else dynamically inserted open time equivalent control block ibm dos/360 dos/vse z/vse operating systems dtf define file many constants variables contained within dcb may left blank i.e. default zero open process results merge constants variables specified dd jcl statement dataset label existing magnetic tape direct-access datasets dcb replacing zero values actual non-zero values control block called jfcb job file control block initially holds information extracted dd statement dataset results merge stored jfcb may also written dscb close process thereby making dataset definition permanent example blksize= variable may usually specified dcb zero dd statement blksize specified non-zero value results program-specified lrecl logical record length jcl-specified blksize physical block size merge two becoming permanent definition dataset | [
839,
4662,
7661,
5571,
6213,
1989,
6957,
7783,
336
] | Test |
3,279 | 2 | Crash-only_software:crash-only software crash-only software refers computer programs handle failures simply restarting without attempting sophisticated recovery correctly written components crash-only software microreboot known-good state without help user since failure-handling normal startup use methods increase chance bugs failure-handling code noticed except leftover artifacts data corruption severe failure n't occur normal startup crash-only software also benefits end-users often applications save data settings running end use example word processors usually save settings closed crash-only application designed save changed user settings soon changed persistent state matches running machine matter application terminates clean close sudden failure laptop battery state persist erlang computer language originally built ericsson fault-tolerant telephone switches programs structured modules replaced hot swapped without restart entire program module crashes needs updated restarted replaced without affecting part program within open telecom platform often used together erlang exist frameworks simplify automate task | [
5021,
5671
] | Test |
3,280 | 2 | Jet_Data_Access_Objects:jet data access objects jet data access objects general programming interface database access microsoft windows systems primarily jet ace databases dao originally called vt objects dao 1.0 came november 1992 part access 1.0 version 3.5 able bypass jet engine altogether directly access odbc data sources including microsoft sql server enterprise database systems dao 3.6 shipped jet 4.0 access 2007 later uses ace acedao new features supported ace added acedao longer supports odbcdirect dao works creating workspace object database operations performed workspace object exists session object exists within larger database engine object two types database engines jet database engine object odbcdirect database engine jet database engine access 2007 later ace object consists several objects first version dao used snapshot/dynaset/table objects etc dao 2.0 recordset etc objects introduced dao 3.0/3.5 supported old objects using special compatibility tlb removed completely dao 3.6 odbcdirect database engine consists workspace object errors object main differences database engine jet database engine odbc connection objects consist querydef objects recordset objects | [
519,
5252,
6141,
3010,
1526,
4759,
2054,
7715,
6000
] | Validation |
3,281 | 4 | 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 | [
2173,
2632,
4759,
2376,
1632,
6715,
7441,
651,
7186,
2577,
1383,
5401,
6740,
6370,
5675,
7657,
51,
7294,
2693,
2789,
7307,
3154,
7600,
2535,
4110,
6328
] | Train |
3,282 | 4 | Ikee:ikee ikee worm spread secure shell connections jailbroken iphones stole apple ids passwords discovered 2009 changed wallpapers photo rick astley iphone owners australia reported smart phones infected worm changed iphone wallpaper rick astley 1980s pop singer affected smartphones owner change default password installation ssh ikee worm infected would find iphones mobile network vulnerable infect well worm would n't affect users n't jailbroken installed ssh iphone worm nothing changing infected user lock screen wallpaper source code ikee worm says written ikex | [
624,
5401,
7214,
1787,
1582
] | Test |
3,283 | 5 | MAC_service_data_unit:mac service data unit mac service data unit media access control service data unit msdu service data unit received logical link control llc sub-layer lies media access control mac sub-layer protocol stack llc mac sub-layers collectively referred data link layer dll | [
5492,
3597
] | Validation |
3,284 | 1 | 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 | [] | Train |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.