node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
2,585 | 2 | Ubuntu_JeOS:ubuntu jeos ubuntu jeos pronounced juice discontinued variant ubuntu described efficient variant ... configured specifically virtual appliances concept operating system look like context virtual appliance jeos stands enough operating system first release ubuntu jeos 7.10 since release ubuntu 8.10 included option part standard ubuntu server edition latest version jeos optimized virtualization technologies vmware inc. linux kernel-based virtual machine specifications version 8.10 include | [
4295,
753,
7581,
6489,
7587,
1893,
2260,
7954,
7251,
474,
2297,
1941,
6209,
6211,
7669,
3738,
4824,
5523,
5530,
3751,
6951,
5884,
6244,
5200,
1629,
3444,
5912,
3780,
5571,
2026,
5232,
2758,
1663,
4165,
3130,
2063,
4187,
5259,
2074,
6317,
... | Test |
2,586 | 6 | Chiron_FS:chiron fs chiron filesystem fault-tolerant replication file system chiron fs fuse based filesystem implements replication filesystem level like raid 1 device level replicated filesystem may kind requisite mounted need special configuration files setup simple one mount command one line fstab specific communication protocol mount time invoking parameters indicate two paths directories replicated underlying filesystems must already sync allows client use kind underlying filesystems ext3 nfs sshfs even mix every write chiron fs mount point subtree echoed underlying filesystems read chiron fs mount point subtree made one underlying filesystems using prioritized round robin algorithm one underlying filesystems fails virtualized filesystem provided chiron fs continues operating long least one replica available case failures reported log file failure write operation failed replica disabled used chiron fs available resynchronized others synchronization implemented yet chiron fs must done manually replica fails calling application receives error message would receive accessing non replicated filesystem case log report | [] | Test |
2,587 | 4 | POODLE:poodle poodle attack stands padding oracle downgraded legacy encryption man-in-the-middle exploit takes advantage internet security software clients fallback ssl 3.0 attackers successfully exploit vulnerability average need make 256 ssl 3.0 requests reveal one byte encrypted messages bodo möller thai duong krzysztof kotowicz google security team discovered vulnerability disclosed vulnerability publicly october 14 2014 despite paper dated september 2014 december 8 2014 variation poodle vulnerability affected tls announced cve-id associated original poodle attack f5 networks filed well see poodle attack tls section poodle exemplifies vulnerability succeeds mechanism designed reducing security sake interoperability designing systems domains high levels fragmentation extra care appropriate domains graceful security degradation may become common mitigate poodle attack one approach completely disable ssl 3.0 client side server side however old clients servers support tls 1.0 thus authors paper poodle attacks also encourage browser server implementation tls_fallback_scsv make downgrade attacks impossible another mitigation implement anti-poodle record splitting splits records several parts ensures none attacked however problem splitting though valid according specification may also cause compatibility issues due problems server-side implementations full list browser versions levels vulnerability different attacks including poodle found article transport layer security opera 25 implemented mitigation addition tls_fallback_scsv google chrome browser servers already supported tls_fallback_scsv google stated october 2014 planning remove ssl 3.0 support products completely within months fallback ssl 3.0 disabled chrome 39 released november 2014 ssl 3.0 disabled default chrome 40 released january 2015 mozilla disabled ssl 3.0 firefox 34 esr 31.3 released december 2014 added support tls_fallback_scsv firefox 35 microsoft published security advisory explain disable ssl 3.0 internet explorer windows os october 29 2014 microsoft released fix disables ssl 3.0 internet explorer windows vista server 2003 announced plan disable ssl 3.0 default products services within months microsoft disabled fallback ssl 3.0 internet explorer 11 protect mode sites february 10 2015 sites april 14 2015 apple safari os x 10.8 ios 8.1 later mitigated poodle removing support cbc protocols ssl 3.0 however left rc4 also completely broken rc4 attacks ssl 3.0.. poodle completely mitigated os x 10.11 el capitan 2015 ios 9 2015 prevent poodle attack web services dropped support ssl 3.0 examples include cloudflare wikimedia network security services version 3.17.1 released october 3 2014 3.16.2.3 released october 27 2014 introduced support tls_fallback_scsv nss disable ssl 3.0 default april 2015 openssl versions 1.0.1j 1.0.0o 0.9.8zc released october 15 2014 introduced support tls_fallback_scsv libressl version 2.1.1 released october 16 2014 disabled ssl 3.0 default new variant original poodle attack announced december 8 2014 attack exploits implementation flaws cbc encryption mode tls 1.0 1.2 protocols even though tls specifications require servers check padding implementations fail validate properly makes servers vulnerable poodle even disable ssl 3.0 ssl pulse showed 10 servers vulnerable poodle attack tls vulnerability announced cve-id f5 networks implementation bug entry nist nvd states cve-id used f5 networks implementation tls vendors whose products failure validate padding mistake implementations like a10 networks cisco systems need issue cve-ids implementation errors flaw protocol flaw protocol implementation poodle attack tls found easier initiate initial poodle attack ssl need downgrade clients ssl 3.0 meaning fewer steps needed execute successful attack | [
704,
3932,
363,
3940,
6795,
2912,
376,
1460,
3277,
2923,
5399,
6458,
7567,
7925,
3323,
5779,
7214,
1513,
2620,
7600,
4025,
794,
1528,
4759,
2991,
1168,
1173,
2644,
6526,
5824,
6904,
4783,
6540,
6541,
6194,
6553,
4071,
2678,
3038,
3047,
... | Test |
2,588 | 3 | Server_Base_System_Architecture:server base system architecture server base system architecture sbsa hardware system architecture servers based 64-bit arm processors attempts standardize pe arm processing element features key aspects system architecture specified features firmware os hypervisors rely enable suitably-built single os image run hardware compliant specification architecture compliance suite check system compliant sbsa specification available open source software downloaded https //github.com/arm-software/sbsa-acs | [] | Test |
2,589 | 6 | Ar_(Unix):ar unix archiver also known simply ar unix utility maintains groups files single archive file today codice_1 generally used create update static library files link editor linker uses generating .deb packages debian family used create archives purpose largely replaced codice_2 purposes static libraries implementation codice_1 included one gnu binutils linux standard base lsb codice_1 deprecated expected disappear future release standard rationale provided lsb include software development utilities specify .o .a file formats ar format never standardized modern archives based common format two main variants bsd system v initially known coff used well gnu elf windows historically variants including v6 v7 aix small big coherent vary significantly common format debian .deb archives use common format ar file begins global header followed header data section file stored within ar file data section 2 byte aligned would end odd offset newline '\n 0x0a used filler file signature single field containing magic ascii string codice_5 followed single lf control character 0x0a file stored ar archive includes file header store information file common format follows numeric values encoded ascii values right-padded ascii spaces 0x20 headers include printable ascii characters line feeds archive containing text files therefore still appears text file members aligned even byte boundaries archive file member begins even byte boundary newline inserted files necessary nevertheless size given reflects actual size file exclusive padding due limitations file name length format gnu bsd variants devised different methods storing long filenames although common format suffer year 2038 problem many implementations ar utility may need modified future handle correctly timestamps excess 2147483647 bsd ar stores filenames right-padded ascii spaces causes issues spaces inside filenames 4.4bsd ar stores extended filenames placing string 1/ followed file name length file name field storing real filename front data section bsd ar utility traditionally handle building global symbol lookup table delegates task separate utility named ranlib inserts architecture-specific file named codice_6 first archive member system v ar uses '/ character 0x2f mark end filename allows use spaces without use extended filename stores multiple extended filenames data section file name // record referred future headers header references extended filename storing followed decimal offset start filename extended filename data section format // file simply list long filenames separated one lf characters note decimal offsets number characters line string number within // file system v ar uses special filename denote following data entry contains symbol lookup table used ar libraries speed access symbol table built three parts recorded together contiguous data system v systems use format described symbol lookup table operating systems hp-ux 11.0 information stored data structure based som file format special file terminated specific sequence end assumed last symbol name read windows variation adds second special stores extended symbol cross-reference table stored sorted using little-endian integers overcome 4 gib file size limit operating system like solaris 11.2 use variant instead 32-bit integers 64-bit integers used symbol lookup tables furthermore string /sym64/ instead used identifier table create archive files class1.o class2.o class3.o following command would used unix linkers usually invoked c compiler codice_7 read codice_1 files extract object files codice_9 archive containing codice_10 codice_11 codice_12 libclass.a placed standard library path like /usr/local/lib linking | [
361,
6789,
4662,
366,
1837,
1471,
7555,
3984,
7201,
3987,
7584,
5789,
4017,
4020,
3685,
4387,
1537,
5480,
5138,
1955,
1572,
1213,
510,
7667,
4447,
6577,
6232,
169,
3413,
1236,
3417,
1989,
6242,
3085,
900,
3106,
5571,
578,
923,
5933,
774... | Test |
2,590 | 0 | Content_determination:content determination content determination subtask natural language generation involves deciding information communicated generated text closely related task document structuring consider nlg system summarises information sick babies suppose system four pieces information communicate bits information included generated texts three general issues almost always impact content determination task illustrated example perhaps fundamental issue communicative goal text i.e purpose reader example instance doctor wants make decision medical treatment would probably interested heart rate bradycardias parent wanted know child would probably interested fact baby given morphine crying second issue size level detail generated text instance short summary sent doctor 160 character sms text message might mention heart rate bradycarias longer summary printed multipage document might also mention fact baby morphine iv final issue unusual unexpected information example neither doctors parents would place high priority told baby temperature normal expected case regardless content determination important users indeed many cases quality content determination important factor user perspective determining overall quality generated text three basic approaches document structuring schemas content templates statistical approaches explicit reasoning schemas templates explicitly specify content generated text well document structuring information typically constructed manually analysing corpus human-written texts target genre extracting content template texts schemas work well practice domains content somewhat standardised work less well domains content fluid medical example statistical techniques use statistical corpus analysis techniques automatically determine content generated texts work infancy mostly applied contexts communicative goal reader size level detail fixed example generation newswire summaries sporting events explicit reasoning approaches probably attracted attention researchers basic idea use ai reasoning techniques knowledge-based rules planning pattern detection case-based reasoning etc examine information available communicated including unusual/unexpected communicative goal reader characteristics generated text including target size decide optimal content generated text wide range techniques explored consensus effective | [
1718,
7578,
5304
] | Test |
2,591 | 2 | Android_TV:android tv android tv version android operating system designed digital media players developed google replacement google tv features user interface designed around content discovery voice search surfacing content aggregated various media apps services integration recent google technologies assistant cast knowledge graph platform first unveiled june 2014 nexus player launch device unveiled october platform also adopted smart tv middleware companies sony sharp android tv products also adopted set-top boxes number iptv television providers android tv first announced google i/o june 2014 successor commercially unsuccessful google tv verge characterized line digital media player platforms leveraging google knowledge graph project chromecast compatibility larger emphasis search closer ties android ecosystem including google play store integration android families android wear focusing supporting video games platform support bluetooth gamepads google play games framework attendees received platform development kit adt-1 information reported adt-1 based scrapped nexus tv launch device developed internally google google unveiled first android tv device nexus player developed asus hardware event october 2014 android tv platform adaptation android os set-top boxes integrated software smart tv hardware home screen uses vertically-scrolling row-based interface including content discovery area populated suggested content followed watch rows surface media content installed apps android tv supports voice input commands universal search across multiple services selected devices also support google assistant android tv devices support google cast allowing media queued supported apps devices identical manner chromecast android tv supports software google play store including media apps games although google play apps compatible android tv thus available android tv devices nvidia shield razer forge tv also marketed microconsoles bundled bluetooth wireless gamepad version android tv provided service operators implement android tv device provide subscribers access consume media content operator customize home screen embedded services onto device running android tv google i/o 2014 google announced sharp sony tp vision would release smart tvs android tv integrated 2015 noted support handling tv-specific functions input switching tuning natively integrated android platform sony unveiled range bravia smart tvs running android tv ces 2015 sharp television sets became available june 10 2015 beginning release two models philips announced 80 2015 tvs run android tv first two models released june 2015 google announced television hardware partners january 2016 including arcelik bang olufsen hisense rca tcl corporation vestel several television providers released set-top boxes based android tv including lg uplus u+ tvg woofer u+ tvg 4k uhd french isp free freebox mini 4k bouygues telecom bbox miami dish network released android tv device 2017 known airtv player marketed companion sling tv service supporting optional adapter attaching antenna receive over-the-air television ericsson added android tv support mediafirst iptv platform used basis canadian services telus pik tv sasktel maxtv stream vodafone australia currently selling tv tuner media streaming device running android tv | [
2902,
3933,
5372,
6427,
1095,
5740,
2569,
740,
4340,
42,
3309,
3310,
7924,
5771,
5775,
6153,
7956,
5455,
1159,
4762,
7967,
6176,
5473,
474,
5476,
1179,
6183,
822,
831,
5141,
136,
2317,
2673,
6209,
7285,
2683,
855,
6937,
168,
4455,
6232,... | Validation |
2,592 | 9 | FAUST_(programming_language):faust programming language faust functional audio stream domain-specific purely functional programming language implementing signal processing algorithms form libraries audio plug-ins standalone applications faust program denotes signal processor mathematical function applied input signal fed faust programming model combines functional programming approach block diagram syntax faust program ’ describe sound group sounds signal processor program source organized set definitions least definition keyword codice_1 equivalent codice_2 c faust compiler translates faust code c++ object may interface c++ code produce full program generated code works sample level therefore suited implement low-level dsp functions like recursive filters code may also embedded self-contained depend dsp library runtime system deterministic behavior constant memory size semantics faust driven simple well-defined allows faust compiler semantically driven instead compiling program literally compiles mathematical function denotes may promote component reuse moreover access exact semantics faust program simplify preservation issues faust textual language block diagram oriented combines two approaches functional programming algebraic block diagrams constructed via function composition faust relies block diagram algebra five composition operations faust programs define codice_1 function operates incoming data analogous codice_2 function programming languages following example produces silence second example copies input signal output involves codice_5 primitive denotes identity function signals another example sums stereo signal mono signal using codice_6 primitive faust primitives analogous c counterpart numbers lifted signals example faust primitive codice_7 operates signal x applying c function codice_7 sample x c numerical functions counterpart faust signal processing primitives specific faust example delay operator codice_9 takes two input signals x signal delayed delay applied produces output signal x − contrary max-like visual programming languages user manual connections faust primitives assembled block diagrams using set high-level block diagram composition operations using sequential composition operator codice_10 output codice_6 routed input codice_12 compute absolute value signal example parallel composition using codice_13 operator arranges left right expressions parallel analogous stereo cable operators arbitrarily combined following code multiplies input signal 0.5 may rewritten curried form recursive composition operator codice_14 used create block diagrams cycles include implicit one-sample delay example integrator takes input signal x computes output signal x t−1 using specific architecture files faust program used produce code variety platforms plug-in formats architecture files act wrappers describe interactions host audio gui system 10 architectures supported new ones may implemented anyone useful option makes possible generate block diagram representation program one svg graphic files useful note difference block diagram generated c++ code stated key idea compile block diagram literally mathematical function denotes modern c/c++ compilers also ’ compile programs literally complex semantics c/c++ due side effects pointer aliasing etc ’ go far direction distinct advantage purely functional language allows compilers advanced optimisations faust semantics almost haskell arrows type class however arrow type class bound signal processors arrow combinators restrictive faust counterparts e.g. nesting parallel composition preserved inputs operands codice_15 must match exactly | [
4759,
6245,
5282,
4853,
1361,
2740,
3534,
5571,
578,
2592,
2420,
5420,
5260,
1989,
6408,
1435,
5266
] | Test |
2,593 | 4 | E-Stewards:e-stewards e-stewards initiative electronics waste recycling standard created basel action network program organization created grew concern electronic waste generated wealthy countries dismantled poor countries often underage workers young workers exposed toxic metals working unsafe conditions 2009 ban published e-stewards standard responsible recycling reuse electronic equipment set forth requirements becoming certified e-stewards recycler—a program recognizes electronics recyclers adhere stringent environmentally socially responsible practices recovering hazardous electronic materials recyclers qualified older pledge program 1 september 2011 achieve certification standard e-stewards accredited certification body accredited anab ansi-asq national accreditation board e-stewards standard responsible recycling reuse electronic equipment developed basel action network industry-specific environmental management system standard basis e-stewards initiative 6 march 2012 ban released updated revised version 2.0 open public comment prior final adoption later spring 2012 certification available electronics recyclers refurbishers achieve e-stewards certification organizations subject initial stage stage ii audit passing audits accepted ban yearly surveillance audits take place ensure organizations standard registered iso 14001 environmental management system place well achieving numerous performance requirements including assuring export hazardous electronic wastes developing countries use prison labor dumping toxic materials municipal landfills | [
4656,
1021,
8061,
2029,
288
] | Test |
2,594 | 2 | OpenPKG:openpkg openpkg open source package management system unix based well known rpm-system allows easy unified installation packages onto common unix-platforms solaris linux freebsd project launched ralf s. engelschall november 2000 june 2005 offered 880 freely available packages | [
5629,
8055,
2451,
5983,
2091,
5200,
4759,
5545,
6609,
1260,
5726,
4675,
7619,
7251,
5912,
6428,
3366,
5386,
4778,
578,
2034,
4603,
4059,
7092,
6367,
7555,
6029,
6743,
3889,
3559,
2771,
326,
3036,
3562,
1582,
3042,
4441,
1406,
6663,
1684,
... | Test |
2,595 | 0 | Martin_Kay:martin kay martin kay computer scientist born 1935 known especially work computational linguistics born raised united kingdom received m.a trinity college cambridge 1961 1958 started work cambridge language research unit one earliest centres research known computational linguistics 1961 moved rand corporation santa monica california us eventually became head research linguistics machine translation left rand 1972 become chair department computer science university california irvine 1974 moved xerox palo alto research center research fellow 1985 retaining position xerox parc joined faculty stanford university half-time currently professor linguistics stanford university honorary professor computational linguistics saarland university born edgeware middlesex great britain 1935 studied linguistics computational linguistics trinity college cambridge main interests translation people machines computational linguistic algorithms especially fields morphology syntax kay began career cambridge language research unit cambridge england margaret masterman 1961 david g. hays hired work rand corporation subsequently worked university california irvine xerox parc kay one pioneers computational linguistics machine translation responsible introducing notion chart parsing computational linguistics notion unification linguistics generally ron kaplan pioneered research application development finite-state morphology longtime contributor critic work machine translation seminal paper proper place men machines language translation kay argued mt systems tightly integrated human translation process reviewer critic eurotra verbmobil many mt projects kay former chair association computational linguistics president international committee computational linguistics research fellow xerox parc 2002 holds honorary doctorate gothenburg university kay received lifetime achievement award association computational linguistics sustained role intellectual leader nlp research 2005 1 martin kay proper paper 1 alpac report 1966 conclusion made immediate predictable prospect useful mt producing useful translation general scientific texts 2 result field machine translation entered dark period 1966 1976 almost ten years researches done however 1980s renaissance period coming 3 proper place men machines language translation attracted attention machine translation paper new thoughts achieved relationship machine translation human translation time application cheaper computers broad usage domains machine translation high quality outputs badly needed theory fully automatic high quality translation ideal level machine translation criticisms bar-hillel 1960s review mt progress goal mt fully automatic high quality translation fahqt replace human translators instead mt adopt less ambitious goals e.g cost-effective human-machine interaction aim enhancement human translation productivity 4 useful human translation promoted new higher level according thought martin kay proposed practical idea relationship human machine process machine translation called translator amanuensis 1.1 two arguments useful machine translation idea includes human machine time computer scientists linguists responsibilities mt never asked provide engineering solution problem dimly understand need achieve done absolute surety reliability …can virtually guaranteed concerned main parts translation two related arguments plausibility machine translation industrial enterprise point view linguistics computer science two arguments commonly made ad hoc solutions problems machine translation former argument ad hoc solutions tend based case-by-case analyses linguists call surface phenomena essentially strings words real imagined statistical properties particular styles writing domains discourse simple statistical claim dismissed second argument ad hoc solutions alluded understanding second language reading text called sorcerer apprentice kind argument effect kind incomplete theory linguists computer scientists able provide often worse base build practical devices theory theory know stop main problem sorcerer's-apprentice argument decision sentence could translated without analysis made fact example sentence shows one interpretation sentence level analysis shows single translation compatible short algorithm required decide analysis required would use results analysis designed avoid 1.2 translator amanuensis translation memory main part paper illustrate translator amanuensis author showed three aspects text editing translation aids machine translation suppose translators provided terminal consisting keyboard screen way pointing individual words letters display screen divided two windows text translated appears upper window translation composed bottom one form translator amanuensis real device never windows behave way using pointing device translator select letter word sentence line paragraph pressing appropriate key cause operation visited upon two figures show translation process initial display selection device simple two figures special service made translator translation aids author showed third figure relatively trivial addition would dictionary translator selects word sequence words gives command cause looked up…this new window gives effect overlaying portion windows already present case new window contains deceptively simple dictionary entry selected word device many features example simplicity dictionary entry words syntax semantics included pointing symbols modifiable dictionary entries temporary amendments make device practical machine translation explained one options offered user hypothetical system describing fairly early stage command direct program translate currently selected unit happen command given different different stages system development user system always empowered intervene translation process extent specifies elects intervene piece text purporting translate current unit displayed lower window screen able edit way likes post-editors done past alternatively may ask consulted whenever program confronted decision specified type certain kinds ambiguities detected whatever occasions system put question human translator may example ask consulted questions pronominal reference part idea translation memory shown dictionary operation suppose example word put local store – part dictionary persists long document worked – occurs text significantly frequently statistics stored main dictionary indicate phrase noted occurs two three times recognized idiom set phrase dictionary examining contents store embarking translation user may hope get preview difficulties ahead make decisions advance treat decisions course recorded store course indeed reason whatever translator call display units text contain certain word phrase string characters whatever important reference translating text text piece text translated next anything entirely straightforward translator might start issuing command causing system display anything store might relevant bring attention decisions made actual translation started statistically significant words phrases record anything attracted attention occurred going examine past future fragments text contain similar material 1.3 expectation better performance translator amanuensis end paper kay mentioned reasons expect better performance device first system position draw human collaborator attention matters likely need second decisions made course translating passage rarely independent third one important facilities system one keeps track words phrases used special way current text | [
1314,
6530,
5388,
1633,
7293,
5008
] | Test |
2,596 | 2 | Execute_Channel_Program_in_Real_Storage:execute channel program real storage ibm mainframe operating systems execute channel program real storage excpvr supervisor call low-level device access programmer responsible providing list device-specific ccws channel program executed i/o channels control units devices additionally programmer expected required ensure input/output data areas real storage fixed either prior invoking excpvr via page fix appendage excpvr situations provide improved performance compared excp excpvr may viewed historically v=r i.e. virtual=real version excp however excpvr restricted v=r applications indeed excpvr may refer non-v=r data areas provided data areas fixed channel command words reference data areas translated virtual real addresses programmer using lra load real address privileged instruction data channels deal real addresses virtual addresses excpvr first introduced svs continued mvs/370 later instances os support added format 1 ccws hence access data areas line format 0 ccws may access data areas line excpvr front-end always tcb mode excpvr type 1 svc mvs/370 subsequent instances os excpvr invokes startio schedule execution channel program hence excpvr back-end always srb mode back-end contains emulation code allows appendages developed earlier pre-mvs instances os function largely thereby appear tcb mode appendages originally designed distinction complicate conversion certain roll-your-own access methods applications mvs | [
607,
5081,
5852,
3233,
8159,
7040,
5571,
5105,
6213,
7264,
7024,
7661,
4647,
1851,
7783,
1994
] | Test |
2,597 | 2 | Screen_Sharing:screen sharing screen sharing vnc client apple inc. included part mac os x v10.5 allows remote observance control macintosh machine local network screen sharing activated may also used internet via ichat screen sharing vnc client may also used control computer running vnc server ip address target computer known accessible apple back mac feature mobileme service offers wide-area bonjour allow screen sharing file sharing access beyond lan | [
3940,
713,
4690,
734,
405,
6832,
3989,
3322,
1502,
5786,
4740,
1897,
6505,
2627,
7609,
1171,
5109,
2284,
1178,
6188,
1187,
1562,
6909,
6548,
502,
6557,
2679,
6565,
2329,
3050,
163,
6582,
5535,
5191,
8051,
7335,
3445,
569,
5571,
7000,
62... | Test |
2,598 | 4 | ARX_(Algorithmic_Research_Ltd.):arx algorithmic research ltd. arx algorithmic research ltd. digital security company headquartered san francisco ca offices uk netherlands australia israel creator cosign arx digital signature technology along related digital signature security technology products arx acquired docusign may 2015 acquisition builds three-year business partnership docusign arx bringing together arx cosign digital signature technology docusign digital transaction management dtm platform broadens docusign global trust network arx digital signature products based public key infrastructure pki technology digital signatures resulting cryptographic operation creates ‘ fingerprint ’ unique signer content copied forged tampered process provides proof signer identity data integrity non-repudiation signed documents verified without need proprietary verification software company cosign solution integrates large range document management workflow automation systems intended streamline workflow processes requiring signatures arx partners document management workflow solution providers including sharepoint opentext oracle alfresco nintex k2 industries focus include life science particularly research clinical trials engineering legal federal/local governments arx clients based north america africa europe asia-pacific italy cosign used ministry defence rai senate court accounts state police bank italy also used european court human rights digitize streamline application process arx solutions validated security standards nist fips 140-2 level 3 fips 186 etsi ts 101 733 2013 cosign named “ strongest digital signature solution ” 2013 report august 2014 cosign received common criteria eal4+ certification thus becoming first remote server-side digital signature solution fully compliant eu newly enacted electronic identification trust services regulation electronic transactions internal market eidas arx solutions also comply esign ueta fda 21 cfr part 11 sox hipaa usda among many signature-related country- industry-specific laws regulations arx founded 1987 prof. amos fiat yossi tulpan focused developing encryption-based products included rsa-smartcard developed canal+ 1989 secure-pin entry keyboard connected smartcard reader cryptographic toolkits network-attached cryptographic server hsm vpn september 1997 arx acquired cylink corp nasdaq cylk sunnyvale california 2001 company went management buy-out mbo initiated dr. gadi aharoni dr. aharoni served president ceo arx 14 years leadership company gradually switched focus newly developed cosign digital-signature solution may 2015 arx acquired u.s. competitor docusign | [
4945,
298,
6208,
7567
] | Test |
2,599 | 2 | Ricardo_Galli:ricardo galli dr. ricardo adolfo galli granada also known gallir doctor computer science university balearic islands teaches operating system design speaker free software foundation free software activist university project created system allows controlling airship parking son sant joan airport palma de mallorca balearic islands spain december 2005 programmed menéame clone well-known digg web site serves promote stories published blogs released source code meneame source code open source digg clone pligg cms based programmed cpudyn daemon used underclock portable computers reduce power consumption programmed wp-cache wordpress plugin purpose caching pages make one blog faster responsive 2001 nominated hispalinux prize published 200 technical articles bulma catalan linux user web site | [
707,
1523,
2985,
8158,
6876,
3174,
1351,
1637,
6981,
2559,
7823,
5571,
4872,
3868,
1563,
6365,
7463,
5757,
7559,
3981,
4070,
3219,
761,
1406,
5515,
6048,
2698,
6674,
5787,
966,
2170,
4020
] | Test |
2,600 | 9 | Emacs_Lisp:emacs lisp emacs lisp dialect lisp programming language used scripting language emacs text editor family commonly associated gnu emacs xemacs used implementing editing functionality built emacs remainder written c lisp interpreter emacs lisp also termed elisp although also older unrelated lisp dialect name users emacs commonly write emacs lisp code customize extend emacs options include customize feature gnu emacs since version 20 written emacs lisp customize provides set preferences pages allowing user set options preview effect running emacs session user saves changes customize simply writes necessary emacs lisp code user config file set special file customize uses avoid possibility altering user file emacs lisp also function scripting language much like unix bourne shell perl calling emacs batch mode way may called command line via executable file editing functions buffers movement commands available program normal mode user interface presented emacs started batch mode simply executes passed-in script exits displaying output script emacs lisp closely related maclisp later influence common lisp supports imperative functional programming methods richard stallman chose lisp extension language rewrite emacs original used text editor corrector teco extension language powerful features including ability treat functions data although common lisp standard yet formulated scheme existed time stallman rewriting gosling emacs gnu emacs chose use comparatively poor performance workstations opposed minicomputers emacs traditional home wanted develop dialect thought would easily optimized lisp dialect used emacs differs substantially modern common lisp scheme dialects used applications programming prominent characteristic emacs lisp use dynamic rather lexical scope default see function may reference local variables scope called scope defined understand logic behind emacs lisp important remember emphasis providing data structures features specific making versatile text editor implementing general-purpose programming language example emacs lisp easily read file line time—the entire file must read emacs buffer however emacs lisp provides many features navigating modifying buffer text sentence paragraph higher syntactic level defined modes follows simple example emacs extension written emacs lisp emacs editing area split separate areas called windows displaying different buffer buffer region text loaded emacs memory possibly file saved text document users press default c-x 2 key binding open new window runs emacs lisp function codice_1 normally new window appears displays buffer previous one suppose wish make display next available buffer order user writes following emacs lisp code either existing emacs lisp source file empty emacs buffer first statement codice_2 defines new function codice_3 calls codice_1 old window-splitting function tells new window display another new buffer second statement codice_5 re-binds key sequence c-x 2 new function also written using feature called advice allows user create wrappers around existing functions instead defining advantage requiring keybindings changed working wherever original function called well simpler write disadvantage making debugging complicated reason advice allowed source code gnu emacs user wishes advice feature used code reimplement code follows instructs codice_1 execute user-supplied code whenever called executing rest function advice also specified execute original function around it—literally wrapping original conditionally execute original function based results advice emacs 24.4 replaces codice_7 mechanism codice_8 claimed flexible simpler advice could reimplemented using new system changes take effect soon code evaluated necessary recompile restart emacs even rehash configuration file code saved emacs init file emacs load extension next time starts otherwise changes must reevaluated manually emacs restarted emacs lisp code stored filesystems plain text files convention filename suffix .el user init file exception often appearing .emacs despite evaluated emacs lisp code recent versions emacs recent 40-year-old program meaning roughly version released since mid-1990s also load ~/.emacs.el ~/.emacs.d/init.el additionally users may specify file load config file command line explicitly state config file loaded files loaded interpreter component emacs program reads parses functions variables storing memory available editing functions user commands functions variables freely modified redefined without restarting editor reloading config file order save time memory space much functionality emacs loads required set optional features shipped emacs implemented collection emacs code called package library example library highlighting keywords program source code library playing game tetris library implemented using one emacs lisp source files libraries define one major modes activate control function emacs developers write certain functions c. primitives also termed built-in functions subrs although primitives called lisp code modified editing c source files recompiling gnu emacs primitives available external libraries part emacs executable xemacs runtime loading primitives possible using operating system support dynamic linking functions may written primitives need access external data libraries otherwise available emacs lisp called often enough comparative speed c versus emacs lisp makes worthwhile difference however errors c code easily lead segmentation violations subtle bugs crash editor writing c code interacts correctly emacs lisp garbage collector error-prone number functions implemented primitives kept necessary minimum byte-compiling make emacs lisp code execute faster emacs contains compiler translate emacs lisp source files special representation termed bytecode emacs lisp bytecode files filename suffix .elc compared source files bytecode files load faster occupy less space disk use less memory loaded run faster bytecode still runs slowly primitives functions loaded bytecode easily modified re-loaded addition bytecode files platform-independent standard emacs lisp code distributed emacs loaded bytecode although matching source files usually provided user reference well user-supplied extensions typically byte-compiled neither large computationally intensive notably cl package implements fairly large subset common lisp emacs lisp unlike lisp implementations tail-call optimization without tail recursions eventually lead stack overflow apel library aids writing portable emacs lisp code help polysylabi platform bridge emacs lisp lisp-2 meaning function namespace separate namespace uses variables like maclisp emacs lisp uses dynamic scope offering static lexical option starting version 24 activated setting file local variable codice_9 dynamic scoping programmer declares variable within scope function available subroutines called within function originally intended optimization lexical scoping still uncommon uncertain performance asked rms implementing emacs lisp dynamically scoped exact reply lexical scope inefficient dynamic scoping also meant provide greater flexibility user customizations however dynamic scoping several disadvantages firstly easily lead bugs large programs due unintended interactions variables different functions secondly accessing variables dynamic scoping generally slower lexical scoping also codice_10 macro cl package provide effective lexical scope emacs lisp programmers cl widely used codice_10 rarely used | [
7878,
1445,
5019,
1820,
6796,
6087,
2915,
5734,
397,
1476,
1478,
2218,
4704,
3976,
5757,
6116,
1116,
6471,
7573,
5077,
1885,
7583,
1889,
6507,
795,
6876,
6888,
1557,
4789,
5494,
5501,
6210,
144,
4074,
4085,
7298,
5515,
8025,
3749,
6949,
... | Test |
2,601 | 3 | Roadrunner_(supercomputer):roadrunner supercomputer roadrunner supercomputer built ibm los alamos national laboratory new mexico usa us 100-million roadrunner designed peak performance 1.7 petaflops achieved 1.026 petaflops may 25 2008 become world first top500 linpack sustained 1.0 petaflops system november 2008 reached top performance 1.456 petaflops retaining top spot top500 list also fourth-most energy-efficient supercomputer world supermicro green500 list operational rate 444.94 megaflops per watt power used hybrid roadrunner design reused several energy efficient supercomputers roadrunner decommissioned los alamos march 31 2013 place los alamos commissioned supercomputer called cielo installed 2010 cielo smaller energy efficient roadrunner cost 54 million ibm built computer u.s. department energy doe national nuclear security administration hybrid design 12,960 ibm powerxcell 8i 6,480 amd opteron dual-core processors specially designed blade servers connected infiniband roadrunner used red hat enterprise linux along fedora operating systems managed xcat distributed computing software also used open mpi message passing interface implementation roadrunner occupied approximately 296 server racks covered became operational 2008 decommissioned march 31 2013 doe used computer simulating nuclear materials age order predict whether usa aging arsenal nuclear weapons safe reliable uses roadrunner included science financial automotive aerospace industries roadrunner differed contemporary supercomputers continued hybrid approach supercomputer design introduced seymour cray 1964 control data corporation cdc 6600 continued order magnitude faster cdc 7600 1969 however architecture peripheral processors used operating system functions applications ran one central processor previous supercomputers used one processor architecture since thought easier design program realize full potential roadrunner software written specially hybrid architecture hybrid design consisted dual-core opteron server processors manufactured amd using standard amd64 architecture attached opteron core ibm-designed -fabricated powerxcell 8i processor supercomputer roadrunner considered opteron cluster cell accelerators node consists cell attached opteron core opterons roadrunner development 2002 went online 2006 due novel design complexity constructed three phases became fully operational 2008 predecessor machine also developed los alamos named dark horse machine one earliest hybrid architecture systems originally based arm moved cell processor entirely 3d design design integrated 3d memory networking processors number technologies first phase roadrunner building standard opteron based cluster evaluating feasibility construct program future hybrid version phase 1 roadrunner reached 71 teraflops full operation los alamos national laboratory 2006 phase 2 known aais advanced architecture initial system included building small hybrid version finished system using older version cell processor phase used build prototype applications hybrid architecture went online january 2007 goal phase 3 reach sustained performance excess 1 petaflops additional opteron nodes new powerxcell processors added design powerxcell processors five times powerful cell processors used phase 2 built full scale ibm ’ poughkeepsie new york facility broke 1 petaflops barrier fourth attempt may 25 2008 complete system moved permanent location new mexico summer 2008 roadrunner used two different models processors first amd opteron 2210 running 1.8 ghz opterons used computational nodes feeding cells useful data system operations communication nodes passing data computing nodes helping operators running system roadrunner total 6,912 opteron processors 6,480 used computation 432 operation opterons connected together hypertransport links opteron two cores total 13,824 cores second processor ibm powerxcell 8i running 3.2 ghz processors one general purpose core ppe eight special performance cores spe floating point operations roadrunner total 12,960 powerxcell processors 12,960 ppe cores 103,680 spe cores total 116,640 cores logically triblade consists two dual-core opterons 16 gb ram four powerxcell 8i cpus 16 gb cell ram physically triblade consists one ls21 opteron blade expansion blade two qs22 cell blades ls21 two 1.8 ghz dual-core opterons 16 gb memory whole blade providing 8gb cpu qs22 two powerxcell 8i cpus running 3.2 ghz 8 gb memory makes 4 gb cpu expansion blade connects two qs22 via four pcie x8 links ls21 two links qs22 also provides outside connectivity via infiniband 4x ddr adapter makes total width four slots single triblade three triblades fit one bladecenter h chassis expansion blade connected opteron blade via hypertransport connected unit 60 bladecenter h full triblades 180 triblades triblades connected 288-port voltaire isr2012 infiniband switch cu also access panasas file system twelve system x3755 servers cu system information final cluster made 18 connected units connected via eight additional second-stage infiniband isr2012 switches cu connected twelve uplinks second-stage switch makes total 96 uplink connections overall system information ibm roadrunner shut march 31 2013 supercomputer one fastest world energy efficiency relatively low roadrunner delivered 444 megaflops per watt vs 886 megaflops per watt comparable supercomputer supercomputer dismantled researchers spend one month performing memory data routing experiments aid designing future supercomputers ibm roadrunner dismantled electronics shredded los alamos perform majority supercomputer destruction citing classified nature calculations parts retained historical purposes | [
6597,
450,
5453,
1346,
7528,
4408,
5571,
7453,
4242,
6454,
1388,
6204,
4612,
1023,
6922,
2139,
4718,
763,
602,
8130,
3234,
1237,
4200,
1244,
4839
] | Test |
2,602 | 3 | Cycle_stealing:cycle stealing computing traditionally cycle stealing method accessing computer memory ram bus without interfering cpu similar direct memory access dma allowing i/o controllers read write ram without cpu intervention clever exploitation specific cpu bus timings permit cpu run full speed without delay external devices access memory actively participating cpu current activity complete operations possible cpu conflict systems nearly dual-port ram without expense high speed ram systems halt cpu steal essentially making form dma another name example system separate instruction data memory banks allow external devices one memory access data bank cpu fetching instruction instruction bank accesses initiated simultaneously memory management unit essential example zilog z80 m1 line used distinguish instruction data access cpu reading instruction instruction-ram rom data ram available devices without interfering cpu processing cycle stealing difficult achieve modern systems due many factors pipelining pre-fetch concurrent elements constantly accessing memory leaving predictable idle times sneak memory access dma formal predictable method external devices access ram term less common modern computer architecture 66-100 mhz various external buses controllers generally run different rates cpu internal operations longer closely coupled i/o bus operations unexpected cycle stealing rendezvous radar descent nearly caused apollo 11 landing aborted design apollo guidance computer allowed landing continue dropping low-priority tasks ibm 1130 cycle steal really dma cpu clock stopped memory access several i/o controllers access ram way self-arbitrate via fixed priority scheme controllers deliberately pace ram access minimize impact system ability run instructions others graphic video adapters operate higher speed may slow system cycle-stealing concept 1130 permits cpu program start operation i/o device continue mainline program i/o device performing operation i/o device operates manner takes steals cycle cpu needed cpu tied one cycle data character transferred frequency devices steal cycles depends type device since cpu much faster i/o device system cpu may performing another function arithmetic time i/o operation performed fact several i/o operations may overlapped cpu functions cycle stealing cause major performance degradation machine sinclair ql economy reasons video ram dual access consequently m68008 cpu denied access memory bus zx8301 master controller accessing memory machine performed poorly compared machines using similar processors similar speeds | [
468,
5947,
2785,
6687
] | Test |
2,603 | 0 | Jussi_Karlgren:jussi karlgren jussi karlgren swedish computational linguist adjunct professor kth co-founder text analytics company gavagai ab holds phd computational linguistics stockholm university title docent adjoint professor language technology helsinki university jussi karlgren known pioneered application computational linguistics stylometry continued work bringing non-topical features text attention information access research field karlgren research focused questions relating information access genre stylistics distributional pragmatics evaluation information access applications distributional models karlgren half finnish descent fluent finnish | [
1314,
7290
] | Test |
2,604 | 9 | Yamanner:yamanner yamanner worm computer worm written javascript targeted vulnerability yahoo mail service released june 12 2006 worm spread yahoo system infecting systems opened e-mails sending user address book remote server | [
562,
2451,
6092
] | Validation |
2,605 | 2 | PacBSD:pacbsd pacbsd formerly known arch bsd operating system based arch linux uses freebsd kernel instead linux kernel gnu userland pacbsd project began arch linux forum thread april 2012 aims provide arch-like user environment utilizing openrc init system pacman package manager rolling-release | [
6984,
3559,
5571,
3751,
8096,
5232,
6367
] | Test |
2,606 | 4 | Cryptographic_splitting:cryptographic splitting cryptographic splitting also known cryptographic bit splitting cryptographic data splitting technique securing data computer network technique involves encrypting data splitting encrypted data smaller data units distributing smaller units different storage locations encrypting data new location process data protected security breaches even intruder able retrieve decrypt one data unit information would useless unless combined decrypted data units locations technology filed patent consideration june 2003 patent granted june 2008 cryptographic splitting utilizes combination different algorithms provide data protection block data first encrypted using aes-256 government encryption standard encrypted bits split different shares share hashed using national security agency sha-256 algorithm one application cryptographic splitting provide security cloud computing encrypted data subsets stored different clouds information required restore data held private cloud additional security security vendor security first corp uses technology secure parser extended spx product line 2009 technology services company unisys gave presentation using cryptographic splitting storage area networks splitting data different parts storage area network technique provided data redundancy addition security computer giant ibm written using technology part cloud data encryption services icdes technology also written context effectively using sensitive corporate information entrusting different individuals within company trustees different parts information | [
2961,
1805
] | Test |
2,607 | 1 | Australasian_Virtual_Herbarium:australasian virtual herbarium australasian virtual herbarium avh online resource allows access plant specimen data held various australian new zealand herbaria part atlas living australia ala formed amalgamation australia virtual herbarium nz virtual herbarium 12 august 2014 five million specimens 8 million upwards specimens available participating institutions databased resource used academics students anyone interested research botany australia new zealand since record tells known specimen collected current identification together botanist identified information habitat associated species ala post processes original herbarium data giving fields respect taxonomy quality data interrogating individual specimen records environmental overlays show reverse jackknife testing see whether specimen outlier respect climate environmental layers see e.g. mel 0304065a scaevola amblyanthera records downloadable entirety anyone examples use records may found google scholar search using phrase australia virtual herbarium shows well 200 articles 3 may 2018 published using data resource herbaria codes may found wikipedia list herbaria based new york botanical garden continuously updated index plans australia virtual herbarium announced 2001 article tim entwisle 2003 shows still largely planning stage time although projected usages preservation biodiversity western new south wales already visible | [] | Test |
2,608 | 7 | Zoho_Office_Suite:zoho office suite zoho web-based online office suite containing word processing spreadsheets presentations databases note-taking wikis web conferencing customer relationship management crm project management invoicing applications developed zoho corporation formerly adventnet inc. california-based company launched 2005 web-based word processor additional products spreadsheets presentations incorporated later zoho zoho applications distributed software service saas zoho uses open application programming interface writer sheet show creator meeting planner products also plugins microsoft word excel openoffice.org plugin plugin firefox zoho sites online drag drop website builder provides web hosting unlimited storage bandwidth web pages features also include array website templates mobile websites zoho crm customer relationship management application features like procurement inventory accounting functions realm erp free version limited 10 users october 2009 zoho integrated applications google apps online suite enabled users sign suites one login zoho google still remain separate competing companies | [
2609,
6810,
330,
2054,
1634,
1262
] | Test |
2,609 | 7 | IWork:iwork iwork office suite applications created apple inc. macos ios operating systems also available cross-platform icloud website includes keynote presentation program word processing desktop publishing application pages spreadsheet application numbers generally viewed prosumer office suite targeted home small business users fewer features competitors microsoft office mac open source libreoffice project indeed earlier versions simpler user interface strong touchscreen support built-in links apple icloud document-hosting service aperture iphoto image management applications apple design goals creating iwork allow mac users easily create attractive documents spreadsheets making use macos extensive font library integrated spelling checker sophisticated graphics apis applescript automation framework equivalent microsoft office applications pages numbers keynote word excel powerpoint respectively although microsoft office applications open iwork documents iwork applications export documents native formats .pages .numbers .key microsoft office formats .docx .xlsx .pptx etc well pdf files oldest application iwork keynote first released standalone application 2003 pages released first iwork release 2005 numbers added 2007 release iwork '08 next release iwork '09 also included access iwork.com beta service allowed users upload share documents integrated apple icloud service ios port released 2010 first ipad regularly updated since 2013 apple released new os x version iwork icloud set cross-platform web applications replicating native software versions iwork initially sold suite 79 later 19.99 per app os x 9.99 per app ios apple announced october 2013 ios devices purchased september 2013 onwards os x computers purchased october 2013 onwards whether new refurbished eligible free download three iwork apps iwork icloud also incorporates document hosting service free holders icloud account april 2017 released suite free macos ios september 2016 apple announced real-time collaboration feature available iwork apps first version iwork iwork '05 announced january 11 2005 macworld conference expo made available january 22 united states worldwide january 29. iwork '05 comprised two applications keynote 2 presentation creation program pages word processor iwork '05 sold us 79 30-day trial also made available download apple website originally igg software held rights name iwork iwork billed apple successor appleworks replicate appleworks database drawing tools however iwork integrates existing applications apple ilife suite media browser allows users drag drop music itunes movies imovie photos iphoto aperture directly iwork documents iwork '06 released january 10 2006 contained updated versions keynote pages programs released universal binaries first time allowing run natively powerpc processors intel processors used new imac desktop computers macbook pro notebooks announced day new iwork suite next version suite iwork '08 announced released august 7 2007 special media event apple campus cupertino california iwork '08 like previous updates contained updated versions keynote pages new spreadsheet application numbers also introduced numbers differed spreadsheet applications including microsoft excel allowed users create documents containing multiple spreadsheets flexible canvas using number built-in templates iwork '09 announced january 6 2009 released day contains updated versions three applications suite iwork '09 also included access beta version iwork.com service allowed users share documents online service decommissioned end july 2012 users iwork '09 could upload document directly pages keynote numbers invite others view online viewers could write notes comments document download copy iwork microsoft office pdf formats iwork '09 also released mac app store january 6 2011 19.99 per application received regular updates point including links icloud high-dpi version designed match apple macbook pro retina display january 27 2010 apple announced iwork ipad available three separate 9.99 applications app store version also received regular updates including version pocket iphone ipod touch devices update take advantage retina display devices larger screens recent iphones october 22 2013 apple announced overhaul iwork software mac ios suites made available via respective app stores update free current iwork owners also made available free charge anyone purchasing os x ios device october 1 2013 user activating newly free iwork apps qualifying device download apps another ios os x device logged app store account new os x versions criticized losing features multiple selection linked text boxes bookmarks 2-up page views mail merge searchable comments ability read/export rtf files default zoom page count integration applescript apple provided road-map feature re-introduction stating hopes reintroduce missing features within next six months april 1 2014 features—e.g. ability set default zoom—had reintroduced though scores october 2014 writer john gruber commented numerous font handling problems like 're back 1990 due using completely new file format work across macos windows web browsers using online icloud web apps means versions iwork beginning iwork 13 later open allow editing documents created versions prior iwork 09 users attempt open older iwork files given pop-up new iwork 13 app versions telling use previous iwork 09 users may may machine order open edit files accordingly current version os x initially compatible os x mavericks 10.9 onwards moves previously installed iwork 09 apps iwork 09 folder users machine codice_1 work-around allow users continued use earlier suite order open edit older iwork documents locally machine october 2015 apple released update mitigate issue allowing users open documents saved iwork '06 iwork '08 formats latest version pages 2016 apple announced real-time collaboration feature available iwork apps instead constrained using iwork icloud feature comparable google docs iwork '09 received several updates mac app store version iwork updated october 15 2015 10.10 yosemite newer final release support 10.10 yosemite 10.11 el capitan keynote 6.6 pages 5.6 numbers 3.6 included iwork received major update march 28 2019 keynote 9.0 pages 8.0 numbers 6.0 products iwork suite share number components largely result sharing underlying code cocoa similar shared application programming interfaces apis among well known universal multilingual spell checker also found products like safari mail grammar checking find replace style color pickers similar examples design features found throughout apple application space moreover applications iwork suite also share new model document document-based applications particular data type forms basis application view world instance word processors text first-class citizen application spreadsheet cells table objects images charts instance managed attached referenced underlying primary data type iwork applications share common underlying document format canvas generic container type provides layout storage mechanisms application adds custom objects places canvas pages instance conventionally opens single large text object canvas user appears typical word processor grab corner re-size page layout application numbers one initially sees grid cells like spreadsheet user free size smaller canvas add multiple grids charts even drawings canvas difference subtle many features also implemented traditional programs like microsoft excel however difference ui significant excel instance charts stored part sheet moved inadvertently natural user actions numbers charts like everything else part canvas changes sheet normally independent iwork model bears resemblance earlier apple effort opendoc opendoc also used single underlying document engine along single on-disk format unlike iwork however opendoc also used single application various editors could invoked instance one could open generic document start spreadsheet editor add spreadsheet iwork lacks level flexibility editing terms maintains layout pages word processing application besides basic word processing functionality pages includes templates designed apple allow users create various types documents including newsletters invitations stationery résumés along number education-themed templates students teachers reports outlines pages 5 complete redesign removed 100 features pages 4.x including bookmarks mail merge linked text boxes multiple section capability ability set default zoom slowly adding back subsequent 5.x releases default zoom example set still linked text boxes multiple select mail merge book marks 90 features present version 4.3 along keynote numbers pages integrates apple ilife suite using media browser users drag drop movies photos music directly documents within pages application full screen view hides menubar toolbars outline mode allows users quickly create outlines easily rearranged dragging dropping well collapsed expanded pages includes support entering complex equations mathtype 6 reference citing using endnote x2 pages application open edit microsoft word documents including doc office open xml files plain text documents pages 5 longer read export rich text format documents pages also export documents doc pdf epub formats read write opendocument file formats word-processing application targeted towards creating attractive documents range applications lesson plans newsletters pages competes microsoft word microsoft publisher never ported os x apple free e-book pdf authoring application ibooks author adobe professional-market desktop publishing application indesign keynote application used create play presentations features comparable microsoft powerpoint though keynote contains several unique features keynote like pages numbers integrates ilife application suite users drag drop media imovie itunes iphoto aperture directly keynote presentations using media browser keynote contains number templates transitions effects magic move allows users apply simple transitions automatically animate images text repeated consecutive slides apple formerly released keynote remote application ios let users view slides presenter notes control keynote presentations iphone ipod touch wi-fi network functionality rolled subsequent releases main keynote ios application keynote supports number file formats default presentations saved .key files keynote open edit microsoft powerpoint .ppt files addition presentations exported microsoft powerpoint files quicktime movies also playable ipod iphone html files pdf files presentations also sent directly idvd itunes garageband iweb youtube keynote 09 file format backward compatible .key files saved keynote '09 opened earlier versions keynote numbers spreadsheet application added iwork suite 2007 release iwork '08 numbers like microsoft excel spreadsheet applications lets users organize data tables perform calculations formulas create charts graphs using data entered spreadsheet numbers however differs spreadsheet applications allows users create multiple tables single document flexible canvas many prebuilt templates including ones designed personal finance education business use included numbers 2.0 included iwork '09 several improvements charts pasted keynote pages automatically updated across documents changed numbers additionally numbers 2 lets users categorize data tables column collapsed summarized numbers 3.6 added ability open numbers '08 spreadsheets among things iwork.com free service enabled users share iwork '09 documents online directly within pages keynote numbers users could click iwork.com toolbar icon login using apple id upload document invite others view online viewers could leave comments notes document download copy iwork microsoft office pdf formats document owners could track comments iwork.com website released public beta january 6 2009 macworld conference expo iwork.com service provides web interface viewing downloading commenting uploaded documents contrast cloud-based office applications google docs office online offer editing iwork.com supported uploading pages '09 documents keynote '09 presentations numbers '09 spreadsheets users could download documents microsoft office pdf formats addition native iwork formats uploading documents iwork.com requires copy iwork '09 software suite apple id viewing commenting downloading require web browser invitation view document apple announced july 31 2012 users longer able publish new documents iwork.com iwork application documents stored iwork.com available download view shut date instead users use icloud share documents computers running os x mountain lion ios devices users attempting access iwork.com site re-directed apple homepage 2013 apple worldwide developers conference wwdc keynote speech iwork icloud announced release time next version app versions iwork later year three apps ios os x form apple iwork suite pages numbers keynote made available web interface named pages icloud numbers icloud keynote icloud respectively accessed via icloud website users icloud apple id login also sync users ios os x versions app via icloud apple id later 2013 iwork icloud update added support real-time collaboration document could opened collaborators time everyone could make changes simultaneously took seconds changes propagate collaborators however could work together ios os x apps would cause out-of-sync dialogs editing together collaborators using iwork icloud 2016 apple announced real-time collaboration feature available ios os x apps allows user edit create documents web using one supported browsers currently safari chrome internet explorer also means microsoft windows users access native –previously apple device– document editing tools via web interface iwork icloud limited set features compared os x version applications instance fonts available limited web version n't fully support printing may display documents created support external plug-ins incorrectly/improperly 2014 iwork icloud update adds 8 languages 50 new fonts improved editing cloud-based versions pages numbers keynote june 7 2010 showcasing new iphone 4 apple posted screenshots device action inadvertently showed possibility opening email attachment inside keynote leading believe iphone version iwork suite would soon available ios app store june 28 2010 several websites reported attempt sell applecare iphone 4 several examples services offered given including one read using iwork iphone apple-branded iphone apps sites also report quickly removed may 31 2011 apple released press statement iwork would available ios app store iphone ipod touch september 10 2013 apple announced iwork imovie iphoto would available download free new ios devices activated september 1 | [
6788,
7517,
3940,
7890,
4320,
2926,
4690,
734,
5752,
405,
6125,
2954,
1123,
2961,
6847,
4003,
1502,
6142,
2608,
2609,
5786,
1895,
1897,
4376,
5091,
4749,
5450,
7601,
6165,
4759,
3001,
2284,
7259,
120,
1940,
2300,
3025,
2665,
4653,
502,
... | Test |
2,610 | 3 | Reference_model:reference model reference model systems enterprise software engineering abstract framework domain-specific ontology consisting interlinked set clearly defined concepts produced expert body experts order encourage clear communication reference model represent component parts consistent idea business functions system components long represents complete set frame reference used communicate ideas clearly among members community reference models often illustrated set concepts indication relationships concepts according oasis organization advancement structured information standards reference model abstract framework understanding significant relationships among entities environment development consistent standards specifications supporting environment reference model based small number unifying concepts may used basis education explaining standards non-specialist reference model directly tied standards technologies concrete implementation details seek provide common semantics used unambiguously across different implementations number concepts rolled 'reference model concepts important many uses reference model one use create standards objects inhabit model relationships one another creating standards work engineers developers need create objects behave according standard made easier software written meets standard developers copy software use build software factory generates code done well standard make use design patterns support key qualities software ability extend software inexpensive way another use reference model educate using reference model leaders software development help break large problem space smaller problems understood tackled refined developers new particular set problems quickly learn different problems focus problems asked solve trusting areas well understood rigorously constructed level trust important allow software developers efficiently focus work third use reference model improve communication people reference model breaks problem entities things exist often explicit recognition concepts many people already share created explicit manner reference model useful defining concepts differ relate one another improves communication individuals involved using concepts fourth use reference model create clear roles responsibilities creating model entities relationships organization dedicate specific individuals teams making responsible solving problem concerns specific set entities example reference model describes set business measurements needed create balanced scorecard measurement assigned specific business leader allows senior manager hold team members responsible producing high quality results fifth use reference model allow comparison different things breaking problem space basic concepts reference model used examine two different solutions problem component parts solution discussed relation one another example reference model describes computer systems help track contacts business customers reference model used business decide five different software products purchase based needs reference model example could used compare well candidate solutions configured meet needs particular business process instances reference models include among others | [
4864,
3498,
3916
] | Validation |
2,611 | 0 | Zipf's_law:zipf law /math h n th generalized harmonic number| zipf law empirical law formulated using mathematical statistics refers fact many types data studied physical social sciences approximated zipfian distribution one family related discrete power law probability distributions zipf distribution related zeta distribution identical example zipf law states given corpus natural language utterances frequency word inversely proportional rank frequency table thus frequent word occur approximately twice often second frequent word three times often third frequent word etc rank-frequency distribution inverse relation example brown corpus american english text word frequently occurring word accounts nearly 7 word occurrences 69,971 slightly 1 million true zipf law second-place word accounts slightly 3.5 words 36,411 occurrences followed 28,852 135 vocabulary items needed account half brown corpus law named american linguist george kingsley zipf 1902–1950 popularized sought explain zipf 1935 1949 though claim originated french stenographer jean-baptiste estoup 1868–1950 appears noticed regularity zipf also noted 1913 german physicist felix auerbach 1856–1933 relationship occurs many rankings unrelated language population ranks cities various countries corporation sizes income rankings ranks number people watching tv channel appearance distribution rankings cities population first noticed felix auerbach 1913 empirically data set tested see whether zipf law applies checking goodness fit empirical distribution hypothesized power law distribution kolmogorov–smirnov test comparing log likelihood ratio power law distribution alternative distributions like exponential distribution lognormal distribution zipf law checked cities better fit found exponent 1.07 i.e formula_8 largest settlement formula_9 size largest settlement zipf law easily observed plotting data log-log graph axes log rank order log frequency example word described would appear x log 1 log 69971 also possible plot reciprocal rank frequency reciprocal frequency interword interval rank data conform zipf law extent plot linear formally let zipf law predicts population n elements normalized frequency elements rank k f k n zipf law holds number elements given frequency random variable power law distribution formula_11 claimed representation zipf law suitable statistical testing way analyzed 30,000 english texts goodness-of-fit tests yield 15 texts statistically compatible form zipf law slight variations definition zipf law increase percentage close 50 example frequency words english language n number words english language use classic version zipf law exponent 1 f k n fraction time k th common word occurs law may also written h n th generalized harmonic number simplest case zipf law ⁄ function given set zipfian distributed frequencies sorted common least common second common frequency occur ½ often first third common frequency occur ⅓ often first fourth common frequency occur ¼ often first n common frequency occur ⁄ often first however hold exactly items must occur integer number times 2.5 occurrences word nevertheless fairly wide ranges fairly good approximation many natural phenomena obey zipf law human languages word frequencies heavy-tailed distribution therefore modeled reasonably well zipf distribution close 1 long exponent exceeds 1 possible law hold infinitely many words since 1 ζ riemann zeta function although zipf ’ law holds languages even non-natural ones like esperanto reason still well understood however may partially explained statistical analysis randomly generated texts wentian li shown document character chosen randomly uniform distribution letters plus space character words different lengths follow macro-trend zipf law probable words shortest equal probability vitold belevitch paper statistical laws linguistic distribution offered mathematical derivation took large class well-behaved statistical distributions normal distribution expressed terms rank expanded expression taylor series every case belevitch obtained remarkable result first-order truncation series resulted zipf law second-order truncation taylor series resulted mandelbrot law principle least effort another possible explanation zipf proposed neither speakers hearers using given language want work harder necessary reach understanding process results approximately equal distribution effort leads observed zipf distribution similarly preferential attachment intuitively rich get richer success breeds success results yule–simon distribution shown fit word frequency versus rank language population versus city rank better zipf law originally derived explain population versus rank species yule applied cities simon zipf law fact refers generally frequency distributions rank data relative frequency n th-ranked item given zeta distribution 1/ n ζ parameter 1 indexes members family probability distributions indeed zipf law sometimes synonymous zeta distribution since probability distributions sometimes called laws distribution sometimes called zipfian distribution generalization zipf law zipf–mandelbrot law proposed benoît mandelbrot whose frequencies constant reciprocal hurwitz zeta function evaluated practice easily observable distribution plots large corpora observed distribution modelled accurately sum separate distributions different subsets subtypes words follow different parameterizations zipf–mandelbrot distribution particular closed class functional words exhibit lower 1 open-ended vocabulary growth document size corpus size require greater 1 convergence generalized harmonic series zipfian distributions obtained pareto distributions exchange variables zipf distribution sometimes called discrete pareto distribution analogous continuous pareto distribution way discrete uniform distribution analogous continuous uniform distribution tail frequencies yule–simon distribution approximately choice ρ 0 parabolic fractal distribution logarithm frequency quadratic polynomial logarithm rank markedly improve fit simple power-law relationship like fractal dimension possible calculate zipf dimension useful parameter analysis texts argued benford law special bounded case zipf law connection two laws explained originating scale invariant functional relations statistical physics critical phenomena ratios probabilities benford law constant leading digits data satisfying zipf law 1 satisfy benford law information theory symbol event signal probability formula_16 contains formula_17 bits information hence zipf law natural numbers formula_18 equivalent number formula_19 containing formula_20 bits information add information symbol probability formula_16 information already stored natural number formula_19 go formula_23 formula_24 equivalently formula_25 instance standard binary system would formula_26 optimal formula_27 probability distribution using formula_25 rule general probability distribution base asymmetric numeral systems family entropy coding methods used data compression state distribution also governed zipf law zipf law also used extraction parallel fragments texts comparable corpora primary secondary international conference bioinformatics computational biology 2011 | [
4385,
1573,
5304,
5688,
7348
] | Test |
2,612 | 5 | T/TCP:t/tcp t/tcp transactional transmission control protocol variant transmission control protocol tcp experimental tcp extension efficient transaction-oriented request/response service developed fill gap tcp udp bob braden 1994 definition found rfc 1644 obsoletes rfc 1379 faster tcp delivery reliability comparable tcp t/tcp suffers several major security problems described charles hannum september 1996 gained widespread popularity rfc 1379 rfc 1644 define t/tcp moved historic status may 2011 rfc 6247 security reasons tcp fast open recent alternative | [
7148,
456,
6879,
2281,
6521,
6976,
3775,
3855,
2644,
7170,
6531,
1462,
2650,
7637,
2119,
6908,
7091,
2219,
3383,
3640,
3797,
2043,
3312,
414,
2057,
3819,
3820,
3821,
66,
7214,
7217,
7765,
2068,
259,
5880
] | Test |
2,613 | 4 | Laura_Holmes:laura holmes laura holmes 1932-2016 noted cryptanalyst 2011 inductee nsa hall honor 1980s laura holmes served career cryptanalyst supervisor series challenging manual cryptosystems also developed considerable expertise impressive number target languages office analyzed 100 manual systems variety targets none systems monoalphabetic contained nontrivial trick made analysis especially difficult many cases problem marked small quantities traffic despite tough obstacles ms. holmes unexpectedly high rate success | [] | Test |
2,614 | 3 | SpiNNaker:spinnaker spinnaker spiking neural network architecture massively parallel manycore supercomputer architecture designed advanced processor technologies research group apt school computer science university manchester composed 57,600 arm9 processors specifically arm968 18 cores 128 mb mobile ddr sdram totalling 1,036,800 cores 7 tb ram computing platform based spiking neural networks useful simulating human brain see human brain project completed design housed 10 19-inch racks rack holding 100,000 cores cards holding chips held 5 blade enclosures core emulates 1000 neurons total goal simulate behavior aggregates billion neurons real time machine requires 100 kw 240 v supply air-conditioned environment spinnaker used one component neuromorphic computing platform human brain project october 14 2018 hbp announced million core milestone achieved | [
1616,
6507,
1254,
3263,
8065,
5371,
3680,
7627,
7442,
651,
5571,
5666,
7372,
5939,
3723,
6922,
3895,
8013,
7290,
2054,
6756,
1678,
515,
8024,
1592,
5429,
4543,
6778,
1989,
1607,
84,
1901,
5008,
1805
] | Test |
2,615 | 4 | Confused_deputy_problem:confused deputy problem information security confused deputy problem often cited example capability-based security important confused deputy legitimate privileged computer program tricked another program misusing authority system specific type privilege escalation capability systems protect confused deputy problem whereas access control list-based systems original example confused deputy program provides compilation services programs normally client program specifies name input output files server given access files client compiler service pay-per-use compiler service stores billing information file dubbed bill access situation client calls service names output file bill confused deputy problem occurs service opens output file even though client access file service open succeeds server writes compilation output file bill normal overwriting thus destroying billing information example compilation service deputy acting request client service seen 'confused tricked overwriting billing file whenever program tries access file operating system needs know two things file program asking whether program permission access file example file designated name “ bill ” server receives file name client know whether client permission write file server opens file system uses server ’ permission client ’ file name passed client server permission go along permission increased system silently automatically essential attack billing file designated name represented string essential points confidence trick based scams based gaining trust victim order attacker use confused deputy example salting attacker presents victim appears mineral-rich mine case attacker using victim greed persuade perform action victim would normally checking grocery store cashier scan barcode item determine total cost thief could replace barcodes items cheaper items attack cashier confused deputy using seemingly valid barcodes determine total cost cross-site request forgery csrf example confused deputy attack uses web browser perform sensitive actions web application common form attack occurs web application uses cookie authenticate requests transmitted browser using javascript attacker force browser transmitting authenticated http requests samy computer worm used cross-site scripting xss turn browser authenticated myspace session confused deputy using xss worm forced browser posting executable copy worm myspace message viewed executed friends infected user clickjacking attack user acts confused deputy attack user thinks harmlessly browsing website attacker-controlled website fact tricked performing sensitive actions another website ftp bounce attack allow attacker connect indirectly tcp ports attacker machine access using remote ftp server confused deputy another example relates personal firewall software restrict internet access specific applications applications circumvent starting browser instructions access specific url browser authority open network connection even though application firewall software attempt address prompting user cases one program starts another accesses network however user frequently sufficient information determine whether access legitimate—false positives common substantial risk even sophisticated users become habituated clicking ok prompts every program misuses authority confused deputy sometimes misuse authority simply result program error confused deputy problem occurs designation object passed one program another associated permission changes unintentionally without explicit action either party insidious neither party anything explicit change authority systems possible ask operating system open file using permissions another client solution drawbacks simplest way solve confused deputy problem bundle together designation object permission access object exactly capability using capability security compiler example client would pass server capability output file file descriptor rather name file since lacks capability billing file designate file output cross-site request forgery example url supplied cross -site would include authority independent client web browser | [
180,
3932,
2090,
5814,
4771,
1361,
7072,
6725,
5571,
6107,
2577,
7554,
2859,
843,
5504,
8111,
7570,
5611,
7414,
3594,
1805
] | Train |
2,616 | 4 | Operations_security:operations security operations security opsec process identifies critical information determine friendly actions observed enemy intelligence determines information obtained adversaries could interpreted useful executes selected measures eliminate reduce adversary exploitation friendly critical information general sense opsec process protecting individual pieces data could grouped together give bigger picture called aggregation opsec protection critical information deemed mission essential military commanders senior leaders management decision-making bodies process results development countermeasures include technical non-technical measures use email encryption software taking precautions eavesdropping paying close attention picture taken items background talking openly social media sites information unit activity organization critical information list term operations security coined united states military vietnam war opsec five-step iterative process assists organization identifying specific pieces information requiring protection employing measures protect br opsec assessment formal application process existing operation activity multidisciplinary team experts assessments identify requirements additional opsec measures required changes existing ones additionally opsec planners working closely public affairs personnel must develop essential elements friendly information eefi used preclude inadvertent public disclosure critical sensitive information term eefi phased favor critical information affected agencies use term minimizing confusion 1966 united states admiral ulysses sharp established multidisciplinary security team investigate failure certain combat operations vietnam war operation dubbed operation purple dragon included personnel national security agency department defense operation concluded purple dragon team codified recommendations called process operations security order distinguish process existing processes ensure continued inter-agency support 1988 president ronald reagan signed national security decision directive nsdd 298 document established national operations security program named director national security agency executive agent inter-agency opsec support document also established interagency opsec support staff ioss although originally developed us military methodology operations security adopted worldwide military private sector operations 1992 north atlantic treaty organization nato added opsec glossary terms definitions private sector also adopted opsec defensive measure competitive intelligence collection efforts military private sector security information firms often require opsec professionals certification often initially obtained military governmental organizations | [
7725,
7282,
1805
] | Test |
2,617 | 2 | Physical_address:physical address computing physical address also real address binary address memory address represented form binary number address bus circuitry order enable data bus access particular storage cell main memory register memory mapped i/o device computer supporting virtual memory term physical address used mostly differentiate virtual address particular computers utilizing memory management unit mmu translate memory addresses virtual physical addresses refer address translation performed mmu respectively depending upon underlying computer architecture performance computer may hindered unaligned access memory example 16-bit computer 16-bit memory data bus intel 8086 generally less overhead access aligned even address case fetching one 16-bit value requires single memory read operation single transfer data bus 16-bit data value starts odd address processor may need perform two memory read cycles load value i.e one low address throwing away half second read cycle load high address throwing away half retrieved data processors motorola 68000 motorola 68010 processors sparc processors unaligned memory accesses result exception raised usually resulting software exception posix sigbus raised direct memory access dma feature allows devices mother board cpu address main memory devices therefore also need knowledge physical addresses | [
6593,
2633,
8066,
4039,
1454,
8174,
7071,
1640,
5305,
8097,
5751,
4254,
6922,
1117,
416,
4810,
4920,
3905,
4359,
5079,
4365,
4370,
352,
5181,
971,
7597,
1803
] | Test |
2,618 | 4 | SQL_Slammer:sql slammer sql slammer 2003 computer worm caused denial service internet hosts dramatically slowed general internet traffic spread rapidly infecting 75,000 victims within ten minutes program exploited buffer overflow bug microsoft sql server desktop engine database products although ms02-039 patch released six months earlier many organizations yet applied worm based proof concept code demonstrated black hat briefings david litchfield initially discovered buffer overflow vulnerability worm exploited small piece code little generate random ip addresses send addresses selected address happens belong host running unpatched copy microsoft sql server resolution service listening udp port 1434 host immediately becomes infected begins spraying internet copies worm program home pcs generally vulnerable worm unless msde installed worm small contain code write disk stays memory easy remove example symantec provides free removal utility see external link even removed restarting sql server although machine would likely reinfected immediately worm made possible software security vulnerability sql server first reported microsoft 24 july 2002 patch available microsoft six months prior worm launch many installations patched – including many microsoft worm began noticed early 25 january 2003 slowed systems worldwide slowdown caused collapse numerous routers burden extremely high bombardment traffic infected servers normally traffic high routers handle routers supposed delay temporarily stop network traffic instead routers crashed became unusable neighbour routers would notice routers stopped contacted aka removed routing table routers started sending notices effect routers knew flood routing table update notices caused additional routers fail compounding problem eventually crashed routers maintainers restarted causing announce status leading another wave routing table updates soon significant portion internet bandwidth consumed routers communicating update routing tables ordinary data traffic slowed cases stopped altogether sql slammer worm small size sometimes able get legitimate traffic two key aspects contributed sql slammer rapid propagation worm infected new hosts sessionless udp protocol entire worm 376 bytes fits inside single packet result infected host could instead simply fire forget packets rapidly possible | [
2173,
3932,
2724,
7715,
2733,
6715,
6526,
476,
4231,
5828,
7186,
1019,
6560,
3220,
3575,
2876,
1500,
1594,
954,
862,
5611,
3154
] | Validation |
2,619 | 9 | Scala_(programming_language):scala programming language scala general-purpose programming language providing support functional programming strong static type system designed concise many scala design decisions aimed address criticisms java scala source code intended compiled java bytecode resulting executable code runs java virtual machine scala provides language interoperability java libraries written either language may referenced directly scala java code like java scala object-oriented uses curly-brace syntax reminiscent c programming language unlike java scala many features functional programming languages like scheme standard ml haskell including currying type inference immutability lazy evaluation pattern matching also advanced type system supporting algebraic data types covariance contravariance higher-order types higher-rank types anonymous types features scala present java include operator overloading optional parameters named parameters raw strings conversely feature java scala checked exceptions proved controversial name scala portmanteau scalable language signifying designed grow demands users design scala started 2001 école polytechnique fédérale de lausanne epfl lausanne switzerland martin odersky followed work funnel programming language combining ideas functional programming petri nets odersky formerly worked generic java javac sun java compiler internal release late 2003 scala released publicly early 2004 java platform second version v2.0 followed march 2006 17 january 2011 scala team five-year research grant €2.3 million european research council 12 may 2011 odersky collaborators launched typesafe inc. later renamed lightbend inc. company provide commercial support training services scala typesafe received 3 million investment 2011 greylock partners scala runs java platform java virtual machine compatible existing java programs android applications typically written java translated java bytecode dalvik bytecode may translated native machine code installation packaged scala java compatibility makes well-suited android development functional approach preferred reference scala software distribution including compiler libraries released apache license scala.js scala compiler compiles javascript making possible write scala programs run web browsers node.js compiler development since 2013 announced longer experimental 2015 v0.6 version v1.0.0-m1 released june 2018 2019 still m7 scala native scala compiler targets llvm compiler infrastructure create executable code uses lightweight managed runtime uses boehm garbage collector project led denys shabalin first release 0.1 14 march 2017 development scala native began 2015 goal faster just-in-time compilation jvm eliminating initial runtime compilation code also providing ability call native routines directly reference scala compiler targeting .net framework common language runtime released june 2004 officially dropped 2012 hello world program written scala form unlike stand-alone hello world application java class declaration nothing declared static singleton object created object keyword used instead program stored file helloworld.scala user compiles command runs analogous process compiling running java code indeed scala compiling executing model identical java making compatible java build tools apache ant shorter version hello world scala program scala includes interactive shell scripting support saved file named codice_1 run script prior compiling using commands also entered directly scala interpreter using option expressions entered interactively repl following example shows differences java scala syntax syntactic differences code syntactic relaxations designed allow support domain-specific languages basic syntactic differences following example contrasts definition classes java scala code shows conceptual differences java scala handling classes scala compiling model java c namely separate compiling dynamic class loading scala code call java libraries scala operational characteristics java scala compiler generates byte code nearly identical generated java compiler fact scala code decompiled readable java code exception certain constructor operations java virtual machine jvm scala code java code indistinguishable difference one extra runtime library codice_35 scala adds large number features compared java fundamental differences underlying model expressions types make language theoretically cleaner eliminate several corner cases java scala perspective practically important several added features scala also available c examples include mentioned scala good deal syntactic flexibility compared java following examples may seem like questionable choices collectively serve purpose allowing domain-specific languages defined scala without needing extend compiler example erlang special syntax sending message actor i.e codice_67 implemented scala library without needing language extensions java makes sharp distinction primitive types e.g codice_68 codice_69 reference types class reference types part inheritance scheme deriving codice_70 scala types inherit top-level class codice_71 whose immediate children codice_72 value types codice_73 codice_74 codice_75 reference types java means java distinction primitive types boxed types e.g codice_68 vs. codice_77 present scala boxing unboxing completely transparent user scala 2.10 allows new value types defined user instead java foreach loops looping iterator scala codice_78-expressions similar list comprehensions languages haskell combination list comprehensions generator expressions python for-expressions using codice_79 keyword allow new collection generated iterating existing one returning new collection type translated compiler series codice_64 codice_65 codice_66 calls codice_79 used code approximates imperative-style loop translating codice_84 simple example result running following vector complex example iterating map expression codice_88 example pattern matching see iterating map returns set key-value tuples pattern-matching allows tuples easily destructured separate variables key value similarly result comprehension also returns key-value tuples automatically built back map source object variable codice_89 map note codice_89 instead held list set array collection tuples exactly code would yield new collection type supporting object-oriented features available java fact augmenting various ways scala also provides large number capabilities normally found functional programming languages together features allow scala programs written almost completely functional style also allow functional object-oriented styles mixed examples unlike c java similar languages lisp scala makes distinction statements expressions statements fact expressions evaluate value functions would declared returning codice_24 c java statements like codice_92 logically return value scala considered return type codice_25 singleton type one object type functions operators never return e.g codice_94 operator function always exits non-locally using exception logically return type codice_95 special type containing objects bottom type i.e subclass every possible type turn makes type codice_95 compatible every type allowing type inference function correctly similarly codice_97 statement actually expression produces value i.e result evaluating one two branches means block code inserted wherever expression desired obviating need ternary operator scala similar reasons codice_7 statements unnecessary scala fact discouraged lisp last expression block code value block code block code body function returned function make clear functions expressions even methods return codice_25 written equals sign equivalently type inference omitting unnecessary braces due type inference type variables function return values many expressions typically omitted compiler deduce examples codice_100 immutable constant immutable object codice_101 variable whose value later changed type inference scala essentially local contrast global hindley-milner algorithm used haskell ml purely functional languages done facilitate object-oriented programming result certain types still need declared notably function parameters return types recursive functions e.g return type declared recursive function scala functions objects convenient syntax exists specifying anonymous functions example expression codice_102 specifies function one parameter compares argument see less 2 equivalent lisp form codice_103 note neither type codice_104 return type need explicitly specified generally inferred type inference explicitly specified e.g codice_105 even codice_106 anonymous functions behave true closures automatically capture variables lexically available environment enclosing function variables available even enclosing function returns unlike case java anonymous inner classes need declared final even possible modify variables mutable modified value available next time anonymous function called even shorter form anonymous function uses placeholder variables example following written concisely even scala enforces distinction immutable unmodifiable read-only variables whose value changed assigned mutable variables changed similar distinction made immutable mutable objects distinction must made variable declared immutable variables declared codice_5 mutable variables use codice_6 similarly collection objects container types scala e.g linked lists arrays sets hash tables available mutable immutable variants immutable variant considered basic default implementation immutable variants persistent data types create new object encloses old object adds new member similar linked lists built lisp elements prepended creating new cons cell pointer new element head old list tail allows easy concurrency — locks needed shared objects ever modified immutable structures also constructed efficiently sense modified instances reuses old instance data unused/unreferenced parts collected gc evaluation strict eager default words scala evaluates expressions soon available rather needed however possible declare variable non-strict lazy codice_112 keyword meaning code produce variable value evaluated first time variable referenced non-strict collections various types also exist type codice_113 non-strict linked list collection made non-strict codice_114 method non-strict collections provide good semantic fit things like server-produced data evaluation code generate later elements list turn triggers request server possibly located somewhere else web happens elements actually needed functional programming languages commonly provide tail call optimization allow extensive use recursion without stack overflow problems limitations java bytecode complicate tail call optimization jvm general function calls tail call optimized mutually recursive functions trampolines suggested workaround trampoline support provided scala library object codice_115 since scala 2.8.0 released 14 july 2010 function may optionally annotated codice_116 case compile unless tail recursive scala built-in support pattern matching thought sophisticated extensible version switch statement arbitrary data types matched rather simple types like integers booleans strings including arbitrary nesting special type class known case class provided includes automatic support pattern matching used model algebraic data types used many functional programming languages perspective scala case class simply normal class compiler automatically adds certain behaviors could also provided manually e.g. definitions methods providing deep comparisons hashing destructuring case class constructor parameters pattern matching example definition quicksort algorithm using pattern matching idea partition list elements less pivot elements less recursively sort part paste results together pivot uses divide-and-conquer strategy mergesort fast sorting algorithms codice_117 operator used pattern matching object stored codice_118 codice_119 expression tried turn see match first match determines result case codice_120 matches literal object codice_120 codice_122 matches non-empty list simultaneously destructures list according pattern given case associated code access local variable named codice_123 holding head list another variable codice_124 holding tail list note variables read-only semantically similar variable bindings established using codice_125 operator lisp scheme pattern matching also happens local variable declarations case return value call codice_126 tuple — case two lists tuples differ types containers e.g lists always fixed size elements differing types — although pattern matching easiest way fetching two parts tuple form codice_127 declaration anonymous function placeholder variable see section anonymous functions list operators codice_128 adds element onto beginning list similar codice_129 lisp scheme codice_130 appends two lists together similar codice_131 lisp scheme appear despite appearances nothing built-in either operators specified string symbols serve function name method applied object written infix -style without period parentheses line written could also written thus standard method-call notation methods end colon right-associative bind object right pattern-matching example body codice_117 operator partial function consists series codice_119 expressions first matching expression prevailing similar body switch statement partial functions also used exception-handling portion codice_136 statement finally partial function used alone result calling equivalent codice_117 example prior code quicksort written thus read-only variable declared whose type function lists integers lists integers bind partial function note single parameter partial function never explicitly declared named however still call variable exactly normal function scala pure object-oriented language sense every value object data types behaviors objects described classes traits class abstractions extended subclassing flexible mixin-based composition mechanism avoid problems multiple inheritance traits scala replacement java interfaces interfaces java versions 8 highly restricted able contain abstract function declarations led criticism providing convenience methods interfaces awkward methods must reimplemented every implementation extending published interface backwards-compatible way impossible traits similar mixin classes nearly power regular abstract class lacking class parameters scala equivalent java constructor parameters since traits always mixed class codice_138 operator behaves specially traits allowing traits chained using composition addition inheritance following example simple window system variable may declared thus result calling codice_139 words call codice_140 first executed code codice_141 last trait mixed codice_142 calls threaded back mixed-in traits eventually code codice_143 even though none traits inherited one another similar decorator pattern concise less error-prone n't require explicitly encapsulating parent window explicitly forwarding functions whose implementation n't changed relying run-time initialization entity relationships languages similar effect could achieved compile-time long linear chain implementation inheritance disadvantage compared scala one linear inheritance chain would declared possible combination mix-ins scala equipped expressive static type system mostly enforces safe coherent use abstractions type system however sound particular type system supports scala able infer types usage makes static type declarations optional static types need explicitly declared unless compiler error indicates need practice static type declarations included sake code clarity common technique scala known enrich library originally termed pimp library martin odersky 2006 though concerns raised phrasing due negative connotation immaturity allows new methods used added existing types similar c concept extension methods powerful technique limited adding methods instance used implement new interfaces scala technique involves declaring implicit conversion type receiving method new type typically class wraps original type provides additional method method found given type compiler automatically searches applicable implicit conversions types provide method question technique allows new methods added existing class using add-on library code imports add-on library gets new functionality code unaffected following example shows enrichment type codice_73 methods codice_145 codice_146 importing members codice_147 brings implicit conversion extension class codice_148 scope scala standard library includes support actor model addition standard java concurrency apis lightbend inc. provides platform includes akka separate open-source framework provides actor-based concurrency akka actors may distributed combined software transactional memory transactors alternative communicating sequential processes csp implementations channel-based message passing communicating scala objects simply via jcsp actor like thread instance mailbox created codice_149 overriding codice_150 method receive messages using codice_151 exclamation point method send message following example shows echoserver receive messages print scala also comes built-in support data-parallel programming form parallel collections integrated standard library since version 2.9.0 following example shows use parallel collections improve performance besides actor support data-parallelism scala also supports asynchronous programming futures promises software transactional memory event streams well-known open-source cluster-computing solution written scala apache spark additionally apache kafka publish–subscribe message queue popular spark stream processing technologies written scala several ways test code scala scalatest supports multiple testing styles integrate java-based testing frameworks scalacheck library similar haskell quickcheck specs2 library writing executable software specifications scalamock provides support testing high-order curried functions junit testng popular testing frameworks written java scala often compared groovy clojure two programming languages also using jvm substantial differences languages found type system extent language supports object-oriented functional programming similarity syntax syntax java scala statically typed groovy clojure dynamically typed makes type system complex difficult understand allows almost type errors caught compile-time result significantly faster execution contrast dynamic typing requires testing ensure program correctness generally slower order allow greater programming flexibility simplicity regarding speed differences current versions groovy clojure allow optional type annotations help programs avoid overhead dynamic typing cases types practically static overhead reduced using recent versions jvm enhanced invoke dynamic instruction methods defined dynamically typed arguments advances reduce speed gap static dynamic typing although statically typed language like scala still preferred choice execution efficiency important regarding programming paradigms scala inherits object-oriented model java extends various ways groovy also strongly object-oriented focused reducing verbosity clojure object-oriented programming deemphasised functional programming main strength language scala also many functional programming facilities including features found advanced functional languages like haskell tries agnostic two paradigms letting developer choose two paradigms frequently combination thereof regarding syntax similarity java scala inherits much java syntax case groovy clojure hand follows lisp syntax different appearance philosophy however learning scala also considered difficult many advanced features case groovy despite also feature-rich language mainly designed mainly scripting language jvm-based languages clojure groovy kotlin scala significantly less popular original java language usually ranked first second also simultaneously evolving time popularity programming language index tracks searches language tutorials ranked scala 15th april 2018 small downward trend makes scala popular jvm-based language java although immediately followed kotlin jvm-based language strong upward trend ranked 16th tiobe index programming language popularity employs internet search engine rankings similar publication-counting determine language popularity april 2018 shows scala 34th place dropped four places last two years but–as mentioned bugs change requests –tiobe aware issues methodology using search terms might commonly used programming language communities ranking scala ahead functional languages like haskell 42nd erlang languages like swift 15th perl 16th go 19th clojure 30th thoughtworks technology radar opinion based biannual report group senior technologists recommended scala adoption languages frameworks category 2013 july 2014 assessment made specific refers scala good parts described successfully use scala need research language strong opinion parts right creating definition scala good parts. redmonk programming language rankings establishes rankings based number github projects questions asked stack overflow ranks scala 14th scala placed inside second-tier group languages–ahead go powershell haskell behind swift objective-c typescript r. however 2018 report rankings noted drop scala rank third time row questioning much available oxygen scala consumed kotlin latter continues rocket rankings 2018 edition state java survey collected data 5160 developers various java-related topics scala places third terms usage alternative languages jvm compared last year edition survey scala usage among alternative jvm languages fell almost quarter 28.4 21.5 overtaken kotlin rose 11.4 2017 28.8 2018 march 2015 former vp platform engineering group twitter raffi krikorian stated would chosen scala 2011 due learning curve month linkedin svp kevin scott stated decision minimize dependence scala november 2011 yammer moved away scala reasons included learning curve new team members incompatibility one version scala compiler next | [
2176,
5015,
4295,
6415,
1445,
1819,
4302,
4303,
1450,
1825,
718,
6428,
6095,
1435,
1848,
5751,
401,
4705,
7557,
5408,
417,
54,
7582,
775,
6497,
6156,
5091,
2624,
6507,
1524,
3684,
1158,
7238,
5106,
103,
6886,
7246,
4039,
109,
5117,
3368... | Test |
2,620 | 4 | CRIME:crime crime compression ratio info-leak made easy security exploit secret web cookies connections using https spdy protocols also use data compression used recover content secret authentication cookies allows attacker perform session hijacking authenticated web session allowing launching attacks crime assigned cve-2012-4929 vulnerability exploited combination chosen plaintext attack inadvertent information leakage data compression similar described 2002 cryptographer john kelsey relies attacker able observe size ciphertext sent browser time inducing browser make multiple carefully crafted web connections target site attacker observes change size compressed request payload contains secret cookie sent browser target site variable content created attacker variable content altered size compressed content reduced inferred probable part injected content matches part source includes secret content attacker desires discover divide conquer techniques used home true secret content relatively small number probe attempts small multiple number secret bytes recovered crime exploit hypothesized adam langley first demonstrated security researchers juliano rizzo thai duong also created beast exploit exploit due revealed full 2012 ekoparty security conference rizzo duong presented crime general attack works effectively large number protocols including limited spdy always compresses request headers tls may compress records http may compress responses crime defeated preventing use compression either client end browser disabling compression spdy requests website preventing use data compression transactions using protocol negotiation features tls protocol detailed transport layer security tls protocol version 1.2 client sends list compression algorithms clienthello message server picks one sends back serverhello message server choose compression method client offered client offers 'none compression data compressed similarly since 'no compression must allowed tls clients server always refuse use compression crime exploit spdy tls-level compression described mitigated then-latest versions chrome firefox web browsers websites applied countermeasures end nginx web-server vulnerable crime since 1.0.9/1.1.6 october/november 2011 using openssl 1.0.0+ since 1.2.2/1.3.2 june july 2012 using versions openssl note december 2013 crime exploit http compression mitigated rizzo duong warned vulnerability might even widespread spdy tls compression combined august 2013 black hat conference researchers gluck harris prado announced variant crime exploit http compression called breach short browser reconnaissance exfiltration via adaptive compression hypertext uncovers https secrets attacking inbuilt http data compression used webservers reduce network traffic | [
6966,
363,
794,
887,
6795,
1168,
1173,
2644,
1460,
2291,
5824,
2566,
8189,
8093,
6540,
3792,
5399,
6458,
6553,
2587,
4071,
7567,
7925,
57,
3899,
2691,
6049,
1594,
4990,
7214,
7771,
3588,
353,
1059,
1513,
359,
3426
] | Test |
2,621 | 4 | Null_character:null character null character also null terminator null byte control character value zero present many character sets including iso/iec 646 ascii c0 control code universal coded character set unicode ebcdic available nearly mainstream programming languages often abbreviated nul null though contexts term used null pointer different object original meaning character like nop—when sent printer terminal nothing terminals however incorrectly display space electromechanical teleprinters used computer output devices one null characters sent end printed line allow time mechanism return first printing position next line punched tape character represented holes new unpunched tape initially filled null characters often text could inserted reserved space null characters punching new characters tape nulls today character much significance c derivatives many data formats serves reserved character used signify end string often called null-terminated string allows string length overhead one byte alternative storing count requires either string length limit 255 overhead one byte advantages/disadvantages described null-terminated string null character often represented escape sequence codice_1 source code string literals character constants many languages c introduced notation separate escape sequence octal escape sequence single octal digit 0 consequence codice_1 must followed digits codice_3 codice_4 otherwise interpreted start longer octal escape sequence escape sequences found use various languages codice_5 codice_6 codice_7 codice_8 null character placed url percent code codice_9 ability represent null character always mean resulting string correctly interpreted many programs consider null end string thus ability type case unchecked user input creates vulnerability known null byte injection lead security exploits caret notation null character codice_10 keyboards one enter null character holding pressing us layouts often work need get sign documentation null character sometimes represented single-em-width symbol containing letters nul unicode character corresponding glyph visual representation null character symbol null u+2400 ␀ —not confused actual null character u+0000 modern character sets null character code point value zero encodings translated single code unit zero value instance utf-8 single zero byte however modified utf-8 null character encoded two bytes 0xc0 0x80 allows byte value zero used character used string terminator | [
2086,
3932,
1623,
2822,
7798,
1534,
2104,
7533,
5381,
493,
7662,
2871,
2876,
4729,
5079,
2521,
2438,
174,
2710,
1435
] | Test |
2,622 | 4 | TinKode:tinkode răzvan manole cernăianu born 7 february 1992 nicknamed tinkode romanian computer security consultant hacker known gaining unauthorized access computer systems many different organizations posting proof exploits online commonly hacks high profile websites sql injection vulnerabilities although unknown methods used recent attacks aliases included sysgh0st tinkode romanian claims born 1992 southern part country states hacking skills result extreme curiosity ambition targets well known websites powerful brands widespread influence either online community particular marketplace attacks often involve numeral seven tinkode fan social networks owning twitter account facebook account well many blogs royal navy website temporarily unavailable tinkode claimed hacked also breached security servers nasa posting screenshots ftp server within nasa earth observation system goddard space flight center claims gained access computers belonging european space agency also claims found vulnerabilities organizations including sun microsystems mysql kaspersky portugal us army youtube google websites tinkode never publicly criticized security experts mainly n't disclose full information regarding breached websites actually informed webmasters posting results online giving time fix vulnerability tinkode also received google security reward tuesday january 31 2012 tinkode placed arrest romanian authority diicot anti organised crime terrorism institution charge temporarily blocked information systems us army pentagon nasa association casi tinkode officially released april 27 2012 following arrest petition generated raise support tinkode wednesday february 8 2012 petition aimed diicot fbi give tinkode reasonable fair sentence claiming hacker n't malicious hacking curiosity released 3 months | [
623,
3486,
1805
] | Train |
2,623 | 1 | EclipseLink:eclipselink eclipselink open source eclipse persistence services project eclipse foundation software provides extensible framework allows java developers interact various data services including databases web services object xml mapping oxm enterprise information systems eis eclipselink supports number persistence standards including eclipselink based toplink product oracle contributed source code create eclipselink project original contribution toplink 11g code base entire code-base/feature set contributed ejb 2 container-managed persistence cmp minor oracle application server specific integration removed differs toplink essentials glassfish contribution include key enterprise features package names changed code configuration moved around toplink mapping workbench user interface also contributed project eclipselink intended path forward persistence oracle toplink intended next major release oracle toplink include eclipselink well next major release oracle application server eclipselink supports usage osgi environment sun microsystems selected eclipselink project reference implementation jpa 2.0. oracle jpa 2.1 | [
2624,
2180,
5571,
2660,
5228,
3479,
7109,
3813,
2506,
5426,
4185,
3915,
6594
] | Test |
2,624 | 1 | JOOQ_Object_Oriented_Querying:jooq object oriented querying jooq object oriented querying commonly known jooq light database-mapping software library java implements active record pattern purpose relational object oriented providing domain-specific language construct queries classes generated database schema jooq claims sql come first database integration thus introduce new textual query language rather allows constructing plain sql jooq objects code generated database schema jooq uses jdbc call underlying sql queries provides abstraction top jdbc jooq much functionality complexity standard object-relational mapping libraries eclipselink hibernate jooq closeness sql advantages typical object-relational mapping libraries sql many features used object oriented programming paradigm set differences referred object-relational impedance mismatch close sql jooq helps prevent syntax errors type mapping problems also variable binding taken care also possible jooq create complex queries involve aliasing unions nested selects complex joins jooq also supports database-specific features udts enum types stored procedures native functions nested query selecting aliased table equivalent jooq dsl simply using code generation database metadata generate constants | [
6507,
5801,
3077,
2180,
631,
3776,
7347,
8079,
5571,
2660,
6543,
7459,
3879,
7915,
2054,
684,
2519,
2520,
3915,
1989,
6319,
2619,
6594,
5711,
2623,
4287
] | Validation |
2,625 | 2 | ProgID:progid progid short programmatic identifier com term basically string like msxml2.domdocument represent underlying clsid something like f9043c85-f6f2-101a-a3c9-08002b2f49fb also used express binary code compatibility two com objects | [
4026
] | Test |
2,626 | 4 | Fail2ban:fail2ban fail2ban intrusion prevention software framework protects computer servers brute-force attacks written python programming language able run posix systems interface packet-control system firewall installed locally example iptables tcp wrapper fail2ban operates monitoring log files e.g /var/log/auth.log /var/log/apache/access.log etc selected entries running scripts based commonly used block selected ip addresses may belong hosts trying breach system security ban host ip address makes many login attempts performs unwanted action within time frame defined administrator includes support ipv4 ipv6 optionally longer bans custom-configure recidivist abusers keep coming back fail2ban typically set unban blocked host within certain period lock genuine connections may temporarily misconfigured however unban time several minutes usually enough stop network connection flooded malicious connections well reducing likelihood successful dictionary attack fail2ban perform multiple actions whenever abusive ip address detected update netfilter/iptables pf firewall rules tcp wrapper hosts.deny table reject abuser ip address email notifications user-defined action carried python script standard configuration ships filters apache lighttpd sshd vsftpd qmail postfix courier mail server filters defined python regexes may conveniently customized administrator familiar regular expressions combination filter action known jail causes malicious host blocked accessing specified network services well examples distributed software jail may created network-facing process creates log file access | [
5272,
7168,
3364,
5571,
7836,
7848,
4443,
7214,
1691,
5965,
3073,
3680
] | Test |
2,627 | 2 | Grab_(software):grab software grab utility program macos taking screenshots supports capturing marquee selection whole window whole screen well timed screenshots program originated openstep nextstep continued preinstalled apple macos version 10.13 high sierra replaced utility screenshot macos 10.14 macos versions 10.13 earlier grab found folder utilities subdirectory applications may quickly opened using spotlight function entering grab pressing typing /applications/utilities/grab.app application finder previously also found finder menu services grab mac os x v10.4 preview submenu item take screenshot file menu selection window timed screen recent versions macos grab saves screenshots tagged image file format tiff macos also possible save screenshots directly desktop pdf format earlier versions macos png format later versions using keystrokes shown drm reasons possible use software dvd player open grab helps determine size element screen using selection feature capturing screen one select inspector menu press dialog box appear dimensions selected area | [
3940,
713,
4690,
734,
405,
6832,
3989,
2597,
3322,
1502,
5786,
4740,
1897,
6505,
7609,
1171,
5109,
2284,
1178,
6188,
1187,
1562,
6909,
6548,
502,
6557,
2679,
6565,
2329,
3050,
163,
6582,
5535,
5191,
8051,
7335,
3445,
569,
5571,
7000,
62... | Test |
2,628 | 2 | Intelligent_Resource_Director:intelligent resource director ibm mainframes running z/os operating system intelligent resource director ird software automates management cpu resources certain i/o resources ird implemented collaboration workload manager wlm component z/os pr/sm logical partitioning lpar hypervisor function mainframe hardware major ird functions ird objective optimise use computing resources enabling wlm meet workload goals example ird vary offline logical processors point would cause workloads miss goals | [
5571
] | Test |
2,629 | 0 | Tatoeba:tatoeba tatoeba.org free collaborative online database example sentences geared towards foreign language learners name comes japanese term tatoeba 例えば tatoeba meaning example unlike online dictionaries focus words tatoeba focuses translation complete sentences addition structure database interface emphasize one-to-many relationships sentence multiple translations within single language translations languages readily visible indirect translations involve chain stepwise links one language another aim tatoeba project create database sentences translations used anyone developing language learning application idea project creates data programmers focus coding application data collected project freely available creative commons attribution cc-by license june 2019 tatoeba corpus 7,500,000 sentences 337 languages top 10 languages make 73 corpus ninety-eight languages 1,000 sentences top 14 languages 100,000 sentences interface available 48 different languages tatoeba.org also current home tanaka corpus public-domain series 150,000 english-japanese sentence pairs compiled hyogo university professor yasuhito tanaka first released 2001 undergoing latest revisions actual statistic languages found tatoeba founded trang ho 2006 originally hosted project sourceforge project name multilangdict users even registered search words language retrieve sentences use sentence tatoeba database displayed next translations languages direct indirect translations differentiated sentences tagged content subject matter dialect vulgarity also individual comment threads facilitate feedback corrections users cultural notes early 2016 200,000 sentences 19 languages audio readings sentences also browsed language tag audio registered users add new sentences translate proofread existing ones even target language native tongue however preferred users translate native strongest language add sentences native language rather translating adding target language translations linked original sentence automatically users freely edit sentences adopt correct sentences without owner comment others sentences advanced contributors rank ordinary contributors tag link unlink sentences corpus maintainers rank advanced contributors untag delete sentences also modify owned sentences though typically owner fails respond request make change tatoeba basic data structure series nodes links sentence node link bridges two sentences meaning entire tatoeba database published creative commons attribution 2.0 license freeing academic use tatoeba received grant mozilla drumbeat december 2010 work tatoeba infrastructure sponsored google summer code 2014 edition may 2018 received 25,000 mozilla open source support moss program grant parallel text corpora tatoeba used variety natural language processing tasks machine translation tatoeba data used data treebanking japanese statistical machine translation well wwwjdic japanese-english dictionary bilingual sentence pairs japanese reading translation practice www.manythings.org selected content tatoeba – 83,932 phrases esperanto along translations languages – appeared third edition multilingual dvd esperanto elektronike electronic esperanto published 6,000 copies e july 2011 tab-delimited data ready import anki similar software downloaded http //www.manythings.org/anki/ | [
3959,
5429,
7410,
2054,
5008,
3660
] | Test |
2,630 | 2 | Acorn_MOS:acorn mos acorn machine operating system mos os discontinued computer operating system used acorn bbc computer range included support four-channel sound graphics file system abstraction digital analogue i/o including daisy-chained expansion bus implementation single-tasking monolithic non-reentrant versions 0.10 1.20 used bbc micro version 1.00 electron version 2 used b+ versions 3 5 used bbc master series range final bbc computer bbc a3000 n't run operating system also included asterisk command line interface 32-bit ran risc os operating system used portions acorn mos architecture shared number characteristics commands vdu system earlier 8-bit mos versions 0 1 mos 16 kib size written 6502 machine code held rom motherboard upper quarter 16-bit address space 0xc000 0xffff reserved rom code i/o space versions 2 5 still restricted 16 kib address space managed hold code hence complex routines partly alternative 65c102 cpu denser instruction set plus careful use paging original mos versions 0 2 user interface per se applications expected forward operating system command lines os behalf bbc basic rom supplied bbc micro default application used purpose bbc micro would halt language error rom present advertises os ability provide user interface so-called language roms mos version 3 onwards feature simple command-line interface normally seen cmos contain setting default language rom application programs rom cassette disc-based software also typically provide command line useful working file storage browsing currently inserted disc os provides line entry facility obeys commands entered application oversees running command prompt cassette disc based software typically relies bbc basic user interface order loaded although possible configure floppy disc boot without needing basic commands executed practice rarely performed bbc basic os commands preceded asterisk passed via oscli keyword instruct basic forward command directly os led asterisk prompt symbol software providing os command line mos version 3 onwards officially uses asterisk command prompt symbol referring os command generally include asterisk part name example etc. although part asterisk command unrecognised commands offered service extension roms filing system roms often check see file disc matches name command-line interfaces operating system call osword accumulator 0 however offer programs single line input ctrl-u clear line cursor copying keys enabled basic character filtering line length limit mos command line interpreter features rather unusual idea abbreviation commands save typing dot could used first characters abbreviated alone command catalogue list cassette disc abbreviated right 3rd party roms generally also support command abbreviation leading ambiguity two service roms provide commands similar name possibly different functionality case mos would prioritise command rom higher numbered rom slot i.e 7 would take precedence 6 3rd party suppliers would get around prefixing star commands letters example watford electronics roms would star commands prefixed w therefore making unique lower 16 kib read-only memory map 0x8000 0xbfff reserved active sideways paged bank sideways system bbc micro allows one rom time sockets motherboard expansion boards switched main memory map software run rom way leaving ram free user program code workspace os extended way roms prevalent sideways rom basic acorn disc filing system used provide floppy disc support machine reset every paged rom switched asked much public private workspace needs rom allocated chunk private workspace remains allocated times single block public workspace equal size largest request made available active rom operation paged area rapidly switched roms file system commands issued unrecognised commands put os mos allocates 3.5 kib block memory 0x0000 0x0dff bottom memory map operating system language rom workspace cassette-only machine 0x0e00 start user program memory os extension roms fitted filing system rom memory allocated point dfs roms generally use another 2.75 kib cache disc catalogue manage random access buffers network filing system rom econet allocates another 0.5 kib top serious problem mos support relocation machine code must run address assembled programs assumed fixed start user program memory could overwrite mos workspace problem alleviated versions 3 5 allowing roms allocate workspace alternative ram bank 0xc000 0xdfff present master series computers though old roms could continue allocate blocks main memory os also maintains vector table calls updated hook os calls user extension altering 'hooking vectors developers could substitute routines provided defaults mos mos permits textual output intended screen directed instead printer allowing trivial printing support plain text graphics printing supported written separately graphics general screen output handled unusual way ascii control characters almost entirely given new significance mos known vdu drivers documentation described relation vdu statement bbc basic interpreted video control characters i.e ascii 30 moves cursor 0 0 vdu 4 5 select whether text drawn graphics text cursor vdu 12 clears screen vdu 14 15 turn scroll lock thus pressing ctrl-l clear screen ctrl-n enable scroll lock vdu 2 3 toggle whether screen output echoed printer bbc basic vdu statement equivalent conventional basic many control codes 12 clear screen 7 beep functions contemporary machines many control characters take parameters one characters follow used solely bit value parameter control code vdu 19 handles palette remap following five bytes represent palette entry desired colour three reserve bytes vdu 31 locates text cursor location held following two bytes vdu 17 sets text colour 18 graphics colour vdu 25 uses succeeding five bytes move graphics cursor plot solid dashed lines dots filled triangles documented extent graphics mos 0 1 first byte command code followed x co-ordinates two byte pairs graphic functions horizontal line fill bounded given colour available use undocumented poorly documented command codes bbc basic contained aliases commonly used vdu codes gcol vdu 18 plot vdu 25 statements direct equivalents vdu codes cls vdu 12 statements less exact equivalents incorporated functionality specific basic well calling os routines example statement would set screen mode adjust basic system variable himem according amount memory new mode left available basic would set screen mode without altering himem allowed programmer allocate block memory basic example load machine code routines lowering value himem start program still free switch screen modes without deallocating side effect single operating system command write character oswrch responsible text graphics example move cursor 10 15 could write 6502 assembler lda loads value accumulator jsr jump subroutine third os call cursor move following code would draw line 0 0 0 +100 bbc basic perform following graphics acorn mos use virtual graphics resolution 1280×1024 pixel positions mapped nearest equivalent pixel current graphics mode switching video resolution affect shape size position graphics drawn even completely different pixel metrics new mode accounted os acorn mos provide two os calls handle text output osnewl osasci osnewl writes line feed carriage return current output stream osasci forwards characters directly oswrch except carriage return triggers call osnewl instead precise code osasci osnewl five lines 6502 assembler documented bbc micro user guide acorn mos implements character recognition text printed screen system font selected arrow keys input key though typed activate screen editing user moves hardware cursor text read os displays second cursor software original position pressing copies one character hardware cursor software cursor advances holding key copies section text cursors wrapping around vertical edges screen necessary screen scrolls editing hardware cursor position adjusted follow text user make changes text copy user-defined characters recognised graphics modes screen editing terminated pressed usual effects character recognition made available users api call read character current cursor position sound generation carried another os call osword handles variety tasks enumerated via task code placed accumulator osword calls bear parameter block used send receive multiple data address block passed x registers low byte x high byte four buffered sound channels three melodic one noise-based sound chip found bbc micro one waveform melodic channels supported note parameters pitch duration amplitude envelope selection various control options amplitude parameter zero negative sets static amplitude positive value select amplitude pitch envelope predefined temporal variation apply note control parameters passed channel parameter include flush buffer cleared channel silenced note played synchronise count soon sync count received many channels synchronised notes played together control speech system upgrade fitted osword handles many functions sound many direct support basic may accessed basic setting parameter block loading address x task code calling routine bbc micro support second processor connected via tube allowed direct access system bus driver code tube interface present mos usually supplied external service rom os calls handle reading writing i/o ports screen memory programmers strongly advised use acorn documentation reason second processor installed user software run separate memory map far side tube processor bus direct access memory-mapped i/o registers video memory impossible however sake performance many apps including many games write directly main address space i/o hence crash give blank screen 6502 second processor attached one performance-critical area sprite support bbc micro hardware support sprites games must implement sprites software practice widespread use direct access place os calls rarely caused difficulties second processor units expensive little software written make use people bought could simply switch unplug cable problem arose mos contains two built-in file systems cassette rom quite similar try suitable rom installed share great deal code feature rudimentary copy protection mechanism file certain flag set loaded except execute prior amstrad launch mass-market twin cassette recorder 1987 home users facilities dub cassettes without loading files computer re-saving advanced disc filing system adfs installed standard master series similar mechanism versions bbc micro family starting 0.10 finishing 1.20 confusingly electron shipped version 1.00 despite released bbc micro version 1.20 first release rom electron mos version number intended api definition electron rom based bbc micro rom version 1.0 sense version bbc model b+ essentially mos 1.20 except addition support sideways shadow ram present b+ mos 3 mos 5 shipped bbc master series systems master 128 master et master compact models respectively initial release mos 3 expanded upon facilities provided mos 2 b+ support additional hardware provide command line facility extend vdu driver code enhanced graphics plotting abilities two notable versions made public version 3.20 common version 3.50 although functionality bug fixes 100 compatible popular applications software offered optional upgrade mos 4 stripped version mos 3 intended similarly stripped master et minor bugs fixed mos 5 shipped master compact much altered functionality removed highly amended exception mos 3.50 space reclaimed code area normally hidden input/output memory locations 768 bytes 0xfc00-0xfeff inclusive mos rom contained list names contributors system could recovered extracting rom reading contents eprom programmer device could access rom master setting test bit access control register using machine-code program copy rom directly text-mode screen memory full text credit string mos 1.20 follows spaces commas save memory c 1981 acorn computers ltd thanks due following contributors development bbc computer among others numerous mention david allen bob austin ram banerjee paul bond allen boothroyd cambridge cleartone john coll john cox andy cripps chris curry,6502 designers jeremy dion tim dobson joe dunn paul farrell ferranti steve furber jon gibbons andrew gordon lawrence hardwick dylan harris hermann hauser hitachi andy hopper icl martin jackson brian jones chris jordan david king david kitson paul kriwaczek computer laboratory peter miller arthur norman glyn phillips mike prees john radcliffe wilberforce road peter robinson richard russell kim spence-jones graham tebby jon thackray chris turner adrian warner roger wilson alan wright interviews 1993 2001 acorn co-founder hermann hauser recounted microsoft bill gates noticed 1.5 million bbc micros sold tried sell ms-dos acorn hauser considered adopting ms-dos would retrograde step comparison retaining acorn system | [
1522,
7794,
4670,
7718,
5571,
1284,
5232,
1654,
3306,
6380,
4540,
5877,
7588,
1237,
5190
] | Train |
2,631 | 2 | Security_Identifier:security identifier context microsoft windows nt line operating systems security identifier commonly abbreviated sid unique immutable identifier user user group security principal security principal single sid life given domain properties principal including name associated sid design allows principal renamed example jane smith jane jones without affecting security attributes objects refer principal windows grants denies access privileges resources based access control lists acls use sids uniquely identify users group memberships user logs computer access token generated contains user group sids user privilege level user requests access resource access token checked acl permit deny particular action particular object sids useful troubleshooting issues security audits windows server domain migrations format sid illustrated using following example s-1-5-21-3623811015-3361044348-30300820-1013 possible identifier authority values workgroup computers running windows nt/2k/xp possible user unexpected access shared files files stored removable storage circumvented setting access control lists susceptible file effective permissions determined user sid user sid duplicated another computer computer sid duplicated user sids built based computer sid sequential number user second computer sid could access files user first computer protected computers joined domain active directory nt domain instance computer unique domain sid recomputed time computer enters domain thus typically significant problems duplicated sids computers members domain especially local user accounts used local user accounts used potential security issue similar one described issue limited files resources protected local users opposed domain users duplicated sids usually problem microsoft windows systems microsoft used provide newsid utility change machine sid programs detect sids might problems security newsid retirement microsoft engineer mark russinovich posted article blog explaining retirement newsid stating neither windows security team could think situation duplicate sids could cause problems commonly accepted wisdom november 1 2009 microsoft added following newsid download page present supported mechanism duplicating disks windows operating systems use sysprep machine sid stored security registry hive located security\sam\domains\account key two values f v. v value binary value computer sid embedded within end data last 96 bits machine sid also used free-trial programs start8 prevent computer restarting trial though experienced users easily change machine sid service sids feature service isolation security feature introduced windows vista windows server 2008 service unrestricted sid-type property service-specific sid added access token service host process purpose service sids allow permissions single service managed without necessitating creation service accounts administrative overhead service sid local machine-level sid generated service name using following formula codice_1 sc.exe utility used generate arbitrary service sid codice_2 service also referred nt service\ service_name e.g nt service\dnscache | [
644,
6618,
2290,
3231,
2885,
7564,
2094,
5571,
5637,
6256,
7451,
7688,
7230,
380
] | Train |
2,632 | 4 | Mariposa_botnet:mariposa botnet mariposa botnet discovered december 2008 botnet mainly involved cyberscamming denial-of-service attacks botnet dismantled 23 december 2009 consisted 12 million unique ip addresses 1 million individual zombie computers infected butterfly mariposa spanish bot making one largest known botnets botnet originally created ddp team spanish días de pesadilla team english nightmare days team using malware program called butterfly bot also sold various individuals organisations goal malware program install uninfected pc monitoring activity passwords bank credentials credit cards malware would attempt self-propagate connectible systems using various supported methods msn p2p usb completing initial infection routine malware would contact command-and-control server within botnet command control server could used controllers botnet order issue orders botnet operations executed botnet diverse part parts botnet could rented third party individuals organizations confirmed activities include denial-of-service attacks e-mail spam theft personal information changing search results browser would display order show advertisements pop-up ads due size nature botnet total financial social impact difficult calculate initial estimates calculated removal malware alone could cost tens millions dollars apprehension botnet operators government officials also discovered list containing personal details 800,000 individuals could used sold identity theft purposes may 2009 mariposa working group mwg formed informal group composed defence intelligence georgia tech information security center panda security along additional unnamed security researchers law enforcement agencies goal group analysis extermination mariposa botnet 23 december 2009 mariposa working group managed take control mariposa botnet seizing control command-and-control servers used botnet operational owners botnet eventually succeeded regaining control botnet response launched denial-of-service attack defence intelligence attack managed knock internet connectivity large share isp customers included several canadian universities government agencies 3 february 2010 spanish national police arrested florencio carro ruiz alias netkairo suspected leader ddp team two additional arrests made 24 february 2010 jonathan pazos rivera alias jonyloleante juan jose bellido rios alias ostiator arrested suspicion members ddp 18 july 2010 matjaž škorjanc alias iserdo creator butterfly bot malware arrested maribor slovenian police first time released due lack evidence arrested october 2011 december 2013 škorjanc convicted slovenia creating malicious computer program hacking information systems assisting wrongdoings money laundering sentenced 4 years 10 months imprisonment fined €3,000 4,100 court also ordered seizure škorjanc property acquired proceeds crime appealed verdict fine february 2015 raised additional 25,000 eur 5 june 2019 us law enforcement opened new case operations mariposa butterfly bot bfbot malware gang fbi moved forward new charges arrest warrants four suspects including nicehash operator matjaž škorjanc | [
2173,
2376,
1632,
6715,
7441,
3281,
651,
7186,
2577,
5401,
6025,
6740,
6370,
5675,
7657,
7748,
142,
51,
7294,
2693,
2789,
1691,
7307,
3154,
7600,
2535,
4110,
6328
] | Validation |
2,633 | 2 | Thrashing_(computer_science):thrashing computer science computer science thrashing occurs computer virtual memory resources overused leading constant state paging page faults inhibiting application-level processing causes performance computer degrade collapse situation continue indefinitely either user closes running applications active processes free additional virtual memory resources term also used various similar phenomena particularly movement levels memory hierarchy process progresses slowly significant time spent acquiring resources virtual memory works treating portion secondary storage computer hard disk additional layer cache hierarchy virtual memory notable allowing processes use memory physically present main memory enabling virtual machines operating systems supporting virtual memory assign processes virtual address space process refers addresses execution context so-called virtual address order access data code variables address process must translate address physical address process known virtual address translation effect physical main memory becomes cache virtual memory general stored disk memory pages programs allocated certain number pages needed operating system active memory pages exist ram disk inactive pages removed cache written disk main memory becomes full processes utilizing main memory need additional memory pages cascade severe cache misses known page faults occur often leading noticeable lag operating system responsiveness process together futile repetitive page swapping occurs known thrashing frequently leads high runaway cpu utilization grind system halt modern computers thrashing may occur paging system sufficient physical memory disk access time overly long i/o communications subsystem especially conflicts internal bus access etc depending configuration algorithms involved throughput latency system may degrade multiple orders magnitude thrashing state cpu performs 'productive work less 'swapping overall memory access time may increase since higher level memory fast next lower level memory hierarchy cpu busy swapping pages much respond users programs interrupts much required thrashing occurs many pages memory page refers another page real memory shortens capacity pages uses 'virtual memory page execution demands page currently real memory ram places pages virtual memory adjusts required page ram cpu busy task thrashing occurs virtual memory systems thrashing may caused programs workloads present insufficient locality reference working set program workload effectively held within physical memory constant data swapping i.e. thrashing may occur term first used tape operating system days describe sound tapes made data rapidly written read example sort situation occurred ibm system/370 series mainframe computer particular instruction could consist execute instruction crosses page boundary points move instruction also crosses page boundary targeting move data source crosses page boundary target data also crosses page boundary total number pages thus used particular instruction eight eight pages must present memory time operating system allocates fewer eight pages actual memory attempts swap part instruction data bring remainder instruction page fault thrash every attempt restart failing instruction thrashing best known context memory storage analogous phenomena occur resources including main memory accessed pattern leads multiple main memory locations competing cache lines resulting excessive cache misses problematic caches low associativity translation lookaside buffer tlb acting cache memory management unit mmu translates virtual addresses physical addresses small working set pages tlb thrashing occur even instruction cache data cache thrashing occurring cached different sizes instructions data cached small blocks cache lines entire pages address lookup done page level thus even code data working sets fit cache working sets fragmented across many pages virtual address working set may fit tlb causing tlb thrashing frequent garbage collection due failure allocate memory object due insufficient free memory insufficient contiguous free memory due memory fragmentation referred heap thrashing similar phenomenon occurs processes process working set coscheduled – interacting processes scheduled run time – experience process thrashing due repeatedly scheduled unscheduled progressing slowly using hysteresis thresholding could help mitigate issue i.e one threshold paging another go back memory | [
1616,
1068,
2633,
6338,
1447,
8066,
3618,
5289,
1640,
7631,
5571,
7003,
2315,
4161,
4254,
1575,
4347,
1670,
6472,
56,
3905,
5082,
7499,
2617,
5190,
6505
] | Train |
2,634 | 4 | Mahlon_E._Doyle:mahlon e. doyle mahlon e. doyle june 14 1921 – march 4 2017 american cryptologist inventor innovator author enjoyed three decade career national security agency predecessor organizations born north baltimore carl flossie née michener doyle married lana starner august 10 1946 world war ii doyle served army working sigsaly voice encryption system doyle career began 1949 cryptanalyst studying electronic key generators used mathematical notation describe motion key generators applied mathematical techniques analyze 1956 doyle joined comsec research development cryptomathematician 1961 risen chief division position held 1977 named senior cryptographer division responsible designing cryptographic algorithms used u.s. allies protect classified information u.s. nuclear command control system doyle designed cryptologics major comsec systems used united states government four decades 1960s onward u.s. government comsec equipment used cryptologics either designed doyle designed others based research designed key management schemes caused huge decrease amount cost physically distributing key material doyle personal life marked tragedy wed lana starner august 10 1946 died february 2 2012 couple two daughters dr. laurie doyle mrs. nancy shields predeceased father mahlon e. doyle died silver springs maryland march 4 2017 aged 95 survived two grandchildren kathleen joshua interred benton cemetery crawford county ohio | [] | Test |
2,635 | 6 | MagmaFS:magmafs magma distributed file system based distributed hash table written c compatible linux bsd kernels using fuse magma binds several hosts interconnected tcp/ip network form common storage space called lava ring host node called vulcano vulcano hosts portion common key space delimited two sha1 keys vulcano also charge mirroring key space previous node ensure data redundancy key represent one object inside storage space objects called flares magma store different range objects files directories symbolic links block characted devices fifo pipes object bound flare vice versa flare type six listed described basic properties common flares like path hash key six types also specific properties example directory flares specific information n't apply symbolic links flare generic information called uncast complete flare called cast uncast flare contain enough information operate data enough information moved sort opaque container vulcano nodes easily movable type flare including directories reimplemented two files set first containing flare information metadata second containing flare content moving flares across lava ring called load balancing done leverage load inequalities nodes attempt provide best performance internal engine magma called flare system implemented layered stack magma_mkdir used example layer traversing paragraph assumed directory called /example created magma_mkdir part public api layer used create new directory done standard libc counterpart mkdir magma_mkdir first route request decide locally managed require network operations perform routing path /example translated corresponding sha1 hash key 81f762fd59d88768b06b8e9de56aef8a95962045 routing determines need contact another vulcano node request leave layer lava network layer forward request node owning key continuing flow operations remote node routing half role lava network layer also includes network monitoring vulcano nodes creation update removal local remote request last step performed flare layer flare corresponding key 81f762fd59d88768b06b8e9de56aef8a95962045 searched inside cache found created loaded disk already existing resulting flare object first applied permission checking tests permission operate granted initial request fulfilled example flare cast directory n't already saved disk since vulcano node complete network topology available routing matter matching flare keys nodes key-space find node holding flare network topology also saved distributed directory inside magma filesystem vulcano nodes periodically check information contents directory know something changed nodes also periodically save information inside directory vulcano node parameters declared boot like bandwidth storage available separate thread called balancer devoted distribute keys avoid nodes overloading underloading node dynamic load value associated computed formula formula_2 node key load calculated logarithmic scale formula_3 node bandwidth formula_4 average bandwidth formula_5 node storage formula_6 average storage magma distributed form server called magmad client called mount.magma magma server manages intercommunication dht nodes magma clients flare system provides network event loop accept incoming connections three kind connection accepted magma client based fuse compatible linux bsd kernels magma client uses flare protocol connection contact operate near magma server network topology flare location totally transparent clients client simply query one server exact manner information located host cryptographic layer planned magma client allowing file contents encryption implementing cryptography client side due scalability computational power increase rate computational request cryptographic key privacy keys passphrases never reach server alternative magma client supported linux bsd kernels magma server plans offer nfs interface unices since nfs established standard new features added example cryptographic layer unavailable client mounting magma shares nfs | [
7765,
5571,
578,
3855,
1435
] | Validation |
2,636 | 7 | Centralized_computing:centralized computing centralized computing computing done central location using terminals attached central computer computer may control peripherals directly physically connected central computer may attached via terminal server alternatively terminals capability may able connect central computer network terminals may text terminals thin clients example offers greater security decentralized systems processing controlled central location addition one terminal breaks user simply go another terminal log files still accessible depending system may even able resume session point nothing happened type arrangement disadvantages central computer performs computing functions controls remote terminals type system relies totally central computer central computer crash entire system go i.e unavailable another disadvantage central computing relies heavily quality administration resources provided users central computer inadequately supported means e.g size home directories problems regarding administration usage suffer greatly reverse situation however i.e. system supported better needs one key advantages centralized computing first computers separate terminals primitive input/output devices built however soon found extremely useful multiple people able use computer time reasons cost – early computers expensive produce maintain occupied large amounts floor space idea centralized computing born early text terminals used electro-mechanical teletypewriters replaced cathode ray tube displays found 20th century televisions computers text terminal model dominated computing 1960s rise dominance home computers personal computers 1980s 2007 centralized computing coming back fashion – certain extent thin clients used many years businesses reduce total cost ownership web applications becoming popular potentially used many types computing device without need software installation already however signs pendulum swinging back away pure centralization thin client devices become like diskless workstations due increased computing power web applications start processing client side technologies ajax rich clients addition mainframes still used mission-critical applications payroll processing day-to-day account transactions banks mainframes typically accessed either using terminal emulators real terminal devices used much via modern front-ends web applications – case automated access protocols web services protocols organisations use hybrid client model partway centralized computing conventional desktop computing applications web browsers run locally applications critical business systems run terminal server one way implement simply running remote desktop software standard desktop computer relatively new method centralized computing hosted computing solves many problems associated traditional distributed computing systems centralizing processing storage powerful server hardware located data center rather local office relieves organizations many responsibilities owning maintaining information technology system services typically delivered subscription basis application service provider asp | [
1710,
6986,
1504,
1554,
7639,
330,
6572,
976
] | Test |
2,637 | 4 | Permanent_Record_(book):permanent record book permanent record book edward snowden planned published september 17 2019 | [
1344
] | Validation |
2,638 | 9 | Function_composition_(computer_science):function composition computer science computer science function composition act mechanism combine simple functions build complicated ones like usual composition functions mathematics result function passed argument next result last one result whole programmers frequently apply functions results functions almost programming languages allow cases composition functions interesting function right used later function always defined languages first-class functions make easier ability easily compose functions encourages factoring breaking apart functions maintainability code reuse generally big systems might built composing whole programs narrowly speaking function composition applies functions operate finite amount data step sequentially processing handing next functions operate potentially infinite data stream codata known filters instead connected pipeline analogous function composition execute concurrently example suppose two functions formula_1 formula_2 formula_3 formula_4 composing means first compute formula_4 use formula_6 compute formula_3 example c language steps combined n't give name intermediate result despite differences length two implementations compute result second implementation requires one line code colloquially referred highly composed form readability hence maintainability one advantage highly composed forms since require fewer lines code minimizing program surface area demarco lister empirically verify inverse relationship surface area maintainability hand may possible overuse highly composed forms nesting many functions may opposite effect making code less maintainable stack-based language functional composition even natural performed concatenation usually primary method program design example forth take whatever stack apply g f leave result stack see postfix composition notation corresponding mathematical notation suppose combination calling f result g frequently useful want name foo used function right languages define new function implemented composition example c long form intermediates would work well example forth languages c way create new function define program source means functions ca n't composed run time functional programming languages function composition naturally expressed higher-order function operator programming languages write mechanisms perform function composition haskell example given becomes using built-in composition operator read f g g composed f composition operator defined haskell using lambda expression first lines describes type takes pair functions returns function note haskell n't require specification exact input output types f g relations f must accept g returns makes polymorphic operator variants lisp especially scheme interchangeability code data together treatment functions lend extremely well recursive definition variadic compositional operator many dialects apl feature built function composition using symbol codice_1 higher-order function extends function composition dyadic application left side function codice_2 codice_3 additionally define function composition dialect support inline definition using braces traditional definition available perl 6 like haskell built function composition operator main difference spelled codice_1 codice_5 also like haskell could define operator fact following perl 6 code used define rakudo implementation python way define composition group functions using reduce function use functools.reduce python 3 javascript define function takes two functions f g produces function c define func takes two funcs f g produces func languages like ruby let construct binary operator however native function composition operator introduced ruby 2.6 notions composition including principle compositionality composability ubiquitous numerous strands research separately evolved following sampling kind research notion composition central whole programs systems treated functions readily composed inputs outputs well-defined pipelines allowing easy composition filters successful became design pattern operating systems imperative procedures side effects violate referential transparency therefore cleanly composable however consider state world running code input output get clean function composition functions corresponds running procedures one monads formalism uses idea incorporate side effects i/o functional languages | [
2451,
5014,
6415,
5986,
2827,
4039,
6428,
2740,
1435,
5931,
8097,
1116,
231,
6467,
235,
1774,
8122,
1407,
1313,
1314,
2694,
7032,
4543,
5965,
1892,
1804
] | Test |
2,639 | 2 | Simple_and_Fast_Multimedia_Library:simple fast multimedia library simple fast multimedia library sfml cross-platform software development library designed provide simple application programming interface api various multimedia components computers written c++ bindings available c crystal euphoria go java julia .net nim ocaml python ruby rust experimental mobile ports made available android ios release sfml 2.2 sfml handles creating input windows creating managing opengl contexts also provides graphics module simple hardware acceleration 2d computer graphics includes text rendering using freetype audio module uses openal networking module basic transmission control protocol tcp user datagram protocol udp communication sfml free open-source software provided terms zlib/png license available linux macos windows freebsd. ref name= sfml/cmake/config.cmake /ref first version v1.0 released 9 august 2007 latest version v2.5.1 released 15 oct 2018 sfml consists various modules graphics module one main features sfml developers interested creating environment program directly opengl using window module without graphics module similarly modules also used independently except system module used modules sfml written c++ provides c++ interface several language bindings exist enable using sfml programming languages table lists supported bindings sfml sfml provides basic functions higher-level software built add-on libraries exist provide added support graphical user interfaces guis 2d lighting particle systems animation video playback tilemaps sfml primarily used hobbyist game developers small independent video game developers startup companies consisting several developers sfml require writing large amounts code adopted many ludum dare participants also compared older libraries simple directmedia layer sdl allegro sfml user base relatively small growing github software repository starred 4255 users. ref name= sfml/sfml 2018-05-10 /ref sfml used teaching universities scientific projects. ref name= engaging computing group comp4spr14 ps5b /ref examples games using sfml listed indiedb | [
1154,
4759,
993,
6428,
7438,
3955,
6984,
2470,
2740,
6352,
6009,
1840,
7637,
5571,
578,
4705,
1659,
930,
3212,
6116,
5948,
5321,
1965,
5506,
7848,
3398,
7573,
8024,
5965,
6674,
3915,
3236,
5786,
5787,
7310,
1989,
2530,
4017,
1435,
2085
] | Test |
2,640 | 2 | Network_Installation_Manager:network installation manager network installation manager nim object-oriented system management framework ibm aix operating system installs manages systems network nim analogous kickstart linux world nim client-server system nim server provides boot image client systems via bootp tftp protocols addition boot images nim manage software updates third-party applications suma command integrated nim automate system updates central server subsequent distribution clients nim data organized object classes object types classes include machines networks resources types refer kind object within class e.g. script image resources | [
3042,
5571
] | Test |
2,641 | 9 | Mike_Woodger:mike woodger michael mike woodger born 28 march 1923 pioneering english computer scientist influential development early pilot ace computer working alan turing later design documentation programming languages algol 60 ada based national physical laboratory npl located teddington london career mike woodger eldest four children father joseph henry woodger 1894–1981 professor biology university london graduated university college london 1943 worked ministry supply military applications rest second world war may 1946 joined new mathematics division national physical laboratory located west london npl worked alan turing ace computer design leading eventually pilot ace computer turing left npl first operational 1950 later worked programming language design especially algol 60 ada | [
1114,
304,
3810
] | Test |
2,642 | 4 | HitmanPro:hitmanpro hitmanpro formerly hitman pro portable antimalware program aims detect found remove malicious files registry entries related rootkits trojans viruses worms spyware adware rogue antivirus programs ransomware malware infected computers suspicious objects analyzed across internet connection using range online malware detection services see multiscanning removed hitmanpro confirmed latest version 3.7.9 uses bitdefender kaspersky lab in-cloud technology partners low system load virus definitions installed tested depth computer question rather analyzed remotely company behind hitmanpro surfright acquired sophos december 2015 version 3 hitmanpro three different types antimalware scans default scan quick scan early score warning default scan check entire computer send suspicious files cloud quick scan scan common parts infections send unknown files cloud early score warning scan entire computer examine every file advanced heuristics check common symptoms malware including recently installed computer starts automatically windows boots impersonating common system file even tray icon taskbar hitmanpro 3 completely different design earlier versions hitman pro developed mark loman netherlands previous versions version 1 2 automatically download install run third party anti-spyware anti-adware programs freely available internet | [
5452,
5546,
4674,
1931,
5571,
7904,
1376,
7087,
5401,
3123,
6305
] | Train |
2,643 | 2 | SocketCAN:socketcan socketcan set open source drivers networking stack contributed volkswagen research linux kernel formerly known low level framework llcf traditional drivers linux based model character devices typically allow sending receiving controller conventional implementations class device driver allow single process access device means processes blocked meantime addition drivers typically differ slightly interface presented application stifling portability socketcan concept hand uses model network devices allows multiple applications access one device simultaneously also single application able access multiple networks parallel socketcan concept extends berkeley sockets api linux introducing new protocol family pf_can coexists protocol families like pf_inet internet protocol communication bus therefore done analogously use internet protocol via sockets fundamental components socketcan network device drivers different controllers implementation protocol family protocol family pf_can provides structures enable different protocols bus raw sockets direct communication transport protocols point-to-point connections moreover broadcast manager part protocol family provides functions e.g sending messages periodically realize complex message filters patches added 2.6.25 linux kernel meanwhile controller drivers added work going add drivers variety controllers application first sets access interface initialising socket much like tcp/ip communications binding socket interface interfaces application desires bound socket used like udp socket via codice_1 codice_2 etc ... python added support socketcan version 3.3 open source library python-can provides socketcan support python 2 python 3 installing device requires loading can_dev module configuring ip link specify bus bitrate example also virtual driver testing purposes loaded created linux commands following code snippet working example socketcan api sends packet using raw interface based notes documented linux kernel packet analyzed vcan0 interface using candump utility part socketcan can-utils package | [
3821,
4040,
5965
] | Test |
2,644 | 5 | IPsec:ipsec computing internet protocol security ipsec secure network protocol suite authenticates encrypts packets data sent internet protocol network used virtual private networks vpns ipsec includes protocols establishing mutual authentication agents beginning session negotiation cryptographic keys use session ipsec protect data flows pair hosts host-to-host pair security gateways network-to-network security gateway host network-to-host internet protocol security ipsec uses cryptographic security services protect communications internet protocol ip networks ipsec supports network-level peer authentication data-origin authentication data integrity data confidentiality encryption replay protection initial ipv4 suite developed security provisions part ipv4 enhancement ipsec layer 3 osi model internet layer end-to-end security scheme internet security systems widespread use operate layer 3 transport layer security tls secure shell ssh operate application layer ipsec automatically secure applications ip layer starting early 1970s advanced research projects agency sponsored series experimental arpanet encryption devices first native arpanet packet encryption subsequently tcp/ip packet encryption certified fielded 1986 1991 nsa sponsored development security protocols internet secure data network systems sdns program brought together various vendors including motorola produced network encryption device 1988 work openly published 1988 nist security protocol layer 3 sp3 would eventually morph iso standard network layer security protocol nlsp 1992 1995 various research groups improved upon sdns sp3 1992 us naval research laboratory nrl began sipp project research implement ip encryption december 1993 experimental software ip encryption protocol swipe developed sunos columbia university bell labs john ioannidis others funded white house 1993 wei xu trusted information systems tis followed swipe research enhanced ip security protocols developed device driver data encryption standard december 1994 team released tis gauntlet firewall product integrated 3des hardware encryption provided commercial ip security t1 speeds securing networks us east west coasts period internet engineering task force ietf ip security working group formed standardize efforts open freely available set security extensions called ipsec 1995 working group published rfc-1825 rfc-1827 nrl first working implementation ipsec open standard part ipv4 suite ipsec uses following protocols perform various functions security authentication header ah derived partially previous ietf standards work authentication simple network management protocol snmp version 2 authentication header ah member ipsec protocol suite ah ensures connectionless integrity using hash function secret shared key ah algorithm ah also guarantees data origin authenticating ip packets optionally sequence number protect ipsec packet contents replay attacks using sliding window technique discarding old packets ah operates directly top ip using ip protocol number 51 following ah packet diagram shows ah packet constructed interpreted ip encapsulating security payload esp researched naval research laboratory starting 1992 part darpa-sponsored research project openly published ietf sipp working group drafted december 1993 security extension sipp esp originally derived us department defense sp3d protocol rather derived iso network-layer security protocol nlsp sp3d protocol specification published nist late 1980s designed secure data network system project us department defense encapsulating security payload esp member ipsec protocol suite provides origin authenticity source authentication data integrity hash functions confidentiality encryption protection ip packets esp also supports encryption-only authentication-only configurations using encryption without authentication strongly discouraged insecure unlike authentication header ah esp transport mode provide integrity authentication entire ip packet however tunnel mode entire original ip packet encapsulated new packet header added esp protection afforded whole inner ip packet including inner header outer header including outer ipv4 options ipv6 extension headers remains unprotected esp operates directly top ip using ip protocol number 50 following esp packet diagram shows esp packet constructed interpreted ipsec protocols use security association communicating parties establish shared security attributes algorithms keys ipsec provides range options determined whether ah esp used exchanging data two hosts agree algorithm used encrypt ip packet example des idea hash function used ensure integrity data md5 sha parameters agreed particular session lifetime must agreed session key algorithm authentication also agreed data transfer takes place ipsec supports range methods authentication possible pre-shared key symmetric key already possession hosts hosts send hashes shared key prove possession key ipsec also supports public key encryption host public private key exchange public keys host sends nonce encrypted host public key alternatively hosts hold public key certificate certificate authority used ipsec authentication security associations ipsec established using internet security association key management protocol isakmp isakmp implemented manual configuration pre-shared secrets internet key exchange ike ikev2 kerberized internet negotiation keys kink use ipseckey dns records rfc 5386 defines better-than-nothing security btns unauthenticated mode ipsec using extended ike protocol order decide protection provided outgoing packet ipsec uses security parameter index spi index security association database sadb along destination address packet header together uniquely identifies security association packet similar procedure performed incoming packet ipsec gathers decryption verification keys security association database ip multicast security association provided group duplicated across authorized receivers group may one security association group using different spis thereby allowing multiple levels sets security within group indeed sender multiple security associations allowing authentication since receiver know someone knowing keys sent data note relevant standard describe association chosen duplicated across group assumed responsible party made choice ipsec protocols ah esp implemented host-to-host transport mode well network tunneling mode transport mode payload ip packet usually encrypted authenticated routing intact since ip header neither modified encrypted however authentication header used ip addresses modified network address translation always invalidates hash value transport application layers always secured hash modified way example translating port numbers means encapsulate ipsec messages nat traversal defined rfc documents describing nat-t mechanism tunnel mode entire ip packet encrypted authenticated encapsulated new ip packet new ip header tunnel mode used create virtual private networks network-to-network communications e.g routers link sites host-to-network communications e.g remote user access host-to-host communications e.g private chat tunnel mode supports nat traversal cryptographic algorithms defined use ipsec include refer rfc 8221 details ipsec implemented ip stack operating system requires modification source code method implementation done hosts security gateways various ipsec capable ip stacks available companies hp ibm alternative called bump-in-the-stack bits implementation operating system source code modified ipsec installed ip stack network drivers way operating systems retrofitted ipsec method implementation also used hosts gateways however retrofitting ipsec encapsulation ip packets may cause problems automatic path mtu discovery maximum transmission unit mtu size network path two ip hosts established host gateway separate cryptoprocessor common military also found commercial systems so-called bump-in-the-wire bitw implementation ipsec possible ipsec implemented kernel key management isakmp/ike negotiation carried user space openly specified pf_key key management api version 2 often used enable application-space key management application update ipsec security associations stored within kernel-space ipsec implementation existing ipsec implementations usually include esp ah ike version 2 existing ipsec implementations unix-like operating systems example solaris linux usually include pf_key version 2 embedded ipsec used ensure secure communication among applications running constrained resource systems small overhead ipsec developed conjunction ipv6 originally required supported standards-compliant implementations ipv6 rfc 6434 made recommendation ipsec also optional ipv4 implementations ipsec commonly used secure ipv4 traffic ipsec protocols originally defined rfc 1825 rfc 1829 published 1995 1998 documents superseded rfc 2401 rfc 2412 incompatible engineering details although conceptually identical addition mutual authentication key exchange protocol internet key exchange ike defined create manage security associations december 2005 new standards defined rfc 4301 rfc 4309 largely superset previous editions second version internet key exchange standard ikev2 third-generation documents standardized abbreviation ipsec uppercase “ ip ” lowercase “ sec ” “ esp ” generally refers rfc 4303 recent version specification since mid-2008 ipsec maintenance extensions ipsecme working group active ietf 2013 part snowden leaks revealed us national security agency actively working insert vulnerabilities commercial encryption systems systems networks endpoint communications devices used targets part bullrun program allegations ipsec targeted encryption system openbsd ipsec stack first implementation available permissive open-source license therefore copied widely letter openbsd lead developer theo de raadt received 11 dec 2010 gregory perry alleged jason wright others working fbi inserted number backdoors side channel key leaking mechanisms openbsd crypto code forwarded email 2010 theo de raadt first express official position validity claims apart implicit endorsement forwarding email jason wright response allegations every urban legend made real inclusion real names dates times gregory perry email falls category … state clearly add backdoors openbsd operating system openbsd crypto framework ocf days later de raadt commented believe netsec probably contracted write backdoors alleged … written n't believe made tree published snowden leaks alternative explanation put forward authors logjam attack suggests nsa compromised ipsec vpns undermining diffie-hellman algorithm used key exchange paper allege nsa specially built computing cluster precompute multiplicative subgroups specific primes generators second oakley group defined rfc 2409 may 2015 90 addressable ipsec vpns supported second oakley group part ike organization precompute group could derive keys exchanged decrypt traffic without inserting software backdoors second alternative explanation put forward equation group used zero-day exploits several manufacturers vpn equipment validated kaspersky lab tied equation group validated manufacturers real exploits zero-day exploits time exposure cisco pix asa firewalls vulnerabilities used wiretapping nsa furthermore ipsec vpns using aggressive mode settings send hash psk clear apparently targeted nsa using offline dictionary attacks | [
5714,
7148,
363,
709,
6795,
4676,
4677,
7170,
4683,
1460,
6432,
1462,
2566,
5039,
6446,
5399,
3638,
2219,
3640,
6458,
4709,
7916,
2587,
5760,
3312,
7567,
7925,
5067,
5773,
1130,
7214,
6487,
7217,
74,
2612,
3337,
4014,
1900,
1513,
2620,
... | Test |
2,645 | 0 | Translatewiki.net:translatewiki.net translatewiki.net web-based translation platform powered translate extension mediawiki makes mediawiki powerful tool translating kinds text 11,000 translators 5,800,00 pages 60 projects including mediawiki openstreetmap mifos encyclopedia life mantisbt main characteristic translatewiki.net engine translate extension wiki contribution made easy web user low barrier entry quality pursued letting translators focus 're best — translation — freeing burdens translations immediately available translator smoothly synchronised revision control system translatable wiki pages without translator intervention best case mediawiki wikimedia foundation projects new localisations sometimes called continuous translation continuous localization translation editor provides various features machine-assisted translation translatewiki.net also semantic mediawiki part semantic web translatewiki.net made available niklas laxström localisation platform languages mediawiki around june 2006 named betawiki besides translation developed characteristics integrated development environment mediawiki nukawiki 2005 focus improvement internationalisation features end 2007 siebrand mazeland joined management website moved current domain april 2008 already supported 100 languages mediawiki 200 extensions making one translated software projects ever well freecol since independent volunteer project recognised major player global success mediawiki wikimedia projects powered like wikipedia 280 languages 2009 improved google summer code project niklas laxström 2011 proofreading features introduced 2012 translation memory engine expanded wikimedia projects using translate 2013 translate platform underwent major revamp translate user experience project tux including changes navigation editor look feel translation area filters search color style natively supported formats follow added customisation | [
745,
2451,
933,
3915,
5304,
5571,
5008
] | Validation |
2,646 | 8 | Gunicorn:gunicorn gunicorn green unicorn pronounced jee-unicorn python web server gateway interface wsgi http server pre-fork worker model ported ruby unicorn project gunicorn server broadly compatible number web frameworks simply implemented light server resources fairly fast server model | [
3168,
5369,
1349,
5206,
6428,
5820,
5214,
6270,
8182,
1834,
2291,
6536,
26,
5571,
7544,
7988,
4701,
1392,
7786,
417,
7848,
3135,
2506,
1686,
3408,
5965,
3915,
1602,
6061,
7411,
7952,
2807
] | Test |
2,647 | 9 | The_Last_One_(software):last one software last one computer program released 1981 british company d.j ai systems obsolete took input user generated executable program basic computer language software program generator distinct actual programming language programs generated user selecting options menus would form basis generated code done logical sequence would eventually cause program generated basic time user could elect view flow chart showing current progress program design example program sort names christmas card list alphabetical order | [] | Test |
2,648 | 0 | Paraphrasing_(computational_linguistics):paraphrasing computational linguistics paraphrase paraphrasing computational linguistics natural language processing task detecting generating paraphrases applications paraphrasing varied including information retrieval question answering text summarization plagiarism detection paraphrasing also useful evaluation machine translation well semantic parsing generation new samples expand existing corpora barzilay lee proposed method generate paraphrases usage monolingual parallel corpora namely news articles covering event day training consists using multi-sequence alignment generate sentence-level paraphrases unannotated corpus done achieved first clustering similar sentences together using n-gram overlap recurring patterns found within clusters using multi-sequence alignment position argument words determined finding areas high variability within clusters aka words shared 50 cluster sentences pairings patterns found comparing similar variable words different corpora finally new paraphrases generated choosing matching cluster source sentence substituting source sentence argument number patterns cluster paraphrase also generated use phrase-based translation proposed bannard callison-burch chief concept consists aligning phrases pivot language produce potential paraphrases original language example phrase control english sentence aligned phrase unter kontrolle german counterpart phrase unter kontrolle found another german sentence aligned english phrase check paraphrase control probability distribution modeled formula_1 probability phrase formula_2 paraphrase formula_3 equivalent formula_4 summed formula_5 potential phrase translation pivot language additionally sentence formula_3 added prior add context paraphrase thus optimal paraphrase formula_7 modeled formula_9 formula_10 approximated simply taking frequencies adding formula_11 prior modeled calculating probability forming formula_11 formula_3 substituted success using long short-term memory lstm models generate paraphrases short model consists encoder decoder component implemented using variations stacked residual lstm first encoding lstm takes one-hot encoding words sentence input produces final hidden vector viewed representation input sentence decoding lstm takes hidden vector input generates new sentence terminating end-of-sentence token encoder decoder trained take phrase reproduce one-hot distribution corresponding paraphrase minimizing perplexity using simple stochastic gradient descent new paraphrases generated inputting new phrase encoder passing output decoder paraphrase recognition attempted socher et al use recursive autoencoders main concept produce vector representation sentence along components recursively using autoencoder vector representations paraphrases similar vector representations processed fed input neural network classification given sentence formula_14 formula_15 words autoencoder designed take 2 formula_16-dimensional word embeddings input produce formula_16-dimensional vector output autoencoder applied every pair words formula_11 produce formula_19 vectors autoencoder applied recursively new vectors inputs single vector produced given odd number inputs first vector forwarded next level recursion autoencoder trained reproduce every vector full recursion tree including initial word embeddings given two sentences formula_20 formula_21 length 4 3 respectively autoencoders would produce 7 5 vector representations including initial word embeddings euclidean distance taken every combination vectors formula_20 formula_21 produce similarity matrix formula_24 formula_11 subject dynamic min-pooling layer produce fixed size formula_26 matrix since formula_11 uniform size among potential sentences formula_11 split formula_29 roughly even sections output normalized mean 0 standard deviation 1 fed fully connected layer softmax output dynamic pooling softmax model trained using pairs known paraphrases skip-thought vectors attempt create vector representation semantic meaning sentence similar fashion skip gram model skip-thought vectors produced use skip-thought model consists three key components encoder two decoders given corpus documents skip-thought model trained take sentence input encode skip-thought vector skip-thought vector used input decoders one attempts reproduce previous sentence following sentence entirety encoder decoder implemented use recursive neural network rnn lstm since paraphrases carry semantic meaning one another similar skip-thought vectors thus simple logistic regression trained good performance absolute difference component-wise product two skip-thought vectors input multiple methods used evaluate paraphrases since paraphrase recognition posed classification problem standard evaluations metrics accuracy f1 score roc curve relatively well however difficulty calculating f1-scores due trouble produce complete list paraphrases given phrase along fact good paraphrases dependent upon context metric designed counter problems parametric parametric aims calculate precision recall automatic paraphrase system comparing automatic alignment paraphrases manual alignment similar phrases since parametric simply rating quality phrase alignment used rate paraphrase generation systems well assuming uses phrase alignment part generation process noted drawback parametric large exhaustive set manual alignments must initially created rating produced evaluation paraphrase generation similar difficulties evaluation machine translation often quality paraphrase dependent upon context whether used summary generated among factors additionally good paraphrase usually lexically dissimilar source phrase simplest method used evaluate paraphrase generation would use human judges unfortunately evaluation human judges tends time consuming automated approaches evaluation prove challenging essentially problem difficult paraphrase recognition originally used evaluate machine translations bilingual evaluation understudy bleu used successfully evaluate paraphrase generation models well however paraphrases often several lexically different equally valid solutions hurts bleu similar evaluation metrics metrics specifically designed evaluate paraphrase generation include paraphrase n-gram change pinc paraphrase evaluation metric pem along aforementioned parametric pinc designed used conjunction bleu help cover inadequacies since bleu difficulty measuring lexical dissimilarity pinc measurement lack n-gram overlap source sentence candidate paraphrase essentially jaccard distance sentence excluding n-grams appear source sentence maintain semantic equivalence pem hand attempts evaluate adequacy fluency lexical dissimilarity paraphrases returning single value heuristic calculated using n-grams overlap pivot language however large drawback pem must trained using large in-domain parallel corpora well human judges words tantamount training paraphrase recognition system order evaluate paraphrase generation system 11 online paraphrasing tool rewording articles paraphrasing tool | [
1314,
5429,
6827,
1718,
3651,
5304,
8065,
3158,
715,
7138,
5008
] | Test |
2,649 | 2 | Xinetd:xinetd computer networking xinetd extended internet service daemon open-source super-server daemon runs many unix-like systems manages internet-based connectivity offers secure alternative older inetd internet daemon modern linux distributions deprecated xinetd listens incoming requests network launches appropriate service request requests made using port numbers identifiers xinetd usually launches another daemon handle request used start services privileged non-privileged port numbers xinetd features access control mechanisms tcp wrapper acls extensive logging capabilities ability make services available based time place limits number servers system start deployable defense mechanisms protect port scanners among things implementations mac os x daemon starts maintains various internet-related services including ftp telnet extended form inetd offers enhanced security replaced inetd mac os x v10.3 subsequently launchd replaced mac os x v10.4 however apple retained inetd compatibility purposes configuration xinetd resides default configuration file /etc/xinetd.conf configuration services supports reside configuration files stored /etc/xinetd.d directory configuration service usually includes switch control whether xinetd enable disable service example configuration file rfc 868 time server lines character beginning comments without effect service two service versions first one based transmission control protocol tcp second one based user datagram protocol udp type planned usage service determines necessary core protocol simple way udp handle huge data transmissions lacks abilities rearrange packages specified order guarantee integrity faster tcp tcp functions slower two column versions inside braces first type option second applied variable disable option switch run service cases default state yes activate service change three types services type internal service provided xinetd rpc based remote procedure call commonly listed /etc/rpc file unlisted service neither /etc/services /etc/rpc files id unique identifier service socket_type determines way data transmission service three types stream dgram raw last one useful want establish service based non-standard protocol user option possible choose user owner running service highly recommended choose non-root user security reasons wait yes xinetd receive request service connection number connections limited one provides good protection want establish one connection per time many options available xinetd linux distributions full list possible options description accessible man xinetd.conf command apply new configuration sighup signal must sent xinetd process make re-read configuration files achieved following command codice_1 pid actual process identifier number xinetd obtained command codice_2 | [
7796,
5116,
7637,
6188,
5571,
3638,
609,
7765,
4914,
3073,
1435
] | Train |
2,650 | 5 | Open_Shortest_Path_First:open shortest path first open shortest path first ospf routing protocol internet protocol ip networks uses link state routing lsr algorithm falls group interior gateway protocols igps operating within single autonomous system defined ospf version 2 rfc 2328 1998 ipv4 updates ipv6 specified ospf version 3 rfc 5340 2008 ospf supports classless inter-domain routing cidr addressing model ospf widely used igp large enterprise networks is-is another lsr-based protocol common large service provider networks open shortest path first ospf designed interior gateway protocol igp use autonomous system local area network lan implements dijkstra algorithm also known shortest path first spf algorithm link-state routing protocol based link-state algorithm developed arpanet 1980 is-is routing protocol ospf first standardised 1989 rfc 1131 known ospf version 1 development work ospf prior codification open standard undertaken largely digital equipment corporation developed proprietary decnet protocols routing protocols like ospf calculate shortest route destination network based algorithm first routing protocol widely implemented routing information protocol rip calculated shortest route based hops number routers ip packet traverse reach destination host rip successfully implemented dynamic routing routing tables change network topology changes rip adapt routing according changing network conditions data-transfer rate demand grew dynamic routing protocol could calculate fastest route destination ospf developed shortest path network calculated based cost route taking account bandwidth delay load therefore ospf undertakes route cost calculation basis link-cost parameters weighted administrator ospf quickly adopted became known reliably calculating routes large complex local area networks link state routing protocol ospf maintains link state databases really network topology maps every router implemented state given route network cost ospf algorithm allows every router calculate cost routes given reachable destination unless administrator made configuration link cost path connected router determined bit rate 1 gbit/s 10 gbit/s etc interface router interface ospf advertise link cost neighbouring routers multicast known hello procedure routers ospf implementation keep sending hello packets thus changes cost links become known neighbouring routers information cost link speed point point connection two routers cascaded network ospf routers advertise information receive one neighbouring router neighbouring routers process flooding link state information network known synchronisation based information routers ospf implementation continuously update link state databases information network topology adjust routing tables ospf network structured subdivided routing areas simplify administration optimize traffic resource utilization areas identified 32-bit numbers expressed either simply decimal often dot-decimal notation used ipv4 addresses convention area 0 zero 0.0.0.0 represents core backbone area ospf network identifications areas may chosen administrators often select ip address main router area area identifier additional area must connection ospf backbone area connections maintained interconnecting router known area border router abr abr maintains separate link-state databases area serves maintains summarized routes areas network ospf detects changes topology link failures converges new loop-free routing structure within seconds ospf become popular dynamic routing protocol commonly used dynamic routing protocols rip border gateway protocol bgp today routers support least one interior gateway protocol advertise routing tables within local area network frequently implemented interior gateway protocols besides ospf rip is-is proprietary interior gateway routing protocol igrp cisco ospf supports complex networks multiple routers including backup routers balance traffic load multiple links subnets neighboring routers broadcast domain end point-to-point link communicate via ospf protocol routers form adjacencies detected detection initiated router identifies hello protocol packet upon acknowledgment establishes two-way state basic relationship routers ethernet frame relay network select designated router dr backup designated router bdr act hub reduce traffic routers ospf uses unicast multicast transmission modes send hello packets link state updates link state routing protocol ospf establishes maintains neighbor relationships exchanging routing updates routers neighbor relationship table called adjacency database two ospf routers neighbors members subnet share area id subnet mask timers authentication essence ospf neighborship relationship two routers allow see understand nothing ospf neighbors exchange routing information – packets exchange hello packets ospf adjacencies formed selected neighbors allow exchange routing information two routers must first neighbors become adjacent two routers become adjacent least one designated router backup designated router multiaccess type networks interconnected point-to-point point-to-multipoint network type forming neighbor relationship interfaces used form relationship must ospf area interface may configured belong multiple areas generally practiced configured second area interface must configured secondary interface ospf router within network communicates neighboring routers connecting interface establish states adjacencies every communication sequence separate conversation identified pair router ids communicating neighbors rfc 2328 specifies protocol initiating conversations hello protocol establishing full adjacencies database description packets link state request packets course router conversation transitions maximum eight conditions defined state machine unlike routing protocols ospf carry data via transport protocol user datagram protocol udp transmission control protocol tcp instead ospf forms ip datagrams directly packaging using protocol number 89 ip protocol field ospf defines five different message types various types communication ospf network divided areas logical groupings hosts networks area includes connecting router interfaces connected network area maintains separate link state database whose information may summarized towards rest network connecting router thus topology area unknown outside area reduces routing traffic parts autonomous system areas uniquely identified 32-bit numbers area identifiers commonly written dot-decimal notation familiar ipv4 addressing however ip addresses may duplicate without conflict ipv4 address area identifiers ipv6 implementations ospfv3 also use 32-bit identifiers written notation dotted formatting omitted implementations expand area 1 area identifier 0.0.0.1 known expand 1.0.0.0 ospf defines several special area types backbone area also known area 0 area 0.0.0.0 forms core ospf network areas connected either directly routers inter-area routing happens via routers connected backbone area associated areas logical physical structure 'ospf domain attached nonzero areas ospf domain note ospf term autonomous system boundary router asbr historic sense many ospf domains coexist internet-visible autonomous system rfc 1996 backbone area responsible distributing routing information nonbackbone areas backbone must contiguous need physically contiguous backbone connectivity established maintained configuration virtual links ospf areas must connect backbone area connection however virtual link example assume area 0.0.0.1 physical connection area 0.0.0.0 assume area 0.0.0.2 direct connection backbone area connection area 0.0.0.1 area 0.0.0.2 use virtual link transit area 0.0.0.1 reach backbone transit area area transit attribute stubby way stub area area receive route advertisements external routing within area based entirely default route abr deletes type 4 5 lsas internal routers sends default route 0.0.0.0 turns default gateway reduces lsdb routing table size internal routers modifications basic concept stub areas exist not-so-stubby area nssa addition several proprietary variations implemented systems vendors totally stubby area tsa nssa totally stubby area extension cisco systems routing equipment not-so-stubby area nssa type stub area import autonomous system external routes send areas still receive as-external routes areas nssa extension stub area feature allows injection external routes limited fashion stub area case study simulates nssa getting around stub area problem able import external addresses visualizes following activities asbr imports external addresses type 7 lsa abr converts type 7 lsa type 5 floods areas abr acts asbr areas asbrs take type 5 lsas convert type 7 lsas area several vendors cisco allied telesis juniper alcatel-lucent huawei quagga implement two extensions stub not-so-stubby areas although covered rfc standards considered many standard features ospf implementations newly acquired subsidiary one example might suitable area simultaneously not-so-stubby totally stubby practical place put asbr edge totally stubby area case asbr send externals totally stubby area available ospf speakers within area cisco implementation external routes summarized injecting totally stubby area general asbr advertise default tsa-nssa although work extremely careful design operation limited special cases advertisement makes sense declaring totally stubby area nssa external routes backbone except default route enter area discussed externals reach area 0.0.0.0 via tsa-nssa routes default route enter tsa-nssa routers tsa-nssa send traffic abr except routes advertised asbr transit area area two ospf border routers used pass network traffic one adjacent area another transit area originate traffic destination traffic ospf defines following overlapping categories routers router type attribute ospf process given physical router may one ospf processes example router connected one area receives routes bgp process connected another area border router autonomous system boundary router router identifier customarily written dotted decimal format e.g. 1.2.3.4 ip address identifier must established every ospf instance explicitly configured highest logical ip address duplicated router identifier however since router identifier ip address part routable subnet network often n't avoid confusion addition four router types ospf uses terms designated router dr backup designated router bdr attributes router interface given router interfaces designated dr others backup designated bdr others non-designated router dr bdr given subnet bdr first elected second election held dr dr elected based following default criteria dr exist purpose reducing network traffic providing source routing updates dr maintains complete topology table network sends updates routers via multicast routers multi-access network segment form slave/master relationship dr form adjacencies dr bdr every time router sends update sends dr bdr multicast address dr send update routers area multicast address way routers constantly update rather get updates single source use multicasting reduces network load drs bdrs always setup/elected ospf broadcast networks dr also elected nbma non-broadcast multi-access networks frame relay atm drs bdrs elected point-to-point links point-to-point wan connection two routers either sides link must become fully adjacent bandwidth optimized dr non-dr routers evolve 2-way full adjacency relationships exchanging dd request update ospf uses path cost basic routing metric defined standard equate standard value speed network designer could pick metric important design practice determined speed bandwidth interface addressing given route although tends need network-specific scaling factors links faster 25 mbit/s common cisco uses metric like 10/bandwidth reference value 10 default adjusted 100mbit/s link cost 1 10mbit/s cost 10 links faster 100mbit/s cost would 1 metrics however directly comparable type four types metrics recognized decreasing preference types example intra-area route always preferred external route regardless metric ospf version 3 introduces modifications ipv4 implementation protocol except virtual links neighbor exchanges use ipv6 link-local addressing exclusively ipv6 protocol runs per link rather based subnet ip prefix information removed link-state advertisements hello discovery packet making ospfv3 essentially protocol-independent despite expanded ip addressing 128-bits ipv6 area router identifications still based 32-bit numbers ospf-te extension ospf extending expressivity allow traffic engineering use non-ip networks using ospf-te information topology exchanged using opaque lsa carrying type-length-value elements extensions allow ospf-te run completely band data plane network means also used non-ip networks optical networks ospf-te used gmpls networks means describe topology gmpls paths established gmpls uses path setup forwarding protocols full network map resource reservation protocol rsvp ospf-te used recording flooding rsvp signaled bandwidth reservations label switched paths within link-state database documents work optical routing ip based extensions ospf is-is multicast open shortest path first mospf protocol extension ospf support multicast routing mospf allows routers share information group memberships broadcast multiple-access networks neighbor adjacency formed dynamically using multicast hello packets dr bdr elected normally function normally non-broadcast multiple-access networks nbma following two official modes defined cisco defined following three additional modes ospf nbma topologies ospf first widely deployed routing protocol converge network seconds guarantee loop-free paths many features allow imposition policies propagation routes may appropriate keep local load sharing selective route importing is-is is-is contrast tuned lower overhead stable network sort common isp enterprise networks historical accidents made is-is preferred igp isps isps today may well choose use features now-efficient implementations ospf first considering pros cons is-is service provider environments mentioned ospf provide better load-sharing external links igps default route isp injected ospf multiple asbrs type external route external cost specified routers go asbr least path cost location tuned adjusting external cost contrast default route different isps injected different external costs type ii external route lower-cost default becomes primary exit higher-cost becomes backup real limiting factor may compel major isps select is-is ospf network 850 routers mention ospf network 1000 routers quite uncommon network must specifically designed minimize overhead achieve stable operation | [
7148,
709,
4676,
4677,
7170,
4683,
6432,
1462,
5039,
6446,
2219,
3640,
4706,
4709,
6461,
3312,
7214,
7217,
2612,
3337,
1900,
456,
6879,
2281,
6521,
106,
1543,
2644,
6531,
121,
7637,
4414,
4783,
6908,
3379,
5492,
3383,
494,
7297,
5169,
2... | Validation |
2,651 | 7 | SynfiniWay:synfiniway synfiniway middleware virtualised framework created provides uniform global view resources within department company company suppliers virtualised framework service-oriented meaning applications run services system-independent view applications several applications linked workflow data exchange applications participating workflow implicitly managed framework synfiniway platform-independent allowing almost distributed heterogeneous platform linked virtualised framework virtualised framework implemented synfiniway installing component specific software agents systems framework three major types components synfiniway components based java deployed multi-platform environment example framework two neighbourhoods shown figure adding removing components automatically detected framework synfiniway meta-scheduler automatically adjusts changes service manager service availability synfiniway geared towards service management means application command utilised defined service published synfiniway framework simple complex tasks abstracted services execution using abstracted services user easily run applications commands regardless complex may underlying infrastructure required provide form virtualisation computing resources since user need aware service available run technical business process created linking services workflow workflows synfiniway based wfmc version 1.0 workflow defines one tasks executed given execution logic branch loop conditional synfiniway supports multi-instance tasks run service multiple times concurrently also supports workflow workflows whereby workflow executed task higher level workflow files needed service automatically transferred computer executing service user freed manage file transfers file transfer mechanism used allowing files transferred directly source target computer system going number firewalls source target without stored intermediary systems mechanism uses shortest path transferring files target computer source synfiniway employs meta-scheduling capability optimizing computational workloads combining multiple distributed resource managers organisation using single aggregated view allowing batch jobs directed best location execution using local resource managers lsf pbspro sge loadleveler synfiniway able schedule execute services deployed mixed interlinked set local resource managers | [
4759,
5571,
1923,
578,
1431,
2441,
5666
] | Validation |
2,652 | 5 | Arrayed_waveguide_grating:arrayed waveguide grating arrayed waveguide gratings awg commonly used optical de multiplexers wavelength division multiplexed wdm systems devices capable multiplexing large number wavelengths single optical fiber thereby increasing transmission capacity optical networks considerably devices based fundamental principle optics light waves different wavelengths interfere linearly means channel optical communication network makes use light slightly different wavelength light large number channels carried single optical fiber negligible crosstalk channels awgs used multiplex channels several wavelengths onto single optical fiber transmission end also used demultiplexers retrieve individual channels different wavelengths receiving end optical communication network conventional silica-based awgs schematically shown figure planar lightwave circuits fabricated depositing doped undoped layers silica silicon substrate awgs consist number input 1 output 5 couplers free space propagation region 2 4 grating waveguides 3 grating consists large number waveguides constant length increment δl light coupled device via optical fiber 1 connected input port light diffracting input waveguide coupler/slab interface propagates free-space region 2 illuminates grating gaussian distribution wavelength light coupled grating waveguides 3 undergoes constant change phase attributed constant length increment grating waveguides light diffracted waveguide grating interferes constructively gets refocused output waveguides 5 spatial position output channels wavelength dependent array phase shift | [
3724,
2117,
7543
] | Test |
2,653 | 4 | Layer_four_traceroute:layer four traceroute layer four traceroute lft fast multi-protocol traceroute engine also implements numerous features including number lookups regional internet registries reliable sources loose source routing firewall load balancer detection etc lft best known use network security practitioners trace route destination host many configurations packet-filters firewalls detect network connectivity performance latency problems lft sends various tcp syn fin probes differing van jacobson udp-based method udp probes utilizing ip protocol time live field attempts elicit icmp time_exceeded response gateway along path host lft also listens various tcp udp icmp messages along way assist network managers ascertaining per-protocol heuristic routing information optionally retrieve various information networks traverses operation layer four traceroute described detail several prominent security books codice_1 command first appeared 1998 codice_2 renamed result confusion fast fourier transforms lft stands layer four traceroute results often referred layer four trace | [
3821,
651,
7637,
1140,
7868,
3775,
2808
] | Test |
2,654 | 9 | List_of_free_electronics_circuit_simulators:list free electronics circuit simulators electronic circuit simulators distributed free software license available several sources several computing platforms | [
4106,
5458,
5459
] | Validation |
2,655 | 7 | Infrascale:infrascale infrascale draas disaster-recovery-as-a-service data protection company based el segundo california founded 2011 company headquartered el segundo california offices australia india ukraine 16 datacenters around world including united states canada australia united kingdom india ukraine south africa 2014 company acquired eversync solutions inc offer cloud on-premises backup archiving disaster recovery solutions program received awards various analyst firms publications 2017 redmond channel partners named infrascale best ransomware solution also 2017 gartner named infrascale leader draas magic quadrant 2016 gartner named infrascale visionary disaster recovery magic quadrant 2015 business continuity cool vendor crn named infrascale one 20 coolest cloud storage vendors 2016 cloud 100 features include failover continuous data protection unlimited versioning archiving integrated local backup remote wipe geo-locate military-grade security available direct-to-cloud offering local on-premises appliance january 17 2017 announced partnership google cloud platform deliver faster failover infrascale comes two versions infrascale 100 channel focused concentrates heavily selling resellers managed service providers infrascale products include several features targeted protecting data | [
6391,
1376,
4554,
7715,
578,
2442,
2666
] | Test |
2,656 | 4 | Cyber_Intelligence_Sharing_and_Protection_Act:cyber intelligence sharing protection act cyber intelligence sharing protection act cispa 112th congress 113th congress 114th congress proposed law united states would allow sharing internet traffic information u.s. government technology manufacturing companies stated aim bill help u.s. government investigate cyber threats ensure security networks cyberattacks legislation introduced november 30 2011 representative michael rogers r-mi 111 co-sponsors passed house representatives april 26 2012 passed u.s. senate president barack obama advisers argued bill lacks confidentiality civil liberties safeguards white house said would veto february 2013 house reintroduced bill passed united states house representatives april 18 2013 stalled voted upon senate july 10 2014 similar bill cybersecurity information sharing act cisa introduced senate january 2015 house reintroduced bill bill referred committee intelligence february 2 2015 subcommittee crime terrorism homeland security investigations subcommittee constitution civil justice see come house vote december 2015 version cispa hidden total federal budget cispa garnered favor corporations lobbying groups microsoft facebook ibm united states chamber commerce look simple effective means sharing important cyber threat information government however criticized advocates internet privacy civil liberties electronic frontier foundation american civil liberties union free press fight future avaaz.org well various conservative libertarian groups including competitive enterprise institute techfreedom freedomworks americans limited government liberty coalition american conservative union groups argue cispa contains limits government may monitor private individual ’ internet browsing information additionally fear new powers could used spy general public rather pursue malicious hackers critics saw wording included cispa second attempt protect intellectual property stop online piracy act taken table congress met opposition intellectual property theft initially listed bill possible cause sharing web traffic information government though removed subsequent drafts cispa amendment national security act 1947 currently contain provisions pertaining cybercrime adds provisions act describing cyber threat intelligence information possession element intelligence community directly pertaining vulnerability threat system network government private entity including information pertaining protection system network either efforts degrade disrupt destroy system network addition cispa requires director national intelligence establish procedures allow intelligence community elements share cyber threat intelligence private-sector entities encourage sharing intelligence april 16 2012 press release house representatives permanent select committee intelligence announced approval several amendments cispa including addition new provision permit federal lawsuits government violation restrictions placed government ’ use voluntarily shared information including important privacy civil liberties protections contained bill inclusion anti-tasking provision explicitly prohibit government conditioning sharing cyber threat intelligence sharing private sector information government prevention government using information lawful purpose unless government already significant cybersecurity national security purpose using information relevant provisions also clarified focus fact bill designed protect unauthorized access networks systems including unauthorized access aimed stealing private government information addition already collected cyberthreat data also used investigate imminent threat bodily harm individual exploitation minor bringing bill line existing law codified patriot act protect children act two conditions already allow protected entities share data voluntarily united states government law enforcement agencies national center missing exploited children bill sponsors mike rogers dutch ruppersberger chairman ranking member house intelligence committee respectively said april 25 2012 obama administration opposition mostly based lack critical infrastructure regulation something outside jurisdiction intelligence committee also since introduced package amendments legislation address nearly every single one criticisms leveled administration particularly regarding privacy civil liberties americans due opposition bill experienced co-sponsors planning amend bill address many concerns opponents—including limiting scope narrower definition cyber-threats stating theft intellectual property refers theft research development addition penalties private companies government uses data cispa purposes unrelated cyberthreats however sharan bradford franklin constitution project states although appreciate intelligence committee efforts improve bill willingness engage dialogue privacy advocates changes current draft come close addressing civil liberties threats posed bill proposals would actually make cispa worse therefore congress pass cispa rainey reitman electronic frontier foundation states date authors bill unresponsive criticisms offering amendments largely cosmetic dismissing grave concerns bill could undermine core privacy rights everyday internet users rep. mike rogers characterized growing protests cispa 'turbulence vowed push floor vote without radical changes kendall burman center democracy technology states authors cispa made positive changes recently unfortunately none changes gets heart privacy concerns internet users advocacy groups expressed april 2012 office management budget executive office president united states released statement strongly opposing current bill recommending veto april 26 2012 house representatives passed cispa february 13 2013 united states representative mike rogers reintroduced cispa bill 113th congress h.r 624 april 18 2013 house representatives passed h.r 624 senate reportedly refused vote measure drafting competing legislation july 10 2014 similar bill cybersecurity information sharing act cisa introduced senate full list seen house.gov site full list seen house.gov site cispa supported several trade groups containing eight hundred private companies including business software alliance ctia – wireless association information technology industry council internet security alliance national cable telecommunications association national defense industrial association techamerica united states chamber commerce addition individual major telecommunications information technology companies like ibm intel oracle corporation symantec verizon google taken public position bill shown previous support says support idea believe bill needs work leading google yahoo microsoft executives also executive council technet tech trade group sent letter supporting cispa april 2013 dubbed stop cyber spying week starting april 16 2012 many civil liberties groups advocates raised awareness cispa twitter campaign hash-tags cispa congresstmi including limited constitution project american civil liberties union electronic frontier foundation center democracy technology demand progress fight future free press reporters without borders sunlight foundation techfreedom anonymous hacktivist group criticized bill called internet blackout day protest bill date blackout april 22 2013 since legislation must pass house senate within congress anything introduced 112th earlier congresses pass chambers | [
2947,
5131,
4036,
104
] | Test |
2,657 | 6 | Drive_Letter_Access:drive letter access drive letter access dla discontinued commercial packet writing application microsoft windows operating system allows optical disc data storage devices used manner similar floppy disks dla packet writing technology cd dvd media uses udf file system dla compatible windows vista newer although patch exists fix issue windows vista roxio burn introduced april 30 2009 replacement dla remedies compatibility issues internet explorer 8 dla originally developed veritas software later sold sonic solutions 2002 common shipped majority cd dvd recording drives dla came custom oem version branded drive also pc systems dell hp ibm sony toshiba came dla pre-installed oem version often available download specific computer system windows vista support dla either dropped replaced similar product like drag-to-disc use optical medium cd-r cd-rw dvd±r dvd±rw like floppy drive necessary utilize technique called packet writing formatting optical media possible write data small packets hence name “ packet writing. ” optical drive unit support ability write small units modern cd dvd recording drives way possible save files onto optical media well change rename delete copy files separately onto media without packet writing optical media like above-mentioned would written one big block like disc dao session sao track tao media types normally support sectors formatting packet writing medium sectored blocks written individually preferred file system universal disk format udf versions 1.50 onward also used dla packet writing required writing dvd-ram dvd-ram media already sectored seen looking surface empty dvd-ram disc hardware logic dvd-ram capable drives supports sectored read/write operations required dvd-ram standard however windows 2000 dla also add support dvd-ram together udf file system windows xp dla add udf support dla also supports mount rainier standard mrw capable drives windows xp dla provide functionality well udf support windows xp first windows operating system support dvd-ram windows vista first windows operating system support full udf functionality udf version 2.50 full support meaning read write operations mount rainier dla available microsoft windows operating systems english language note oem versions officially support windows 2000 xp however dla also runs older versions windows like windows 98 second edition windows well windows nt 4.0 patch required windows vista compatibility works retail trial version one exception dell oem version instead patching dla simply install drag-to-disc replacement techniques used dla competing applications | [
5378,
3764,
3915,
4759,
5128,
5571,
7306,
5158,
972
] | Test |
2,658 | 9 | Nashorn_(JavaScript_engine):nashorn javascript engine nashorn javascript engine developed java programming language oracle based da vinci machine jsr 292 released java 8 project announced first jvm language summit july 2011 confirmed javaone october 2011 november 21 2012 oracle formally announced open sourcing nashorn source openjdk repository project aim allow embedding javascript java applications via jsr-223 develop standalone javascript applications december 21 2012 oracle announced nashorn source publicly released openjdk repository release java 11 nashorn deprecated likely removed jdk later time graalvm suggested replacement nashorn nahss-horn german translation rhinoceros play words rhino name javascript engine implemented java provided mozilla foundation latter gets name animal cover javascript book o'reilly media according oracle benchmarks nashorn performance several orders magnitude faster alternative rhino javascript engine | [
183,
2451,
4755,
6172,
8170,
3092,
5998,
562,
5571,
7734,
313,
7460,
3719,
2040,
6368,
237,
54,
3398,
2870,
6660,
422,
155,
340,
3663,
5172,
3915,
6400,
7687,
4287
] | Test |
2,659 | 9 | VHDL:vhdl vhdl vhsic-hdl high speed integrated circuit hardware description language hardware description language used electronic design automation describe digital mixed-signal systems field-programmable gate arrays integrated circuits vhdl also used general purpose parallel programming language starting 1983 vhdl originally developed behest u.s department defense order document behavior asics supplier companies including equipment standard mil-std-454n requirement 64 section 4.5.1 asic documentation vhdl explicitly requires documentation microelectronic devices vhdl idea able simulate asics information documentation obviously attractive logic simulators developed could read vhdl files next step development logic synthesis tools read vhdl output definition physical implementation circuit due department defense requiring much syntax possible based ada order avoid re-inventing concepts already thoroughly tested development ada vhdl borrows heavily ada programming language concepts syntax initial version vhdl designed ieee standard ieee 1076-1987 included wide range data types including numerical integer real logical bit boolean character time plus arrays codice_1 called codice_2 codice_3 called string problem solved edition however multi-valued logic signal drive strength none weak strong unknown values also considered required ieee standard 1164 defined 9-value logic types scalar codice_4 vector version codice_5 resolved subtype codice_6 parent type codice_4 typed signals allow multiple driving modeling bus structures whereby connected resolution function handles conflicting assignments adequately updated ieee 1076 1993 made syntax consistent allowed flexibility naming extended codice_3 type allow iso-8859-1 printable characters added codice_9 operator etc minor changes standard 2000 2002 added idea protected types similar concept class c++ removed restrictions port mapping rules addition ieee standard 1164 several child standards introduced extend functionality language ieee standard 1076.2 added better handling real complex data types ieee standard 1076.3 introduced signed unsigned types facilitate arithmetical operations vectors ieee standard 1076.1 known vhdl-ams provided analog mixed-signal circuit design extensions standards support wider use vhdl notably vital vhdl initiative towards asic libraries microwave circuit design extensions june 2006 vhdl technical committee accellera delegated ieee work next update standard approved called draft 3.0 vhdl-2006 maintaining full compatibility older versions proposed standard provides numerous extensions make writing managing vhdl code easier key changes include incorporation child standards 1164 1076.2 1076.3 main 1076 standard extended set operators flexible syntax case generate statements incorporation vhpi vhdl procedural interface interface c/c++ languages subset psl property specification language changes improve quality synthesizable vhdl code make testbenches flexible allow wider use vhdl system-level descriptions february 2008 accellera approved vhdl 4.0 also informally known vhdl 2008 addressed 90 issues discovered trial period version 3.0 includes enhanced generic types 2008 accellera released vhdl 4.0 ieee balloting inclusion ieee 1076-2008 vhdl standard ieee 1076-2008 published january 2009 ieee standard 1076 defines vhsic hardware description language vhdl originally developed contract f33615-83-c-1003 united states air force awarded 1983 team intermetrics inc. language experts prime contractor texas instruments chip design experts ibm computer system design experts language undergone numerous revisions variety sub-standards associated augment extend important ways 1076 continues milestone design electronic systems vhdl commonly used write text models describe logic circuit model processed synthesis program part logic design simulation program used test logic design using simulation models represent logic circuits interface design collection simulation models commonly called testbench vhdl simulator typically event-driven simulator means transaction added event queue specific scheduled time e.g signal assignment occur 1 nanosecond event added queue time +1ns zero delay also allowed still needs scheduled cases delta delay used represent infinitely small time step simulation alters two modes statement execution triggered statements evaluated event processing events queue processed vhdl constructs handle parallelism inherent hardware designs constructs processes differ syntax parallel constructs ada tasks like ada vhdl strongly typed case sensitive order directly represent operations common hardware many features vhdl found ada extended set boolean operators including nand vhdl file input output capabilities used general-purpose language text processing files commonly used simulation testbench stimulus verification data vhdl compilers build executable binaries case might possible use vhdl write testbench verify functionality design using files host computer define stimuli interact user compare results expected however designers leave job simulator relatively easy inexperienced developer produce code simulates successfully synthesized real device large practical one particular pitfall accidental production transparent latches rather d-type flip-flops storage elements one design hardware vhdl ide fpga implementation xilinx ise altera quartus synopsys synplify mentor graphics hdl designer produce rtl schematic desired circuit generated schematic verified using simulation software shows waveforms inputs outputs circuit generating appropriate testbench generate appropriate testbench particular circuit vhdl code inputs defined correctly example clock input loop process iterative statement required final point vhdl model translated gates wires mapped onto programmable logic device cpld fpga actual hardware configured rather vhdl code executed form processor chip key advantage vhdl used systems design allows behavior required system described modeled verified simulated synthesis tools translate design real hardware gates wires another benefit vhdl allows description concurrent system vhdl dataflow language unlike procedural computing languages basic c assembly code run sequentially one instruction time vhdl project multipurpose created calculation block used many projects however many formational functional block parameters tuned capacity parameters memory size element base block composition interconnection structure vhdl project portable created one element base computing device project ported another element base example vlsi various technologies big advantage vhdl compared original verilog vhdl full type system designers use type system write much structured code especially declaring record types vhdl design consists minimum entity describes interface architecture contains actual implementation addition designs import library modules designs also contain multiple architectures configurations simple gate vhdl would look something like notice codice_10 stands register transfer level design example may seem verbose hdl beginners many parts either optional need written generally simple functions like part larger behavioral module instead separate module something simple addition use elements codice_4 type might first seem overkill one could easily use built-in codice_1 type avoid library import beginning however using 9-valued logic codice_13 codice_14 codice_15 codice_16 codice_17 codice_18 codice_19 codice_20 codice_21 instead simple bits 0,1 offers powerful simulation debugging tool designer currently exist hdl examples follow see vhdl code written compact form however experienced designers usually avoid compact forms use verbose coding style sake readability maintainability another advantage verbose coding style smaller amount resources used programming programmable logic device cpld vhdl frequently used two different goals simulation electronic designs synthesis designs synthesis process vhdl compiled mapped implementation technology fpga asic many fpga vendors free inexpensive tools synthesize vhdl use chips asic tools often expensive constructs vhdl suitable synthesis example constructs explicitly deal timing codice_22 synthesizable despite valid simulation different synthesis tools different capabilities exists common synthesizable subset vhdl defines language constructs idioms map common hardware many synthesis tools ieee 1076.6 defines subset language considered official synthesis subset generally considered best practice write idiomatic code synthesis results incorrect suboptimal non-standard constructs multiplexer 'mux usually called simple construct common hardware design example demonstrates simple two one mux inputs codice_23 codice_24 selector codice_25 output codice_14 note many ways express mux vhdl transparent latch basically one bit memory updated enable signal raised many ways expressed vhdl d-type flip-flop samples incoming signal rising falling edge clock example asynchronous active-high reset samples rising clock edge another common way write edge-triggered behavior vhdl 'event signal attribute single apostrophe written signal name name attribute vhdl also lends one-liners useful signals registers driven process reset following example up-counter asynchronous reset parallel load configurable width demonstrates use 'unsigned type type conversions 'unsigned 'std_logic_vector vhdl generics generics close arguments templates traditional programming languages like c++ complex counters may add if/then/else statements within codice_27 add functions count enables stopping rolling count value generating output signals like terminal count signals etc care must taken ordering nesting controls used together order produce desired priorities minimize number logic levels needed large subset vhdl translated hardware subset known non-synthesizable simulation-only subset vhdl used prototyping simulation debugging example following code generate clock frequency 50 mhz example used drive clock input design simulation however simulation-only construct implemented hardware actual hardware clock generated externally scaled internally user logic dedicated hardware simulation-only constructs used build complex waveforms short time waveform used example test vectors complex design prototype synthesizer logic implemented future commercial | [
6507,
4469,
6071,
4028,
4926,
5458,
895,
1725,
3365,
3368,
4321,
304,
3105,
1374,
1556,
4836,
309,
486,
4703,
5936,
3799,
666,
2672,
5948,
6128,
7848,
7209,
4359,
8024,
3230,
4092,
4093,
5965,
7305,
7499,
3156,
7777,
971,
1336,
2714
] | Test |
2,660 | 1 | Comparison_of_object-relational_mapping_software:comparison object-relational mapping software table shows comparison notable orm software products currently available | [
2624,
2180,
7156,
4944,
5228,
1860,
7920,
3479,
5248,
6489,
5965,
3915,
2702,
6594,
2623
] | Test |
2,661 | 9 | Comparison_of_ALGOL_68_and_C++:comparison algol 68 c++ c++ n't algol 68 n't assigning values a68 codice_1 variable automatic type tagged variable pulling value back syntactically awkward conformity-clause required algol 68 example c/c++ example net effect type-tagging algol68 strong typing half encroaches codice_1 new mode type may declared using codice_3 declaration similar effect following c++ code const int max=99 typedef struct newtype 9+1 max+1 note algol 68 newtype name appears left equality notably construction made read left right without regard priorities | [
1345,
7333,
4302,
109,
4053,
6277,
7005,
7460,
666,
4164,
1114,
5855,
7844,
3898,
5510,
2871,
7394,
2881
] | Test |
2,662 | 9 | Value_(computer_science):value computer science computer science value representation entity manipulated program members type values type value variable given corresponding mapping environment languages assignable variables becomes necessary distinguish r-value contents l-value location variable declarative high-level languages values referentially transparent means resulting value independent location sub- expression needed compute value stored contents location bits whether 1 0 interpretation significant languages use idea l-values r-values deriving typical mode evaluation left right hand side assignment statement l-value refers object persists beyond single expression r-value temporary value persist beyond expression uses notion l-values r-values introduced combined programming language cpl notions expression r-value l-value r-value/l-value analogous parameter modes input parameter value output parameter assigned input/output parameter value assigned though technical details differ contexts languages many languages notably c family l-values storage addresses programmatically accessible running program e.g. via address-of operator like c/c++ meaning variables dereferenced references certain memory location r-values l-values see non-l-values—a term used distinguish l-values consider c expression executed computer generates integer value 13 program explicitly designated computer 13 stored expression non l-value hand c program declares variable x assigns value 13 x expression value 13 l-value c term l-value originally meant something could assigned hence name indicating left side assignment operator since reserved word constant added language term 'modifiable l-value c++11 special semantic-glyph exists denote use/access expression address compiler i.e. address retrieved using address-of operator run-time program see use move semantics type reference applied r-values including non-l-values well l-values processors provide one instructions take immediate value sometimes referred immediate short immediate value stored part instruction employs usually load add subtract register parts instruction opcode destination latter may implicit non-immediate value may reside register stored elsewhere memory requiring instruction contain direct indirect address e.g. index register address value l-value expression designates refers object non-modifiable l-value addressable assignable modifiable l-value allows designated object changed well examined r-value expression non-l-value expression l-value one example immediate value look consequently addressable.. value virtually kind data given data type instance string digit single letter processors often support one size immediate data e.g 8 16 bit employing unique opcode mnemonic instruction variant programmer supplies data value fit assembler issues range error message assemblers allow immediate value expressed ascii decimal hexadecimal octal binary data thus ascii character byte order strings may differ processors depending assembler computer architecture | [
89,
2451,
4302,
7071,
1274,
5480,
6543,
2576,
7370,
7385,
3810,
3895,
7391,
8122,
3225,
4359,
171,
263,
1989,
270,
1435
] | Test |
2,663 | 1 | Database_refactoring:database refactoring database refactoring simple change database schema improves design retaining behavioral informational semantics database refactoring change way data interpreted used fix bugs add new functionality every refactoring database leaves system working state thus causing maintenance lags provided meaningful data exists production environment database refactoring conceptually difficult code refactoring code refactorings need maintain behavioral semantics database refactorings also must maintain informational semantics refactor database schema one several reasons examples database refactoring process database refactoring act applying database refactorings evolve existing database schema database refactoring core practice evolutionary database design three considerations need taken account | [
1905,
6604,
7330,
7341,
6345,
5561,
906,
5217,
6098,
4054,
6636,
2124,
6737,
6739,
3119,
3801,
7999,
5943,
2054,
2956,
6932,
6386,
684,
6390,
7937,
7303,
6144,
4457,
5005,
6320,
1902,
6594
] | Train |
2,664 | 4 | UDP_hole_punching:udp hole punching udp hole punching commonly used technique employed network address translation nat applications maintaining user datagram protocol udp packet streams traverse nat nat traversal techniques typically required client-to-client networking applications internet involving hosts connected private networks especially peer-to-peer direct client-to-client dcc voice internet protocol voip deployments udp hole punching establishes connectivity two hosts communicating across one network address translators typically third-party hosts public transit network used establish udp port states may used direct communications communicating hosts port state successfully established hosts communicating port state may maintained either normal communications traffic prolonged absence thereof keep-alive packets usually consisting empty udp packets packets minimal non-intrusive content udp hole punching method establishing bidirectional udp connections internet hosts private networks using network address translators technique applicable scenarios types nats nat operating characteristics standardized hosts network connectivity inside private network connected via nat internet typically use session traversal utilities nat stun method interactive connectivity establishment ice determine public address nat communications peers require process another host public network used establish port mapping udp port state assumed valid direct communication application hosts since udp state usually expires short periods time range tens seconds minutes udp port closed process udp hole punching employs transmission periodic keep-alive packets renewing life-time counters udp state machine nat udp hole punching work symmetric nat devices also known bi-directional nat tend found large corporate networks symmetric nat nat mapping associated connection well-known stun server restricted receiving data well-known server therefore nat mapping well-known server sees useful information endpoint somewhat elaborate approach hosts start sending using multiple attempts restricted cone nat first packet host blocked nat device record sent packet machine let packets coming ip address port number technique widely used peer-to-peer software voice internet protocol telephony also used assist establishment virtual private networks operating udp technique sometimes extended transmission control protocol tcp connections though less success tcp connection streams controlled host os application sequence numbers selected randomly thus nat device performs sequence-number checking consider packets associated existing connection drop let b two hosts private network n n two nat devices globally reachable ip addresses eip eip respectively public server well-known globally reachable ip address | [
2984,
3172,
4577,
8,
7343,
7637,
5039,
5488,
1559,
6025,
7744,
2128,
499,
4434,
2681,
4891,
5414,
3573,
426,
2430,
2696,
6487,
1329,
4014,
5790,
6499
] | Test |
2,665 | 2 | Night_Shift_(software):night shift software night shift built software feature ios macos introduced ios ios 9.3 macos macos sierra 10.12.4 feature changes color temperature display towards yellowish part color spectrum reduces blue light screen apple claims feature may help users better night sleep filtering blue wavelengths display feature similar functionality f.lux provides night shift feature compatible 64-bit ios devices running ios 9.3 macs 2012 later running macos sierra 10.12.4 feature turned settings ios system preferences macos toggled manually notification center macos control center ios feature enabled disabled siri ios macos feature set enabled sunset turn sunrise default turned custom schedule feature set enable sunset disable sunrise relies user approximate location determine time sunset sunrise user also customize intensity night shift settings ios system preferences macos | [
6788,
3940,
7890,
4320,
2926,
4690,
734,
5752,
6125,
2954,
1123,
6847,
6142,
2609,
1895,
5091,
4749,
7601,
2284,
1940,
2300,
3025,
2327,
6565,
2331,
3050,
4820,
6582,
1234,
5189,
889,
2368,
552,
7335,
3445,
3107,
5579,
1654,
1656,
1657,
... | Train |
2,666 | 4 | Off-site_data_protection:off-site data protection computing off-site data protection vaulting strategy sending critical data main location main site part disaster recovery plan data usually transported off-site using removable storage media magnetic tape optical storage data also sent electronically via remote backup service known electronic vaulting e-vaulting sending backups off-site ensures systems servers reloaded latest data event disaster accidental error system crash sending backups off-site also ensures copy pertinent data ’ stored on-site although organizations manage store off-site backups many choose backups managed stored third parties specialize commercial protection off-site data storage off-site data also known vaulting backups stored purpose-built vaults generally recognized standards type structure constitutes vault said commercial vaults typically fit three categories hybrid on-site off-site data vaulting sometimes known hybrid online backup involve combination local backup fast backup restore along off-site backup protection local disasters according liran eshel ceo ctera networks ensures recent data available locally event need recovery archived data needed much less often stored cloud hybrid online backup works storing data local disk backup captured high speed either backup software d2d2c disk disk cloud appliance encrypts transmits data service provider recent backups retained locally speed data recovery operations number cloud storage appliances market used backup target including appliances ctera networks nasuni storsimple twinstrata data protection statutes usually non-prescriptive within commercial arena data protected increasingly require active protection data united states federal entities specific requirements defined u.s. national institute standards technology nist nist documentation obtained http //csrc.nist.gov/publications/pubssps.html commercial agencies option using documents compliance requirements statutes mandate protection data | [
5516,
4594,
2390,
3609,
2655,
6906,
4036,
5908,
7165
] | Test |
2,667 | 4 | Moti_Yung:moti yung mordechai m. moti yung israeli-american cryptographer computer scientist industrial research career yung earned ph.d. columbia university 1988 supervision zvi galil past worked ibm thomas j. watson research center vice president chief scientist certco director advanced authentication research rsa laboratories researcher snap inc. currently research scientist google parallel work industry also held adjunct visiting faculty appointments columbia advised ph.d. students including gödel prize winner matthew k. franklin jonathan katz 1996 adam l. young yung coined term cryptovirology denote use cryptography attack weapon via computer viruses malware contrast traditional protective role particular described first instances ransomware using public-key cryptography young yung introduced notion kleptography show cryptography could used attack host cryptosystems malicious resulting system embedded cryptologic tool resists reverse-engineering detected interacting host cryptosystem attack ransomware also uses internal cryptography attack tool break another cryptographic system snowden affair nist believed mounted first kleptographic attack american federal information processing standard detailing dual ec drbg essentially exploiting repeated discrete logarithm based kleptogram introduced young yung light snowden revelations yung worked detecting correcting cryptosystems subverted implementation work kleptography argument cryptographic systems devices given external body black boxes clipper chip capstone program suggested united states government tried control use cryptography 1990s known first stage crypto wars 1995 yair frankel yung implemented published direct attack clipper chip showing key escrow device tracking authenticating capability namely leaf one device attached messages coming another device message actually decrypted mechanism thus bypassing escrow real time cryptovirology also natural tool crypto wars defined broadly young yung later designed software-only escrow encryption attempt get potential system possessed many desired properties without tamper-proof hardware inherent third party access requirement remains vulnerability nevertheless.. yung made numerous contributions several areas foundations basic cryptographic systems protocols well areas applied cryptography information security also worked theoretical computer science distributed network algorithms yung worked moni naor designing first public key cryptosystems secure chosen-ciphertext attack jonathan katz chosen ciphertext security symmetric encryption schemes via authenticated encryption also worked naor design first secure digital signature schemes based trapdoor functions employing basic primitive universal one-way hash functions signature schemes yung worked early robust multi-party secure schemes via notion shares shares area secure computation protocols 1980s well notion multi secret compact/ batched secret sharing idea also worked rafail ostrovsky basic notion mobile adversary multi-party protocols proactive security fault-tolerance adversaries underlying technique proactive secret sharing yung also worked zero-knowledge proofs commitment schemes particular notion interactive hashing unconditionally hiding commitments general complexity assumptions functional commitment various coauthors yung also worked special goal protocols secure computing e.g set intersection election digital cash auctions threshold cryptosystems fully homomorphic encryption schemes logarithmic depth circuits yung work basic primitives needed communication networks include first efficient password-based authenticated key exchange protocol shown secure without idealized random oracle model assumptions work early 1990 ibm coauthors dealt authentication authenticated key exchange observing cryptographic protocol real networks run concurrently attack suggested iso protocols time led revised modeling problem cryptography zvi galil stuart haber yung predicted mid-1980s large scale networks due scale limitations employ public key technology server public-key certificates interactive protocols idea viewed intellectual predecessor way prevalent version transport layer security implemented mid-1990s using interactive protocols employing ssl certificates servers regarding authentication factors users present systems sign systems traditional factors include knowledge factors ownership factors inherence factors yung coauthors also studied factors available users modern computing environments richer context e.g social relationships area information-theoretic security yung coauthors investigated multicast key pre-distribution system perfectly secure message transmission multi-user authentication codes also coding theory based work includes relating reed–solomon error correction codes cryptographic hardness led interleaving decoding work codes yung coauthored studies methodological framework conducting analyzing side channel attacks also worked early remote attestation software secure run time user running software may try subvert system addition scientific contributions basic applied research yung worked projects industry | [
1821,
651,
125,
1376,
5401,
3209,
1805,
6654,
1408,
1505,
74,
1243,
7050
] | Test |
2,668 | 4 | Uday_Ali_Pabrai:uday ali pabrai uday ali pabrai indian-american entrepreneur based irvine california chairman chief executive officer ecfirst compliance cybersecurity business headquartered waukee iowa pabrai globally renowned cyber security compliance expert featured keynote speaker moderated cybersecurity events international conferences mr. pabrai led numerous cybersecurity engagements worldwide iso 27001 pci dss hitrust nist hipaa/hitech highly sought professional successfully delivered solutions u.s. government agencies firms healthcare systems legal organizations worldwide served interim ciso large health system usa pabrai created several certification programs area information security worked manager security team fermi national accelerator laboratory fermi lab u.s. department energy featured presenter conferences worldwide including fbi infragard hcfa issa isaca isc ² himss hipaa summit comdex microsoft tech forum indiaexpo naseba asis security imprivata healthcare conference healthcare congress pabrai established world first certification program comprehensively addresses global compliance standards regulations area information security certified security compliance specialist cscs also successfully developed leading certification credentials world including ciw 125,000 certificates issued security certified program scp developed certified cyber security architect ccsa program well hitrust cybersecurity strategy workshop previously founded net guru technologies ngt 1994 nasdaq-based firm acquired ngt 1997 launched career 1983 schlumberger leading oilfield services provider dubai associate accountant 1987 started career united states fermi national accelerator laboratory fermilab u.s. department energy facility mr. pabrai presented u.s. defense intelligence agency dia naval surface warfare center mr. pabrai received b.s computer engineering clemson university south carolina received msee degree illinois institute technology iit credentials include security+ ccsfp hitrust cissp issap issmp published hundreds articles regulatory compliance information security published numerous e-security articles leading magazines certification ebusiness advisor computing channel access control security systems covering topics risk management hipaa pki smart cards biometrics e-business disruption ________________ | [] | Test |
2,669 | 4 | Trust_metric:trust metric psychology sociology trust metric measurement degree one social actor individual group trusts another social actor trust metrics may abstracted manner implemented computers making interest study engineering virtual communities friendster livejournal trust escapes simple measurement meaning subjective universally reliable metrics fact mental process unavailable instruments strong argument use simplistic metrics measure trust due complexity process 'embeddedness trust makes impossible isolate trust related factors generally agreed set properties make particular trust metric better others metric designed serve different purposes e.g provides certain classification scheme trust metrics two groups trust metrics identified trust metrics enable trust modelling reasoning trust closely related reputation systems simple forms binary trust metrics found e.g pgp first commercial forms trust metrics computer software applications like ebay feedback rating slashdot introduced notion karma earned activities perceived promote group effectiveness approach influential later virtual communities empirical metrics capture value trust exploring behavior introspection people determine perceived expressed level trust methods combine theoretical background determining measure defined set questions statistical processing results willingness cooperate well actual cooperation commonly used demonstrate measure trust actual value level trust and/or trustworthiness assessed difference observed hypothetical behaviors i.e would anticipated absence cooperation surveys capture level trust means observations introspection without engaging experiments respondents usually providing answers set questions statements responses e.g structured according likert scale differentiating factors underlying theoretical background contextual relevance one earliest surveys mccroskey scales used determine authoritativeness competence character trustworthiness speakers rempel trust scale rotter scale quite popular determining level interpersonal trust different settings organizational trust inventory oti example exhaustive theory-driven survey used determine level trust within organisation particular research area specific survey developed example interdisciplinary model trust verified using survey uses survey establish relationship design elements web site perceived trustworthiness another empirical method measure trust engage participants experiments treating outcome experiments estimates trust several games game-like scenarios tried estimate trust confidence monetary terms see interesting overview games trust designed way nash equilibrium differ pareto optimum player alone maximize utility altering selfish strategy without cooperation cooperating partners benefit trust therefore estimated basis monetary gain attributable cooperation original 'game trust described abstracted investment game investor broker game played several times randomly chosen players pairs know yielding different results several variants game exist focusing different aspects trust observable behaviour example rules game reversed called game distrust declaratory phase introduced rules presented variety ways altering perception participants interesting games e.g binary-choice trust games gift-exchange game cooperative trust games various forms social games specifically prisoners dilemma popularly used link trust economic utility demonstrate rationality behind reciprocity multi-player games different forms close market simulations exist formal metrics focus facilitating trust modelling specifically large scale models represent trust abstract system e.g social network web trust consequently may provide weaker insight psychology trust particulars empirical data collection formal metrics tend strong foundations algebra probability logic widely recognised way attribute value level trust representation 'trust value claiming certain advantages disadvantages systems assume binary values use fixed scale confidence range -100 +100 excluding zero 0 1 −1 +1 confidence discrete continuous one-dimensional many dimensions metrics use ordered set values without attempting convert particular numerical range e.g see detailed overview also disagreement semantics values disagreement regarding attribution values levels trust specifically visible comes meaning zero negative values example zero may indicate either lack trust distrust lack information deep distrust negative values allowed usually indicate distrust doubt whether distrust simply trust negative sign phenomenon subjective probability focuses trustor self-assessment trust trustee assessment framed anticipation regarding future behaviour trustee expressed terms probability probability subjective specific given trustor assessment situation information available etc situation trustors may different level subjective probability subjective probability creates valuable link formalisation empirical experimentation formally subjective probability benefit available tools probability statistics empirically subjective probability measured one-side bets assuming potential gain fixed amount person bets used estimate subjective probability transaction logic uncertain probabilities subjective logic introduced josang uncertain probabilities called subjective opinions elegant concept combines probability distribution uncertainty opinion trust viewed distribution probability distributions distribution qualified associated uncertainty foundation trust representation opinion evidence confidence trust represented four-tuple trust distrust uncertainty base rate trust distrust uncertainty must add one hence dependent additivity subjective logic example computational trust uncertainty inherently embedded calculation process visible output one e.g possible use similar quadruplet trust distrust unknown ignorance express value confidence long appropriate operations defined despite sophistication subjective opinion representation particular value four-tuple related trust easily derived series binary opinions particular actor event thus providing strong link formal metric empirically observable behaviour finally certaintrust certainlogic share common representation equivalent subjective opinions based three independent parameters named 'average rating 'certainty 'initial expectation hence bijective mapping certaintrust-triplet four-tuple subjective opinions fuzzy systems trust metrics link natural language expressions meaningful numerical analysis application fuzzy logic trust studied context peer peer networks improve peer rating also grid computing demonstrated fuzzy logic allows solve security issues reliable efficient manner set properties satisfied trust metric vary depending application area following list typical properties transitivity highly desired property trust metric situations trusts b b trusts c transitivity concerns extent trusts c. without transitivity trust metrics unlikely used reason trust complex relationships intuition behind transitivity follows everyday experience 'friends friend foaf foundation social networks however attempt attribute exact formal semantics transitivity reveals problems related notion trust scope context example defines conditions limited transitivity trust distinguishing direct trust referral trust similarly shows simple trust transitivity always hold based information advogato model consequently proposed new trust metrics simple holistic approach transitivity characteristic social networks foaf advogato follows everyday intuition assumes trust trustworthiness apply whole person regardless particular trust scope context one trusted friend one also trusted recommend endorse another friend therefore transitivity semantically valid without constraints natural consequence approach thorough approach distinguishes different scopes/contexts trust allow transitivity contexts semantically incompatible inappropriate contextual approach may instance distinguish trust particular competence trust honesty trust ability formulate valid opinion trust ability provide reliable advice sources information contextual approach often used trust-based service composition understanding trust contextual scope foundation collaborative filtering formal trust metric useful define set operations values trust way result operations produce values trust usually least two elementary operators considered exact semantics operators specific metric even within one representation still possibility variety semantic interpretations example representation logic uncertain probabilities trust fusion operations interpreted applying different rules cumulative fusion averaging fusion constraint fusion dempster rule yager modified dempster rule inagaki unified combination rule zhang centre combination rule dubois prade disjunctive consensus rule etc. interpretations leads different results depending assumptions trust fusion particular situatation modelled see detailed discussions growing size networks trust make scalability another desired property meaning computationally feasible calculate metric large networks scalability usually puts two requirements metric attack resistance important non-functional property trust metrics reflects ability overly influenced agents try manipulate trust metric participate bad faith i.e aim abuse presumption trust free software developer resource advogato based novel approach attack-resistant trust metrics raph levien levien observed google pagerank algorithm understood attack resistant trust metric rather similar behind advogato | [
1186,
354
] | Test |
2,670 | 4 | POSITIF_(project):positif project positif project aimed creating framework tools policy-based protection networked systems applications launched february 1 2004 ended january 31 2007 following participants took part project | [
2554
] | Test |
2,671 | 3 | Swap_Magic:swap magic swap magic specialized playstation 2 game disc used tricking console reading non-retail burned game discs homebrew software games outside console region software existed since least mid-2003 several different versions disc developed swap magic related mods magic switch swap tool used allow user swap discs without system aware notable methods modchip due fact void ps2 warranty swap magic disc allows user boot software allows system read discs would normally refuse lack burst cutting area discs burned ordinary dvd drive opposed regular retail discs stamped pressed en masse user removes disc installing small modifications prevent system detecting drive opened replaces another disc started software also allows homebrew software run memory card usb flash drive swap magic non-sony-made playstation 2 bootable discs use method growing splicing stampers original playstation 2 discs method growing stamper original game disc joining new stamper program data essence resulting discs contain portion original disc datel first company outside sony make bootable playstation 2 disc researched protection produced discs protection on-site mastering facility ifpi dvd found inner ring underside data side disc start data mirror part disc hub contain text specified time mastering usually consists string ifpi followed code describing mastering system used followed text product description finally bar code swap magic v1 released compatible v12 slim ps2 swap magic v2 released sony slightly changed design console v13-15 models slim ps2 swap magic v1 work models version 2 widely criticized required user open console therefore voided warranty company responded criticism releasing swap magic v3 require opening console swap magic v3.8 also known coder released adds ability loading action replay cheats booted game however users complained coder compatibility issues well known bugs example games work v3.6 work coder consequently v3.6 remains popular version swap magic | [
8103
] | Test |
2,672 | 4 | IEEE_802.10:ieee 802.10 ieee 802.10 former standard security functions could used local area networks metropolitan area networks based ieee 802 protocols 802.10 specifies security association management key management well access control data confidentiality data integrity ieee 802.10 standards withdrawn january 2004 working group ieee 802 currently active security wireless networks standardized 802.11i cisco inter-switch link isl protocol supporting vlans ethernet similar lan technologies based ieee 802.10 application 802.10 largely replaced ieee 802.1q standard developed 8 parts parts b e f g h incorporated ieee standard 802.10-1998 | [
6071,
4926,
4321,
3105,
2659,
309,
4783,
3799,
7209,
3230,
4093,
7777,
4836,
2714
] | Test |
2,673 | 8 | Google_Website_Optimizer:google website optimizer google website optimizer free website optimization tool helped online marketers webmasters increase visitor conversion rates overall visitor satisfaction continually testing different combinations website content google website optimizer could test element existed html code page including calls action fonts headlines point action assurances product copy product images product reviews forms allowed webmasters test alternative versions entire page called a/b testing — test multiple combinations page elements headings images body copy known multivariate testing could used multiple stage conversion funnel 1 june 2012 google announced gwo separate product would retired 1 august 2012 functionality would integrated google analytics google analytics content experiments | [
2902,
3507,
4116,
5455,
6697,
4762,
3848,
3850,
5372,
7431,
7967,
6978,
6176,
993,
6427,
561,
7346,
201,
5476,
2107,
2475,
5302,
2569,
831,
2037,
7007,
5141,
136,
2317,
8107,
2946,
3309,
2867,
7285,
6297,
2591,
2417,
2683,
7924,
855,
57... | Test |
2,674 | 7 | Multi-master_replication:multi-master replication multi-master replication method database replication allows data stored group computers updated member group members responsive client data queries multi-master replication system responsible propagating data modifications made member rest group resolving conflicts might arise concurrent changes made different members multi-master replication contrasted master-slave replication single member group designated master given piece data node allowed modify data item members wishing modify data item must first contact master node allowing single master makes easier achieve consistency among members group less flexible multi-master replication multi-master replication also contrasted failover clustering passive slave servers replicating master data order prepare takeover event master stops functioning master server active client interaction primary purposes multi-master replication increased availability faster server response time many directory servers based ldap implement multi-master replication one prevalent multi-master replication implementations directory servers microsoft active directory within active directory objects updated one domain controller replicated domain controllers multi-master replication required domain controllers replicate would cause excessive network traffic large active directory deployments instead domain controllers complex update pattern ensures servers updated timely fashion without excessive replication traffic active directory needs however better served flexible single master operation ca directory supports multi-master replication opends successor product opendj implemented multi-master since version 1.0 opends/opendj multi-master replication asynchronous uses log publish-subscribe mechanism allows scaling large number nodes opends/opendj replication conflict resolution entry attribute level opends/opendj replication used wide area network widely used open source ldap server implements multi-master replication since version 2.4 october 2007 apache couchdb uses simple http-based multi-master replication system built use append data-store use multiversion concurrency control mvcc document contains revision id every record stores evolutionary timeline previous revision ids leading itself—which provides foundation couchdb mvcc system additionally keeps by-sequence index entire database replication process copies last revision document previous revisions source database copied destination database couchdb replicator acts simple http client acting source target database compares current sequence ids database calculates revision differences makes necessary changes target based found history source database bi-directional replication result merely another replication source target values swapped arangodb native multi-model database system using multi-master replication clusters arangodb use cp master/master model single point failure cluster encounters network partition arangodb prefers maintain internal consistency availability clients experience view database regardless node connect cluster continues serve requests even one machine fails cloudant distributed database system uses largely http api apache couchdb exposes ability replicate using multiversion concurrency control mvcc cloudant databases replicate internally nodes within cloudant clusters use multi-master replication stay sync provide high availability api consumers extremedb cluster clustering sub-system mcobject extremedb embedded database product family maintains database consistency across multiple hardware nodes replicating transactions synchronous manner two-phase commit important characteristic extremedb cluster transaction replication contrast log file-based sql statement-based replication schemes may may guarantee success failure entire transactions accordingly extremedb cluster acid compliant system base eventual consistency query executed cluster node return result executed cluster node database clusters implement multi-master replication using one two methods asynchronous multi-master replication commits data changes deferred transaction queue periodically processed databases cluster synchronous multi-master replication uses oracle two phase commit functionality ensure databases cluster consistent dataset microsoft sql provides multi-master replication peer-to-peer replication provides scale-out high-availability solution maintaining copies data across multiple nodes built foundation transactional replication peer-to-peer replication propagates transactionally consistent changes near real-time basic level possible achieve multi-master replication scheme beginning since mysql version 3.23 circular replication departing mariadb mysql ship replication support different nuances terms direct support mariadb natively supports multi-master replication since version 10.0 conflict resolution supported master must contain different databases mysql named multi-source available since version 5.7.6 mysql mysql group replication plugin virtual synchronous multi master conflict handling distributed recovery released 5.7.17 cluster projects mysql cluster supports conflict detection resolution multiple masters since version 6.3 true multi-master capability mysql server also external project galera cluster created codership provides true multi-master capability based fork innodb storage engine custom replication plug-ins replication synchronous conflict possible percona xtradb cluster also combination galera replication library mysql supporting multi master various options synchronous multi-master replication exist postgres-xl available mozilla public license postgresxc known postgres-x2 available license postgresql examples note pgcluster project abandoned 2007 replication documentation postgresql categorises different types replication available various options exist distributed multi-master including bucardo rubyrep bdr bi-directional replication bdr aimed eventual inclusion postgresql core benchmarked demonstrating significantly enhanced performance earlier options bdr includes replication data writes dml well changes data definition ddl global sequences bdr nodes may upgraded online version 0.9 onwards 2ndquadrant developed bdr continuously since 2012 system used production since 2014 latest version bdr 3.6 provides column-level conflict detection crdts eager replication multi-node query consistency many features within ingres replicator objects updated one ingres server replicated servers whether local remote multi-master replication one server fails client connections re-directed another server required ingres servers environment replicate could cause excessive network traffic large implementations instead ingres replicator allows appropriate data replicated appropriate servers without excessive replication traffic means servers environment serve failover candidates servers meet requirements managing subset columns tables departmental solution subset rows geographical region one-way replication reporting server event source target network failure data integrity enforced two-phase commit protocol ensuring either whole transaction replicated none addition ingres replicator operate rdbms ’ multiple vendors connect | [
5717,
187,
7715,
644,
22,
3863,
1096,
6538,
4798,
2054,
2776,
5956,
6056,
4738,
4747,
3425
] | Train |
2,675 | 4 | Double_encoding:double encoding double encoding attack technique used bypass security mechanisms decode data used masquerade directory traversal attack cross-site scripting xss attack double encoding works encoding character want put really decrypts message input illegal characters codice_1 uri encoded becomes codice_2 double uri encoded becomes codice_3 get /download.php file= 252fetc 252fpasswd | [
7662,
84
] | Test |
2,676 | 4 | Phillip_Porras:phillip porras phillip a. porras computer scientist security researcher known work combating conficker worm porras leads internet security group sri international computer science laboratory previously manager trusted computer systems department aerospace corporation porras holds 12 u.s. patents named sri fellow 2013 porras attended university california irvine porras author patents involved 2008 case sri international inc. v. internet security systems inc.. conficker worm initial attack porras running honeypot one first security researchers notice part conficker cabal helped combat worm porras team sri published extensive analysis worm 2010 porras co-author blade collaboration sri georgia tech researchers designed prevent drive-by download malware attacks porras named sri fellow 2013 long-term work information security malware analysis recent research openflow | [
3019
] | Test |
2,677 | 3 | Ballblazer:ballblazer ballblazer 1984 futuristic sports game created lucasfilm games originally released atari 8-bit family ported atari 5200 apple ii zx spectrum amstrad cpc commodore 64 msx later atari 7800 nintendo famicom game called ballblaster development pirated versions game went name well principal creator programmer ballblazer david levine 1990 lucasarts rainbow arts released remake follow-up game called masterblazer game released amiga atari st ms-dos march 31 1997 remake original titled ballblazer champions released sony playstation ballblazer simple one-on-one sports-style game bearing similarities basketball soccer side represented craft called rotofoil controlled either human player computer-controlled droid ten levels difficulty game allows human vs. human human vs. droid droid vs. droid matches basic objective game score points either firing carrying floating ball opponent goal game takes place flat checkerboard playfield player half screen presented first-person perspective player gain possession ball simply running point held force field front craft opponent attempt knock ball away player using fire button player possession ball also fire ball toward goal player possession ball rotofoil automatically turns 90-degree intervals face ball possessing ball turns player toward opponent goal goalposts move side side end playfield goals scored goal becomes narrower pushing ball goal scores one point firing ball posts close range scores two points successfully scoring long range goalposts visible scores three points maximum number total points two players ten meaning points scored would take combined total ten cause opponent score reduced amount resulting kind tug war scoring system game ends either player successfully scores ten points timer runs time runs score tied game goes sudden death first player score wins ballblazer theme music called song grid heard matches algorithmically generated technique designed lucasfilm games team leader peter langston called riffology lead melody assembled predefined set 32 eight-note melody fragments riffs put together randomly algorithm also makes choices several parameters including fast play riff loud play omit elide notes insert rhythmic break melody accompanied bassline drums chords also assembled fly simplified version approach effect music plays forever without repeating without straying far original theme langston experienced jazz rock folk musician said ballblazer music one reviewer eminent jazz player nowiki /nowiki pat metheny said sounded like john coltrane think best compliment far atari 7800 version one rare releases system use pokey additional sound chip sample ballblazer music commodore 64 version computer gaming world stated quick intense ballblazer squeezes atari 400/800 game 've ever seen ... spectacular graphics info rated ballblazer four stars five stating undoubtedly fastest game available 64 recommending gamers strobe-like reflexes zzap 64 gave enthusiastic review commodore 64 version game criticism weak sound effects overall rating 98 game described best sports simulation hit 64 yet | [
6380
] | Test |
2,678 | 4 | Stars_virus:stars virus stars virus computer virus infects computers running microsoft windows named discovered iranian authorities april 2011 iran claimed used tool commit espionage western researchers came believe probably thing duqu virus part stuxnet attack iran stars virus studied laboratory iran – means major vendors antivirus software access samples therefore could assess potential relation duqu stuxnet foreign computer experts say seen evidence virus even doubt actual existence iran claiming stars harmful computer systems said inflict minor damage initial stage might mistaken executable files governmental organizations second attack claimed iran stuxnet computer worm discovered july 2010 targeted industrial software equipment researchers came believe stars virus found iranian computer specialists duqu virus duqu virus keylogger embedded jpeg file since file taken keylogger portion image remained turned image taken hubble telescope showing cluster stars aftermath two galaxies colliding symantec kaspersky crysys researchers came believe duqu stars virus | [
704,
3932,
2912,
376,
3277,
2923,
5401,
7194,
2587,
3323,
5779,
7600,
4025,
1528,
4759,
2991,
1173,
6526,
6904,
6541,
6194,
3038,
4440,
3047,
6569,
2693,
862,
7307,
6589,
5187,
1996,
7328,
208,
2021,
5922,
6628,
924,
4531,
600,
1307,
28... | Test |
2,679 | 2 | Core_Foundation:core foundation core foundation also called cf c application programming interface api macos ios mix low-level routines wrapper functions apple releases open-source project called cflite used write cross-platform applications macos linux windows third-party open-source implementation called opencflite also exists extends apple distribution building windows linux environments core foundation routines follow certain naming convention deal opaque objects example cfdictionaryref functions whose names begin cfdictionary objects often reference counted manually codice_1 codice_2 internally core foundation forms base types objective-c standard library well prevalent use core foundation passing primitive types data including raw bytes unicode strings numbers calendar dates uuids well collections arrays sets dictionaries numerous macos c routines primarily gui-related operating system level core foundation also provides standardized application preferences management codice_3 bundle handling run loops interprocess communication codice_4 codice_5 basic graphical user interface message dialog codice_6 parts api include utility routines wrappers around existing apis ease use utility routines perform actions file system network i/o codice_7 codice_8 codice_9 endianness translation byte order utilities examples wrapper routines include core foundation wrapper routines unix sockets cfsocket api types core foundation toll-free bridged interchangeable simple cast foundation kit counterparts example one could create codice_10 core foundation type later simply use standard c cast convert objective-c counterpart codice_11 use desired objective-c methods object one normally would core foundation plug-in model cfplugin based microsoft component object model | [
6788,
7517,
3940,
713,
7890,
4320,
4690,
734,
5752,
405,
6832,
6125,
3989,
2954,
2597,
3322,
1499,
6847,
1502,
4003,
6142,
2609,
5786,
4740,
1897,
4376,
4749,
5450,
6505,
7601,
2627,
7609,
6165,
4759,
1171,
5109,
3001,
2284,
1178,
120,
... | Test |
2,680 | 2 | SUSE_Linux:suse linux suse linux computer operating system built top free open source linux kernel distributed system application software open source projects suse linux german origin basically acronym “ software und system-entwicklung ” software systems development mainly developed europe first version appeared early 1994 making suse one oldest existing commercial distributions known yast configuration tool novell bought suse suse brands trademarks 2003 novell one founding members open invention network decided make community important part development process opening widely distribution development outside contributors 2005 creating opensuse distribution opensuse project novell employed 500 developers working suse 2004 27 april 2011 novell suse acquired attachmate group made suse independent business unit later october 2014 entire attachmate group including suse acquired british firm micro focus international suse continues operate independent business unit 2 july 2018 announced micro focus would sell suse blitz 18-679 gmbh subsidiary eqt partners 2.535 billion gesellschaft für software und system entwicklung mbh lit company software system development founded 2 september 1992 nuremberg germany roland dyroff thomas fehr burchard steinbild hubert mantel three founders still mathematics students university fehr already graduated working software engineer original idea company would develop software function advisory unix group according mantel group decided distribute linux offering support name founding s.u.s.e chosen german acronym software und system-entwicklung meaning software systems development full name never used however company known s.u.s.e shortened suse october 1998 2003 capitalized suse official logo current mascot distribution veiled chameleon officially named geeko portmanteau gecko geek following competition company name geeko logo brand evolved time reflect name changes company started service provider among things regularly released software packages included softlanding linux system sls defunct slackware also printed unix/linux manuals offered technical assistance third party products suse initially used characteristics managed suse different fashions building distribution linux s.u.s.e used first slackware 1992 jurix distribution defunct 1996 starting point created florian la roche joined s.u.s.e team began develop yast installer configuration tool would become central point distribution 1996 first distribution name s.u.s.e linux published s.u.s.e linux 4.2 version number caused much discussion version 1.1 using number 4.2 intentional reference answer ultimate question life universe everything hitchhiker guide galaxy science fiction novels english writer douglas adams yast first version number 0.42 similar reference time suse linux incorporated many aspects red hat linux rpm package manager file structure s.u.s.e became largest linux distributor germany 1997 suse llc established direction president managing partner james gray oakland california enabled company develop linux markets americas asia red hat ubiquitous united states suse linux continued grow germany well nordic countries finland sweden october 1998 name changed officially suse without dots linus torvalds creator linux kernel used fairly often suse entered uk 1999 2001 company forced reduce staff significantly order survive 4 november 2003 novell announced would acquire suse linux ag 210 million acquisition finalized january 2004 move reach business audience effectively suse introduced suse linux enterprise server 2001 months novell purchase changed company name suse linux suse name acronym according j. philips novell corporate technology strategist asia pacific region novell would medium term alter way suse developed novell annual brainshare conference 2004 first time computers run suse linux announced proprietary suse administration program yast2 would released gpl license 4 august 2005 novell announced suse professional series would become open launch opensuse project community software always open source opensuse opened development process allowing developers users test develop previously development work accomplished in-house suse version 10.0 first version offered public beta testing suse linux 10.0 included open source proprietary applications retail boxed-set editions part change yast online update server access became free suse linux users also first time gnome desktop upgraded equal status traditional kde november 2005 suse founder hubert mantel announced resignation company stated novell acquisition changed suse beyond expectations believe company founded 13 years earlier resignation apparently stemmed dispute implementation ximian products gnome-based default desktop environment linux distribution re-joined year later 3 november 2006 renewed 25 july 2011 novell signed agreement microsoft covering improvement suse ability interoperate microsoft windows cross-promotion/marketing products patent cross-licensing agreement considered controversial free software community 22 november 2010 novell announced agreed acquisition attachmate group 2.2 billion attachmate group plans operate novell two units suse becoming stand-alone business anticipates change relationship suse business opensuse project result transaction u.s. department justice announced order proceed first phase acquisition certain patents patent applications novell inc. cptn holdings llc owners would alter original agreements address department antitrust concerns department said originally proposed deal would jeopardize ability open source software linux continue innovate compete development distribution server desktop mobile operating systems well middleware virtualization products stipulations regarding licensing patents acquisition completed 27 april 2011 subsequently 23 july 2011 attachmate group launched new website suse business 20 november 2014 attachmate group merged micro focus form micro focus group suse operated separate business unit dedicated product portfolio 2 july 2018 announced micro focus would sell suse business segment eqt partners 2.535 billion suse provides thirteen-year product life cycle suse linux enterprise 11 12 detailed eol eos eoxs end-of-extended-support information see suse linux available two brands opensuse suse linux enterprise opensuse free community distribution driven opensuse project includes latest bleeding edge linux technologies designed home users enthusiasts suse linux enterprise suse tested certified open-source solution major enterprises opensuse freely available community project releases versions comparatively frequent basis generally uses latest versions various open source projects includes suse linux enterprise suse commercial edition suse releases much less frequently enabling offer support effectively enterprise production deployments certified wide variety enterprise applications offers number special enterprise features including high availability point sale extensions suse historically uses heavily-tested subset packages opensuse linux basis suse linux enterprise suse offers suse linux enterprise server suse linux enterprise desktop focuses packages fit specific purpose example suse linux enterprise desktop include apache web server suse linux enterprise server include xgl/compiz contrast opensuse separate distributions server desktop tablets rather repositories contain needed software use installation patterns accomplish opensuse driven opensuse project community sponsored suse develop maintain suse linux components equivalent historic suse linux professional acquisition suse linux novell suse decided make community central development process theoretical development cycle 8 months lifetime duration critical updates 18 months date release fully freely available immediate download opensuse sixth popular linux distribution 2013 fourth popular 2014 according distrowatch suse develops multiple products enterprise business line business products target corporate environments higher life cycle 10 years extendable 13 longer development cycle 6 18 months guarantee stability potential expense development speed technical support certification independent hardware software vendors suse linux enterprise products available sale updates fees suse linux enterprise fewer packages opensuse distribution differences desktop applications suited consumers business enterprise products installed using linux kernel novell open enterprise server oes uses suse linux enterprise server platform product also known oes-linux suse linux enterprise included vmware vsphere licensing june 25 2014 'free noted suse partners website suse suse studio product web interface built using ruby rails opensuse kiwi open build service tools allowed users put together custom linux distribution graphically generate output including large variety virtual machine disk images suse studio merged open build service resulting project renamed suse studio express september 2017 | [
4295,
4670,
2930,
3973,
6117,
2226,
6830,
6848,
7587,
1893,
6499,
7954,
1906,
1522,
1910,
462,
3693,
7251,
7253,
474,
4050,
2297,
1941,
6209,
4435,
4091,
4824,
5523,
6231,
5530,
8043,
6244,
890,
5200,
7334,
1629,
3444,
6988,
5571,
578,
... | Test |
2,681 | 4 | NAT_traversal:nat traversal network address translator traversal computer networking technique establishing maintaining internet protocol connections across gateways implement network address translation nat nat traversal techniques required many network applications peer-to-peer file sharing voice ip nat devices allow use private ip addresses private networks behind routers single public ip address facing internet internal network devices communicate hosts external network changing source address outgoing requests nat device relaying replies back originating device leaves internal network ill-suited hosting servers nat device automatic method determining internal host incoming packets destined problem general web access email however applications peer-to-peer file sharing voip services video game consoles require clients servers well incoming requests easily correlated proper internal host furthermore many types services carry ip address port number information application data potentially requiring substitution deep packet inspection network address translation technologies standardized result methods used nat traversal often proprietary poorly documented many traversal techniques require assistance servers outside masqueraded network methods use server establishing connection others based relaying data increases bandwidth requirements latency detrimental real-time voice video communications nat traversal techniques usually bypass enterprise security policies enterprise security experts prefer techniques explicitly cooperate nat firewalls allowing nat traversal still enabling marshalling nat enforce enterprise security policies ietf standards based security model realm-specific ip rsip middlebox communications midcom following nat traversal techniques available recent proliferation symmetric nats reduced nat traversal success rates many practical situations mobile public wifi connections hole punching techniques stun ice fail traversing symmetric nats without help relay server practiced turn techniques traverse symmetric nats attempting predict next port opened nat device discovered 2003 yutaka takeda panasonic communications research laboratory 2008 researchers waseda university port prediction techniques effective nat devices use known deterministic algorithms port selection predictable yet non-static port allocation scheme uncommon large scale nats used 4g lte networks therefore port prediction largely ineffective mobile broadband networks ipsec virtual private network clients use nat traversal order encapsulating security payload packets traverse nat ipsec uses several protocols operation must enabled traverse firewalls network address translators many routers provide explicit features often called ipsec passthrough windows xp nat traversal enabled default windows xp service pack 2 disabled default case vpn server also behind nat device rare controversial security issue ipsec nat-t patches also available windows 2000 windows nt windows 98 nat traversal ipsec may used enable opportunistic encryption traffic systems nat traversal allows systems behind nats request establish secure connections demand hosted nat traversal hnt set mechanisms including media relaying latching used intermediaries ietf advises using latching internet recommends ice security reasons | [
2984,
3172,
8,
4577,
1354,
7343,
7626,
3777,
2644,
7170,
2111,
1470,
5039,
5488,
2664,
6025,
7744,
5847,
2128,
499,
2231,
4434,
4891,
5414,
4172,
3573,
2430,
2696,
6487,
533,
1329,
4014,
5790,
6499,
7599
] | Test |
2,682 | 4 | Duplicity_(software):duplicity software duplicity software suite provides encrypted digitally signed versioned remote backup files requiring little remote server released terms gnu general public license gpl duplicity free software duplicity devises scheme first archive complete full backup subsequent incremental backups add differences latest full incremental backup chains consisting full backup series incremental backups recovered point time incremental steps taken incremental backups missing incremental backups following reconstructed using gnupg librsync tar rdiff transmit data backup repository use ssh/scp/sftp local file access rsync ftp amazon s3 google cloud storage rackspace cloud files others duplicity works best unix-like operating systems linux bsd mac os x though used windows cygwin currently duplicity supports deleted files full unix permissions directories symbolic links fifos device files hard links | [
4386,
1254,
7969,
4594,
5571,
1281,
1750,
578,
6289,
7838,
7214,
3827,
5965,
3915
] | Test |
2,683 | 6 | Google_File_System:google file system google file system gfs googlefs proprietary distributed file system developed google provide efficient reliable access data using large clusters commodity hardware last version google file system codenamed colossus released 2010 gfs enhanced google core data storage usage needs primarily search engine generate enormous amounts data must retained google file system grew earlier google effort bigfiles developed larry page sergey brin early days google still located stanford files divided fixed-size chunks 64 megabytes similar clusters sectors regular file systems extremely rarely overwritten shrunk files usually appended read also designed optimized run google computing clusters dense nodes consist cheap commodity computers means precautions must taken high failure rate individual nodes subsequent data loss design decisions select high data throughputs even comes cost latency gfs cluster consists multiple nodes nodes divided two types one master node large number chunkservers file divided fixed-size chunks chunkservers store chunks chunk assigned globally unique 64-bit label master node time creation logical mappings files constituent chunks maintained chunk replicated several times throughout network default replicated three times configurable files high demand may higher replication factor files application client uses strict storage optimizations may replicated less three times order cope quick garbage cleaning policies master server usually store actual chunks rather metadata associated chunks tables mapping 64-bit labels chunk locations files make mapping files chunks locations copies chunks processes reading writing particular chunk taking snapshot chunk pursuant replicate usually instigation master server due node failures number copies chunk fallen beneath set number metadata kept current master server periodically receiving updates chunk server heart-beat messages permissions modifications handled system time-limited expiring leases master server grants permission process finite period time process granted permission master server modify chunk modifying chunkserver always primary chunk holder propagates changes chunkservers backup copies changes saved chunkservers acknowledge thus guaranteeing completion atomicity operation programs access chunks first querying master server locations desired chunks chunks operated i.e outstanding leases exist master replies locations program contacts receives data chunkserver directly similar kazaa supernodes unlike file systems gfs implemented kernel operating system instead provided userspace library google file system implement posix api files organized hierarchically directories identified pathnames file operations create delete open close read write supported supports record append allows multiple clients append data file concurrently atomicity guaranteed deciding benchmarking results used relatively small number servers 15 file system achieves reading performance comparable single disk 80–100 mb/s reduced write performance 30 mb/s relatively slow 5 mb/s appending data existing files authors present results random seek time master node directly involved data reading data passed chunk server directly reading client read rate increases significantly number chunk servers achieving 583 mb/s 342 nodes aggregating large number servers also allows big capacity somewhat reduced storing data three independent locations provide redundancy | [
2902,
3599,
4298,
2547,
7161,
5372,
4672,
6427,
6431,
3626,
2569,
5049,
6117,
3309,
7924,
2591,
759,
5775,
6854,
5437,
6153,
84,
4375,
6500,
6505,
5455,
5457,
460,
4762,
1534,
7967,
6176,
7976,
5476,
4406,
821,
7258,
5130,
831,
1561,
83... | Test |
2,684 | 4 | Vulnerability_assessment_(computing):vulnerability assessment computing vulnerability assessment process defining identifying classifying security holes information technology systems attacker exploit vulnerability violate security system known vulnerabilities authentication vulnerability authorization vulnerability input validation vulnerability deploying system first must go series vulnerability assessments ensure build system secure known security risks new vulnerability discovered system administrator perform assessment discover modules vulnerable start patch process fixes place another assessment run verify vulnerabilities actually resolved cycle assess patch re-assess become standard method many organizations manage security issues primary purpose assessment find vulnerabilities system assessment report conveys stakeholders system secured vulnerabilities intruder gained access network consisting vulnerable web servers safe assume gained access systems well assessment report security administrator able determine intrusion occurred identify compromised assets take appropriate security measures prevent critical damage system depending system vulnerability assessment many types level host assessment looks system-level vulnerabilities insecure file permissions application level bugs backdoor trojan horse installations requires specialized tools operating system software packages used addition administrative access system tested host assessment often costly term time thus used assessment critical systems tools like cops tiger popular host assessment network assessment one assess network known vulnerabilities locates systems network determines network services use analyzes services potential vulnerabilities process require configuration changes systems assessed unlike host assessment network assessment requires little computational cost effort vulnerability assessment penetration testing two different testing methods differentiated basis certain specific parameters | [
3932,
4521,
2747,
5857,
8091,
3246,
294
] | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.