node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
985 | 6 | BetterZip:betterzip betterzip trialware file archiver developed robert rezabek first released may 2006 developed solely os x platform unlike built-in archive utility apple includes ability extract compress many archive formats well ability view archive selectively extract files without automatically extracting entire contents betterzip supports extraction following file types following file types supported archive creation betterzip include rar compression without separately downloading command line rar utility rarlab betterzip integrate rar compression gui like formats | [
4213,
7058,
1352,
6992,
5571,
658,
4700,
1955,
7746,
3032,
7201,
7387,
3219,
510,
8126,
1127,
2334,
6940,
4732,
5256,
3152,
169,
1139,
5349,
4461,
2897,
619
] | Validation |
986 | 7 | Plex_Systems:plex systems plex systems inc. software company based troy michigan company develops markets plex manufacturing cloud software service saas cloud computing erp manufacturing plex systems began internal project automotive parts manufacturer msp industries corporation 1989 company formed plexus systems llc 1995 providing client/server manufacturing software company began offering software via software service saas cloud computing model plexus online launched 2001 2006 apax partners acquired majority interest company 2009 company changed name plex systems renamed flagship product plex online june 2012 company announced acquisition group share holders including apax partners francisco partners june 2012 accel partners invested 30 million plex june 2014 plex secured 50 million additional funding led t. rowe price joined existing investors francisco partners accel partners aberdeen group suggested aberdeen axis erp manufacturing 2009 ” report plex systems among top four performing erp vendors plex erp software solution provider placed entirely within “ champion ” performance category ahead sap ag evidence plex acting sponsor aberdeen group report aberdeen may biased however vendors evaluated report also sponsors aberdeen group historically company released detailed financial information citing status privately held corporation however may 2012 company reported revenue increase 30.6 first quarter ending march 31 compared year earlier recurring revenue increased 30.5 percent representing 19th consecutive quarter growth plex known first provider complete saas erp solution manufacturing companies several software bloggers written plex ’ ability provide wide scope critical features manufacturers saas model larger erp vendors succeeded time 2014 firm raised 50 million funding support expanded product development well investments marketing sales plex manufacturing cloud software service saas cloud application erp manages manufacturing process supports functions production inventory shipping supply-chain management quality accounting sales human resource departments addition traditional erp roles finance/accounting procurement human capital management etc plex targeted towards manufacturing industries rigorous traceability quality food safety requirements including automotive aerospace food beverage life sciences medical manufacturing system must accessed using web browser making functions available anywhere internet connection software designed provide managers engineers real-time visibility production data plex systems calls saas solution erp software also includes following integrated functions plex manufacturing cloud built multi-tenant architecture software service saas also referred cloud application application delivery model user accesses software internet anywhere time physical location ownership/maintenance burden system actually serves software outside responsibility concern end users professionals expressed concern moving erp saas model time many companies successfully performed deployments plex systems providers saas applications deployed atop platform layer cloud computing stack applications tend sold subscription shifting burden software cost across useful life software tend accounted operating expense opex contrast traditional methods require upfront payment financing tend accounted capital expense capex | [
2961,
330
] | Validation |
987 | 3 | Apple_A8:apple a8 apple a8 64-bit arm-based system chip soc designed apple inc first appeared iphone 6 iphone 6 plus introduced september 9 2014 apple states 25 cpu performance 50 graphics performance drawing 50 power predecessor apple a7 currently oldest chip supported produced apple ipad mini 4 apple tv 4th generation support ipados tvos 13 respectively a8 manufactured 20 nm process tsmc replaced samsung manufacturer apple mobile device processors contains 2 billion transistors despite twice number transistors a7 a8 physical size reduced 13 89 mm a8 uses lpddr3-1333 ram 64-bit memory interface iphone 6/6 plus sixth generation ipod touch homepod a8 1 gb ram included package a8 ipad mini 4 4th generation apple tv packaged 2 gb ram a8 cpu per-core l1 cache 64 kb data 64 kb instructions l2 cache 1 mb shared cpu cores 4 mb l3 cache services entire soc predecessor 6 decode 6 issue 9 wide out-of-order design processor dual core used iphone 6 frequency 1.4 ghz supporting apple claim 25 faster a7 also supports notion second generation enhanced cyclone core called typhoon entirely new architecture would supposedly mean significant performance gain per hz a8 also integrates graphics processing unit gpu 4-shader-cluster powervr gx6450 october 16 2014 apple introduced variant a8 a8x ipad air 2 compared a8 a8x enhanced 8-shader-cluster gpu improved cpu performance due one extra core higher frequency a8 branch predictor claimed infringe 1998 patent october 14 2015 district judge found apple guilty infringing u.s. patent table based data speculation circuit parallel processing computer apple a7 a8 processors patent owned wisconsin alumni research foundation warf firm affiliated university wisconsin july 24 2017 apple ordered pay warf 506 million patent infringement apple filed appellate brief october 26 2017 u.s. court appeals federal circuit argued apple infringe patent owned wisconsin alumni research foundation september 28 2018 ruling overturned appeal award thrown u.s. federal circuit court appeals patent expired december 2016 | [
6788,
6421,
7890,
5732,
722,
1799,
1094,
5737,
2926,
4690,
5037,
5740,
1473,
5750,
5752,
405,
5405,
5406,
1864,
6125,
2954,
7572,
6482,
6847,
67,
6142,
2609,
4373,
7226,
4376,
2978,
446,
4749,
5450,
7601,
451,
3346,
6165,
4389,
5463,
10... | Test |
988 | 3 | Anticiparallelism:anticiparallelism anticiparallelism anticipatory parallelism term coined bob metcalfe 1998 technique using idle machine cycles perform useful computing tasks background tasks must readily interrupted intervals computer needs return primary task example task transmitting e-mail anticiparalleism also known speculative execution continual computation optimistic execution | [
6148
] | Validation |
989 | 6 | Devfsd:devfsd devfsd device manager linux kernel primarily creates device nodes /dev directory kernel drivers make underlying hardware accessible nodes exist virtual device file system named devfs systems support many different types hardware device nodes convenient creating possible device nodes beforehand real filesystem devfs step forward several disadvantages since version 2.5 linux kernel devfs succeeded udev devtmpfs | [
2182,
3613,
7528,
7532,
2559,
5744,
6443,
7555,
4341,
5762,
3666,
5453,
5803,
7242,
1535,
1924,
6892,
1176,
1933,
1208,
6211,
5865,
7669,
1227,
1596,
165,
7312,
1607,
5884,
1991,
5540,
1260,
6984,
5571,
578,
4877,
5580,
2765,
4174,
7038,
... | Test |
990 | 4 | List_of_shibboleths:list shibboleths listed various examples words phrases identified shibboleths word custom whose variations pronunciation style used differentiate members ingroups outgroups every frenchman failed test stabbed spot still nightgown signal uprising matins bells city churches monasteries became known bruges matins brugse metten like name massacre story may influenced sicilian uprising mentioned | [
859
] | Test |
991 | 4 | AAA_(computer_security):aaa computer security aaa refers authentication authorization accounting used refer family protocols mediate network access two network protocols providing functionality particularly popular radius protocol newer diameter counterpart explanations authentication authorization accounting available external sites cases term aaa used refer protocol-specific information example diameter uses uri scheme aaa stands authentication authorization accounting diameter-based protocol aaas stands authentication authorization accounting secure transport protocols defined internet engineering task force rfc 6733 intended provide authentication authorization accounting aaa framework applications network access ip mobility local roaming situations term aaa used narrow context concept aaa widely used within industry result incorrect refer aaa diameter one aaa servers cdma data networks entities provide internet protocol ip functionality support functions authentication authorization accounting aaa server cdma wireless data network architecture similar hlr cdma wireless voice network architecture types aaa servers include following current aaa servers communicate using radius protocol tia specifications refer aaa servers radius servers however future aaa servers expected use successor protocol radius known diameter behavior aaa servers radius servers cdma2000 wireless ip network specified tia-835 | [
3821,
3411,
6045
] | Test |
992 | 7 | STONITH:stonith stonith shoot node head shoot offending node head sometimes called stomith shoot member/machine head technique fencing computer clusters fencing isolation failed node cause disruption computer cluster name suggests stonith fences failed nodes resetting powering failed node multi-node error-prone contention cluster catastrophic results nodes try writing shared storage resource stonith provides effective rather drastic protection problems single node systems use comparable mechanism called watchdog timer watchdog timer reset node node tell watchdog circuit operating well stonith decision based various decisions customer specific plugins | [] | Validation |
993 | 9 | Go_(programming_language):go programming language go also known golang statically typed compiled programming language designed google robert griesemer rob pike ken thompson go syntactically similar c memory safety garbage collection structural typing csp-style concurrency two major implementations third party transpiler gopherjs compiles go javascript front-end web development go designed google 2007 improve programming productivity era multicore networked machines large codebases designers wanted address criticism languages use google keep useful characteristics designers primarily motivated shared dislike c++ go publicly announced november 2009 version 1.0 released march 2012 go widely used production google many organizations open-source projects november 2016 go go mono fonts sans-serif monospaced respectively released type designers charles bigelow kris holmes designed legible large x-height distinct letterforms conforming din 1450 standard april 2018 original logo replaced stylized go slanting right trailing streamlines however gopher mascot remained august 2018 go principal contributors published two ″draft designs″ new language features generics error handling asked go users submit feedback lack support generic programming verbosity error handling go 1.x drawn considerable criticism go 1 guarantees compatibility language specification major parts standard library versions current go 1.12 release maintained promise major go release supported two newer major releases go influenced c emphasis greater simplicity safety language consists go syntax includes changes c aimed keeping code concise readable combined declaration/initialization operator introduced allows programmer write codice_6 codice_7 without specifying types variables used contrasts c codice_8 codice_9 semicolons still terminate statements implicit end line occurs functions may return multiple values returning codice_10 pair conventional way function indicates error caller go go adds literal syntaxes initializing struct parameters name initializing maps slices alternative c three-statement codice_11 loop go codice_12 expressions allow concise iteration arrays slices strings maps channels go number built-in types including numeric ones etc booleans character strings strings immutable built-in operators keywords rather functions provide concatenation comparison utf-8 encoding/decoding record types defined keyword type non-negative integer constant array type denoted arrays differing lengths thus different types dynamic arrays available slices denoted type length capacity specifying new memory needs allocated expand array several slices may share underlying memory pointers available types pointer-to- type denoted address-taking indirection use operators c happen implicitly method call attribute access syntax pointer arithmetic except via special type standard library pair types type type hash tables mapping type- keys type- values hash tables built language special syntax built-in functions channel allows sending values type concurrent go processes aside support interfaces go type system nominal keyword used define new named type distinct named types layout case members order conversions types e.g. various integer types pre-defined adding new type may define additional conversions conversions named types must always invoked explicitly example keyword used define type ipv4 addresses based 32-bit unsigned integers type ipv4addr uint32 type definition interprets value ip address simply assigning variable type type error constant expressions may either typed untyped given type assigned typed variable value represent passes compile-time check function types indicated keyword take zero parameters return zero values typed parameter return values determine function type thus type functions take 32-bit signed integer return signed integer default width value built-in interface type named type method set associated ip address example extended method checking whether value known standard // zerobroadcast reports whether addr 255.255.255.255. func addr ipv4addr zerobroadcast bool due nominal typing method definition adds method methods special definition call syntax distinct method type go provides two features replace class inheritance first embedding viewed automated form composition delegation second interfaces provides runtime polymorphism interfaces class types provide limited form structural typing otherwise nominal type system go object interface type also another type much like c++ objects simultaneously base derived class go interfaces designed protocols smalltalk programming language multiple sources use term duck typing describing go interfaces although term duck typing precisely defined therefore wrong usually implies type conformance statically checked since conformance go interface checked statically go compiler except performing type assertion go authors prefer term structural typing definition interface type lists required methods name type object type functions exist matching required methods interface type object type well definition type need identify type example defined import math type shape interface type square struct // note implements declaration type circle struct // implements declaration either implicitly assigned -typed variable formal language go interface system provides structural rather nominal typing interfaces embed interfaces effect creating combined interface satisfied exactly types implement embedded interface methods newly defined interface adds go standard library uses interfaces provide genericity several places including input/output system based concepts besides calling methods via interfaces go allows converting interface values types run-time type check language constructs type assertion checks single potential type type switch checks multiple types empty interface codice_13 important base case refer item concrete type similar class java c satisfied type including built-in types like code using empty interface simply call methods built-in operators referred-to object store codice_13 value try convert useful type via type assertion type switch inspect go codice_15 package codice_13 refer value limited way escape restrictions static typing like codice_17 c additional run-time type checks interface values implemented using pointer data second pointer run-time type information like types implemented using pointers go interface values codice_18 uninitialized go package system package path e.g. codice_19 codice_20 name e.g. codice_21 codice_22 references packages definitions must always prefixed package name capitalized names packages accessible codice_23 public codice_24 codice_4 command retrieve packages stored remote repository developers encouraged develop packages inside base path corresponding source repository example.com/user_name/package_name reduce likelihood name collision future additions standard library external libraries proposals exist introduce proper package management solution go similar rust cargo system node npm system go language built-in facilities well library support writing concurrent programs concurrency refers cpu parallelism also asynchrony letting slow operations like database network-read run program work common event-based servers primary concurrency construct goroutine type light-weight process function call prefixed keyword starts function new goroutine language specification specify goroutines implemented current implementations multiplex go process goroutines onto smaller set operating system threads similar scheduling performed erlang standard library package featuring classical concurrency control structures mutex locks etc available idiomatic concurrent programs instead prefer channels provide send messages goroutines optional buffers store messages fifo order allow sending goroutines proceed messages received channels typed channel type used transfer messages type special syntax used operate expression causes executing goroutine block value comes channel sends value possibly blocking another goroutine receives value built-in -like statement used implement non-blocking communication multiple channels see example go memory model describing goroutines must use channels operations safely share data existence channels sets go apart actor model-style concurrent languages like erlang messages addressed directly actors corresponding goroutines actor style simulated go maintaining one-to-one correspondence goroutines channels language allows multiple goroutines share channel single goroutine send receive multiple channels tools one build concurrent constructs like worker pools pipelines say file decompressed parsed downloads background calls timeout fan-out parallel calls set services others channels also found uses usual notion interprocess communication like serving concurrency-safe list recycled buffers implementing coroutines helped inspire name goroutine implementing iterators concurrency-related structural conventions go channels alternative channel inputs derived tony hoare communicating sequential processes model unlike previous concurrent programming languages occam limbo language go co-designer rob pike worked go provide built-in notion safe verifiable concurrency communicating-processes model favored go one goroutines program share single address space means mutable objects pointers shared goroutines see although go concurrency features aimed primarily parallel processing used program shared memory multi-processor machines various studies done effectiveness approach one studies compared size lines code speed programs written seasoned programmer familiar language corrections programs go expert google development team chapel cilk intel tbb study found non-expert tended write divide-and-conquer algorithms one statement per recursion expert wrote distribute-work-synchronize programs using one goroutine per processor expert programs usually faster also longer restrictions goroutines access shared data making race conditions possible specifically unless program explicitly synchronizes via channels means writes one goroutine might partly entirely visible another often guarantees ordering writes furthermore go internal data structures like interface values slice headers hash tables string headers immune race conditions type memory safety violated multithreaded programs modify shared instances types without synchronization instead language support safe concurrent programming thus relies conventions example chisnall recommends idiom called aliases xor mutable meaning passing mutable value pointer channel signals transfer ownership value receiver linker gc toolchain creates statically-linked binaries default therefore go binaries include go runtime go deliberately omits certain features common languages including implementation inheritance generic programming assertions pointer arithmetic implicit type conversions untagged unions tagged unions designers added facilities three agreed omitted language features designers explicitly argue assertions pointer arithmetic defending choice omit type inheritance giving useful language encouraging instead use interfaces achieve dynamic dispatch composition reuse code composition delegation fact largely automated embedding according researchers schmager et al feature many drawbacks inheritance affects public interface objects fine-grained i.e method-level control embedding methods embedded objects hidden static making obvious whether programmers overuse extent programmers languages reputed overuse inheritance designers express openness generic programming note built-in functions fact type-generic treated special cases pike calls weakness may point changed google team built least one compiler experimental go dialect generics release also open standardizing ways apply code generation initially omitted exception-like mechanism eventually added go authors advise using unrecoverable errors halt entire program server request shortcut propagate errors stack within package across package boundaries error returns standard api go authors put substantial effort influencing style go programs main go distribution includes tools building testing analyzing code also includes profiling debugging support runtime instrumentation example track garbage collection pauses race condition tester ecosystem third-party tools adds standard distribution codice_44 enables code autocompletion many text editors codice_45 go team member automatically adds/removes package imports needed codice_46 detects code might unintentionally ignore errors plugins exist adding language support several text editors several ides available including liteide simple open source cross-platform go ide goland claims capable ergonomic package main import fmt func main fmt package formatted i/o similar c c file input/output following simple program demonstrates go concurrency features implement asynchronous program launches two lightweight threads goroutines one waits user type text implements timeout statement waits either goroutines send message main routine acts first message arrive example adapted david chisnall book package main import func readword ch chan string func timeout chan bool func main notable open-source applications written go include notable companies sites using go generally together languages exclusively include interface system deliberate omission inheritance praised michele simionato likened characteristics standard ml calling shame popular language followed particular route dave astels engine yard wrote go named programming language year tiobe programming community index first year 2009 larger 12-month increase popularity 2 months introduction november language year reached 13th place january 2010 surpassing established languages like pascal june 2015 ranking dropped 50th index placing lower cobol fortran january 2017 ranking surged 13th indicating significant growth popularity adoption go awarded tiobe programming language year 2016 bruce eckel stated 2011 evaluation language implementation comparison c++ gcc java scala google engineer found evaluation got rebuttal go development team ian lance taylor improved go code hundt paper aware intention publish code says version never intended example idiomatic efficient go russ cox optimized go code well c++ code got go code run slightly faster c++ order magnitude faster code paper november 10 2009 day general release language francis mccabe developer go programming language note exclamation point requested name change google language prevent confusion language spent 10 years developing mccabe raised concerns 'big guy end steam-rollering concern resonated 120 developers commented google official issues thread saying change name even saying issue contradicts google motto n't evil october 12 2010 issue closed google developer russ cox rsc custom status unfortunate accompanied following comment many computing products services named go 11 months since release minimal confusion two languages go critics assert designers argue omissions simplifications make language better see | [
2902,
3931,
2176,
4302,
5372,
6427,
6428,
4315,
4318,
1842,
2927,
2569,
3968,
7908,
1102,
6449,
4705,
744,
7557,
3309,
7924,
2591,
1495,
5775,
3660,
1882,
2961,
7213,
771,
7582,
2966,
6489,
775,
6153,
2619,
5091,
6507,
793,
3684,
5455,
... | Test |
994 | 4 | Endian_Firewall:endian firewall endian firewall open-source router firewall gateway security linux distribution developed south tyrolean company endian product available either free software commercial software guaranteed support services hardware appliance including support services endian firewall turnkey linux security distribution independent unified security management operating system endian firewall based hardened linux operating system system installed pc using boot cd operated without monitor online interface via keyboard command-line interface server configured via web interface serial interface main task endian firewall gateway router firewall act proxy web email ftp sip dns four different networks dependent number network cards installed host pc normally managed networks configured web interface endian differentiated color coding endian firewall includes support load balancing means add another connection internet red network endian firewall distributes network load interfaces behind endian firewall italian endian spa appiano south tyrol community volunteer developers helpers license model endian provides commercial version free version current version includes following key features endian firewall fork linux firewall ipcop turn fork smoothwall due numerous developments one-fifth original ipcop code used newer versions based initially linux scratch version 2.2 rhel centos upcoming version 3.0 endian firewall virtually smoothwall- ipcop-free greatest difference ipcop endian firewall merely pure router-firewall combination comprehensive gateway security solution unified threat management virus scanner spam blocker firmly integrated distribution allows transport http ftp pop 3 smtp scanned real-time optionally filtered also menus refined ipcop approach reducing complexity also reducing reconfigurability individual services concerning business model endian different origins smoothwall ipcop follows | [
1249,
3165,
1809,
2001,
806,
1261,
2644,
3185,
4492,
7351,
385,
7536,
2296,
2746,
5571,
6107,
1559,
2119,
6908,
578,
3383,
6456,
3551,
1291,
7275,
7744,
4162,
3394,
6560,
7752,
4977,
7289,
7478,
3223,
3484,
4091,
2790,
7217,
4734,
7683,
... | Validation |
995 | 5 | ISDN_User_Part:isdn user part isdn integrated services digital network user part isup part signaling system 7 ss7 used set telephone calls public switched telephone network pstn specified itu-t part q.76x series telephone call set one subscriber another several telephone exchanges could involved possibly across international boundaries allow call set correctly isup supported switch signal call-related information like called party number next switch network using isup messages telephone exchanges may connected via t1 e1 trunks transport speech calls trunks divided 64 kbit/s timeslots one timeslot carry exactly one call regardless facilities used interconnect switches circuit two switches uniquely identified circuit identification code cic included isup messages exchange uses information along received signaling information especially called party number determine inbound outbound circuits connected together provide end end speech path addition call related information isup also used exchange status information permit management available circuits case outbound circuit available particular exchange release message sent back preceding switches chain different isup variants exist itu-t specifies variant used international network europe etsi releases isup specification close itu-t. itu-t isup used international connections base national isup variants countries variation isup cover national requirements ansi specifies variations isup utilized north american numbering plan however countries nanp differ support procedures example lata meaningless within canada also rbocs support telcordia procedures fully specified ansi countries outside nanp support ansi-based variants e.g mexico variations isup differ subtle ways vast majority isup message type parameter type parameter field code-points related fundamental call processing procedures agree across variants according itu-t q.761 section 2.4.1 isup interworking isup'92 backwards compatible isup blue book q.767 basic call procedures supplementary services except procedures e.g number portability additionally compatibility features introduced version ensure forward compatibility newer versions isup message contains fixed header containing circuit identification code isup message type followed mandatory fixed-length parameter part mandatory variable-length parameter part optional parameter part dependent type message sent isup messages sent using services message transfer part less often signalling connection control part messages transmitted various stages call setup release common messages basic call flow involving two telecom switches exchange isup messages subscriber interfaces covered listed better understanding detailed exchange isup messages involving two isdn telecom switches report alcatel s12 digital switch release cause codes used identify debug events occurring isdn user part signaling every event isup signaling generates cause code number even normal isup call cause code generated lot applications developed based cause code isup signaling similarly telecom operators trace causecodes debug call failures following list cause codes used cause codes defined number effectively undefined may used proprietary solutions signalling information field sif isup message signal units msu contain following components routing label indicates point codes originating destination nodes network also includes signalling link selection field used select multiple routes msu could take two nodes circuit identification code used specify trunk two switches used carry particular call note versions ansi isup permit cic 14 significant bits instead 12 shown sent using services signalling connection control part isup messages passed sccp user data parameter nsdu consist last 4 components message type mandatory fixed part mandatory variable part optional part routing label circuit identification code included user data passed sccp | [
498,
3982,
4976,
7590,
533,
2236,
5492,
7170
] | Test |
996 | 5 | Stop_Procrastinating:stop procrastinating stop procrastinating internet website blocking computer software restricts access internet specific websites set amount time avoid limit online distraction become popular tool students writers home workers self-employed entrepreneurs well parents help control limited children internet use also used extensively men trying break addiction pornography software become notable popular tool students way block internet distraction studying covered extensively national university publications undergraduate student publications reviewed college news visited student online news review website us recommended best internet blocker market influential college publications leading us universities georgia iowa arizona confirmed software popular appeal become essential tool students study undistracted internet citing downloads 12,000 weeks stop procrastinating also recognised influential extensive independent research impact internet recent influential study undertaken thousands parents became international headline news shown parents face dilemma parents felt could n't prevent children using internet despite evidence affects concentration needed study issue concern parents educational authorities move internet based learning seen encourage greater internet use children issue covered in-depth headline news judith burns expert educational correspondent bbc one world reputable news outlets extensive research internet significantly lowers productivity employees work covered national newspaper outlets across world including uk daily telegraph spain el pais read newspaper spanish software allows users set time one minute 24 hours chose one three options block internet time period selected one option allows users block internet connection completely reconnect internet restarting computer time completed second option prevents users getting back online time even restart software offers third option called blacklist users list websites wish block thus still access internet connection except websites listed set group freelance writers programmers claim needed develop tool help cut online distraction application described helping students writers self-employed workers businesses office workers teenagers want block internet order complete homework parental control stop procrastinating originally called webtrate changed name stop procrastinating november 2014 software designed used windows apple mac computers | [
4759
] | Test |
997 | 2 | Migration_Assistant_(Apple):migration assistant apple migration assistant utility apple inc. transfers data user accounts computer settings apps one macintosh computer another computer full drive backup os x lion later also migrate contacts calendars email accounts files microsoft windows migration assistant used initial setup new computer run manually system already set may used multiple times copy applications user account settings primary purpose duplicate contents configuration existing computer user account new one migration assistant transfer operating system old computer new one similarly applications utilities bundled apple operating system e.g safari transferred based assumption newer machine newer version already installed however settings applications e.g bookmarks transferred | [
3940,
713,
4690,
734,
405,
6832,
3989,
2597,
3322,
1502,
5786,
4740,
1897,
6505,
2627,
7609,
4759,
1171,
5109,
2284,
1178,
6188,
1187,
1562,
6909,
6548,
502,
6557,
2679,
6565,
2329,
3050,
163,
6582,
5535,
5191,
8051,
7335,
3445,
569,
55... | Validation |
998 | 4 | Equation_Group:equation group equation group classified advanced persistent threat highly sophisticated threat actor suspected tied tailored access operations tao unit united states national security agency nsa kaspersky labs describes one sophisticated cyber attack groups world advanced ... seen operating alongside always position superiority creators stuxnet flame targets iran russia pakistan afghanistan india syria mali name equation group chosen group predilection sophisticated encryption methods operations 2015 kaspersky documented 500 malware infections group least 42 countries acknowledging actual number could tens thousands due self-terminating protocol 2017 wikileaks published discussion held within cia possible identify group one commenter wrote equation group labeled report relate specific group rather collection tools used hacking kaspersky security analysts summit held mexico february 16 2015 kaspersky lab announced discovery equation group according kaspersky lab report group active since least 2001 60 actors malware used operations dubbed equationdrug grayfish found capable reprogramming hard disk drive firmware advanced techniques involved high degree covertness group suspected ties nsa kaspersky lab identified actors behind group 2015 kaspersky research findings equation group noted loader grayfish similarities previously discovered loader gauss another attack series separately noted equation group used two zero-day attacks later used stuxnet researchers concluded similar type usage exploits together different computer worms around time indicates equation group stuxnet developers either working closely together also identified platform times spread interdiction interception legitimate cds sent scientific conference organizer mail platform unprecedented ability infect transmitted hard drive firmware several major hard drive manufacturers create use hidden disk areas virtual disk systems purposes feat would require access manufacturer source code achieve tool designed surgical precision going far exclude specific countries ip allow targeting specific usernames discussion forums nsa codewords straitacid straitshooter found inside malware addition timestamps malware seem indicate programmers worked overwhelmingly monday–friday would correspond 08:00–17:00 workday eastern united states timezone.the kaspersky report discounted possibility timestamps intentionally manipulated since years listed various executable files appeared match availability computer platforms files ran kaspersky global research analysis team otherwise known great claimed found piece malware contained stuxnet privlib 2008 specifically contained lnk exploit found stuxnet 2010 fanny classified worm affects certain windows operating systems attempts spread laterally via network connection usb storage kaspersky stated suspect recorded compile time fanny equation group around longer stuxnet f-secure claims equation group malicious hard drive firmware tao program iratemonk one items nsa ant catalog exposed 2013 der spiegel article iratemonk provides attacker ability software application persistently installed desktop laptop computers despite disk formatted data erased operating system re-installed infects hard drive firmware turn adds instructions disk master boot record causes software install time computer booted capable infecting certain hard drives seagate maxtor western digital samsung ibm micron technology toshiba august 2016 hacking group calling shadow brokers announced stolen malware code equation group kaspersky lab noticed similarities stolen code earlier known code equation group malware samples possession including quirks unique equation group way implementing rc6 encryption algorithm therefore concluded announcement legitimate recent dates stolen files june 2013 thus prompting edward snowden speculate likely lockdown resulting leak nsa global domestic surveillance efforts stopped shadow brokers breach equation group exploits cisco adaptive security appliances fortinet firewalls featured malware samples released shadow brokers extrabacon simple network management protocol exploit cisco asa software zero-day exploit time announcement juniper also confirmed netscreen firewalls affected eternalblue exploit used conduct damaging worldwide wannacry ransomware attack | [
704,
3932,
2912,
376,
3277,
2923,
2219,
2587,
3323,
429,
5779,
7600,
5452,
4025,
1528,
4759,
2991,
1173,
2644,
6526,
6904,
6541,
6194,
2678,
3038,
5509,
3047,
6569,
2693,
2337,
862,
7307,
6589,
5187,
1992,
1996,
2717,
7328,
208,
2021,
5... | Validation |
999 | 3 | Hi_no_Tori_Hououhen_(MSX):hi tori hououhen msx essence knightmare-like vertical scrolling shooter player viewing character back enemies obstacles entering top screen addition game six stages laid labyrinthine way adding puzzle elements mix order find reach defeat game final boss player would travel back forth various stages obtain large assortment keys keys allow access parts stages even earlier ones traveling stages highly unusual shoot 'em | [] | Test |
1,000 | 3 | Armbian:armbian armbian debian ubuntu based computer operating system arm development boards | [
6984,
3559,
4846,
3751,
5232
] | Test |
1,001 | 2 | KGraft:kgraft kgraft feature linux kernel implements live patching running kernel allows kernel patches applied kernel still running avoiding need rebooting system new kernel contains desired patches kgraft aims maximize system uptime availability time kgraft allows kernel-related security updates applied without deferring scheduled downtimes internally kgraft allows entire functions running kernel replaced patched versions safely selectively using original versions functions ensure per-process consistency live patching performed kgraft developed suse source code licensed terms versions two three gnu general public license gpl april 2014 kgraft submitted inclusion linux kernel mainline minimalistic foundations live patching merged linux kernel mainline kernel version 4.0 released april 12 2015 internally kgraft consists two parts core kernel module executes live patching mechanism altering kernel inner workings userspace utilities prepare individual hot patch kernel modules source diffs live kernel patching performed function level meaning kgraft replace entire functions running kernel patched versions relying mechanisms infrastructure established ftrace route around old versions functions changes kernel internal data structures possible however security patches one natural candidates used kgraft rarely contain changes kernel data structures applying hot patches kgraft require running kernel stopped patched versions functions introduced instead replacing functions atomically kgraft provides consistent world views universes userspace processes kernel threads interrupt handlers monitored execution original versions patched kernel functions continue used accomplish kgraft maintains original versions patched functions read-copy-update rcu fashion dynamically selects original patched versions depending process kernel thread interrupt handler executes specifically original versions functions continue usedat time hot patch appliedfor processes currently executing within kernel space kernel threads reach completion points currently executing interrupt handlers due design kgraft introduce additional latency applying hot patches downside original versions patched kernel functions may required maintained extended periods time case processes remain long within kernel space example process may wait i/o network socket also original patched versions functions allowed executed parallel troubles may arise use kernel internal data structures different ways suse announced kgraft january 2014 released publicly march 2014 terms gnu general public license version 2 gplv2 kernel part terms version 3 gplv3 userspace part released shortly red hat released live kernel patching implementation called kpatch kgraft aims become merged linux kernel mainline submitted inclusion april 2014. kgraft made available suse linux enterprise server 12 november 18 2014 additional feature called suse linux enterprise live patching minimalistic foundations live kernel patching merged linux kernel mainline kernel version 4.0 released april 12 2015 foundations based primarily kernel ftrace functionality form common core capable supporting hot patching kgraft kpatch providing application programming interface api kernel modules contain hot patches application binary interface abi userspace management utilities however common core included linux kernel 4.0 supports x86 architecture provide mechanisms ensuring function-level consistency hot patches applied since april 2015 ongoing work porting kgraft common live patching core provided linux kernel mainline however implementation required function-level consistency mechanisms delayed call stacks provided linux kernel may unreliable situations involve assembly code without proper stack frames result porting work remains progress attempt improve reliability kernel call stacks specialized sanity-check userspace utility also developed | [
3256,
2182,
3613,
7528,
7532,
5744,
6443,
2942,
6117,
4341,
5762,
412,
415,
3666,
2970,
7956,
5453,
4387,
5460,
7242,
1535,
1924,
6892,
1176,
1933,
5829,
4061,
1208,
6211,
4435,
5865,
7669,
3404,
1227,
1596,
165,
6586,
7312,
3751,
1607,
... | Test |
1,002 | 1 | Nested_SQL:nested sql relational databases nested table table embedded within another table individual elements inserted updated deleted nested table since individual elements modified nested table flexible array elements array modified whole individually nested table n't maximum size arbitrary number elements stored | [] | Test |
1,003 | 1 | PointBase:pointbase pointbase relational database management system rdbms written java programming language 1998 bruce scott co-founder oracle corporation larry ellison bob miner ed oates started pointbase inc. jeff richey architect sybase daren race written pure java supported dcom corba object-relational database designed integrate internet databases pointbase inc. established san mateo california moved mountain view california like java pointbase aimed portable devices early 2000s database shipped free java platform 2003 database acquired datamirror markham ontario september 2007 ibm acquired datamirror today 2012 pointbase sql engine part oracle weblogic platform shipped oracle weblogic server java ee server pointbase supported design development verification applications supported enterprise-quality deployment evaluation license pointbase database size limit 30 mb | [
1449,
7248,
5209,
1730,
3951,
3776,
3011,
4950,
6989,
5571,
6543,
2124,
6462,
2054,
7205,
684,
7303,
2519,
3915,
1891,
4274,
4457,
1792,
784
] | Validation |
1,004 | 7 | Storage_Resource_Broker:storage resource broker storage resource broker srb data grid management computer software used computational science research projects srb logical distributed file system based client-server architecture presents users single global logical namespace file hierarchy srb provides uniform interface heterogeneous computer data storage resources network part implements logical namespace distinct physical file names maintains metadata data-objects files users groups resources collections items srb metadata catalog mcat stored relational database management system system user-defined metadata queried locate files based attributes well name srb runs various versions unix linux microsoft windows srb system middleware sense built top major software packages various storage systems real-time data sources relational database management system etc callable library functions utilized higher level software however complete many middleware software systems implements comprehensive distributed data management environment including various end-user client applications features support management collaborative controlled sharing publication replication transfer preservation distributed data collections srb sometimes used conjunction computational grid computing systems globus alliance utilize globus alliance grid security infrastructure gsi authentication system srb store retrieve data archival storage systems high performance storage system sam-fs disk file systems unix linux windows binary large objects tabular data relational database management systems tape libraries srb used since 1997 2008 srb estimated managing two petabytes data licensed srb source distributions freely available academic non-profit organizations nirvana srb commercial version srb featured capabilities specifically adapted government commercial use srb development began 1995 cooperative efforts general atomics data intensive cyber environments group dice san diego supercomputer center sdsc university california san diego ucsd support national science foundation nsf srb builds work reagan moore moore doctorate plasma physics ucsd former computational plasma physicist general atomics joined san diego supercomputer center inception project distributed object computation testbed funded darpa us patent trademark office 1998 1999 2003 general atomics granted exclusive license ucsd develop srb commercial applications new versions announced 2008 2012 integrated rule-oriented data management system irods follow-on project sdsc srb team became data intensive cyber environments group largely replaced use srb irods based srb concepts completely re-written includes highly-configurable rule engine core fully open source conferences 2011 included demonstrations irods | [
4159,
1293,
72,
1254,
4759,
4739,
465,
578,
3794,
5666
] | Test |
1,005 | 8 | Yahoo!_Search_BOSS:yahoo search boss yahoo search boss build search service yahoo developer network initiative provide open search web services platform yahoo discontinued boss json search api boss placefinder api boss placespotter api well boss hosted search march 31 2016 yahoo boss succeeded yahoo partner ads ypa yahoo launched boss july 2008 2012 yahoo expanded yahoo search boss platform provide additional services boss hosted search enable website owner embed yahoo web search experience free site main goal idea boss give users case developers access yahoo search index small fee results could supplied developer website program could manipulate resources according product requirements boss allowed results returned xml json html text allowed use comprehensive search features available yahoo like pulling results page searching inside pdfs etc ranking websites search term yahoo search ranking since pulling index ranking one boss key differentiators free use boss white label ads required service using yahoo search engine millions r invested years since yahoo boomed 1990s web developers able get much higher quality results built search engine aug 17th 2010 yahoo stated boss would require sort ad fee-based model sustain boss hosted search completely self serve product enabled web site owner embed yahoo web search experience site free search experience hosted yahoo provided iframe could embedded web site search experience similar search.yahoo.com product provided free web site owners got percentage ad revenue share user clicked search ad within frame web site owners could also customize iframe adding partner logo next search box removing left rail removing yahoo search box altogether using implementing boss hosted search iframe web site owners needed simply sign yahoo search boss portal copy/paste javascript code snippet site yahoo also launched reporting module provide web site owners insights many searches conducted boss hosted search revenue generated according yahoo press meeting 2009 30 million queries day run boss powered web search pages | [
6015,
6092
] | Test |
1,006 | 6 | Parallel_Virtual_File_System:parallel virtual file system parallel virtual file system pvfs open-source parallel file system parallel file system type distributed file system distributes file data across multiple servers provides concurrent access multiple tasks parallel application pvfs designed use large scale cluster computing pvfs focuses high performance access large data sets consists server process client library written entirely user-level code linux kernel module pvfs-client process allow file system mounted used standard utilities client library provides high performance access via message passing interface mpi pvfs jointly developed parallel architecture research laboratory clemson university mathematics computer science division argonne national laboratory ohio supercomputer center pvfs development funded nasa goddard space flight center doe office science advanced scientific computing research program nsf paci hecura programs government private agencies pvfs known orangefs newest development branch pvfs first developed 1993 walt ligon eric blumer parallel file system parallel virtual machine pvm part nasa grant study i/o patterns parallel programs pvfs version 0 based vesta parallel file system developed ibm t. j. watson research center starting 1994 rob ross re-wrote pvfs use tcp/ip departed many original vesta design points pvfs version 1 targeted cluster dec alpha workstations networked using switched fddi like vesta pvfs striped data across multiple servers allowed i/o requests based file view described strided access pattern unlike vesta striping view dependent common record size ross research focused scheduling disk i/o multiple clients accessing file previous results shown scheduling according best possible disk access pattern preferable ross showed depended number factors including relative speed network details file view cases scheduling based network traffic preferable thus dynamically adaptable schedule provided best overall performance late 1994 ligon met thomas sterling john dorband goddard space flight center gsfc discussed plans build first beowulf computer agreed pvfs would ported linux featured new machine next several years ligon ross worked gsfc group including donald becker dan ridge eric hendricks 1997 cluster meeting pasadena ca sterling asked pvfs released open source package 1999 ligon proposed development new version pvfs initially dubbed pvfs2000 later pvfs2 design initially developed ligon ross phil carns ross completed phd 2000 moved argonne national laboratory design implementation carried ligon carns dale witchurch harish ramachandran clemson university ross neil miller rob latham argonne national laboratory pete wyckoff ohio supercomputer center new file system released 2003 new design featured object servers distributed metadata views based mpi support multiple network types software architecture easy experimentation extensibility pvfs version 1 retired 2005 pvfs version 2 still supported clemson argonne carns completed phd 2006 joined axicom inc. pvfs deployed several thousand nodes data mining 2008 carns moved argonne continues work pvfs along ross latham sam lang brad settlemyer developed mirroring subsystem clemson later detailed simulation pvfs used researching new developments settlemyer oak ridge national laboratory 2007 argonne began porting pvfs use ibm blue gene/p 2008 clemson began developing extensions supporting large directories small files security enhancements redundancy capabilities many goals conflicted development blue gene second branch cvs source tree created dubbed orange original branch dubbed blue pvfs orangefs track closely represent two different groups user requirements patches upgrades applied branches 2011 orangefs main development line cluster using pvfs nodes designated one client data server metadata server data servers hold file data metadata servers hold metadata include stat-info attributes datafile-handles well directory-entries clients run applications utilize file system sending requests servers network pvfs object based design say pvfs server requests involved objects called dataspaces dataspace used hold file data file metadata directory metadata directory entries symbolic links every dataspace file system unique handle client server look server holds dataspace based handle dataspace two components bytestream set key/value pairs bytestream ordered sequence bytes typically used hold file data key/value pairs typically used hold metadata object-based design become typical many distributed file systems including lustre panasas pnfs pvfs designed client access server metadata access data servers without interaction metadata servers removes critical bottleneck system allows much greater performance client program requests data pvfs supply description data based mpi_datatypes facility allows mpi file views directly implemented file system mpi_datatypes describe complex non-contiguous patterns data pvfs server data codes implement data flows efficiently transfer data multiple servers clients pvfs uses networking layer named bmi provides non-blocking message interface designed specifically file systems bmi multiple implementation modules number different networks used high performance computing including tcp/ip myrinet infiniband portals pvfs servers designed share state clients server crashes another easily restarted place updates performed without using locks pvfs clients servers run user level kernel modifications needed optional kernel module allows pvfs file system mounted like file system programs link directly user interface mpi-io posix-like interface features makes pvfs easy install less prone causing system crashes pvfs interface designed integrate system level similarities linux vfs making easy implement mountable file system equally adaptable user level interfaces mpi-io posix-like interfaces exposes many features underlying file system interfaces take advantage desired pvfs consists 4 main components number utility programs components pvfs2-server pvfslib pvfs-client-core pvfs kernel module utilities include karma management tool utilities pvfs-ping pvfs-ls pvfs-cp etc operate directly file system without using kernel module primarily maintenance testing another key design point pvfs protocol describes messages passed client server though strictly component pvfs server runs process node designated i/o node i/o nodes often dedicated nodes regular nodes run application tasks well pvfs server usually runs root run user preferred server manage multiple distinct file systems designated run metadata server data server configuration controlled configuration file specified command line servers managing given file system use configuration file server receives requests network carries request may involve disk i/o responds back original requester requests normally come client nodes running application tasks come servers server composed request processor job layer trove bmi flow layers request processor consists server process main loop number state machines state machines based simple language developed pvfs manage concurrency within server client state machine consists number states either runs c state action function calls nested subroutine state machine either case return codes select state go next state action functions typically submit job via job layer performs kind i/o via trove bmi jobs non-blocking job issued state machine execution deferred another state machine run servicing another request jobs completed main loop restarts associated state machine request processor state machines various request types defined pvfs request protocol plus number nested state machines used internally state machine architecture makes relatively easy add new requests server order add features optimize specific situations job layer provides common interface submitting trove bmi flow jobs reporting completion also implements request scheduler non-blocking job records kind requests progress objects prevents consistency errors due simultaneously operating file data trove manages i/o objects stored local server trove operates collections data spaces collection independent handle space used implement distinct pvfs file systems data space pvfs object unique within collection handle stored one server handles mapped servers table configuration file data space consists two parts bytestream set key/value pairs bytestream sequence bytes indeterminate length used store file data typically file local file system key/value pairs used store metadata attributes directory entries trove well defined interface implemented various ways date implementation trove-dbfs implementation stores bytestreams files key/value pairs berkeley db database trove operations non-blocking api provides post functions read write various components functions check wait completion | [
3599,
2547,
7161,
4672,
6431,
3626,
5049,
1105,
6454,
6117,
759,
6854,
5437,
4375,
6500,
6505,
5457,
460,
1534,
7976,
4406,
821,
7258,
5130,
1561,
836,
5843,
2313,
6558,
2683,
5859,
5865,
4444,
5518,
6231,
869,
2704,
1605,
174,
2710,
16... | Test |
1,007 | 2 | Turkix:turkix turkix live linux distribution capable self-installing hard disk using graphical wizard main goal turkix provide user-friendly linux environment turkix based mandriva distribution visual style turkix similar windows xp first two releases turkix 1.0 1.9 turkish azerbaijani later releases language support especially english latest stable release turkix 3.0 last unstable release 10.0 alpha point project aborted | [
1621,
5200,
1629,
3444,
4675,
7251,
6984,
474,
7075,
1941,
578,
314,
5232,
2758,
1663,
2864,
3559,
6209,
7108,
6761,
2063,
343,
4824,
5523,
5259,
1893,
5530,
5704,
5965,
3751,
6317,
7587,
7954,
6244
] | Validation |
1,008 | 3 | Cryptoloop:cryptoloop cryptoloop linux kernel disk encryption module relies crypto api cryptography framework introduced version 2.5.45 linux kernel mainline cryptoloop first introduced 2.5.x kernel series functionality later incorporated device mapper generic framework used map one block device onto another cryptoloop create encrypted file system within partition within regular file regular file system file encrypted moved another storage device accomplished making use loop device pseudo device enables normal file mounted physical device encrypting i/o loop device data accessed must first decrypted passing regular file system conversely data stored encrypted cryptoloop vulnerable watermarking attacks making possible determine presence watermarked data encrypted filesystem attack exploits weakness iv computation knowledge file systems place files disk attack works file systems soft block size 1024 greater least ext2 ext3 reiserfs minix property attack makes possible detect presence specially crafted watermarked files watermarked files contain special bit patterns detected without decryption newer versions cryptoloop successor dm-crypt less vulnerable type attack used correctly | [
2182,
3613,
7528,
7532,
2559,
5744,
6443,
6458,
7555,
4341,
5762,
5773,
3666,
5440,
4014,
5453,
5803,
3350,
5808,
7242,
1535,
1924,
6892,
1176,
1933,
1208,
6211,
5865,
7669,
1227,
1596,
165,
7312,
1607,
5884,
1991,
5540,
1260,
6984,
8092,... | Test |
1,009 | 5 | Two-way_alternating:two-way alternating two-way alternating communications term sometimes used disambiguate term duplex telecommunications two-way alternating communications channel endpoint either send receive given time send receive time two-way simultaneous communications lets endpoints talk listen simultaneously two-way alternating communications sometimes called half-duplex may fine distinction two-way alternating communications property communication protocol used endpoints underlying communications medium may support either two-way alternating two-way simultaneous communications medium shared transmitting receiving support two-way alternating protocols medium may called physically half-duplex | [] | Validation |
1,010 | 4 | Labeled_Security_Protection_Profile:labeled security protection profile labeled security protection profile lspp protection profile within common criteria information technology security evaluation set security functional assurance requirements products lspp requirements derived b1 class us department defense security standard called trusted computer system evaluation criteria tcsec originally published 1985 example z/os v1.7 certified eal4+ lspp 2006 | [
2879,
3678
] | Test |
1,011 | 9 | Call_graph:call graph call graph also known call multigraph control flow graph represents calling relationships subroutines computer program node represents procedure edge f g indicates procedure f calls procedure g thus cycle graph indicates recursive procedure calls call graphs dynamic static dynamic call graph record execution program example output profiler thus dynamic call graph exact describes one run program static call graph call graph intended represent every possible run program exact static call graph undecidable problem static call graph algorithms generally overapproximations every call relationship occurs represented graph possibly also call relationships would never occur actual runs program call graphs defined represent varying degrees precision precise call graph precisely approximates behavior real program cost taking longer compute memory store precise call graph fully context-sensitive means procedure graph contains separate node call stack procedure activated fully context-sensitive call graph called calling context tree computed dynamically easily although may take large amount memory calling context trees usually computed statically would take long large program least precise call graph context-insensitive means one node procedure languages feature dynamic dispatch java c++ computing static call graph precisely requires alias analysis results conversely computing precise aliasing requires call graph many static analysis systems solve apparent infinite regress computing simultaneously call graphs used different ways one simple application call graphs finding procedures never called call graphs act documentation humans understand programs also serve basis analyses analysis tracks flow values procedures change impact prediction call graphs also used detect anomalies program execution code injection attacks sample call graph generated gprof analyzing | [
1361,
7980,
7213,
5983,
7305,
573,
3106,
2481,
7908,
7715,
1563,
1854
] | Test |
1,012 | 3 | Address_generation_unit:address generation unit address generation unit agu sometimes also called address computation unit acu execution unit inside central processing units cpus calculates addresses used cpu access main memory address calculations handled separate circuitry operates parallel rest cpu number cpu cycles required executing various machine instructions reduced bringing performance improvements performing various operations cpus need calculate memory addresses required fetching data memory example in-memory positions array elements must calculated cpu fetch data actual memory locations address-generation calculations involve different integer arithmetic operations addition subtraction modulo operations bit shifts often calculating memory address involves one general-purpose machine instruction necessarily decode execute quickly incorporating agu cpu design together introducing specialized instructions use agu various address-generation calculations offloaded rest cpu often executed quickly single cpu cycle capabilities agu depend particular cpu architecture thus agus implement expose address-calculation operations also include advanced specialized instructions operate multiple operands time furthermore cpu architectures include multiple agus one address-calculation operation executed simultaneously bringing performance improvements capitalizing superscalar nature advanced cpu designs example intel incorporates multiple agus sandy bridge haswell microarchitectures increase bandwidth cpu memory subsystem allowing multiple memory-access instructions executed parallel | [
5012,
1447,
5371,
3948,
7527,
7529,
5737,
2567,
4694,
5042,
1481,
5055,
2226,
1867,
2248,
6148,
4372,
441,
6865,
2266,
4047,
5483,
1556,
5487,
7990,
6198,
1568,
1570,
6922,
7666,
515,
8024,
5521,
3747,
1237,
6236,
534,
7314,
1252,
1254,
... | Test |
1,013 | 2 | OpenBSM:openbsm openbsm open source implementation sun basic security module bsm audit api file format bsm system used auditing describes set system call library interfaces managing audit records well token stream file format permits extensible generalized audit trail processing openbsm includes system include files appropriate inclusion operating system implementation audit libbsm implementation bsm library interfaces generating parsing managing audit records auditreduce praudit audit reduction printing tools api documentation sample /etc configuration files works progress include extensions libbsm api support easier audit trail analysis including pattern matching library openbsm derived bsm audit implementation found apple open source darwin operating system upon request apple relicensed bsd licence allow integration freebsd systems darwin bsm implementation created mcafee research contract apple since extensively extended volunteer trustedbsd team openbsm included freebsd version 6.2 later announced mac os x snow leopard feature | [
1341,
191,
6711,
1356,
1547,
7355,
6725,
5571,
8194,
8096,
1193,
3636,
4059,
6022,
496,
8001,
5760,
5065,
594,
4441,
6477,
4534,
5250,
1315,
689,
6402,
2161,
4910,
1703,
6860,
875,
1435,
1805,
6505
] | Test |
1,014 | 5 | IBM_Sametime:ibm sametime ibm sametime formerly ibm lotus sametime client–server application middleware platform provides real-time unified communications collaboration enterprises capabilities include presence information enterprise instant messaging web conferencing community collaboration telephony capabilities integration sold lotus software division ibm ibm sametime middleware supports enterprise software business process integration communication enabled business process either ibm sametime plugin surfacing ibm sametime capabilities third-party applications ibm sametime integrates wide variety software including lotus collaboration products microsoft office productivity software portal web applications ibm sametime client–server enterprise application includes ibm sametime connect client end-users ibm sametime server control administration ibm sametime comes 4 levels functionality ibm sametime limited use old name ibm sametime entry provides basic presence instant messaging ibm sametime standard provides additional functionality ibm sametime entry including ibm sametime advanced provides additional real-time community collaboration social networking functionality ibm sametime standard including ibm sametime unified telephony provides additional telephony functionality ibm sametime standard ibm sametime advanced including ibm sametime gateway provides server-to-server interoperability disparate communities conversion services different protocols presence information awareness instant messaging ibm sametime gateway connects ibm sametime instant messaging cooperate communities external communities including external ibm sametime public instant messaging communities aol aim icq yahoo google talk xmpp ibm sametime gateway replaces sametime session initiation protocol sip gateway earlier releases ibm sametime ibm sametime gateway platform based ibm websphere application server provides failover clustering scalability ibm sametime gateway deployment product shipped following connectors virtual places sip xmpp protocol connectors may added ibm sametime middleware supports application business process integration within context real-time communications often referred communications enabled business processes sametime integrates either two ways examples integration ibm sametime applications include ibm sametime connect client component ibm sametime built eclipse platform allowing developers familiar framework easily write plug-ins ibm sametime uses proprietary protocol named virtual places also offers support standard protocols including session initiation protocol sip simple t.120 xmpp h.323 ibm sametime connect run microsoft windows linux macos also available zero-download web client microsoft internet explorer mozilla firefox apple safari mobile clients also supported apple iphone android microsoft windows mobile rim blackberry symbian ibm sametime server runs microsoft windows ibm aix ibm formerly i5/os linux solaris sametime also accessed using free software adium gaim pidgin kopete clients ibm sametime became ibm product 1998 synthesis technologies ibm acquired two companies sametime v3.1 client part standard platform loaded ibm standard software installer issi many years enabling communications corporate intranet hundreds thousands ibm employees next major release sametime v7.5 client built eclipse software platform enabling use plug-in framework 2008 gartner positioned ibm first time leader gartner unified communications magic quadrant | [
7148,
2450,
3762,
3350,
4759,
7967,
2555,
2284,
7170,
2201,
6624,
1369,
6012,
5571,
6629,
578,
5666,
4337,
4887,
1958,
1210,
2048,
3050,
5868,
2880,
4634,
6668,
3915,
7769,
5535,
2807
] | Validation |
1,015 | 3 | HP_3000:hp 3000 hp 3000 series family minicomputers released hewlett-packard 1972 designed first minicomputer delivered full featured operating system time-sharing first model 3000 withdrawn market 1973 speed improvements os stability could achieved reintroduction 1974 ultimately became known reliable powerful business system one regularly hp business companies using ibm mainframes hewlett-packard initial naming referred computer system/3000 called hp3000 hp later renamed computer hp e3000 emphasize system compatibility internet web uses early 3000 models large cabinets front panels later models made fit desks using terminal consoles diagnostics bootstrap routines rom 1984 hp introduced hp3000 series 37 first model ran offices without special cooling flooring requirements models ranged system sometimes used single user models supported 2,000 users hp 3000 one last proprietary minicomputer systems whose manufacture curtailed vendor outlasting pdp-11-descended digital equipment corporation vax acquired compaq ultimately hewlett-packard almost 30 years five-year phase-out period now-named hp e3000 series servers originally announced november 2001 hp extended phase-out period twice new e3000s sold hp although used systems continue sold upgrades third-party reseller market support hp customers hp 3000 continued dec. 31 2010 many third party firms continue support system customers throughout world customers continue use hp 3000 companies worldwide especially manufacturing e-commerce industries others migrated business server systems made hp others unable unwilling migrate homesteading strategy emerged immediately hp announcement end system sales 2012 stromasys company released product full hp3000 hardware emulation x86-64 servers running red hat linux centos product operates virtualized instance hp 3000 server hardware starting 2003 hp began plan sell license 3000 operating system let 3000 customers run software stromasys product known hpa/3000 key development led tremendous success hp 3000 bundling hp-developed network database management system dbms called image called turboimage/sql reputedly inspired total dbms developed cincom systems inc image award-winning database anointed datamation within two years database introduction first database management system included business-class minicomputer bundling image server hp created ecosystem applications development utilities could rely upon image data repository hp 3000 code reentrant data reside separate variable-length segments 32,768 halfwords 16-bit words 65,536 bytes operating system known mpe multi-programming executive loads code segments program files segmented library sl files needed 256 segments one process could much 64kb memory code segment calling routine based segment number routine number within segment program could theoretically 32,385 routines 8 bits specify segment 16 bits within segment program could effectively 24 bit address 16mb compared 16 bit computers like pdp-11 ibm system/34 64kb address space code data bigger limitation data segment stack segment also 64kb shared library routines permit cross-process global data since process data segment procedures worked around requiring caller pass array stack data segment hold state information similar modern object oriented languages methods applied objects passed allocated caller process could allocate use multiple extra data segments xds 64kb classic architecture imposed limit 65,535 extra data segments system-wide limitations would usually restrict somewhat smaller limit systems programming done spl system programming language algol-like language allowing inline assembler direct access instruction set standard terminals hp 3000 hp 2640 series supported block mode data entry forms like ibm mainframe-based cics well character mode 1980s computer gained ability use pcs macs system terminals hp 3000 family generations divided classic 16-bit xl later ix 32-bit families following introduction systems based hp pa-risc chips 3000s early 1987 newer xl systems binary compatible classics would transparently run classic code via emulator one hp integrated mpe xl operating system classic code could optionally translated native pa-risc code via octcomp object code translator/compiler ... code ran native speed still subject classic stack memory size limitations earlier classic machines based custom cisc processor 1988 onward hp 3000s using pa-risc processors began shipping volume 1995 pa-risc systems effectively displaced older family machines use technology shifts remained significant residue older machines service even today original classic 3000s work production locations hp 3000 many hp 9000 machines used hp precision bus pa-risc based hp 3000 operating system written primarily modcal hp extended version pascal large portions earlier mpe v operating system written spl still used part mpe xl mpe/ix pa-risc subsystems e.g. turboimage written pspl portable spl small portion mpe xl mpe/ix written pa-risc assembly language 3000 series operating system originally styled multi-programming executive mpe later called mpe xl posix compliance added versions 5.0-5.5 mpe/ix earliest versions system used hp proprietary spl systems programming language basic system 3000s used command-line interpreter three-level hierarchical file system utilities compilers would resemble run fortran.pub.sys rather allowing programs run keyword commands later systems gained wide range languages including cobol fortran pascal c even version rpg assist winning business away ibm people used hp 3000 noticed 1970s onward machines reliable compared mainframe minicomputers time ability recover power failures notable feature sold many systems versus ibm computers times hp 3000 suffered peripheral support delays gaps caused hp decision delay supporting support peripherals hp 3000 platform—some supported identical hp 9000 hardware current computer instruction sets based general purpose register model processor memory architecture classic hp 3000 based stack machine model like hp well-known line rpn calculators said inspired famous stack-based burroughs large systems rather small number registers example ax bx register case hp 1000 operands would pushed stack used store local variables return addresses rather would 16-bit microcoded machines series ii iii 30 33 39 40 42 44 48 52 58 64 68 70 37 ... implement 16-bit word addressed byte-addressable segmented harvard stack instruction set architecture isa ~214 instructions 16 bits wide stack operations pack 2 per 16-bit word remaining 32 bits wide cisc implementations later 32-bit models used hp pa-risc general register-based risc architecture pa-risc implementations enterprise computing market shifted toward commodity unix systems wide range vendors—systems hp also promoting—in november 2001 hewlett-packard announced period called end-of-life hp 3000 would wrap end 2006 new systems would sold hp 2003 early 2006 hewlett-packard announced limited vendor support hp 3000 would extended two years certain clients geographic regions september 2007 hp extended support systems offering mature product support without sustaining engineering ending creation software patches patches built tested inside hp lacked customer base testing end 2008 hp made patches available end 2010 excel list beta patches 2011 hp extended special provision 3000 customers granted free access patches unlike rest hp enterprise line forced 2010 adopt pay patching support program instead free patches group independent vendors assumed systems software support existing customers left ranks hp 3000 support business several pledged continue support software customers stop using server others offering comprehensive support citing 2016 later end support dates consultants directory maintained robelle software independent consultants available listing openmpe website open source software resources including commodity tools 3000 mpe/ix operating system maintained website applied technologies hp 3000 enjoyed one longest lifetimes business computer system enterprise-grade computers outlasted highly regarded pdp-11 vax series although openvms operating system still offered alpha- ia-64-based systems hewlett packard products january 2012 stromasys announced development charon/hpa-3000 enables secure transfer hp3000 systems state-of-the-art environment stromasys solution virtualizes hardware existing hp3000 system enables mpe/ix operating system third party applications user-developed software run without modification whatsoever industry-standard intel servers offering includes two-user evaluation copy delivered vmware package | [
5012,
3509,
3764,
5285,
1180,
35,
1112,
2226,
5948,
8111,
1867,
6299,
8117,
4985,
3579,
6236,
1989,
2803,
1435,
879,
6687
] | Test |
1,016 | 9 | JSFuck:jsfuck jsfuck esoteric subset javascript code written using six characters codice_1 codice_2 codice_3 codice_4 codice_5 codice_6 name derived brainfuck esoteric programming language also uses minimalistic alphabet punctuation unlike brainfuck requires compiler interpreter jsfuck valid javascript code meaning jsfuck programs run web browser engine interprets javascript jsfuck able recreate javascript functionality using limited set characters javascript weakly typed programming language allows evaluation expression type july 2009 yosuke hasegawa created web application called jjencode could encode arbitrary javascript obfuscated form utilizing 18 symbols codice_7 january 2010 informal competition held obfuscation forum sla.ckers.org web application security site come way get minimum number characters required less eight codice_8 contributors thread managed eliminate need codice_9 codice_10 characters march 2010 online encoder called js-noalnum available utilized final set six characters end 2010 hasegawa made new encoder available named jsf*ck also used minimum six characters 2012 martin kleppe created jsfuck project github jsfuck.com website web app using implementation encoder jsfuck used bypass detection malicious code submitted websites e.g cross-site scripting xss attacks another potential use jsfuck lies code obfuscation optimized version jsfuck used encode jquery most-used javascript library fully functional version written six characters jsfuck code extremely verbose javascript code codice_11 causes pop-up window open 21 characters long jsfuck code length 22948 characters certain single characters require far 1000 characters expanded jsfuck section offers overview expansion works number 0 created codice_12 codice_13 empty array codice_6 unary plus used convert right side numeric value zero number 1 formed codice_15 codice_16 boolean value codice_17 expressed codice_18 codice_19 jsfuck converted numeric value 1 prepended plus sign digits 2 9 formed summing codice_17 appropriate number times e.g javascript codice_21 2 codice_17 codice_18 codice_19 hence 2 written codice_25 codice_26 digits follow similar pattern integers consisting two digits written string concatenating 1-digit arrays plus operator example string codice_27 expressed javascript codice_28 replacing digits respective jsfuck expansions yields codice_29 get numeric value instead string one would enclose previous expression parentheses square brackets prepend plus yielding codice_30 codice_31 letters obtained jsfuck accessing single characters string representations simple boolean numeric values like codice_32 codice_33 codice_34 codice_35 indexer number square brackets tricks needed produce letters – example casting string codice_36 number gives codice_37 turn makes letter codice_38 accessible following list primitive values used building blocks produce simple letters proof javascript codice_52 codice_53 codice_54 constructor used trigger execution javascript code contained string native javascript example statement codice_55 equivalent codice_56 codice_54 constructor retrieved jsfuck accessing constructor property well known function codice_58 codice_59 codice_55 becomes codice_61 characters shortest jsfuck expansions listed characters expressed well generate considerably longer code lacking distinct features usual javascript obfuscation techniques like jsfuck assist malicious javascript code bypassing intrusion prevention systems content filters instance lack alphanumeric characters jsfuck one hand flawed content filter hand allowed sellers embed arbitrary jsfuck scripts ebay auction pages | [
5629,
2451,
4755,
4296,
5998,
1361,
4315,
831,
313,
3719,
3559,
237,
7848,
5510,
2870,
6660,
6221,
5171,
6400,
3584,
7687,
6778,
7505
] | Validation |
1,017 | 2 | SmartQ_5:smartq 5 smartq 5 budget mobile internet device manufactured chinese company smart devices officially announced 11 february 2009 smartq 5 comes custom version ubuntu linux installed adapted use touchscreen uses lxde desktop environment ubuntu main pre-installed applications possible install another linux besides default os several linux distributions like mer ported android support smartq 5 smart devices obtained windows ce 6.0 royalty os made available official site although license microsoft needs purchased activate windows ce | [
499,
6378,
5571,
2498,
463,
1267
] | Validation |
1,018 | 4 | Mail_Abuse_Prevention_System:mail abuse prevention system mail abuse prevention system maps organization provides anti-spam support maintaining dnsbl provide five black lists categorising address ip block listed acronym maps spam spelled backwards maps founded 1996 non-profit organization pioneer innovative anti-spam techniques e-mail early history maps history dnsbls dave rand paul vixie well known internet software engineers started keeping list ip addresses sent spam engaged behavior found objectionable list became known real-time blackhole list rbl many network managers wanted use rbl block unwanted e-mail thus rand vixie created dns-based distribution scheme quickly became popular certain absolute right publish anti-spam blacklist maps published sue us page inviting spammers sue help create case law 2000 maps named defendant fewer three lawsuits sued yesmail media3 survey giant harris interactive first lawsuits came maps brought anne p. mitchell director legal public affairs 2001 company started require subscription accessing lists non-subscribed users received dummy unlisted response maps explained expectation get enough funds free support failed forced make decision however spirit company remained one non-profit organization subscription page quite hidden .org web site fax-based subscription mechanism rather awkward 2004 maps became division kelkea inc moved redwood city san jose .org .com dave rand founder ceo kelkea time june 2005 trend micro inc. acquired kelkea brought substantial improvement subscription mechanism including fully automated method getting temporary subscriptions addition subscribers provided personalised web pages view reports also set whitelisting blacklisting options whitelisting particularly convenient allows whitelist thousands ip addresses clicks proposing many lists confuse maps subscriber postmasters may hurriedly subscribe lists difference open proxy relays spam 'somehow open spam relay clear postmasters may conclude lists use spam block however one maps lists dul significantly different others dul supposed list addresses dynamically assigned end-users practice also includes statically-allocated ones directly related spam evidence maps archives address used relay spam dul purpose educate users relay mail acknowledged isp rather running mail servers would bring various advantages disadvantages acknowledged isps general afford monitor systems thoroughly order avoid viruses hijackers similar threats furthermore paves way effectively exploiting policies like spf rely upon end-user smtp authentication order block email address abuse also prevents users domain publish proper spf policy addition isp email relays incompatible fine-grained ip address blocking relay spam get blocked affects users maps fails disambiguate concepts acknowledged isp versus end-users ip addresses formal definition may relatively straightforward recognize isps network providers mailbox providers easily confused end-users different kinds coupled ability easily whitelist ips local internet registry/region correct obvious shortcomings using dul block mail may result obscure policy jeopardizes global reliability email delivery generates amount false positives much higher maps claims aware blocking many legitimate websites end users yet catching estimated 2 spam | [
5733,
3980,
4734,
5836,
6908,
88
] | Test |
1,019 | 4 | Buffer_overflow:buffer overflow information security programming buffer overflow buffer overrun anomaly program writing data buffer overruns buffer boundary overwrites adjacent memory locations buffers areas memory set aside hold data often moving one section program another programs buffer overflows often triggered malformed inputs one assumes inputs smaller certain size buffer created size anomalous transaction produces data could cause write past end buffer overwrites adjacent data executable code may result erratic program behavior including memory access errors incorrect results crashes exploiting behavior buffer overflow well-known security exploit many systems memory layout program system whole well defined sending data designed cause buffer overflow possible write areas known hold executable code replace malicious code selectively overwrite data pertaining program state therefore causing behavior intended original programmer buffers widespread operating system os code possible make attacks perform privilege escalation gain unlimited access computer resources famed morris worm 1988 used one attack techniques programming languages commonly associated buffer overflows include c c++ provide built-in protection accessing overwriting data part memory automatically check data written array built-in buffer type within boundaries array bounds checking prevent buffer overflows requires additional code processing time modern operating systems use variety techniques combat malicious buffer overflows notably randomizing layout memory deliberately leaving space buffers looking actions write areas canaries buffer overflow occurs data written buffer also corrupts data values memory addresses adjacent destination buffer due insufficient bounds checking occur copying data one buffer another without first checking data fits within destination buffer following example expressed c program two variables adjacent memory 8-byte-long string buffer two-byte big-endian integer b initially contains nothing zero bytes b contains number 1979 program attempts store null-terminated string ascii encoding buffer b value inadvertently replaced number formed part character string example e followed zero byte would become 25856 writing data past end allocated memory sometimes detected operating system generate segmentation fault error terminates process prevent buffer overflow happening example call strcpy could replaced strlcpy takes maximum capacity including null-termination character additional parameter ensures amount data written available strlcpy library function preferred strncpy null-terminate destination buffer source string length greater equal size buffer third argument passed function therefore may null-terminated treated valid c-style string techniques exploit buffer overflow vulnerability vary architecture operating system memory region example exploitation heap used dynamically allocated memory differs markedly exploitation call stack technically inclined user may exploit stack-based buffer overflows manipulate program advantage one several ways address user-supplied data used affect stack buffer overflow unpredictable exploiting stack buffer overflow cause remote code execution becomes much difficult one technique used exploit buffer overflow called trampolining technique attacker find pointer vulnerable stack buffer compute location shellcode relative pointer use overwrite jump instruction already memory make second jump time relative pointer second jump branch execution shellcode suitable instructions often present large code metasploit project example maintains database suitable opcodes though lists found windows operating system buffer overflow occurring heap data area referred heap overflow exploitable manner different stack-based overflows memory heap dynamically allocated application run-time typically contains program data exploitation performed corrupting data specific ways cause application overwrite internal structures linked list pointers canonical heap overflow technique overwrites dynamic memory allocation linkage malloc meta data uses resulting pointer exchange overwrite program function pointer microsoft gdi+ vulnerability handling jpegs example danger heap overflow present manipulation buffer occurs read executed may lead failure exploitation attempt manipulations mitigate threat exploitation may make impossible manipulations could include conversion upper lower case removal metacharacters filtering non-alphanumeric strings however techniques exist bypass filters manipulations alphanumeric code polymorphic code self-modifying code return-to-libc attacks methods used avoid detection intrusion detection systems cases including code converted unicode threat vulnerability misrepresented disclosers denial service fact remote execution arbitrary code possible real-world exploits variety challenges need overcome exploits operate reliably factors include null bytes addresses variability location shellcode differences environments various counter-measures operation nop-sled oldest widely known technique successfully exploiting stack buffer overflow solves problem finding exact address buffer effectively increasing size target area much larger sections stack corrupted no-op machine instruction end attacker-supplied data no-op instructions attacker places instruction perform relative jump top buffer shellcode located collection no-ops referred nop-sled return address overwritten address within no-op region buffer execution slide no-ops redirected actual malicious code jump end technique requires attacker guess stack nop-sled instead comparatively small shellcode popularity technique many vendors intrusion prevention systems search pattern no-op machine instructions attempt detect shellcode use important note nop-sled necessarily contain traditional no-op machine instructions instruction corrupt machine state point shellcode run used place hardware assisted no-op result become common practice exploit writers compose no-op sled randomly chosen instructions real effect shellcode execution method greatly improves chances attack successful without problems exploits using technique still must rely amount luck guess offsets stack within nop-sled region incorrect guess usually result target program crashing could alert system administrator attacker activities another problem nop-sled requires much larger amount memory hold nop-sled large enough use problem allocated size affected buffer small current depth stack shallow i.e much space end current stack frame start stack despite problems nop-sled often method work given platform environment situation still important technique jump register technique allows reliable exploitation stack buffer overflows without need extra room nop-sled without guess stack offsets strategy overwrite return pointer something cause program jump known pointer stored within register points controlled buffer thus shellcode example register contains pointer start buffer jump call taking register operand used gain control flow execution practice program may intentionally contain instructions jump particular register traditional solution find unintentional instance suitable opcode fixed location somewhere within program memory figure left see example unintentional instance i386 codice_1 instruction opcode instruction codice_2 two-byte sequence found one-byte offset start instruction codice_3 address codice_4 attacker overwrites program return address address program first jump codice_4 interpret opcode codice_2 codice_1 instruction jump top stack execute attacker code technique possible severity vulnerability increases considerably exploitation work reliably enough automate attack virtual guarantee success run reason technique commonly used internet worms exploit stack buffer overflow vulnerabilities method also allows shellcode placed overwritten return address windows platform since executables mostly based address codice_8 x86 little endian architecture last byte return address must null terminates buffer copy nothing written beyond limits size shellcode size buffer may overly restrictive dlls located high memory codice_9 addresses containing null bytes method remove null bytes disallowed characters overwritten return address used way method often referred dll trampolining various techniques used detect prevent buffer overflows various tradeoffs reliable way avoid prevent buffer overflows use automatic protection language level sort protection however applied legacy code often technical business cultural constraints call vulnerable language following sections describe choices implementations available assembly c/c++ popular programming languages vulnerable buffer overflow part allow direct access memory strongly typed c provides built-in protection accessing overwriting data part memory specifically check data written buffer within boundaries buffer standard c++ libraries provide many ways safely buffering data c++ standard template library stl provides containers optionally perform bounds checking programmer explicitly calls checks accessing data example codice_10 member function codice_11 performs bounds check throws codice_12 exception bounds check fails however c++ behaves like c bounds check explicitly called techniques avoid buffer overflows also exist c. languages strongly typed n't allow direct memory access cobol java python others prevent buffer overflow occurring cases many programming languages c/c++ provide runtime checking cases even compile-time checking might send warning raise exception c c++ would overwrite data continue execute instructions erroneous results obtained might might cause program crash examples languages include ada eiffel lisp modula-2 smalltalk ocaml c-derivatives cyclone rust d. java .net framework bytecode environments also require bounds checking arrays nearly every interpreted language protect buffer overflows signaling well-defined error condition often language provides enough type information bounds checking option provided enable disable static code analysis remove many dynamic bound type checks poor implementations awkward cases significantly decrease performance software engineers must carefully consider tradeoffs safety versus performance costs deciding language compiler setting use problem buffer overflows common c c++ languages expose low level representational details buffers containers data types buffer overflows must thus avoided maintaining high degree correctness code performs buffer management also long recommended avoid standard library functions bounds checked codice_13 codice_14 codice_15 morris worm exploited codice_13 call fingerd well-written tested abstract data type libraries centralize automatically perform buffer management including bounds checking reduce occurrence impact buffer overflows two main building-block data types languages buffer overflows commonly occur strings arrays thus libraries preventing buffer overflows data types provide vast majority necessary coverage still failure use safe libraries correctly result buffer overflows vulnerabilities naturally bug library potential vulnerability safe library implementations include better string library vstr erwin openbsd operating system c library provides strlcpy strlcat functions limited full safe library implementations september 2007 technical report 24731 prepared c standards committee published specifies set functions based standard c library string i/o functions additional buffer-size parameters however efficacy functions purpose reducing buffer overflows disputable requires programmer intervention per function call basis equivalent intervention could make analogous older standard library functions buffer overflow safe buffer overflow protection used detect common buffer overflows checking stack altered function returns altered program exits segmentation fault three systems libsafe stackguard propolice gcc patches microsoft implementation data execution prevention dep mode explicitly protects pointer structured exception handler seh overwritten stronger stack protection possible splitting stack two one data one function returns split present forth language though security-based design decision regardless complete solution buffer overflows sensitive data return address may still overwritten buffer overflows work manipulating pointers including stored addresses pointguard proposed compiler-extension prevent attackers able reliably manipulate pointers addresses approach works compiler add code automatically xor-encode pointers used attacker theoretically know value used encode/decode pointer predict point overwrites new value pointguard never released microsoft implemented similar approach beginning windows xp sp2 windows server 2003 sp1 rather implement pointer protection automatic feature microsoft added api routine called discretion programmer allows better performance used time places burden programmer know necessary xor linear attacker may able manipulate encoded pointer overwriting lower bytes address allow attack succeed attacker able attempt exploit multiple times able complete attack causing pointer point one several locations location within nop sled microsoft added random rotation encoding scheme address weakness partial overwrites executable space protection approach buffer overflow protection prevents execution code stack heap attacker may use buffer overflows insert arbitrary code memory program executable space protection attempt execute code cause exception cpus support feature called nx execute xd execute disabled bit conjunction software used mark pages data containing stack heap readable writable executable unix operating systems e.g openbsd macos ship executable space protection e.g w^x optional packages include newer variants microsoft windows also support executable space protection called data execution prevention proprietary add-ons include executable space protection generally protect return-to-libc attacks attack rely execution attackers code however 64-bit systems using aslr described executable space protection makes far difficult execute attacks address space layout randomization aslr computer security feature involves arranging positions key data areas usually including base executable position libraries heap stack randomly process address space randomization virtual memory addresses functions variables found make exploitation buffer overflow difficult impossible also forces attacker tailor exploitation attempt individual system foils attempts internet worms similar less effective method rebase processes libraries virtual address space use deep packet inspection dpi detect network perimeter basic remote attempts exploit buffer overflows use attack signatures heuristics able block packets signature known attack long series no-operation instructions known nop-sled detected used location exploit payload slightly variable packet scanning effective method since prevent known attacks many ways nop-sled encoded shellcode used attackers made alphanumeric metamorphic self-modifying evade detection heuristic packet scanners intrusion detection systems checking buffer overflows patching bugs cause naturally helps prevent buffer overflows one common automated technique discovering fuzzing edge case testing also uncover buffer overflows static analysis potential buffer overflow detected must patched makes testing approach useful software development less useful legacy software longer maintained supported buffer overflows understood partially publicly documented early 1972 computer security technology planning study laid technique code performing function check source destination addresses properly permitting portions monitor overlaid user used inject code monitor permit user seize control machine today monitor would referred kernel earliest documented hostile exploitation buffer overflow 1988 one several exploits used morris worm propagate internet program exploited service unix called finger later 1995 thomas lopatic independently rediscovered buffer overflow published findings bugtraq security mailing list year later 1996 elias levy also known aleph one published phrack magazine paper smashing stack fun profit step-by-step introduction exploiting stack-based buffer overflow vulnerabilities since least two major internet worms exploited buffer overflows compromise large number systems 2001 code red worm exploited buffer overflow microsoft internet information services iis 5.0 2003 sql slammer worm compromised machines running microsoft sql server 2000 2003 buffer overflows present licensed xbox games exploited allow unlicensed software including homebrew games run console without need hardware modifications known modchips ps2 independence exploit also used buffer overflow achieve playstation 2 twilight hack accomplished wii using buffer overflow | [
3932,
2549,
5021,
379,
2197,
5381,
1435,
3967,
5397,
3635,
3638,
1855,
6118,
4347,
4716,
56,
4729,
2251,
2618,
3680,
3683,
449,
3351,
4759,
113,
6180,
5482,
1938,
7262,
5485,
2318,
1208,
6922,
3726,
5857,
5506,
2326,
4810,
1584,
6567,
8... | Test |
1,020 | 4 | Gutmann_method:gutmann method gutmann method algorithm securely erasing contents computer hard disk drives files devised peter gutmann colin plumb presented paper secure deletion data magnetic solid-state memory july 1996 involved writing series 35 patterns region erased selection patterns assumes user know encoding mechanism used drive includes patterns designed specifically three types drives user knows type encoding drive uses choose patterns intended drive drive different encoding mechanism would need different patterns patterns gutmann method designed older mfm/rll encoded disks gutmann noted modern drives longer use older encoding techniques making parts method irrelevant said time since paper published people treated 35-pass overwrite technique described kind voodoo incantation banish evil spirits result technical analysis drive encoding techniques since 2001 ata ide sata hard drive manufacturer designs include support ata secure erase standard obviating need apply gutmann method erasing entire drive however 2011 research found 4 8 manufacturers implement ata secure erase correctly one standard way recover data overwritten hard drive capture process analog signal obtained drive read/write head prior analog signal digitized analog signal close ideal digital signal differences reveal important information calculating ideal digital signal subtracting actual analog signal possible amplify obtained difference signal use determine previously written disk example done see previous data written however even overwriting disk repeatedly random data theoretically possible recover previous signal permittivity medium changes frequency magnetic field means lower frequency field penetrate deeper magnetic material drive high frequency one low frequency signal theory still detectable even overwritten hundreds times high frequency signal patterns used designed apply alternating magnetic fields various frequencies various phases drive surface thereby approximate degaussing material surface drive overwrite session consists lead-in four random write patterns followed patterns 5 31 see rows table executed random order lead-out four random patterns patterns 5 31 designed specific magnetic media encoding scheme mind pattern targets drive written passes even though table shows bit patterns passes specifically targeted encoding scheme end result obscure data drive advanced physical scanning e.g. using magnetic force microscope drive likely able recover data series patterns follows encoded bits shown bold present ideal pattern although due encoding complementary bit actually present start track delete function operating systems simply marks space occupied file reusable removes pointer file without immediately removing contents point file fairly easily recovered numerous recovery applications however space overwritten data known way use software recover done software alone since storage device returns current contents via normal interface gutmann claims intelligence agencies sophisticated tools including magnetic force microscopes together image analysis detect previous values bits affected area media example hard disk daniel feenberg national bureau economic research american private nonprofit research organization criticized gutmann claim intelligence agencies likely able read overwritten data citing lack evidence claims nevertheless published government security procedures consider disk overwritten still sensitive gutmann responded criticisms also criticized algorithm abused epilogue original paper states | [
1710,
2717,
2813,
6272,
6488,
5150,
4689,
4456,
8191,
4957,
6327,
7110,
4536
] | Test |
1,021 | 4 | Global_waste_trade:global waste trade global waste trade international trade waste countries treatment disposal recycling toxic hazardous wastes often exported developed countries developing countries also known countries global south therefore burden toxicity wastes western countries falls predominantly onto developing countries africa asia latin america world bank report waste global review solid waste management describes amount solid waste produced given country specifically countries produce solid waste economically developed industrialized report explains g enerally higher economic development rate urbanization greater amount solid waste produced. ” therefore countries global north economically developed urbanized produce solid waste global south countries current international trade flows waste follow pattern waste produced global north exported disposed global south multiple factors affect countries produce waste magnitude including geographic location degree industrialization level integration global economy numerous scholars researchers linked sharp increase waste trading negative impacts waste trading prevalence neoliberal economic policy major economic transition towards neoliberal economic policy 1980s shift towards “ free-market ” policy facilitated sharp increase global waste trade henry giroux chair cultural studies mcmaster university gives definition neoliberal economic policy “ neoliberalism ... removes economics markets discourse social obligations social costs ... policy political project neoliberalism wedded privatization public services selling state functions deregulation finance labor elimination welfare state unions liberalization trade goods capital investment marketization commodification society. ” given economic platform privatization neoliberalism based expanding free-trade agreements establishing open-borders international trade markets trade liberalization neoliberal economic policy trade completely deregulated leaving tariffs quotas restrictions international trade designed developing countries ’ economies integrate global economy critics claim although free-market trade liberalization designed allow country opportunity reach economic success consequences policies devastating global south countries essentially crippling economies servitude global north even supporters international monetary fund “ progress integration uneven recent decades ” specifically developing countries targeted trade liberalization policies import waste means economic expansion guiding neoliberal economic policy argues way integrated global economy participate trade liberalization exchange international trade markets claim smaller countries less infrastructure less wealth less manufacturing ability take hazardous wastes way increase profits stimulate economies current supporters global waste trade argue importing waste economic transaction benefit countries little offer global economy countries production capacity manufacture high quality products import waste stimulate economy lawrence summers former president harvard university chief economist world bank issued confidential memo arguing global waste trade 1991 memo stated think economic logic behind dumping load toxic waste lowest wage country impeccable face that… ’ always thought countries africa vastly polluted air quality probably vastly inefficiently low compared los angeles… n't world bank encouraging migration dirty industries least developed countries position mainly motivated economics financial profit particular demonstrates main argument global waste trade cato institute published article supporting global waste trade suggesting “ little evidence hazardous wastes often chronic carcinogens contribute death rates developing countries. ” elaborating point article argues “ people developing countries would rationally accept increased exposure hazardous pollutants exchange opportunities increase productivity—and hence income. ” overall argument global waste trade rests largely upon perception developing countries need economic development supporters suggest engaging global waste trade developing countries global south expand economies increase profits critics global waste trade claim lack regulation failed policies allowed developing nations become toxic dump yards hazardous waste ever-increasing amounts hazardous waste shipped developing countries increases disproportionate risk people nations face critics effects global waste trade emphasize enormous amount hazardous wastes people poorer countries must deal highlight fact world ’ hazardous wastes produced western countries united states europe yet people suffer negative health effects wastes poorer countries produce waste peter newell professor development studies argues “ environmental inequality reinforces time reflects forms hierarchy exploitation along lines class race gender. ” arguing detrimental effects hazardous waste trade affect disadvantaged others critics global waste trade suggest implications dumping hazardous waste significant consequences people color women low-income people particular critiquing global waste trade reproducing inequality global scale many activists organizers environmentalists regions affected global south vocalized disappointment global waste trade policies evo morales first indigenous amerindian president bolivia argues current economic system forcing exploitation country people claims want save planet earth save life humanity duty put end capitalist system unless put end capitalist system impossible imagine equality justice planet earth believe important put end exploitation human beings pillage natural resources put end destructive wars markets raw materials plundering energy particularly fossil fuels excessive consumption goods accumulation waste capitalist system allows us heap waste jean francois kouadio african native living near toxic dump site ivory coast explains experience effects toxic substances lingering throughout community major western corporations dumping toxic wastes ivory coast kuoadio lost two children effects toxic wastes describes loss second daughter ama grace doctors said suffered acute glycemia caused toxic waste addition critics global south researchers scholars west begun critiquing uneven distribution negative effects hazardous waste dumpings causing dorceta taylor professor university michigan argues women color united states disproportionately affected policies women color forefront struggle bring attention issues devastating minority communities – issues hazardous waste disposal exposure toxins ... communities degraded environments ... repositories waste products capitalist production excessive consumption result vanguard struggle environmental justice founders environmental groups grassroots activists researchers conference organizers workshop leaders lobbyists campaign community organizers t.v reed professor english american studies washington state university argues correlation historical colonialism toxic colonialism based perceptions indigenous land ‘ waste. ’ argues western cultures deemed indigenous land “ underdeveloped ” “ empty ” people inhabiting therefore less “ civilized. ” using historical premises colonialism toxic colonialism reproduces arguments defining global south land expendable western wastes toxic colonialism defined process “ underdeveloped states used inexpensive alternatives export disposal hazardous waste pollution developed states ” core critique global waste trade toxic colonialism represents neocolonial policy continues maintain global inequality today unfair trade systems toxic colonialism uses term colonialism “ characteristics colonialism involving economic dependence exploitation labour cultural inequality intimately associated within new realm toxic waste colonialism. ” electronic waste also known e-waste refers discarded electrical electronic devices rapidly growing surplus electronic waste around world resulted quickly evolving technological advances changes media tapes software mp3 falling prices planned obsolescence estimated 50 million tons e-waste produced year majority comes united states europe electronic waste shipped developing countries asia africa processed recycled various studies investigated environmental health effects e-waste upon people live work around electronic waste dumps heavy metals toxins chemicals leak discarded products surrounding waterways groundwater poisoning local people people work dumps local children searching items sell people living surrounding communities exposed deadly toxins one city suffering negative results hazardous waste trade guiyu china called electronic waste dump world may world largest e-waste dump workers dismantling 1.5 million pounds junked computers cell phones electronic devices per year incinerator ash ash produced incinerators burn waste order dispose incineration many polluting effects include release various hazardous gases heavy metals sulfur dioxide example incinerator ash dumped onto global south global north unjust trade exchange khian sea waste disposal incident carrying 14,000 tons ash incinerator philadelphia cargo ship khian sea dispose waste however upon rejected dominican republic panama honduras bermuda guinea bissau dutch antilles crew finally dumped portion ash near haiti changing name ship twice try conceal original identity senegal morocco yemen sri lanka singapore still banned ship ’ entry upon consistent rejections ash believed disposed atlantic indian oceans following disaster handling hazardous waste haitian government banned waste imports leading movement recognize disastrous consequences global waste trade based khian sea waste disposal incident similar events basel convention written resist known developing countries ‘ toxic colonialism. ’ open signature march 1989 went effect may 1992 u.s. signed treaty yet ratify chemical waste excess unusable waste hazardous chemicals mainly produced large factories extremely difficult costly dispose poses many problems health risks upon exposure must carefully treated toxic waste processing facilities one example chemical waste exported global north onto global south event italian business man seeking avoid european economic regulations allegedly exporting 4,000 tons toxic waste containing 150 tons polychlorinated biphenyls pcbs italian businessman made 4.3 million shipping hazardous waste nigeria fordham environmental law review published article explaining impacts toxic waste imposed nigeria detail mislabelling garbage fertilizers italian company deceived retired/illiterate timber worker agreeing store poison backyard nigerian river port koko little 100 dollars month toxic chemicals exposed hot sun children playing nearby leaked koko water system resulting death nineteen villagers ate contaminated rice nearby farm one example traditional trade flow developed western countries severely unfairly disproportionately impacted developing countries global south another danger developing countries growing issue shipbreaking occurring mainly asia industrialized countries seeking retire used vessels find cheaper send ships asia dismantling china bangladesh seen two hubs shipbreaking asia one main issues lies fact ships aged continue constructed time less environmental regulation environmental fact sheet researchers demonstrate immense impact new toxic trade sector workers environment one older ships contain health-damaging substances asbestos lead oxide zinc chromates mercury arsenic tributyltin addition shipbreaking workers china developing countries traditionally lack proper equipment protective gear handling toxic substances global waste trade negative effects many people particularly poorer developing nations countries often safe recycling processes facilities people process toxic waste bare hands hazardous wastes often properly disposed treated leading poisoning surrounding environment resulting illness death people animals many people experienced illnesses death due unsafe way hazardous wastes handled hazardous waste trade disastrous effects upon environment natural ecosystems various studies explore concentrations persistent organic pollutants poisoned areas surrounding dump sites killing numerous birds fish wildlife heavy metal chemical concentrations air water soil sediment around toxic dump areas concentration levels heavy metals areas extremely high toxic hazardous waste trade serious damaging effects upon health humans people living developing countries may vulnerable dangerous effects hazardous waste trade particularly risk developing health problems methods disposal toxic wastes developing countries expose general population including future generations highly toxic chemicals toxic wastes often disposed open landfills burned incinerators dangerous processes workers wear little protective gear processing toxic chemicals exposed toxins direct contact inhalation contact soil dust well oral intake contaminated locally produced food drinking water health problems resulting hazardous wastes affect humans causing cancers diabetes alterations neurochemical balances hormone disruptions endocrine disruptors skin alterations neurotoxicity kidney damage liver damage bone disease emphysema ovotoxicity reproductive damage many fatal diseases improper disposal hazardous wastes creates fatal health problems serious public health risk various international responses problems associated global waste trade multiple attempts regulate thirty years hazardous waste trade proven difficult regulate much waste traded laws often difficult enforce furthermore often large loopholes international agreements allow countries corporations dump hazardous wastes dangerous ways notable attempt regulate hazardous waste trade basel convention basel convention control transboundary movements hazardous wastes disposal usually known basel convention international treaty plays crucial role regulating transnational movement hazardous wastes basel convention created 1989 attempts regulate hazardous waste trade specifically prevent dumping hazardous waste developed countries less developed countries basel convention developed following series high-profile cases large amounts toxic waste dumped less developed countries poisoning people environment convention seeks reduce creation hazardous wastes control reduce trade across borders convention opened signatures 22 march 1989 officially entered force 5 may 1992 may 2014 180 states european union parties convention haiti united states signed convention ratified environmental network optimizing regulatory compliance illegal traffic enforce agency staffed relevant experts promote compliance basel convention international body created deal transboundary issues international hazardous waste trade issue transnational hazardous waste trade crosses many borders affects many nations important multinational multilateral organization presiding affairs members enforce include one representative five united nations regions parties convention well five representatives basel convention regional coordinating centers based equitable geographical representation members organizations united nations environmental programme unep international criminal police organization interpol ngos working prevent stop illegal traffic basel action network ban many organizations also eligible become members enforce 1999 basel convention passed protocol liability compensation sought improve regulatory measures better protect people hazardous waste protocol liability compensation attempts “ assign appropriate liability procedures transboundary movements hazardous wastes result damages human health environment ” protocol “ imposes strict liability damages situations involving parties basel convention maintain control hazardous waste respective notifying transporting disposing entities. ” seeks regulate ensure countries ’ corporations ’ compliance basel convention laws however protocol remains unsigned countries applicability limited effort protect unfair hazardous waste dumping african caribbean pacific states acp signed lome iv convention supplement basel convention prohibits “ export hazardous wastes european community acp states. ” convention one attempt developing countries protect western countries exporting waste poorer nations hazardous waste trade lomé iv convention expired 2000 acp countries european countries entered new agreement known cotonou agreement “ recognizes existence disproportionate risks developing countries desires protect inappropriate hazardous waste shipments countries. ” 1991 multiple developing nations africa met discuss dissatisfaction basel convention regulating dumping hazardous waste countries designed ban import hazardous wastes countries called bamako convention bamako convention different basel convention bamako “ essentially bans import hazardous waste generated outside oau organization african unity disposal recycling deems import non-party illegal act. ” however countries could effectively implement stipulations convention could prevent dump toxic wastes due limited resources lack powerful enforcement therefore application bamako convention limited laura pratt expert hazardous waste trade claims despite local international attempts regulate hazardous waste trade “ current international agreements widespread legally binding agreements ad hoc agendas among smaller groups countries successful eliminating toxic waste colonialism proponents would hoped. ” explains various loopholes current system allow toxic waste continue dumped toxic colonialism go unchecked problems international agreements include continued illegal shipments unclear definitions terms pratt explains despite attempts regulate illegal dumping “ ftentimes hazardous waste simply moved false permits bribes improper labels even pretext 'recycling growing trend. ” companies often export hazardous wastes poorer countries illegal smuggling attempts regulate market hindered lack ability monitor trade many countries authoritative legislative bodies place prevent punish illegal trafficking hazardous wastes furthermore pratt explains without coordinated international methods enforce regulations extremely difficult countries control illegal trade hazardous waste due disparity enforcement resources regulation uniformity. ” developing nations still bear brunt illegal activity often resources capability protect another issue basel convention international agreements regulate waste trade difficulty establishing clear uniform definitions regarding wastes overly broad ambiguous definitions cause problems international agreements different parties interpret language agreements differently thus act accordingly example “ ‘ lack distinction ‘ waste ’ ‘ products ’ convention vague criteria ‘ hazardous ’ allowed continued export 'hazardous waste ’ label commodities raw materials despite fact wastes still present environmental health risks developing countries ” | [
4656,
8061,
2593,
2029,
1040
] | Test |
1,022 | 5 | Asynchronous_serial_communication:asynchronous serial communication asynchronous serial communication form serial communication communicating endpoints interfaces continuously synchronized common clock signal instead common synchronization signal data stream contains synchronization information form start stop signals unit transmission respectively start signal prepares receiver arrival data stop signal resets state enable triggering new sequence common kind start-stop transmission ascii rs-232 example use teletypewriter operation mechanical teleprinters using 5-bit codes see baudot code typically used stop period 1.5 bit times early electromechanical teletypewriters pre-1930 could require 2 stop bits allow mechanical impression without buffering hardware support fractional stop bits communicate device uses 1.5 bit times configured send 2 stop bits transmitting requiring 1 stop bit receiving format derived directly design teletypewriter designed way electromechanical technology day precise enough synchronous operation thus systems needed re-synchronized start character re-synchronized technology day good enough preserve bit-sync remainder character stop bits gave system time recover next start bit early teleprinter systems used five data bits typically variant baudot code early experimental printing telegraph devices used start bit required manual adjustment receiver mechanism speed reliably decode characters automatic synchronization required keep transmitting receiving units step finally achieved howard krum patented start-stop method synchronization granted september 19 1916 granted december 3 1918 shortly afterward practical teleprinter patented granted july 3 1917 signalling work sender receiver must agree signalling parameters asynchronous start-stop signalling widely used dial-up modem access time-sharing computers bbs systems systems used either seven eight data bits transmitted least-significant bit first accordance ascii standard computers common configuration used 8n1 eight bit characters one start bit one stop bit parity bit thus 10 baud times used send single character dividing signalling bit-rate ten results overall transmission speed characters per second asynchronous start-stop lower data-link layer used connect computers modems many dial-up internet access applications using second encapsulating data link framing protocol ppp create packets made asynchronous serial characters common physical layer interface used rs-232d performance loss relative synchronous access negligible modern modems use private synchronous protocol send data asynchronous links end operated faster data link flow control used throttle data rate prevent overrun | [
2062,
768,
7960,
7040,
5880,
7569,
2117,
3462,
7024,
5492,
3207
] | Validation |
1,023 | 7 | Supercomputer:supercomputer supercomputer computer high level performance compared general-purpose computer performance supercomputer commonly measured floating-point operations per second flops instead million instructions per second mips since 2017 supercomputers perform hundred quadrillion flops since november 2017 world fastest 500 supercomputers run linux-based operating systems additional research conducted china united states european union taiwan japan build even faster powerful technologically superior exascale supercomputers supercomputers play important role field computational science used wide range computationally intensive tasks various fields including quantum mechanics weather forecasting climate research oil gas exploration molecular modeling computing structures properties chemical compounds biological macromolecules polymers crystals physical simulations simulations early moments universe airplane spacecraft aerodynamics detonation nuclear weapons nuclear fusion throughout history essential field cryptanalysis supercomputers introduced 1960s several decades fastest made seymour cray control data corporation cdc cray research subsequent companies bearing name monogram first machines highly tuned conventional designs ran faster general-purpose contemporaries 1960s began add increasing amounts parallelism one four processors typical 1970s vector processors operating large arrays data came dominate notable example highly successful cray-1 1976 vector computers remained dominant design 1990s today massively parallel supercomputers tens thousands off-the-shelf processors became norm us long leader supercomputer field first cray almost uninterrupted dominance field later variety technology companies japan made major strides field 1980s 90s since china become increasingly active field november 2018 fastest supercomputer top500 supercomputer list summit united states linpack benchmark score 143.5 pflops followed sierra around 48.860 pflops us five top 10 china two june 2018 supercomputers list combined broken 1 exaflops mark 1960 sperry rand built livermore atomic research computer larc today considered among first supercomputers us navy research development centre still used high-speed drum memory rather newly emerging disk drive technology also among first supercomputers ibm 7030 stretch ibm 7030 built ibm los alamos national laboratory 1955 requested computer 100 times faster existing computer ibm 7030 used transistors magnetic core memory pipelined instructions prefetched data memory controller included pioneering random access disk drives ibm 7030 completed 1961 despite meeting challenge hundredfold increase performance purchased los alamos national laboratory customers england france also bought computer became basis ibm 7950 harvest supercomputer built cryptanalysis third pioneering supercomputer project early 1960s atlas university manchester built team led tom kilburn designed atlas memory space million words 48 bits magnetic storage capacity unaffordable actual core memory atlas 16,000 words drum providing memory 96,000 words atlas operating system swapped data form pages magnetic core drum atlas operating system also introduced time-sharing supercomputing one programe could executed supercomputer one time atlas joint venture ferranti manchester university designed operate processing speeds approaching one microsecond per instruction one million instructions per second cdc 6600 designed seymour cray finished 1964 marked transition germanium silicon transistors silicon transistors could run faster overheating problem solved introducing refrigeration supercomputer design thus cdc6600 became fastest computer world given 6600 outperformed contemporary computers 10 times dubbed supercomputer defined supercomputing market one hundred computers sold 8 million cray left cdc 1972 form company cray research four years leaving cdc cray delivered 80 mhz cray-1 1976 became one successful supercomputers history cray-2 released 1985 eight central processing units cpus liquid cooling electronics coolant liquid fluorinert pumped supercomputer architecture performed 1.9 gigaflops world second fastest m-13 supercomputer moscow computer seriously challenge cray-1 performance 1970s illiac iv machine first realized example true massively parallel computer many processors worked together solve different parts single larger problem contrast vector systems designed run single stream data quickly possible concept computer instead feeds separate parts data entirely different processors recombines results illiac design finalized 1966 256 processors offer speed 1 gflops compared 1970s cray-1 peak 250 mflops however development problems led 64 processors built system could never operate faster 200 mflops much larger complex cray another problem writing software system difficult getting peak performance matter serious effort partial success illiac iv widely seen pointing way future supercomputing cray argued famously quipping plowing field would rather use two strong oxen 1024 chickens early 1980s several teams working parallel designs thousands processors notably connection machine cm developed research mit cm-1 used many 65,536 simplified custom microprocessors connected together network share data several updated versions followed cm-5 supercomputer massively parallel processing computer capable many billions arithmetic operations per second 1982 osaka university links-1 computer graphics system used massively parallel processing architecture 514 microprocessors including 257 zilog z8001 control processors 257 iapx 86/20 floating-point processors mainly used rendering realistic 3d computer graphics fujitsu numerical wind tunnel supercomputer used 166 vector processors gain top spot 1994 peak speed 1.7 gigaflops gflops per processor hitachi sr2201 obtained peak performance 600 gflops 1996 using 2048 processors connected via fast three-dimensional crossbar network intel paragon could 1000 4000 intel i860 processors various configurations ranked fastest world 1993 paragon mimd machine connected processors via high speed two dimensional mesh allowing processes execute separate nodes communicating via message passing interface software development remained problem cm series sparked considerable research issue similar designs using custom hardware made many companies including evans sutherland es-1 maspar ncube intel ipsc goodyear mpp mid-1990s general-purpose cpu performance improved much supercomputer could built using individual processing units instead using custom chips turn 21st century designs featuring tens thousands commodity cpus norm later machines adding graphic units mix systems massive number processors generally take one two paths grid computing approach processing power many computers organised distributed diverse administrative domains opportunistically used whenever computer available another approach large number processors used proximity e.g computer cluster centralized massively parallel system speed flexibility becomes important modern supercomputers used various approaches ranging enhanced infiniband systems three-dimensional torus interconnects use multi-core processors combined centralization emerging direction e.g cyclops64 system price performance energy efficiency general purpose graphic processors gpgpus improved number petaflops supercomputers tianhe-i nebulae started rely however systems k computer continue use conventional processors sparc-based designs overall applicability gpgpus general-purpose high-performance computing applications subject debate gpgpu may tuned score well specific benchmarks overall applicability everyday algorithms may limited unless significant effort spent tune application towards however gpus gaining ground 2012 jaguar supercomputer transformed titan retrofitting cpus gpus high-performance computers expected life cycle three years requiring upgrade number special-purpose systems designed dedicated single problem allows use specially programmed fpga chips even custom asics allowing better price/performance ratios sacrificing generality examples special-purpose supercomputers include belle deep blue hydra playing chess gravity pipe astrophysics mdgrape-3 protein structure computation molecular dynamics deep crack breaking des cipher throughout decades management heat density remained key issue centralized supercomputers large amount heat generated system may also effects e.g reducing lifetime system components diverse approaches heat management pumping fluorinert system hybrid liquid-air cooling system air cooling normal air conditioning temperatures typical supercomputer consumes large amounts electrical power almost converted heat requiring cooling example tianhe-1a consumes 4.04 megawatts mw electricity cost power cool system significant e.g 4 mw 0.10/kwh 400 hour 3.5 million per year heat management major issue complex electronic devices affects powerful computer systems various ways thermal design power cpu power dissipation issues supercomputing surpass traditional computer cooling technologies supercomputing awards green computing reflect issue packing thousands processors together inevitably generates significant amounts heat density need dealt cray 2 liquid cooled used fluorinert cooling waterfall forced modules pressure however submerged liquid cooling approach practical multi-cabinet systems based off-the-shelf processors system x special cooling system combined air conditioning liquid cooling developed conjunction liebert company blue gene system ibm deliberately used low power processors deal heat density ibm power 775 released 2011 closely packed elements require water cooling ibm aquasar system uses hot water cooling achieve energy efficiency water used heat buildings well energy efficiency computer systems generally measured terms flops per watt 2008 ibm roadrunner operated 3.76 mflops/w november 2010 blue gene/q reached 1,684 mflops/w june 2011 top 2 spots green 500 list occupied blue gene machines new york one achieving 2097 mflops/w degima cluster nagasaki placing third 1375 mflops/w copper wires transfer energy supercomputer much higher power densities forced air circulating refrigerants remove waste heat ability cooling systems remove waste heat limiting factor many existing supercomputers infrastructure capacity actual peak demand machine designers generally conservatively design power cooling infrastructure handle theoretical peak electrical power consumed supercomputer designs future supercomputers power-limited thermal design power supercomputer whole amount power cooling infrastructure handle somewhat expected normal power consumption less theoretical peak power consumption electronic hardware since end 20th century supercomputer operating systems undergone major transformations based changes supercomputer architecture early operating systems custom tailored supercomputer gain speed trend move away in-house operating systems adaptation generic software linux since modern massively parallel supercomputers typically separate computations services using multiple types nodes usually run different operating systems different nodes e.g using small efficient lightweight kernel cnk cnl compute nodes larger system linux-derivative server i/o nodes traditional multi-user computer system job scheduling effect tasking problem processing peripheral resources massively parallel system job management system needs manage allocation computational communication resources well gracefully deal inevitable hardware failures tens thousands processors present although modern supercomputers use linux-based operating system manufacturer specific linux-derivative industry standard exists partly due fact differences hardware architectures require changes optimize operating system hardware design parallel architectures supercomputers often dictate use special programming techniques exploit speed software tools distributed processing include standard apis mpi pvm vtl open source-based software solutions beowulf common scenario environments pvm mpi loosely connected clusters openmp tightly coordinated shared memory machines used significant effort required optimize algorithm interconnect characteristics machine run aim prevent cpus wasting time waiting data nodes gpgpus hundreds processor cores programmed using programming models cuda opencl moreover quite difficult debug test parallel programs special techniques need used testing debugging applications opportunistic supercomputing form networked grid computing whereby super virtual computer many loosely coupled volunteer computing machines performs large computing tasks grid computing applied number large-scale embarrassingly parallel problems require supercomputing performance scales however basic grid cloud computing approaches rely volunteer computing handle traditional supercomputing tasks fluid dynamic simulations fastest grid computing system distributed computing project folding home f h f h reported 101 pflops x86 processing power 100 pflops contributed clients running various gpus rest various cpu systems berkeley open infrastructure network computing boinc platform hosts number distributed computing projects boinc recorded processing power 166 petaflops 762 thousand active computers hosts network great internet mersenne prime search gimps distributed mersenne prime search achieved 0.313 pflops 1.3 million computers internet primenet server supports gimps grid computing approach one earliest successful grid computing projects since 1997 quasi-opportunistic supercomputing form distributed computing whereby super virtual computer many networked geographically disperse computers performs computing tasks demand huge processing power quasi-opportunistic supercomputing aims provide higher quality service opportunistic grid computing achieving control assignment tasks distributed resources use intelligence availability reliability individual systems within supercomputing network however quasi-opportunistic distributed execution demanding parallel computing software grids achieved implementation grid-wise allocation agreements co-allocation subsystems communication topology-aware allocation mechanisms fault tolerant message passing libraries data pre-conditioning cloud computing recent rapid expansions development grabbed attention hpc users developers recent years cloud computing attempts provide hpc-as-a-service exactly like forms services currently available cloud software-as-a-service platform-as-a-service infrastructure-as-a-service hpc users may benefit cloud different angles scalability resources on-demand fast inexpensive hand moving hpc applications set challenges good examples challenges virtualization overhead cloud multi-tenancy resources network latency issues much research currently done overcome challenges make hpc cloud realistic possibility 2016 penguin computing r-hpc amazon web services univa silicon graphics international sabalcore gomput started offer hpc cloud computing penguin demand pod cloud bare-metal compute model execute code user given virtualized login node pod computing nodes connected via nonvirtualized 10 gbit/s ethernet qdr infiniband networks user connectivity pod data center ranges 50 mbit/s 1 gbit/s citing amazon ec2 elastic compute cloud penguin computing argues virtualization compute nodes suitable hpc penguin computing also criticized hpc clouds may allocated computing nodes customers far apart causing latency impairs performance hpc applications supercomputers generally aim maximum capability computing rather capacity computing capability computing typically thought using maximum computing power solve single large problem shortest amount time often capability system able solve problem size complexity computer e.g. complex weather simulation application capacity computing contrast typically thought using efficient cost-effective computing power solve somewhat large problems many small problems architectures lend supporting many users routine everyday tasks may lot capacity typically considered supercomputers given solve single complex problem general speed supercomputers measured benchmarked flops floating point operations per second terms mips million instructions per second case general-purpose computers measurements commonly used si prefix tera- combined shorthand tflops 10 flops pronounced teraflops peta- combined shorthand pflops 10 flops pronounced petaflops petascale supercomputers process one quadrillion 10 1000 trillion flops exascale computing performance exaflops eflops range eflops one quintillion 10 flops one million tflops single number reflect overall performance computer system yet goal linpack benchmark approximate fast computer solves numerical problems widely used industry flops measurement either quoted based theoretical floating point performance processor derived manufacturer processor specifications shown rpeak top500 lists generally unachievable running real workloads achievable throughput derived linpack benchmarks shown rmax top500 list linpack benchmark typically performs lu decomposition large matrix linpack performance gives indication performance real-world problems necessarily match processing requirements many supercomputer workloads example may require memory bandwidth may require better integer computing performance may need high performance i/o system achieve high levels performance since 1993 fastest supercomputers ranked top500 list according linpack benchmark results list claim unbiased definitive widely cited current definition fastest supercomputer available given time recent list computers appeared top top500 list peak speed given rmax rating source top500 2018 lenovo became worlds largest provider 117 top500 supercomputers stages supercomputer application may summarized following table ibm blue gene/p computer used simulate number artificial neurons equivalent approximately one percent human cerebral cortex containing 1.6 billion neurons approximately 9 trillion connections research group also succeeded using supercomputer simulate number artificial neurons equivalent entirety rat brain modern-day weather forecasting also relies supercomputers national oceanic atmospheric administration uses supercomputers crunch hundreds millions observations help make weather forecasts accurate 2011 challenges difficulties pushing envelope supercomputing underscored ibm abandonment blue waters petascale project advanced simulation computing program currently uses supercomputers maintain simulate united states nuclear stockpile 2010s china united states european union others competed first create 1 exaflop 10 one quintillion flops supercomputer erik p. debenedictis sandia national laboratories theorized zettaflops 10 one sextillion flops computer required accomplish full weather modeling could cover two-week time span accurately systems might built around 2030 many monte carlo simulations use algorithm process randomly generated data set particularly integro-differential equations describing physical transport processes random paths collisions energy momentum depositions neutrons photons ions electrons etc next step microprocessors may third dimension specializing monte carlo many layers could identical simplifying design manufacture process cost operating high performance supercomputers risen mainly due increasing power consumption mid 1990s top 10 supercomputer required range 100 kilowatt 2010 top 10 supercomputers required 1 2 megawatt 2010 study commissioned darpa identified power consumption pervasive challenge achieving exascale computing time megawatt per year energy consumption cost 1 million dollar supercomputing facilities constructed efficiently remove increasing amount heat produced modern multi-core central processing units based energy consumption green 500 list supercomputers 2007 2011 supercomputer 1 exaflops 2011 would required nearly 500 megawatt operating systems developed existing hardware conserve energy whenever possible cpu cores use execution parallelised application put low-power states producing energy savings supercomputing applications increasing cost operating supercomputers driving factor trend towards bundling resources distributed supercomputer infrastructure national supercomputing centres first emerged us followed germany japan european union launched partnership advanced computing europe prace aim creating persistent pan-european supercomputer infrastructure services support scientists across european union porting scaling optimizing supercomputing applications iceland built world first zero-emission supercomputer located thor data center reykjavik iceland supercomputer relies completely renewable sources power rather fossil fuels colder climate also reduces need active cooling making one greenest facilities world computers funding supercomputer hardware also became increasingly difficult mid 1990s top 10 supercomputer cost 10 million euros 2010 top 10 supercomputers required investment 40 50 million euros 2000s national governments put place different strategies fund supercomputers uk national government funded supercomputers entirely high performance computing put control national funding agency germany developed mixed funding model pooling local state funding federal funding many science-fiction writers depicted supercomputers works historical construction computers much fiction deals relations humans computers build possibility conflict eventually developing scenarios nature appear ai-takeover page examples supercomputers fiction include hal-9000 multivac machine stops glados evitable conflict vulcan hammer | [
2539,
2903,
5362,
708,
6074,
2183,
7520,
5371,
4672,
7891,
7528,
7535,
4318,
7180,
5042,
5744,
740,
1481,
5055,
1116,
5064,
418,
763,
2601,
2961,
5429,
3667,
4365,
4368,
1506,
4370,
2969,
4372,
3673,
1510,
4742,
2261,
84,
5447,
6865,
22... | Test |
1,024 | 8 | OWL-S:owl-s owl-s ontology built top web ontology language owl darpa daml program replaces former daml-s ontology owl-s ontology within owl-based framework semantic web describing semantic web services enable users software agents automatically discover invoke compose monitor web resources offering services specified constraints development owl-s aims enable following tasks owl-s ontology three main parts service profile process model grounding owl-s requires additional description full specification grounding commonly used wsdl although languages target different levels specification intersection | [
6986,
5631,
5179,
7290,
2122
] | Test |
1,025 | 2 | IPad_Mini_(2019):ipad mini 2019 fifth-generation ipad mini stylized marketed ipad mini colloquially referred ipad mini 5 tablet computer ipad mini line designed developed marketed apple inc announced press release along ipad air 2019 march 18 2019 first ipad mini released without live press event predecessor ipad mini 4 discontinued day shares similar design ipad mini 4 features apple a12 bionic chip 64 256gb storage modernly upgraded 7.9-inch retina display support apple pencil 1st generation true tone display bluetooth 5.0. ifixit teardown shows ipad mini equipped upgraded 3gb lpddr4x ram iphone xr ipad mini 2019 features upgraded front camera system 7mp 1080p camera used since 2016 starting iphone 7 continued iphone xs rear camera system continues older 8mp 1080p used since ipad air 2 2014 record 4k ipad mini uses lightning port headphone jack true tone display allows lcd adapt ambient lighting change color intensity different environments apple a12 bionic chip powering ipad mini 2019 66 higher clock speed predecessor 1.5ghz dual-core processor apple a8 previous generation clocked higher iphone 6 apple a12 bionic chip 2.49ghz six-core processor ipad mini 2019 3x faster ipad mini 4 support apple pencil 1st generation | [
6788,
3940,
7890,
5732,
722,
1094,
4320,
2926,
4690,
5037,
734,
5752,
405,
6125,
2954,
1123,
7572,
6482,
6847,
6142,
2609,
1895,
4373,
7226,
4376,
2978,
5091,
4749,
5450,
7601,
3346,
6165,
4389,
5463,
102,
5469,
4768,
3001,
2284,
3008,
... | Test |
1,026 | 2 | Cyclic_executive:cyclic executive cyclic executive alternative real-time operating system form cooperative multitasking one task sole task typically realized infinite loop main e.g c. basic scheme cycle repeating sequence activities set frequency example consider example embedded system designed monitor temperature sensor update lcd display lcd may need written twenty times second i.e. every 50 ms temperature sensor must read every 100 ms reasons might construct loop following appearance outer 100 ms cycle called major cycle case also inner minor cycle 50 ms first example outer versus inner cycles n't obvious use counting mechanism clarify major minor cycles | [
2266
] | Test |
1,027 | 4 | Sendmail,_Inc.:sendmail inc. sendmail inc. email management business company headquartered emeryville ca offices throughout americas europe asia company founded 1998 eric allman creator sendmail open source mail transfer agent 2005 sendmail released sentrion email infrastructure platform address need full-content message inspection enabling policy-based delivery human machine-generated email 2012 sendmail partnered mimecast provide hybrid-cloud email security archiving continuity predicted 2013 would see organizations implementing hybrid cloud computing strategies reduce cost complexity messaging infrastructure 2012 sendmail released sentrion reac rogue email application control amid growing security compliance concerns posed growth application-generated email migration email cloud 2013 sendmail acquired security-as-a-service company proofpoint inc | [
334
] | Test |
1,028 | 2 | Qimo_4_Kids:qimo 4 kids qimo 4 kids pronounced kim-oh eskimo child-friendly desktop environment built entirely free software qimo comes pre-installed educational games kids tuxpaint etoys gcompris tuxmath tuxtyping large colorful icons help young users navigate easily designed early elementary school aged children qimo based xubuntu using xfce designed visually appealing kids fact qimo based xubuntu helps provide low hardware requirements minimum 256mb memory run cd 192mb install least 6 gb hard drive space 400 mhz faster cpu needed qimo uses ubuntu 10.04 lts lucid lynx still possible download run qimo 2.0 project discontinued development halted 30 january 2016 may 2010 qimo 2.0 released | [
5704
] | Test |
1,029 | 2 | Dotum:dotum dotum korean truetype sans-serif font latin shape similar helvetica version 5.00 font provided part windows vista windows 7 windows 8 windows server 2008 | [
1832,
2920,
6645,
5871,
2927,
4759,
2499,
2931,
5837,
2917
] | Test |
1,030 | 9 | Smn_theorem:smn theorem computability theory theorem also called translation lemma parameter theorem parameterization theorem basic result programming languages generally gödel numberings computable functions soare 1987 rogers 1967 first proved stephen cole kleene 1943 name comes occurrence subscript n superscript original formulation theorem see practical terms theorem says given programming language positive integers n exists particular algorithm accepts input source code program n free variables together values algorithm generates source code effectively substitutes values first free variables leaving rest variables free basic form theorem applies functions two arguments nies 2009 p. 6 given gödel numbering formula_1 recursive functions primitive recursive function two arguments following property every gödel number p partial computable function f two arguments expressions formula_2 formula_3 defined combinations natural numbers x values equal combination words following extensional equality functions holds every x generally n 0 exists primitive recursive function formula_5 1 arguments behaves follows every gödel number p partial computable function n arguments values x … x function described taken formula_7 given arities formula_8 formula_9 every turing machine formula_10 arity formula_11 possible values inputs formula_12 exists turing machine formula_13 arity formula_9 furthermore turing machine formula_16 allows formula_17 calculated formula_18 formula_19 denoted formula_20 informally formula_16 finds turing machine formula_13 result hardcoding values formula_19 formula_10 result generalizes turing complete computing model following lisp code implements lisp example evaluates | [
7416,
7658,
7703
] | Test |
1,031 | 3 | EVEX_prefix:evex prefix evex prefix enhanced vector extension corresponding coding scheme extension 32-bit x86 ia-32 64-bit x86-64 amd64 instruction set architecture evex based confused mvex prefix used knights corner processor evex scheme 4-byte extension vex scheme supports avx-512 instruction set allows addressing new 512-bit zmm registers new 64-bit operand mask registers evex coding address 8 operand mask registers 16 general-purpose registers 32 vector registers 64-bit mode otherwise 8 general-purpose 8 vector support 4 operands like vex coding scheme evex prefix unifies existing opcode prefixes escape codes memory addressing operand length modifiers x86 instruction set following features carried vex scheme evex also extends vex additional capabilities example evex encoding scheme allows conditional vector addition form k1 modifier next destination operand encodes use opmask register k1 conditional processing updates destination z modifier encoded evex.z provides two types masking merging zeroing merging default modifier attached evex coding scheme uses code prefix consisting 4 bytes first byte always 62h derives unused opcode 32-bit bound instruction supported 64-bit mode modr/m byte specifies addressing source register mod r/m fields encode either 8 registers 24 addressing modes destination register encoded reg field base-plus-index scale-plus-index addressing require sib byte encodes 2-bit scale factor well 3-bit index 3-bit base registers certain sib encodings disp32 contains displacements need added base address evex prefix retains fields introduced vex prefix new functions existing fields several new bit fields encoding evex prefix follows following table lists allowed register addressing combinations bit 4 always zero encoding 16 general purpose registers | [
584,
2000,
6332,
3747,
352
] | Test |
1,032 | 0 | Probabilistic_context-free_grammar:probabilistic context-free grammar grammar theory model symbol strings originated work computational linguistics aiming understand structure natural languages probabilistic context free grammars pcfgs applied probabilistic modeling rna structures almost 40 years introduced computational linguistics pcfgs extend context-free grammars similar hidden markov models extend regular grammars production assigned probability probability derivation parse product probabilities productions used derivation probabilities viewed parameters model large problems convenient learn parameters via machine learning probabilistic grammar validity constrained context training dataset pcfgs application areas diverse natural language processing study structure rna molecules design programming languages designing efficient pcfgs weigh factors scalability generality issues grammar ambiguity must resolved grammar design affects results accuracy grammar parsing algorithms various time memory requirements derivation process recursive generation strings grammar parsing finding valid derivation using automaton parse tree alignment grammar sequence example parser pcfg grammars pushdown automaton algorithm parses grammar nonterminals left right stack-like manner brute-force approach efficient rna secondary structure prediction variants cocke–younger–kasami cyk algorithm provide efficient alternatives grammar parsing pushdown automata another example pcfg parser stanford statistical parser trained using treebank similar cfg probabilistic context-free grammar defined quintuple pcfgs models extend context-free grammars way hidden markov models extend regular grammars inside-outside algorithm analogue forward-backward algorithm computes total probability derivations consistent given sequence based pcfg equivalent probability pcfg generating sequence intuitively measure consistent sequence given grammar inside-outside algorithm used model parametrization estimate prior frequencies observed training sequences case rnas dynamic programming variants cyk algorithm find viterbi parse rna sequence pcfg model parse likely derivation sequence given pcfg context-free grammars represented set rules inspired attempts model natural languages rules absolute typical syntax representation known backus–naur form production rules consist terminal formula_2 non-terminal symbols blank formula_3 may also used end point production rules cfg pcfg left side one nonterminal whereas right side string terminal nonterminals pcfg nulls excluded example grammar grammar shortened using '| 'or character terminals grammar words grammar rules non-terminal symbol transformed string either terminals and/or non-terminals grammar read beginning non-terminal emission generate either formula_3 derivation ambiguous grammar may result ambiguous parsing applied homographs since word sequence one interpretation pun sentences newspaper headline iraqi head seeks arms example ambiguous parses one strategy dealing ambiguous parses originating grammarians early pāṇini add yet rules prioritize one rule takes precedence others however drawback proliferating rules often point become difficult manage another difficulty overgeneration unlicensed structures also generated probabilistic grammars circumvent problems ranking various productions frequency weights resulting likely winner-take-all interpretation usage patterns altered diachronic shifts probabilistic rules re-learned thus updating grammar assigning probability production rules makes pcfg probabilities informed observing distributions training set similar composition language modeled samples broad language probabilistic grammars probabilities estimated data typically outperform hand-crafted grammars cfgs contrasted pcfgs applicable rna structure prediction incorporate sequence-structure relationship lack scoring metrics reveal sequence structural potential weighted context-free grammar wcfg general category context-free grammar production numeric weight associated weight specific parse tree wcfg product sum rule weights tree rule weight included often rule used tree special case wcfgs pcfgs weights logarithms probabilities extended version cyk algorithm used find lightest least-weight derivation string given wcfg tree weight product rule weights wcfgs pcfgs express set probability distributions energy minimization pcfg provide ways predicting rna secondary structure comparable performance however structure prediction pcfgs scored probabilistically rather minimum free energy calculation pcfg model parameters directly derived frequencies different features observed databases rna structures rather experimental determination case energy minimization methods types various structure modeled pcfg include long range interactions pairwise structure nested structures however pseudoknots modeled pcfgs extend cfg assigning probabilities production rule maximum probability parse tree grammar implies maximum probability structure since rnas preserve structures primary sequence rna structure prediction guided combining evolutionary information comparative sequence analysis biophysical knowledge structure plausibility based probabilities also search results structural homologs using pcfg rules scored according pcfg derivations probabilities therefore building grammar model behavior base-pairs single-stranded regions starts exploring features structural multiple sequence alignment related rnas grammar generates string outside-in fashion basepair furthest extremes terminal derived first string formula_9 derived first generating distal sides moving inwards pcfg model extendibility allows constraining structure prediction incorporating expectations different features rna expectation may reflect example propensity assuming certain structure rna however incorporation much information may increase pcfg space memory complexity desirable pcfg-based model simple possible every possible string grammar generates assigned probability weight formula_11 given pcfg model formula_12 follows sum probabilities possible grammar productions formula_13 scores paired unpaired residue explain likelihood secondary structure formations production rules also allow scoring loop lengths well order base pair stacking hence possible explore range possible generations including suboptimal structures grammar accept reject structures based score thresholds rna secondary structure implementations based pcfg approaches utilized different implementation approaches exist example pfold used secondary structure prediction group related rna sequences covariance models used searching databases homologous sequences rna annotation classification rnapromo cmfinder teiser used finding stable structural motifs rnas pcfg design impacts secondary structure prediction accuracy useful structure prediction probabilistic model based pcfg maintain simplicity without much compromise prediction accuracy complex model excellent performance single sequence may scale grammar based model able resulting multiple parse trees per grammar denotes grammar ambiguity may useful revealing possible base-pair structures grammar however optimal structure one one one correspondence parse tree secondary structure two types ambiguities distinguished parse tree ambiguity structural ambiguity structural ambiguity affect thermodynamic approaches optimal structure selection always basis lowest free energy scores parse tree ambiguity concerns existence multiple parse trees per sequence ambiguity reveal possible base-paired structures sequence generating possible parse trees finding optimal one case structural ambiguity multiple parse trees describe secondary structure obscures cyk algorithm decision finding optimal structure correspondence parse tree structure unique grammar ambiguity checked conditional-inside algorithm probabilistic context free grammar consists terminal nonterminal variables feature modeled production rule assigned probability estimated training set rna structures production rules recursively applied terminal residues left starting non-terminal formula_14 produces loops rest grammar proceeds parameter formula_15 decide whether loop start stem single stranded region parameter formula_16 produces paired bases formalism simple pcfg looks like application pcfgs predicting structures multi-step process addition pcfg incorporated probabilistic models consider rna evolutionary history search homologous sequences databases evolutionary history context inclusion prior distributions rna structures structural alignment production rules pcfg facilitates good prediction accuracy summary general steps utilizing pcfgs various scenarios several algorithms dealing aspects pcfg based probabilistic models rna structure prediction exist instance inside-outside algorithm cyk algorithm inside-outside algorithm recursive dynamic programming scoring algorithm follow expectation-maximization paradigms computes total probability derivations consistent given sequence based pcfg inside part scores subtrees parse tree therefore subsequences probabilities given pcfg outside part scores probability complete parse tree full sequence cyk modifies inside-outside scoring note term 'cyk algorithm describes cyk variant inside algorithm finds optimal parse tree sequence using pcfg extends actual cyk algorithm used non-probabilistic cfgs inside algorithm calculates formula_20 probabilities formula_21 parse subtree rooted formula_22 subsequence formula_23 outside algorithm calculates formula_24 probabilities complete parse tree sequence root excluding calculation formula_23 variables refine estimation probability parameters pcfg possible reestimate pcfg algorithm finding expected number times state used derivation summing products divided probability sequence given model formula_11 also possible find expected number times production rule used expectation-maximization utilizes values cyk algorithm calculates formula_27 find probable parse tree formula_28 yields formula_29 memory time complexity general pcfg algorithms rna structure predictions formula_30 formula_31 respectively restricting pcfg may alter requirement case database searches methods covariance models cms special type pcfgs applications database searches homologs annotation rna classification cms possible build pcfg-based rna profiles related rnas represented consensus secondary structure rna analysis package infernal uses profiles inference rna alignments rfam database also uses cms classifying rnas families based structure sequence information cms designed consensus rna structure cm allows indels unlimited length alignment terminals constitute states cm transition probabilities states 1 indels considered grammars cm follows model 6 possible states state grammar includes different types secondary structure probabilities non-terminals states connected transitions ideally current node states connect insert states subsequent node states connect non-insert states order allow insertion one base insert states connect order score cm model inside-outside algorithms used cms use slightly different implementation cyk log-odds emission scores optimum parse tree formula_38 calculated emitting states formula_39 since scores function sequence length discriminative measure recover optimum parse tree probability score- formula_40 reached limiting maximum length sequence aligned calculating log-odds relative null computation time step linear database size algorithm memory complexity formula_41 kh-99 algorithm knudsen hein lays basis pfold approach predicting rna secondary structure approach parameterization requires evolutionary history information derived alignment tree addition probabilities columns mutations grammar probabilities observed training dataset structural alignment probabilities unpaired bases columns paired bases columns independent columns counting bases single base positions paired positions one obtains frequencies bases loops stems basepair occurrence formula_42 also counted occurrence formula_43 identical basepairs formula_44 counted twice pairing sequences possible ways overall mutation rates estimated order recover plausible mutations sequence identity threshold used comparison similar sequences approach uses 85 identity threshold pairing sequences first single base positions differences -except gapped columns- sequence pairs counted position two sequences different bases count difference incremented sequence unpaired bases 4 x 4 mutation rate matrix used satisfies mutation flow x reversible basepairs 16 x 16 rate distribution matrix similarly generated pcfg used predict prior probability distribution structure whereas posterior probabilities estimated inside-outside algorithm likely structure found cyk algorithm calculating column prior probabilities alignment probability estimated summing possible secondary structures column secondary structure formula_48 sequence length formula_49 scored respect alignment tree mutational model prior distribution given pcfg formula_50 phylogenetic tree calculated model maximum likelihood estimation note gaps treated unknown bases summation done dynamic programming structure grammar assigned production probabilities devised structures training dataset prior probabilities give weight predictions accuracy number times rule used depends observations training dataset particular grammar feature probabilities written parenthesis grammar formalism rule total 100 instance given prior alignment frequencies data likely structure ensemble predicted grammar computed maximizing formula_58 cyk algorithm structure highest predicted number correct predictions reported consensus structure pcfg based approaches desired scalable general enough compromising speed accuracy needs minimal possible pfold addresses limitations kh-99 algorithm respect scalability gaps speed accuracy whereas pcfgs proved powerful tools predicting rna secondary structure usage field protein sequence analysis limited indeed size amino acid alphabet variety interactions seen proteins make grammar inference much challenging consequence applications formal language theory protein analysis mainly restricted production grammars lower expressive power model simple functional patterns based local interactions since protein structures commonly display higher-order dependencies including nested crossing relationships clearly exceed capabilities cfg still development pcfgs allows expressing dependencies providing ability model wider range protein patterns one main obstacles inferring protein grammar size alphabet encode 20 different amino acids proposed address using physico-chemical properties amino acids reduce significantly number possible combinations right side symbols production rules 3 levels quantitative property utilised instead 20 amino acid types e.g small medium large van der waals volume based scheme pcfgs produced generate binding site helix-helix contact site descriptors significant feature grammars analysis rules parse trees provide biologically meaningful information | [
7375,
1314,
5429,
2793,
2553
] | Test |
1,033 | 7 | BioBIKE:biobike biobike nee biolingua cloud-based through-the-web programmable paas symbolic biocomputing bioinformatics platform aims make computational biology especially intelligent biocomputing application artificial intelligence computational biology accessible research scientists expert programmers biobike integrated symbolic biocomputing bioinformatics platform built start entirely called cloud-based architecture computing done remote servers user access accomplished web browsers biobike built-in frame system objects data knowledge represented enables code written either native lisp visual programming language systems rules expressed snark theorem prover access whole biological knowledge integrated manner time released 2002 unique permitting users create fully functional biocomputing programs run back-end servers entirely web browser ui modern terms one first paas platform service systems predating even salesforce capability initially programming carried raw lisp jeff elhai team vcu nsf funding created entirely graphical programming environment top biobike based upon boxer-style programming environments multi-headed multi-threaded multi-user multi-tenancy cloud-based system biobike users able directly work together web browsers remotely sharing listener memory space permitted unique sort collaboration discussed shrager 2007 specialized offshoot biobike called biodeducta includes sri snark theorem prover offering unique deductive biocomputing capabilities biobike open-source software implemented using lisp programming language continuing development takes place biobike team centered virginia commonwealth university biobike originally called biolingua developed jeff shrager carnegie inst washington dept plant biology jp massar funding nasa astrobiology division shrager massar wanted create web-based multi-user lisp machine specialized bioinformatics early contributors project included mike travers jeff elhai vcu elhai obtained continuing funding national science foundation project renamed biobike elhai colleagues added biobike unique visual programming language shrager meanwhile collaborated richard waldinger sri build sri snark theorem prover biobike creating deductive biocomputing system called biodeducta used number biobike verticals different biological domains including viral pathogens cyanobacteria bacteria arabidopsis thaliana several others described references | [
2961,
1908,
4543,
5571
] | Test |
1,034 | 4 | CCNA:ccna ccna cisco certified network associate information technology certification cisco systems ccna certification associate-level cisco career certification cisco exams changed several times response changing trends 2013 cisco announced update certification program aligns certification training curricula evolving industry job roles several different types cisco-certified network associate ccna routing switching closest original ccna focus types ccna focus security cloud collaboration security operations design data center technologies industrial plants service providers wireless content exams proprietary cisco learning partners offer variety different training methods including books published cisco press online classroom courses available title interconnecting cisco network devices achieve ccna routing switching certification one must earn passing score cisco exam 200-125 combined passing scores interconnecting cisco network devices 1 icnd1 100-105 interconnecting cisco network devices 2 icnd2 200-105 exams passing icnd1 exam grants candidate cisco certified entry networking technician ccent certification completion exam candidates receive score report along score breakout exam section passing score given exam 200-125 ccna composite exam associated cisco certified network associate routing switching certification exam tests candidate knowledge skills required install operate troubleshoot small medium size enterprise branch network topics include connecting wan implementing network security network types network media routing switching fundamentals tcp/ip osi models ip addressing wan technologies operating configuring ios devices extending switched networks vlans determining ip routes managing ip traffic access lists establishing point-to-point connections receive ccna certification one must pass either prerequisites take ccna routing switching certification exam also starting points networking licenses ccent cct ten tracks associate certifications cisco career certifications feb/2020 would updated eleven tracks including cisco certified devnet associate ccda ccna cloud ccna collaboration ccna cyber ops ccna data center ccna industrial ccna routing switching ccna security ccna service provider ccna wireless ccna routing switching validity ccna certification 3 years renewal requires certification holders register pass higher level cisco recertification exam every 3 years | [
7192,
6004,
6694,
5124,
4783,
3517,
221,
7486
] | Test |
1,035 | 4 | Reflected_DOM_Injection:reflected dom injection reflected dom injection rdi evasive xss technique uses third party website construct execute attack technique implemented websites use user-provided url part service e.g translation services caching services etc order implement technique using technique exploit triggered user followed expected flow accessed website using third party service code however would execute browsing directly attacker ’ website figure 1 describes direct access website uses rdi technique exploit user ’ browser accessing website directly exploit remained encrypted content sent client machine remains benign figure 2 describes attack scenario user accesses website uses rdi technique using third party service service creates new connection attacker ’ website receives content manipulates order provide service delivers new modified content user manipulation done service turns attacker ’ page malicious one helping generate key required decrypt malicious code rdi technique actually uses third party service create malicious content rdi technique provides following benefits rdi technique first presented defcon 21 daniel chechik anat davidi full scenario technique described paper published following conference trustwave spiderlabs blog ... site reliable | [
2566
] | Test |
1,036 | 4 | Distributed_Checksum_Clearinghouse:distributed checksum clearinghouse distributed checksum clearinghouse also referred dcc hash sharing method spam email detection basic logic dcc spam mails sent many recipients message body appearing many times therefore bulk email dcc identifies bulk email taking checksum sending checksum clearinghouse server server responds number times received checksum individual email create score 1 time processed bulk mail identified response number high content examined dcc works udp protocol uses little bandwidth dcc resistant hashbusters main dcc checksums fuzzy ignore aspects messages fuzzy checksums changed spam evolves dcc likely identify mailing lists bulk email unless white listed likewise repeatedly sending email server increases number server therefore likelihood treated spam others according official dcc website dcc based idea paul vixie fuzzy body matching reject spam corporate firewall operated vernon schryver starting 1997 dcc designed written rhyolite software starting 2000 used production since winter 2000/2001 | [
5722,
5547,
7164,
5733,
7174,
6102,
5836,
3031,
4734,
1321,
3338
] | Test |
1,037 | 4 | Electronic_signature:electronic signature electronic signature e-signature refers data electronic form logically associated data electronic form used signatory sign type signature provides legal standing handwritten signature long adheres requirements specific regulation created e.g. eidas european union nist-dss usa zertes switzerland electronic signatures legal concept distinct digital signatures cryptographic mechanism often used implement electronic signatures electronic signature simple name entered electronic document digital signatures increasingly used e-commerce regulatory filings implement electronic signatures cryptographically protected way standardization agencies like nist etsi provide standards implementation e.g. nist-dss xades pades concept new common law jurisdictions recognized telegraph signatures far back mid-19th century faxed signatures since 1980s electronic signature intended provide secure accurate identification method signatory provide seamless transaction definitions electronic signatures vary depending applicable jurisdiction common denominator countries level advanced electronic signature requiring electronic signatures may created increasing levels security set requirements means creation various levels prove validity signature provide even stronger probative value described advanced electronic signature countries like european union switzerland introduced qualified electronic signature difficult challenge authorship statement signed qualified electronic signature statement non-repudiable technically qualified electronic signature implemented advanced electronic signature utilizes digital certificate encrypted security signature-creating device authenticated qualified trust service provider since well american civil war began 1861 morse code used send messages electrically telegraphy messages agreements terms intended enforceable contracts early acceptance enforceability telegraphic messages electronic signatures came new hampshire supreme court 1869 1980s many companies even individuals began using fax machines high-priority time-sensitive delivery documents although original signature original document paper image signature transmission electronic courts various jurisdictions decided enforceable electronic signatures include agreements made email entering personal identification number pin bank atm signing credit debit slip digital pen pad device application graphics tablet technology point sale installing software clickwrap software license agreement package signing electronic documents online first agreement signed electronically two sovereign nations joint communiqué recognizing growing importance promotion electronic commerce signed united states ireland 1998 1996 united nations published uncitral model law electronic commerce article 7 uncitral model law electronic commerce highly influential development electronic signature laws around world including us 2001 uncitral concluded work dedicated text uncitral model law electronic signatures adopted 30 jurisdictions latest uncitral text dealing electronic signatures article 9 paragraph 3 united nations convention use electronic communications international contracts 2005 establishes mechanism functional equivalence electronic handwritten signatures international level well cross-border recognition canadian law pipeda attempts clarify situation first defining generic electronic signature signature consists one letters characters numbers symbols digital form incorporated attached associated electronic document defining secure electronic signature electronic signature specific properties pipeda secure electronic signature regulations refine definition digital signature applied verified specific manner european union eu regulation 910/2014 electronic identification trust services electronic transactions european internal market eidas sets legal frame electronic signatures repeals directive 1999/93/ec current applicable version eidas published european parliament european council july 23 2014 following article 25 1 eidas regulation advanced electronic signature shall “ denied legal effect admissibility evidence legal proceedings however reach higher probative value enhanced level qualified electronic signature requiring use qualified electronic signature creation device based certificate issued qualified trust service provider upgraded advanced signature carries according article 25 2 eidas regulation legal value handwritten signature however regulated european union similarly zertes switzerland qualified electronic signature defined united states u.s. code defines electronic signature purpose us law electronic sound symbol process attached logically associated contract record executed adopted person intent sign record may electronic transmission document contains signature case facsimile transmissions may encoded message telegraphy using morse code united states definition qualifies electronic signature wide set uniform electronic transactions act ueta released national conference commissioners uniform state laws nccusl 1999 influenced aba committee white papers uniform law promulgated nccusl ueta term means electronic sound symbol process attached logically associated record executed adopted person intent sign record definition many core concepts ueta echoed u.s. esign act 2000 47 us states district columbia us virgin islands enacted ueta new york washington state illinois enacted ueta states adopted electronic signatures statute various laws passed internationally facilitate commerce use electronic records signatures interstate foreign commerce intent ensure validity legal effect contracts entered electronically instance digital signatures cryptographic implementations electronic signatures used proof authenticity data integrity non-repudiation communications conducted internet implemented compliance digital signature standards digital signing offer end-to-end privacy signing process user-friendly secure digital signatures generated verified standardized frameworks digital signature algorithm dsa nist compliance xades pades cades standards specified etsi typically three algorithms involved digital signature process process digital signing requires signature generated fixed message private key authenticated accompanied public key using cryptographic algorithms user ’ signature replicated without access private key secure channel typically required applying asymmetric cryptography methods digital signature process prevents several common attacks attacker attempts gain access following attack methods relevant standards digital signatures respect size domestic markets digital signature standard dss national institute standards technology nist eidas regulation enacted european parliament openpgp non-proprietary protocol email encryption public key cryptography supported pgp gnupg s/mime ietf standards evolved popular email encryption standard world electronic signature may also refer electronic forms processing verifying identity use biometric signatures biologically identifying qualities individual signatures use approach attaching biometric measurement hash said measurement document evidence instance fingerprints hand geometry finger lengths palm size iris patterns even retinal patterns collected using electronic sensors kind since physical characteristics claims uniqueness among humans extent useful signature biometric measurements type useless passwords ca n't changed compromised however might serviceable electronic signatures kind except date easily spoofable carry little assurance person purportedly signed document actually person unfortunately easily spoofable replay electronic signal produced submitted computer system responsible 'affixing signature document wiretapping techniques often suffice particular case fingerprints japanese professor graduate students managed spoof commercially available fingerprint readers available ordinary kitchen chemistry gummy bear candy gel little ingenuity actual fingers needed successfully spoof every reading device another example researchers vietnam successfully demonstrated late 2017 specially crafted mask could beat apple face id program iphone x | [
363,
7239,
6795,
2287,
4945,
3963,
3794,
2312,
4348,
5596,
5773,
6049,
2791,
6672,
2531,
359
] | Test |
1,038 | 3 | PDOS:pdos pdos discontinued multiuser multitasking operating system written assembly language developed early 1980s eyring research institute texas instruments tms9900 processor later ported motorola 68000 processor time speed accuracy power made ideal process control used system development education industrial uses eyring also sold application programs e.g statistics package operating system | [
5079,
336,
5571
] | Test |
1,039 | 3 | Application-specific_instruction_set_processor:application-specific instruction set processor application-specific instruction set processor asip component used system-on-a-chip design instruction set asip tailored benefit specific application specialization core provides tradeoff flexibility general purpose cpu performance asic asips configurable instruction set usually cores divided two parts static logic defines minimum isa instruction-set architecture configurable logic used design new instructions configurable logic programmed either field similar fashion field-programmable gate array fpga chip synthesis asips used alternative hardware accelerators baseband signal processing video coding traditional hardware accelerators applications suffer inflexibility difficult reuse hardware datapath handwritten finite-state machines fsm retargetable compilers asips help designer update program reuse datapath typically asip design less dependent tool flow designing processor scratch complicated commercial tools design asips example processor designer synopsys open source tool well tta-based co-design environment tce | [
5012,
1447,
5371,
3948,
7527,
7529,
5737,
2567,
4694,
5042,
1481,
5055,
2226,
1867,
2248,
6148,
441,
2266,
4047,
5483,
1556,
5487,
6198,
1568,
1570,
6922,
7666,
515,
8024,
5521,
3747,
1237,
6236,
534,
7314,
1252,
1254,
4847,
4479,
895,
... | Test |
1,040 | 4 | Demanufacturing:demanufacturing demanufacture process product extensive usage disassembled components components classified functionality components suitable reuse returned product reuse demanufacturing proposed used industries means reduce environmental footprint preserving economic viability processes involved term first coined professor walter w. olson professor john w. sutherland 1993 case waste electronics demanufacture involves dismantling components case material demanufacture may chemical process treatment waste plastics breaking long polymers smaller polymers | [
1021,
8061,
2029,
288
] | Test |
1,041 | 3 | Orthogonal_instruction_set:orthogonal instruction set computer engineering orthogonal instruction set instruction set architecture instruction types use addressing modes orthogonal sense instruction type addressing mode vary independently orthogonal instruction set impose limitation requires certain instruction use specific register little overlapping instruction functionality orthogonality considered major goal processor designers 1970s vax-11 often used benchmark concept however introduction risc design philosophies 1980s significantly reversed trend towards orthogonality modern cpus often simulate orthogonality pre-processing step performing actual tasks risc-like core core general purpose computers work underlying fashion data stored main memory read central processing unit cpu acted written back memory memory consists collection data values encoded numbers referred address also numerical value means operations applied data applied addresses worked data temporarily held processor registers scratchpad values accessed quickly registers used example adding strings numbers total early computers instruction set architecture isa often used single register case known accumulator instructions included address operand instance codice_1 instruction would cause cpu retrieve number memory found address add value already accumulator simple example isa one-address format instruction includes address data one-address machines disadvantage even simple actions like addition require multiple instructions takes scarce memory requires time read consider simple task adding two numbers 5 4 case program would load value 5 accumulator codice_2 instruction use codice_1 instruction pointing address 4 finally codice_4 store result 9 back another memory location improvements found providing address operands single instruction instance codice_5 two-address format isas common one extend concept three-address format codice_6 also folded expanded codice_7 often case basic computer word much larger needed hold instruction address systems leftover bits used hold constant instead address instructions improved allow one operands replaced constant instance codice_8 eliminates one memory cycle codice_9 another complexity arises one considers common patterns memory accessed one common pattern single operation may applied across large amount similar data instance one might want add 1,000 numbers simple two-address format way change address 1,000 additions written machine language isas fix problem concept indirect addressing address next point data constant held memory means programmer change address performing addition memory location isas also often include ability offset address initial location adding value held one registers cases special index register others carry addition automatically part instructions use variety addressing modes leads profusion slightly different instructions considering one-address isa even single instruction codice_10 many possible addressing modes immediate constant codice_11 adds constant value result accumulator direct address codice_12 add value stored address 1 memory indirect codice_13 read value address 1 use value another address add value many isas also registers used addressing well math tasks used one-address format single address register used case number new modes become available register direct codice_14 add value stored address held register one displacement codice_15 add constant address register add value found memory resulting location index codice_16 add value register 1 address register make new address adds value location accumulator autoindex codice_17 index case automatically increments address orthogonality principle every instruction able use supported addressing mode example direct addressing version codice_10 available others well reason design aesthetic goal reduce total size program object code providing variety addressing modes isa allows programmer chose one precisely matches need program point thereby reduce need use multiple instructions achieve end means total number instructions reduced saving memory improving performance orthogonality often described highly bit efficient ultimate end orthogonal design simply allow instruction use type address implementing orthogonality often simply case adding wiring parts processor however also adds complexity instruction decoder circuitry reads instruction memory location pointed program counter decides process example isa outlined codice_19 instruction using direct encoding already data needs run instruction processing needed decoder simply sends value arithmetic logic unit alu however codice_20 instruction used address read value memory location read alu continue series events take much longer complete requires internal steps result time needed complete different variations instruction vary widely adds complexity overall cpu design therefore orthogonality represents tradeoff design computer designer choose offer addressing modes programmer improve code density cost making cpu complex memory small expensive especially era drum memory core memory orthogonality highly desirable however complexity often beyond could achieved using current technology reason machines 1960s offered partial orthogonality much designers could afford 1970s introduction large scale integration significantly reduced complexity computer designs fully orthogonal designs began emerge 1980s designs could implemented single-chip cpu late 1970s first high-powered fully orthogonal designs emerging goal widened become high-level language computer architecture hllca short orthogonality desired improve bit density machine language hllca goal improve bit density high-level languages like algol 68 languages generally used activation record type complex stack stored temporary values isas generally directly support implemented using many individual instructions underlying isa adding support structures would allow program translated directly isa exception floating point instructions pdp-11 strongly orthogonal every integer instruction could operate either 1-byte 2-byte integers could access data stored registers stored part instruction stored memory stored memory pointed addresses registers even pc stack pointer could affected ordinary instructions using ordinary data modes mmediate mode hardcoded numbers within instruction add 4 r1 r1 r1 4 implemented mode register indirect autoincrement specifying program counter r7 register use reference indirection autoincrement since pdp-11 octal-oriented 3-bit sub-byte machine addressing modes 0–7 registers r0–r7 electronically 8 addressing modes use stack pointer r6 program counter r7 referenceable registers 10 conceptual addressing modes available vax-11 extended pdp-11 orthogonality data types including floating point numbers instructions 'add divided data-size dependent variants addb addw addl addp addf add byte word longword packed bcd single-precision floating point respectively like pdp-11 stack pointer program counter general register file r14 r15 general form vax-11 instruction would component one byte opcode value range 0–255 operand consisting two nibbles upper 4 bits specifying addressing mode lower 4 bits usually specifying register number r0–r15 unlike octal-oriented pdp-11 vax-11 hexadecimal-oriented machine 4-bit sub-byte resulted 16 logical addressing modes 0–15 however addressing modes 0–3 short immediate immediate data 6 bits less 2 low-order bits addressing mode 2 high-order bits immediate data prepended remaining 4 bits data-addressing byte since addressing modes 0-3 identical made 13 electronic addressing modes pdp-11 use stack pointer r14 program counter r15 created total 15 conceptual addressing modes assembler program translating source code actual stack-pointer program-counter based addressing mode needed motorola designers attempted make assembly language orthogonal underlying machine language somewhat less unlike pdp-11 mc68000 68k used separate registers store data addresses data memory isa orthogonal extent addresses could used registers restriction registers could used different instructions likewise data registers also orthogonal across instructions contrast ns320xx series originally designed single-chip implementations vax-11 isa although change due legal issues resulting system retained much vax-11 overall design philosophy remained completely orthogonal included elimination separate data address registers found 68k 8-bit intel 8080 well 8085 8051 microprocessor basically slightly extended accumulator-based design therefore orthogonal assembly-language programmer compiler writer mindful operations possible register 8-bit operations could performed 8-bit accumulator a-register 16-bit operations could performed 16-bit pointer/accumulator hl-register pair whereas simple operations increment possible seven 8-bit registers largely due desire keep opcodes one byte long binary-compatible z80 later added prefix-codes escape 1-byte limit allow powerful instruction set basic idea employed intel 8086 although allow radical extensions binary -compatibility 8080 attempted maintained degree non-orthogonality sake high code density time 32-bit extension architecture introduced 80386 somewhat orthogonal despite keeping 8086 instructions extended counterparts however encoding-strategy used still shows many traces 8008 8080 z80 instance single-byte encodings remain certain frequent operations push pop registers constants primary accumulator eax register employs shorter encodings registers certain types operations observations like sometimes exploited code optimization compilers hand written code number studies 1970s demonstrated flexibility offered orthogonal modes rarely never used actual problems particular effort ibm studied traces code running system/370 demonstrated fraction available modes used actual programs similar studies often vax demonstrated pattern cases shown complexity instructions meant took longer perform sequence smaller instructions canonical example vax codice_21 instruction period semiconductor memories rapidly increasing size decreasing cost however improving speed rate meant time needed access data memory growing relative terms comparison speed cpus argued inclusion registers giving cpu temporary values work larger number registers meant bits computer word would needed encode register number suggested instructions reduced number free room finally paper andrew tanenbaum demonstrated 97 constants program 0 10 0 representing 20 30 total additionally 30 40 values program constants simple variables opposed arrays another 35 40 processor uses larger instruction word like 32-bits two constants register number encoded single instruction long instruction use many bits observations led abandonment orthogonal design primary goal processor design rise risc philosophy 1980s risc processors generally two addressing modes direct constant register modes found older processors handled explicitly using load store instructions moving data registers addressing modes may available modes may vary depending whether instruction refers data involves transfer control | [
708,
5012,
1447,
5371,
3948,
7527,
7529,
5737,
7541,
2567,
4694,
5042,
1481,
5055,
1867,
5079,
2248,
6148,
2266,
4047,
5483,
1556,
5487,
7990,
6198,
6922,
7666,
515,
8024,
5521,
3747,
1237,
1252,
1254,
4847,
4479,
8066,
1640,
4864,
216,
... | Validation |
1,042 | 3 | K_computer:k computer k computer named japanese word/numeral meaning 10 quadrillion 10 supercomputer manufactured fujitsu currently installed riken advanced institute computational science campus kobe hyōgo prefecture japan k computer based distributed memory architecture 80,000 compute nodes used variety applications including climate research disaster prevention medical research k computer operating system based linux kernel additional drivers designed make use computer hardware june 2011 top500 ranked k world fastest supercomputer computation speed 8 petaflops november 2011 k became first computer top 10 petaflops originally slated completion june 2012 june 2012 k superseded world fastest supercomputer american ibm sequoia k world 20th-fastest computer ibm summit sierra fastest supercomputers k computer holds third place hpcg benchmark held first place june 2018 superseded summit sierra 20 june 2011 top500 project committee announced k set linpack record performance 8.162 petaflops making fastest supercomputer world time achieved performance computing efficiency ratio 93.0 previous record holder chinese national university defense technology tianhe-1a performed 2.507 petaflops top500 list revised semiannually rankings change frequently indicating speed computing power increasing november 2011 riken reported k become first supercomputer exceed 10 petaflops achieving linpack performance 10.51 quadrillion computations per second computing efficiency ratio 93.2 k received top ranking four performance benchmarks 2011 hpc challenge awards 18 june 2012 top500 project committee announced california-based ibm sequoia supercomputer replaced k world fastest supercomputer linpack performance 16.325 petaflops sequoia 55 faster k using 123 cpu processors also 150 energy efficient top500 list became first june 2011 falling time lower positions eighteenth november 2018 k computer holds third place hpcg benchmark test proposed jack dongarra 0.6027 hpcg pflops november 2018 k computer comprises 88,128 2.0 ghz eight-core sparc64 viiifx processors contained 864 cabinets total 705,024 cores manufactured fujitsu 45 nm cmos technology cabinet contains 96 computing nodes addition six i/o nodes computing node contains single processor 16 gb memory computer water cooling system designed minimize failure rate power consumption nodes interconnected fujitsu proprietary torus fusion tofu interconnect tofu six-dimensional mesh/torus topology scalability 100,000 nodes full-duplex links peak bandwidth 10 gb/s 5 gb/s per direction node connected interconnect controller icc chip contains four tofu interfaces one node three connecting icc chips router tofu six-dimensional mesh/torus topology abstracted software appear three-dimensional torus supported tofu-optimized version open-source open mpi message passing interface library users create application programs adapted either one- two- three-dimensional torus network system adopts two-level local/global file system parallel/distributed functions provides users automatic staging function moving files global local file systems fujitsu developed optimized parallel file system based lustre called fujitsu exabyte file system fefs scalable several hundred petabytes although k computer reported highest total power consumption 2011 top500 supercomputer 9.89 mw equivalent almost 10,000 suburban homes relatively efficient achieving 824.6 gflop/kw 29.8 efficient china nudt th mpp ranked 2 2011 225.8 efficient oak ridge jaguar-cray xt5-he ranked 3 2011 however k power efficiency still falls far short 2097.2 gflops/kwatt supercomputer record set ibm nnsa/sc blue gene/q prototype 2 comparison average power consumption top 10 system 2011 4.3 mw average efficiency 463.7 gflop/kw according top500 compiler jack dongarra professor electrical engineering computer science university tennessee k computer performance equals one million linked desktop computers computer annual running costs estimated us 10 million 1 july 2011 kobe port island line rapid transit system renamed one stations port island minami k computer mae meaning front k computer denoting vicinity | [
6987,
6806,
1185,
5571,
7180,
4783,
7453,
578,
1023,
1295,
1678,
2433,
1237,
971
] | Test |
1,043 | 4 | Careto_(malware):careto malware careto spanish mask sometimes called mask piece espionage malware discovered kaspersky lab 2014 high level sophistication professionalism target list included diplomatic offices embassies careto believed work nation state kaspersky believes creators malware spanish-speaking focus spanish-speaking victims heavy targeting morocco targeting gibraltar bruce schneier speculates careto operated spain careto normally installs second complex backdoor program called sgh sgh easily modifiable also wider arsenal including ability intercept system events file operations performing wider range surveillance features information gathered sgh careto include encryption keys virtual private network configurations ssh keys communication channels careto hard discover remove use stealth capabilities addition samples digitally signed signatures issued bulgarian company tecsystem ltd. authenticity company unknown one issued certificates valid june 28 2011 june 28 2013 another valid april 18 2013 july 18 2016 revoked verisign careto discovered made attempts circumvent kaspersky security products upon discovery careto trying exploit software kaspersky started investigate part collecting statistics multiple sinkholes placed command control servers currently up-to-date antivirus software discover successfully remove malware investigation command control servers discoveries showed 380 victims infected information uncovered victims infected malware clicking spear phishing link redirected websites software careto could exploit adobe flash player player since patched longer exploitable careto websites contained exploitable software names similar popular newspapers washington post independent malware said multiple backdoors linux mac os x windows evidence possible fourth type backdoor android ios discovered c c servers samples found estimated careto compiled far back 2007 known attacks ceased january 2014 | [
704,
3932,
6795,
2912,
376,
3277,
2923,
2566,
5401,
2587,
3323,
5779,
7214,
74,
4014,
7600,
5452,
4025,
1528,
2991,
1173,
6526,
6179,
6904,
6541,
6194,
2678,
3038,
3047,
6569,
2693,
862,
7307,
6589,
5187,
1996,
7328,
907,
208,
2021,
592... | Train |
1,044 | 2 | Linux_Network_Administrator's_Guide:linux network administrator guide linux network administrator guide nag book setting running unix networks first second editions freely available electronic form gfdl originally produced olaf kirch others part linux documentation project help o'reilly second edition terry dawson released march 2000 third edition guide written tony bautts assistance gregor n. purdy february 2005 freely available like previous two versions includes following sections | [
5540,
5453,
5803,
3174,
2281,
1535,
1260,
7528,
1176,
2559,
6725,
578,
6736,
7555,
3559,
1227,
5880
] | Test |
1,045 | 7 | Cycle_Computing:cycle computing cycle computing company provides software orchestrating computing storage resources cloud environments flagship product cyclecloud supports amazon web services google compute engine microsoft azure internal infrastructure cyclecloud orchestration suite manages provisioning cloud infrastructure orchestration workflow execution job queue management automated efficient data placement full process monitoring logging within secure process flow cycle computing founded 2005 original offerings based around htcondor scheduler focused maximizing effectiveness internal resources cycle computing offered support htcondor well cycleserver provided metascheduling reporting management tools htcondor resources early customers spanned number industries including insurance pharmaceutical manufacturing academia advent large public cloud offerings cycle computing expanded tools allow customers make use dynamically provisioned cloud environments key technologies developed include ability validate resources correctly added cloud patent awarded 2015 ability easily manage data placement consistency ability support multiple cloud providers within single workflow technologies august 15 2017 microsoft announced acquisition cycle computing april 2011 cycle computing announced “ tanuki ” 10,000 core amazon web services cluster used genentech september 2011 cycle computing hpc cluster called nekomata japanese monster cat renting 1279/hour offering 30,472 processor cores 27tb memory 2pb storage unnamed pharmaceutical company used cluster 7 hours paying 9000 molecular modeling task april 2012 cycle computing announced working collaboration scientific software-writing company schrödinger screened 21 million compounds less three hours using 50,000-core cluster november 2013 cycle computing announced working collaboration scientific software-writing company schrödinger helped mark thompson professor chemistry university southern california sort 205,000 compounds search right compound build new generation inexpensive highly efficient solar panels job took less day cost 33,000 total computing cluster used 156,000 cores spread across 8 regions peak capacity 1.21 petaflops november 2014 cycle computing worked researcher hgst run hard drive simulation workload computation would taken month internal resources completed 7 hours running 70,000 cores amazon web services cost less 6,000 september 2015 cycle computing broad institute announced 50,000 core cluster run google compute engine cycle computing covered gigaom ars technica extremetech cnet phys.org cycle computing also mentioned amazon cto werner vogels 2013 day 2 keynote aws invent | [
2961,
5064,
1878
] | Test |
1,046 | 2 | Unix/NS:unix/ns unix/ns ncr 3700 operating system based unix svr4 contains significant extensions massively parallel systems particular distributed memory dbmss extensions include concepts virtual processor virtual disk message global synchronization system segment system globally distributed objects compared parallel unix operating systems like mach chorus unix/ns powerful communication message addressing paradigm richer process-group management global synchronization mechanism | [
4751,
5275,
4478,
900,
2467,
2294,
5571,
2300,
2118,
6360,
578,
5232,
6367,
4447,
3751,
443
] | Validation |
1,047 | 6 | File_system_permissions:file system permissions file systems methods assign permissions access rights specific users groups users permissions control ability users view change navigate execute contents file system two types permissions widely used traditional unix permissions date back many decades earliest days unix universally available unix linux derived platforms access control lists acls recent origin universally used microsoft windows based file systems file system supports user permissions mainly ntfs refs also commonly used widely available common unix linux based systems although necessarily generally capable far detailed fine-tuning permissions traditional unix permissions permit system access control traditional acls provide unix linux based systems standard type acl defined posix standard posix acls variants exist nfs v3 v4 acls work slightly differently nfsv3 acls nfsv4 acls multiple systems available within operating system usually way specify used given file system system handle attempts access modify permissions controlled one using commands designed another usual solution ensure least degree awareness inter-operability different commands methods unix-like otherwise posix-compliant systems including linux-based systems macos versions simple system managing individual file permissions article called traditional unix permissions systems also support kind access control lists acls either proprietary old hp-ux acls example posix.1e acls based early posix draft withdrawn 1997 nfsv4 acls part nfsv4 standard microsoft ibm dos variants including ms-dos pc dos windows 95 windows 98 windows 98 se windows permissions file attributes read-only attribute r set unset file user program therefore prevent anyone changing/deleting file permission systems would prevent user reading file ms-dos/pc dos-compatible operating systems dr dos 3.31 higher palmdos novell dos opendos flexos 4680 os 4690 os concurrent dos multiuser dos datapac system manager ims real/32 support read/write/execute/delete file/directory access permissions fat volumes exception flexos 4680 os 4690 os operating systems also support individual file/directory passwords operating systems except dr dos palmdos novell dos opendos also support three independent file/directory ownership classes world/group/owner whereas single-user operating systems dr dos 6.0 higher palmdos novell dos opendos support optional multi-user security module security.bin loaded openvms a.k.a vms well microsoft windows nt derivatives including windows 2000 windows xp use acls administer complex varied set permissions openvms also uses permission scheme similar unix complex four categories system owner group world four types access permissions read write execute delete categories mutually disjoint world includes group turn includes owner system category independently includes system users similar superusers unix classic mac os operating systems hfs support permissions file attributes hidden show directory listings locked read-only name locked renamed stationery copy-on-write amigaos filesystem amigados supports relatively advanced permissions system single-user os amigaos 1.x files archive read write execute delete collectively known arwed permissions/flags amigaos 2.x higher additional hold script pure permissions/flags added mac os x versions 10.3 panther prior use posix-compliant permissions mac os x beginning version 10.4 tiger also support use nfsv4 acls still support traditional unix permissions used previous versions mac os x apple mac os x server version 10.4+ file services administration manual recommends using traditional unix permissions possible also still supports mac os classic protected attribute solaris acl support depends filesystem used older ufs filesystem supports posix.1e acls zfs supports nfsv4 acls linux supports posix.1e acls experimental support nfsv4 acls ext3 filesystem ext4 filesystem freebsd supports posix.1e acls ufs nfsv4 acls ufs zfs ibm z/os implements file security via racf resource access control facility permissions unix-like systems managed three distinct scopes classes scopes known user group others file created unix-like system permissions restricted umask process created files directories owned user owner determines file user class distinct permissions apply owner files directories assigned group define file group class distinct permissions apply members file group owner may member file group users owner member group comprise file others class distinct permissions apply others effective permissions determined based first class user falls within order user group others example user owner file permissions given user class regardless permissions assigned group class others class unix-like systems implement three specific permissions apply class effect setting permissions directory rather file one frequently misunderstood file permission issues permission set corresponding rights denied unlike acl-based systems permissions unix-like systems inherited files created within directory necessarily permissions directory unix-like systems typically employ three additional modes actually attributes referred permissions modes special modes file directory overall class though symbolic notation see setuid bit set triad user setgid bit set triad group sticky bit set triad others additional modes also referred setuid bit setgid bit sticky bit due fact occupy one bit unix permissions represented either symbolic notation octal notation common form used command codice_1 symbolic notation first character codice_2 display indicates file type related permissions remaining nine characters three sets representing class permissions three characters first set represents user class second set represents group class third set represents others class three characters represent read write execute permissions following examples symbolic notation permission systems additional symbols codice_1 display represent additional permission features represent setuid setgid sticky text attributes executable character x '- modified though attributes affect overall file users one class setuid attribute modifies executable character triad user setgid attribute modifies executable character triad group sticky text attribute modifies executable character triad others setuid setgid attributes first second triad x becomes '- becomes sticky text attribute third triad x becomes 't '- becomes 't example another method representing unix permissions octal base-8 notation shown codice_14 notation consists least three digits three rightmost digits represents different component permissions owner group others fourth digit present leftmost high-order digit addresses three additional attributes setuid bit setgid bit sticky bit digits sum component bits binary numeral system result specific bits add sum represented numeral values never produce ambiguous combinations sum represents specific set permissions technically octal representation bit field – bit references separate permission grouping 3 bits time octal corresponds grouping permissions user group others examples symbolic notation section given octal notation systems diverge traditional posix-model users groups creating new group – user private group – user assuming user member user private group scheme allows umask 002 used without allowing users write newly created files normal directories files assigned creating user private group however sharing files desirable administrator create group containing desired users create group-writable directory assigned new group importantly make directory setgid making setgid cause files created assigned group directory 002 umask enabled using user private groups ensure members group able write files | [
3599,
1438,
3932,
2547,
7161,
4672,
382,
6431,
3626,
5049,
3638,
5401,
405,
6117,
759,
429,
3664,
5783,
6854,
5437,
5785,
6857,
4375,
6500,
5449,
6505,
3685,
5457,
4759,
460,
1534,
5814,
7976,
4771,
4406,
821,
7258,
5130,
5833,
1561,
58... | Test |
1,048 | 3 | CodeXL:codexl codexl formerly amd codexl open-source software development tool suite includes gpu debugger gpu profiler cpu profiler graphics frame analyzer static shader/kernel analyzer codexl mainly developed amd version 2.0 codexl made part gpuopen free open-source software subject requirements mit license longer branded amd product cpu profiler power profiler included codexl version 2.5 profilers released part amd uprof tool codexl gpu debugger allows engineers debug opengl opencl api calls runtime objects debug opencl kernels set breakpoints step source code real-time view variables across different gpu cores kernel execution identify logic memory errors reduce memory transaction overhead visualize opencl/opengl buffers images opengl textures pictures spreadsheet data way improve general software quality optimize performance codexl gpu profiler collects visualizes hardware performance counters data application trace kernel occupancy offers hotspot analysis amd gpus apus profiler gathers data opencl runtime gpu/apu execution kernels used discover performance bottlenecks optimize kernel execution codexl cpu profiling suite used identify investigate improve performance applications drivers system software amd cpus codexl cpu profiler uses statistical sampling based approach various profiling techniques measures time-based profiling tbp event-based profiling ebp instruction-based sampling ibs cpu hardware performance monitors codexl cpu profiler replaces amd codeanalyst codexl static kernel analyzer allows engineers compile analyze disassemble code directx opengl vulkan shaders opencl kernels tool provides performance estimation shader/kernel different kinds amd chips without actually executing code way tool assists fine-tuning achieve best performance amd gpus q1 2017 amd codexl analyzer replaced radeon gpu analyzer rga maintaining backward compatibility radeon gpu analyzer cli offline compiler performance analysis tool directx shaders opengl shaders vulkan shaders opencl kernels version 2.0 codexl hsa profiler hsail kernel debugger support boltzmann initiative driver gcn 1.2 hardware i.e radeon r9 fury fury x fury nano carrizo apus frame analyzer collect display frame timeline applications use microsoft directx 12 vulkan analyzer view lists api call made cpu side corresponding command executed gpu side inter-linked unified timeline view well aggregated statistics user-selected specific time fragment – cumulative time type api number calls 20 longest calls codexl officially supports linux microsoft windows operating systems windows codexl available standalone application fully integrated microsoft visual studio extension codexl successfully used debug bullet latest version codexl freely available download codexl github releases page gpu perfstudio amd performance debugging tool graphics applications initially developed support direct3d opengl microsoft windows ported linux 2013 available linux since end q1 2014 suite tools considered useful developing games steam linux especially useful optimizing games amd gpus gpu perfstudio integrated frame profiles frame debugger api trace cpu timing information gpu perfstudio supports direct3d 10 direct3d 10.1 direct3d 11 opengl 4.2 described lightweight installer change game drag drop suite gpu tools run usb drive need visual studio integration runs game executables require special driver new compilation gpu perfstudio 3.6 supports direct3d 12 windows 10 vulkan windows linux gpu perfstudio available linux microsoft windows amd developer summit apu november 2013 gordon selley presented gpu perfstudio 2 steamdevdays february 2014 tony hosier gordon selley presented gpu perfstudio 2 43 minutes video gpuperfapi amd library accessing gpu performance counters amd radeon graphics cards apus used gpu perfstudio codexl also available third party developers wish incorporate within applications gpuperfapi supports directx11 opengl opencl applications gpuperfapi available linux microsoft windows | [
2016,
2539,
1023,
4759,
2078,
5571,
4694,
578,
8022,
7782,
1435,
2085
] | Test |
1,049 | 4 | Logical_security:logical security logical security consists software safeguards organization ’ systems including user identification password access authenticating access rights authority levels measures ensure authorized users able perform actions access information network workstation subset computer security elements logical security token authentication comprises small devices authorized users computer systems networks carry assist identifying logging computer network system actually authorized also store cryptographic keys biometric data popular type security token rsa securid displays number changes every minute users authenticated entering personal identification number number token token contains time day clock unique seed value number displayed cryptographic hash seed value time day computer accessed also contains algorithm able match number matching user ’ seed time day clock error taken account values minutes sometimes accepted another similar type token cryptogram produce value time button pressed security tokens connect directly computer usb smart card bluetooth ports special purpose interfaces cell phones pda also used security tokens proper programming password authentication uses secret data control access particular resource usually user attempting access network computer computer program queried whether know password granted denied access accordingly passwords either created user assigned similar usernames however assigned password user usually given option change password something his/her choice depending restrictions system network user may change his/her password alphanumeric sequence usually limitations password creation include length restrictions requirement number uppercase letter special character able use past four five changed passwords associated username addition system may force user change his/her password given amount time two-way authentication involves user system network convincing know shared password without transmitting password communication channel done using password encryption key transmit randomly generated piece information “ challenge. ” side must return similarly encrypted value predetermined function originally offered information his/her “ response ” proves he/she able decrypt challenge kerberos computer network authentication protocol good example sends encrypted integer n response must encrypted integer n 1 access rights authority levels rights power granted users create change delete view data files within system network rights vary user user range anonymous login guest privileges superuser root privileges guest superuser accounts two extremes individual access rights denied granted user usually system administrator a.k.a superuser ability grant deny rights guest accounts anonymous logins set multiple users log account time without password users sometimes asked type username account limited access often allowed access special public files usually anonymous accounts read access rights security purposes superuser authority level assigned system administrators computer operating systems unix related operating systems level also called root access rights system including changing ownership files pre-windows xp nt systems dos windows 9x users effectively superusers users access rights windows nt related systems windows 2000 xp superuser known administrator account however administrator account may may exist depending whether separation | [
7818,
4261,
3794,
1805,
7120
] | Validation |
1,050 | 3 | Cooperative_Linux:cooperative linux cooperative linux abbreviated colinux software allows microsoft windows linux kernel run simultaneously parallel machine cooperative linux utilizes concept cooperative virtual machine cvm contrast traditional virtual machines cvm shares resources already exist host os traditional vm hosts resources virtualized every guest os cvm gives oss complete control host machine traditional vm sets every guest os unprivileged state access real machine term cooperative used describe two entities working parallel effect cooperative linux turns two different operating system kernels two big coroutines kernel complete cpu context address space kernel decides give control back partner however kernels theoretically full access real hardware modern pc hardware designed controlled two different operating systems time therefore host kernel left control real hardware guest kernel contains special drivers communicate host provide various important devices guest os host os kernel exports basic primitives allow cooperative linux portable driver run cpl0 mode ring 0 allocate memory dan aloni originally started development cooperative linux based similar work user-mode linux announced development 25 jan 2004 july 2004 presented paper linux symposium source released gnu general public license developers since contributed various patches additions software cooperative linux significantly different full x86 virtualization generally works running guest os less privileged mode host kernel resources delegated host kernel contrast cooperative linux runs specially modified linux kernel cooperative takes responsibility sharing resources nt kernel instigating race conditions changes cooperative linux patch i386 tree—the supported architecture cooperative time writing changes mostly additions virtual drivers cobd block device conet network cocon console changes i386 tree involve initialization setup code goal cooperative linux kernel design remain close possible standalone i386 kernel changes localized minimized much possible colinux package installs port linux kernel virtual network device run simultaneously version windows operating system windows 2000 windows xp use virtual machine vmware debian ubuntu fedora gentoo especially popular colinux users due rather unusual structure virtual hardware installing linux distributions colinux generally difficult therefore users cases use either existing linux installation real partition ready made filesystem image distributed project filesystem images made variety methods including taking images normal linux system finding ways make installers run strange hardware building installs hand using package manager simply upgrading existing images using tools like yum apt easier way get up-to-date filesystem image use qemu install linux convert image stripping first 63 512-byte blocks described colinux wiki since colinux access native graphics hardware x window x servers run colinux directly one install x server windows cygwin/x xming use kde gnome almost linux application distribution issues fixed using colinux based distributions andlinux based ubuntu topologilinux based slackware | [
4293,
3256,
4295,
2182,
3613,
7528,
7532,
5744,
6443,
5396,
2581,
2942,
3978,
6117,
4341,
5762,
412,
5064,
415,
7581,
3666,
2970,
7956,
5453,
4759,
5460,
7242,
1535,
1924,
6892,
1176,
1933,
1547,
5829,
1208,
6211,
4435,
5865,
7669,
3404,
... | Test |
1,051 | 8 | Google_Tag_Manager:google tag manager google tag manager tag management system created google manage javascript html tags used tracking analytics websites variants e-marketing tags sometimes referred tracking pixels web beacons google announced google tag manager october 2012 version 1 tag manager launched following default tag templates version 2 launched october 2014 making product cleaner simpler use google also announced tag manager api release version 2 | [
2451
] | Train |
1,052 | 2 | BIOS:bios bios acronym basic input/output system also known system bios rom bios pc bios non-volatile firmware used perform hardware initialization booting process power-on startup provide runtime services operating systems programs bios firmware comes pre-installed personal computer system board first software run powered name originates basic input/output system used cp/m operating system 1975 bios originally proprietary ibm pc reverse engineered companies looking create compatible systems interface original system serves de facto standard bios modern pcs initializes tests system hardware components loads boot loader mass memory device initializes operating system era dos bios provided hardware abstraction layer keyboard display input/output i/o devices standardized interface application programs operating system recent operating systems use bios loading instead accessing hardware components directly bios implementations specifically designed work particular computer motherboard model interfacing various devices make complementary system chipset originally bios firmware stored rom chip pc motherboard modern computer systems bios contents stored flash memory rewritten without removing chip motherboard allows easy end-user updates bios firmware new features added bugs fixed also creates possibility computer become infected bios rootkits furthermore bios upgrade fails brick motherboard permanently unless system includes form backup case unified extensible firmware interface uefi successor legacy pc bios aiming address technical shortcomings term bios basic input/output system created gary kildall first appeared cp/m operating system 1975 describing machine-specific part cp/m loaded boot time interfaces directly hardware cp/m machine usually simple boot loader rom versions ms-dos pc dos dr-dos contain file called variously io.sys ibmbio.com ibmbio.sys drbios.sys file known dos bios also known dos i/o system contains lower-level hardware-specific part operating system together underlying hardware-specific operating system-independent system bios resides rom represents analogue cp/m bios introduction ps/2 machines ibm divided system bios real- protected-mode portions real-mode portion meant provide backward compatibility existing operating systems dos therefore named cbios compatibility bios whereas abios advanced bios provided new interfaces specifically suited multitasking operating systems os/2 bios original ibm pc xt interactive user interface error codes messages displayed screen coded series sounds generated signal errors power-on self-test post proceeded point successfully initializing video display adapter options ibm pc xt set switches jumpers main board expansion cards starting around mid-1990s became typical bios rom include bios configuration utility bcu bios setup utility accessed system power-up particular key sequence program allowed user set system configuration options type formerly set using dip switches interactive menu system controlled keyboard interim period ibm-compatible pcsincluding ibm atheld configuration settings battery-backed ram used bootable configuration program disk rom set configuration options contained memory disk supplied computer lost system settings could changed applied general computers eisa bus configuration program called eisa configuration utility ecu modern wintel-compatible computer provides setup routine essentially unchanged nature rom-resident bios setup utilities late 1990s user configure hardware options using keyboard video display also errors occur boot time modern bios usually displays user-friendly error messages often presented pop-up boxes tui style offers enter bios setup utility ignore error proceed possible instead battery-backed ram modern wintel machine may store bios configuration settings flash rom perhaps flash rom holds bios early intel processors started physical address 000ffff0h systems later processors provide logic start running bios system rom system powered reset button pressed cold boot full power-on self-test post run ctrl+alt+delete pressed warm boot special flag value stored nonvolatile bios memory cmos tested bios allows bypass lengthy post memory detection post identifies initializes system devices cpu ram interrupt dma controllers parts chipset video display card keyboard hard disk drive optical disc drive basic hardware early ibm pcs routine post would download program ram keyboard port run feature intended factory test diagnostic purposes option rom scan completed detected rom modules valid checksums called immediately post bios version scan option roms bios calls int 19h start boot processing post-boot programs loaded also call int 19h reboot system must careful disable interrupts asynchronous hardware processes may interfere bios rebooting process else system may hang crash rebooting int 19h called bios attempts locate boot loader software boot device hard disk floppy disk cd dvd loads executes first boot software finds giving control pc bios uses boot devices set eeprom cmos ram earliest pcs dip switches bios checks device order see bootable attempting load first sector boot sector sector read bios proceeds next device sector read successfully bioses also check boot sector signature 0x55 0xaa last two bytes sector 512 bytes long accepting boot sector considering device bootable bootable device found bios transfers control loaded sector bios interpret contents boot sector possibly check boot sector signature last two bytes interpretation data structures like partition tables bios parameter blocks done boot program boot sector programs loaded boot process non-disk device network adapter attempts booting procedure defined option rom equivalent integrated motherboard bios rom option roms may also influence supplant boot process defined motherboard bios rom user select boot priority implemented bios example computers hard disk bootable usually removable-media drive higher boot priority user cause removable disk booted modern bioses boot priority order configured user older bioses limited boot priority options selectable earliest bioses fixed priority scheme implemented floppy disk drives first fixed disks i.e hard disks second typically boot devices supported subject modification rules installed option roms bios early pc also usually would boot first floppy disk drive first hard disk drive even two drives installed el torito optical media boot standard optical drive actually emulates 3.5 high-density floppy disk bios boot purposes reading first sector cd-rom dvd-rom simply defined operation like floppy disk hard disk furthermore complexity medium makes difficult write useful boot program one sector bootable virtual floppy disk contain software provides access optical medium native format original ibm pc xt bootable disk found rom basic started calling int 18h since programs used basic rom clone pc makers left computer failed boot disk would display rom basic halt response int 18h later computers would display message like bootable disk found would prompt disk inserted key pressed retry boot process modern bios may display nothing may automatically enter bios configuration utility boot process fails environment boot program simple cpu real mode general-purpose segment registers undefined except cs ss sp dl cs always zero ip initially codice_1 boot programs always loaded fixed address need boot program relocatable dl may contain drive number used int 13h boot device ss sp points valid stack presumably large enough support hardware interrupts otherwise ss sp undefined stack must already set order interrupts serviced interrupts must enabled order system timer-tick interrupt bios always uses least maintain time-of-day count initializes post active keyboard work keyboard works even bios keyboard service called keystrokes received placed 15-character type-ahead buffer maintained bios boot program must set stack size stack set bios unknown location likewise variable although boot program investigate default stack examining ss sp easier shorter unconditionally set new stack boot time bios services available memory address codice_2 contains interrupt vector table bios post initialized system timers interrupt controller dma controller motherboard/chipset hardware necessary bring bios services ready status dram refresh system dram conventional memory extended memory necessarily expanded memory set running interrupt vectors corresponding bios interrupts set point appropriate entry points bios hardware interrupt vectors devices initialized bios set point bios-provided isrs interrupts including ones bios generates programs hook set default dummy isr immediately returns bios maintains reserved block system ram addresses codice_3 various parameters initialized post memory address codice_4 used boot program may even overwrite peripheral cards hard disk drive controllers video display adapters bios extension option roms provide additional functionality bios code extensions runs bios boots system mass storage roms typically test initialize hardware add new bios services augment replace existing bios services versions services example scsi controller usually bios extension rom adds support hard drives connected controller video cards extension roms replace video services motherboard bios video services bios extension roms gain total control machine fact anything may never return control bios invoked extension rom could principle contain entire operating system application program could implement entirely different boot process booting network operation ibm-compatible computer system completely changed removing inserting adapter card rom chip contains bios extension rom motherboard bios typically contains code access hardware components necessary bootstrapping system keyboard display storage addition plug-in adapter cards scsi raid network interface cards video boards often include bios e.g video bios complementing replacing system bios code given component even devices built motherboard behave way option roms stored separate code main bios flash chip upgraded either tandem separately main bios add-in card requires option rom card supported main bios card needs initialized made accessible bios services operating system loaded usually means required bootstrapping process even required option rom allow adapter card used without loading driver software storage device booting begins option rom time taken load driver driver take space ram hard disk driver software rom always stays device two accidentally separated also rom card peripheral hardware driver software provided rom installed together extra effort install software additional advantage rom early pc systems notably including ibm pcjr rom faster main system ram modern systems case much reverse bios rom code usually copied shadowed ram run faster many methods utilities examining contents various motherboard bios expansion roms microsoft debug unix dd expansion rom wishes change way system boots network device scsi adapter bios driver code cooperative way use bios boot specification bbs api register ability expansion roms registered using bbs apis user select among available boot options within bios user interface bbs compliant pc bios implementations allow user enter bios user interface expansion roms finished executing registering bbs api specification downloaded acpica website official title bios boot specification version 1.01 11 january 1996 also expansion rom wishes change way system boots unilaterally simply hook int 19h interrupts normally called interrupt 19h int 13h bios disk service intercept bios boot process replace bios boot process one merely modify boot sequence inserting boot actions preventing bios detecting certain devices bootable bios boot specification promulgated way expansion roms implement boot capability devices supported booting native bios motherboard motherboard bios completes post bios versions search option rom modules also called bios extension roms execute motherboard bios scans extension roms portion upper memory area part x86 real-mode address space address 0xa0000 runs rom found order discover memory-mapped isa option roms bios implementation scans real-mode address space codice_5 codice_6 2 kib boundaries looking two-byte rom signature 0x55 followed 0xaa valid expansion rom signature followed single byte indicating number 512-byte blocks expansion rom occupies real memory next byte option rom entry point also known entry offset checksum specified number 512-byte blocks calculated rom valid checksum bios transfers control entry address normal bios extension rom beginning extension initialization routine point extension rom code takes typically testing initializing hardware controls registering interrupt vectors use post-boot applications may use bios services including provided previously initialized option roms provide user configuration interface display diagnostic information anything else requires possible option rom return bios pre-empting bios boot sequence altogether option rom normally return bios completing initialization process option rom returns bios continues searching option roms calling found entire option rom area memory space scanned option roms normally reside adapter cards however original pc perhaps also pc xt spare rom socket motherboard system board ibm terms option rom inserted four roms contain basic interpreter also removed replaced custom roms option roms ibm pcjr unique among pcs two rom cartridge slots front cartridges slots map region upper memory area used option roms cartridges contain option rom modules bios would recognize cartridges also contain types rom modules basic programs handled differently one pcjr cartridge contain several rom modules different types possibly stored together one rom chip bios rom customized particular manufacturer hardware allowing low-level services reading keystroke writing sector data diskette provided standardized way programs including operating systems example ibm pc might either monochrome color display adapter using different display memory addresses hardware single standard bios system call may invoked display character specified position screen text mode graphics mode bios provides small library basic input/output functions operate peripherals keyboard rudimentary text graphics display functions forth using ms-dos bios services could accessed application program ms-dos executing int 13h interrupt instruction access disk functions executing one number documented bios interrupt calls access video display keyboard cassette device functions operating systems executive software designed supersede basic firmware functionality provide replacement software interfaces application software applications also provide services began even 1980s ms-dos programmers observed using bios video services graphics display slow increase speed screen output many programs bypassed bios programmed video display hardware directly graphics programmers particularly exclusively demoscene observed technical capabilities pc display adapters supported ibm bios could taken advantage without circumventing since at-compatible bios ran intel real mode operating systems ran protected mode 286 later processors required hardware device drivers compatible protected mode operation replace bios services modern personal computers running modern operating systems bios used booting initial loading system software operating system first graphical screen displayed input output typically handled bios boot menu textual menu windows allows users choose operating system boot boot safe mode use last known good configuration displayed bios receives keyboard input bios modern pcs still boot run legacy operating systems ms-dos dr-dos rely heavily bios console disk i/o providing system bios bios-compatible firmware necessarily case uefi-based pcs intel processors reprogrammable microcode since p6 microarchitecture bios may contain patches processor microcode fix errors initial processor microcode reprogramming persistent thus loading microcode updates performed time system powered without reprogrammable microcode expensive processor swap would required example pentium fdiv bug became expensive fiasco intel required product recall original pentium processor defective microcode could reprogrammed bioses contain software licensing description table slic digital signature placed inside bios original equipment manufacturer oem example dell slic inserted acpi table contains active code computer manufacturers distribute oem versions microsoft windows microsoft application software use slic authenticate licensing oem windows installation disk system recovery disc containing windows software systems slic preactivated oem product key verify xml formatted oem certificate slic bios means self-activating see system locked preinstallation slp user performs fresh install windows need possession oem key either slp coa digital certificate slic order bypass activation achieved user performs restore using pre-customised image provided oem power users copy necessary certificate files oem image decode slp product key perform slp activation manually cracks non-genuine windows distributions usually edit slic emulate order bypass windows activation bios implementations allow overclocking action cpu adjusted higher clock rate manufacturer rating guaranteed capability overclocking may however seriously compromise system reliability insufficiently cooled computers generally shorten component lifespan overclocking incorrectly performed may also cause components overheat quickly mechanically destroy operating systems example ms-dos rely bios carry input/output tasks within pc bios still runs 16-bit real mode calling bios services directly inefficient protected-mode operating systems bios services used modern multitasking operating systems initially load importance primary part bios greatly reduced initially later bios implementations took complex functions including interfaces advanced configuration power interface acpi functions include power management hot swapping thermal management time since 2010 bios technology transitional process toward uefi historically bios ibm pc xt built-in user interface bios versions earlier pcs xt-class software configurable instead users set options via dip switches motherboard later computers including ibm-compatibles 80286 cpus battery-backed nonvolatile bios memory cmos ram chip held bios settings settings video-adapter type memory size hard-disk parameters could configured running configuration program disk built rom special reference diskette inserted ibm configure settings memory size early bios versions passwords boot-device selection options bios hard-coded boot first floppy drive failed first hard disk access control early at-class machines physical keylock switch hard defeat computer case could opened anyone could switch computer could boot later 386-class computers started integrating bios setup utility rom alongside bios code computers usually boot bios setup utility certain key key combination pressed otherwise bios post boot process executed modern bios setup utility menu-based user interface ui accessed pressing certain key keyboard pc starts usually key advertised short time early startup example press f1 enter cmos setup actual key depends specific hardware features present bios setup utility typically include modern bios setup screen often features pc health status hardware monitoring tab directly interfaces hardware monitor chip mainboard makes possible monitor cpu chassis temperature voltage provided power supply unit well monitor control speed fans connected motherboard system booted hardware monitoring computer fan control normally done directly hardware monitor chip separate chip interfaced i²c smbus come part super i/o solution interfaced low pin count lpc operating systems like netbsd envsys openbsd sysctl hw.sensors feature integrated interfacing hardware monitors normally done without interaction bios however certain circumstances bios vendor also provides underlying information hardware monitoring acpi case operating system may using acpi perform hardware monitoring done example asustek motherboards ai booster feature modern pcs bios stored rewritable memory allowing contents replaced modified rewriting contents sometimes termed flashing based common use kind eeprom known technically flash eeprom colloquially flash memory done special program usually provided system manufacturer post bios image hard drive usb flash drive file containing contents sometimes termed bios image bios might reflashed order upgrade newer version fix bugs provide improved performance support newer hardware reflashing operation might needed fix damaged bios original ibm pc bios cassette basic stored mask-programmed read-only memory rom chips sockets motherboard roms could replaced altered users allow updates many compatible computers used re-programmable memory devices eprom later flash memory devices according robert braver president bios manufacturer micro firmware flash bios chips became common around 1995 electrically erasable prom eeprom chips cheaper easier program standard ultraviolet erasable prom eprom chips flash chips programmed re-programmed in-circuit eprom chips need removed motherboard re-programming bios versions upgraded take advantage newer versions hardware correct bugs previous revisions bioses beginning ibm pcs supported hardware clock settable bios century bit allowed manually changing century year 2000 happened bios revisions created 1995 nearly bios revisions 1997 supported year 2000 setting century bit automatically clock rolled past midnight december 31 1999 first flash chips attached isa bus starting 1997 bios flash moved lpc bus functional replacement isa following new standard implementation known firmware hub fwh 2006 first systems supporting serial peripheral interface spi appeared bios flash memory moved size bios capacity rom eeprom media may stored increased time new features added code bios versions exist sizes 16 megabytes contrast original ibm pc bios contained 8 kib mask rom modern motherboards including even bigger nand flash memory ics board capable storing whole compact operating systems linux distributions example asus motherboards included splashtop os embedded nand flash memory ics however idea including operating system along bios rom pc new 1980s microsoft offered rom option ms-dos included roms pc clones tandy 1000 hx another type firmware chip found ibm pc early compatibles keyboard interface controlled microcontroller programmable memory ibm 40-pin socketed device manufacturers used eprom version chip resembled eprom controller also assigned a20 gate function manage memory one-megabyte range occasionally upgrade keyboard bios necessary take advantage software could use upper memory bios may contain components memory reference code mrc responsible handling memory timings related hardware settings ibm published entire listings bios original pc pc xt pc contemporary pc models appendix ibm pc technical reference manual machine type effect publication bios listings anyone see exactly definitive bios may 1984 phoenix software associates released first rom-bios enabled oems build essentially 100 -compatible clones without reverse-engineer ibm pc bios compaq done portable helping fuel growth pc compatibles industry sales non-ibm versions dos first american megatrends ami bios released 1986 new standards grafted onto bios usually without complete public documentation bios listings result easy learn intimate details many non-ibm additions bios core bios services pc motherboard suppliers license bios core toolkit commercial third-party known independent bios vendor ibv motherboard manufacturer customizes bios suit hardware reason updated bioses normally obtained directly motherboard manufacturer major bios vendors include american megatrends ami insyde software phoenix technologies byosoft former vendors include award software microid research acquired phoenix technologies 1998 phoenix later phased award brand name general software also acquired phoenix 2007 sold bios intel processor based embedded systems open source community increased effort develop replacement proprietary bioses future incarnations open sourced counterpart libreboot coreboot openbios/open firmware projects amd provided product specifications chipsets google sponsoring project motherboard manufacturer tyan offers coreboot next standard bios opteron line motherboards msi gigabyte technology followed suit msi k9nd ms-9282 msi k9sd ms-9185 resp m57sli-s4 models eeprom chips advantageous easily updated user customary hardware manufacturers issue bios updates upgrade products improve compatibility remove bugs however advantage risk improperly executed aborted bios update could render computer device unusable avoid situations recent bioses use boot block portion bios runs first must updated separately code verifies rest bios intact using hash checksums methods transferring control boot block detects corruption main bios typically warn user recovery process must initiated booting removable media floppy cd usb flash drive user try flashing bios motherboards backup bios sometimes referred dualbios boards recover bios corruptions least four known bios attack viruses two demonstration purposes first one found wild mebromi targeting chinese users first bios virus cih also known chernobyl virus able erase flash rom bios content compatible chipsets cih appeared mid-1998 became active april 1999 often infected computers could longer boot people remove flash rom ic motherboard reprogram cih targeted then-widespread intel i430tx motherboard chipset took advantage fact windows 9x operating systems also widespread time allowed direct hardware access programs modern systems vulnerable cih variety chipsets used incompatible intel i430tx chipset also flash rom ic types also extra protection accidental bios rewrites form boot blocks protected accidental overwrite dual quad bios equipped systems may event crash use backup bios also modern operating systems freebsd linux macos windows nt-based windows os like windows 2000 windows xp newer allow user-mode programs direct hardware access result 2008 cih become essentially harmless worst causing annoyance infecting executable files triggering antivirus software bios viruses remain possible however since windows home users without windows vista/7 uac run applications administrative privileges modern cih-like virus could principle still gain access hardware without first using exploit operating system openbsd prevents users access grsecurity patch linux kernel also prevents direct hardware access default difference attacker requiring much difficult kernel level exploit reboot machine second bios virus technique presented john heasman principal security consultant uk-based next-generation security software 2006 black hat security conference showed elevate privileges read physical memory using malicious procedures replaced normal acpi functions stored flash memory third bios virus technique called persistent bios infection appeared 2009 cansecwest security conference vancouver syscan security conference singapore researchers anibal sacco alfredo ortega core security technologies demonstrated insert malicious code decompression routines bios allowing nearly full control pc start-up even operating system booted proof-of-concept exploit flaw bios implementation involves normal bios flashing procedures thus requires physical access machine user root despite requirements ortega underlined profound implications sacco discovery patch driver drop fully working rootkit even little code remove disable antivirus mebromi trojan targets computers awardbios microsoft windows antivirus software two chinese companies rising antivirus jiangmin kv antivirus mebromi installs rootkit infects master boot record december 2013 interview 60 minutes deborah plunkett information assurance director us national security agency claimed nsa uncovered thwarted possible bios attack foreign nation state targeting us financial system program cited anonymous sources alleging chinese plot however follow-up articles guardian atlantic wired register refuted nsa claims bios replaced complex extensible firmware interface efi many new machines efi specification replaces runtime interface legacy bios initially written intel itanium architecture efi available x86 x86-64 platforms specification development driven unified efi forum industry special interest group efi booting supported microsoft windows versions supporting gpt linux kernel 2.6.1 later macos intel-based macs new pc hardware predominantly ships uefi firmware architecture rootkit safeguard also prevent system running user software changes makes uefi controversial bios replacement open hardware community alternatives functionality legacy bios x86 world include coreboot libreboot servers workstations use platform-independent open firmware ieee-1275 based forth programming language included sun sparc computers ibm rs/6000 line powerpc systems chrp motherboards along x86-based olpc xo-1 least 2015 apple removed legacy bios support macbook pro computers bless utility longer supports -- legacy switch prints legacy mode supported system macs also boot cd-rom usb flash drives | [
4291,
5012,
4293,
5719,
710,
2197,
3271,
4312,
3275,
2204,
732,
2932,
3296,
405,
6823,
410,
60,
6478,
1133,
5784,
1508,
4009,
780,
6502,
1150,
2979,
4018,
2983,
454,
4759,
5104,
1534,
5815,
3362,
6528,
1932,
5480,
3012,
3015,
4417,
126,... | Test |
1,053 | 2 | Google_Play_Services:google play services google play services proprietary background service api package android devices google first introduced 2012 provided simple access google+ apis oauth 2.0 since expanded cover large variety google services allowing applications easily communicate services common means april 2018 installed five billion times android devices google play game services used application developers allow competitive social experience use leaderboards public friends achievements multiplayer sessions saved games api available quickly sync game saves google cloud infrastructure well location apis provide specifications location technologies providing geofencing apis scheduling specific actions upon user entering leaving specific geographic boundaries fused location provider acquiring location information reduced power usage activity recognition allowing applications adapt current action user e.g cycling walking etc. google+ platform provides single sign-on allowing user automatically authenticated inside applications providing personalized experience sharing options using google+ google maps android api allows applications include google maps street view without need open separate application allowing full control camera providing means adding custom markers overlays map google drive android api allows google drive used storage structure providing easy lookup syncing documents along various tools manipulating files google cast android api adds casting functionality allow android applications display content tvs using google cast additionally providing various helpers common audio video image types google mobile ads integrate advertisements applications allowing simple monetization million google advertisers sophisticated ad targeting based factors user location google wallet instant buy allows purchases services goods done google wallet providing streamlined flow taps minimized data entry done user google play services provides apis google fit api google account authentication methods google analytics apis google play services used almost google apps system-level powers provide multiple internal features major android services controlled google play services without apps may work properly google play protect unification android security systems operated google two years launch company announced software scanning 50 million apps per day announcement made google i/o 2019 part company focus privacy security tuesday keynote presentations google play services automatically updated google play devices application installed running android 4.1 newer means google fast silent rollouts updates providing new functionality older devices without manufacturers update android firmware working around fragmentation platform become infamous android open source project aosp announced 2007 functioned baseline system oems firmware modifications cyanogenmod lineageos various apps aosp abandoned instead released google play closed-source model many apps function google play services available many google apps like gmail youtube google maps party interested distributing google play services part google apps package must acquire license google often results contractual agreement locking manufacturer android additionally enthusiasts able interested signing agreement interested modifying android system required either opt-out google play services obtain google apps package either device pre-installed unofficial source google play services page google developers | [
3933,
5372,
2196,
6427,
1095,
740,
4340,
42,
3310,
2591,
5771,
5775,
7956,
5473,
474,
6183,
822,
136,
6209,
1582,
6937,
6232,
5889,
4116,
5195,
2003,
195,
6978,
7346,
561,
201,
2017,
5919,
7357,
5571,
2398,
3794,
2037,
2756,
7007,
7749,... | Test |
1,054 | 6 | Gfarm_file_system:gfarm file system gfarm file system open-source distributed file system generally used large-scale cluster computing wide-area data sharing provides features manage replica location explicitly name derived grid data farm architecture implements grid datafarm petascale data-intensive computing project initiated japan project collaboration among high energy accelerator research organization kek national institute advanced industrial science technology aist high performance computing infrastructure project university tokyo tokyo institute technology university tsukuba challenge involves construction peta- exascale parallel filesystem exploiting local storage pcs spread worldwide grid | [
1254,
1624,
5571,
578,
2536
] | Test |
1,055 | 4 | *82:*82 vertical service code *82 enables calling line identification regardless subscriber preference dialed unblock withheld numbers private callers u.s. per-call basis caller id subscribed enabled line receiving call unblocked phone number registered name displayed – unable determine caller subscribes outgoing callerid blocking *82 dialed temporarily override subscription *82 dialed u.s. land-line house phones business lines well cell phones mobile devices mobile devices may alternatively offer require menu selection override caller id blocking per call correctly unblock number listen dial tone dial *82 listen momentary flashing dial tone confirms override establish connection usual dialing 1 area code phone number complete call anonymous call rejection *77 offered subscribers situations necessary dial *82 order ring complete call lines subscribe enable anonymous call rejection notice given anonymous callers intervening recorded message phone company rejected anonymous call may completed caller id enabled valid star 82 review literary journal published since 2012 named *82 function star 82 code needed unblock one phone number tell us someone answer | [
7813
] | Validation |
1,056 | 4 | The_Hacker's_Handbook:hacker handbook hacker handbook non-fiction book four editions reprinted numerous times 1985 1990 explaining phone computer systems period could 'hacked contains candid personal comments book british author hugo cornwall pseudonym peter sommer research fellow information systems security london school economics frequently appears united kingdom courts expert digital evidence computer forensics well media pundit author information security topics one popular aspect book salacious printouts actual hacking attempts although confidential details passwords blacked first edition version easily available download published 1985 last four editions edited steve gold appeared 1989 reprints running 1990 1990 uk parliament passed computer misuse act publication additional editions might construed incitement commit offence act | [
3486,
7050,
6488
] | Test |
1,057 | 5 | Dooble:dooble dooble free open-source web browser created improve privacy currently dooble available freebsd linux os x os/2 windows dooble uses qt user interface abstraction operating system processor architecture result dooble portable system supports openssl posix threads qt sqlite libraries dooble designed implemented order improve privacy usability dooble includes simple bookmarking system users may modify bookmarks via bookmarks browser popup accessible location widget along standard cookie management options dooble also provides mechanism automatically removes cookies permitted dooble occasionally remove undesired http cookies dooble web browser provides according news portal hongkiat easy use download manager dooble partially integrates distributed search engine yacy data dooble retains stored using authenticated encryption dooble encode file associations user settings dooble also provides session-based model using temporary keys passphrase may modified without loss data included non-javascript file manager ftp browser version 1.53 introduced gopher protocol support security passphrase created browser password set safe area browser settings need create master password otherwise everything wiped exit program points pcadvisor version 1.26 dooble introduced support addons torbrowser add-on based vidalia added version 1.40 vidalia plugin removed version 1.49 add-on name interface expands browser social network functions like messenger group chat friend list e-mail client chess game forum function like bulletin board interface based qt integrated plugin based clone retroshare messenger plugin considered deprecated configurable proxy settings provide reasonable flexibility dooble supports session restoration authenticated sessions dooble exits prematurely user may restore previous tabs windows next authenticated session web sites employ iframes order distribute content one third-party web sites since technology may raise privacy issues users dooble provides means blocking external content first version 0.1 released september 2008 current version 2.1.6 released january 25 2018 dooble also available nokia n900 dooble rated ninth ten top linux browsers jack wallen dooble announced one top five best *secure* browsers pcworld reviews dooble feature side rendering quickly even image-heavy sites. guardian newspaper recommends dooble alternative browser surveillance try privacy-focused browser dooble. add-on links | [
4655,
6802,
5378,
2205,
7537,
6809,
393,
3291,
2574,
2577,
6452,
4352,
4725,
1136,
6858,
3338,
2261,
445,
1152,
1525,
4759,
7628,
5821,
5127,
6540,
3383,
8006,
8009,
3043,
1970,
6221,
520,
2338,
3057,
5887,
6966,
5542,
1276,
5571,
578,
... | Validation |
1,058 | 9 | Supercombinator:supercombinator supercombinator mathematical expression fully bound self-contained may either constant combinator subexpressions supercombinators supercombinators used implementation functional languages mathematical terms lambda expression supercombinator arity n free variables form λx.λx ... λx e n ≥ 0 lambdas required e lambda abstraction lambda abstraction e supercombinator | [
769
] | Test |
1,059 | 4 | Domain-validated_certificate:domain-validated certificate domain validated certificate dv x.509 digital certificate typically used transport layer security tls domain name applicant validated proving control dns domain sole criterion domain validated certificate proof control whois records dns records file email web hosting account domain typically control domain determined using one following domain validated certificate distinct extended validation certificate requirement issuing certificate particular domain validated certificates assure particular legal entity connected certificate even domain name may imply particular legal entity controls domain web browsers may show lock often grey rather green lock typically used extended validation certificate dns domain name legal entity never displayed domain validated certificates include legal entity subject low assurance requirements allow domain validated certificates issued quickly without requiring human intervention domain validated certificates number unique characteristics | [
363,
794,
887,
6795,
1168,
1173,
2644,
1460,
5824,
8189,
8093,
6540,
5399,
6458,
6553,
2587,
4071,
7567,
7925,
1401,
3899,
2691,
6049,
4990,
7214,
3057,
3588,
353,
1513,
2620,
359,
3426
] | Test |
1,060 | 3 | Hatari_(emulator):hatari emulator hatari open-source emulator atari st 16/32-bit computer system family emulates atari st atari ste atari tt atari falcon computer series corresponding peripheral hardware like joysticks mouse midi printer serial floppy hard disks supports graphics modes st require original tos image supports emutos latest version reported issues st/ste/tt applications emulation compatibility also st/ste games demos work without issues hatari uses source code several emulators winston atari st peripherals uae motorola 680x0 cpu winuae accurate motorola 68030 cpu mmu stonx blitter aranym motorola 56001 dsp videl nvram hatari uses sdl library graphics developed linux ported many oses amigaos 4 aros bsd beos risc os morphos macos amigaos windows | [
5097,
4759,
5571,
3688,
7310,
578,
4264,
6111,
1435,
6367
] | Test |
1,061 | 2 | Auxiliary_storage_pool:auxiliary storage pool ibm operating system disk drives may grouped auxiliary storage pool asp order organize data limit impact storage-device failures reduce recovery time disk failure occurs data pool containing failed unit needs recovered asps may also used improve performance isolating objects similar performance characteristics example journal receivers pool default disk drives assigned pool 1 additional pools created rarely done anymore concept ibm pools similar unix/linux concept volume groups however ibm typical disk drives assigned single asp | [
1254,
578
] | Validation |
1,062 | 4 | Howard_Barlow:howard barlow howard c. barlow 1918 – 2003 american cryptographer telecommunications expert high-ranking civilian employee national security agency nsa united states barlow graduate carnegie institute technology b.s electrical engineering served european theatre world war ii one major assignments communications planning officer invasion normandy 1944 overseas designed various types specialized communications equipment war barlow stayed cryptologic profession joined civilian armed forces security agency later became nsa worked research development division one first communications security comsec engineers 1954 risen level division chief 1955-1956 barlow attended harvard university middle management program graduating master degree business administration returning nsa took tour operations named deputy director research development 1958 held position 1962 made assistant director comsec adc position held 1973 insights management skills created world-class analytic engineering organization able meet communications needs vietnam war cold war political skills enabled nsa forge significant comsec relationships u.s allies become leader comsec nato long illustrious career howard barlow received many awards including nsa exceptional civilian service award 1967 1973 department defense distinguished civilian service award highest award granted civilian dod barlow died 2003 | [] | Test |
1,063 | 3 | PowerBook_180:powerbook 180 powerbook 180 portable computer released apple computer inc. along powerbook 160 october 1992 time constituted new top-of-the-range model replacing previous powerbook 170 case design features 170 shipped powerful 33 mhz motorola 68030 cpu motorola 68882 fpu along 160 introduced new power saving feature allowed processor run slower 16 mhz rate speed original 140 powerbook 180 came diagonal active matrix lcd screen capable displaying 4-bit grayscale trackball mounted beneath keyboard 1.44 mb floppy disk drive 80 mb 2.5-inch hard drive also standard apple powerbook also gave option possible expansion 120 mb hard drive equipped keyboard stands slant keyboard like macintosh portable addition external color video port missing 170 180 became full-featured no-compromises desktop replacement equivalent performance macintosh lc iii+ sold may 1994 june 1993 apple released identical color version model powerbook 180c pictured diagonal active matrix color lcd capable displaying 256 colors first powerbook natively display 640x480 previous powerbooks 640x400 resolution result thicker color display exterior case lid redesigned closely resembling used powerbook duo series modification used powerbook 165c accommodate thicker color display well | [
7890,
5732,
722,
1094,
2926,
5037,
5752,
2954,
7572,
6482,
6142,
4373,
7226,
2978,
7601,
4749,
5097,
3346,
6165,
4389,
5463,
102,
5469,
4768,
3008,
5477,
6200,
6202,
3387,
3390,
1216,
2331,
4820,
4453,
1234,
1237,
7311,
889,
550,
552,
5... | Validation |
1,064 | 9 | IBM_BASIC:ibm basic ibm personal computer basic commonly shortened ibm basic programming language first released ibm ibm personal computer model 5150 ibm pc 1981 ibm released four different versions microsoft basic interpreter licensed microsoft pc pcjr known cassette basic disk basic advanced basic basica cartridge basic versions disk basic advanced basic included ibm pc dos pc dos 4 addition features ansi standard basic ibm versions offered support graphics sound hardware ibm pc line source code could typed full-screen editor limited facilities provided rudimentary program debugging ibm also released version microsoft basic compiler pc concurrently release pc dos 1.10 1982 ibm licensed microsoft basic ibm personal computer despite already version basic company mainframes estridge said microsoft basic hundreds thousands users around world going argue ibm cassette basic came 32 kilobytes kb read-only memory rom separate 8 kb bios rom original ibm pc require operating system run cassette basic provided default user interface invoked bios int 18h floppy disk drive installed boot code find bootable floppy disk power name cassette basic came use cassette tapes rather floppy disks store programs data cassette basic built roms original pc xt early models ps/2 line supported loading saving programs ibm cassette tape interface unavailable models original model 5150 entry-level version 5150 came 16 kb random-access memory ram sufficient run cassette basic however cassette basic rarely used pcs sold without disk drive sold pc dos sufficient ram least run disk basic—many could run advanced basic well three versions cassette basic c1.00 found early ibm pcs 16k-64k motherboards c1.10 found later ibm pcs xts ats ps/2s c1.20 found pcjr ibm disk basic basic.com included original ibm pc dos uses 32 kb cassette basic rom basic.com run even highly compatible pc clones compaq portable name disk basic came use floppy disks well cassette tapes store programs data disk-based code corrected errata rom-resident code added floppy disk serial port support disk basic could identified use letter preceding version number added disk support features lacking cassette basic include extended sound/graphics functions basica primary purpose disk basic light version ibm pcs 48 kb memory basic.com would 23 kb free user code whereas basica would 17 kb 1986 new pcs shipped least 256k dos versions 3.00 reduced disk basic small stub called basica.com compatibility batch files even excess ram basic would still allocate manage 61 kb user programs whether cassette basic basic.com basica ibm advanced basic basica.com also included original ibm pc dos required rom-resident code cassette basic added functions diskette file access storing programs disk monophonic sound using pc built-in speaker graphics functions set clear pixels draw lines circles set colors event handling communications joystick presses basica would run non-ibm computers even so-called 100 compatible machines later ibm models since lack needed rom basic basica versions respective dos beginning v1.00 ending v3.30 early versions basica support subdirectories graphics commands functioned slightly differently example line statement used draw lines trailed off-screen basic would merely intersect nearest adjacent line basic 2.x went screen intersect paint command basic 1.x begins filling coordinate specified expands outward alternating directions basic 2.x fills everything starting coordinate finishing everything basic 1.x paint command also makes use system stack storage filling complex areas possible produce overflow error remedy clear statement used expand basic stack 128 bytes default size basic 2.x use stack painting thus free problem compaq basic 1.13 first standalone basic pc require cassette basic run well version basic besides ibm basica 1.00 1.10 use fcbs include original line statement intersecting lines paint statement compaq basic 1.13 worked like later versions basica/gw-basic using new fill algorithm stack early versions pc dos included several sample basic programs demonstrating capabilities pc including basica game donkey.bas gw-basic identical basica exception including cassette basic code program thus allowing run non-ibm computers later ibm models lack cassette basic rom rom cartridge version basic available ibm pcjr shipped 1984 supported additional graphics modes sound capabilities possible machine superset advanced basic cartridge basic operate within first 128 kb memory pcjr work expansion ram i.e def seg function used point memory segments h1ff0 cartridge basic activated typing basica dos prompt conversely ibm basica versions 2.1 refuse run detects pcjr patched work around cassette basic loads pc pcjr booted without bootable disk cartridge disk basic advanced basic load command name basic basica respectively typed dos command prompt except pcjr activates cartridge basic instead optional parameters control allocation memory loaded sign-on identification message displays program version number full-screen text editor starts see images right function keys assigned common commands display bottom screen commands may typed load save programs expressions typed executed direct immediate mode line input starts number language system stores following line text part program source allowing programmer enter entire program line line entering line numbers statement listed screen lines displayed order increasing line number changes made displayed line program source code moving cursor line cursor keys typing on-screen text program source stored internally tokenized form reserved words replaced single byte token save space execution time programs may saved compact tokenized form optionally saved dos ascii text files viewed edited programs like dos applications ibm basic text-mode program features windows icons mouse support cut-and-paste editing gw-basic launched 1983 disk-based microsoft product distributed non-ibm ms-dos computers supports graphics modes features basica computers ibm cassette basic successor basica ms-dos pc dos versions discontinued qbasic launched 1991 stripped-down version microsoft quickbasic compiler qbasic interpreter compile source files quickbasic compile save programs .exe executable file format | [
7698,
3931,
4291,
5367,
1255,
12,
2463,
6891,
1361,
8183,
4139,
5651,
2925,
7448,
5926,
5129,
5571,
7906,
2036,
5137,
5234,
2941,
3303,
3210,
6380,
1670,
1304,
61,
6394,
4003,
1052,
7864,
1789,
5784,
5877,
4277,
6778,
4012,
4745,
1992
] | Test |
1,065 | 0 | Speech-generating_device:speech-generating device speech-generating devices sgds also known voice output communication aids electronic augmentative alternative communication aac systems used supplement replace speech writing individuals severe speech impairments enabling verbally communicate sgds important people limited means interacting verbally allow individuals become active participants communication interactions particularly helpful patients suffering amyotrophic lateral sclerosis als recently used children predicted speech deficiencies several input display methods users varying abilities make use sgds sgds multiple pages symbols accommodate large number utterances thus portion symbols available visible one time communicator navigating various pages speech-generating devices produce electronic voice output using digitized recordings natural speech speech synthesis—which may carry less emotional information permit user speak novel messages content organization updating vocabulary sgd influenced number factors user needs contexts device used development techniques improve available vocabulary rate speech production active research area vocabulary items high interest user frequently applicable range meanings pragmatic functionality multiple methods accessing messages devices directly indirectly using specialized access devices—although specific access method depend skills abilities user sgd output typically much slower speech although rate enhancement strategies increase user rate output resulting enhanced efficiency communication first known sgd prototyped mid-1970s rapid progress hardware software development meant sgd capabilities integrated devices like smartphones notable users sgds include stephen hawking roger ebert tony proudfoot pete frates founder als ice bucket challenge speech-generating systems may dedicated devices developed solely aac non-dedicated devices computers running additional software allow function aac devices sgds roots early electronic communication aids first aid sip-and-puff typewriter controller named patient-operated selector mechanism possum prototyped reg maling united kingdom 1960 possum scanned set symbols illuminated display researchers delft university netherlands created lightspot operated typewriter lot 1970 made use small movements head point small spot light matrix characters equipped photoelectric cell although commercially unsuccessful lot well received users 1966 barry romich freshman engineering student case western reserve university ed prentke engineer highland view hospital cleveland ohio formed partnership creating prentke romich company 1969 company produced first communication device typing system based discarded teletype machine 1970s early 1980s several companies began emerge since become prominent manufacturers sgds toby churchill founded toby churchill ltd 1973 losing speech following encephalitis us dynavox known sentient systems technology grew student project carnegie-mellon university created 1982 help young woman cerebral palsy communicate beginning 1980s improvements technology led greatly increased number variety performance commercially available communication devices reduction size price alternative methods access target scanning also known eye pointing calibrate movement user eyes direct sgd produce desired speech phase scanning alternatives presented user sequentially became available communication devices speech output possibilities included digitized synthesized speech rapid progress hardware software development continued including projects funded european community first commercially available dynamic screen speech generating devices developed 1990s software programs developed allowed computer-based production communication boards high-tech devices continued become smaller lighter increasing accessibility capability communication devices accessed using eye-tracking systems perform computer word-processing internet use environmental control device independent access equipment tv radio telephones stephen hawking came associated unique voice particular synthesis equipment hawking unable speak due combination severe disabilities caused als emergency tracheotomy past 20 years sgd gained popularity amongst young children speech deficiencies autism syndrome predicted brain damage due surgery starting early 2000s specialists saw benefit using sgds adults children well neuro-linguists found sgds effective helping children risk temporary language deficits undergoing brain surgery patients als particular digitized sgds used communication aids pediatric patients recovery process many methods accessing messages devices directly indirectly specialized access devices direct access methods involve physical contact system using keyboard touch screen users accessing sgds indirectly specialized devices must manipulate object order access system maneuvering joystick head mouse optical head pointer light pointer infrared pointer switch access scanner specific access method depend skills abilities user direct selection body part pointer adapted mouse joystick eye tracking could used whereas switch access scanning often used indirect selection unlike direct selection e.g. typing keyboard touching screen users target scanning make selections scanning indicator cursor electronic device desired choice unable point typically calibrate eyes use eye gaze way point blocking way select desired words phrases speed pattern scanning well way items selected individualized physical visual cognitive capabilities user augmentative alternative communication typically much slower speech users generally producing 8–10 words per minute rate enhancement strategies increase user rate output around 12–15 words per minute result enhance efficiency communication given sgd may large number vocal expressions facilitate efficient effective communication including greetings expressing desires asking questions sgds multiple pages symbols accommodate large number vocal expressions thus portion symbols available visible one time communicator navigating various pages speech-generating devices generally display set selections either using dynamically changing screen fixed display two main options increasing rate communication sgd encoding prediction encoding permits user produce word sentence phrase using one two activations sgd iconic encoding strategies semantic compaction combine sequences icons picture symbols produce words phrases numeric alpha-numeric letter encoding also known abbreviation-expansion words sentences coded sequences letters numbers example typing hh g1 greeting 1 may retrieve hello prediction rate enhancement strategy sgd attempts reduce number keystrokes used predicting word phrase written user user select correct prediction without needing write entire word word prediction software may determine choices offered based frequency language association words past choices user grammatical suitability however users shown produce words per minute using scanning interface static keyboard layout predictive grid layout suggesting cognitive overhead reviewing new arrangement cancels benefits predictive layout using scanning interface another approach rate-enhancement dasher uses language models arithmetic coding present alternative letter targets screen size relative likelihood given history rate words produced depend greatly conceptual level system talk system allows users choose large numbers sentence-level utterances demonstrated output rates excess 60 wpm fixed display devices refer symbols items fixed particular format sources refer static displays display devices simpler learning curve devices fixed display devices replicate typical arrangement low-tech aac devices low-tech defined devices need batteries electricity electronics like communication boards share disadvantages example typically restricted limited number symbols hence messages important note technological advances made twenty-first century fixed-display sgds commonly used anymore dynamic displays devices usually also touchscreen devices typically generate electronically produced visual symbols pressed change set selections displayed user change symbols available using page links navigate appropriate pages vocabulary messages home page dynamic display device may show symbols related many different contexts conversational topics pressing one symbols may open different screen messages related topic example watching volleyball game user may press sport symbol open page messages relating sport press symbol showing scoreboard utter phrase score advantages dynamic display devices include availability much larger vocabulary ability see sentence construction advantage dynamic display devices underlying operating system capable providing options multiple communication channels including cell phone text messaging e-mail work linköping university shown email writing practices allowed children sgd users develop new social skills increase social participation low cost systems also include keyboard audio speaker combination without dynamic display visual screen type keyboard sends typed text direct audio speaker permit phrase spoken without need visual screen always required one simple benefit talking keyboard used standard telephone speakerphone enable voice impaired individual 2 way conversation telephone output sgd may digitized and/or synthesized digitized systems play directly recorded words phrases synthesized speech uses text-to-speech software carry less emotional information permits user speak novel messages typing new words today individuals use combination recorded messages text-to-speech techniques sgds however devices limited one type output words phrases entire messages digitised stored onto device playback activated user process formally known voice banking advantages recorded speech include provides natural prosody speech naturalness listener e.g. person age gender aac user selected record messages b provides additional sounds may important user laughing whistling moreover digitized sgds provide degree normalcy patient families lose ability speak major disadvantage using recorded speech users unable produce novel messages limited messages pre-recorded device depending device may limit length recordings sgds use synthesized speech apply phonetic rules language translate user message voice output speech synthesis users freedom create novel words messages limited pre-recorded device others smartphones computers increased use synthesized speech devices creation apps allow user select list phrases messages spoken voice language user chosen apps speakit assistive express iphone provide cheap way use speech-generating device without visit doctor office learn use specialized machinery synthesized sgds may allow multiple methods message creation used individually combination messages created letters words phrases sentences pictures symbols synthesized speech virtually unlimited storage capacity messages demands memory space synthesized speech engines available many languages engine parameters speech rate pitch range gender stress patterns pauses pronunciation exceptions manipulated user selection set sgd set messages symbols codes available person using device content organisation updating selection set areas active research influenced number factors including user ability interests age selection set aac system may include words user know yet – included user grow content installed given sgd may include large number preset pages provided manufacturer number additional pages produced user user care team depending user needs contexts device used researchers beukelman mirenda list number possible sources family members friends teachers care staff selection initial content sgd range sources required general one individual would knowledge experience generate vocal expressions needed given environment example parents therapists might think add slang terms innit previous work analyzed vocabulary use typically developing speakers word use aac users generate content new aac devices processes work well generating core set utterances vocal expressions less effective situations particular vocabulary needed example terms related directly user interest horse riding term fringe vocabulary refers vocabulary specific unique individual personal interests needs typical technique develop fringe vocabulary device conduct interviews multiple informants siblings parents teachers co-workers involved persons researchers musselwhite st. louis suggest initial vocabulary items high interest user frequently applicable range meanings pragmatic functionality criteria widely used aac field ecological check sgd content beukelman mirenda emphasize vocabulary selection also involves ongoing vocabulary maintenance however difficulty aac users carers must program new utterances manually e.g names new friends personal stories existing commercial solutions automatically adding content number research approaches attempted overcome difficulty range inferred input generating content based log conversation user friends family data mined internet find language materials webcrawler project moreover making use lifelogging based approaches device content changed based events occur user day accessing user data high-quality messages generated risk exposing sensitive user data example making use global positioning systems device content changed based geographical location many recently developed sgds include performance measurement analysis tools help monitor content used individual raises concerns privacy argue device user involved decision monitor use way similar concerns raised regarding proposals devices automatic content generation privacy increasingly factor design sgds aac devices designed used areas user life sensitive legal social technical issues centred wide family personal data management problems found contexts aac use example sgds may designed support user right delete logs conversations content added automatically programming dynamic speech generating devices usually done augmentative communication specialists specialists required cater needs patients patients usually choose kinds words/ phrases want example patients use different phrases based age disability interests etc therefore content organization extremely time consuming additionally sgds rarely covered health insurance companies result resources limited regards funding staffing dr. john costello boston children hospital driving force soliciting donations keep program running well-staffed within hospital hospitals across country | [] | Test |
1,066 | 2 | Nokia_N800:nokia n800 nokia n800 internet tablet wireless internet appliance nokia originally announced las vegas ces 2007 summit january 2007 n800 allows user browse internet communicate using wi-fi networks mobile phone via bluetooth n800 developed successor nokia 770 includes fm internet radio rss news reader image viewer media player audio video files note usb port uses mini-b socket instead mini-ab specially grounded adaptor required make full use usb otg client/host auto-switching switching done software regular adaptors though usb otg provides 100 current versus full-size usb 500 devices larger current requirements need used powered usb hub n800 like nokia internet tablets runs maemo similar many handheld operating systems provides home screen—the central point applications settings accessed home screen divided areas launching applications menu bar large customisable area display information rss reader internet radio player google search box example maemo modified version debian n800 bundled several applications including mozilla-based microb browser macromedia flash gizmo skype n800 use maemo os comes number built-in applications additional applications installed number sources including various official community | [
2538,
372,
7521,
3615,
1453,
3952,
4317,
2922,
23,
2564,
6443,
7545,
5044,
4343,
7919,
6465,
5062,
3653,
5068,
3657,
4726,
1129,
76,
1522,
2271,
6517,
1167,
3694,
472,
4407,
118,
3703,
7261,
5493,
1202,
3029,
5499,
139,
3039,
3734,
1973... | Test |
1,067 | 1 | Soterml:soterml soterml soil terrain markup language xml-based markup language storing exchanging soil terrain related data soterml development done within e-soter platform geoss plans global earth observation system within framework e-soter project addresses felt need global soil terrain database centre geospatial science currently nottingham gepospatial institute university nottingham initiated development since january 2009 development maintenance currently handled national soil resources institurte nsri cranfield university uk role cgs within development e-soter dissemination platform based inspire principles soterml development included 1 development data dictionary nomenclatures various data sources data metadata 2 development exchange format/procedures world reference base 2006 | [] | Test |
1,068 | 5 | Network_congestion:network congestion network congestion data networking queueing theory reduced quality service occurs network node link carrying data handle typical effects include queueing delay packet loss blocking new connections consequence congestion incremental increase offered load leads either small increase even decrease network throughput network protocols use aggressive retransmissions compensate packet loss due congestion increase congestion even initial load reduced level would normally induced network congestion networks exhibit two stable states level load stable state low throughput known congestive collapse networks use congestion control congestion avoidance techniques try avoid collapse include exponential backoff protocols csma/ca 802.11 similar csma/cd original ethernet window reduction tcp fair queueing devices routers network switches techniques address congestion include priority schemes transmit packets higher priority ahead others explicit allocation network resources specific flows use admission control network resources limited including router processing time link throughput resource contention may occur networks number common circumstances wireless lan easily filled single personal computer even fast computer networks backbone easily congested servers client pcs denial-of-service attacks botnets capable filling even largest internet backbone network links generating large-scale network congestion telephone networks mass call event overwhelm digital telephone circuits congestive collapse congestion collapse condition congestion prevents limits useful communication congestion collapse generally occurs choke points network incoming traffic exceeds outgoing bandwidth connection points local area network wide area network common choke points network condition settles stable state traffic demand high little useful throughput available packet delay loss occur quality service extremely poor congestive collapse identified possible problem 1984 first observed early internet october 1986 nsfnet phase-i backbone dropped three orders magnitude capacity 32 kbit/s 40 bit/s continued end nodes started implementing van jacobson congestion control 1987 1988 packets sent could handled intermediate routers intermediate routers discarded many packets expecting end points network retransmit information however early tcp implementations poor retransmission behavior packet loss occurred endpoints sent extra packets repeated information lost doubling incoming rate congestion control modulates traffic entry telecommunications network order avoid congestive collapse resulting oversubscription typically accomplished reducing rate packets whereas congestion control prevents senders overwhelming network flow control prevents sender overwhelming receiver theory congestion control pioneered frank kelly applied microeconomic theory convex optimization theory describe individuals controlling rates interact achieve optimal network-wide rate allocation examples optimal rate allocation max-min fair allocation kelly suggestion proportionally fair allocation although many others possible let formula_1 rate flow formula_2 formula_3 capacity link formula_4 formula_5 1 flow formula_2 uses link formula_4 0 otherwise let formula_8 formula_9 formula_10 corresponding vectors matrix let formula_11 increasing strictly concave function called utility measures much benefit user obtains transmitting rate formula_8 optimal rate allocation satisfies lagrange dual problem decouples flow sets rate based price signalled network link capacity imposes constraint gives rise lagrange multiplier formula_15 sum multipliers formula_16 price flow responds congestion control becomes distributed optimisation algorithm many current congestion control algorithms modelled framework formula_15 either loss probability queueing delay link formula_4 major weakness assigns price flows sliding window flow control causes burstiness causes different flows observe different loss delay given link among ways classify congestion control algorithms mechanisms invented prevent network congestion deal network collapse correct endpoint behavior usually repeat dropped information progressively slow repetition rate provided endpoints congestion lifts network resumes normal behavior strategies slow-start ensure new connections n't overwhelm router congestion detection initiates common router congestion avoidance mechanisms include fair queuing scheduling algorithms random early detection red packets randomly dropped congestion detected proactively triggers endpoints slow transmission congestion collapse occurs fair queuing useful routers choke points small number connections passing larger routers must rely red end-to-end protocols designed behave well congested conditions tcp well known example first tcp implementations handle congestion described 1984 van jacobson inclusion open source solution berkeley standard distribution unix bsd 1988 first provided good behavior udp control congestion protocols built atop udp must handle congestion independently protocols transmit fixed rate independent congestion problematic real-time streaming protocols including many voice ip protocols property thus special measures quality service must taken keep packets dropped presence congestion general congestion pure datagram networks must kept periphery network mechanisms handle congestion internet backbone problematic cheap fiber-optic lines reduced costs internet backbone allowing provisioned enough bandwidth keep congestion periphery connection-oriented protocols widely used tcp protocol generally watch packet errors losses delays see quality service adjust transmit speed various network congestion avoidance processes support different trade-offs tcp congestion avoidance algorithm primary basis congestion control internet problems occur concurrent tcp flows experience port queue buffer tail-drops defeating tcp automatic congestion avoidance flows experience port queue buffer tail-drop begin tcp retrain moment – called tcp global synchronization active queue management aqm reorder drop network packets inside transmit buffer associated network interface controller nic task performed network scheduler one solution use random early detection red network equipment port queue buffer network equipment ports one queue buffer weighted random early detection wred could used available red indirectly signals sender receiver deleting packets e.g average queue buffer lengths threshold e.g 50 deletes linearly cubically packets e.g 100 average queue buffer lengths computed 1 second intervals robust random early detection rred algorithm proposed improve tcp throughput denial-of-service dos attacks particularly low-rate denial-of-service ldos attacks experiments confirmed red-like algorithms vulnerable low-rate denial-of-service ldos attacks due oscillating tcp queue size caused attacks network equipment equipped ports follow measure flow flowbased-red/wred thereby able signal big bandwidth flow according quality service policy policy could divide bandwidth among flows criteria another approach use ip explicit congestion notification ecn ecn used two hosts signal want use method protocol bit used signal explicit congestion better indirect packet delete congestion notification performed red/wred algorithms requires explicit support hosts ecn coauthor sally floyd published detailed information ecn including version required cisco ios router receives packet marked ecn-capable anticipates using red congestion sets ecn flag notifying sender congestion sender respond decreasing transmission bandwidth e.g. decreasing tcp window size sending rate means cisco systems engine iv v capability classify flows aggressive bad adaptive good ensures flows fill port queues dbl utilize ip ecn instead packet-delete-signalling congestion avoidance achieved efficiently reducing traffic application requests large file graphic web page usually advertises window 32k 64k results server sending full window data assuming file larger window many applications simultaneously request downloads data creates congestion point upstream provider flooding queue using device reduce window advertisement remote servers send less data thus reducing congestion technique reduce network congestion factor 40 backward ecn becn another proposed congestion mechanism uses icmp source quench messages ip signalling mechanism implement basic ecn mechanism ip networks keeping congestion notifications ip level requiring negotiation network endpoints effective congestion notifications propagated transport layer protocols tcp udp appropriate adjustments protocols avoid congestive collapse often based idea data loss caused congestion true nearly cases errors transmission rare however causes wifi 3g networks radio layer poor throughput cases since wireless networks susceptible data loss due interference tcp connections running radio based physical layer see data loss tend erroneously believe congestion occurring slow-start protocol performs badly short connections older web browsers created many short-lived connections opened closed connection file kept connections slow start mode slowed response times avoid problem modern browsers either open multiple connections simultaneously reuse one connection files requested particular server initial performance poor many connections never get slow-start regime significantly increasing latency admission control requires devices receive permission establishing new network connections new connection risks creating congestion permission denied one example use contention-free transmission opportunities cftxops itu-t g.hn standard provides high-speed 1 gbit/s local area networking varying wires power lines phone lines coaxial cables | [
2633,
3775,
3855,
7637,
4783,
1942,
3462,
3640,
585,
5850,
3314,
3315,
2327,
3819,
2512,
3821,
1974,
1884,
2696,
7217,
1691,
1985,
1607,
2901
] | Test |
1,069 | 2 | Appearance_Manager:appearance manager appearance manager component mac os 8 mac os 9 controls overall look macintosh graphical user interface widgets supports several themes originally developed apple failed copland project cancellation project system moved newer versions mac os appearance manager also available free part downloadable sdk system 7 appearance manager implemented abstraction layer control manager quickdraw previously controls made direct quickdraw calls draw user interface elements buttons scrollbars window title bars etc appearance manager elements abstracted series apis draw item distinct entity behalf client code thus relieving control manager task extra level indirection allows system support concept switchable themes since client code simply requests image interface element button scroll bar example draws appearance kaleidoscope 3rd party application first utilize functionality via scheme files followed updated appearance control panel mac os 8.5 acted similarly via theme files schemes themes similar concept internally compatible updated powerful version appearance manager used carbon applications mac os x even apple made transition aqua extras.rsrc file updated version appearance theme compatible newer appearance manager mac os x version 10.3 'layo data longer used even carbon applications continued existence appearance manager longer confirmed default look feel appearance manager mac os 8 9 platinum intended primary gui copland platinum retains many shapes positions elements system 7 earlier like window control widgets buttons charcoal default system font chicago available via menu option however various shades grey used extensively throughout interface opposed previous interfaces mostly monochrome black white apple platinum theme however actually embedded appearance manager appearance control panel ability attach theme appearance manager apple platinum file themes folder system folder acts stub functional theme elements embedded customizable palettes 'clut resources used progress bars scroll thumbs slider tabs menu selections apple platinum unique option available real themes appearance control panel uses type code 'pltn identify file act like palette modification stub apple platinum type code 'thme identify file act like appearance theme important distinction appearance control panel implements themes appearance manager kaleidoscope third party software implements schemes appearance manager kaleidoscope substitute appearance manager substitute appearance control panel apple widely demonstrated two appearance themes override apple platinum hi-tech gizmo hi-tech based shades-of-black color scheme made interface look like contemporary piece audio-visual equipment gizmo kids interface using lots bright colors wiggly interface elements changed every single element overall gui leaving trace apple platinum third theme later introduced drawing board developed apple japan theme uses elements make interface look like drawn pencil drafting-board including small pencil marks around windows barely visible graph paper grid desktop squarish elements low contrast although none themes included released version mac os themes present pre-release versions mac os 8.5 removed without explanation final release one retrospective review long-time mac user described themes mistake waste engineering resources saying 'hi-tech theme 'looked like typical dark over-decorated techno skin became popular linux desktops 'gizmo looked 'awful ... finder clown suit default font called charcoal used replace similar chicago typeface used earlier versions mac os number additional system fonts also provided including capitals gadget sand techno textile order system font glyphs specific mac operating system need provided command key symbol ⌘ normally system fonts displayed 12 points later versions appearance manager also apply anti-aliasing type displayed screen certain size default improves overall look text reducing perception rasterization artifacts anti-aliasing adjustable appearance control panel shareware products exist provided features appearance manager offered directly appearance control panel church windows décor provide desktop picture functionality windowshade purchased apple bundled system 7 provides collapse functionality windows collapse “ roll ” leaving title bar kaleidoscope written arlo rose greg landweber applied schemes gui apple released update appearance control panel mac os 8.5 provides similar functionality using themes whereas handful themes ever developed thousands kaleidoscope schemes developed theme support appearance control panel first announced team responsible demonstrated automatic tool specifically designed convert tens thousands existing kaleidoscope scheme files appearance manager-compatible theme files tool released public however similar tool developed kaleidoscope remained primary theme platform even appearance control panel offered theme capabilities mac os 8.5 steve jobs returned apple release mac os 8.5 decided officially drop support themes wanted preserve consistent user interface apple released little documentation theme format withheld beta-released themes even issued cease desist notice authors third-party theme editor grounds intended allow users create themes imitate aqua interface mac os x time format kaleidoscope schemes continued evolve result kaleidoscope schemes proliferated appearance themes never really took kaleidoscope rendered obsolete transition mac os x kaleidoscope compatible | [
1815,
2547,
7814,
5660,
578,
1103,
405,
502,
6295,
149,
6765,
4453,
1599,
3412,
3920,
2357,
3503
] | Validation |
1,070 | 3 | Rasterscan:rasterscan rasterscan computer game published 1987 mastertronic several 8-bit formats written binary design ltd based parsonage gardens manchester c64 version programmed phillip allsopp aka 'sarge rasterscan large damaged spacecraft drifting uncontrollably towards nearby star rasterscan still controlled piloted safety droid called msb unfortunately msb also damaged without help repair toasters player needs control msb hopefully use save unfortunate spacecraft player controls msb spherical droid float interior ship directions msb interact craft machinery instruments serve purpose also needs solve logic-puzzles order open doors different puzzles door allow access parts spacecraft | [] | Test |
1,071 | 4 | Canary_trap:canary trap canary trap method exposing information leak giving different versions sensitive document several suspects seeing version gets leaked could one false statement see sensitive information gets people well special attention paid quality prose unique language hopes suspect repeat verbatim leak thereby identifying version document term coined tom clancy novel patriot games although clancy invent technique actual method usually referred barium meal test espionage circles used intelligence agencies many years fictional character jack ryan describes technique devised identifying sources leaked classified documents summary paragraph six different versions mixture paragraphs unique numbered copy paper thousand possible permutations ninety-six numbered copies actual document reason summary paragraphs lurid entice reporter quote verbatim public media quotes something two three paragraphs know copy saw therefore leaked refinement technique uses thesaurus program shuffle synonyms thus making every copy document unique following troubled production late 1970s paramount pictures effectively replaced gene roddenberry producer movies franchise harve bennett roddenberry retained executive consultant due high regard series fans held little real authority still kept involved creative process fans often complained particular plot developments proposed films death spock roddenberry opposed drafts screenplay circulated bennett arranged individual copy subtle clues distinguishing others shortly roddenberry opposed destruction enterprise climax film fans began complain paramount bennett found leaked copy script one given roddenberry unable anything series leaks tesla motors 2008 ceo elon musk reportedly sent slightly different versions e-mail employee attempt reveal potential leakers e-mail disguised request employees sign new non-disclosure agreement plan backfired company general counsel forwarded unique version e-mail attached agreement result musk scheme realized employees safe copy leak according book spycatcher peter wright published 1987 technique standard practice used mi5 intelligence agencies many years name barium meal test barium meal test sophisticated canary trap flexible may take many different forms however basic premise reveal secret suspected enemy nobody else monitor whether evidence fake information utilised side example double agent could offered tempting bait e.g told important information stored dead drop site fake dead drop site could periodically checked signs disturbance site showed signs disturbed instance order copy microfilm stored would confirm suspected enemy really enemy i.e double agent technique embedding significant information hidden form medium used many ways usually classified according intent | [
5193,
1617,
4184,
104
] | Test |
1,072 | 7 | Jobvite:jobvite jobvite inc. san mateo california indianapolis indiana software recruiting corporation comprehensive recruiting platform accelerates recruiting easy-to-use ats social recruiting capabilities mobile-optimized branded career sites recruiting branding solution on-demand video screening advanced analytics on-boarding seamless integration hr systems software service saas social recruiting platforms enabling companies advertise jobs manage recruitment process much jobvite inc. established 2003 jesper schultz hans larsen name forumjobs inc company name changed jobvite 2006 december 2007 company raised 7.2 million venture funding cmea ventures july 2008 dan finnigan formerly yahoo hotjobs.com appointed ceo company finnigan hired two former colleagues yahoo engineering senior director adam hyder chief technology officer yahoo spot marketing head tim lambert chief revenue officer september 2010 jobvite formed partnership successfactors business execution bizx suite partnership added bizx suite 8 million plus users jobvite search platform october 2014 jobvite received 25 million investments new york city-based growth equity firm catalyst investors joined trident capital cmea capital ata ventures one firm ’ chief investors investment company amounted 55 million time august 2015 company launched operations london england 2019 company additional offices chicago boston bengaluru india february 2019 k1 investment management invested 200 million dollars jobvite part funds assisted jobvite ’ acquisition three companies talemetry rolepoint canvas acquisition resulted additional 2,000 customers jobvite including fortune 500 companies 2014 jobvite cited server 1600 global companies 46 million job seekers worldwide jobvite specializes provision software service saas recruiting platform web-based service enables clientele create job invitations known jobvites business associates employees social networking sites facebook linkedin making viable social recruiting provider companies post job openings manage recruitment process clientele include twitter linkedin schneider electric gamesys jobvite offers number features within recruiting platform include 2010 popular application “ work us ” roughly 5,000 active users every month time jobvite become known surveys social recruitment frequently cited source media outlets time inc. numerous authors books social human resource management | [
6092
] | Test |
1,073 | 8 | VlibTemplate:vlibtemplate vlibtemplate template engine written php programmers web developers may use web development vlibtemplate php class intended make splitting php html simple natural task using markup tags class allows users set values variables loops statements etc declared template vlibtemplate part vlib interface vlibdate vlibmimemail since vlibtemplate separates php html two files note file contains plain html one markup tag tmpl_var used display template variables assigned php script using vlibtemplatecache speed parsing process | [
4798,
6029,
5956,
1803
] | Test |
1,074 | 4 | Open_Bug_Bounty:open bug bounty open bug bounty non-profit bug bounty platform responsible disclosure platform allows independent security researchers report xss similar security vulnerabilities website discover using non-intrusive security testing techniques researchers may choose make details vulnerabilities public 90 days since vulnerability submission communicate website operators program expectation operators affected website reward researchers making reports unlike commercial bug bounty programs open bug bounty non-profit project require payment either researchers website operators bounty matter agreement researchers website operators heise.de identified potential website vehicle blackmailing website operators threat disclosing vulnerabilities bounty paid reported open bug bounty prohibits open bug bounty launched private security enthusiasts 2014 february 2017 recorded 100,000 vulnerabilities 35,000 fixed grew website xssposed archive cross-site scripting vulnerabilities february 2018 platform 100,000 fixed vulnerabilities using coordinated disclosure program based iso 29147 guidelines | [
2560,
501
] | Train |
1,075 | 3 | PowerPC_e500:powerpc e500 powerpc e500 32-bit microprocessor core freescale semiconductor core compatible older powerpc book e specification well power isa v.2.03 dual issue seven-stage pipeline fpus version 2 onwards 32/32 kib data instruction l1 caches 256 512 1024 kib l2 frontside cache speeds range 533 mhz 1.5 ghz core designed highly configurable meet specific needs embedded applications features like multi-core operation interface auxiliary application processing units apu e500 powers high-performance powerquicc iii system chip soc network processors share common naming scheme mpc85xx freescale new qoriq evolutionary step powerquicc iii also based e500 cores three versions e500 core namely original e500v1 e500v2 e500mc 64-bit evolution e500mc core called e5500 core introduced 2010 key improvements e500v2 e500v1 include freescale introduced e500mc qoriq family chips june 2008 e500mc following features powerquicc 85xx devices based e500v1 e500v2 cores e500v2 june 2008 freescale announced qoriq brand microprocessors based e500 family cores | [
5097,
2719,
3348,
4661,
3936,
1346,
5100,
4479,
2458,
3440,
1454,
1083,
4408,
5652,
912,
7361,
2845,
3708,
7905,
7990,
5665,
6111,
4702,
1199,
1386,
1388,
7654,
7099,
2133,
234,
2501,
239,
6474,
2781,
8125,
4815,
2785,
7327,
1131,
6226,
... | Test |
1,076 | 7 | GDocsDrive:gdocsdrive gdocsdrive client app google docs enables users manage files stored google docs desktop main benefit gdocsdrive allows users modify cloud files using local applications enables use desktop software microsoft office adobe suite others manage online files gdocsdrive uses google ’ cloud storage store files online storage default 15 gb storage available free charge however users extend storage google annual fee gdocsdrive paid software price 29.99 usd offering 14-day free trial currently windows version available gdocsdrive listed google apps marketplace also available techcrunch crunchbase gdocsdrive software written c++ libraries like curl openssl used http communications coded based google document list api 3.0 process modifying google cloud files using local applications involves 3 steps 1. selected file modified downloaded local system temp folder 2 file opened modified proper local application 3 file uploaded back google docs new revision added original online file gdocsdrive employs oauth 2.0 authentication method users log therefore users present credentials gdocsdrive log google ’ account sign webpage gdocsdrive uses two tokens – access token refresh token- received google operations gmail users google apps users supported 2-step verification login also supported gdocsdrive designed google docs desktop client sync tool like dropbox sugarsync although drive name gdocsdrive drive letter mapping feature | [
2390,
4759,
5571,
7451,
5889
] | Test |
1,077 | 2 | Software_Distributor:software distributor software distributor sd hewlett-packard company name hp-ux software package management system sd provides set tools creating packages install software system running hp-ux operating system packages grouped together software repository called depot server configured host multiple depots installation software packages even entire systems sd first available release 10.0 hp-ux 1995 since undergone several enhancements bug fixes provides reliable software installation tool uses client-server arrangement distribute software using background daemon called swagentd agent started boot time communicates using either tcp udp protocols rpc sd packages normally stored transmitted compressed form using either gzip compress programs tools performing sd operations normally accessed command line sd includes following commands commands include broad range command-line options allow relatively fine control task performed addition command-line programs several tools also launch gui versions x window system display gui version swinstall performs filtering software list match software packages system run commands log messages administrative area useful diagnosing installation issues tracking software loaded removed software packages built means specification file set install scripts actual software content install scripts executed software installation verification removal used prepare system software perform activation deactivation package specification file determines software package organized list locations various files loaded package restrict systems package installed determine security configuration package also provides various information package name version description software packages organized hierarchy containers highest level bundle product lowest filesets files hierarchy arranged follows actually product fileset levels needed many packages subproduct level sometimes used group together filesets bundle provides higher-level grouping related products one filesets product one products bundle fileset level used specifically loading files product installed without associated filesets c. filesets products linked together various requirement tags cause swinstall select appropriate dependencies automatically fileset multiple control scripts specific files load scripts executed following order installation corresponding set scripts executed reverse order swremove scripts include verify performing sanity check swverify command unpreinstall unpostinstall none scripts included package depending requirements installation useful performing cleanup previous packages creating links adding software directory various search environment variables forth | [
5480,
3764,
3559,
7827,
3042,
1260,
900,
2241
] | Test |
1,078 | 4 | Security_question:security question security question form shared secret used authenticator commonly used banks cable companies wireless providers extra security layer financial institutions used questions authenticate customers since least early 20th century 1906 speech meeting section american bankers association baltimore banker william m. hayden described institution use security questions supplement customer signature records described signature cards used opening new accounts spaces customer birthplace residence mother maiden name occupation age hayden noted items often left blank residence information used primarily contact customer mother maiden name useful strong test identity although observed rare someone outside customer family try withdraw money customer account said mother maiden name useful verification rarely known outside family even people opening accounts often unprepared question similarly modern practice credit card provider could request customer mother maiden name issuing replacement lost card 2000s security questions came widespread use internet form self-service password reset security questions reduced information technology help desk costs allowing use security questions online rendered vulnerable keystroke logging attacks addition whereas human customer service representative may able cope inexact security answers appropriately computers less adept users must remember exact spelling sometimes even case answers provide poses threat answers written exposing physical theft due commonplace nature social-media many older traditional security questions longer useful secure important remember security question another password therefore security question shared anyone else include information readily available social media websites remaining simple memorable difficult guess constant time understanding every question work everyone rsa u.s. network security provider division emc corporation gives banks 150 questions choose many questioned usefulness security questions security specialist bruce schneier points since public facts person easier guess hackers passwords users know create fake answers questions forget answers thus defeating purpose creating inconvenience worth investment | [
4593,
907,
6672,
1747,
3589,
3794,
5582,
7836
] | Test |
1,079 | 7 | EigenTrust:eigentrust eigentrust algorithm reputation management algorithm peer-to-peer networks developed sep kamvar mario schlosser hector garcia-molina algorithm provides peer network unique global trust value based peer history uploads thus aims reduce number inauthentic files p2p network cited approximately 3853 articles according google scholar peer-to-peer systems available today like gnutella open often anonymous lack accountability hence user malicious intent introduce peer-to-peer network resources may inauthentic corrupted malicious virus reflects poorly credibility current peer-to-peer systems research team stanford provides reputation management system peer system unique global trust value based peer history uploads peer requesting resources able access trust value peer avoid downloading files untrusted peers eigentrust algorithm based notion transitive trust peer trusts peer j would also trust peers trusted j peer calculates local trust value peers provided authentic fake downloads based satisfactory unsatisfactory transactions sat j refers number satisfactory responses peer received peer j unsat j refers number unsatisfactory responses peer received peer j local value normalized prevent malicious peers assigning arbitrarily high local trust values colluding malicious peers arbitrarily low local trust values good peers normalized local trust value c local trust values aggregated central location distributed manner create trust vector whole network based idea transitive trust peer would ask peers knows report trust value peer k weigh responses peers trust peer places assume user knew c values whole network form matrix c trust vector formula_4 defines trust value formula_5 given equation shown c assumed aperiodic strongly connected powers matrix c converge stable value point seems large value x trust vector formula_8 converge vector every peer network vector formula_8 known left principal eigenvector matrix c also note since formula_8 nodes network represents global trust value based results simple centralized trust value computing algorithm written note assume local trust values whole network available present matrix c also note equation shown converges replace initial vector formula_11 vector formula_12 m-vector representing uniform probability distribution peers basic eigentrust algorithm shown | [
6025,
2984
] | Test |
1,080 | 7 | Quorum_(software):quorum software quorum also known quorum analytics american multinational software technology company headquartered washington dc quorum produces online legislative data analysis aggregation platform provides quantitative insights qualitative policy questions quorum developed stakeholder engagement legislative tracking grassroots advocacy company operates internationally office brussels belgium serves cities counties capitols across 50 us states quorum compiles aggregates publicly available big data—in form bills amendments committee documents floor statements voting records social media posts press releases email newsletters census data—into single comprehensive database platform uses quantitative analytics identify key players specified legislation quorum used identify speaking specific issue measure effectiveness lawmakers identify connection representatives identify champions specific legislation review congressional records gauge congressional response specific issues quorum founded alex wirth jonathan marks 2014 undergraduates harvard university idea quorum born frustrating summer alex wirth spent capitol hill attempting build bipartisan support presidential youth council wirth saw first hand challenging advocates organizations influence legislative process wirth worked college roommate jonathan marks discover could use computer science make process influencing legislation easier effective initial goal see could “ use computers figure members congress know work together based previous patterns. ” beta version quorum platform built summer 2014 association harvard innovation lab financed grant harvard institute politics quorum earned funding 2014 i3 harvard college innovation challenge mckinley family grant social enterprise 2014 harvard ventures pitch competition 2015 george washington university business plan competition 2015 queen entrepreneurs competition quorum publicly launched january 26 2015 boston massachusetts may 2015 company moved headquarters washington dc closer client base quorum named number one dc startup-to-watch 2017 technical.ly may 2017 quorum opened office brussels belgium serve consultancy market europe regulatory capital quorum provides software service saas clients pay annual subscription provide public affairs government affairs team access quorum software data | [
330
] | Test |
1,081 | 4 | NetVault_Backup:netvault backup netvault set data protection software developed supported quest software netvault backup backup recovery software product used protect data software applications physical virtual environments one central management interface supports many servers application platforms protocols unix linux microsoft windows vmware microsoft hyper-v oracle sybase microsoft sql server ndmp oracle acsls ibm das/aci microsoft exchange server db2 teradata quest software offers data deduplication protection nas filers ndmp netvault backup based client-server architecture central netvault backup server provides job management media management device management client management reporting notifications logging functions netvault backup server maintains history backups netvault backup database enabling users identify object want restore netvault clients “ agents ” work netvault backup server back recover respective servers applications data client software installed machine protected netvault webui enables centralized administration netvault backup server browser netvault supports tape drives tape libraries backup devices attached central server protected machine located anywhere network enabling lan-free backups additionally devices controlled ndmp attached supported filer netvault backup server master backup server deployed microsoft windows linux netvault backup protect windows server linux solaris freebsd aix hp-ux hyper-v vmware also back variety applications nas devices ndmp using so-called plug-ins list includes microsoft sql server oracle microsoft exchange server lotus notes db2 sybase others three options within netvault suite enabling backup recovery disk tape bare metal recovery bmr data deduplication quest supports netapp products following technologies originally netvault backup intended back physical tapes tape drives however product soon extended support backup disk data deduplication netvault backup supports quest dr appliance netvault smartdisk dell dr appliance hardware-based inline deduplication storage product deduplication engine originally developed ocarina networks netvault ocarina engineering teams worked integrate two technologies netvault backup also used netvault smartdisk disk storage repository deduplication product netvault smartdisk perform post-process data deduplication represents contiguous storage pool disk without subdivided virtual tapes slots easier management allows byte-level variable block-based software deduplication netvault backup supports emc data domain via dd boost quantum dxi lan-free backups netvault backup write physical tape drive vtl shared multiple machines using fibre channel iscsi | [
6731,
1998,
972,
2390,
4295,
2796,
4759,
5571,
7715,
578,
900,
3906
] | Test |
1,082 | 1 | ModelRight:modelright modelright database design data modeling tool developed modelright inc used data modelers database developers database architects create visualize document databases entity relationship diagram erd modelright works | [
6144,
6386
] | Test |
1,083 | 3 | PWRficient:pwrficient pwrficient name series microprocessors designed p.a semi pa6t-1682m one became actual product pwrficient processors comply 64-bit power isa designed high performance extreme power efficiency processors highly modular combined multi-core system-on-a-chip designs combining cpu northbridge southbridge functionality single processor die pa6t first processor core p.a semi offered two distinct lines products 16xxm dual core processors 13xxm/e single core processors pa6t lines differed l2 cache size memory controllers communication functionality cryptography offloading features one time p.a semi plans offer parts 16 cores pa6t core first power isa core designed scratch outside aim alliance i.e designed ibm motorola/freescale apple inc. ten years since texas instruments one investors p.a semi suggested fabrication plants would used manufacture pwrficient processors pwrficient processors initially shipped select customers february 2007 released worldwide sale q4 2007 p.a semi bought apple inc. april 2008 closed development pwrficient architecture processors however continue manufacture sell support components foreseeable future due agreement us government processors used military applications pwrficient processors comprise three parts pa6t conexium envoi | [
2448,
7327,
2719,
3348,
4661,
3936,
1075,
1346,
4847,
2458,
3440,
5822,
4408,
5652,
912,
2926,
7637,
7361,
2845,
3708,
5665,
4702,
1199,
1386,
1388,
7099,
234,
2501,
239,
6474,
8125,
4815,
4537,
1131,
608,
6226,
7499,
1237,
2257,
3674,
... | Test |
1,084 | 9 | Judoscript:judoscript judoscript one several general purpose programming languages designed primarily scripting java platform originator primary developer software engineer james jianbo huang judoscript one first general purpose scripting languages designed specifically use java platform james jianbo huang originated judoscript initially collection several separate packages libraries domain specific languages originated use java platform j2ee enterprise applications huang designed judoscript provide globally simple intuitive scripting framework capable leveraging full suite java packages third-party extensions java foundation design strategy provide infrastructure 1 flexibility command shell 2 full interoperability access facilities java 3 simplified syntax intuitive developers necessarily java programmers design principles judoscript huang stated generally suitable enterprise-scale application development intended replace traditional java syntax example unlike beanshell scripting language judoscript many simplifying syntax constructs i.e. syntactic sugar available within traditional java syntax means code written judoscript expected compile java compiler without changes advantage gained trade-off judoscript allows specialized constructs designed specifically use given problem-domain obviates need bottom programming designed scratch using basic data structures custom-made algorithms admittedly bottom-up programming already obviated large part extensive availability standard third-party libraries within java platform problem according huang libraries often assume higher level experience java programming feasible practical given development requirements scripting applications example simple html scraping routine written loop | [
1361,
6507,
7277,
5983,
5965,
6428
] | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.