node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
1,285 | 1 | SQL_Server_Management_Objects:sql server management objects sql server management objects smo .net objects introduced microsoft microsoft sql server 2005 designed allow easy simple programmatic management microsoft sql server using smo .net programmers design applications similar functionality microsoft sql server management studio smo objects comes sql server versions starting sql server 2005 2005 2008 2008r2 2012 2014 2016 included sql server editions including express edition sql server management objects smo msdn | [
2054
] | Test |
1,286 | 8 | Apache_Axis2:apache axis2 apache axis2 core engine web services complete re-design re-write widely used apache axis soap stack implementations axis2 available java c. axis2 provides capability add web services interfaces web applications also function standalone application server new architecture axis2 introduced august 2004 axis2 summit colombo sri lanka new architecture axis2 based flexible efficient configurable comparison axis1.x architecture well-established concepts axis 1.x like handlers etc. preserved new architecture apache axis2 supports soap 1.1 soap 1.2 integrated support widely popular rest style web services business-logic implementation offer ws-* style interface well rest/pox style interface simultaneously axis2/java support spring framework axis2/c high-performance web services implementation implemented portability ability embedded hosted apache httpd microsoft iis axis http server see article apache axis2/c performance 2008 latest release occurred 2009 axis2 came many new features enhancements industry specification implementations key features offered include apache axis2 includes support following standards list features selling points cited apache axis site axis2 modules provides qos features like security reliable messaging etc | [
5631,
7238,
894,
4303,
4766,
5728,
7805,
4770,
4043,
6986,
2741,
7444,
7896,
917,
5571,
3463,
3542,
4422,
3204,
6821,
5054,
840,
1392,
3031,
5408,
3558,
5677,
3479,
4436,
5863,
6387,
5075,
6137,
7488,
7763,
7857,
773,
5874,
3915,
3239,
... | Test |
1,287 | 2 | MacRuby:macruby macruby discontinued implementation ruby language ran objective-c runtime corefoundation framework development apple inc. supposed replace rubycocoa targeted ruby 1.9 used high performance llvm compiler infrastructure starting version 0.5 supports ahead-of-time just-in-time compilation macruby supported interface builder shipped core library called hotcocoa simplify cocoa programming macruby also used embedded scripting language objective-c applications may 2012 laurent sansonetti announced rubymotion port macruby ios os x android development macruby effectively ended late 2011 coinciding principal author departure apple inc.. jan 5 2015 macruby project longer active development macruby work mavericks team shifted focus commercial rubymotion product ios os x. macruby originally called ruby+objc developed laurent sansonetti began work late 2007 march 2008 first publicly available version macruby 0.1 announced official rubytalk forum version 0.2 released june 2008 implemented ruby strings arrays hashes native cocoa types september 2008 macruby 0.3 released included hotcocoa library well several hotcocoa example programs october 2008 apple created first macruby page developer connection website macruby 0.4 released march 2009 macruby 0.5 0.6 0.7 january may october 2010 respectively macruby 0.8 released december 13 2010 0.9 february 25 2011 0.10 march 23 2011 0.11 october 17 2011 0.12 june 11 2012 | [
1532,
5369,
6428,
3779,
6002,
7259,
5571,
397,
3021,
4151,
3879,
3889,
2679,
3478,
7671,
952,
8137,
5786,
1989,
1435
] | Validation |
1,288 | 2 | ANDOS:andos andos russian operating system electronika bk-0010 electronika bk-0011 electronika bk-0011m series computers created 1990 first released 1992 initially developed alexey nadezhin whose name system named later also sergey kamnev joined project widespread system bk series computers used ms-dos-compatible file system format andos used fat12 filesystem 800 kb floppy disks electronika bk-0011m electronika bk-0011 andos provided electronika bk-0010 emulation loading bk-0010 rom image bk-0011 ram minimal configuration system able occupy less 4 kb ram system able support 64 disk drives hard drive partitions well ram disks computer memory tape recording also able read-only access microdos file system format disks although last version function transferred system core file manager became optional | [
1522,
6076,
7794,
5462,
3690,
7079,
5571,
3538,
5048,
5140,
2864,
6380,
336,
861,
2887,
3748
] | Validation |
1,289 | 2 | 17_(app):17 app 17 live video streaming mobile app designed taiwanese pop singer jeffery huang member machi features instant photo video sharing functions client apps available ios android smartphone systems first launched app store 5 june 2015 sooner play store 10 june 2015 app re-released 28 october 2015 banned due prohibited content app become one popular live streaming apps taiwan malaysia hong kong singapore japan approximately 700 thousand daily active users 17 allows users broadcast live post photos videos album privacy settings used allow access rights permitted users users also follow one another track recent status changes app complained become platform broadcasting indecent scenes live broadcast sexual intercourse process app found unauthorized broadcasting lives attracted millions audience watch founder 17 jeffery huang claimed broadcast would stopped user ’ account would deleted received complaints also responded would stricter supervision system avoid similar incidents happening april 2016 according security website customer data 17 sold tor hidden website data include 4 million email addresses along ip addresses usernames unsalted md5 passwords users registered around time change passwords | [
6312
] | Test |
1,290 | 1 | SHERPA/Juliet:sherpa/juliet sherpa/juliet online database open access mandates adopted academic funding bodies part sherpa suite services around open access run jisc formerly university nottingham database contains information 100 funders mostly united kingdom juliet indicates policy regarding self-archiving open access journals archival research data users suggest updates records addition new funder via form service mainly useful researchers received project-based funding want clear summary funder links original policies also provided | [
5533
] | Test |
1,291 | 4 | L7-filter:l7-filter l7-filter software package provides classifier linux netfilter subsystem categorize internet protocol packets based application layer data major goal tool make possible identification peer-to-peer programs use unpredictable port numbers two versions software first implemented kernel module linux 2.4 2.6 second experimental version released december 2006 runs user-space program relies netfilter user-space libraries classification process versions l7-filter use regular expressions though user-space kernel modules use different regular expression libraries identify network protocol technique used conjunction linux qos system allows application-specific yet port-independent traffic shaping versions l7-filter released gnu general public license | [
1249,
3165,
1809,
4759,
806,
994,
3185,
4492,
6984,
7351,
4138,
385,
7536,
2296,
2746,
6107,
578,
3637,
8100,
6456,
6025,
3551,
7275,
7744,
3394,
6560,
4977,
7289,
7478,
3223,
3484,
3821,
4091,
2790,
7683,
6235,
6149,
6951,
7597,
875,
6... | Test |
1,292 | 5 | Net-SNMP:net-snmp net-snmp suite software using deploying snmp protocol v1 v2c v3 agentx subagent protocol supports ipv4 ipv6 ipx aal5 unix domain sockets transports contains generic client library suite command line applications highly extensible snmp agent perl modules python modules net-snmp housed sourceforge usually top 100 projects sourceforge ranking system march 2005 sourceforge project month widely distributed comes included many operating systems including distributions linux freebsd openbsd solaris os x also available net-snmp web site steve waldbusser cmu started freely available snmp tool kit 1992 package later abandoned cmu wes hardaker uc davis renamed ucd-snmp extended meet network management needs electrical engineering department eventually mr. hardaker left university realized project network wide thus renamed net-snmp reflect distributed development roots net-snmp project long full description found net-snmp history page command snmpget uses snmpget application retrieve information associated specific object identifier oid target device example snmpget usage retrieve specific oid 'sysuptime community string 'demopublic 'test.net-snmp.org host name agent query command snmpwalk uses snmp getnext request query network tree information object identifier oid may given command line oid specifies portion object identifier space searched using getnext requests variables subtree given oid queried values presented user oid argument present snmpwalk search subtree rooted snmpv2-smi :mib-2 including mib object values mib modules defined lying within subtree example snmpwalk usage retrieve variables system oid | [
5983,
6489,
5965,
5571,
1435,
1989,
578,
3819,
2219
] | Train |
1,293 | 7 | National_Grid_Service:national grid service national e-infrastructure service nes formerly national grid service organisation uk academics researchers 2004 2011 funded two governmental bodies engineering physical sciences research council epsrc joint information systems committee jisc nes provided compute data resources accessed standard common set services nes services based globus toolkit job submission storage resource broker data management nes resources hosted scientific software packages including siesta gaussian well providing access compute data resources nes offered training national e-science centre edinburgh grid support uk academics researchers grid computing nes 500 users twenty nine sites nes gridpp two organisations made uk ngi organisation uk point contact european grid infrastructure prior nes uk e-science programme funded grid support centre later grid operations support centre gosc provided support end users use develop grid computing following uk engineering task force developing so-called 'level 2 grid ad hoc collection individual institutes committing variety compute resources grid computing nes funded develop full service initially called etfp grid engineering task force production grid became known national grid service hardware purchased installed february 2004 web site appeared april 2004 phase 1 october 2004 september 2006 worked separately funded grid operations support centre gosc start phase two october 2006 ngs gosc merged single project name nes nes third phase ran september 2011 nes provided free-to-use services uk academic researchers nes following partner sites affiliate sites provided resources nes conditions sometimes provide access users common ngs interfaces members gridpp collaboration also offered resources academics uk could apply free account nes science research ranged permeation drugs membrane welfare ethnic minority groups united kingdom applications included modelling coastal oceans modelling hiv mutations research cameras imaging patients cancer treatments simulating galaxy formation example use nes motivation methodology implementation e-social science pilot demonstrator project entitled grid enabled micro-econometric data analysis gemeda used nes investigate policy relevant social science issue welfare ethnic minority groups united kingdom underlying problem statistical analysis uses quantitative data one source application grid technology problem allows one integrate elements required empirical modelling process data extraction data transfer statistical computation results presentation manner transparent casual user examples research using nes published 2006 2011 | [
6963,
2962,
4159,
7055,
7214,
1004,
5834,
3947,
7930
] | Validation |
1,294 | 2 | Lions'_Commentary_on_UNIX_6th_Edition,_with_Source_Code:lions commentary unix 6th edition source code lions commentary unix 6th edition source code john lions 1976 contains source code 6th edition unix kernel plus commentary commonly referred lions book despite age still considered excellent commentary simple high quality code many years lions book unix kernel documentation available outside bell labs although license 6th edition allowed classroom use source code license 7th edition specifically excluded use book spread illegal copy machine reproductions kind samizdat commonly held copied book computer science book reprinted 1996 peer-to-peer communications unix operating system source code level six kernel source code lightly edited lions better separate functionality — system initialization process management interrupts system calls basic i/o file systems pipes character devices procedures symbols listed alphabetically cross reference code presented run pdp-11/40 rk-05 disk drive lp-11 line printer interface pcl-11 paper tape writer kl-11 terminal interface suitable pdp-11 emulator simh commentary unix operating system starts notes unix useful documentation unix manual pages dec hardware manuals section architecture pdp-11 chapter read c programs source commentary follows divided sections code book ends suggested exercises student lions explains commentary supplements comments source possible understand code without extra commentary reader advised read notes needed commentary also remarks code might improved source code commentary originally produced may 1976 set lecture notes lions computer science courses 6.602b 6.657g university new south wales department computer science unix news march 1977 announced availability book unix licensees lions trouble keeping popularity 1978 available bell labs announced unix version 7 usenix june 1979 academic/research license longer automatically permitted classroom use thus licensees longer able use lions notes classes operating systems however thousands computer science students around world spread photocopies could study legally class would sometimes meet hours discuss book many pioneers unix open source treasured multiple-generation photocopy follow-on effects license change included andrew s. tanenbaum creating minix tanenbaum wrote operating systems 1987 various unix people particularly peter h. salus dennis ritchie berny goodheart lobbied unix various owners novell santa cruz operation many years allow book published officially 1996 santa cruz operation finally authorised release twenty-year-old 6th edition source code along source code versions ancient unix full code plus 1977 version commentary published peer-to-peer communications reissue includes commentary michael tilson sco peter salus dennis ritchie ken thompson peter collinson greg rose mike o'dell berny goodheart peter reintjes infamous program comment expected understand occurs line 2238 source code lions commentary p. 22 end comment explaining process exchange mechanism refers line 325 file slp.c source code reads major reason piece code hard understand depended quirk way c-compiler pdp-11 saved registers procedure calls code failed ported machines redesigned version 7 unix dennis ritchie later explained meaning remark xv6 modern reimplementation sixth edition unix ansi c multiprocessor x86 systems | [
4447,
6577,
5341,
5571,
352,
5021,
6016,
1435,
6046
] | Test |
1,295 | 7 | Distributed_memory:distributed memory computer science distributed memory refers multiprocessor computer system processor private memory computational tasks operate local data remote data required computational task must communicate one remote processors contrast shared memory multiprocessor offers single memory space used processors processors aware data resides except may performance penalties race conditions avoided distributed memory system typically processor memory form interconnection allows programs processor interact interconnect organised point point links separate hardware provide switching network network topology key factor determining multiprocessor machine scales links nodes implemented using standard network protocol example ethernet using bespoke network links used example transputer using dual-ported memories key issue programming distributed memory systems distribute data memories depending problem solved data distributed statically moved nodes data moved demand data pushed new nodes advance example problem described pipeline data x processed subsequently functions f g h etc result h g f x expressed distributed memory problem data transmitted first node performs f passes result onto second node computes g finally third node computes h also known systolic computation data kept statically nodes computations happen locally changes edges reported nodes example simulation data modeled using grid node simulates small part larger grid every iteration nodes inform neighboring nodes new edge data similarly distributed shared memory node cluster access large shared memory addition node limited non-shared private memory distributed shared memory hides mechanism communication hide latency communication | [
553,
5371,
5559,
1546,
4049,
4318,
3458,
5042,
7453,
4154,
1481,
5939,
4159,
1023,
4839,
5947,
7279,
3041,
1405,
240,
1678,
515,
1586,
1042,
8024,
2961,
3578,
8130,
4993,
3667,
1786,
2969,
1237,
4742,
5447,
357,
2266,
5890
] | Test |
1,296 | 5 | Bidirectional_Forwarding_Detection:bidirectional forwarding detection bidirectional forwarding detection bfd network protocol used detect faults two forwarding engines connected link provides low-overhead detection faults even physical media n't support failure detection kind ethernet virtual circuits tunnels mpls label switched paths bfd establishes session two endpoints particular link one link exists two systems multiple bfd sessions may established monitor one session established three-way handshake torn way authentication may enabled session choice simple password md5 sha1 authentication available bfd discovery mechanism sessions must explicitly configured endpoints bfd may used many different underlying transport mechanisms layers operates independently therefore needs encapsulated whatever transport uses example monitoring mpls lsps involves piggybacking session establishment lsp-ping packets protocols support form adjacency setup ospf is-is may also used bootstrap bfd session protocols may use bfd receive faster notification failing links would normally possible using protocol keepalive mechanism session may operate one two modes asynchronous mode demand mode asynchronous mode endpoints periodically send hello packets number packets received session considered demand mode hello packets exchanged session established assumed endpoints another way verify connectivity perhaps underlying physical layer however either host may still send hello packets needed regardless mode use either endpoint may also initiate echo function function active stream echo packets sent endpoint sends back sender via forwarding plane used test forwarding path remote system june 2011 bfd protocol standardization process entered proposed standard stage rfc 5880 defines bfd protocol detecting mpls lsp failure using bfd monitor connectivity across multiple network hops using bfd ipv4 ipv6 bfd operation conjunction open shortest path first ospf is-is protocols also outlined rfc 5881 | [
2650,
6879,
7637,
1543,
3819
] | Test |
1,297 | 1 | Canmore_(database):canmore database canmore online database information 320,000 archaeological sites monuments buildings scotland begun royal commission ancient historical monuments scotland historic environment scotland maintained since 2015 canmore database part national record historic environment nrhe formerly national monuments record scotland nmrs contains around 1.3 million catalogue entries includes marine monuments designated official wreck sites fall protection wrecks act wreck | [
176,
2054
] | Test |
1,298 | 3 | Unisys_2200_Series_system_architecture:unisys 2200 series system architecture figure shows high-level architecture os 2200 system identifying major hardware software components majority unisys software included subsystems applications area model example database managers subsystems compilers applications details system architecture covered unisys publication 3850 7802 instruction processor programming reference manual also see univac 1100/2200 series 1100 series used 36-bit word 6-bit characters since 1962 word character size department defense dod requirement since military needed able calculate accurate trajectories design bridges perform engineering scientific calculations needed 32 bits precision 32-bit floating point number provided 6 digits accuracy 36 bit number provided 8 digits accuracy accepted minimum requirement since memory storage space costs drove system going 64 bits simply acceptable general systems use ones complement arithmetic unusual time almost computer manufacturers time delivered 36-bit systems 6-bit characters including ibm dec general electric sylvania 6-bit character set used 1100 series also dod mandated set defined army signal corps called fieldata data returned field 1108 provided 9-bit character format order support ascii later iso 8-bit sets extensively used 1980s space constraints 2200 series architecture provides many registers base registers logically contain virtual address points word code data bank segment may point beginning bank word within bank index registers used instructions modify offset specified assumed base register simple arithmetic add subtract may performed index registers addition index registers consist lower offset portion upper increment portion instruction may use offset value index register part address specify increment added offset allows loops accomplished fewer instructions incrementing index step size accomplished without separate instruction arithmetic registers allow full set computational instructions including floating point operations instructions work adjacent pairs registers perform double-precision operations even-odd constraints two registers may used double-precision value four arithmetic registers also index registers sets overlap – index register x12 arithmetic register a0 allows full range calculations performed indexes without move results rest registers known r registers used fast temporary storage certain special functions r1 holds repeat count instructions may repeated block transfer execute repeated etc. r2 holds bit mask instructions perform bitwise logical operation addition functions e.g. masked load upper two full sets registers x r b one set user registers used applications portions operating system saved restored part activity thread state set exec registers used interrupt processing routines portions operating system want avoid save restore user registers exec registers writable user applications although user code read result exec carefully designed never leave private secure confidential information registers instruction interpretation chooses appropriate register set use based bit processor state register bit always set changed privileged interrupt registers also visible address space exec portion protected reference non-privileged code result fault interrupt 2200 series uses 36-bit segmented virtual address space ’ look later addressing architecture 2200 series cisc architecture system large number instructions current count 245 many addressing variants variants encoded directly instruction format partial word references dependent processor state register settings many instructions also perform complex functions one implements large part cobol edit verb figure shows building blocks architecture data comm two primary examples software subsystems live protection ring user application exec many subsystems users write mentioned earlier 2200 series uses 36-bit segmented virtual address original notion segmented space came earliest implementation emphasized code data separation performance use shared code banks years expanded provide greater flexibility levels sharing far greater protection security reliability controlled access shared data also introduced virtual address consists three parts high-order 3 bits define sharing level heart entire addressing protection scheme every thread eight bank descriptor tables segment descriptor tables industry based b16-b23 tables indexed level – level 0 refers bank descriptor table bdt based b16 level 2 bdt based b18 etc level 0 level 2 bdts common threads system every run process level 4 bdt bdt common threads run every user thread unshared level 6 bdt extended-mode activity thread always six banks segments totally unique one return control stack holds information calling structure including security relevant privilege state changes accessible thread except use call return similar instructions major part protection reliability mechanism applications cause bad effects changing return addresses overwriting return control stack another unique bank automatic storage bank activity local store stack used compilers hold local variables created within block also used hold parameter lists passed call one checks made operating system behalf call made protected subsystem ensure operands thread-local stack thread right access memory region referenced parameters parameters kept thread-local space chance thread may change validation responsibility called procedure perform similar checks secondary parameters may exist shared space i.e. primary parameter points structure contains pointers procedure expected copy pointers local space validating use internally held validated pointer activities may create additional segments limit available address space 2 words 8gw 36gb convenient way multi-threaded applications get large amounts memory space knowing totally thread-safe taking space away rest available program activity program independent space meaning application say 100 activities able use 800gw 3tb virtual space basic-mode activities start banks basic-mode programs aware virtual address space calls extended-mode subsystems cause banks created os 2200 implement programs exactly way unix linux windows implement processes closest analogy obvious difference os 2200 permits single program per run job session executing time program may hundreds threads spawn programs run concurrently several banks program level contain mixture run job session information program information control structures operating system access read-only access program programs may retrieve information structures debugging purposes retrieve things like user-id terminal-id without overhead system call written program contain things like thread state save areas file control blocks accounting information rest banks used program program object file executed operating system obtains bank information file creates banks needed loads bank initial state file simplest program single bank containing code data considered bad form permitted compatibility old applications create application assembly language standard compilers create one code banks one data banks normally code banks marked read-only debugging reliability aid security concerns either way program affect program thus address space distinct programs system nothing program change contents program ’ memory os shared subsystems protected mechanisms discussed later even read access prohibited os subsystem memory almost cases code program possible create shared subsystem generally readable even writable multiple programs must explicitly installed way privileged system administrator programs initially created banks specified object file single activity may use system calls create additional banks within program level additional activities closest analogy shared subsystem .dll subsystem much like program many respects except activities associated instead accessed programs subsystems typically via call instruction fact program subsystem plus one activities every activity belongs home subsystem program created subsystem concept important encapsulation access rights privilege within home subsystem activities typically share common access rights code data banks code banks home subsystem usually read-only even execute-only contain constant data activities right execute subsystems also combinations banks may contain data banks well code banks globally shared subsystems must installed system someone appropriate administrator privileges subsystems may also open files database manager subsystem opens database files use typically exclusive access rights operating system attach banks subsystem hold file control tables os level contains banks exec banks never directly accessible either programs global subsystems entry points os handled way protected subsystem calls made os always via gates instructions exist purpose er executive request via interrupts next part virtual address bdi bank descriptor index level field selected particular bank descriptor table base register b16-b23 base registers b16-b23 part activity state maintained exec direct access activity bank descriptor tables program activity levels exist within program-level banks belong operating system bdi simply index bank descriptor table entry table contains information bank entry describes 1mb 256kw virtual address space larger contiguous space needed consecutive entries logically combined create larger bank maximum 2 words bank descriptor table entry bank descriptor – bd gives size bank small 256kw large 16mw large 1gw small bank always represented single bd large banks represented 64 consecutive bds large bank 4096 bds large large banks need use 64 4096 consecutive bds use many needed provide virtual address space required entry also contains upper lower limits allowable offsets within bank virtual addresses outside limits generate fault interrupt allows small banks example containing message virtual space reserved actually needs provides debugging check bad pointers indices bd also contains key value access control fields fields indicate whether read write execute permission granted instruction processor 3 bits special access permissions sap applies activities executing within owning subsystem really matching key value general access permissions gap applies everyone else usually zero access exec sets key value state activity may changed gate interrupt transitions 2200 series protection architecture uses three pieces activity state reflected hardware state processor privilege pp ring domain processor privilege controls ability execute privileged instructions access protected registers state pp=0 used exec gives full access instructions privileged state exec activities user activities used gate access exec api run pp=0 pp=1 restricts privileged instructions allow reading day clocks reading contents privileged registers none privileged registers contain truly sensitive information allowing general read access could easily lead undetected errors user programs basically pp=1 instructions change addressing environment change clocks change instrumentation state perform i/o restricted pp=1 rarely used pp=2 normal user mode state code executes restriction pp=1 also pp=3 restricts instructions user program execute currently use many existing programs using instructions intent restrict access instructions may system model dependent domain mechanism heart protection mechanism bd bank descriptor lock field consisting ring number domain number also key field state activity key matches lock ring key less ring lock activity special access permission otherwise activity general access permission ring allows overriding domain protection mechanism user applications run ring=3 protected subsystems run ring=2 gives access data still allowing access parameters data calling user ’ space note still possible thread cause protected subsystem access user ’ space thread ’ bank descriptor tables use ring=0 used os allows access data still able access parameters passed either user programs protected subsystems gates another part protection mechanism gate data structure controls transitions domains gate lives gate bank hardware enforces references gates must addresses proper offset multiple gate size within gate bank gate contains target address new values pp ring domain may contain hidden parameter passed target protected subsystems directly accessible subsystems instead subsystem must request gate built gate bank access subsystem permits operating system perform access control checks linking system find gate address associated entry point fact whole mechanism usually transparently handled within linking system hidden parameter permits example file i/o gate contain address handle file control block since guaranteed correct created os user opened file many error checks eliminated path length i/o os 2200 designed handle 32 instruction processors cpus great deal design done years optimize environment example os 2200 makes almost use critical sections design ’ high probability multiple processors executing code instead uses data locking finest granularity data possible generally locks deal single instance data object e.g. activity control structure file control block contained within data structure object minimizes likelihood conflicts global locks set updating list objects lock set long takes update links list even dispatching done separate locks different priority levels check made empty priority level without setting lock lock need set adding removing item queue register set visible address space registers appear exist first 128 words 200 current instruction bank b0 referenced data item impose restriction compilers place data constants first 128 words code bank result expansion instruction set without requiring additional operation codes register-to-register operations accomplished register-storage operation codes typical instructions contain function code target source register index register base register displacement field function code qualifier indicates immediate data displacement base h fields combine form single 18-bit immediate value allows loading adding multiplying etc small constants eliminate memory reference associated storage processor state captured stack interrupt contains information needed return control interrupted activity determine type interrupt interrupts may occur middle long instructions state deals possibility basic mode another whole form instruction formats addressing basic mode provides compatibility previous systems back 1108 practical purposes hardware architecture defines rules addresses instructions converted forms obvious difference basic mode lack explicit b registers instructions instead four implicitly used b registers b12-b15 complex algorithm using limits banks represented b registers operand address b register within current instruction found interesting instructions 2200 repertoire locking synchronization instructions conditional replace familiar quite similar compare swap intel architecture instructions always gain exclusive use memory/cache-line holding referenced word ts tss check bit referenced word bit clear set continue ts skip tss bit set either interrupt ts fall next instruction tss ts interrupt os takes one several actions depending instruction sequence activity priority real time exec activities simply get control back allow retry unless even higher-priority activity waiting presumption lock set another processor soon cleared user activity running real time priority may priority temporarily reduced placed back dispatching queues alternatively code sequence may indicate test set queuing used case os places activity wait state chains end list activities waiting particular lock activities clearing lock check see waiting notify os allow one try test set queuing typically used synchronization within subsystems database manager activities many programs may executing result mechanisms efficient low overhead synchronization among activities queuing architecture another interesting special case specifically designed allow efficient handling messaging number messages waiting processing could almost unlimited also aimed reducing one primary costs messaging namely constantly move messages around memory even moving communication manager message queue subsystem processing program eliminated instead message placed small bank instructions allow placing bank descriptors banks queue removing queue message placed queue sending program subsystem longer access bank removed address space message retrieved queue bank becomes part receiver address space queuing instructions also provide activity synchronization functions e.g. wait message pointers moved moved way ensures security integrity moved data message visible recipient i/o 2200 series systems handled i/o processors processors offload large portions i/o path length recovery fully isolating main system i/o faults interrupts bus errors etc greatly improve reliability availability i/o processors come three different types storage communications clustering real difference firmware load i/o processors controlled operating system os 2200 provide raw mode i/o called arbitrary device i/o even os validates program accessing allowed device handles interrupts faults passing appropriate status program programs must granted privileges security officer access devices arbitrary mode may limited security officer system operator specific devices arbitrary i/o allowed device also use program system device must exclusively allocated program os takes general calls programs generates command packets real memory device addresses passed i/o processor firmware i/o processor actually creates device specific e.g. scsi packets sets dma issues i/o services interrupts | [
1743,
1867,
4759,
1237,
578
] | Test |
1,299 | 7 | Ansarada:ansarada ansarada provider ai-powered virtual data rooms material information platforms business transactions material events mergers acquisitions fundraising tenders ipos historically ansarada virtual data rooms enabled hosting exchange management confidential material information bidders sellers mergers acquisitions due diligence process software service saas solutions ansarada also creators world first video game since launched january 2014 138,000 sessions total screen views amounting 9.5 million ansarada offices sydney london new york chicago well employees working asia africa continental europe sydney-based ansarada founded 2005 andrew slavin chief technology officer sam riley chief executive rachel riley chief financial officer daphne chang company named first two letters founder first names four founders employees continue 80 percent company group investment bankers lawyers owning remaining 20 percent ansarada disclose sales profits ansarada claims 60 percent market share australian deals employs 200 people offices sydney chicago new york city london amsterdam frankfurt johannesburg hong kong development centre ho chi minh city july 2016 ansarada partnered pyco group launched new software development center vietnam range artificial intelligence features introduced ansarada virtual data rooms vdr 2017 ai-powered alternative traditional virtual data rooms 100-plus new features allow users “ illuminate risk opportunity raise protect potential optimize processes deal preparation execution close ” sell-side users ansarada rooms view ai bidder engagement score assigns numerical value likelihood potential bidder make offer predicts win objectively tells sellers interest ai bidder engagement score calculated using machine learning algorithm takes account performance 57 separate metrics time aida acronym ansarada intelligent data assistant extracts on-demand insights data based activity within ansarada room allows information accessed natural language need login click menus features desktop product users interact aida chat interface available iphone itunes app store virtual assistant uses natural language processing understand user requests plus 20 “ skills ” extract data insights provide answers october 2017 ansarada launched world first material information platform deliver readiness service raas platform uses new technologies artificial intelligence machine learning help businesses ready important outcomes structuring material information correctly assigning accountability people tracking progress objective score readiness selection ansarada clients include law firms corporate finance software property private equity venture capital ansarada launched game january 2014 appeal primarily investment bankers looking express competitive sides risk-free setting new york times reported ten hours games release attracted 1,000 users played 3,300 times according new york times | [
4295
] | Test |
1,300 | 4 | Device_configuration_overlay:device configuration overlay device configuration overlay dco hidden area many today ’ hard disk drives hdds usually information stored either dco host protected area hpa accessible bios os user however certain tools used modify hpa dco system uses identify_device command determine supported features given hard drive dco report command supported features nonexistent drive smaller actually determine actual size features disk device_configuration_identify command used output command compared output identify_device see dco present given hard drive major tools remove dco order fully image hard drive using device_configuration_reset command permanently alters disk unlike host protected area hpa temporarily removed power cycle device configuration overlay dco first introduced ata-6 standard allows system vendors purchase hdds different manufacturers potentially different sizes configure hdds number sectors example would using dco make 80-gigabyte hdd appear 60-gigabyte hdd os bios ... given potential place data hidden areas area concern computer forensics investigators additional issue forensic investigators imaging hdd hpa and/or dco certain vendors claim tools able properly detect image hpa either silent handling dco indicate beyond capabilities tool hdat2 free software program ms-dos used create/remove host protected area hpa using command set max create/remove dco hidden area using command dco modify also functions dco data synergy freeware atatool utility used detect dco windows environment recent versions allow dco created removed frozen guidance software encase comes linux-based tool images hard drives called linen linen 6.01 validated national institute justice nij october 2008 found tool remove either host protected areas hpas dcos however linux test environment automatically removed hpa test drive allowing tool image sectors hidden hpa tool acquire sectors hidden dco accessdata ftk imager 2.5.3.14 validated national institute justice nij june 2008 findings indicated physical acquisition made drive hidden sectors either host protected area device configuration overlay tool remove either hpa dco tool acquire sectors hidden hpa variety hardware imaging tools found successfully detect remove dcos nij routinely tests digital forensics tools publications found http //nij.ncjrs.gov/app/publications/pub_search.aspx searchtype=basic category=99 location=top psid=55 nist https //www.nist.gov/itl/ssd/cs/cftt/cftt-disk-imaging.cfm | [
6488,
1052,
6380,
5571,
7825,
6327
] | Validation |
1,301 | 4 | Risk_management_framework:risk management framework risk management framework united states federal government policy standards help secure information systems computers networks developed national institute standards technology two main publications cover details rmf nist special publication 800-37 guide applying risk management framework federal information systems nist special publication 800-53 security privacy controls federal information systems organizations nist special publication 800-37 guide applying risk management framework federal information systems developed joint task force transformation initiative working group transforms traditional certification accreditation c process six-step risk management framework rmf risk management framework rmf illustrated right provides disciplined structured process integrates information security risk management activities system development life cycle rmf steps include lifecycle information system encounter many types risk affect overall security posture system security controls must implemented rmf process supports early detection resolution risks risk categorized high level infrastructure risks project risks application risks information asset risks business continuity risks outsourcing risks external risks strategic risks infrastructure risks focus reliability computers networking equipment project risks focus budget timeline system quality application risks focus performance overall system capacity information asset risks focus damage loss disclosure unauthorized part information assets business continuity risks focus maintaining reliable system maximum up-time outsourcing risks focus impact 3rd party supplier meeting requirements external risks items outside information system control impact security system strategic risks focuses need information system functions align business strategy system supports | [
7558
] | Train |
1,302 | 5 | Dynamic_synchronous_transfer_mode:dynamic synchronous transfer mode dynamic synchronous transfer mode dtm optical networking technology standardized european telecommunications standards institute etsi 2001 beginning specification etsi es 201 803-1 dtm time division multiplexing circuit-switching network technology combines switching transport designed provide guaranteed quality service qos streaming video services used packet-based services well marketed professional media networks mobile tv networks digital terrestrial television dtt networks content delivery networks consumer oriented networks triple play networks dtm architecture conceived 1985 developed royal institute technology kth sweden published february 1996 research team split two spin-off companies reflecting two different approaches use technology one companies remains active field delivers commercial products based dtm technology name net insight | [
7232,
7148,
456,
6879,
2281,
6521,
6976,
3775,
3855,
2644,
7170,
6531,
1462,
2650,
7637,
2119,
6908,
7091,
2219,
3383,
3640,
3797,
2043,
3312,
2057,
3819,
3820,
3821,
7214,
7217,
7765,
259,
5880,
1988
] | Test |
1,303 | 2 | Foomatic:foomatic foomatic configurable printing filter uses ppd files configuration generate appropriate output given printer spooler independent means used common unix printing system cups lprng others uses ghostscript background using options according ppd file printer currently developed openprinting workgroup linux foundation like cups foomatic supposes applications produce output postscript output spools postscript printer action needed otherwise generic way act foomatic-rip knows available printer translate postscript data directly printer language without creating intermediate raster file components package following free drivers specifically developed work foomatic | [
7606,
2815,
5826,
4780,
7223,
6016
] | Validation |
1,304 | 9 | Creative_Basic:creative basic creative basic cb third-generation event-driven programming language windows integrated development environment ide current version executables interpreted require runtime libraries installed end-user computer planned future version compiled executables creative basic extensive command set access application programming interface api libraries available microsoft windows operating system although modern version dates 2007 development completely compatible ibasic use worldwide since 2002 notable projects jerry muelver wikiwriter wikiwriter chm wizard alyce watson mike rainey manufacturing engineering programs see links hello program program open console window print 10 random numbers program create gui window exit button event handling routine | [
5367,
1255,
4759,
12,
2463,
6891,
8183,
4139,
5651,
2925,
7448,
5926,
5129,
5571,
7906,
5137,
5234,
2941,
3303,
61,
6394,
4003,
7864,
1789,
5877,
6778,
4012,
4745,
1064
] | Validation |
1,305 | 6 | Dot_Hill_Systems:dot hill systems dot hill systems corp manufacturer computer storage area network arrays providing computer hardware software products small large computer data storage systems dot hill started 1997 carlsbad california 2004 dot hill acquired chaparral network storage longmont colorado chaparral network storage started 2000 also manufactured storage systems 2010 dot hill start moving almost carlsbad operations longmont dot hill listed nasdaq hill dot hill products interfaces supporting fibre channel fc internet small computer systems interface iscsi serial attached scsi sas products include hard drives solid-state drives ssds dot supports raid software data center storage management applications run windows linux rhel suse apple mac os x snow leopard oracle solaris xenserver vmware esx servers host interfaces ssd sas sata drive technologies seagate technology finalized acquisition company october 2015 | [
1254,
578
] | Test |
1,306 | 4 | Crackme:crackme crackme often abbreviated cm small program designed test programmer reverse engineering skills programmed reversers legal way crack software since intellectual property infringed upon crackmes reversemes keygenmes generally similar protection schemes algorithms found proprietary software however due wide use packers/protectors commercial software many crackmes actually difficult algorithm harder find track commercial software keygenme specifically designed reverser find protection algorithm used application also write small keygen programming language choice keygenmes properly manipulated self-keygenning example checking might generate corresponding key simply compare expected entered keys makes easy copy key generation algorithm often anti-debugging anti-disassemble routines used confuse debuggers make disassembly useless code-obfuscation also used make reversing even harder | [
7093,
4759,
578
] | Validation |
1,307 | 4 | 2014_Russian_hacker_password_theft:2014 russian hacker password theft 2014 russian hacker password theft alleged hacking incident resulting possible theft 1.2 billion internet credentials including usernames passwords hundreds millions corresponding e-mail addresses data breach first reported new york times reported many media allegedly discovered reported milwaukee-based information security company hold security 420,000 websites reported affected according new york times source big companies know user credentials among stolen hold security disclose sites compromised instead offered two separate services one website owners one consumers check 're affected service website owners costs 10 month check consumers free hold security described group responsible hack small group “ fewer dozen men 20s ... based small city south central russia region flanked kazakhstan mongolia ” dubbed group cybervor russian lit cyber thief hold claimed hack perpetrated use sql injection according forbes article hold security says 1.2 billion credentials stolen way also ones cybervor simply bought people used means hold security n't know split forbes columnist kashmir hill noted internet predictably panicked story yet another massive password breach went viral pretty direct link panic pay-out security firm hold security website service offering people check username password pair stolen requires people send hold security encrypted versions passwords named independent sources come forward confirm breach forbes columnist joseph steinberg even expressed outright skepticism many facts claimed breach raising questions trustworthiness reports breach altogether | [
704,
623,
3932,
4025,
7328,
1528,
2991,
7799,
7066,
2912,
376,
1173,
6526,
998,
3528,
3277,
2923,
7818,
208,
2021,
3864,
5922,
6628,
6904,
5305,
1376,
6541,
6194,
924,
1383,
2854,
7600,
6740,
5675,
2587,
2678,
3038,
4531,
5330,
600,
304... | Test |
1,308 | 9 | Alan_Perlis:alan perlis alan jay perlis april 1 1922 – february 7 1990 american computer scientist professor purdue university carnegie mellon university yale university best known pioneering work programming languages first recipient turing award perlis born jewish family pittsburgh pennsylvania graduated taylor allderdice high school 1939 1943 received bachelor degree chemistry carnegie institute technology later renamed carnegie mellon university world war ii served u.s. army became interested mathematics earned master degree 1949 ph.d. 1950 mathematics massachusetts institute technology mit doctoral dissertation titled integral equations solution iteration analytic continuation 1952 participated project whirlwind joined faculty purdue university 1956 moved carnegie institute technology chair mathematics first head computer science department 1962 elected president association computing machinery awarded inaugural turing award 1966 according citation influence area advanced programming techniques compiler construction reference work done member team developed programming language algol 1971 perlis moved yale university become chair computer science hold eugene higgins chair 1977 elected national academy engineering 1982 wrote article epigrams programming association computing machinery acm sigplan journal describing one-sentence distillations many things learned programming career epigrams widely quoted remained yale death 1990 publications selection | [
7707,
811,
470,
6263,
1361,
1746,
1381,
3464,
6285,
7009,
3470,
7277,
43,
1114,
752,
5322,
1774,
7758,
5424,
6846,
6064,
6485,
7863,
1600,
3060,
6146,
1892,
8137,
1243,
356,
360
] | Validation |
1,309 | 9 | ActiveJDBC:activejdbc activejdbc java implementation active record design pattern developed igor polevoy inspired activerecord orm ruby rails based convention configuration similar ruby rails activejdbc infers meta data database result models require setters getters creation saving new records table one line updating existing record activejdbc query language search criteria written abbreviated sql activejdbc general purpose java orm served first building block activeweb | [
2180,
6594
] | Validation |
1,310 | 4 | SyncBack:syncback syncback software allows backing synchronizing files several resources including internal external drive different media usb thumb drive cd dvd remote server nas ftp windows server cloud storage provider governing law shall governed laws singapore file backup move sync restore functions program highly rated easy use features found syncback note features may available higher variants syncback four versions syncback available syncbackfree syncbacklite shareware syncbackse shareware syncbackpro shareware syncbackse syncbackpro work windows client versions windows server oses syncbackfree syncbacklite support windows client versions | [
6289,
2390,
1254,
5571,
3180
] | Train |
1,311 | 4 | Mandiant:mandiant mandiant american cybersecurity firm rose prominence february 2013 released report directly implicating china cyber espionage december 30 2013 mandiant acquired fireeye stock cash deal worth excess 1 billion kevin mandia former united states air force officer serves company chief executive officer founded mandiant red cliff consulting 2004 prior rebranding 2006 2011 mandiant received funding kleiner perkins caufield byers expand staff grow business-to-business operations mandiant provides incident response general security consulting along incident management products major global organizations governments fortune 100 companies 2012 revenues 100 million 76 2011 company acquired fireeye december 30 2013 mandiant awarded 2012 2013 sc award exemplary professional leadership information-technology security mandiant creator openioc open indicators compromise extensible xml schema description technical characteristics identify threats attackers methodologies evidence compromise february 18 2013 mandiant released report documenting evidence cyber attacks people liberation army specifically pudong-based pla unit 61398 targeting least 141 organizations united states english-speaking countries extending far back 2006 report mandiant refers espionage unit apt1 report states likely unit 61398 source attacks video uploaded youtube demonstrating one intrusion apt | [
429,
862,
5982,
124,
6756,
3875,
3486,
1805
] | Test |
1,312 | 9 | Rank_(computer_programming):rank computer programming computer programming rank specifications usually synonym refers number dimensions thus two-dimensional array rank two three-dimensional array rank three strictly formal definition provided applies every programming language since concepts semantics terminology term may even applicable contrary applied specific meaning context given language case apl notion applies every operand dyads binary functions left rank right rank box instead shows rank type rank array expression could defined semi-formal style c++ illustrates simple way calculate compile time given code rank type calculated compile time shorter form calculating rank expression done using | [
1892
] | Test |
1,313 | 9 | Concurrent_ML:concurrent ml concurrent ml cml concurrent extension standard ml programming language characterized ability allow programmers create composable communication abstractions first class rather built language design cml primitive operations adopted several programming languages gnu guile racket manticore many programming languages support concurrency offer communication channels allow exchange values processes threads running concurrently system communications established processes may follow specific protocol requiring programmer write functions establish required pattern communication meanwhile communicating system often requires establishing multiple channels multiple servers choosing available channels new data available accomplished using polling select operation unix systems combining application-specific protocols multi-party communication may complicated due need introduce polling checking blocking within pre-existing protocol concurrent ml solves problem reducing coupling programming concepts introducing synchronizable events events first-class abstraction used synchronization operation called codice_1 cml racket order potentially block produce value resulting communication example data transmitted channel cml events combined manipulated using number primitive operations primitive operation constructs new event rather modifying event in-place allows construction compound events represent desired communication pattern example cml allows programmer combine several sub-events order create compound event non-deterministically chooses one sub-events another primitive creates new event modify value resulting synchronization original event events embody patterns communication non-cml language would typically handled using polling loop function handlers kind event sample code print hello world console spawns thread creates channel strings thread spawns another thread prints first string received channel former thread sends hello world\n string channel uses sml/nj cml note heap name different non linux-x86 platforms may need change line cml_test.x86-linux something different library structure hello | [
3531,
1889,
2638,
1825,
5164,
6981
] | Test |
1,314 | 0 | Computational_linguistics:computational linguistics computational linguistics interdisciplinary field concerned statistical rule-based modeling natural language computational perspective well study appropriate computational approaches linguistic questions traditionally computational linguistics performed computer scientists specialized application computers processing natural language today computational linguists often work members interdisciplinary teams include regular linguists experts target language computer scientists general computational linguistics draws upon involvement linguists computer scientists experts artificial intelligence mathematicians logicians philosophers cognitive scientists cognitive psychologists psycholinguists anthropologists neuroscientists among others computational linguistics theoretical applied components theoretical computational linguistics focuses issues theoretical linguistics cognitive science applied computational linguistics focuses practical outcome modeling human language use association computational linguistics defines computational linguistics computational linguistics often grouped within field artificial intelligence actually present development artificial intelligence computational linguistics originated efforts united states 1950s use computers automatically translate texts foreign languages particularly russian scientific journals english since computers make arithmetic calculations much faster accurately humans thought short matter time could also begin process language computational quantitative methods also used historically attempted reconstruction earlier forms modern languages subgrouping modern languages language families earlier methods lexicostatistics glottochronology proven premature inaccurate however recent interdisciplinary studies borrow concepts biological studies especially gene mapping proved produce sophisticated analytical tools trustworthy results machine translation also known mechanical translation failed yield accurate translations right away automated processing human languages recognized far complex originally assumed computational linguistics born name new field study devoted developing algorithms software intelligently processing language data term computational linguistics first coined david hays founding member association computational linguistics international committee computational linguistics artificial intelligence came existence 1960s field computational linguistics became sub-division artificial intelligence dealing human-level comprehension production natural languages order translate one language another observed one understand grammar languages including morphology grammar word forms syntax grammar sentence structure order understand syntax one also understand semantics lexicon 'vocabulary even something pragmatics language use thus started effort translate languages evolved entire discipline devoted understanding represent process natural languages using computers nowadays research within scope computational linguistics done computational linguistics departments computational linguistics laboratories computer science departments linguistics departments research field computational linguistics aims create working speech text processing systems others aim create system allowing human-machine interaction programs meant human-machine communication called conversational agents computational linguistics performed experts variety fields wide assortment departments research fields broach diverse range topics following sections discuss literature available across entire field broken four main area discourse developmental linguistics structural linguistics linguistic production linguistic comprehension language cognitive skill develops throughout life individual developmental process examined using number techniques computational approach one human language development provide constraints make harder apply computational method understanding instance language acquisition human children largely exposed positive evidence means linguistic development individual evidence correct form provided evidence correct insufficient information simple hypothesis testing procedure information complex language provides certain boundaries computational approach modeling language development acquisition individual attempts made model developmental process language acquisition children computational angle leading statistical grammars connectionist models work realm also proposed method explain evolution language history using models shown languages learned combination simple input presented incrementally child develops better memory longer attention span simultaneously posed reason long developmental period human children conclusions drawn strength artificial neural network project created ability infants develop language also modeled using robots order test linguistic theories enabled learn children might model created based affordance model mappings actions perceptions effects created linked spoken words crucially robots able acquire functioning word-to-meaning mappings without needing grammatical structure vastly simplifying learning process shedding light information furthers current understanding linguistic development important note information could empirically tested using computational approach understanding linguistic development individual within lifetime continually improved using neural networks learning robotic systems also important keep mind languages change develop time computational approaches understanding phenomenon unearthed interesting information using price equation pólya urn dynamics researchers created system predicts future linguistic evolution also gives insight evolutionary history modern-day languages modeling effort achieved computational linguistics would otherwise impossible clear understanding linguistic development humans well throughout evolutionary time fantastically improved advances computational linguistics ability model modify systems affords science ethical method testing hypotheses would otherwise intractable order create better computational models language understanding language structure crucial end english language meticulously studied using computational approaches better understand language works structural level one important pieces able study linguistic structure availability large linguistic corpora samples grants computational linguists raw data necessary run models gain better understanding underlying structures present vast amount data contained single language one cited english linguistic corpora penn treebank derived widely-different sources ibm computer manuals transcribed telephone conversations corpus contains 4.5 million words american english corpus primarily annotated using part-of-speech tagging syntactic bracketing yielded substantial empirical observations related language structure theoretical approaches structure languages also developed works allow computational linguistics framework within work hypotheses understanding language myriad ways one original theoretical theses internalization grammar structure language proposed two types models models rules patterns learned increase strength frequency encounter work also created question computational linguists answer infant learn specific non-normal grammar chomsky normal form without learning overgeneralized version getting stuck theoretical efforts like set direction research go early lifetime field study crucial growth field structural information languages allows discovery implementation similarity recognition pairs text utterances instance recently proven based structural information present patterns human discourse conceptual recurrence plots used model visualize trends data create reliable measures similarity natural textual utterances technique strong tool probing structure human discourse without computational approach question vastly complex information present discourse data would remained inaccessible scientists information regarding structural data language available english well languages japanese using computational methods japanese sentence corpora analyzed pattern log-normality found relation sentence length though exact cause lognormality remains unknown precisely sort intriguing information computational linguistics designed uncover information could lead important discoveries regarding underlying structure japanese could number effects understanding japanese language computational linguistics allows exciting additions scientific knowledge base happen quickly little room doubt recent days structural data languages available several languages world english language computational linguistics work progress sindhi language structure grammar domain sindhi language different languages world computational linguistics models english language suitable sindhi language viewing computational linguistics work sindhi language started properly developing methods algorithms linguistics tools https //sindhinlp.com/ machine learning models deep learning models since 2016. focus solve linguistics problems sindhi language work could lead important discoveries regarding underlying structure sindhi could number effects understanding sindhi language computational linguistics allows exciting additions scientific knowledge base happen quickly little room doubt without computational approach structure linguistic data much information available would still hidden vastness data within single language computational linguistics allows scientists parse huge amounts data reliably efficiently creating possibility discoveries unlike seen approaches production language equally complex information provides necessary skills fluent producer must say comprehension half problem communication half system produces language computational linguistics made interesting discoveries area famous paper published 1950 alan turing proposed possibility machines might one day ability think thought experiment might define concept thought machines proposed imitation test human subject two text-only conversations one fellow human another machine attempting respond like human turing proposes subject tell difference human machine may concluded machine capable thought today test known turing test remains influential idea area artificial intelligence projects still trying solve problem first started computational linguistics field first place however methods become refined clever consequently results generated computational linguists become enlightening effort improve computer translation several models compared including hidden markov models smoothing techniques specific refinements apply verb translation model found produce natural translations german french words refined alignment model first-order dependence fertility model 16 also provide efficient training algorithms models presented give scientists ability improve results type work specific computational linguistics applications could vastly improve understanding language produced comprehended computers work also done making computers produce language naturalistic manner using linguistic input humans algorithms constructed able modify system style production based factor linguistic input human abstract factors like politeness five main dimensions personality work takes computational approach via parameter estimation models categorize vast array linguistic styles see across individuals simplify computer work way making human-computer interaction much natural many earliest simplest models human-computer interaction eliza example involve text-based input user generate response computer method words typed user trigger computer recognize specific patterns reply accordingly process known keyword spotting recent technologies placed emphasis speech-based interactive systems systems siri ios operating system operate similar pattern-recognizing technique text-based systems former user input conducted speech recognition branch linguistics involves processing user speech sound waves interpreting acoustics language patterns order computer recognize input much focus modern computational linguistics comprehension proliferation internet abundance easily accessible written human language ability create program capable understanding human language would many broad exciting possibilities including improved search engines automated customer service online education early work comprehension included applying bayesian statistics task optical character recognition illustrated bledsoe browing 1959 large dictionary possible letters generated learning example letters probability one learned examples matched new input combined make final decision attempts applying bayesian statistics language analysis included work mosteller wallace 1963 analysis words used federalist papers used attempt determine authorship concluding madison likely authored majority papers 1971 terry winograd developed early natural language processing engine capable interpreting naturally written commands within simple rule governed environment primary language parsing program project called shrdlu capable carrying somewhat natural conversation user giving commands within scope toy environment designed task environment consisted different shaped colored blocks shrdlu capable interpreting commands find block taller one holding put box asking questions n't understand pyramid mean response user input impressive kind natural language processing proven much difficult outside limited scope toy environment similarly project developed nasa called lunar designed provide answers naturally written questions geological analysis lunar rocks returned apollo missions kinds problems referred question answering initial attempts understanding spoken language based work done 1960s 1970s signal modeling unknown signal analyzed look patterns make predictions based history initial somewhat successful approach applying kind signal modeling language achieved use hidden markov models detailed rabiner 1989 approach attempts determine probabilities arbitrary number models could used generating speech well modeling probabilities various words generated possible models similar approaches employed early speech recognition attempts starting late 70s ibm using word/part-of-speech pair probabilities recently kinds statistical approaches applied difficult tasks topic identification using bayesian parameter estimation infer topic probabilities text documents modern computational linguistics often combination studies computer science programming math particularly statistics language structures natural language processing combined fields often lead development systems recognize speech perform task based speech examples include speech recognition software apple siri feature spellcheck tools speech synthesis programs often used demonstrate pronunciation help disabled machine translation programs websites google translate computational linguistics especially helpful situations involving social media internet example filters chatrooms website searches require computational linguistics chat operators often use filters identify certain words phrases deem inappropriate users submit another example using filters websites schools use filters websites certain keywords blocked children view also many programs parents use parental controls put content filters place computational linguists also develop programs group organize content social media mining example twitter programs group tweets subject keywords computational linguistics also used document retrieval clustering online search documents websites retrieved based frequency unique labels related typed search engine instance search red large four-wheeled vehicle intention finding pictures red truck search engine still find information desired matching words four-wheeled car computational linguistics divided major areas depending upon medium language processed whether spoken textual upon task performed whether analyzing language recognition synthesizing language generation speech recognition speech synthesis deal spoken language understood created using computers parsing generation sub-divisions computational linguistics dealing respectively taking language apart putting together machine translation remains sub-division computational linguistics dealing computers translate languages possibility automatic language translation however yet realized remains notoriously hard branch computational linguistics areas research studied computational linguistics include subject computational linguistics recurring impact popular culture | [
1808,
3601,
2178,
4660,
1444,
3941,
715,
2553,
1830,
3959,
7539,
3285,
5388,
7900,
733,
3289,
7909,
1477,
2215,
2579,
5756,
6829,
1488,
7202,
2595,
4724,
2603,
5429,
6494,
81,
84,
3680,
6507,
3349,
6166,
4760,
2638,
7627,
6530,
2648,
47... | Validation |
1,315 | 2 | Vinum_volume_manager:vinum volume manager vinum logical volume manager also called software raid allowing implementations raid-0 raid-1 raid-5 models individually combination original vinum part base distribution freebsd operating system since 3.0 also netbsd 2003-10-10 2006-02-25 well descendants freebsd including dragonfly bsd recent versions freebsd replaced gvinum first introduced around freebsd 6 vinum source code maintained freebsd dragonfly source trees vinum supports raid levels 0 1 5 jbod vinum inspired veritas volume manager vinum invoked codice_1 geom vinum freebsd version 5.4 modern freebsd may considered legacy volume manager modern alternatives geom zfs netbsd removed netbsd 4.0 due lack interest maintenance raidframe cited providing similar functionality dragonfly bsd dragonfly hammer filesystem already implements network mirroring codice_2 utility could used configure codice_2 another software raid implementation originally appeared freebsd 6.0 codice_2 deprecated freebsd 9 removed freebsd 10.0 netbsd port red hat lvm2 also available base system dragonfly well addition vinum distribution data across multiple disks managed either dedicated hardware software additionally hybrid raids partly software- partly hardware-based solutions software implementation operating system manages disks array normal drive controller ata sata scsi fibre channel etc. present cpu speeds software raid faster hardware raid hardware implementation raid requires minimum special-purpose raid controller desktop system may pci expansion card might capability built motherboard larger raids controller disks usually housed external multi-bay enclosure controller handles management disks performs parity calculations needed many raid levels option tends provide better performance makes operating system support easier hardware implementations also typically support hot swapping allowing failed drives replaced system running rare cases hardware controllers become faulty result data loss hybrid raids become popular introduction inexpensive hardware raid controllers hardware normal disk controller raid features boot-time application allows users set raids controlled via bios modern operating system used need specialized raid drivers make array look like single block device since controllers actually calculations software hardware often called fakeraids unlike software raid fakeraids typically span multiple controllers simple example mirror drive enterprise drive excelsior raid1 | [
7514,
732,
3636,
5760,
3986,
5065,
6477,
424,
1133,
6149,
6860,
5447,
6505,
1523,
1534,
1547,
481,
2300,
1193,
4059,
8001,
6918,
6211,
4806,
4441,
5865,
5518,
6586,
1237,
8037,
875,
1254,
6972,
191,
4498,
7355,
3457,
5571,
6278,
8096,
5... | Validation |
1,316 | 4 | DroidKungFu:droidkungfu droidkungfu malware affects android os primarily targets users china first evidence malware found android market march 2011 droidkungfu discovered us-based researchers yajin zhou xuxian jiang two discovered malware working north carolina state university targets android 2.2 platform allows hackers access control devices droidkungfu malware collect user data backdoor hacking droidkungfu encrypts two different root exploits udev exploit rageagainsthecage exploit break android security executed decrypts exploits communicates remote server without user knowledge | [
1691,
74,
1766,
3848,
7186,
3486
] | Test |
1,317 | 9 | BASIC_Stamp:basic stamp basic stamp microcontroller small specialized basic interpreter pbasic built rom made parallax inc. popular electronics hobbyists since early 1990s although basic stamp 2 form 24 pin dip chip fact small printed circuit board pcb contains essential elements microprocessor system end result hobbyist connect 9 v battery basic stamp complete system serial connection personal computer allows programmer download software basic stamp stored onboard non-volatile memory device remains programmed erased reprogrammed even power stamp removed power reconnected stamp immediately starts executing program slot 0 8 numbered 0..7 basic stamp programmed variant basic language called pbasic pbasic incorporates common microcontroller functions including pwm serial communications i²c 1-wire communications communications common lcd driver circuits hobby servo pulse trains pseudo-sine wave frequencies ability time rc circuit may used detect analog value program written 'stamp editor integrated development environment ide windows syntax checked tokenized sent chip serial/usb mini-b cable run currently four variants interpreter bs2 sub-variants feature memory higher execution speed additional specialized pbasic commands extra i/o pins etc. comparison original bs2 model bs1 bs2 use pic remaining basic stamp 2 variants use parallax sx processor third variant javelin stamp module uses subset sun microsystems java programming language instead parallax pbasic include networking facilities fourth variant spin stamp module based parallax propeller therefore uses spin programming language instead pbasic number companies make clones basic stamp additional features faster execution analog-to-digital converters hardware-based pwm run background parallax propeller gradually accumulating software libraries give functionality similar basic stamp however uniform list pbasic facilities spin equivalents | [
3931,
7569,
6778,
5208,
2036
] | Test |
1,318 | 5 | Megaphone_desktop_tool:megaphone desktop tool megaphone desktop tool windows action alert tool developed give israel united support giyus distributed world union jewish students world jewish congress jewish agency israel world zionist organization standwithus hasbara fellowships honestreporting pro-israel public relations organizations tool released july 2006 lebanon war june 2011 tool longer available giyus website rss newsfeed available megaphone desktop tool acted wrapper around rss feed giyus website originally gave user option going particular site poll user chooses go site software casts vote automatically technically feasible feature discontinued giyus tries save time effort locating voting form inside website seemingly simple task may prove quite confusing certain sites whenever technically direct straight voting action arrived poll results means directed straight voting action already successfully voted reason n't care vote always use thanks link article alert popup later versions voting concept removed entirely tool directed users anti-israel websites giving users option click button labeled act would direct user poll email address software license provides remote updates understand agree giyus.org may provide updates patches and/or new versions software time time including automatic updates installed computer notice needed continue use services hereby authorize installations according jerusalem post amir gissin head public affairs department foreign ministry israel expressed support tool use foreign ministry pushing idea urging supporters israel everywhere become cyberspace soldiers new battleground israel image reports computing website register described use software highly organised mass manipulation technologies supposed democratising claimed megaphone effectively high-tech exercise ballot-stuffing register also reported bbc history magazine website noticed upsurge voting whether holocaust denial criminal offence britain closing date already passed result already published votes invalid anyway stewart purvis former editor-in-chief itn noted independent panel reviewing bbc israeli-palestinian coverage received large number letters north america accused bbc anti-israeli states evidence pressure group involvement following success megaphone tool developers formed company collactive 2007 collactive released web assistant general-purpose commercial version megaphone tool tool received wide range reactions praise criticism amir gissin head public affairs department israeli foreign ministry praised tool noting efficacy adnan hajj photographs controversy obtaining admission reuters news agency photograph adnan hajj improperly edited photo editing software tool similarly praised number pro-israel organizations helping fight perceive anti-israel media bias time criticized independent television news others stuffing ballot online polls generating excessive comments 'spam internet message boards stifling online discussion seen mass participatory form propaganda june 2011 megaphone desktop tool unavailable download creators website currently alerts displayed giyus website rss feed | [] | Train |
1,319 | 4 | Malware_research:malware research notion self-reproducing computer program traced back initial theories operation complex automata john von neumann showed theory program could reproduce constituted plausibility result computability theory fred cohen experimented computer viruses confirmed neumann postulate investigated properties malware detectability self-obfuscation using rudimentary encryption 1988 doctoral dissertation subject computer viruses cohen faculty advisor leonard adleman presented rigorous proof general case algorithmic determination presence virus undecidable problem must mistaken determination within broad class programs virus present problem differs require ability recognize viruses adleman proof perhaps deepest result malware computability theory date relies cantor diagonal argument well halting problem ironically later shown young yung adleman work cryptography ideal constructing virus highly resistant reverse-engineering presenting notion cryptovirus cryptovirus virus contains uses public key randomly generated symmetric cipher initialization vector iv session key sk cryptoviral extortion attack virus hybrid encrypts plaintext data victim machine using randomly generated iv sk iv+sk encrypted using virus writer public key theory victim must negotiate virus writer get iv+sk back order decrypt ciphertext assuming backups analysis virus reveals public key iv sk needed decryption private key needed recover iv sk result first show computational complexity theory used devise malware robust reverse-engineering growing area computer virus research mathematically model infection behavior worms using models lotka–volterra equations applied study biological virus various virus propagation scenarios studied researchers propagation computer virus fighting virus virus like predator codes effectiveness patching etc behavioral malware detection researched recently approaches behavioral detection based analysis system call dependencies executed binary code traced using strace precise taint analysis compute data-flow dependencies among system calls result directed graph formula_1 nodes system calls edges represent dependencies example formula_2 result returned system call formula_3 either directly result indirectly output parameters later used parameter system call formula_4 origins idea use system calls analyze software found work forrest et al christodorescu et al point malware authors easily reorder system calls without changing semantics program makes system call dependency graphs suitable malware detection compute difference malware goodware system call dependency graphs use resulting graphs detection achieving high detection rates kolbitsch et al pre-compute symbolic expressions evaluate syscall parameters observed runtime detect dependencies observing whether result obtained evaluation matches parameter values observed runtime malware detected comparing dependency graphs training test sets fredrikson et al describe approach uncovers distinguishing features malware system call dependency graphs extract significant behaviors using concept analysis leap mining babic et al recently proposed novel approach malware detection classification based grammar inference tree automata approach infers automaton dependency graphs show automaton could used detection classification malware research combining static dynamic malware analysis techniques also currently conducted effort minimize shortcomings studies researchers islam et al working integrate static dynamic techniques order better analyze classify malware malware variants | [
5274
] | Test |
1,320 | 4 | XSL_attack:xsl attack cryptography extended sparse linearization xsl attack method cryptanalysis block ciphers attack first published 2002 researchers nicolas courtois josef pieprzyk caused controversy claimed potential break advanced encryption standard aes cipher also known rijndael faster exhaustive search since aes already widely used commerce government transmission secret information finding technique shorten amount time takes retrieve secret message without key could wide implications method high work-factor unless lessened means technique reduce effort break aes comparison exhaustive search therefore affect real-world security block ciphers near future nonetheless attack caused experts express greater unease algebraic simplicity current aes overview xsl attack relies first analyzing internals cipher deriving system quadratic simultaneous equations systems equations typically large example 8,000 equations 1,600 variables 128-bit aes several methods solving systems known xsl attack specialized algorithm termed extended sparse linearization applied solve equations recover key attack notable requiring handful known plaintexts perform previous methods cryptanalysis linear differential cryptanalysis often require unrealistically large numbers known chosen plaintexts solving multivariate quadratic equations mq finite set numbers np-hard problem general case several applications cryptography xsl attack requires efficient algorithm tackling mq 1999 kipnis shamir showed particular public key algorithm known hidden field equations scheme hfe could reduced overdetermined system quadratic equations equations unknowns one technique solving systems linearization involves replacing quadratic term independent variable solving resultant linear system using algorithm gaussian elimination succeed linearization requires enough linearly independent equations approximately many number terms however cryptanalysis hfe equations kipnis shamir proposed re-linearization technique extra non-linear equations added linearization resultant system solved second application linearization re-linearization proved general enough applicable schemes 2000 courtois et al proposed improved algorithm mq known xl extended linearization increases number equations multiplying monomials certain degree complexity estimates showed xl attack would work equations derived block ciphers aes however systems equations produced special structure xsl algorithm developed refinement xl could take advantage structure xsl equations multiplied carefully selected monomials several variants proposed research efficiency xl derivative algorithms remains ongoing yang chen 2004 courtois pieprzyk 2002 observed aes rijndael partially also serpent could expressed system quadratic equations variables represent plaintext ciphertext key bits also various intermediate values within algorithm s-box aes appears especially vulnerable type analysis based algebraically simple inverse function subsequently ciphers studied see systems equations produced biryukov de cannière 2003 including camellia khazad misty1 kasumi unlike forms cryptanalysis differential linear cryptanalysis one two known plaintexts required xsl algorithm tailored solve type equation systems produced courtois pieprzyk estimate optimistic evaluation shows xsl attack might able break rijndael 256 bits serpent key lengths 192 256 bits analysis however universally accepted example aes 4 conference bonn 2004 one inventors rijndael vincent rijmen commented xsl attack attack dream promptly courtois answered xsl may dream may also bad dream turn nightmare however neither later paper actions nsa nist give support remark courtois 2003 murphy robshaw discovered alternative description aes embedding larger cipher called bes described using simple operations single field gf 2 xsl attack mounted system yields simpler set equations would break aes complexity around 2 courtois pieprzyk analysis correct 2005 cid leurent gave evidence proposed form xsl algorithm provide efficient method solving aes system equations however courtois disputed findings fse 2007 chu-wee lim khoongming khoo showed possibly work presented even xsl works modern algorithms attack currently poses little danger terms practical security like many modern cryptanalytic results would so-called certificational weakness faster brute force attack resources required still huge unlikely real-world systems could compromised using future improvements could increase practicality attack however type attack new unexpected cryptographers expressed unease algebraic simplicity ciphers like rijndael bruce schneier niels ferguson write one criticism aes n't quite trust security… concerns us aes simple algebraic structure… block cipher know simple algebraic representation idea whether leads attack knowing reason enough skeptical use aes practical cryptography 2003 pp 56–57 | [
1811,
4930,
464,
807,
1353,
2918,
907,
3100,
119,
7548,
1283,
6637,
1480,
6372,
6647,
7200,
4805,
5765,
5327,
6657,
7928,
1587,
5333,
6763,
6049,
161,
433,
613,
1146,
4917
] | Train |
1,321 | 4 | Voice_phishing:voice phishing voice phishing form criminal phone fraud using social engineering telephone system gain access private personal financial information purpose financial reward sometimes referred vishing portmanteau voice phishing landline telephone services traditionally trustworthy terminated physical locations known telephone company associated bill-payer however vishing fraudsters often use modern voice ip voip features caller id spoofing automated systems ivr make difficult legal authorities monitor trace block voice phishing typically used steal credit card numbers information used identity theft schemes individuals although use automated responders war dialers preferred vishers reported cases human operators play active role scams attempt persuade victims posing employee legitimate body bank police telephone internet provider fraudster attempts obtain personal details financial information regarding credit card bank accounts e.g pin well personal information victim received information fraudster might able access empty account commit identity fraud fraudsters may also try persuade victim transfer money another bank account withdraw cash given directly another simple trick used fraudsters ask called parties hang dial bank victim hangs fraudster keeping line open remaining connected victim picks phone dial doubt calling company telephone number listed billing statements official sources recommended opposed calling numbers received messages callers dubious authenticity however sometimes hanging redialing insufficient caller hung victim might still connected fraudster spoofs dial tone phone line entice victim dial fraudster accomplice answers impersonates whomever victim trying call known 'no hang-up scam hence consumers advised use different phone dialing company number confirm bank account data sensitive information targeted fraudsters also trying obtain security credentials consumers use microsoft apple products spoofing caller id microsoft apple inc.. sweden mobile bank id phone app launched 2011 used identify user internet banking user logs bank computer bank activates phone app user enters password phone logged fraudulent people called people claimed bank officer saying security problem asked use mobile bank id app victim say password logged fraudster computer second mobile bank id app log approved transfer money nordea even approved fraudster phone able approve usage victim account 2018 app changed must photograph qr code computer screen making sure phone computer physically located room mostly eliminated type fraud | [
5722,
5547,
7164,
5733,
7813,
7174,
3964,
6102,
5132,
4699,
7836,
2944,
3480,
1036,
3147,
4734,
1321,
3921,
6240
] | Test |
1,322 | 2 | Alexandre_Julliard:alexandre julliard alexandre julliard born 1970 computer programmer best known project leader wine compatibility layer run microsoft windows programs unix-like operating systems julliard studied computer science swiss federal institute technology lausanne spent 1990s working embedded systems works full-time wine codeweavers julliard enjoys astronomy currently lives lausanne switzerland | [
1128,
4759,
5571
] | Test |
1,323 | 2 | Vital_Product_Data:vital product data vital product data vpd collection configuration informational data associated particular set hardware software vpd stores information part numbers serial numbers engineering change levels devices attached system provide vpd often available pci scsi devices parallel ata usb devices also provide similar data refer vpd vpd data typically burned onto eeproms associated various hardware components queried attached i2c buses used firmware example openfirmware determine nature system hardware shield operation firmware minor changes variations hardware implementations within given machine model number ibm aix operating system vpd also refers subset database tables object data manager odm obtained either customized vpd object class platform specific areas therefore vpd odm terms sometimes referred interchangeably lscfg command used aix get vpd codice_1 linux commands codice_2 codice_3 codice_4 display hardware vital product data | [
578
] | Test |
1,324 | 2 | NOS/VE:nos/ve nos/ve network operating system virtual environment discontinued operating system time-sharing capabilities written control data corporation 1980s virtual memory operating system employing 64-bit virtual mode cdc cyber 180 series computers nos/ve replaced earlier nos nos/be operating systems 1970s command shell interface nos/ve called system command language scl short order callable scl command programs must declare parameters permits automatic usage summaries passing parameters name position type checking parameter values standard nos/ve commands follow particular naming convention form command verb adjective noun commands could abbreviated first three characters verb followed first character words examples inspired addressing structure-members various programming languages catalog separator dot subsystems like ftp integrate command shell change prompt add commands like get_file thereby statements like flow-control stay subsystems mixed procedures scripts commands could take parameters create_connection command would connect ip address 10.1.2.3 telnet service | [
7765,
5571,
8066,
1537,
13,
5138,
5116,
4020
] | Test |
1,325 | 3 | Reset_vector:reset vector reset vector default location central processing unit go find first instruction execute reset reset vector pointer address cpu always begin soon able execute instructions address section non-volatile memory initialized contain instructions start operation cpu first step process booting system containing cpu | [
5055,
5079,
3511,
1237,
7064,
352,
4810,
971,
1992
] | Test |
1,326 | 4 | Common_Criteria_Testing_Laboratory:common criteria testing laboratory common criteria model provides separation roles evaluator certifier product certificates awarded national schemes basis evaluations carried independent testing laboratories common criteria testing laboratory third-party commercial security testing facility accredited conduct security evaluations conformance common criteria international standard facility must accredited according iso/iec 17025 national certification body list laboratory designations country common criteria recognition arrangement ccra common criteria mutual recognition arrangement mra limitations agreement past evaluations eal4+ recognized on-going transition away eal levels introduction ndpp evaluations “ map ” eal4 assurance components continue recognized united states national institute standards technology nist national voluntary laboratory accreditation program nvlap accredits cctls meet national information assurance partnership niap common criteria evaluation validation scheme requirements conduct security evaluations conformance common criteria laboratories must meet following requirements cctls enter contractual agreements sponsors conduct security evaluations products protection profiles use ccevs niap approved test methods derived common criteria common methodology technology based sources cctls must observe highest standards impartiality integrity commercial confidentiality cctls must operate within guidelines established ccevs become cctl testing laboratory must go series steps involve niap validation body nvlap nvlap accreditation primary requirement achieving cctl status scheme requirements satisfied nvlap accreditation addressed niap validation body present three scheme-specific requirements imposed validation body niap approved cctls must agree following testing laboratory becomes cctl laboratory approved niap validation body listed approved laboratories list avoid unnecessary expense delay becoming niap-approved testing laboratory strongly recommended prospective cctls ensure able satisfy scheme-specific requirements prior seeking accreditation nvlap accomplished sending letter intent niap prior entering nvlap process additional laboratory-related information found ccevs publications canada communications security establishment canada csec canadian common criteria scheme cccs oversees common criteria evaluation facilities ccef accreditation performed standards council canada scc program accreditation laboratories – canada palcan according can-p-1591 scc ’ adaptation iso/iec 17025-2005 itset laboratories approval performed ccs certification body body within csec verification applicant ability perform competent common criteria evaluations | [
4608,
6208,
4617,
3611,
3003
] | Train |
1,327 | 4 | Shannen_Rossmiller:shannen rossmiller shannen rossmiller born may 31 1969 american lecturer instructor cyber counter-intelligence forensics former montana municipal court judge controversial role vigilante online terrorist-hunter part 7seas group former high school cheerleader paralegal mother three rossmiller posed online militant anti-american muslim radicals attract eye similar mindsets still member 7-seas group provided evidence led arrest conviction ryan g. anderson national guardsman deploy u.s. iraq ryan serving life sentence seeking aid enemy time war attempted espionage 2005 posing online al qaeda financier rossmiller offered transient michael reynolds 40,000 purchase fuel trucks attack american pipelines reynolds arrested attempted pick money 2007 convicted jury attempting provide material support al qaeda related charges sentenced 30 years jail rossmiller appeared 2005 bbc documentary entitled new al-qaeda along internet cyber sleuths criticized work july 2007 publicist seeking book movie deal based rossmiller story 2011 published book entitled unexpected patriot | [] | Test |
1,328 | 4 | Qualys:qualys qualys inc. provides cloud security compliance related services based foster city california founded 1999 qualys first company deliver vulnerability management solutions applications web using software service saas model 2013 gartner group fifth time gave qualys strong positive rating services added cloud-based compliance web application security offerings qualys 10,300 customers 130 countries including majority forbes global 100 company strategic partnerships major managed services providers consulting organizations including bt dell secureworks fujitsu ibm ntt symantec verizon wipro company also founding member cloud security alliance csa qualys founded 1999 company launched qualysguard december 2000 making qualys one first entrants vulnerability management market march 2001 angel investor philippe courtot became ceo company major investment company also serves chairman board qualysguard intranet scanner released 2002 automatically scan corporate lans vulnerabilities search available patch following year qualys released freemap web-based tool scanning mapping identifying possible security holes within networks connected internet 2005 qualys extended qualysguard product line 2008 qualys introduced qualysguard policy compliance extended platform ’ global scanning capabilities collect compliance data across organization map information policies document compliance auditing purposes qualys also released service web application scanning named qualysguard web application scanning 2010 rsa conference usa qualys announced qualysguard malware detection service new service designed scan identify malware web sites also announced qualys secure seal allows websites show visitors passed security scans july 2010 qualys announced qualys browsercheck service checking web browsers plug-ins security vulnerabilities rsa conference 2011 qualys launched new open source web application firewall project ironbee led ivan ristic creator modsecurity director engineering qualys rsa conference 2012 qualys introduced updates qualysguard cloud platform extended capabilities help customers improve security systems applications automate compliance initiatives it-grc provide online protection cyber-attacks reducing operational costs increasing efficiency security programs qualys went public nasdaq symbol qlys september 28 2012 raising net proceeds 87.5 million 2014 rsa conference qualys announced general availability qualyguard web application firewall waf provides protection websites running amazon ec2 on-premises well new continuous monitoring solution free top 4 security controls service 2015 company released 2.0 waf software included virtual patching customizable event responses year qualys also released security compliance solution called cloud agent platform august 2015 company released free asset management service qualys assetview allowed organizations keep inventory computers software february 2016 qualys released threatprotect vulnerability detection service cloud-based platform company received full certification configuration management databases cmdbs app servicenow allowing app integrated servicenow system march 2016 july 2016 announced qualys would integrate microsoft azure security center august 2017 qualys acquired network analysis assets nevis networks undisclosed sum december 2017 qualys announced acquisition netwatcher network security company april 2018 qualys acquired software assets singapore-based 1mobility startup develops security technologies mobile phones june 2018 qualys announced addition asset inventory cloud platform sc magazine awarded qualys security software solutions every year 2004-2014 sc magazine also awarded qualys best security company 2014 2010 inc. magazine ranked qualys within 5000 fastest growing private companies usa based 104 revenue growth 2006 2009 2012 silicon valley/san jose business journal recognized qualys one largest private companies silicon valley – ranking 26th list 51 november 2014 qualys received 2014 security reader choice awards best risk policy compliance solution best application security product best vulnerability 2014 2015 qualys received award best application security product sans institute 2017 frost sullivan recognizes qualys 2017 global vulnerability management market leadership award qualys honored cyber defense magazine 2017 cyber security leader | [
3932,
230,
330,
5511,
2691,
7487,
4449,
688,
7506
] | Train |
1,329 | 7 | Filecoin:filecoin filecoin ⨎ open-source public cryptocurrency digital payment system intended blockchain-based cooperative digital storage data retrieval method made protocol labs builds top interplanetary file system allowing users rent unused hard drive space | [
6069,
2984,
3172,
7714,
2379,
7343,
6430,
2390,
3024,
2664,
744,
6025,
499,
2681,
6216,
3401,
3573,
8124,
2960,
2430,
2696,
5531,
3338,
4014,
538
] | Validation |
1,330 | 0 | Microsoft_Language_Portal:microsoft language portal microsoft language portal multilingual online dictionary computing terms also offers free downloads localization style guides translations user interface text feedback feature made public 2009 | [] | Test |
1,331 | 5 | OpenSTA:opensta opensta feature-rich gui-based web server benchmarking utility perform scripted http https heavy load tests performance measurements freely available distributable open source gnu general public license opensta currently runs microsoft windows-based operating systems scripts recorded proprietary language called scl fairly simple coding language provides support custom functions variable scopes random sequential lists opensta originally written cyrano cyrano intentions write commercial plug modules support opensta performance testing non-web applications note recent version posted opensta home page 1.4.4 released 27 oct 2007 | [
1458,
7442,
2451,
7403,
2743,
2522,
4759,
5571,
3156,
352,
1451,
578
] | Test |
1,332 | 4 | Katie_Moussouris:katie moussouris katie moussouris american computer security researcher entrepreneur pioneer vulnerability disclosure best known ongoing work advocating responsible security research previously member stake created bug bounty program microsoft directly involved creating u.s. department defense first bug bounty program hackers previously served chief policy officer hackerone vulnerability disclosure company based san francisco california currently founder ceo luta security moussouris interested computers young age learned program basic commodore 64 mother bought 3rd grade first girl take ap computer science high school attended simmons college study molecular biology mathematics simultaneously worked human genome project mit whitehead institute whitehead transitioned lab assistant systems administrator role three years became systems administrator mit department aeronautics astronautics helped design computer system new lab open 2000 time also worked systems administrator harvard school engineering applied sciences moved california work linux developer turbolinux started computer security response program active within west coast hacker scene formally joined stake penetration tester 2002 invitation chris wysopal moussouris joined symantec october 2004 acquired stake founded managed symantec vulnerability research 2004 first program allow symantec researchers publish vulnerability research may 2007 moussouris left symantec join microsoft security strategist founded microsoft vulnerability research msvr program announced blackhat 2008 program coordinated response several significant vulnerabilities including dan kaminsky dns flaw also actively looked bugs third-party software affecting microsoft customers subsequent examples include google project zero september 2010 may 2014 moussouris senior security strategist lead microsoft ran security community outreach strategy team microsoft part microsoft security response center msrc team instigated microsoft bluehat prize advancement exploit mitigations awarded 260,000 prizes researchers blackhat usa 2012 grand prize 200,000 time largest cash payout offered software vendor also created microsoft first bug bounty program paid 253,000 received 18 vulnerabilities course tenure moussouris helped edit iso/iec 29147 document since around 2008 april 2016 iso made standard freely available charge request moussouris cert coordination center art manion may 2014 moussouris named chief policy officer hackerone vulnerability disclosure company based san francisco california role moussouris responsible company vulnerability disclosure philosophy worked promote legitimize security research among organizations legislators policy makers still microsoft moussouris began discussing bug bounty program federal government continued talks moved hackerone march 2016 moussouris directly involved creating department defense hack pentagon pilot program organized vetted hackerone first bug bounty program history us federal government moussouris followed pentagon program hack air force hackerone luta security partnering deliver 20 bug bounty challenges three years defense department april 2016 moussouris founded luta security consultancy help organizations governments work collaboratively hackers bug bounty programs 2015-2016 2016-2017 katie moussouris served cybersecurity fellow new america u.s. based think tank 2013 wassenaar arrangement export controls conventional arms dual-use goods technologies amended include intrusion software moussouris wrote op-ed wired criticizing move harmful vulnerability disclosure industry due overly-broad definition encouraged security experts write help regulators understand make right changes invited technical expert directly assist us wassenaar arrangement negotiations helped rewrite amendment adopt end-use decontrol exemptions based intent user moussouris visiting scholar mit sloan school management affiliate researcher harvard belfer center science international affairs conducted economic research labor market security bugs coauthored book chapter first system dynamics model vulnerability economy exploit market published mit press 2017 2018 moussouris testified front u.s. senate subcommittee consumer protection product safety insurance data security security research defensive purposes 2014 sc magazine named moussouris women security list also named one 10 women information security everyone know one watch among 2011 women influence awards 2018 featured among america top 50 women tech forbes september 2015 moussouris filed discrimination class-action lawsuit microsoft federal court seattle alleged microsoft hiring practices upheld practice sex discrimination women technical engineering roles respect performance evaluations pay promotions terms conditions employment | [
6412,
3932,
501,
3842,
5125,
4522,
5051,
578,
5511,
3486,
1805
] | Train |
1,333 | 8 | Apache_Nutch:apache nutch apache nutch highly extensible scalable open source web crawler software project nutch coded entirely java programming language data written language-independent formats highly modular architecture allowing developers create plug-ins media-type parsing data retrieval querying clustering fetcher robot web crawler written scratch specifically project nutch originated doug cutting creator lucene hadoop mike cafarella june 2003 successful 100-million-page demonstration system developed meet multi-machine processing needs crawl index tasks nutch project also implemented mapreduce facility distributed file system two facilities spun subproject called hadoop january 2005 nutch joined apache incubator graduated become subproject lucene june year since april 2010 nutch considered independent top level project apache software foundation february 2014 common crawl project adopted nutch open large-scale web crawl goal nutch project release global large-scale web search engine longer case nutch following advantages simple fetcher ibm research studied performance nutch/lucene part commercial scale cso project findings scale-out system nutch/lucene could achieve performance level cluster blades achievable scale-up computer power5 clueweb09 dataset used e.g trec gathered using nutch average speed 755.31 documents per second | [
7238,
894,
4303,
7886,
5728,
7805,
1732,
2739,
2741,
7444,
7896,
7360,
917,
654,
5571,
3463,
3542,
3204,
1286,
2856,
6821,
5054,
840,
1392,
3031,
5408,
503,
3558,
5677,
7924,
3479,
5447,
6474,
855,
5863,
6387,
5075,
6137,
7488,
7857,
58... | Train |
1,334 | 4 | Internet_Crime_Complaint_Center:internet crime complaint center mission internet crime complaint center also known ic3 provide public reliable convenient reporting mechanism submit information federal bureau investigation fbi concerning suspected internet-facilitated criminal activity develop alliances law enforcement industry partners information analyzed disseminated investigative intelligence purposes law enforcement public awareness since 2000 ic3 received complaints crossing spectrum cyber crime matters include online fraud many forms including intellectual property rights ipr matters computer intrusions hacking economic espionage theft trade secrets online extortion international money laundering identity theft growing list internet facilitated crimes become increasingly evident regardless label placed cyber crime matter potential overlap another referred matter substantial therefore ic3 formerly known internet fraud complaint center ifcc renamed october 2003 better reflect broad character matters internet cyber nexus referred ic3 minimize need one distinguish internet fraud potentially overlapping cyber crimes ic3 purpose serve central hub receive develop refer criminal complaints regarding rapidly expanding occurrences internet crime ic3 gives victims convenient easy-to-use reporting mechanism alerts authorities suspected criminal civil violations internet ic3 develops leads notifies law enforcement agencies federal state local international level | [
2789,
3480,
1376,
6240,
5401,
1805
] | Validation |
1,335 | 3 | X86_instruction_listings:x86 instruction listings x86 instruction set refers set instructions x86-compatible microprocessors support instructions usually part executable program often stored computer file executed processor x86 instruction set extended several times introducing wider registers datatypes well new functionality full 8086/8088 instruction set intel instructions available 32-bit mode operate 32-bit registers eax ebx etc values instead 16-bit ax bx etc counterparts see also x86 assembly language quick tutorial processor family updated instruction set also grouped according architecture i386 i486 i686 generally referred x86 32 x86 64 also known amd64 also mmx registers mmx support instructions added usable integer floating point operations see amd changed cpuid detection bit feature k6-ii lzcnt popcnt population count advanced bit manipulation andn bextr blsi blsmsk blsr tzcnt bzhi mulx pdep pext rorx sarx shrx shlx bextr blcfill blci blcic blcmask blcs blsfill blsic t1mskc tzmsk fxrstor fxsave also supported later pentium iis contain sse support fisttp x87 integer conversion truncation regardless status word mmx instructions operate mm registers 64 bits wide shared fpu registers added pentium mmx added 6x86mx cyrix deprecated paveb paddsiw pmagw pdistib psubsiw pmvzb pmulhrw pmvnzb pmvlzb pmvgezb pmulhriw pmachriw following mmx instruction added sse also available athlon name mmx+ following mmx instructions added sse2 added k6-2 femms pavgusb pf2id pfacc pfadd pfcmpeq pfcmpge pfcmpgt pfmax pfmin pfmul pfrcp pfrcpit1 pfrcpit2 pfrsqit1 pfrsqrt pfsub pfsubr pi2fd pmulhrw prefetch prefetchw pf2iw pfnacc pfpnacc pi2fw pswapd pfrsqrtv pfrcpv added pentium iii sse instructions operate xmm registers 128 bit wide sse consists following sse simd floating-point instructions added pentium 4 sse2 allows execution mmx instructions sse registers processing twice amount data following instructions used sse registers since nature work mmx registers added pentium 4 supporting sse3 added xeon 5100 series initial core 2 following mmx-like instructions extended sse registers added ssse3 added core 2 manufactured 45nm added phenom processors added nehalem processors sse5 proposed sse extension amd bundle include full set intel sse4 instructions making competitor sse4 rather successor amd chose implement sse5 originally proposed however derived sse extensions introduced introduced bulldozer processor core removed zen microarchitecture onward revision sse5 instruction set half-precision floating-point conversion supported amd processors starting piledriver architecture intel starting haswell processors broadwell processors since 2014 fused multiply-add floating-point vector multiply–accumulate three operands supported amd processors starting bulldozer architecture supported intel chip 2017 fused multiply-add four operands fma4 realized hardware fma3 avx first supported intel sandy bridge amd bulldozer vector operations 256 bit registers introduced intel haswell microarchitecture amd excavator expansion vector integer sse avx instructions 256 bits introduced intel xeon phi x200 vector operations 512 bit registers 6 new instructions 7 new instructions x86 cpus contain undocumented instructions implemented chips listed official documents found various sources across internet ralf brown interrupt list sandpile.org ffreep performs ffree st pop stack | [
364,
6078,
719,
7533,
1465,
7541,
410,
4719,
421,
6133,
1881,
5431,
4009,
6498,
6865,
2989,
5107,
6171,
6523,
3020,
4077,
6563,
8033,
3747,
2351,
5190,
2000,
4845,
6969,
3442,
6616,
8077,
2744,
584,
6291,
6647,
5245,
3137,
4542,
6675,
2... | Test |
1,336 | 9 | Simulink:simulink simulink developed mathworks graphical programming environment modeling simulating analyzing multidomain dynamical systems primary interface graphical block diagramming tool customizable set block libraries offers tight integration rest matlab environment either drive matlab scripted simulink widely used automatic control digital signal processing multidomain simulation model-based design mathworks third-party hardware software products used simulink example stateflow extends simulink design environment developing state machines flow charts mathworks claims coupled another products simulink automatically generate c source code real-time implementation systems efficiency flexibility code improves becoming widely adopted production systems addition tool embedded system design work flexibility capacity quick iteration embedded coder creates code efficient enough use embedded systems simulink real-time formerly known xpc target together x86-based real-time systems environment simulating testing simulink stateflow models real-time physical system another mathworks product also supports specific embedded targets used generic products simulink stateflow automatically generate synthesizable vhdl verilog simulink verification validation enables systematic verification validation models modeling style checking requirements traceability model coverage analysis simulink design verifier uses formal methods identify design errors like integer overflow division zero dead logic generates test case scenarios model checking within simulink environment simevents used add library graphical building blocks modeling queuing systems simulink environment add event-based simulation engine time-based simulation engine simulink therefore simulink type simulation done model simulated point environment different type blocks accessed using simulink library browser therefore benefit could taken environment efficiently | [
1908,
5363,
7516,
4759,
5117,
6527,
5571,
2659,
4504,
5397,
578,
4336,
1569,
7557,
2866,
7664,
3148,
7860,
2524,
1989,
7777,
1435
] | Test |
1,337 | 4 | Security_breach_notification_laws:security breach notification laws security breach notification laws data breach notification laws laws require entity subject data breach notify customers parties breach take steps remediate injuries caused breach laws irregularly enacted 50 u.s. states since 2002 last 3 states privacy laws protecting citizens late 2016 new mexico passed privacy law 2017 south dakota alabama 2018 laws enacted response escalating number breaches consumer databases containing personally identifiable information first law california data security breach notification law enacted 2002 became effective july 1 2003 related bill statement law requires state agency person business conducts business california owns licenses computerized data includes personal information defined disclose specified ways breach security data defined resident california whose unencrypted personal information reasonably believed acquired unauthorized person addition law permits delayed notification law enforcement agency determines would impede criminal investigation law also requires entity licenses information notify owner licensee information breach security data general state laws follow basic tenets california original law companies must immediately disclose data breach customers usually writing california since broadened law include compromised medical health insurance information bills differ level breach must reported state attorney general usually affects 500 1000 individuals states like california publish data breach notifications oag.gov websites breaches must reported sensitive personally identifying information acquired reasonably believed acquired unauthorized person reasonably likely cause substantial harm individuals information relates leaves room interpretation cause substantial harm breaches encrypted data need reported must reported data obtained viewed unauthorized individuals long reason believe use data harmful ways national conference state legislatures maintains list enacted proposed security breach notification laws number bills would establish national standard data security breach notification introduced u.s. congress none passed 109th congress 2015 state union speech president obama proposed new legislation create national data breach standard would establish 30-day notification requirement discovery breach european union implemented breach notification law directive privacy electronic communications e-privacy directive 2009 specific personal data held telecoms internet service providers directive implemented national law 25 may 2011 furthermore traffic data subscribers use voice data via network company saved company operational reasons however traffic data must deleted ’ necessary anymore order avoid breaches hand traffic data necessary creation treatment subscriber billing use data available end period bill repaid based law european union article 6 paragraphs 1-6 regarding marketing usage traffic data sale additional chargeable services used company subscriber gives his/her consent consent withdrawn every time also service provider must inform subscriber user types traffic data processed duration based assumptions processing traffic data accordance details must restricted persons acting authority providers public communications networks publicly available electronic communications services handling billing traffic management customer enquiries fraud detection marketing electronic communications services providing value added service must restricted necessary purposes activities | [
860,
7836
] | Test |
1,338 | 3 | Cobra_Command_(1984_video_game):cobra command 1984 video game cobra command known japan interactive movie game originally released data east 1984 laserdisc-based coin-operated arcade game terrorists threatening free world amassed diabolical force brave pilot cobra command vanquish terrorist threat save free world total destruction player assumes role pilot lx-3 super cobra helicopter missions go across new york city streets statue liberty atlantic ocean italy grand canyon enemy headquarters easter island original arcade version interactive movie shooter game player watches scenes helicopter flies conflict zone game screen represented helicopter cockpit player controls crosshair moved aim enemy forces game features joystick two buttons one machine gun one missile game played 1 2 players certain moments voice pilot commanding officer helps player completing mission firing enemy forces dodging enemy fire natural surroundings pressing joystick directional pad correct direction right time pilot makes mistake anime sequence shows cobra helicopter blown player loses life lives lost game screen shows cobra smoldering ruins pilot presumably dead crash mega-cd port cobra command developed wolf team released 1992 cobra command later re-released japan playstation sega saturn 1995 two-in-one compilation road blaster another fmv game produced team data east released second game titled cobra command 1988 unlike 1984 version 1988 arcade game side-scrolling shoot-'em-up november 2009 revolutionary concepts developed published enhanced iphone os version laserdisc original yoshihisa kishimoto director cobra command also directed arcade versions double dragon battle chopper cobra command makes cameo inside garage billy jimmy walked opening sequence double dragon ii kunio-kun double dragon series creator yoshihisa kishimoto designed entirely new game cobra command using data east bega battle hardware therefore bega battle become somewhat rare even among laserdisc games cobra command developed data east co-operation external company toei animation first published japan 1984 thunder storm released later year north america cobra command one data east interactive movie games despite name similarities animation relation organization cobra command elements g.i joe franchise. also largely animated toei animation hence similarities animation style game cobra command hero pilot reviewing sega cd version wizard magazine glenn rubenstein praised high number levels unique interface gave game b- release famicom tsūshin scored sega saturn version game 25 40 giving playstation version 23 40 | [
1714,
1946
] | Test |
1,339 | 9 | Relocation_(computing):relocation computing relocation process assigning load addresses position-dependent code data program adjusting code data reflect assigned addresses prior advent multiprocess systems still many embedded systems addresses objects absolute starting known location often zero since multiprocessing systems dynamically link switch programs became necessary able relocate objects using position-independent code linker usually performs relocation conjunction symbol resolution process searching files libraries replace symbolic references names libraries actual usable addresses memory running program relocation typically done linker link time also done load time relocating loader run time running program architectures avoid relocation entirely deferring address assignment run time known zero address arithmetic object files segmented various memory segment types example segments include code segment .text initialized data segment .data uninitialized data segment .bss others relocation table list pointers created translator compiler assembler stored object executable file entry table fixup pointer absolute address object code must changed loader relocates program refer correct location fixups designed support relocation program complete unit cases fixup table relative base address zero fixups must changed loader moves table architectures fixup crosses certain boundaries segment boundary aligned word boundary illegal flagged error linker far pointers 32-bit pointers segment offset used address 20-bit 640 kb memory space available dos programs point code data within dos executable exe absolute segments actual address code/data depends program loaded memory known program loaded instead segments relative values dos exe file segments need corrected executable loaded memory exe loader uses relocation table find segments need adjusted 32-bit windows operating systems mandatory provide relocation tables exe files since first image loaded virtual address space thus loaded preferred base address dlls exes opt address space layout randomization aslr exploit mitigation technique introduced windows vista relocation tables become mandatory possibility binary may dynamically moved executed even though still first thing loaded virtual address space running native 64-bit binaries windows vista aslr mandatory thus relocation sections omitted compiler executable linkable format elf executable format shared library format used unix-like systems allows several types relocation defined linker reads segment information relocation tables object files performs relocation following example uses donald knuth mix architecture mixal assembly language principles architecture though details change | [
1616,
6249,
4662,
1254,
4843,
7611,
8066,
7804,
4942,
1361,
4779,
126,
3870,
3635,
2403,
1198,
7096,
1857,
3210,
3214,
3557,
4889,
6380,
757,
2418,
4810,
1495,
336,
5606,
1236,
1894,
1989,
1992,
5190,
2084
] | Test |
1,340 | 4 | Locky:locky locky ransomware malware released 2016 delivered email allegedly invoice requiring payment attached microsoft word document contains malicious macros user opens document appears full garbage includes phrase enable macro data encoding incorrect social engineering technique user enable macros save run binary file downloads actual encryption trojan encrypt files match particular extensions filenames converted unique 16 letter number combination initially .locky file extension used encrypted files subsequently file extensions used including .zepto .odin .aesir .thor .zzzzz encryption message displayed user desktop instructs download tor browser visit specific criminal-operated web site information web site contain instructions demand payment 0.5 1 bitcoin november 2017 one bitcoin varies value 9,000 10,000 via bitcoin exchange since criminals possess private key remote servers controlled victims motivated pay decrypt files commonly reported mechanism infection involves receiving email microsoft word document attachment contains code document gibberish prompts user enable macros view document enabling macros opening document launch locky virus virus launched loads memory users system encrypts documents hash.locky files installs .bmp .txt files encrypt network files user access different route ransomware since uses macros attachments spread rather installed trojan using previous exploit june 22 2016 necurs released new version locky new loader component includes several detection-avoiding techniques detecting whether running within virtual machine within physical machine relocation instruction code since locky released numerous variants released used different extensions encrypted files many extensions named gods norse egyptian mythology first released extension used encrypted files .locky versions utilized .zepto .odin .shit .thor .aesir .zzzzz extensions encrypted files current version released december 2016 utilizes .osiris extension encrypted files many different distribution methods locky used since ransomware released distribution methods include exploit kits word excel attachments malicious macros docm attachments zipped js attachments general consensus among security experts protect ransomware including locky keep installed programs updated open attachments known senders locky uses rsa-2048 aes-128 cipher ecb mode encrypt files keys generated server side making manual decryption impossible locky ransomware encrypt files fixed drives removable drives network ram disk drives locky reported sent half-million users february 16 2016 period immediately attackers increased distribution millions users despite newer version google trend data indicates infections dropped around june 2016 february 18 2016 hollywood presbyterian medical center paid 17,000 ransom form bitcoins decryption key patient data hospital infected delivery email attachment disguised microsoft word invoice led increased fear knowledge ransomware general brought ransomware public spotlight appears trend ransomware used attack hospitals appears growing may 31 necurs went dormant perhaps due glitch c c server according softpedia less spam emails locky dridex attached june 22 however malwaretech discovered necurs bots consistently polled dga c c server replied digitally signed response signified necurs longer dormant cybercriminal group also started sending large quantity spam emails new improved versions locky dridex attached well new message zipped javascript code emails april 2016 dartford science technology college computers infected virus student opened infected email quickly spread encrypted many school files virus stayed computer several weeks eventually managed remove virus using system restore computers example message locky attachment following dear random name please find attached invoice services rendered additional disbursements above-mentioned matter hoping satisfaction remain sincerely random name random title | [
5452,
1482,
91,
2451,
1766,
3561,
1376,
376,
2733,
88,
744
] | Test |
1,341 | 2 | Samuel_J_Leffler:samuel j leffler samuel j leffler computer scientist known extensive work bsd 1980s freebsd present day among projects created flexfax libtiff freebsd wireless device drivers design implementation series books co-authored working computer systems research group csrg uc berkeley university california berkeley mr. leffler helped 4.1 4.2 bsd release contributed almost every aspect bsd systems including networking subsystem leaving computer systems research group mr. leffler also worked lucasfilm pixar animation studios silicon graphics alias research softimage creative environment cinetron computer systems vmware later became independent consultant system design | [
4295,
7514,
6794,
6085,
732,
738,
3636,
2583,
5760,
3986,
5065,
6477,
424,
6489,
6149,
6860,
443,
6505,
1523,
1547,
481,
2300,
1193,
4059,
8001,
6918,
6211,
4806,
4441,
5865,
6583,
8037,
875,
1254,
191,
908,
4498,
7355,
3457,
1279,
6278... | Test |
1,342 | 4 | Forward_anonymity:forward anonymity forward anonymity analogous forward secrecy computer security cryptography property prevents attacker recorded past communications discovering identities participants even fact speaking forward secrecy system designers attempt prevent attacker recorded past communications discovering contents said communications later one example system satisfies perfect forward secrecy property one compromise one key attacker consequent decryption messages encrypted key undermine security previously used keys forward secrecy refer protecting content message rather protection keys used decrypt messages one example system uses forward anonymity public key cryptography system public key well-known used encrypt message unknown private key used decrypt system one keys always said compromised messages participants still unknown anyone without corresponding private key originally introduced whitfield diffie paul van oorschot michael james wiener describe property sts station-to-station protocol involving long term secret either private key shared password public key cryptography common form forward anonymous system used pass encrypted messages preventing information message discovered message intercepted attacker uses two keys public key private key public key published used anyone encrypt plaintext message private key well known used decrypt cyphertext public key cryptography known asymmetric decryption algorithm different keys used perform opposing functions public key cryptography popular computationally easy create pair keys extremely difficult determine private key knowing public key therefore public key well known allow messages intercepted decrypted forward anonymous system one compromised key public key compromise anonymity system variation public key cryptography system web trust user public private key messages sent encrypted using intended recipient public key recipient private key decrypt message also signed senders private key creates added security becomes difficult attacker pretend user lack private key signature indicates non-trusted user forward anonymous system necessarily mean wholly secure system successful cryptanalysis message sequence messages still decode information without use private key long term secret forward anonymity along cryptography related properties received burst media attention leak classified information edward snowden beginning june 2013 indicated nsa fbi practices asking companies leave back doors allowing companies agencies decrypt information stored phones devices easily intention allowing easily find arrest various criminals occasionally mistakenly targeting innocent civilians especially publicized aid practice provided catching predatory pedophiles opponents practice argue leaving back door law enforcement increases risk attackers able decrypt information well questioning legality us constitution specifically form illegal search seizure | [
1353,
1805,
354
] | Test |
1,343 | 4 | ZmEu_(vulnerability_scanner):zmeu vulnerability scanner zmeu computer vulnerability scanner searches web servers open attack phpmyadmin program apparently named zmeu dragon-like romanian folklore | [
7214,
3652
] | Validation |
1,344 | 4 | Global_surveillance:global surveillance global surveillance refers mass surveillance entire populations across national borders roots traced back middle 20th century ukusa agreement jointly enacted united kingdom united states later expanded canada australia new zealand create present five eyes alliance alliance developed cooperation arrangements several third-party nations eventually resulted establishment global surveillance network code-named echelon 1971 existence however widely acknowledged governments mainstream media global surveillance disclosures edward snowden triggered debate right privacy digital age origins global surveillance traced back late 1940s ukusa agreement collaboratively enacted united kingdom united states eventually culminated creation global surveillance network code-named echelon 1971 aftermath 1970s watergate affair subsequent congressional inquiry led sen. frank church revealed nsa collaboration britain gchq routinely intercepted international communications prominent anti-vietnam war leaders jane fonda dr. benjamin spock decades later multi-year investigation european parliament highlighted nsa role economic espionage report entitled 'development surveillance technology risk abuse economic information 1999 however general public series detailed disclosures internal nsa documents june 2013 first revealed massive extent nsa spying foreign domestic leaked ex-contractor edward snowden even number older global surveillance programs prism xkeyscore tempora referenced 2013 release thousands documents many countries around world including western allies member states nato targeted five eyes strategic alliance australia canada new zealand uk usa—five english-speaking western countries aiming achieve total information awareness mastering internet analytical tools boundless informant confirmed nsa director keith b. alexander 26 september 2013 nsa collects stores phone records american citizens much data kept large storage facilities utah data center us 1.5 billion megaproject referred wall street journal symbol spy agency surveillance prowess 6 june 2013 britain guardian newspaper began publishing series revelations yet unknown american whistleblower revealed several days later ex-cia ex-nsa-contracted systems analyst edward snowden snowden gave cache documents two journalists glenn greenwald laura poitras greenwald later estimated cache contains 15,000 – 20,000 documents large detailed small two subsequent months publications became clear nsa operated complex web spying programs allowed intercept internet telephone conversations billion users dozens countries around world specific revelations made china european union latin america iran pakistan australia new zealand however published documentation reveals many programs indiscriminately collected bulk information directly central servers internet backbones almost invariably carry reroute information distant countries due central server backbone monitoring many programs overlapped interrelated among one another programs often carried assistance us entities united states department justice fbi sanctioned us laws fisa amendments act necessary court orders signed secret foreign intelligence surveillance court nsa programs directly aided national foreign intelligence agencies britain gchq australia dsd well large private telecommunications internet corporations verizon telstra google facebook snowden disclosures nsa surveillance activities continuation news leaks ongoing since early 2000s one year september 11 2001 attacks former u.s. intelligence official william binney publicly critical nsa spying u.s. citizens disclosures followed 16 december 2005 new york times published report headline bush lets u.s. spy callers without courts 2006 evidence nsa domestic surveillance u.s. citizens provided usa today newspaper released report 11 may 2006 regarding nsa massive database phone records collected tens millions u.s. citizens according usa today phone records provided several telecom companies verizon bellsouth 2008 security analyst babak pasdar revealed existence so-called quantico circuit team discovered 2003 brought update carrier security system circuit provided u.s. federal government backdoor network unnamed wireless provider later independently identified verizon snowden made first contact journalist glenn greenwald guardian late 2012 timeline mass surveillance disclosures snowden continued throughout entire year 2013 documents leaked snowden 2013 include court orders memos policy documents related wide range surveillance activities according april 2013 summary documents leaked snowden combat terrorism surveillance programs employed assess foreign policy economic stability countries gather commercial secrets statement addressed national congress brazil early august 2013 journalist glenn greenwald maintained u.s. government used counter-terrorism pretext clandestine surveillance order compete countries business industrial economic fields december 2013 letter brazilian government snowden wrote programs never terrorism 're economic spying social control diplomatic manipulation 're power according white house panel member nsa n't stop terrorist attack however nsa chief said surveillance programs stopped 54 terrorist plots interview der spiegel published 12 august 2013 former nsa director michael hayden admitted nsa steal secrets 're number one hayden also added steal stuff make safe make rich according documents seen news agency reuters secrets subsequently funnelled authorities across nation help launch criminal investigations americans federal agents instructed recreate investigative trail order cover information originated according congressional testimony keith b. alexander director national security agency one purposes data collection store phone records inside place searched assessed times asked senator mark udall goal nsa collect phone records americans alexander replied yes believe nation best interest put phone records lockbox could search nation needs united states nsa collecting phone records 300 million americans international surveillance tool xkeyscore allows government analysts search vast databases containing emails online chats browsing histories millions individuals britain global surveillance program tempora intercepts fibre-optic cables form backbone internet nsa prism surveillance program data already reached final destination would directly harvested servers following u.s. service providers microsoft yahoo google facebook paltalk aol skype youtube apple inc nsa uses analysis phone call e-mail logs american citizens create sophisticated graphs social connections identify associates locations certain times travelling companions personal information according top secret nsa documents leaked snowden single day 2012 nsa collected e-mail address books day nsa collects contacts estimated 500,000 buddy lists live-chat services well inbox displays web-based e-mail accounts taken together data enables nsa draw detailed maps person life based personal professional religious political connections federal agencies united states data gathered surveillance programs routinely shared u.s. federal bureau investigation fbi u.s. central intelligence agency cia addition nsa supplies domestic intercepts drug enforcement administration dea internal revenue service irs law enforcement agencies foreign countries result nsa secret treaties foreign countries data gathered surveillance programs routinely shared countries signatories ukusa agreement foreign countries also help operate several nsa programs xkeyscore see international cooperation special branch nsa called follow money ftm monitors international payments banking credit card transactions later stores collected data nsa financial databank tracfin mobile phone tracking refers act attaining position coordinates mobile phone according washington post nsa tracking locations mobile phones world tapping cables connect mobile networks globally serve u.s. cellphones well foreign ones process nsa collects 5 billion records phone locations daily basis enables nsa analysts map cellphone owners relationships correlating patterns movement time thousands millions phone users cross paths order decode private conversations nsa cracked commonly used cellphone encryption technology a5/1 according classified document leaked snowden agency process encrypted a5/1 even acquired encryption key addition nsa uses various types cellphone infrastructure links carrier networks determine location cellphone user tracked visitor location registers worldwide sales smartphones grew rapidly nsa decided take advantage smartphone boom particularly advantageous smartphone contains variety data sets would interest intelligence agency social contacts user behaviour interests location photos credit card numbers passwords according documents leaked snowden nsa set task forces assigned several smartphone manufacturers operating systems including apple inc. iphone ios operating system well google android mobile operating system similarly britain gchq assigned team study crack blackberry addition smaller nsa programs known scripts perform surveillance 38 different features ios 3 ios 4 operating systems include mapping feature voicemail photos well google earth facebook yahoo messenger contrast prism surveillance program front-door method access nominally approved fisa court muscular surveillance program noted unusually aggressive usage unorthodox hacking methods infiltrate yahoo google data centres around world program operated overseas united kingdom nsa presumes anyone using foreign data link foreigner therefore able collect content metadata previously unknown scale u.s. citizens residents according documents leaked snowden muscular surveillance program jointly operated nsa britain gchq agency see international cooperation five eyes made repeated attempts spy internet users communicating secret via anonymity network tor several clandestine operations involve implantation malicious code computers anonymous tor users visit infected websites cases nsa gchq succeeded blocking access anonymous network diverting tor users insecure channels cases nsa gchq able uncover identity anonymous users royal concierge surveillance program britain gchq agency uses automated monitoring system infiltrate reservation systems least 350 luxury hotels many different parts world related surveillance programs involve wiretapping room telephones fax machines used targeted hotels well monitoring computers hooked hotel network u.s. national security agency nsa u.s. central intelligence agency cia britain government communications headquarters gchq conducting surveillance networks many online games including massively multiplayer online role-playing games mmorpgs world warcraft well virtual worlds second life xbox gaming console according april 2013 summary disclosures nsa defined intelligence priorities scale 1 highest interest 5 lowest interest classified 30 countries 3rd parties cooperates also spies prominent targets included members adherents internet group known anonymous well potential whistleblowers according snowden nsa targeted reporters wrote critically government 9/11 part joint operation central intelligence agency cia nsa deployed secret eavesdropping posts eighty u.s. embassies consulates worldwide headquarters nato also used nsa experts spy european union 2013 documents provided edward snowden revealed following intergovernmental organizations diplomatic missions government ministries subjected surveillance five eyes world war ii brusa agreement signed governments united states united kingdom purpose intelligence sharing later formalized ukusa agreement 1946 secret treaty full text agreement released public 25 june 2010 although treaty later revised include countries denmark germany ireland norway turkey philippines information sharing performed so-called five eyes term referring following english-speaking western democracies respective intelligence agencies left sea-me-we 3 runs across afro-eurasian supercontinent japan northern germany one important submarine cables accessed five eyes singapore former british colony asia-pacific region blue dot plays vital role intercepting internet telecommunications traffic heading australia/japan europe vice versa intelligence-sharing agreement singapore australia allows rest five eyes gain access sea-me-we 3 right tat-14 telecommunications cable linking europe united states identified one assets critical infrastructure key resources usa foreign territory 2013 revealed british officials pressured handful telecommunications internet companies allow british government gain access tat-14 according leaked documents aside five eyes western countries also participated nsa surveillance system sharing information documents nsa lists approved sigint partners partner countries addition five eyes glenn greenwald said nsa often maintains partnerships paying partner develop certain technologies engage surveillance thus direct spying carried partner countries divided two groups second parties third parties second parties comprehensive cooperation nsa third parties focused cooperation however partner nsa automatically exempt country targeted nsa according internal nsa document leaked snowden nsa often target signals 3rd party foreign partners australian signals directorate asd formerly known defence signals directorate dsd shares information australian citizens members ukusa agreement according 2008 five eyes document leaked snowden data australian citizens shared foreign countries include bulk unselected unminimised metadata well medical legal religious information close cooperation members five eyes community asd runs secret surveillance facilities many parts southeast asia without knowledge australian diplomats addition asd cooperates security intelligence division sid republic singapore international operation intercept underwater telecommunications cables across eastern hemisphere pacific ocean march 2017 reported advice five eyes intelligence alliance 500 iraqi syrian refugees refused entry australia last year communications security establishment canada csec offers nsa resources advanced collection processing analysis set covert sites request nsa us-canada signt relationship dates back secret alliance formed world war ii formalized 1949 canusa agreement behalf nsa csec opened secret surveillance facilities 20 countries around world well communications security establishment canada revealed following global surveillance disclosures engaging surveillance wifi hotspots major canadian airports collecting meta-data use engaging surveillance travelers even days departure said airports politiets efterretningstjeneste pet denmark domestic intelligence agency exchanges data nsa regular basis part secret agreement united states one 9-eyes ukusa agreement denmark relationship nsa closer nsa relationship germany sweden spain belgium italy directorate-general external security dgse france maintains close relationship nsa gchq discussions increased cooperation began november 2006 early 2010s extent cooperation joint interception digital data dgse nsa noted increased dramatically 2011 formal memorandum data exchange signed dgse nsa facilitated transfer millions metadata records dgse nsa december 2012 8 january 2013 70 million metadata records handed nsa french intelligence agencies bundesnachrichtendienst bnd germany systematically transfers metadata german intelligence sources nsa december 2012 alone bnd provided nsa 500 million metadata records nsa granted bundesnachrichtendienst access x-keyscore exchange german surveillance programs mira4 veras early 2013 hans-georg maaßen president german domestic security agency bundesamt für verfassungsschutz bfv made several visits headquarters nsa according classified documents german government maaßen agreed transfer data records persons monitored germany bfv via xkeyscore nsa addition bfv works closely eight u.s. government agencies including cia project 6 jointly operated cia bfv bnd massive database containing personal information photos license plate numbers internet search histories telephone metadata developed gain better understanding social relationships presumed jihadists 2012 bfv handed 864 data sets personal information cia nsa seven u.s. intelligence agencies exchange bnd received data u.s. intelligence agencies 1,830 occasions newly acquired data handed bfv stored domestically accessible system known nadis wn israeli sigint national unit isnu routinely receives raw unfiltered data u.s. citizens nsa however secret nsa document leaked snowden revealed u.s. government officials explicitly exempted forms data sharing isnu stated memorandum detailing rules data sharing u.s. citizens isnu obligated according undated memorandum ground rules intelligence sharing nsa isnu laid march 2009 data sharing agreement isnu allowed retain identities u.s. citizens excluding u.s. government officials year 2011 nsa asked japanese government intercept underwater fibre-optic cables carrying phone internet data asia-pacific region however japanese government refused comply reign muammar gaddafi libyan regime forged partnership britain secret service mi6 u.s. central intelligence agency cia obtain information libyan dissidents living united states canada exchange gaddafi allowed western democracies use libya base extraordinary renditions algemene inlichtingen en veiligheidsdienst aivd netherlands receiving storing data internet users gathered u.s. intelligence sources nsa prism surveillance program meeting february 2013 aivd mivd briefed nsa attempts hack internet forums collect data users using technology known computer network exploitation cne norwegian intelligence service nis confirmed data collected agency shared americans kjell grandhagen head norwegian military intelligence told reporters news conference share information partners partners share us ... talking huge amounts traffic data cooperation nsa nis gained access russian targets kola peninsula civilian targets general nis provides information nsa politicians energy armament top secret memo nsa lists following years milestones norway-united states america signt agreement norus agreement nsa perceives nis one reliable partners agencies also cooperate crack encryption systems mutual targets according nsa norway made objections requests defence ministry singapore security intelligence division sid secretly intercepting much fibre optic cable traffic passing asian continent close cooperation australian signals directorate asd/dsd singapore sid able intercept sea-me-we 3 southeast asia-middle east-western europe 3 well sea-me-we 4 telecommunications cables access international telecommunications channels facilitated singapore government-owned operator singtel temasek holdings multibillion-dollar sovereign wealth fund majority stake singtel maintained close relations country intelligence agencies information gathered government singapore transferred government australia part intelligence sharing agreement allows five eyes maintain stranglehold communications across eastern hemisphere close cooperation centro nacional de inteligencia cni nsa intercepted 60.5 million phone calls spain single month försvarets radioanstalt fra sweden codenamed sardines allowed five eyes access underwater cables baltic sea 5 december 2013 sveriges television swedish television revealed fra conducting clandestine surveillance operation targeting internal politics russia operation conducted behalf nsa receives data handed fra according documents leaked snowden fra sweden granted access nsa international surveillance program xkeyscore federal intelligence service ndb switzerland exchanges information nsa regularly basis secret agreement circumvent domestic surveillance restrictions addition nsa granted access swiss surveillance facilities leuk canton valais herrenschwanden canton bern part swiss surveillance program onyx according ndb agency maintains working relationships 100 international organizations however ndb denied form cooperation nsa although nsa direct access switzerland onyx surveillance program director ndb acknowledged possible u.s. intelligence agencies gain access switzerland surveillance system british government allowed nsa store personal data british citizens project minaret anti-vietnam war dissidents united states jointly targeted gchq nsa cia pays us 10 million year gain access international phone records including u.s. citizens nsa foreign affairs directorate interacts foreign intelligence services members five eyes implement global surveillance fbi acts liaison u.s. intelligence agencies silicon valley giants microsoft early 2010s dhs conducted joint surveillance operation fbi crack dissidents occupy wall street protest movement nsa supplies domestic intercepts drug enforcement administration dea internal revenue service irs law enforcement agencies use intercepted data initiate criminal investigations us citizens federal agents instructed recreate investigative trail order cover information originated weeks september 11 attacks u.s. president george w. bush signed patriot act ensure disruption government ability conduct global surveillance patriot act extended u.s. president barack obama may 2011 extend federal government legal authority conduct additional forms surveillance roving wiretaps 70 percent united states intelligence community budget earmarked payment private firms according forbes magazine defense technology company lockheed martin currently usa biggest defense contractor destined nsa powerful commercial partner biggest contractor terms dollar revenue joint operation nsa american telecommunications corporation operates room 641a sbc communications building san francisco spy internet traffic cia pays us 10 million year gain access international phone records including u.s. citizens projects developed booz allen hamilton include strategic innovation group identify terrorists social media behalf government agencies fiscal year 2013 booz allen hamilton derived 99 income government largest portion revenue coming u.s. army 2013 booz allen hamilton hailed bloomberg businessweek world profitable spy organization british telecommunications code-named remedy major supplier telecommunications granted britain intelligence agency gchq unlimited access network undersea cables according documents leaked snowden american multinational corporation microsoft helped nsa circumvent software encryption safeguards also allowed federal government monitor web chats outlook.com portal 2013 microsoft worked fbi allow nsa gain access company cloud storage service skydrive french telecommunications corporation orange s.a. shares customer call data french intelligence agency dgse intercepted data handed gchq rsa security paid us 10 million nsa introduce cryptographic backdoor encryption products strategic forecasting inc. commonly known stratfor global intelligence company offering information governments private clients including dow chemical company lockheed martin northrop grumman raytheon u.s. department homeland security u.s. defense intelligence agency u.s. marine corps british telecommunications company vodafone code-named gerontic granted britain intelligence agency gchq unlimited access network undersea cables according documents leaked snowden in-q-tel receives us 56 million year government support venture capital firm enables cia invest silicon valley palantir technologies data mining corporation close ties fbi nsa cia based palo alto california company developed data collection analytical program known prism 2011 revealed company conducted surveillance glenn greenwald several countries evaded global surveillance constructing secret bunker facilities deep earth surface despite north korea priority target nsa internal documents acknowledged know much kim jong un regime intentions october 2012 iran police chief esmail ahmadi moghaddam alleged google search engine spying tool western intelligence agencies six months later april 2013 country announced plans introduce islamic google earth evade global surveillance libya evaded surveillance building hardened buried bunkers least 40 feet ground level global surveillance disclosure caused tension bilateral relations united states several allies economic partners well relationship european union 12 august 2013 president obama announced creation independent panel outside experts review nsa surveillance programs panel due established director national intelligence james r. clapper consult provide assistance according survey undertaken human rights group pen international disclosures chilling effect american writers fearing risk targeted government surveillance 28 pen american members curbed usage social media 16 self-censored avoiding controversial topics writings | [
1998,
6788,
1344,
2548,
803,
2637,
2727,
1353,
6419,
6974,
7346,
6092,
1544,
820,
6438,
1278,
7646,
740,
3639,
5412,
147,
5509,
6756,
5689,
2343,
1505,
74,
2794,
3241,
4014
] | Validation |
1,345 | 9 | Comparison_of_programming_languages_(list_comprehension):comparison programming languages list comprehension list comprehension syntactic construct available programming languages creating list based existing lists follows form mathematical set-builder notation set comprehension distinct use map filter functions list doubles 0 10 exclusive list names customers based rio de janeiro previous code syntactic sugar following code written using lambda expressions filtering numbers divisible 3 multiple generators infinite lazy sequence list comprehension using multiple generators list comprehensions expressed codice_1 macro codice_2 keyword conditionals expressed codice_3 follows list names customers list customers balances list names customers balances general forms note putting condition expression variable name enumerable object editors ides provide autocompletion members variable lazily-evaluated sequences floating point values lists arrays list comprehensions part greater family language constructs called computation expressions example list comprehension using multiple generators using range object io language create list easy languages list comprehensions expressed codice_4 special form conditionals expressed codice_3 follows java 8 introduces new streams api includes intstream interface allows operations like following julia supports comprehensions using syntax multidimensional comprehensions like 2*i 1..100 i*i 3 multiple generators ocaml supports list comprehension ocaml batteries 2 ** 2 3 0 .. 99 python uses following syntax express list comprehensions finite lists generator expression may used python versions 2.4 gives lazy evaluation input used generators iterate 'infinite input count generator function returns successive integers subsequent use generator expression determine stop generating values example multiple generators using for-comprehension list comprehensions supported scheme use srfi-42 library example list comprehension using multiple generators 2*x || x list :getmember_nd l x*x 3 short-hand notation | [
2451,
4573,
1445,
4302,
6882,
7333,
109,
6428,
2740,
4053,
6277,
831,
2661,
7005,
7460,
4705,
666,
7277,
4070,
1114,
4164,
5855,
7844,
5506,
3898,
5510,
2871,
7394,
8122,
7032,
2881,
8032,
1889,
5965,
2619
] | Test |
1,346 | 3 | IBM_Blue_Gene:ibm blue gene blue gene ibm project aimed designing supercomputers reach operating speeds petaflops pflops range low power consumption project created three generations supercomputers blue gene/l blue gene/p blue gene/q blue gene systems often led top500 green500 rankings powerful power efficient supercomputers respectively blue gene systems also consistently scored top positions graph500 list project awarded 2009 national medal technology innovation 2015 ibm seems ended development blue gene family though public announcement made ibm continuing efforts supercomputer scene seems concentrated around openpower using accelerators fpgas gpus battle end moore law december 1999 ibm announced us 100 million research initiative five-year effort build massively parallel computer applied study biomolecular phenomena protein folding project two main goals advance understanding mechanisms behind protein folding via large-scale simulation explore novel ideas massively parallel machine architecture software major areas investigation included use novel platform effectively meet scientific goals make massively parallel machines usable achieve performance targets reasonable cost novel machine architectures initial design blue gene based early version cyclops64 architecture designed monty denneau initial research development work pursued ibm t.j. watson research center led william r. pulleyblank ibm alan gara started working extension qcdoc architecture general-purpose supercomputer 4d nearest-neighbor interconnection network replaced network supporting routing messages node parallel i/o subsystem added doe started funding development system became known blue gene/l l light development original blue gene system continued name blue gene/c c cyclops later cyclops64 november 2004 16-rack system rack holding 1,024 compute nodes achieved first place top500 list linpack performance 70.72 tflops thereby overtook nec earth simulator held title fastest computer world since 2002 2004 2007 blue gene/l installation llnl gradually expanded 104 racks achieving 478 tflops linpack 596 tflops peak llnl bluegene/l installation held first position top500 list 3.5 years june 2008 overtaken ibm cell-based roadrunner system los alamos national laboratory first system surpass 1 petaflops mark system built rochester mn ibm plant llnl installation largest blue gene/l installation many smaller installations followed november 2006 27 computers top500 list using blue gene/l architecture computers listed architecture eserver blue gene solution example three racks blue gene/l housed san diego supercomputer center top500 measures performance single benchmark application linpack blue gene/l also set records performance wider set applications blue gene/l first supercomputer ever run 100 tflops sustained real-world application namely three-dimensional molecular dynamics code ddcmd simulating solidification nucleation growth processes molten metal high pressure temperature conditions achievement 2005 gordon bell prize june 2006 nnsa ibm announced blue gene/l achieved 207.3 tflops quantum chemical application qbox supercomputing 2006 blue gene/l awarded winning prize hpc challenge classes awards 2007 team ibm almaden research center university nevada ran artificial neural network almost half complex brain mouse equivalent second network run 1/10 normal speed 10 seconds name blue gene comes originally designed help biologists understand processes protein folding gene development blue traditional moniker ibm uses many products company original blue gene design renamed blue gene/c eventually cyclops64 l blue gene/l comes light design original name blue light p version designed petascale design q letter p blue gene/r blue gene/l supercomputer unique following aspects blue gene/l architecture evolution qcdsp qcdoc architectures blue gene/l compute i/o node single asic associated dram memory chips asic integrated two 700 mhz powerpc 440 embedded processors double-pipeline-double-precision floating point unit fpu cache sub-system built-in dram controller logic support multiple communication sub-systems dual fpus gave blue gene/l node theoretical peak performance 5.6 gflops gigaflops two cpus cache coherent one another compute nodes packaged two per compute card 16 compute cards plus 2 i/o nodes per node board 32 node boards per cabinet/rack integration essential sub-systems single chip use low-power logic compute i/o node dissipated low power 17 watts including drams allowed aggressive packaging 1024 compute nodes plus additional i/o nodes standard 19-inch rack within reasonable limits electrical power supply air cooling performance metrics terms flops per watt flops per floorspace flops per unit cost allowed scaling high performance many nodes component failures inevitable system able electrically isolate faulty components granularity half rack 512 compute nodes allow machine continue run blue gene/l node attached three parallel communications networks 3d toroidal network peer-to-peer communication compute nodes collective network collective communication broadcasts reduce operations global interrupt network fast barriers i/o nodes run linux operating system provided communication storage external hosts via ethernet network i/o nodes handled filesystem operations behalf compute nodes finally separate private ethernet network provided access node configuration booting diagnostics allow multiple programs run concurrently blue gene/l system could partitioned electronically isolated sets nodes number nodes partition positive integer power 2 least 2 32 nodes run program blue gene/l partition computer first reserved program loaded run nodes within partition program could access nodes within partition use upon completion partition nodes released future programs use blue gene/l compute nodes used minimal operating system supporting single user program subset posix calls supported one process could run time node co-processor mode—or one process per cpu virtual mode programmers needed implement green threads order simulate local concurrency application development usually performed c c++ fortran using mpi communication however scripting languages ruby python ported compute nodes june 2007 ibm unveiled blue gene/p second generation blue gene series supercomputers designed collaboration included ibm llnl argonne national laboratory leadership computing facility design blue gene/p technology evolution blue gene/l blue gene/p compute chip contains four powerpc 450 processor cores running 850 mhz cores cache coherent chip operate 4-way symmetric multiprocessor smp memory subsystem chip consists small private l2 caches central shared 8 mb l3 cache dual ddr2 memory controllers chip also integrates logic node-to-node communication using network topologies blue gene/l twice bandwidth compute card contains blue gene/p chip 2 4 gb dram comprising compute node single compute node peak performance 13.6 gflops 32 compute cards plugged air-cooled node board rack contains 32 node boards thus 1024 nodes 4096 processor cores using many small low-power densely packaged chips blue gene/p exceeded power efficiency supercomputers generation 371 mflops/w blue gene/p installations ranked near top green500 lists 2007-2008 following incomplete list blue gene/p installations per november 2009 top500 list contained 15 blue gene/p installations 2-racks 2048 nodes 8192 processor cores 23.86 tflops linpack larger third supercomputer design blue gene series blue gene/q peak performance 20 petaflops reaching linpack benchmarks performance 17 petaflops blue gene/q continues expand enhance blue gene/l /p architectures blue gene/q compute chip 18 core chip 64-bit a2 processor cores 4-way simultaneously multithreaded run 1.6 ghz processor core simd quad-vector double precision floating point unit ibm qpx 16 processor cores used computing 17th core operating system assist functions interrupts asynchronous i/o mpi pacing ras 18th core used redundant spare used increase manufacturing yield spared-out core shut functional operation processor cores linked crossbar switch 32 mb edram l2 cache operating half core speed l2 cache multi-versioned supporting transactional memory speculative execution hardware support atomic operations l2 cache misses handled two built-in ddr3 memory controllers running 1.33 ghz chip also integrates logic chip-to-chip communications 5d torus configuration 2gb/s chip-to-chip links blue gene/q chip manufactured ibm copper soi process 45 nm delivers peak performance 204.8 gflops 1.6 ghz drawing 55 watts chip measures 19×19 mm 359.5 mm² comprises 1.47 billion transistors chip mounted compute card along 16 gb ddr3 dram i.e. 1 gb user processor core q32 compute drawer contains 32 compute cards water cooled midplane crate contains 16 q32 compute drawers total 512 compute nodes electrically interconnected 5d torus configuration 4x4x4x4x2 beyond midplane level connections optical racks two midplanes thus 32 compute drawers total 1024 compute nodes 16,384 user cores 16 tb ram separate i/o drawers placed top rack separate rack air cooled contain 8 compute cards 8 pcie expansion slots infiniband 10 gigabit ethernet networking time blue gene/q system announcement november 2011 initial 4-rack blue gene/q system 4096 nodes 65536 user processor cores achieved 17 top500 list 677.1 teraflops linpack outperforming original 2007 104-rack bluegene/l installation described 4-rack system achieved top position graph500 list 250 gteps giga traversed edges per second blue gene/q systems also topped green500 list energy efficient supercomputers 2.1 gflops/w june 2012 blue gene/q installations took top positions three lists top500 graph500 green500 following incomplete list blue gene/q installations per june 2012 top500 list contained 20 blue gene/q installations 1/2-rack 512 nodes 8192 processor cores 86.35 tflops linpack larger size-independent power efficiency 2.1 gflops/w systems also populated top june 2012 green 500 list record-breaking science applications run bg/q first cross 10 petaflops sustained performance cosmology simulation framework hacc achieved almost 14 petaflops 3.6 trillion particle benchmark run cardioid code models electrophysiology human heart achieved nearly 12 petaflops near real-time simulation sequoia fully compressible flow solver also achieved 14.4 pflop/s originally 11 pflop/s sequoia 72 machine nominal peak performance | [
6597,
7327,
2719,
3348,
4661,
3936,
1075,
8163,
802,
2458,
3440,
7428,
3521,
1083,
6428,
4408,
5652,
912,
1006,
3015,
5571,
2845,
3708,
5042,
7361,
578,
5665,
4702,
1199,
1386,
1388,
7010,
7099,
1023,
4168,
234,
2501,
239,
1494,
6474,
1... | Test |
1,347 | 4 | Holistic_Information_Security_Practitioner:holistic information security practitioner holistic information security practitioner certification course integration course provides practical education integration best practices information security management information systems auditing multiple regulatory compliance requirements well map multiple regulatory requirements internationally accepted framework iso/iec 27002 class introduces iso/iec 27002:2013 cobit coso itil explains methodology map regulations data protection act 1998 uk eu directive privacy basel ii hipaa u.s. federal financial institutions examination council glb act fips 200 sarbanes-oxley fact act pci data security california sb 1386 osfi pipeda pipa canadian bill c-168 iso 27002 framework holistic information security practitioner hisp certification course originally authored efortresses inc. atlanta georgia-based cyber security governance risk management compliance solutions company specializing information security regulatory compliance training aspect hisp certification course delivered efortresses number authorized training partners including bsi management systems currently training certification aspect managed exclusively holistic information security practitioner institute independently run organization holistic information security practitioner institute also oversight body cloud assurance assessor program caap caap provides assurance qualifications purporting necessary skills independent cloud assessors | [
3609
] | Test |
1,348 | 9 | Benjamin_C._Pierce:benjamin c. pierce benjamin crawford pierce henry salvatori professor computer science university pennsylvania pierce joined penn 1998 indiana university held research positions university cambridge university edinburgh received ph.d. carnegie mellon university 1991 research includes work programming languages static type systems distributed programming mobile agents process calculi part research pierce led development several open-source software projects including unison file synchronization utility author one book type systems types programming languages also edited collection articles create second volume advanced topics types programming languages based notes collected learning category theory phd also published introductory book topic— basic category theory computer scientists one authors freely available book software foundations | [
5801,
7152,
5224,
260,
3895,
5397,
1243,
6911,
7005,
3225
] | Test |
1,349 | 8 | Monkey_HTTP_Server:monkey http server monkey http server optimized web server linux designed achieve high performance high loads making linux kernel terms specific system calls optimization techniques http/1.1 compliant rfc 2616 supports common features ipv6 tls virtual hosts cgi fastcgi directory listing security rules server designed small core extensible plugin interface binary size monkey around 100 kb around 250 kb runtime depending loaded plugins monkey perform well x86 x86-64 arm architectures running linux embedded variants monkey started 2001 open source project currently licensed apache license v2 monkey community well established available mailing list freenode irc channel monkey | [
3168,
5369,
5206,
5820,
5214,
2646,
6270,
1834,
2291,
4496,
8182,
6536,
26,
5571,
7544,
7988,
578,
4701,
1392,
7786,
417,
3135,
2506,
1686,
3408,
1602,
352,
6061,
7411,
7952,
1435,
2807
] | Test |
1,350 | 1 | National_Security_Database:national security database national security database official accreditation program india awarded information security experts deemed credible trustworthy proven skills protect national critical infrastructure economy country program developed 'information sharing analysis center isac jointly support government india multiple speciality domains information security professionals apply empanelment database clearing technical lab examination psychometric test program award certification provides credible recognition form empanelment database specific security domain project conceived 2008 mumbai attacks protect national critical infrastructure cyber space india program founded rajshekhar murthy non-profit section 25 company 'information sharing analysis center support highly specialised technical intelligence agency ntro government india earlier program announced pilot international malware conference malcon 2010 mumbai indian government officials reportedly asked indian hackers learn chinese program released 26 november date 2008 mumbai attacks international malware conference malcon jw marriott mumbai program inaugurated shri sachin pilot minister state ministry communications information technology empanelment database applied indian citizens limited access available industry benefit list credible experts however major part database access restricted supporting indian government organisations 'the program largely believed identify professional ethical hackers security experts government india protect critical infrastructure cyber space minister kapil sibal reportedly expressed need community ethical hackers alok vijayant director information dominance group national technical research organisation nation ’ chief technical intelligence monitoring authority quoted interview india top weekly magazine outlook nsd “ trivialised ” describing group hackers “ supported government industry nsd good initiative since provide readymade database credible security professionals information security domain individuals skills companies tend regularly move one firm another nsd officially endorsed multiple indian government organisations cert-in ntro stated national objectives recognition foundation declared support work done collaboration open supporting organisations need access database formal mou body various organisations actively participating supporting national security database notable organisations voluntary representations governing nsd advisory panel national level include honeynet india chapter microsoft india country oldest security conference clubhack national security database program following speciality domains professionals apply empanelment quote outlook magazine director isac rajshekhar murthy stated necessary people competent also high degree trustworthiness integrity selection process involve examination references technical skills criminal history even psychological assessment generate credit report security clearance. ” national security database academy national security database certification ethical hacking penetration testing kali | [
4521
] | Test |
1,351 | 2 | Alexandre_Oliva:alexandre oliva alexandre alex oliva brazilian free software activist developer founding member free software foundation latin america fsfla currently on-hold phd studies institute computing state university campinas brazil whilst working compiler engineer red hat contributing gcc compiler maintainer linux-libre fork linux kernel removes non-free software components binary blobs kernel linux-libre kernels used linux distributions gnewsense trisquel blag recommended free software foundation gnu project 2008 oliva translated produced porco e caixa brazilian portuguese translation pig box creative commons-licensed book teaches perils drm children 10,000 copies eventually printed fisl conference porto alegre brazil official gnu free software speaker | [
707,
3938,
1822,
2559,
5757,
7559,
3981,
5759,
412,
761,
2599,
7587,
5787,
2260,
4020,
1523,
2985,
6876,
462,
4401,
5829,
1192,
1563,
4070,
4435,
2689,
3404,
5515,
2698,
6586,
3084,
1637,
6981,
3780,
4872,
578,
7740,
589,
3133,
6674,
96... | Test |
1,352 | 6 | KGB_Archiver:kgb archiver kgb archiver discontinued file archiver data compression utility employs paq6 compression algorithm written visual c++ tomasz pawlak kgb archiver designed achieve high compression ratio ten levels compression weak maximum however higher compression levels time required compress file increases significantly consequence program uses memory cpu intensively kgb archiver free open-source released terms gnu general public license version 2 beta 2 available microsoft windows command-line version kgb archiver 1.0 available unix-like operating systems minimum requirements running kgb archiver | [
4213,
1254,
7058,
985,
4759,
6992,
1471,
5571,
658,
4700,
7555,
1955,
7746,
3032,
2589,
7201,
7387,
3219,
510,
8126,
1127,
2334,
6940,
4732,
5256,
7584,
3152,
169,
1139,
5349,
4461,
2897,
619
] | Test |
1,353 | 4 | Cryptanalysis:cryptanalysis cryptanalysis greek kryptós hidden analýein loosen untie study analyzing information systems order study hidden aspects systems cryptanalysis used breach cryptographic security systems gain access contents encrypted messages even cryptographic key unknown addition mathematical analysis cryptographic algorithms cryptanalysis includes study side-channel attacks target weaknesses cryptographic algorithms instead exploit weaknesses implementation even though goal methods techniques cryptanalysis changed drastically history cryptography adapting increasing cryptographic complexity ranging pen-and-paper methods past machines like british bombes colossus computers bletchley park world war ii mathematically advanced computerized schemes present methods breaking modern cryptosystems often involve solving carefully constructed problems pure mathematics best-known integer factorization given encrypted data ciphertext goal cryptanalyst gain much information possible original unencrypted data plaintext useful consider two aspects achieving first breaking system — discovering encipherment process works second solving key unique particular encrypted message group messages attacks classified based type information attacker available basic starting point normally assumed purposes analysis general algorithm known shannon maxim enemy knows system — turn equivalent kerckhoffs principle reasonable assumption practice — throughout history countless examples secret algorithms falling wider knowledge variously espionage betrayal reverse engineering occasion ciphers broken pure deduction example german lorenz cipher japanese purple code variety classical schemes attacks also characterised resources require resources include sometimes difficult predict quantities precisely especially attack n't practical actually implement testing academic cryptanalysts tend provide least estimated order magnitude attacks difficulty saying example sha-1 collisions 2 bruce schneier notes even computationally impractical attacks considered breaks breaking cipher simply means finding weakness cipher exploited complexity less brute force never mind brute-force might require 2 encryptions attack requiring 2 encryptions would considered break ... simply put break certificational weakness evidence cipher perform advertised results cryptanalysis also vary usefulness example cryptographer lars knudsen 1998 classified various types attack block ciphers according amount quality secret information discovered academic attacks often weakened versions cryptosystem block cipher hash function rounds removed many attacks become exponentially difficult execute rounds added cryptosystem possible full cryptosystem strong even though reduced-round variants weak nonetheless partial breaks come close breaking original cryptosystem may mean full break follow successful attacks des md5 sha-1 preceded attacks weakened versions academic cryptography weakness break scheme usually defined quite conservatively might require impractical amounts time memory known plaintexts also might require attacker able things many real-world attackers ca n't example attacker may need choose particular plaintexts encrypted even ask plaintexts encrypted using several keys related secret key furthermore might reveal small amount information enough prove cryptosystem imperfect little useful real-world attackers finally attack might apply weakened version cryptographic tools like reduced-round block cipher step towards breaking full system cryptanalysis coevolved together cryptography contest traced history cryptography—new ciphers designed replace old broken designs new cryptanalytic techniques invented crack improved schemes practice viewed two sides coin secure cryptography requires design possible cryptanalysis successful cryptanalysis undoubtedly influenced history ability read presumed-secret thoughts plans others decisive advantage example england 1587 mary queen scots tried executed treason result involvement three plots assassinate elizabeth england plans came light coded correspondence fellow conspirators deciphered thomas phelippes world war breaking zimmermann telegram instrumental bringing united states war world war ii allies benefitted enormously joint success cryptanalysis german ciphers — including enigma machine lorenz cipher — japanese ciphers particularly 'purple jn-25 'ultra intelligence credited everything shortening end european war two years determining eventual result war pacific similarly helped 'magic intelligence governments long recognized potential benefits cryptanalysis intelligence military diplomatic established dedicated organizations devoted breaking codes ciphers nations example gchq nsa organizations still active today 2004 reported united states broken iranian ciphers unknown however whether pure cryptanalysis whether factors involved although actual word cryptanalysis relatively recent coined william friedman 1920 methods breaking codes ciphers much older first known recorded explanation cryptanalysis given 9th-century arab polymath al-kindi also known alkindus europe manuscript deciphering cryptographic messages treatise includes description method frequency analysis ibrahim al-kadi 1992- ref-3 italian scholar giambattista della porta author seminal work cryptanalysis de furtivis literarum notis frequency analysis basic tool breaking classical ciphers natural languages certain letters alphabet appear often others english e likely common letter sample plaintext similarly digraph th likely pair letters english frequency analysis relies cipher failing hide statistics example simple substitution cipher letter simply replaced another frequent letter ciphertext would likely candidate e frequency analysis cipher therefore relatively easy provided ciphertext long enough give reasonably representative count letters alphabet contains europe 15th 16th centuries idea polyalphabetic substitution cipher developed among others french diplomat blaise de vigenère 1523–96 three centuries vigenère cipher uses repeating key select different encryption alphabets rotation considered completely secure le chiffre indéchiffrable — indecipherable cipher nevertheless charles babbage 1791–1871 later independently friedrich kasiski 1805–81 succeeded breaking cipher world war inventors several countries developed rotor cipher machines arthur scherbius enigma attempt minimise repetition exploited break vigenère system cryptanalysis enemy messages played significant part allied victory world war ii f. w. winterbotham quoted western supreme allied commander dwight d. eisenhower war end describing ultra intelligence decisive allied victory sir harry hinsley official historian british intelligence world war ii made similar assessment ultra saying shortened war less two years probably four years moreover said absence ultra uncertain war would ended practice frequency analysis relies much linguistic knowledge statistics ciphers became complex mathematics became important cryptanalysis change particularly evident world war ii efforts crack axis ciphers required new levels mathematical sophistication moreover automation first applied cryptanalysis era polish bomba device british bombe use punched card equipment colossus computers — first electronic digital computers controlled program reciprocal machine ciphers lorenz cipher enigma machine used nazi germany world war ii message key usually transmitting operator informed receiving operator message key transmitting plaintext and/or ciphertext enciphered message termed indicator indicates receiving operator set machine decipher message poorly designed implemented indicator systems allowed first polish cryptographers british cryptographers bletchley park break enigma cipher system similar poor indicator systems allowed british identify depths led diagnosis lorenz sz40/42 cipher system comprehensive breaking messages without cryptanalysts seeing cipher machine sending two messages key insecure process cryptanalyst messages said depth may detected messages indicator sending operator informs receiving operator key generator initial settings message generally cryptanalyst may benefit lining identical enciphering operations among set messages example vernam cipher enciphers bit-for-bit combining plaintext long key using exclusive operator also known modulo-2 addition symbolized ⊕ deciphering combines key bits ciphertext reconstruct plaintext modulo-2 arithmetic addition subtraction two ciphertexts aligned depth combining eliminates common key leaving combination two plaintexts individual plaintexts worked linguistically trying probable words phrases also known cribs various locations correct guess combined merged plaintext stream produces intelligible text plaintext component recovered fragment second plaintext often extended one directions extra characters combined merged plaintext stream extend first plaintext working back forth two plaintexts using intelligibility criterion check guesses analyst may recover much original plaintexts two plaintexts depth analyst may know one corresponds ciphertext practice large problem recovered plaintext combined ciphertext key revealed knowledge key course allows analyst read messages encrypted key knowledge set related keys may allow cryptanalysts diagnose system used constructing even though computation used great effect cryptanalysis lorenz cipher systems world war ii also made possible new methods cryptography orders magnitude complex ever taken whole modern cryptography become much impervious cryptanalysis pen-and-paper systems past seems upper hand pure cryptanalysis historian david kahn notes kahn goes mention increased opportunities interception bugging side channel attacks quantum computers replacements traditional means cryptanalysis 2010 former nsa technical director brian snow said academic government cryptographers moving slowly forward mature field however postmortems cryptanalysis may premature effectiveness cryptanalytic methods employed intelligence agencies remains unknown many serious attacks academic practical cryptographic primitives published modern era computer cryptography thus best modern ciphers may far resistant cryptanalysis enigma cryptanalysis broader field information security remain quite active asymmetric cryptography public key cryptography cryptography relies using two mathematically related keys one private one public ciphers invariably rely hard mathematical problems basis security obvious point attack develop methods solving problem security two-key cryptography depends mathematical questions way single-key cryptography generally conversely links cryptanalysis wider mathematical research new way asymmetric schemes designed around conjectured difficulty solving various mathematical problems improved algorithm found solve problem system weakened example security diffie–hellman key exchange scheme depends difficulty calculating discrete logarithm 1983 coppersmith found faster way find discrete logarithms certain groups thereby requiring cryptographers use larger groups different types groups rsa security depends part upon difficulty integer factorization — breakthrough factoring would impact security rsa 1980 one could factor difficult 50-digit number expense 10 elementary computer operations 1984 state art factoring algorithms advanced point 75-digit number could factored 10 operations advances computing technology also meant operations could performed much faster moore law predicts computer speeds continue increase factoring techniques may continue well likely depend mathematical insight creativity neither ever successfully predictable 150-digit numbers kind used rsa factored effort greater unreasonable fast modern computers start 21st century 150-digit numbers longer considered large enough key size rsa numbers several hundred digits still considered hard factor 2005 though methods probably continue improve time requiring key size keep pace methods elliptic curve cryptography used another distinguishing feature asymmetric schemes unlike attacks symmetric cryptosystems cryptanalysis opportunity make use knowledge gained public key quantum computers still early phases research potential use cryptanalysis example shor algorithm could factor large numbers polynomial time effect breaking commonly used forms public-key encryption using grover algorithm quantum computer brute-force key search made quadratically faster however could countered doubling key length | [
358,
1811,
715,
1821,
1455,
2918,
7534,
2566,
7548,
5398,
1480,
7200,
4349,
7567,
5765,
7207,
762,
5773,
7209,
5776,
4730,
429,
6488,
433,
3335,
1146,
4746,
5796,
3350,
803,
464,
807,
119,
122,
3718,
4805,
147,
2325,
1587,
1592,
161,
... | Test |
1,354 | 4 | Application-level_gateway:application-level gateway context computer networking application-level gateway also known alg application layer gateway application gateway application proxy application-level proxy consists security component augments firewall nat employed computer network allows customized nat traversal filters plugged gateway support address port translation certain application layer control/data protocols ftp bittorrent sip rtsp file transfer im applications etc order protocols work nat firewall either application know address/port number combination allows incoming packets nat monitor control traffic open port mappings firewall pinhole dynamically required legitimate application data thus passed security checks firewall nat would otherwise restricted traffic meeting limited filter criteria alg may offer following functions deep packet inspection packets handled algs given network makes functionality possible alg understands protocol used specific applications supports instance session initiation protocol sip back-to-back user agent b2bua alg allow firewall traversal sip firewall sip traffic terminated alg responsibility permitting sip sessions passes alg instead firewall alg solve another major sip headache nat traversal basically nat built-in alg rewrite information within sip messages hold address bindings session terminates sip alg also handle sdp body sip messages used ubiquitously voip set media endpoints since sdp also contains literal ip addresses ports must translated alg similar proxy server sits client real server facilitating exchange seems industry convention alg job without application configured use intercepting messages proxy hand usually needs configured client application client explicitly aware proxy connects rather real server application layer gateway service microsoft windows provides support third-party plugins allow network protocols pass windows firewall work behind internet connection sharing alg plugins open ports change data embedded packets ports ip addresses windows server 2003 also includes alg ftp plugin alg ftp plugin designed support active ftp sessions nat engine windows alg ftp plugin redirects traffic passes nat destined port 21 ftp control port private listening port 3000–5000 range microsoft loopback adapter alg ftp plugin monitors/updates traffic ftp control channel ftp plugin plumb port mappings nat ftp data channels linux kernel netfilter framework implements nat linux features modules several nat algs | [
6531,
2885,
4577,
4759,
2681,
3945,
3338,
4172,
5790,
7170
] | Validation |
1,355 | 8 | Deep_linking:deep linking context world wide web deep linking use hyperlink links specific generally searchable indexed piece web content website e.g nowiki http //example.com/path/page /nowiki rather website home page e.g. nowiki http //example.com /nowiki url contains information needed point particular item case example section english wikipedia article entitled deep linking opposed information needed point highest-level home page wikipedia codice_1 technology behind world wide web hypertext transfer protocol http actually make distinction deep links links—all links functionally equal intentional one design purposes web allow authors link published document another site possibility so-called deep linking therefore built web technology http urls default—while site attempt restrict deep links requires extra effort according world wide web consortium technical architecture group attempt forbid practice deep linking based misunderstanding technology threatens undermine functioning web whole commercial websites object sites making deep links content either bypasses advertising main pages passes content linker like wall street journal charge users permanently valid links sometimes deep linking led legal action 1997 case ticketmaster versus microsoft microsoft deep-linked ticketmaster site sidewalk service case settled microsoft ticketmaster arranged licensing agreement ticketmaster later filed similar case tickets.com judge case ruled linking legal long clear linked pages belonged court also concluded urls copyrightable writing url simply address open public like street address building known enable user reach building nothing sufficiently original make url copyrightable item especially way used appear cases holding urls subject copyright principle websites built technologies adobe flash ajax often support deep linking cause usability problems visitors sites example may unable save bookmarks individual pages states site use web browser forward back buttons—and clicking browser refresh button may return user initial page however fundamental limitation technologies well-known techniques libraries swfaddress unfocus history keeper exist website creators using flash ajax use provide deep linking pages within sites probably earliest legal case arising deep linking 1996 scottish case shetland times vs shetland news times accused news appropriating stories times nowiki /nowiki website beginning 2006 case search engine bixee.com job site naukri.com delhi high court india prohibited bixee.com deeplinking naukri.com important widely cited u.s. opinions deep linking ninth circuit rulings kelly v. arriba soft corp. perfect 10 inc. v. amazon.com inc. cases court exonerated use deep linking second cases court explained speaking defendant google perfect 10 also sued linking copyright infringement us law google not…display copy full-size infringing photographic images purposes copyright act google frames in-line linked images appear user computer screen google computers store photographic images google copy images purposes copyright act words google material objects…in work fixed…and work perceived reproduced otherwise communicated thus communicate copy instead communicating copy image google provides html instructions direct user browser website publisher computer stores full-size photographic image providing html instructions equivalent showing copy first html instructions lines text photographic image second html instructions cause infringing images appear user computer screen html merely gives address image user browser browser interacts computer stores infringing image interaction causes infringing image appear user computer screen google may facilitate user access infringing images however assistance raised contributory liability issues constitute direct infringement copyright owner display rights …while in-line linking framing may cause computer users believe viewing single google webpage copyright act unlike trademark act protect copyright holder acts cause consumer confusion december 2006 texas court ruled linking motocross website videos texas-based motocross video production website constitute fair use court subsequently issued injunction case sfx motor sports inc. v. davis published official reports available 2006 wl 3616983 february 2006 ruling danish maritime commercial court copenhagen found systematic crawling indexing deep linking portal site ofir.dk real estate site home.dk conflict danish law database directive european union court stated search engines desirable functioning internet publishing information internet one must assume—and accept—that search engines deep-link individual pages one website web site owners n't want search engines deep link want index specific pages request using robots exclusion standard robots.txt file people favor deep linking often feel content owners n't provide robots.txt file implying default object deep linking either search engines others people deep linking often claim content owners may unaware robots exclusion standard may use robots.txt reasons sites search engines also deep link content sites question relevance robots exclusion standard controversies deep linking robots exclusion standard programmatically enforce directives prevent search engines others follow polite conventions deep linking | [
1411,
2086,
4519,
1235,
4668,
80,
84,
3092,
87,
3383,
3999
] | Test |
1,356 | 4 | Ben_Laurie:ben laurie ben laurie software engineer protocol designer cryptographer founding director apache software foundation core team member openssl member shmoo group director open rights group director security bunker secure hosting trustee founder-member freebmd visiting fellow cambridge university computer laboratory laurie works google london various projects currently focused certificate transparency ben wrote apache-ssl basis ssl-enabled versions apache http server co-author openpgp sdk developed mud gods innovative including online creation endgame ben also written several articles papers books many found home page blog interested ideal knots applications | [
1523,
794,
1341,
1254,
7514,
6795,
191,
6711,
1547,
2923,
4498,
7355,
208,
481,
3457,
732,
2300,
6278,
8194,
8096,
1193,
1013,
3636,
4059,
8001,
6918,
5760,
3476,
6211,
3986,
4806,
5065,
594,
4441,
5865,
4534,
6477,
617,
424,
2512,
5250... | Test |
1,357 | 7 | Hosted_desktop:hosted desktop hosted desktop product set within larger cloud-computing sphere generally delivered using combination technologies including hardware virtualization form remote connection software citrix xenapp microsoft remote desktop services two common processing takes place within provider datacentre environment traffic datacentre client primarily display updates mouse movements keyboard activity additional traffic generated audio print jobs hosted desktop commonly involves browser-based connection desktop environment includes office productivity suite alongside desktop applications desktop hosted run delivered supported central location usually secure data center high-quality resilient connections internet/cloud cloud desktop term often used refer container collection virtual objects software hardware configurations etc. residing cloud used client interact remote services perform computer related tasks connecting clients run pre-installed downloaded viewer applications via one many remote desktop protocols clients include thin clients pcs workstations mobile handheld devices running variety operating systems windows mac os x linux others move towards hosted desktops virtual desktop infrastructure vdi subset predicted gartner account 49 million business desktops 2013 equal 40 percent worldwide professional pc market development applications service providers google microsoft accelerated process evolution new licensing schemes allow fee-paying based subscription rather purchase centralized nature hosted desktops overcome common issues mobile working delivery common infrastructure across physical sites disaster recovery cost control scaling up/down timely fashion hosted desktop services comparatively simple method applying outsourcing principles within business although care warranted ensuring service provider quality ensure compliance data security data protection standards meet requirements hosted desktop based environment generally migrate user authentication file print services application delivery data storage cloud making accessible via secure connections internet enabled location relatively small bandwidth requirements hosted desktop means 5 10 people connect work standard xdsl broadband whilst single user operate quite effectively 3g mobile data connection hosted desktops often based windows server 2008 utilising remote desktop services often additional management layer vendors like citrix systems parallels workstation make personalisation easier licensing type hosted desktop provided microsoft service provider license agreement spla special type end-user license agreement user rents appropriate licenses part monthly fee paid service provider receives automatic upgrade rights latest version software part agreement backup disaster recovery handled hosted desktop vendor best solutions also providing failover alternate datacentres hosted desktop vendors utilising vmware microsoft technology charges normally monthly basic charge applied user hosted desktop additional charges office productivity suite additional data storage extra applications vendors wrap suite common applications product sets simplify still | [
7820,
2961,
3756
] | Test |
1,358 | 4 | Call_blocking:call blocking call blocking also known call block call screening call rejection allows telephone subscriber block incoming calls specific telephone numbers feature may require additional payment subscriber telephone company third-party call blocking desired individuals wish block unwanted phone calls generally include types unsolicited calls telemarketers robocalls unwanted calls landlines may blocked number methods landline phones built-in call blocking facilities external call blockers sold telephone accessories plug existing phones call blockers related services recently received attention 2016 publications including consumer reports united kingdom united states respectively devices services enable user block call progress alternatively block number call made devices rely caller id information thus phone blocker requires caller id service active line blocking function may also possible use computer software conjunction caller id information phone company caller id enabled phone modem block incoming call treatment blocked calls may include multitude third-party call blocking applications available smart phones manufacturers provide built-in call blocking functions standard | [
3759,
7813,
740
] | Validation |
1,359 | 1 | XtraDB:xtradb percona xtradb storage engine mariadb percona server databases intended drop-in replacement innodb one default engines available mysql database 10.1 mariadb mariadb server used percona xtradb default storage engine mariadb 10.2 innodb engine default xtradb xtradb incorporates innodb acid-compliant design mvcc architecture allows greater degree tuning scalability engine also better suited multi-core processing addresses issues known innodb | [
7957,
5717,
7248,
5126,
5571,
6279,
4708,
4167,
3652,
6755,
4363,
5780,
6056,
3915,
1695,
2259,
3244,
7598
] | Test |
1,360 | 9 | MEX_file:mex file mex file type computer file provides interface matlab octave functions written c c++ fortran stands matlab executable compiled mex files dynamically loaded allow external functions invoked within matlab octave built-in functions support development mex files matlab octave offer external interface functions facilitate transfer data mex files workspace addition mex files octave format using native api better performance | [
1710,
3981,
2803,
1435,
5117
] | Test |
1,361 | 9 | Compiler:compiler compiler computer program translates computer code written one programming language source language another programming language target language name compiler primarily used programs translate source code high-level programming language lower level language e.g. assembly language object code machine code create executable program however many different types compilers compiled program run computer whose cpu operating system different one compiler runs compiler cross-compiler bootstrap compiler written language intends compile program translates low-level language higher level one decompiler program translates high-level languages usually called source-to-source compiler transpiler language rewriter usually program translates form expressions without change language term compiler-compiler refers tools used create parsers perform syntax analysis compiler likely perform many following operations preprocessing lexical analysis parsing semantic analysis syntax-directed translation conversion input programs intermediate representation code optimization code generation compilers implement operations phases promote efficient design correct transformations source input target output program faults caused incorrect compiler behavior difficult track work around therefore compiler implementers invest significant effort ensure compiler correctness compilers language processor used transform source programs interpreter computer software transforms executes indicated operations translation process influences design computer languages leads preference compilation interpretation practice interpreter implemented compiled languages compilers implemented interpreted languages theoretical computing concepts developed scientists mathematicians engineers formed basis digital modern computing development world war ii primitive binary languages evolved digital devices understand ones zeros circuit patterns underlying machine architecture late 1940s assembly languages created offer workable abstraction computer architectures limited memory capacity early computers led substantial technical challenges first compilers designed therefore compilation process needed divided several small programs front end programs produce analysis products used back end programs generate target code computer technology provided resources compiler designs could align better compilation process usually productive programmer use high-level language development high-level languages followed naturally capabilities offered digital computers high-level languages formal languages strictly defined syntax semantics form high-level language architecture elements formal languages include sentences language may defined set rules called grammar backus–naur form bnf describes syntax sentences language used syntax algol 60 john backus ideas derive context-free grammar concepts noam chomsky linguist bnf extensions become standard tools describing syntax programming notations many cases parts compilers generated automatically bnf description 1940s konrad zuse designed algorithmic programming language called plankalkül plan calculus actual implementation occurred 1970s presented concepts later seen apl designed ken iverson late 1950s apl language mathematical computations high-level language design formative years digital computing provided useful programming tools variety applications compiler technology evolved need strictly defined transformation high-level source program low-level target program digital computer compiler could viewed front end deal analysis source code back end synthesize analysis target code optimization front end back end could produce efficient target code early milestones development compiler technology early operating systems software written assembly language 60s early 70s use high-level languages system programming still controversial due resource limitations however several research industry efforts began shift toward high-level systems programming languages example bcpl bliss b c. bcpl basic combined programming language designed 1966 martin richards university cambridge originally developed compiler writing tool several compilers implemented richards book provides insights language compiler bcpl influential systems programming language still used research also provided basis design b c languages bliss basic language implementation system software developed digital equipment corporation dec pdp-10 computer w.a wulf carnegie mellon university cmu research team cmu team went develop bliss-11 compiler one year later 1970 multics multiplexed information computing service time-sharing operating system project involved mit bell labs general electric later honeywell led fernando corbató mit multics written pl/i language developed ibm ibm user group ibm goal satisfy business scientific systems programming requirements languages could considered pl/i offered complete solution even though implemented first years mulitics project subset language could compiled assembly language early pl/i epl compiler doug mcilory bob morris bell labs epl supported project boot-strapping compiler full pl/i could developed bell labs left multics project 1969 time hope replaced frustration group effort initially failed produce economically useful system continued participation would drive project support costs researchers turned development efforts system programming language b based bcpl concepts written dennis ritchie ken thompson ritchie created boot-strapping compiler b wrote unics uniplexed information computing service operating system pdp-7 b. unics eventually became spelled unix bell labs started development expansion c based b bcpl bcpl compiler transported multics bell labs bcpl preferred language bell labs initially front-end program bell labs b compiler used c compiler developed 1971 new pdp-11 provided resource define extensions b rewrite compiler 1973 design c language essentially complete unix kernel pdp-11 rewritten c. steve johnson started development portable c compiler pcc support retargeting c compilers new machines object-oriented programming oop offered interesting possibilities application development maintenance oop concepts go back part lisp simula language science bell labs development c++ became interested oop c++ first used 1980 systems programming initial design leveraged c language systems programming capabilities simula concepts object-oriented facilities added 1983 cfront program implemented c++ front-end c84 language compiler subsequent years several c++ compilers developed c++ popularity grew many application domains idea using higher-level language quickly caught expanding functionality supported newer programming languages increasing complexity computer architectures compilers became complex darpa defense advanced research projects agency sponsored compiler project wulf cmu research team 1970 production quality compiler-compiler pqcc design would produce production quality compiler pqc formal definitions source language target pqcc tried extend term compiler-compiler beyond traditional meaning parser generator e.g. yacc without much success pqcc might properly referred compiler generator pqcc research code generation process sought build truly automatic compiler-writing system effort discovered designed phase structure pqc bliss-11 compiler provided initial structure phases included analyses front end intermediate translation virtual machine middle end translation target back end tcol developed pqcc research handle language specific constructs intermediate representation variations tcol supported various languages pqcc project investigated techniques automated compiler construction design concepts proved useful optimizing compilers compilers object-oriented programming language ada ada stoneman document formalized program support environment apse along kernel kapse minimal mapse ada interpreter nyu/ed supported development standardization efforts american national standards institute ansi international standards organization iso initial ada compiler development u.s. military services included compilers complete integrated design environment along lines stoneman document army navy worked ada language system als project targeted dec/vax architecture air force started ada integrated environment aie targeted ibm 370 series projects provide desired results contribute overal effort ada development ada compiler efforts got underway britain university york germany university karlsruhe u. s. verdix later acquired rational delivered verdix ada development system vads army vads provided set development tools including compiler unix/vads could hosted variety unix platforms dec ultrix sun 3/60 solaris targeted motorola 68020 army cecom evaluation soon many ada compilers available passed ada validation tests free software foundation gnu project developed gnu compiler collection gcc provides core capability support multiple languages targets ada version gnat one widely used ada compilers gnat free also commercial support example adacore founded 1994 provide commercial software solutions ada gnat pro includes gnu gcc based gnat tool suite provide integrated development environment high-level languages continued drive compiler research development focus areas included optimization automatic code generation trends programming languages development environments influenced compiler technology compilers became included language distributions perl java development kit component ide vads eclipse ada pro interrelationship interdependence technologies grew advent web services promoted growth web languages scripting languages scripts trace back early days command line interfaces cli user could enter commands executed system user shell concepts developed languages write shell programs early windows designs offered simple batch programming capability conventional transformation language used interpreter widely used bash batch compilers written recently sophisticated interpreted languages became part developers tool kit modern scripting languages include php python ruby lua lua widely used game development interpreter compiler support field compiling began late 50s focus limited translation high-level language programs machine code ... compiler field increasingly intertwined disciplines including computer architecture programming languages formal methods software engineering computer security compiler research next 50 years article noted importance object-oriented languages java security parallel computing cited among future research targets compiler implements formal transformation high-level source program low-level target program compiler design define end end solution tackle defined subset interfaces compilation tools e.g preprocessors assemblers linkers design requirements include rigorously defined interfaces internally compiler components externally supporting toolsets early days approach taken compiler design directly affected complexity computer language processed experience person designing resources available resource limitations led need pass source code compiler relatively simple language written one person might single monolithic piece software however source language grows complexity design may split number interdependent phases separate phases provide design improvements focus development functions compilation process classifying compilers number passes background hardware resource limitations computers compiling involves performing lots work early computers enough memory contain one program work compilers split smaller programs made pass source representation performing required analysis translations ability compile single pass classically seen benefit simplifies job writing compiler one-pass compilers generally perform compilations faster multi-pass compilers thus partly driven resource limitations early systems many early languages specifically designed could compiled single pass e.g. pascal cases design language feature may require compiler perform one pass source instance consider declaration appearing line 20 source affects translation statement appearing line 10 case first pass needs gather information declarations appearing statements affect actual translation happening subsequent pass disadvantage compiling single pass possible perform many sophisticated optimizations needed generate high quality code difficult count exactly many passes optimizing compiler makes instance different phases optimization may analyse one expression many times analyse another expression splitting compiler small programs technique used researchers interested producing provably correct compilers proving correctness set small programs often requires less effort proving correctness larger single equivalent program regardless exact number phases compiler design phases assigned one three stages stages include front end middle end back end front/middle/back-end approach makes possible combine front ends different languages back ends different cpus sharing optimizations middle end practical examples approach gnu compiler collection llvm amsterdam compiler kit multiple front-ends shared optimizations multiple back-ends front end analyzes source code build internal representation program called intermediate representation ir also manages symbol table data structure mapping symbol source code associated information location type scope frontend single monolithic function program scannerless parser commonly implemented analyzed several phases may execute sequentially concurrently method favored due modularity separation concerns commonly today frontend broken three phases lexical analysis also known lexing syntax analysis also known scanning parsing semantic analysis lexing parsing comprise syntactic analysis word syntax phrase syntax respectively simple cases modules lexer parser automatically generated grammar language though complex cases require manual modification lexical grammar phrase grammar usually context-free grammars simplifies analysis significantly context-sensitivity handled semantic analysis phase semantic analysis phase generally complex written hand partially fully automated using attribute grammars phases broken lexing scanning evaluating parsing building concrete syntax tree cst parse tree transforming abstract syntax tree ast syntax tree cases additional phases used notably line reconstruction preprocessing rare main phases front end include following middle end also known optimizer performs optimizations intermediate representation order improve performance quality produced machine code middle end contains optimizations independent cpu architecture targeted main phases middle end include following compiler analysis prerequisite compiler optimization tightly work together example dependence analysis crucial loop transformation scope compiler analysis optimizations vary greatly scope may range operating within basic block whole procedures even whole program trade-off granularity optimizations cost compilation example peephole optimizations fast perform compilation affect small local fragment code performed independently context code fragment appears contrast interprocedural optimization requires compilation time memory space enable optimizations possible considering behavior multiple functions simultaneously interprocedural analysis optimizations common modern commercial compilers hp ibm sgi intel microsoft sun microsystems free software gcc criticized long time lacking powerful interprocedural optimizations changing respect another open source compiler full analysis optimization infrastructure open64 used many organizations research commercial purposes due extra time space needed compiler analysis optimizations compilers skip default users use compilation options explicitly tell compiler optimizations enabled back end responsible cpu architecture specific optimizations code generation main phases back end include following compiler correctness branch software engineering deals trying show compiler behaves according language specification techniques include developing compiler using formal methods using rigorous testing often called compiler validation existing compiler higher-level programming languages usually appear type translation mind either designed compiled language interpreted language however practice rarely anything language requires exclusively compiled exclusively interpreted although possible design languages rely re-interpretation run time categorization usually reflects popular widespread implementations language — instance basic sometimes called interpreted language c compiled one despite existence basic compilers c interpreters interpretation replace compilation completely hides user makes gradual even though interpreter interpreted directly executed program needed somewhere bottom stack see machine language compilers contain interpreters optimization reasons example expression executed compilation results inserted output program prevents recalculated time program runs greatly speed final program modern trends toward just-in-time compilation bytecode interpretation times blur traditional categorizations compilers interpreters even language specifications spell implementations must include compilation facility example common lisp however nothing inherent definition common lisp stops interpreted languages features easy implement interpreter make writing compiler much harder example apl snobol4 many scripting languages allow programs construct arbitrary source code runtime regular string operations execute code passing special evaluation function implement features compiled language programs must usually shipped runtime library includes version compiler one classification compilers platform generated code executes known target platform native hosted compiler one whose output intended directly run type computer operating system compiler runs output cross compiler designed run different platform cross compilers often used developing software embedded systems intended support software development environment output compiler produces code virtual machine vm may may executed platform compiler produced reason compilers usually classified native cross compilers lower level language target compiler may high-level programming language c viewed sort portable assembly language frequently target language compilers example cfront original compiler c++ used c target language c code generated compiler usually intended readable maintained humans indent style creating pretty c intermediate code ignored features c make good target language include codice_1 directive generated compiler support debugging original source wide platform support available c compilers common compiler type outputs machine code many types | [
1445,
1446,
5734,
1463,
2929,
1478,
35,
5757,
5771,
74,
5784,
90,
1520,
95,
7251,
1556,
1557,
5846,
7277,
144,
1579,
149,
152,
154,
7298,
4447,
162,
1598,
5883,
3069,
1616,
184,
213,
4504,
5932,
218,
4512,
7375,
7382,
7383,
5946,
5947... | Test |
1,362 | 9 | CGOL:cgol cgol pronounced see goll alternative syntax featuring extensible algebraic notation lisp programming language designed maclisp vaughan pratt subsequently ported common lisp notation cgol traditional algebraic notation sometimes called infix notation style algol rather lisp traditional uniformly-parenthesized prefix notation syntax cgol parser based pratt design top-down operator precedence parsing sometimes informally referred pratt parser semantically cgol essentially common lisp additional reader printer support special notations available many commonly used common lisp operations example one write matrix multiply routine cgol infix codice_1 operation referring common lisp codice_2 function infix codice_3 operation referring common lisp codice_4 function preceding example corresponds text native common lisp cgol uses codice_5 read set properties preceding example corresponds text native common lisp illustrates cgol notates function two arguments preceding example corresponds text native common lisp syntax cgol data-driven modifiable extensible cgol known work armed bear common lisp cgol source code text files containing discussions available freeware carnegie-mellon university artificial intelligence repository well richard fateman homepage university california berkeley | [
6507,
4543,
1445
] | Test |
1,363 | 4 | Dangling_pointer:dangling pointer dangling pointers wild pointers computer programming pointers point valid object appropriate type special cases memory safety violations generally dangling references wild references references resolve valid destination include phenomena link rot internet dangling pointers arise object destruction object incoming reference deleted deallocated without modifying value pointer pointer still points memory location deallocated memory system may reallocate previously freed memory program dereferences dangling pointer unpredictable behavior may result memory may contain completely different data program writes memory referenced dangling pointer silent corruption unrelated data may result leading subtle bugs extremely difficult find memory reallocated another process attempting dereference dangling pointer cause segmentation faults unix linux general protection faults windows program sufficient privileges allow overwrite bookkeeping data used kernel memory allocator corruption cause system instabilities object-oriented languages garbage collection dangling references prevented destroying objects unreachable meaning incoming pointers ensured either tracing reference counting however finalizer may create new references object requiring object resurrection prevent dangling reference wild pointers arise pointer used prior initialization known state possible programming languages show erratic behavior dangling pointers though less likely stay undetected many compilers raise warning compile time declared variables accessed initialized many languages e.g. c programming language deleting object memory explicitly destroying stack frame return alter associated pointers pointer still points location memory even though may used purposes straightforward example shown operating system able detect run-time references null pointers solution assign 0 null dp immediately inner block exited another solution would somehow guarantee dp used without initialization another frequent source dangling pointers jumbled combination malloc free library calls pointer becomes dangling block memory points freed previous example one way avoid make sure reset pointer null freeing reference—as demonstrated common misstep returning addresses stack-allocated local variable called function returns space variables gets deallocated technically garbage values attempts read pointer may still return correct value 1234 calling func functions called thereafter may overwrite stack storage allocated num values pointer would longer work correctly pointer num must returned num must scope beyond function—it might declared static 1945-1996 created complete object management system free dangling reference phenomenon see consequently note cost kill constant formula_2 similar approach proposed fisher leblanc name locks-and-keys wild pointers created omitting necessary initialization prior first use thus strictly speaking every pointer programming languages enforce initialization begins wild pointer often occurs due jumping initialization omitting compilers able warn like buffer-overflow bugs dangling/wild pointer bugs frequently become security holes example pointer used make virtual function call different address possibly pointing exploit code may called due vtable pointer overwritten alternatively pointer used writing memory data structure may corrupted even memory read pointer becomes dangling lead information leaks interesting data put next structure allocated privilege escalation now-invalid memory used security checks dangling pointer used freed without allocating new chunk memory becomes known use free vulnerability example cve-2014-1776 use-after-free vulnerability microsoft internet explorer 6 11 used zero-day attacks advanced persistent threat c simplest technique implement alternative version free alike function guarantees reset pointer however technique clear pointer variables may contain copy pointer alternative version used even guarantee validity empty pointer calling malloc uses masked define directives construct useful macros creating something like metalanguage embedded tool library apart every case programmers using technique use safe versions every instance free would used failing leads problem also solution limited scope single program project properly documented among structured solutions popular technique avoid dangling pointers c++ use smart pointers smart pointer typically uses reference counting reclaim objects techniques include tombstones method locks-and-keys method see paper fisher leblanc another approach use boehm garbage collector conservative garbage collector replaces standard memory allocation functions c c++ garbage collector approach completely eliminates dangling pointer errors disabling frees reclaiming objects garbage collection languages like java dangling pointers occur mechanism explicitly deallocate memory rather garbage collector may deallocate memory object longer reachable references language rust type system extended include also variables lifetimes resource acquisition initialization unless one disables features language dangling pointers caught compile time reported programming errors expose dangling pointer errors one common programming technique set pointers null pointer invalid address storage point released null pointer dereferenced languages program immediately terminate—there potential data corruption unpredictable behavior makes underlying programming mistake easier find resolve technique help multiple copies pointer debuggers automatically overwrite destroy data freed usually specific pattern codice_1 microsoft visual c/c++ debugger example uses codice_2 codice_3 codice_4 depending freed usually prevents data reused making useless also prominent pattern serves show programmer memory already freed tools polyspace totalview valgrind mudflap addresssanitizer tools based llvm also used detect uses dangling pointers tools softbound insure++ checkpointer instrument source code collect track legitimate values pointers metadata check pointer access metadata validity another strategy suspecting small set classes temporarily make member functions virtual class instance destructed/freed pointer virtual method table set codice_5 call member function crash program show guilty code debugger term dangling pointer may also used contexts programming especially technical people example phone number person since changed phones real-world example dangling pointer another example entry online encyclopedia refers another entry whose title changed changing previously existing references entry dangling pointers | [
1616,
2540,
3932,
549,
3351,
7333,
3515,
8066,
8174,
379,
2736,
7530,
2289,
4950,
572,
573,
1191,
3875,
1855,
1019,
6118,
749,
2318,
1208,
5948,
3726,
4347,
5506,
3566,
4810,
7391,
56,
1584,
6567,
3225,
858,
2337,
2153,
5353,
1435,
4920... | Test |
1,364 | 5 | Plesiochronous_digital_hierarchy:plesiochronous digital hierarchy plesiochronous digital hierarchy pdh technology used telecommunications networks transport large quantities data digital transport equipment fibre optic microwave radio systems term plesiochronous derived greek plēsios meaning near chronos time refers fact pdh networks run state different parts network nearly quite perfectly synchronized backbone transport networks replaced pdh networks synchronous digital hierarchy sdh synchronous optical networking sonet equipment ten years ending around turn millennium 2000 whose floating payloads relaxed stringent timing requirements pdh network technology cost north america 4.5 billion 1998 alone p. 171 pdh allows transmission data streams nominally running rate allowing variation speed around nominal rate analogy two watches nominally running rate clocking 60 seconds every minute however link watches guarantee run exactly rate highly likely one running slightly faster data rate controlled clock equipment generating data rate allowed vary ±50 ppm 2048 kbit/s according itu-t recommendation means different data streams probably run slightly different rates one another order transport multiple data streams one place another common transmission medium multiplexed groups four four data streams necessarily running rate compensation introduced typically multiplexer takes data 4 incoming 2.048 mbit/s data streams feeds 2.112 mbit/s stream via buffer store leaving series fixed gaps frame data rate thus 2.112 mbit/s x number bits frame – number gaps number bits frame slightly greater 2.048 mbit/s 50ppm extra gap added slightly smaller 2.048 mbit/s – 50ppm thus average data rate made exactly equal incoming rate adding gap frames others extra gap fixed place frame referred stuffable bit contain data i.e ’ gap stuffed data 4 data streams contained 4 data streams 2.112 mbit/s synchronous easily multiplexed give single stream 8.448 mbit/s taking 1 bit stream 1 followed 1 bit stream 2 3 4 etc fixed gaps accommodate synchronisation word allows demultiplexer identify start frame others contain control bits stream say whether stuffable bit stuffed i.e contains data process reversed demultiplexer 4 data streams produced exactly bit rate previous timing irregularity ironed using phase locked loop scheme allow addition stuffed bit soon required stuffable bit fixed point frame necessary wait stuffable bit time slot wait results waiting time jitter arbitrarily low frequency i.e zero entirely eliminated filtering effects phase lock loop worst possible stuffing ratio would 1 frame 2 gives theoretical 0.5 bit jitter stuffing ratio carefully chosen give theoretical minimum jitter practical system however actual decision stuff may made comparing read address write address input buffer store position frame decision made varies adds second variable dependent length store process sometimes called pulse justification justification printing adding gaps line takes full column width believed term preferred ... stuffing stuffable bits waiting time jitter jitter get waiting stuff stuffable bit though technically correct sound like pleonasm similar techniques used combine four × 8 mbit/s together plus bit stuffing frame alignment giving 34 mbit/s four × 34 mbit/s gives 140 four × 140 gives 565 telecommunications networks independent clocks free-running precision clocks located nodes used synchronization variable storage buffers installed accommodate variations transmission delay nodes made large enough accommodate small time phase departures among nodal clocks control transmission traffic may occasionally interrupted allow buffers emptied stored data | [
585,
6871,
7916,
4101,
2236,
3597,
5492,
1543,
1709
] | Test |
1,365 | 9 | Extended_Backus–Naur_form:extended backus–naur form computer science extended backus-naur form ebnf family metasyntax notations used express context-free grammar ebnf used make formal description formal language computer programming language extensions basic backus–naur form bnf metasyntax notation earliest ebnf developed niklaus wirth incorporating concepts different syntax notation wirth syntax notation however many variants ebnf use international organization standardization adopted ebnf standard iso/iec 14977 1996 however according zaytsev standard ended adding yet another three dialects chaos noting lack success also notes iso ebnf even used iso standards wheeler argues using iso standard using ebnf recommends considering alternative ebnf notations one w3c extensible markup language xml 1.0 fifth edition article uses ebnf specified iso examples applying ebnfs ebnf variants use somewhat different syntactic conventions ebnf code expresses grammar formal language ebnf consists terminal symbols non-terminal production rules restrictions governing terminal symbols combined legal sequence examples terminal symbols include alphanumeric characters punctuation marks whitespace characters ebnf defines production rules sequences symbols respectively assigned nonterminal digit excluding zero 1 2 3 4 5 6 7 8 9 digit 0 digit excluding zero production rule defines nonterminal digit left side assignment vertical bar represents alternative terminal symbols enclosed quotation marks followed semicolon terminating character hence digit 0 digit excluding zero 1 2 3 forth 9 production rule also include sequence terminals nonterminals separated comma twelve 1 2 two hundred one 2 0 1 three hundred twelve 3 twelve twelve thousand two hundred one twelve two hundred one expressions may omitted repeated represented curly braces ... natural number digit excluding zero digit case strings 1 2 ... 10 ... 12345 ... correct expressions represent everything set within curly braces may repeated arbitrarily often including option represented squared brackets ... everything set within square brackets may present integer 0 natural number therefore integer zero 0 natural number may preceded optional minus sign ebnf also provides among things syntax describe repetitions specified number times exclude part production insert comments ebnf grammar following represents proposed iso/iec 14977 standard r. s. scowen page 7 table 1 even ebnf described using ebnf consider sketched grammar letter b c e f g digit 0 1 2 3 4 5 6 7 8 9 symbol character letter digit symbol identifier letter letter digit terminal character character lhs identifier rhs identifier rule lhs rhs grammar rule pascal-like programming language allows assignments defined ebnf follows syntactically correct program would language easily extended control flows arithmetical expressions input/output instructions small usable programming language would developed grammar defined ebnf also represented bnf though representations latter generally lengthier e.g. options repetitions directly expressed bnf require use intermediate rule alternative production defined either nothing optional production option either repeated production recursively repetition constructs still used ebnf bnf uses symbols := include quotes around terminal strings prevents characters used languages requires special symbol empty string ebnf terminals strictly enclosed within quotation marks ... ... angle brackets ... nonterminals omitted bnf syntax represent rule one line whereas ebnf terminating character semicolon marks end rule furthermore ebnf includes mechanisms enhancements defining number repetitions excluding alternatives comments etc examples following syntax rules illustrate facilities expressing repetition aa bb 3 aa b cc 3 aa c dd aa ee aa aa e ff 3 aa 3 aa f gg 3 aa g terminal strings defined rules follows according iso 14977 standard ebnf meant extensible two facilities mentioned first part ebnf grammar special sequence arbitrary text enclosed question marks interpretation text inside special sequence beyond scope ebnf standard example space character could defined following rule second facility extension using fact parentheses ebnf placed next identifiers must concatenated following valid ebnf following valid ebnf therefore extension ebnf could use notation example lisp grammar function application could defined following rule | [
7375,
3030,
4543,
1157,
6311,
5948,
5424,
6882,
764
] | Train |
1,366 | 4 | Boris_Loza:boris loza boris loza may 5 1960 founder safepatrol solutions tego systems well certified information systems security professional cissp born krasnodar russia attained masters degree age 22 phd age 26 computer science cybernetics still living former ussr loza published 30 scientific articles well secured one patent upon relocating canada 1996 phd confirmed higher attestation committee university toronto since immigrating loza worked ibm global services senior system administrator fidelity investments principal information systems security specialist loza interest computer security led continue developing products well publish articles book articles featured hacker magazines original phrack contributed 40 articles us industry magazines usenix sysadmin inside solaris inside internet several others 2005 loza published computer security book titled unix solaris linux practical security cookbook securing unix operating systems without third-party application number loza articles featured press including sun microsystems novell linux bsd communities work russian english translated several languages including french bulgarian polish loza holds secret level clearance government canada acts subject matter expert courts filed several information security patents usa conducted hundreds information security assessments security forensics penetration tests white hacking assessments speaker author trainer loza worked consults fortune global 500 companies including ibm fidelity investments well government agencies start-ups work cited books hack proofing sun solaris 8 among others 2008 boris loza internationally recognized work contribution field computer security awareness winner first international cyber security awareness contest held isc ² computer security products developed boris loza well co-authors loza current project notebak—a computer security system used personal corporate systems | [
6004,
6046
] | Validation |
1,367 | 5 | Growl_(software):growl software growl global notification system pop-up notification implementation mac os x windows operating systems applications use growl display small notifications events may important user software allows users fully control notifications allowing application developers spend less time creating notifications growl developers concentrate usability notifications growl used conjunction apple notification center included mac os x 10.8 mountain lion higher growl installed preference pane added mac os x system preferences pane may used enable disable growl notifications specific applications specific notifications application notification provides information download finished name current itunes track software comes multiple display plugins providing user different style options presenting notifications display plugins include visual styles well ability send notifications via email sms push notifications additional third-party plugins scripts exist add growl notifications ichat mail thunderbird safari itunes application developers may make use growl api send notifications users growl includes bindings developers use objective-c c perl python tcl applescript java ruby programming languages growl website lists applications install growl without user permission including adobe creative suite 5 adobe published blog post apologizing installing growl users systems without permission says actively working mitigate problem adobe article knowledge base explaining notifications cs5 sends remove growl | [
5983,
7975,
6428,
5571,
1435,
486,
499,
6295,
4975,
3564,
5535,
5965,
7692,
445
] | Test |
1,368 | 4 | Identity-based_security:identity-based security identity-based security approach control access digital product service based authenticated identity individual allows organizations grant access specific users access variety digital services using credentials ensuring accurate match users entitled actually receive also permitting access constraints company device location application type attributes underpinning identity-based security approach identity-based access control ibac identity-based licensing concept nist defines identity-based security policies policies based identities and/or attributes object system resource accessed subject user group users process device requesting access advantages identity-based security approach include ability exercise fine-grained control allowed use services functions users perform device-agnostic offering possibility enforce access control policy across variety devices smartphones tablets pcs identity-based security network security approach put forward cyberoam includes security components provides visibility control user activity particular network offers network security system includes user human identity part firewall rule matching criteria concept includes treating user identity eighth layer also known human layer network protocol stack thus attaching user identity security authenticating authorizing auditing network takes different step conventional security appliances bind security ip-addresses approach allows organisations create security policies align users groups rather ip addresses ultimately gives precise control access network—and access identity-based security prevents systems address spoofing attacks combining point encryption authentication access control single unit | [
2489,
3884,
651,
3411,
2566,
4304,
3923,
3794,
1805,
6305
] | Test |
1,369 | 5 | TOC_protocol:toc protocol toc protocol talk oscar protocol protocol used third-party aol instant messenger clients several clients aol produced sometime near august 19 2005 aol discontinued support protocol longer uses instant messaging clients actively maintains windows mac clients aol instant messenger icq systems however produce several toc clients including tik tac written tcl/tk tnt written emacs lisp open source java client originally called tic later became quick buddy web applet aol also provided toc protocol specification openly developers hopes use instead proprietary oscar protocol use july 2012 aol turned toc2 servers longer possible connect aim using protocol toc ascii-based protocol oscar binary protocol addition toc contained fewer features oscar counterpart oscar provides functionality buddy icons file transfer advertising toc acted wrapper oscar protocol grand scheme things toc server nothing oscar client happened listen socket translating messages two protocols upon login toc client specified oscar login server presumably either login.oscar.aol.com login.icq.com toc server used behalf client toc used flap encapsulate messages oscar however flap hacked way implemented port http server default toc server operated http mode indistinguishable typical web server connecting client place http request writes string flapon followed two crlfs toc would switch gears start reading flap messages upon getting user profile client expected re-connect toc use http server would host user profile html connected two basic message formats communications inside flap existed client-to-server messages sent format resembling unix-style command line commands whitespace-separated arguments quoting backslash escape sequences server-to-client messages much simpler sent colon-separated ascii strings manner similar many unix config files thus quite easy write client incoming messages easy parse outgoing commands easy generate contrast oscar due binary representation data difficult understand toc2 protocol updated version toc protocol talk oscar protocol existence never documented aol used aol instant messenger clients clients beginning offer plugins toc2 light aol recent shutdown toc servers like predecessor toc2 ascii protocol lacks features oscar unlike toc toc2 known support buddy icons receiving file transfers sending toc2 operates essentially way toc wrapper oscar porting code toc toc2 remarkably easy well similarities toc1.0 toc2.0 better defined differences | [
7148,
2450,
3172,
7967,
2555,
2284,
7170,
2201,
6624,
6629,
486,
1014,
4887,
1958,
1210,
2048,
2600,
3050,
2880,
4634,
6668,
5535
] | Test |
1,370 | 9 | POP-11:pop-11 pop-11 reflective incrementally compiled programming language many features interpreted language core language poplog programming environment developed originally university sussex recently school computer science university birmingham hosts poplog website pop-11 evolution language pop-2 developed edinburgh university features open stack model like forth among others mainly procedural supports declarative language constructs including pattern matcher mostly used research teaching artificial intelligence although features sufficient many classes problems often used introduce symbolic programming techniques programmers conventional languages like pascal find pop syntax familiar lisp one pop-11 features supports first-class functions pop-11 core language poplog system availability compiler compiler subroutines run-time requirement incremental compilation gives ability support far wider range extensions would possible using macro facility made possible incremental compilers added prolog common lisp standard ml could added required support either mixed language development development second language without using pop-11 constructs made possible poplog used teachers researchers developers interested one languages successful product developed pop-11 clementine data-mining system developed isl spss bought isl decided port clementine c++ java eventually succeeded great effort perhaps loss flexibility provided use ai language pop-11 time available part expensive commercial package poplog since 1999 freely available part open source version poplog including various additional packages teaching libraries online version eliza using pop-11 available birmingham university sussex david young used pop-11 combination c fortran develop suite teaching interactive development tools image processing vision made available popvision extension poplog example simple pop-11 program prints one includes list processing examples using pop-11 pattern matcher makes relatively easy students learn develop sophisticated list-processing programs without treat patterns tree structures accessed 'head 'tail functions car cdr lisp found online introductory tutorial matcher heart simagent sim_agent toolkit powerful features toolkit linking pattern variables inline code variables would difficult implement without incremental compiler facilities category lisp programming language family category artificial intelligence category history computing united kingdom category science technology east sussex category university sussex | [
4543,
1445,
3772,
4039,
1990
] | Test |
1,371 | 1 | History_of_Microsoft_SQL_Server:history microsoft sql server history microsoft sql server begins first microsoft sql server product sql server 1.0 16-bit server os/2 operating system 1989 extends current day june 12th 1988 microsoft joined ashton-tate sybase create variant sybase sql server ibm os/2 developed jointly microsoft released following year first version microsoft sql server served microsoft entry enterprise-level database market competing oracle ibm later sybase sql server 4.2 shipped 1992 bundled os/2 version 1.3 followed version 4.21 windows nt released alongside windows nt 3.1 sql server 6.0 first version designed nt include direction sybase time windows nt released july 1993 sybase microsoft parted ways pursued design marketing schemes microsoft negotiated exclusive rights versions sql server written microsoft operating systems 1996 sybase changed name product adaptive server enterprise avoid confusion microsoft sql server 1994 microsoft sql server carried three sybase copyright notices indication origin sql server 7.0 major rewrite c++ older sybase engine coded c. data pages enlarged 2k bytes 8k bytes extents thereby grew 16k bytes 64k bytes user mode scheduling ums introduced handle sql server threads better windows preemptive multi-threading also adding support fibers lightweight threads introduced nt 4.0 used avoid context switching sql server 7.0 also introduced multi-dimensional database product called sql olap services became analysis services sql server 2000 sql server 7.0 would last version run dec alpha platform although pre-release versions sql 2000 well windows 2000 compiled alpha canceled never commercially released sql server 2000 included modifications extensions sybase code base adding support ia-64 architecture mainstream support sql server 2005 legacy sybase code completely rewritten since release sql server 2000 advances made performance client ide tools several complementary systems packaged sql server 2005 include sql server 2000 also introduced many t-sql language enhancements table variables user-defined functions indexed views instead triggers cascading referential constraints basic xml support release service pack 3 microsoft also released first 64-bit version sql server itanium ia-64 platform confused x86-64 platform sql server relational engine sql agent ported itanium time client tools enterprise manager would still need run 32-bit x86 clients first release sql ia-64 version 8.00.760 build date february 6 2003 sql server 2005 formerly codenamed yukon released november 2005 included native support managing xml data addition relational data purpose defined codice_1 data type could used either data type database columns literals queries xml columns associated xsd schemas xml data stored verified schema xml converted internal binary data type stored database specialized indexing methods made available xml data xml data queried using xquery sql server 2005 added extensions t-sql language allow embedding xquery queries t-sql also defines new extension xquery called xml dml allows query-based modifications xml data sql server 2005 also allows database server exposed web services using tabular data stream tds packets encapsulated within soap protocol requests data accessed web services results returned xml common language runtime clr integration introduced version enabling one write sql code managed code clr relational data t-sql augmented error handling features try/catch support recursive queries ctes common table expressions sql server 2005 also enhanced new indexing algorithms syntax better error recovery systems data pages checksummed better error resiliency optimistic concurrency support added better performance permissions access control made granular query processor handles concurrent execution queries efficient way partitions tables indexes supported natively scaling database onto cluster easier sql clr introduced sql server 2005 let integrate .net framework sql server 2005 introduced multi-version concurrency control mvcc user facing features include new transaction isolation level called snapshot variation read committed isolation level based statement-level data snapshots sql server 2005 introduced mars multiple active results sets method allowing usage database connections multiple purposes sql server 2005 introduced dmvs dynamic management views specialized views functions return server state information used monitor health server instance diagnose problems tune performance sql server 2005 first version native support x64 platform service pack 1 sp1 sql server 2005 introduced database mirroring high availability option provides redundancy failover capabilities database level failover performed manually configured automatic failover automatic failover requires witness partner operating mode synchronous also known high-safety full safety database mirroring included first release sql server 2005 evaluation purposes prior sp1 enabled default supported microsoft extended support sql server 2005 ended april 12 2016 sql server 2008 formerly codenamed katmai released august 6 2008 announced sql server special interest group esri 2008 user conference august 6 2008 ed katibah spatial program manager microsoft aims make data management self-tuning self organizing self maintaining development sql server always technologies provide near-zero downtime sql server 2008 also includes support structured semi-structured data including digital media formats pictures audio video multimedia data current versions multimedia data stored blobs binary large objects generic bitstreams intrinsic awareness multimedia data allow specialized functions performed according paul flessner senior vice president server applications microsoft sql server 2008 data storage backend different varieties data xml email time/calendar file document spatial etc well perform search query analysis sharing synchronization across data types new data types include specialized date time types spatial data type location-dependent data better support unstructured semi-structured data provided using new filestream data type used reference file stored file system structured data metadata file stored sql server database whereas unstructured component stored file system files accessed via win32 file handling apis well via sql server using t-sql latter accesses file data blob backing restoring database backs restores referenced files well sql server 2008 also natively supports hierarchical data includes t-sql constructs directly deal without using recursive queries full-text search functionality integrated database engine according microsoft technical article simplifies management improves performance spatial data stored two types flat earth geometry planar data type represents geospatial data projected native spherical coordinate system plane round earth data type geography uses ellipsoidal model earth defined single continuous entity suffer singularities international dateline poles map projection zone edges approximately 70 methods available represent spatial operations open geospatial consortium simple features sql version 1.1 sql server includes better compression features also helps improving scalability enhanced indexing algorithms introduced notion filtered indexes also includes resource governor allows reserving resources certain users workflows also includes capabilities transparent encryption data tde well compression backups sql server 2008 supports ado.net entity framework reporting tools replication data definition built around entity data model sql server reporting services gain charting capabilities integration data visualization products dundas data visualization inc. acquired microsoft management side sql server 2008 includes declarative management framework allows configuring policies constraints entire database certain tables declaratively version sql server management studio included sql server 2008 supports intellisense sql queries sql server 2008 database engine sql server 2008 also makes databases available via windows powershell providers management functionality available cmdlets server running instances managed windows powershell final sql server 2008 service pack 10.00.6000 service pack 4 released september 30 2014 sql server 2008 r2 10.50.1600.1 formerly codenamed kilimanjaro announced teched 2009 released manufacturing april 21 2010 sql server 2008 r2 adds certain features sql server 2008 including master data management system branded master data services central management master data entities hierarchies also multi server management centralized console manage multiple sql server 2008 instances services including relational databases reporting services analysis services integration services sql server 2008 r2 includes number new services including powerpivot excel sharepoint master data services streaminsight report builder 3.0 reporting services add-in sharepoint data-tier function visual studio enables packaging tiered databases part application sql server utility named uc utility control point part amsm application multi-server management used manage multiple sql servers first sql server 2008 r2 service pack 10.50.2500 service pack 1 released july 11 2011 second sql server 2008 r2 service pack 10.50.4000 service pack 2 released july 26 2012 final sql server 2008 r2 service pack 10.50.6000 service pack 3 released september 26 2014 sql 2008 r2 would last version sql server run itanium ia-64 platform however x64 platform would continue force extended support sql server itanium would continue 2018 2011 professional association sql server pass summit october 11 microsoft announced next major version sql server codenamed denali would sql server 2012 released manufacturing march 6 2012 sql server 2012 service pack 1 released manufacturing november 9 2012 service pack 2 released manufacturing june 10 2014 announced last version natively support ole db instead prefer odbc native connectivity sql server 2012 new features enhancements include always sql server failover cluster instances availability groups provides set options improve database availability contained databases simplify moving databases instances new modified dynamic management views functions programmability enhancements including new spatial features metadata discovery sequence objects throw statement performance enhancements columnstore indexes well improvements online partition level operations security enhancements including provisioning setup new permissions improved role management default schema assignment groups sql server 2014 released manufacturing march 18 2014 released general public april 1 2014 build number 12.0.2000.8 release november 2013 two ctp revisions ctp1 ctp2 sql server 2014 provides new in-memory capability tables fit entirely memory also known hekaton whilst small tables may entirely resident memory versions sql server also may reside disk work involved reserving ram writing evicted pages disk loading new pages disk locking pages ram operated many tasks treating table guaranteed entirely resident memory much 'plumbing disk-based databases avoided disk-based sql server applications also provides ssd buffer pool extension improve performance cache ram spinning media sql server 2014 also enhances always hadr solution increasing readable secondaries count sustaining read operations upon secondary-primary disconnections provides new hybrid disaster recovery backup solutions microsoft azure enabling customers use existing skills on-premises version sql server take advantage microsoft global datacenters addition takes advantage new windows server 2012 windows server 2012 r2 capabilities database application scalability physical virtual environment microsoft provides three versions sql server 2014 downloading one runs microsoft azure sql server 2014 cab sql server 2014 iso sql server 2014 sp1 consisting primarily bugfixes released may 15 2015 sql server 2014 last version available x86/ia32 architecture official general availability ga release date sql server 2016 june 1 2016 rtm version 13.0.1601.5 sql server 2016 supported x64 processors longer supported x86 processors microsoft sql server 2017 recent version available microsoft launched sql server 2017 october 2nd 2017 along support linux | [
187,
6256,
895,
3849,
7715,
7071,
6986,
2924,
7080,
4697,
5055,
2226,
6462,
1670,
53,
941,
4985,
2702,
4739,
5617,
4743
] | Test |
1,372 | 4 | Tribe_Flood_Network:tribe flood network tribe flood network tfn set computer programs conduct various ddos attacks icmp flood syn flood udp flood smurf attack first tfn initiated attacks described cert incident note 99-04 tfn2k written mixter security professional hacker based germany | [
1412,
6459,
1691,
5125,
578,
3175,
5571,
1404,
1435
] | Train |
1,373 | 4 | Relying_party:relying party relying party rp computer term used refer server providing access secure software application claims-based applications claim statement entity makes order establish access also called relying party rp applications rps also called “ claims aware applications ” “ claims-based applications ” web applications services rps security token service sts rp redirects clients sts authenticates client issues security token containing set claims client identity present rp instead application authenticating user directly rp extract claims token use identity related tasks openid standard defines situation whereby cooperating site act rp allowing user log multiple sites using one set credentials user benefits share login credentials multiple sites operators cooperating site avoid develop login mechanism application demonstrating concept relying party software running mobile devices used granting user access software applications also secure building access without user enter credentials time | [
5702,
6143
] | Test |
1,374 | 5 | Multiplexer:multiplexer electronics multiplexer mux device selects several analog digital input signals forwards single output line multiplexer formula_1 inputs formula_2 select lines used select input line send output multiplexers mainly used increase amount data sent network within certain amount time bandwidth multiplexer also called data selector multiplexers also used implement boolean functions multiple variables electronic multiplexer makes possible several signals share one device resource example one a/d converter one communication line instead one device per input signal conversely demultiplexer demux device taking single input selecting signals output compatible mux connected single input shared selection line multiplexer often used complementary demultiplexer receiving end electronic multiplexer considered multiple-input single-output switch demultiplexer single-input multiple-output switch schematic symbol multiplexer isosceles trapezoid longer parallel side containing input pins short parallel side containing output pin schematic right shows 2-to-1 multiplexer left equivalent switch right formula_3 wire connects desired input output one use multiplexers economizing connections single channel connecting multiplexer single output demultiplexer single input image right demonstrates benefit case cost implementing separate channels data source higher cost inconvenience providing multiplexing/demultiplexing functions receiving end data link complementary demultiplexer usually required break single data stream back original streams cases far end system may functionality greater simple demultiplexer demultiplexing still occurs technically may never implemented discretely would typical multiplexer serves number ip network users feeds directly router immediately reads content entire link routing processor demultiplexing memory converted directly ip sections often multiplexer demultiplexer combined together single piece equipment conveniently referred multiplexer circuit elements needed ends transmission link communications systems transmit directions analog circuit design multiplexer special type analog switch connects one signal selected several inputs single output digital circuit design selector wires digital value case 2-to-1 multiplexer logic value 0 would connect formula_4 output logic value 1 would connect formula_5 output larger multiplexers number selector pins equal formula_6 formula_7 number inputs example 9 16 inputs would require fewer 4 selector pins 17 32 inputs would require fewer 5 selector pins binary value expressed selector pins determines selected input pin 2-to-1 multiplexer boolean equation formula_8 formula_9 two inputs formula_10 selector input formula_11 output expressed truth table simpler notation tables show formula_13 formula_14 formula_15 formula_16 straightforward realization 2-to-1 multiplexer would need 2 gates gate gate mathematically correct direct physical implementation would prone race conditions require additional gates suppress larger multiplexers also common stated require formula_6 selector pins formula_2 inputs common sizes 4-to-1 8-to-1 16-to-1 since digital logic uses binary values powers 2 used 4 8 16 maximally control number inputs given number selector inputs boolean equation 4-to-1 multiplexer following 4-to-1 multiplexer constructed 3-state buffers gates gates acting decoder subscripts formula_20 inputs indicate decimal value binary control inputs input let larger multiplexers constructed using smaller multiplexers chaining together example 8-to-1 multiplexer made two 4-to-1 one 2-to-1 multiplexers two 4-to-1 multiplexer outputs fed 2-to-1 selector pins 4-to-1 put parallel giving total number selector inputs 3 equivalent 8-to-1 7400 series several ics contain multiplexer demultiplexers take one data input number selection inputs several outputs forward data input one outputs depending values selection inputs demultiplexers sometimes convenient designing general purpose logic demultiplexer input always true demultiplexer acts decoder means function selection bits constructed logically or-ing correct set outputs x input selector b outputs formula_21 formula_22 7400 series several ics contain demultiplexer multiplexers also used programmable logic devices specifically implement boolean functions boolean function n variables one result implemented multiplexer n selector inputs variables connected selector inputs function result 0 1 possible combination selector inputs connected corresponding data input especially useful situations cost factor modularity ease modification one variables example also available inverted multiplexer n -1 selector inputs sufficient data inputs connected 0 1 according desired output combination selector inputs | [
5012,
1447,
5371,
3948,
7527,
7529,
5737,
4318,
2567,
7543,
4694,
5042,
1481,
5055,
2226,
1867,
7569,
416,
1127,
2248,
6148,
441,
2266,
453,
4392,
4047,
5483,
1556,
2659,
5487,
6198,
1568,
1570,
3724,
6922,
3731,
7666,
515,
8024,
5521,
... | Test |
1,375 | 5 | Orbital_angular_momentum_multiplexing:orbital angular momentum multiplexing orbital angular momentum oam multiplexing physical layer method multiplexing signals carried electromagnetic waves using orbital angular momentum electromagnetic waves distinguish different orthogonal signals orbital angular momentum one two forms angular momentum light oam distinct confused light spin angular momentum spin angular momentum light offers two orthogonal quantum states corresponding two states circular polarization demonstrated equivalent combination polarization multiplexing phase shifting oam hand relies extended beam light higher quantum degrees freedom come extension oam multiplexing thus access potentially unbounded set states offer much larger number channels subject constraints real-world optics although oam multiplexing promises significant improvements bandwidth used concert existing modulation multiplexing schemes still experimental technique far demonstrated laboratory following early claim oam exploits new quantum mode information propagation technique become controversial however nowadays understood particular form tightly modulated mimo multiplexing strategy obeying classical information theoretic bounds oam multiplexing demonstrated using light beams free space early 2004 since research oam proceeded two areas radio frequency optical transmission experiment 2011 demonstrated oam multiplexing two incoherent radio signals distance 442 m. claimed oam improve achieved conventional linear-momentum based rf systems already use mimo since theoretical work suggests radio frequencies conventional mimo techniques shown duplicate many linear-momentum properties oam-carrying radio beam leaving little extra performance gain november 2012 reports disagreement basic theoretical concept oam multiplexing radio frequencies research groups tamburini thide many different camps communications engineers physicists declaring belief oam multiplexing implementation mimo others holding assertion oam multiplexing distinct experimentally confirmed phenomenon 2014 group researchers described implementation communication link 8 millimetre-wave channels multiplexed using combination oam polarization-mode multiplexing achieve aggregate bandwidth 32 gbit/s distance 2.5 metres results agree well predictions severely limited distances made edfors et al industrial interest long-distance microwave oam multiplexing seems diminishing since 2015 original promoters oam-based communication radio frequencies including siae microelettronica published theoretical investigation showing real gain beyond traditional spatial multiplexing terms capacity overall antenna occupation oam multiplexing used optical domain 2012 researchers demonstrated oam-multiplexed optical transmission speeds 2.5 tbits/s using 8 distinct oam channels single beam light short free-space path roughly one metre work ongoing applying oam techniques long-range practical free-space optical communication links oam multiplexing implemented existing long-haul optical fiber systems since systems based single-mode fibers inherently support oam states light instead few-mode multi-mode fibers need used additional problem oam multiplexing implementation caused mode coupling present conventional fibers cause changes spin angular momentum modes normal conditions changes orbital angular momentum fibers bent stressed mode instability direct-detection oam multiplexing yet realized long-haul communications 2012 transmission oam states 97 purity 20 meters special fibers demonstrated researchers boston university later experiments shown stable propagation modes distances 50 meters improvements distance subject ongoing work ongoing research making oam multiplexing work future fibre-optic transmission systems includes possibility using similar techniques used compensate mode rotation optical polarization multiplexing alternative direct-detection oam multiplexing computationally complex coherent-detection mimo digital signal processing dsp approach used achieve long-haul communication strong mode coupling suggested beneficial coherent-detection-based systems paper bozinovic et al published science 2013 claims successful demonstration oam-multiplexed fiber-optic transmission system 1.1 km test path test system capable using 4 different oam channels simultaneously using fiber vortex refractive-index profile also demonstrated combined oam wdm using apparatus using two oam modes 2014 articles g. milione et al h. huang et al claimed first successful demonstration oam-multiplexed fiber-optic transmission system 5 km conventional optical fiber i.e. optical fiber circular core graded index profile contrast work bozinovic et al. used custom optical fiber vortex refractive-index profile work g. milione et al h. huang et al showed oam multiplexing could used commercially available optical fibers using digital mimo post-processing correct mode mixing within fiber method sensitive changes system change mixing modes propagation changes bending fiber requires substantial computation resources scale larger numbers independent modes shows great promise 2018 zengji yue haoran ren shibiao wei jiao lin min gu royal melbourne institute technology miniaturised technology shrinking size large dinner table small chip could integrated communications networks chip could predict increase capacity fibre-optic cables least 100-fold likely higher technology developed | [
1443,
3956,
5387,
7824,
2117,
740,
320,
4970,
8108,
3724,
6468,
84,
768,
2880,
5175,
1142,
1988
] | Test |
1,376 | 4 | Ransomware:ransomware ransomware type malware cryptovirology threatens publish victim data perpetually block access unless ransom paid simple ransomware may lock system way difficult knowledgeable person reverse advanced malware uses technique called cryptoviral extortion encrypts victim files making inaccessible demands ransom payment decrypt properly implemented cryptoviral extortion attack recovering files without decryption key intractable problem – difficult trace digital currencies ukash bitcoin cryptocurrency used ransoms making tracing prosecuting perpetrators difficult ransomware attacks typically carried using trojan disguised legitimate file user tricked downloading opening arrives email attachment however one high-profile example wannacry worm travelled automatically computers without user interaction starting around 2012 use ransomware scams grown internationally 181.5 million ransomware attacks first six months 2018 marks 229 increase time frame 2017 june 2014 vendor mcafee released data showing collected double number samples ransomware quarter quarter previous year cryptolocker particularly successful procuring estimated us 3 million taken authorities cryptowall estimated us federal bureau investigation fbi accrued us 18 million june 2015 concept file-encrypting ransomware invented implemented young yung columbia university presented 1996 ieee security privacy conference called cryptoviral extortion inspired fictional facehugger movie alien cryptoviral extortion following three-round protocol carried attacker victim symmetric key randomly generated assist victims point attacker private key exposed victims victim need send small ciphertext encrypted symmetric-cipher key attacker ransomware attacks typically carried using trojan entering system example malicious attachment embedded link phishing email vulnerability network service program runs payload locks system fashion claims lock system e.g. scareware program payloads may display fake warning purportedly entity law enforcement agency falsely claiming system used illegal activities contains content pornography pirated media payloads consist simply application designed lock restrict system payment made typically setting windows shell even modifying master boot record and/or partition table prevent operating system booting repaired sophisticated payloads encrypt files many using strong encryption encrypt victim files way malware author needed decryption key payment virtually always goal victim coerced paying ransomware removed either supplying program decrypt files sending unlock code undoes payload changes attacker may simply take money without returning victim files attacker best interest perform decryption agreed since victims stop sending payments becomes known serve purpose key element making ransomware work attacker convenient payment system hard trace range payment methods used including wire transfers premium-rate text messages pre-paid voucher services paysafecard digital currency bitcoin 2016 survey commissioned citrix claimed larger businesses holding bitcoin contingency plans first known malware extortion attack aids trojan written joseph popp 1989 design failure severe necessary pay extortionist payload hid files hard drive encrypted names displayed message claiming user license use certain piece software expired user asked pay us 189 pc cyborg corporation order obtain repair tool even though decryption key could extracted code trojan trojan also known pc cyborg popp declared mentally unfit stand trial actions promised donate profits malware fund aids research idea abusing anonymous cash systems safely collect ransom human kidnapping introduced 1992 sebastiaan von solms david naccache electronic money collection method also proposed cryptoviral extortion attacks von solms-naccache scenario newspaper publication used since bitcoin ledgers exist time paper written notion using public key cryptography data kidnapping attacks introduced 1996 adam l. young moti yung young yung critiqued failed aids information trojan relied symmetric cryptography alone fatal flaw decryption key could extracted trojan implemented experimental proof-of-concept cryptovirus macintosh se/30 used rsa tiny encryption algorithm tea hybrid encrypt victim data since public key crypto used cryptovirus contains encryption key attacker keeps corresponding private decryption key private young yung original experimental cryptovirus victim send asymmetric ciphertext attacker deciphers returns symmetric decryption key contains victim fee long electronic money existed young yung proposed electronic money could extorted encryption well stating virus writer effectively hold money ransom half given even e-money previously encrypted user use user gets encrypted cryptovirus referred attacks cryptoviral extortion overt attack part larger class attacks field called cryptovirology encompasses overt covert attacks cryptoviral extortion protocol inspired parasitic relationship h. r. giger facehugger host movie alien examples extortionate ransomware became prominent may 2005 mid-2006 trojans gpcode troj.ransom.a archiveus krotten cryzip mayarchive began utilizing sophisticated rsa encryption schemes ever-increasing key-sizes gpcode.ag detected june 2006 encrypted 660-bit rsa public key june 2008 variant known gpcode.ak detected using 1024-bit rsa key believed large enough computationally infeasible break without concerted distributed effort encrypting ransomware returned prominence late 2013 propagation cryptolocker—using bitcoin digital currency platform collect ransom money december 2013 zdnet estimated based bitcoin transaction information 15 october 18 december operators cryptolocker procured us 27 million infected users cryptolocker technique widely copied months following including cryptolocker 2.0 thought related cryptolocker cryptodefense initially contained major design flaw stored private key infected system user-retrievable location due use windows built-in encryption apis august 2014 discovery trojan specifically targeting network-attached storage devices produced synology january 2015 reported ransomware-styled attacks occurred individual websites via hacking ransomware designed target linux-based web servers microsoft malware protection center identified trend away wsf files favour lnk files powershell scripting lnk shortcut files install locky ransomware automating infection operations rather relying traditional user downloads wsf files—all made possible universal powershell windows application unfortunately cybercriminals able leverage powershell attacks years recent report application found involved nearly 40 endpoint security incidents attackers finding weaknesses windows operating system years ’ clear ’ something problematic powershell scripting ransomware strains used proxies tied tor hidden services connect command control servers increasing difficulty tracing exact location criminals furthermore dark web vendors increasingly started offer technology service symantec classified ransomware dangerous cyber threat august 2010 russian authorities arrested nine individuals connected ransomware trojan known winlock unlike previous gpcode trojan winlock use encryption instead winlock trivially restricted access system displaying pornographic images asked users send premium-rate sms costing around us 10 receive code could used unlock machines scam hit numerous users across russia neighbouring countries—reportedly earning group us 16 million 2011 ransomware trojan surfaced imitated windows product activation notice informed users system windows installation re-activated due victim fraud online activation option offered like actual windows activation process unavailable requiring user call one six international numbers input 6-digit code malware claimed call would free routed rogue operator country high international phone rates placed call hold causing user incur large international long distance charges february 2013 ransomware trojan based stamp.ek exploit kit surfaced malware distributed via sites hosted project hosting services sourceforge github claimed offer fake nude pics celebrities july 2013 os x-specific ransomware trojan surfaced displays web page accuses user downloading pornography unlike windows-based counterparts block entire computer simply exploits behaviour web browser frustrate attempts close page normal means july 2013 21-year-old man virginia whose computer coincidentally contain pornographic photographs underage girls conducted sexualized communications turned police receiving deceived ransomware purporting fbi message accusing possessing child pornography investigation discovered incriminating files man charged child sexual abuse possession child pornography converse ransomware cryptovirology attack invented adam l. young threatens publish stolen information victim computer system rather deny victim access leakware attack malware exfiltrates sensitive host data either attacker alternatively remote instances malware attacker threatens publish victim data unless ransom paid attack presented west point 2003 summarized book malicious cryptography follows attack differs extortion attack following way extortion attack victim denied access valuable information pay get back attack presented victim retains access information disclosure discretion computer virus attack rooted game theory originally dubbed non-zero sum games survivable malware attack yield monetary gain cases malware acquires access information may damage victim user organization e.g. reputational damage could result publishing proof attack success increased popularity ransomware pc platforms ransomware targeting mobile operating systems also proliferated typically mobile ransomware payloads blockers little incentive encrypt data since easily restored via online synchronization mobile ransomware typically targets android platform allows applications installed third-party sources payload typically distributed apk file installed unsuspecting user may attempt display blocking message top applications another used form clickjacking cause user give device administrator privileges achieve deeper access system different tactics used ios devices exploiting icloud accounts using find iphone system lock access device ios 10.3 apple patched bug handling javascript pop-up windows safari exploited ransomware websites recently shown ransomware may also target arm architectures like found various internet-of-things iot devices industrial iot edge devices august 2019 researchers demonstrated possible infect dslr cameras ransomware digital cameras often use picture transfer protocol ptp standard protocol used transfer files researchers found possible exploit vulnerabilities protocol infect target camera ransomware execute arbitrary code attack presented defcon security conference las vegas proof concept attack actual armed malware 2012 major ransomware trojan known reveton began spread based citadel trojan based zeus trojan payload displays warning purportedly law enforcement agency claiming computer used illegal activities downloading unlicensed software child pornography due behaviour commonly referred police trojan warning informs user unlock system would pay fine using voucher anonymous prepaid cash service ukash paysafecard increase illusion computer tracked law enforcement screen also displays computer ip address versions display footage victim webcam give illusion user recorded reveton initially began spreading various european countries early 2012 variants localized templates branded logos different law enforcement organizations based user country example variants used united kingdom contained branding organizations metropolitan police service police national e-crime unit another version contained logo royalty collection society prs music specifically accused user illegally downloading music statement warning public malware metropolitan police clarified would never lock computer way part investigation may 2012 trend micro threat researchers discovered templates variations united states canada suggesting authors may planning target users north america august 2012 new variant reveton began spread united states claiming require payment 200 fine fbi using moneypak card february 2013 russian citizen arrested dubai spanish authorities connection crime ring using reveton ten individuals arrested money laundering charges august 2014 avast software reported found new variants reveton also distribute password-stealing malware part payload encrypting ransomware reappeared september 2013 trojan known cryptolocker generated 2048-bit rsa key pair uploaded turn command-and-control server used encrypt files using whitelist specific file extensions malware threatened delete private key payment bitcoin pre-paid cash voucher made within 3 days infection due extremely large key size uses analysts affected trojan considered cryptolocker extremely difficult repair even deadline passed private key could still obtained using online tool price would increase 10 btc—which cost approximately us 2300 november 2013 cryptolocker isolated seizure gameover zeus botnet part operation tovar officially announced u.s. department justice 2 june 2014 department justice also publicly issued indictment russian hacker evgeniy bogachev alleged involvement botnet estimated least us 3 million extorted malware shutdown september 2014 wave ransomware trojans surfaced first targeted users australia names cryptowall cryptolocker cryptolocker 2.0 unrelated original cryptolocker trojans spread via fraudulent e-mails claiming failed parcel delivery notices australia post evade detection automatic e-mail scanners follow links page scan malware variant designed require users visit web page enter captcha code payload actually downloaded preventing automated processes able scan payload symantec determined new variants identified cryptolocker.f unrelated original cryptolocker due differences operation notable victim trojans australian broadcasting corporation live programming television news channel abc news 24 disrupted half hour shifted melbourne studios due cryptowall infection computers sydney studio another trojan wave torrentlocker initially contained design flaw comparable cryptodefense used keystream every infected computer making encryption trivial overcome however flaw later fixed late-november 2014 estimated 9,000 users infected torrentlocker australia alone trailing turkey 11,700 infections another major ransomware trojan targeting windows cryptowall first appeared 2014 one strain cryptowall distributed part malvertising campaign zedo ad network late-september 2014 targeted several major websites ads redirected rogue websites used browser plugin exploits download payload barracuda networks researcher also noted payload signed digital signature effort appear trustworthy security software cryptowall 3.0 used payload written javascript part email attachment downloads executables disguised jpg images evade detection malware creates new instances explorer.exe svchost.exe communicate servers encrypting files malware also deletes volume shadow copies installs spyware steals passwords bitcoin wallets fbi reported june 2015 nearly 1,000 victims contacted bureau internet crime complaint center report cryptowall infections estimated losses least 18 million recent version cryptowall 4.0 enhanced code avoid antivirus detection encrypts data files also file names fusob one major mobile ransomware families april 2015 march 2016 56 percent accounted mobile ransomware fusob like typical mobile ransomware employs scare tactics extort people pay ransom program pretends accusatory authority demanding victim pay fine 100 200 usd otherwise face fictitious charge rather surprisingly fusob suggests using itunes gift cards payment also timer clicking screen adds users ’ anxiety well order infect devices fusob masquerades pornographic video player thus victims thinking harmless unwittingly download fusob fusob installed first checks language used device uses russian certain eastern european languages fusob nothing otherwise proceeds lock device demand ransom among victims 40 germany united kingdom united states following 14.5 11.4 respectively fusob lots common small another major family mobile ransomware represented 93 mobile ransomware 2015 2016 may 2017 wannacry ransomware attack spread internet using exploit vector named eternalblue leaked u.s. national security agency ransomware attack unprecedented scale infected 230,000 computers 150 countries using 20 different languages demand money users using bitcoin cryptocurrency wannacry demanded us 300 per computer attack affected telefónica several large companies spain well parts british national health service nhs least 16 hospitals turn away patients cancel scheduled operations fedex deutsche bahn honda renault well russian interior ministry russian telecom megafon attackers gave victims 7-day deadline day computers got infected encrypted files would deleted petya first discovered march 2016 unlike forms encrypting ransomware malware aimed infect master boot record installing payload encrypts file tables ntfs file system next time infected system boots blocking system booting windows ransom paid check point reported despite believed innovative evolution ransomware design resulted relatively-fewer infections ransomware active around time frame 27 june 2017 heavily modified version petya used global cyberattack primarily targeting ukraine affecting many countries version modified propagate using eternalblue exploit used wannacry due another design change also unable actually unlock system ransom paid led security analysts speculating attack meant generate illicit profit simply cause disruption 24 october 2017 users russia ukraine reported new ransomware attack named bad rabbit follows similar pattern wannacry petya encrypting user file tables demands bitcoin payment decrypt eset believed ransomware distributed bogus update adobe flash software among agencies affected ransomware interfax odessa international airport kiev metro ministry infrastructure ukraine used corporate network structures spread ransomware also discovered countries including turkey germany poland japan south korea united states experts believed ransomware attack tied petya attack ukraine especially bad rabbit code many overlapping analogical elements code petya/notpetya appending crowdstrike bad rabbit notpetya dll dynamic link library share 67 percent code though identity culprits names characters game thrones series embedded within code security experts found ransomware use eternalblue exploit spread simple method vaccinate unaffected machine running older windows versions found 24 october 2017 sites used spread bogus flash updating gone offline removed problematic files within days discovery effectively killing spread bad rabbit 2016 new strain ransomware emerged targeting jboss servers strain named samsam found bypass process phishing illicit downloads favor exploiting vulnerabilities weak servers malware uses remote desktop protocol brute-force attack guess weak passwords one broken virus behind attacks government healthcare targets notable hacks occurring town farmington new mexico colorado department transportation davidson county north carolina recently major breach security infrastructure atlanta mohammad mehdi shah mansouri born qom iran 1991 faramarz shahi savandi born shiraz iran 1984 wanted fbi allegedly launching samsam ransomware two allegedly made 6 million extortion caused 30 million damages using malware forms malware security software antivirus software might detect ransomware payload especially case encrypting payloads encryption way complete particularly new version unknown protective software distributed attack suspected detected early stages takes time encryption take place immediate removal malware relatively simple process completed would stop damage data without salvaging already lost security experts suggested precautionary measures dealing ransomware using software security policies block known payloads launching help prevent infection protect attacks keeping offline backups data stored locations inaccessible potentially infected computer external storage drives devices access network including internet prevents accessed ransomware installing security updates issued software vendors mitigate vulnerabilities leveraged certain strains propagate measures include cyber hygiene − exercising caution opening e-mail attachments links network segmentation keeping critical computers isolated networks furthermore mitigate spread ransomware measures infection control applied may include disconnecting infected machines networks educational programs effective communication channels malware surveillance ways collective participation number file systems keep snapshots data hold used recover contents files time prior ransomware attack event ransomware n't disable number tools intended specifically decrypt files locked ransomware although successful recovery may possible encryption key used files decryption tools use files uncorrupted backups encrypted copies known-plaintext attack jargon cryptanalysis works cipher attacker used weak begin vulnerable known-plaintext attack recovery key possible may take several days free ransomware decryption tools help decrypt files encrypted following forms ransomware aes_ni alcatraz locker apocalypse badblock bart btcware crypt888 cryptomix crysis encryptile findzip globe hidden tear jigsaw lambdalocker legion noobcrypt stampado szflocker teslacrypt xdata addition old copies files may exist disk previously deleted cases deleted versions may still recoverable using software designed purpose ransomware malicious software evolved since beginnings confined one two countries eastern europe spread across atlantic united states canada first versions type malware used various techniques disable computers locking victims system machine locker ransomware 133 examples ransomware works include locking screen displaying message branch local law enforcement indicating user ’ lines like “ browsed illicit materials must pay fine ” first seen russia year 2009 claiming message microsoft also used request payment sending sms message premium rate number next variant displayed pornographic image content demanded payment removal 2011 tactics changed attackers started use electronic payment methods added languages messages also changed based user ’ location obtained geo-locating user ’ ip addresses end users affected attacks corporations private entities government even hospitals also affected example healthcare although 2015 year largest ephi data breaches occurred according onc 2016 year ransomware started increase exponentially market according 2017 internet security threat report symantec corp ransomware affects systems also patient care clinical operations billing online criminals found “ easy money made healthcare ” according symantec report developed data insurance claims u.s. department health human services hhs ransomware growing rapidly across internet users also iot environment creates challenging problem infosec increasing attack surface area evolving sophisticated attacks becoming resistant time also accessible ever today cheap price attackers access ransomware service big problem millions dollars lost organizations industries decided pay hollywood presbyterian medical center medstar health end pressure offer services patients keep lives critical forced pay attacker knows problem paying ransom funding cybercrime according symantec 2019 istr report first time since 2013 2018 observed decrease ransomware activity drop 20 percent 2017 consumers preferred victims 2017 changed dramatically moved enterprises 2018 path accelerated 81 percent infections represented 12 percent increase common distribution method today based email campaigns cyber awareness training crucial detecting attacks whereas technology protect careless foolish behavior important organizations help users recognize malicious contact whereas ransomware typically introduced email social engineering techniques either download file provide key sensitive information take action bring harm organization according knowbe4 osterman report number approaches security awareness training practiced organizations managed security teams break room approach special meetings periodically held talk security monthly security videos short snippets security information simulated phishing tests target users internal phishing messages human firewall approach everyone subject simulated phishing employees prone attack identified do-nothing approach cyber awareness training exist organization effective successful cyber awareness training program must sponsored top organization supporting policies procedures effectively outline ramifications non-compliance frequency training process acknowledgement training without sponsorship “ c-level ” executives training ignored factors key successful cyber awareness training program establish baseline identifying level knowledge organization establish users knowledge prior training whichever approach organization decides implement important organization policies procedures place provide training date performed frequently backing entire organization top investment technology detect stop threats must maintained along need remember focus weakest link user publication proof-of-concept attack code common among academic researchers vulnerability researchers teaches nature threat conveys gravity issues enables countermeasures devised put place however lawmakers support law-enforcement bodies contemplating making creation ransomware illegal state maryland original draft hb 340 made felony create ransomware punishable 10 years prison however provision removed final version bill minor japan arrested creating distributing ransomware code young yung ansi c source code ransomware cryptotrojan on-line cryptovirology.com since 2005 part cryptovirology book written source code cryptotrojan still live internet associated draft chapter 2 | [
704,
2173,
3932,
7151,
6417,
6419,
1821,
2912,
376,
1456,
1461,
2923,
3277,
2566,
1847,
7186,
2577,
5401,
744,
6823,
2587,
7571,
1123,
6844,
3323,
5779,
74,
3338,
7600,
3680,
3681,
88,
5452,
91,
4025,
6505,
6511,
5099,
1528,
5808,
6515,... | Test |
1,377 | 2 | OFono:ofono ofono free software project mobile telephony gsm/umts applications built 3gpp standards uses high-level d-bus api use telephony applications ofono free software released terms gnu general public license v2 ofono jointly announced linux intel nokia nokia since shipped ofono meego-based n9 meego project ended intel collaborated samsung new linux-based project named tizen first release tizen contained another telephony stack 2012 announced replace ofono early 2013 canonical ltd announced ubuntu touch also uses ofono another successor project meego sailfish os also uses ofono telephony since version 1.4 released august 2016 networkmanager use ofono modem manager | [
2182,
3262,
3613,
7528,
7532,
4685,
6440,
5744,
6443,
742,
4341,
5762,
6133,
3666,
1904,
5453,
7242,
1535,
1924,
6892,
1176,
1933,
496,
1202,
1208,
6211,
5865,
7669,
2332,
520,
1227,
1596,
6945,
165,
7312,
1607,
5884,
1991,
4840,
3082,
... | Test |
1,378 | 9 | Instance_variable:instance variable object-oriented programming classes instance variable variable defined class i.e member variable instantiated object class separate copy instance instance variable similar class variable instance variable variable declared class outside constructor method/function instance variables created object instantiated accessible methods constructor block class access modifiers given instance variable instance variable class variable although similarities type class attribute class property field data member dichotomy instance class members applies methods member functions well class may instance methods class methods instance variable lives memory life object owned variables properties object knows instances object copies instance variables even value one object another one object instance change values instance variables without affecting instances instance variables used methods class unless method declared static c++ example instance variable codice_1 copy class variable codice_2 instance constructed assigned sequential value codice_3 incremented since codice_4 instance variable codice_5 object contains distinct value contrast one object codice_2 available instances value | [
1437,
8106,
3169,
1420,
4151,
1803,
6428,
4425
] | Test |
1,379 | 3 | Gran_Turismo_official_steering_wheel:gran turismo official steering wheel gran turismo official steering wheels gt force driving force see trademark symbols difference series steering wheels designed logitech a.k.a logicool japan collaboration polyphony digital racing games controllers designed used playstation 2 playstation 3 systems later models used pc well due usb connection gt force central part driving simulation cockpit installation official kits co-designed released japan logicool sparco distributed import tuner endless north america compatible kits designed released worldwide european manufacturers playseat® movetech features common models include features vary models original gt force first came japan south east asia 2001 later released north america europe brand soon evolved driving force logitech distributed territories code product lprc logicool playstation racing controller 2007 gt force line-up made three wheels entry-level gt force rx replacing discontinued driving force type 79.99 usd/eur medium-level gt force pro 129.98 usd/eur g25 racing wheel replaced first top level 299.99 usd/eur compatible playstation 2 playstation 3 windows pc systems supported gran turismo 5 prologue gt force lprc-10000 rebranded logitech wingman formula gp blue rather yellow rubber grip released april 28 2001 official wheel gt force gran turismo 2000 lprc-10001 scheduled 2001 however due game title change replaced gt force gran turismo 3 a-spec custom version released april 28 2001 june 26 2003 logicool released initial special stage custom version gt force lprc-10000 driving force first evolution gt force announced london games convention early september 2001 model discontinued since replaced driving force pro 2003 driving force pro also known gt force pro lprc-11000 gran turismo 4 prologue official wheel released december 2003 sega rally 2006 custom version named released january 12 2006 manufactured logitech playstation 2 primarily well compatible select pc games wheel featured force feedback 900 degree rotation wheel offers analogue accelerator brake pedals sequential gear shift side paddle shifters mounted back wheel addition standard playstation 2 buttons controller jointly designed logitech polyphony digital used gran turismo 4 however works games compatible 900 degree rotation switching 200 degree mode wheel received strong praise reviewers launch overall good experience paired gran turismo 4 logitech website lists playstation 3 system requirements indicating supported 900° support software dependent driving force ex also known gt force rx lprc-12000 driving force rx retail version playstation 3 official wheel released console launch date november 11 2006 features force feedback succeeded driving force gt wheel came bundled formula one championship edition driving force gt released december 13 2007 developed conjunction polyphony digital first introduced 2007 tokyo game show intended use gran turismo 5 prologue gran turismo 5 playstation 3 auto racing games driving force gt fifth entry company driving force series game controllers g25 racing wheel lprc-13000 unveiled october 25 2007 released december 13 2007 currently matching official racing cockpit available official gt steering wheel fully compatible updates officially supported gt5 gt6 g27 racing wheel based upon previous g25 new features like g25 g27 also official gt steering wheel fully compatible updates officially supported gt5 gt6 g29 driving force racing wheel based upon g27 driving force gt compatible playstation 3 playstation 4 pc released 2015 replace g27 like g27 also official gran turismo steering wheel however supported gran turismo latest installment gran turismo sport | [
3304,
3704,
4011
] | Train |
1,380 | 4 | National_White_Collar_Crime_Center:national white collar crime center national white collar crime center also known nw3c congressionally funded non-profit corporation trains state local law enforcement agencies combat emerging economic cyber crime problems nw3c provides general public information research preventing economic cyber crime national white collar crime center provides training investigative support research organizations involved preventing investigating prosecuting economic high tech crime | [
3480,
4523,
3179,
1805
] | Test |
1,381 | 9 | John_Backus:john backus john warner backus december 3 1924 – march 17 2007 american computer scientist directed team invented implemented fortran first widely used high-level programming language inventor backus–naur form bnf widely used notation define formal language syntax later research function-level programming paradigm presenting findings influential 1977 turing award lecture programming liberated von neumann style ieee awarded backus w. w. mcdowell award 1967 development fortran received national medal science 1975 1977 acm turing award profound influential lasting contributions design practical high-level programming systems notably work fortran publication formal procedures specification programming languages retired 1991 died home ashland oregon march 17 2007 backus born philadelphia grew nearby wilmington delaware studied hill school pottstown pennsylvania apparently diligent student entering university virginia study chemistry quit conscripted u.s. army began medical training haverford college internship hospital diagnosed cranial bone tumor successfully removed plate installed head ended medical training nine months subsequent operation replace plate one design moving new york city trained initially radio technician became interested mathematics graduated columbia university bachelor degree 1949 master degree 1950 mathematics joined ibm 1950 first three years worked selective sequence electronic calculator ssec first major project write program calculate positions moon 1953 backus developed language speedcoding first high-level language created ibm computer aid software development ibm 701 computer programming difficult time 1954 backus assembled team define develop fortran ibm 704 computer fortran first high-level programming language put broad use backus served international committees developed algol 58 influential algol 60 quickly became de facto worldwide standard publishing algorithms backus developed backus–naur form bnf unesco report algol 58 formal notation able describe context-free programming language important development compilers deviations approach tried—notably lisp apl—but 1970s following development automated compiler generators yacc backus–naur context-free specifications computer languages become quite standard contribution helped backus win turing award 1977 backus later worked function-level programming language known fp described turing award lecture programming liberated von neumann style sometimes viewed backus apology creating fortran paper less garner interest fp language spark research functional programming general backus publicized function-level style programming message mostly misunderstood traditional functional programming style languages fp strongly inspired kenneth e. iverson apl even using non-standard character set fp interpreter distributed 4.2bsd unix operating system relatively implementations language used educational purposes backus spent latter part career developing fl function level successor fp fl internal ibm research project development language stopped project finished papers documenting remain source code compiler described made public fl odds functional programming languages developed 1980s based lambda calculus static typing systems instead apl concatenation primitive operations many language ideas implemented versions j programming language iverson successor apl | [
3166,
7707,
4929,
1361,
1270,
4864,
1549,
3630,
1746,
1381,
6367,
3470,
7009,
7375,
43,
1114,
3895,
1774,
3570,
1308,
5424,
7489,
6485,
4543,
7863,
1600,
5784,
1892,
5703,
6146,
6497,
6778,
2803,
5621,
360
] | Test |
1,382 | 6 | Encrypting_File_System:encrypting file system encrypting file system efs microsoft windows feature introduced version 3.0 ntfs provides filesystem-level encryption technology enables files transparently encrypted protect confidential data attackers physical access computer efs available versions windows developed business environments see supported operating systems windows 2000 onwards default files encrypted encryption enabled users per-file per-directory per-drive basis efs settings also mandated via group policy windows domain environments cryptographic file system implementations operating systems available microsoft efs compatible see also list cryptographic file systems operating system running system without file encryption access files normally goes os-controlled user authentication access control lists however attacker gains physical access computer barrier easily circumvented one way example would remove disk put another computer os installed read filesystem another would simply reboot computer boot cd containing os suitable accessing local filesystem widely accepted solution store files encrypted physical media disks usb pen drives tapes cds microsoft windows family operating systems efs enables measure although ntfs drives using combination public key cryptography symmetric key cryptography make decrypting files extremely difficult without correct key however cryptography keys efs practice protected user account password therefore susceptible password attacks words encryption file strong password unlock decryption key efs works encrypting file bulk symmetric key also known file encryption key fek uses symmetric encryption algorithm takes less time encrypt decrypt large amounts data asymmetric key cipher used symmetric encryption algorithm used vary depending version configuration operating system see algorithms used windows version fek symmetric key used encrypt file encrypted public key associated user encrypted file encrypted fek stored efs alternative data stream encrypted file decrypt file efs component driver uses private key matches efs digital certificate used encrypt file decrypt symmetric key stored efs stream efs component driver uses symmetric key decrypt file encryption decryption operations performed layer ntfs transparent user applications folders whose contents encrypted file system marked encryption attribute efs component driver treats encryption attribute way analogous inheritance file permissions ntfs folder marked encryption default files subfolders created folder also encrypted encrypted files moved within ntfs volume files remain encrypted however number occasions file could decrypted without user explicitly asking windows files folders decrypted copied volume formatted another file system like fat32 finally encrypted files copied network using smb/cifs protocol files decrypted sent network significant way preventing decryption-on-copy using backup applications aware raw apis backup applications implemented raw apis simply copy encrypted file stream efs alternative data stream single file words files copied e.g backup file encrypted form decrypted backup starting windows vista user private key stored smart card data recovery agent dra keys also stored smart card two significant security vulnerabilities existed windows 2000 efs variously targeted since windows 2000 local administrator default data recovery agent capable decrypting files encrypted efs local user efs windows 2000 function without recovery agent always someone decrypt encrypted files users non-domain-joined windows 2000 computer susceptible unauthorized efs decryption anyone take local administrator account trivial given many tools available freely internet windows xp later default local data recovery agent requirement one setting syskey mode 2 3 syskey typed bootup stored floppy disk mitigate risk unauthorized decryption local administrator account local user password hashes stored sam file encrypted syskey syskey value available offline attacker possess syskey passphrase/floppy windows 2000 user rsa private key stored truly encrypted form also backup user rsa private key weakly protected attacker gains physical access windows 2000 computer resets local user account password attacker log user recovery agent gain access rsa private key decrypt files backup user rsa private key encrypted lsa secret accessible attacker elevate login localsystem trivial given numerous tools internet windows xp beyond user rsa private key backed using offline public key whose matching private key stored one two places password reset disk windows xp member domain active directory windows xp member domain means attacker authenticate windows xp localsystem still access decryption key stored pc hard drive windows 2000 xp later user rsa private key encrypted using hash user ntlm password hash plus user name – use salted hash makes extremely difficult reverse process recover private key without knowing user passphrase also setting syskey mode 2 3 syskey typed bootup stored floppy disk mitigate attack since local user password hash stored encrypted sam file user logged successfully access efs encrypted data requires additional authentication decryption happens transparently thus compromise user password automatically leads access data windows store versions user account passphrases reversible encryption though longer default behaviour also configured store default original version windows xp lower lan manager hashes local user account passphrases attacked broken easily also stores local user account passphrases ntlm hashes fairly easily attacked using rainbow tables passwords weak windows vista later versions n't allow weak passwords default mitigate threat trivial brute-force attacks local passphrases older versions windows need configured using security settings portion group policy never store lm hashes course enable autologon stores plaintext passphrases registry using local user account passphrases 14 characters long prevents windows storing lm hash sam – added benefit making brute-force attacks ntlm hash harder encrypting files efs – converting plaintext files encrypted files – plaintext files wiped simply deleted i.e data blocks flagged use filesystem means unless example happen stored ssd trim support easily recovered unless overwritten fully mitigate known non-challenging technical attacks efs configure encryption folder level temporary files like word document backups created directories also encrypted wish encrypt individual files copy encrypted folder encrypt file place securely wipe disk volume use windows cipher utility /w option wipe free space including still contains deleted plaintext files various third-party utilities may work well anyone gain administrators access overwrite override change data recovery agent configuration serious issue since attacker example hack administrator account using third-party tools set whatever dra certificate want data recovery agent wait sometimes referred two-stage attack significantly different scenario risk due lost stolen pc highlights risk due malicious insiders user encrypts files first stage attack feks automatically encrypted designated dra public key attacker needs access computer administrator gain full access subsequently efs-encrypted files even using syskey mode 2 3 protect attack attacker could back encrypted files offline restore elsewhere use dra private key decrypt files course malicious insider gain physical access computer might consider security features irrelevant could also install rootkits software even hardware keyloggers etc computer – potentially much interesting effective overwriting dra policy files encrypted efs decrypted using rsa private key matching previously used public key stored copy user private key ultimately protected user logon password accessing encrypted files outside windows operating systems linux example possible — least currently third party efs component driver using special tools reset user login password render impossible decrypt user private key thus useless gaining access user encrypted files significance occasionally lost users resulting data loss user forgets password fails back encryption key led coining term delayed recycle bin describe seeming inevitability data loss inexperienced user encrypts files efs configured use keys issued public key infrastructure pki configured enable key archival recovery encrypted files recovered recovering private key first operating systems file systems native support efs windows efs supports range symmetric encryption algorithms depending version windows use files encrypted | [
3599,
7879,
1812,
3937,
2547,
3263,
7161,
4672,
6088,
378,
2198,
6431,
6096,
3626,
2566,
1475,
5049,
7553,
6458,
6117,
7195,
5410,
7564,
2953,
759,
422,
5773,
6844,
1130,
2245,
6488,
6854,
5437,
435,
1140,
5440,
5442,
4014,
4375,
4377,
... | Test |
1,383 | 7 | Gameover_ZeuS:gameover zeus gameover zeus peer-to-peer botnet based components earlier zeus trojan malware created evgeniy mikhailovich bogachev russia believed spread use cutwail botnet unlike predecessor zeus trojan gameover zeus uses encrypted peer-to-peer communication system communicate nodes command control servers greatly reducing vulnerability law enforcement operations algorithm used appears modeled kademlia p2p protocol scammers control monitor gameover zeus via command control c c server virus establishes connection server soon malicious executable installs computer disables certain system processes download launch executables even delete essential system files easily bricking device according report symantec gameover zeus largely used banking fraud distribution cryptolocker ransomware early june 2014 u.s. department justice announced international inter-agency collaboration named operation tovar succeeded temporarily cutting communication gameover zeus command control servers effort shut evgeniy mikhailovich bogachev criminal infrastructure liberate computers infected gameover zeus indicted united states accused creating sprawling network virus-infected computers siphon hundreds millions dollars bank accounts around world targeting anyone enough money worth stealing widely circulated photo pictured holding domestic bengal cat bitdefender identified two gameover zeus variants wild one generates 1,000 domains per day generates 10,000 per day 24 february 2015 fbi announced reward 3 million exchange information regarding alleged russian cyber criminal evgeniy mikhailovich bogachev known online aliases « slavik » « lucky12345 » « pollingsoon » « monstr » « ioo » « nu11 » suspected association gameover zeus fbi reward 3 million highest ever cybercriminal | [
704,
3932,
2912,
376,
3277,
2923,
3281,
7186,
1482,
2587,
3323,
5779,
7600,
4025,
1528,
2991,
1173,
6526,
6904,
6541,
6194,
7657,
2678,
3038,
3047,
6569,
2693,
862,
7307,
6589,
5187,
1996,
7328,
2733,
208,
2021,
5922,
6628,
924,
4531,
6... | Validation |
1,384 | 4 | Co-managed_Security:co-managed security co-managed security service model entails security monitoring event correlation incident response system tuning compliance support across organization entire environment co-management allows organizations collaborate service providers blending security expertise provider contextual knowledge customer optimize security posture co-managed security services also allow organizations ’ critical data tools remotely managed team certified engineers security analysts 24/7/365 security operations center soc service approach allows customer data remain in-house siem platform either on-site cloud-hosted service provider staff works conjunction customer security teams outline rules engagement inside environment provide monitoring respond alerts real-time security operation center also provide “ care feeding ” development variety security solutions co-managed approach also allows organizations focus emerging internal projects critical areas according gartner use co-managed security information event management report “ co-managed siem services enable security risk management leaders maximize value siem enhance security monitoring capabilities retaining control flexibility. ” co-management rise expected grow five-fold 2020 siem ids/ips compliance automation network configuration management tools advanced threat intelligence network access control endpoint threat detection response application security file integrity monitoring forensic investigation vulnerability scanning assessment examples cyber security solutions co-managed service providers support | [
8123,
7111
] | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.