node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
1,686 | 2 | Internet_Connect:internet connect internet connect program mac os x allows user activate dial-up connections internet via isp vpn also provides simple way connect airport network latest version mac os x 10.4 internet connect application provides general tools detailed network pane system preferences allows user configure control systemwide network settings however mac os x 10.5 internet connect functions incorporated network pane system preferences application longer included use internet connect generally necessary macintosh connected internet ethernet device dsl cable internet service except manage connections subordinate bluetooth equipment | [
11521,
2819,
1796,
3719,
4615,
10888,
11402,
9100,
5647,
10512,
1042,
8852,
9109,
7318,
4888,
3228,
11037,
2207,
1439,
811,
3371,
5292,
1710,
6700,
7983,
8877,
1074,
10036,
3766,
2232,
9912,
11257,
9406,
6849,
4933,
713,
9418,
9035,
3790,
... | Test |
1,687 | 2 | Carbide.c++:carbide.c++ carbide.c++ software development tool c++ development symbian os used develop phones use os well applications run phones based eclipse ide platform enhanced extra plug-ins support symbian os development product provided symbian foundation open source model april 2009 nokia transferred carbide.c++ many software developer tools symbian foundation members symbian community manage contribute code carbide.c++ product carbide.c++ provided symbian foundation two different tool packages adt pdt basic installers include carbide.c++ several eclipse-based plug-ins several stand-alone tools adt/pdt v1 contains carbide.c++ v2.0.4 br adt/pdt v2 q4 2009 targeted contain carbide.c++ v2.2 carbide.c++ based latest versions eclipse ide eclipse cdt extended symbian os -specific features currently supports winscw x86 c++ compiler found codewarrior production emulator binaries target binaries supports gcc arm rvct compilers sold separately winscw gcc compilers actually provided sdk explicitly included carbide ide carbide.c++ branched parts cdt nearly contained within added plug-ins added top eclipse branches mostly relate different semantics codewarrior debugger engine compared gdb eclipse previously supported carbide.c++ similar standard eclipse installation still used types development java perl provided correct plug-ins installed using eclipse self-update mechanism similarly ought possible produce product similar functionality carbide.c++ moving carbide.c++ plug-ins standard eclipse installation currently facility offered nokia carbide.c++ supports symbian build system v1 v2 aka raptor former perl-based build system latter built using python supports next generation symbian os operating systems main advantage supporting sbsv1 v2 carbide users create command-line builds parallel ide builds manage two different workspaces disadvantage sbsv1 dependency checking automatic every build re-building large projects take carbide.c++ built short cuts starting v1.3 speed rebuilds early versions carbide v1.0 1.1 supported different build method many problems carbide.c++ development tools family created replace codewarrior symbian os primary development environment symbian os adoption tool slow codewarrior usage diminishing since older tool longer supports latest changes symbian os s60 platforms carbide provided three commercial products one free product today product part symbian foundation offering completely free products ranged price 300 8000 euros depending features set licensing model carbide slow reception symbian community developers generally fond moving new tools early versions carbide problems several frequently cited complaints example lack symbian-os-style code indenting lack easy find files facility speed import symbian os build files mmps difficulties using on-device debugging addition much-anticipated managed build system work properly rather offering true incremental build frequently deleted everything started otherwise reception warm development environment preferred codewarrior ide based java speed memory concerns ide often slow pretty big memory foot print trademarks java environment carbide.c++ made steady progress addressing issues brought developer community codewarrior usage dropped significantly due improvements carbide codewarrior lack support newer versions symbian os symbian os c++ development need carbide.c++ ide symbian os-based sdk sdk contains emulator also libraries header files required symbian os development development kits available forum nokia symbian foundation web sites please note kits may different names reflecting additional capabilities cust kits developer kits pdk issk | [
10754,
6276,
11271,
6797,
11277,
5406,
2465,
9509,
3626,
9262,
7983,
11446,
11208,
4171,
7246,
4305,
7253,
6998,
2658,
8423,
10599,
3583
] | Test |
1,688 | 4 | DROWN_attack:drown attack drown decrypting rsa obsolete weakened encryption attack cross-protocol security bug attacks servers supporting modern tls protocol suites using support obsolete insecure ssl v2 protocol leverage attack connections using up-to-date protocols would otherwise secure drown affect types servers offer services encrypted tls yet still support sslv2 provided share public key credentials two protocols additionally public key certificate used different server supports sslv2 tls server also vulnerable due sslv2 server leaking key information used tls server full details drown announced march 2016 along patch disables sslv2 openssl vulnerability assigned id patch alone sufficient mitigate attack certificate found another sslv2 host viable countermeasure disable sslv2 servers researchers estimated 33 https sites affected vulnerability march 1 2016 drown acronym decrypting rsa obsolete weakened encryption exploits vulnerability combination protocols used configuration server rather specific implementation error according discoverers exploit fixed making changes client software web browsers exploit includes chosen-ciphertext attack use sslv2 server bleichenbacher oracle proof-of-concept attack demonstrated multi-gpu configurations commercial cloud computing could perform part codebreaking calculations cost around 18,000 gpu setup per-attack cost 400 cloud successful attack provide session key captured tls handshake investigators described attack general drown attack also found specific weakness openssl implementation sslv2 allowed called special drown attack vastly reduced effort required break encryption making real-time man-in-the-middle attacks possible required modest computing resources original reporters bug security researchers nimrod aviram sebastian schinzel protect drown server operators need ensure private keys used anywhere server software allows sslv2 connections includes web servers smtp servers imap pop servers software supports ssl/tls openssl group released security advisory set patches intended mitigate vulnerability removing support obsolete protocols ciphers however server certificate used servers support sslv2 still vulnerable patched servers numerous sources recommended vulnerability patched soon possible site operators | [
1024,
513,
5636,
517,
9744,
4117,
8726,
535,
9761,
2083,
4644,
4133,
7736,
9281,
1608,
3657,
8779,
10831,
11345,
4703,
7264,
8288,
4194,
8292,
10341,
2169,
3707,
10875,
3711,
8320,
5764,
1157,
2187,
4240,
1683,
2709,
1688,
2717,
3742,
937... | Test |
1,689 | 4 | Parasoft:parasoft parasoft officially parasoft corporation independent software vendor specializing automated software testing application security headquarters monrovia california founded 1987 four graduates california institute technology planned commercialize parallel computing software tools working caltech cosmic cube first working hypercube computer built 90 parasoft leveraged technology parallel software toolkit create software test automation tools traditional software development well parallel starting runtime error detection c c++ insure++ product also added capabilities static code analysis unit testing ultimately expanded include application security functional testing service virtualization parasoft develops automated defect prevention technologies support automated defect prevention methodology developed adam kolawa technologies automate number defect prevention practices java c c++ .net static code analysis practice identifies coding issues lead security reliability performance maintainability issues later 1996 parasoft submitted patent application rule-based static code analysis since original static analysis technology extended include security static analysis data flow analysis software metrics 1996 parasoft submitted patent applications technology automatically generates unit test cases since original unit testing technology extended include code coverage analysis regression testing traceability peer code review practice involves manually inspecting source code examine algorithms review design search subtle errors automated tools detect although peer inspection automated peer code reviews preparation notification tracking automated cloud soa apis enterprise environments parasoft technologies automate practices api testing integration testing system testing load testing penetration testing parasoft service soa quality technology first developed 2002 parasoft also develops memory error detection technology finds run-time errors c c++ programs patents submitted technology 1995 1996 service virtualization parasoft technologies used automatically capture emulate dependent system behavior mainframes third-party components system component unavailable difficult access development testing purposes parasoft various technologies used demonstrating industry regulatory compliance adopting agile software development devops continuous delivery continuous testing test automation parasoft joined eclipse consortium board stewards 2002 several analyst reports software industry publications mentioned company service virtualization technology embedded system software development tools parasoft c/c++test comprehensive software testing tool contains functionality test find software defects includes static code analysis functionality 2,000 rules support major standards safety-critical software security misra jsf ul-2900 cwe cert also functionality software metrics unit test generation execution well code coverage analysis c/c++test integrates parasoft dtp provide full reporting analytics needed software development especially embedded safety-critical systems devices parasoft jtest static analysis unit testing tool java parasoft started shipping 1997 since jtest numerous awards including multiple jolt awards dr. dobb journal well multiple codies jtest 1100 coding rules support major standards owasp top 10 cwe jsf pci-dss ul-2900 jtest works standalone product via eclipse visual studio plugin also work command line tool lightweight engine used ci systems jenkins continuous testing jtest integrates parasoft dtp full reporting analytics including industry specific reports owasp cwe jtest unit test assistant called uta helps create unit tests including support mocks stubs also integrates running applications help create meaningful tests advice expanding improving existing tests parasoft dottest set tools testing .net applications works plugin visual studio supports development testing practices static code analysis unit test creation execution code coverage software metrics configurations coding standards like cwe owasp ul-2900 available dottest connected parasoft dtp provide full traceability assist compliance related software industry fda medical devices need able prove practices testing performed part audit parasoft insure++ automated runtime debugger memory error detection tool parasoft began selling 1993 insure++ often used find common memory problems c c++ programs memory leaks memory underruns overflows numeric overflows performs dynamic analysis using source code instrumentation allows catch many kinds errors including static heap errors well parasoft soatest automated api testing tool allows developers testers also perform functional testing end-to-end testing security testing load performance testing supports 100 common protocols web services rest json mq jms tibco http xml edi tests created either programmatically graphically allowing testers developers create share tests soatest functionality intelligent stubs also integrates parasoft virtualize full api protocol simulation service virtualization help shift testing earlier development process soatest integrates parasoft continuous testing platform allow users create manage execute test cases via browser well providing reports analytics parasoft virtualize service virtualization tool sometimes also called api simulation provides users ability create deploy manage simulated test environments well simplify test data management primarily facilitate testing earlier well improve access systems may scheduling constraints expensive maintain dedicated versions integrates parasoft soatest provide full end-to-end testing capabilities virtualize integrates parasoft continuous testing platform allows users create manage deploy virtual test assets environments web interface well integrated continuous integration system parasoft dtp hub development testing released 2003 name parasoft concerto 2012 dtp best show embeddy award vdc research dtp collects data various software development activities testing static analysis code coverage metrics well integrating sdlc systems bug-tracking peer review requirements data collected used create detailed reports software quality well compliance variety industry standards like fda misra do-178b/c also supports security standards cert owasp cwe security reports include data standard risk frameworks like “ common weakness risk analysis framework ” cwe help measure so-called technical impact finding means instead simply reporting software defect like buffer overflow data include information kinds security problems occur overflow exposure private data ddos information helps developers security testers prioritize findings important addition reporting dashboards dtp analytics engine called “ process intelligence engine ” “ pie ” users take advantage pre-build analytics modules tasks like change-based testing also use graphical tool web interface create analytics parasoft received customers choice award gartner march 2019 best software test automation software 2019 reviewed customers parasoft soatest recognized leader forrester 2018 forrester wave omnichannel functional test tools reported said parasoft shined evaluation specifically around effective test maintenance strong ci/cd application lifecycle management alm platform integration parasoft received best show software development award testing category sd times 2018 part sd times 100 list parasoft global provider software test automation tools analytics global headquarters monrovia california headquarters building heart monrovia high tech corridor home marketing development sales solution architects technical support professional services parasoft distributors canada latin america provide local sales technical support parasoft strong presence emea centers around offices krakow poland hague netherlands krakow full range capabilities development technical support professional services sales solution architects variety languages hague staff marketing sales solution architects professional services technical support parasoft subsidiaries berlin germany london uk stockholm sweden distributors france italy israel south africa early corporate history parasoft strong ties asia shanghai china parasoft subsidiary full staff marketing sales solution architects professional services technical support parasoft also subsidiaries sales staff solution architects professional services technical support bangalore india singapore techmatrix distributor parasoft japan two companies relationship going back two decades parasoft also distributors south korea australia new zealand | [
6373,
3048,
5677,
814,
7228,
6998,
11446,
5404,
2045,
3583
] | Test |
1,690 | 4 | Palm_OS_viruses:palm os viruses viruses exist palm os based devices ever designed typically mobile devices difficult virus writers target since simplicity provides fewer security holes target compared desktop | [
3072,
6786,
5764,
7044,
10245,
10756,
9227,
9356,
9102,
7441,
8978,
4863,
4883,
4245,
278,
9233,
10392,
9242,
3867,
10141,
5281,
9761,
2213,
8998,
9256,
939,
300,
9771,
1970,
4023,
10297,
3643,
6588,
7739,
9791,
1088,
3395,
8387,
4165,
25... | None |
1,691 | 4 | ARMM_(Usenet):armm usenet automated retroactive minimal moderation armm program developed richard depew 1993 aid control usenet abuse concerned abusive posts emanating certain anonymous-posting sites depew developed armm allow news administrators automatically issue cancel messages posts controversial act many news administrators users concerned censorship netnews medium early version armm contained bug caused post follow-ups messages recursively sending posts news.admin.policy newsgroup early example unintentional usenet spam | [
3350
] | None |
1,692 | 4 | Internet_censorship_circumvention:internet censorship circumvention internet censorship circumvention use various methods tools bypass internet censorship various techniques methods used bypass internet censorship differing ease use speed security risks methods use alternate dns servers evade blocking using alternate address address lookup system access site techniques using website mirrors archive sites rely copies site available different locations additionally solutions rely gaining access internet connection subject filtering often different jurisdiction subject censorship laws using technologies proxying virtual private networks anonymization networks arms race developed censors developers circumvention software resulting sophisticated blocking techniques censors development harder-to-detect tools researchers estimates adoption circumvention tools vary substantially disputed barriers adoption include usability issues difficulty finding reliable trustworthy information circumvention lack desire access censored content risks breaking law many methods available may allow circumvention internet filtering widely vary terms implementation difficulty effectiveness resistance detection filters may block specific domain names either using dns hijacking url filtering sites sometimes accessible alternate names addresses may blocked websites may offer content multiple pages domain names example english wikipedia available https //en.wikipedia.org/ also mobile-formatted version https //en.m.wikipedia.org/ dns resolution disrupted site blocked ways may possible access site directly ip address using alternative dns servers public recursive name servers may bypass dns-based blocking censors may block specific ip addresses depending filtering implemented may possible use different forms ip address specifing address different base example following urls access site although browsers recognize forms http //208.80.152.2 dotted decimal http //3494942722 decimal http //0320.0120.0230.02 dotted octal http //0xd0509802 hexadecimal http //0xd0.0x50.0x98.0x2 dotted hexadecimal cached pages search engines keep copies previously indexed webpages cached pages often hosted search engines may blocked example google allows retrieval cached pages entering cache some-url search request mirror archive sites copies web sites pages may available mirror archive sites internet archive wayback machine rss aggregators rss aggregators feedly may able receive pass rss feeds blocked accessed directly web proxies proxy websites configured allow users load external web pages proxy server permitting user load page coming proxy server blocked source however depending proxy configured censor may able determine pages loaded and/or determine user using proxy server example mobile opera mini browser uses proxy-based approach employing encryption compression order speed downloads side effect allowing circumvent several approaches internet censorship 2009 led government china ban special chinese versions browser domain fronting circumvention software implement technique called domain fronting destination connection hidden passing initial requests content delivery network popular site technique used messaging applications including signal telegram large cloud providers amazon web services google cloud longer permit use ssh tunneling establishing ssh tunnel user forward traffic encrypted channel outgoing requests blocked sites response sites hidden censors appears unreadable ssh traffic virtual private network vpn using vpn user experiences internet censorship create secure connection permissive country browse internet situated country services offered monthly fee others ad-supported according globalwebindex 400 million people use virtual private networks circumvent censorship increased level privacy tor advanced tools tor route encrypted traffic multiple servers make source destination traffic less traceable cases used avoid censorship especially configured use traffic obfuscation techniques censor may able detect block use circumvention tools efforts make circumvention tools less detectable randomizing traffic attempting mimic non-blocked protocol tunneling traffic whitelisted service using techniques including domain fronting tor circumvention tools adopted multiple obfuscation techniques users use depending nature connection sometimes called pluggable transports sneakernet transfer electronic information especially computer files physically carrying data storage media one place another sneakernet move data regardless network restrictions simply using network one example widely adopted sneakernet network el paquete semanal cuba circumvention tools seen spikes adoption response high-profile blocking attempts however studies measuring adoption circumvention tools countries persistent widespread censorship report mixed results measures estimates circumvention tool adoption reported widely divergent results 2010 study harvard university researchers estimated users use censorship circumvention tools—likely less 3 users even countries consistently implement widespread censorship studies reported substantially larger estimates disputed china anecdotal reports suggest adoption circumvention tools particularly high certain communities universities survey freedom house found users generally find circumvention tools difficult use market research firm globalwebindex reported 35 million twitter users 63 million facebook users china services blocked however estimates disputed facebook advertising platform estimates 1 million users china reports twitter adoption estimate 10 million users studies pointed efforts block circumvention tools china reduced adoption tools tor network previously 30,000 users connecting china 2014 approximately 3,000 chinese users thailand internet censorship existed since 2002 sporadic inconsistent filtering small-scale survey 229 thai internet users research group university washington found 63 surveyed users attempted use circumvention tools 90 successful using tools users often made on-the-spot decisions use circumvention tools based limited unreliable information variety perceived threats abstract others concrete based personal experiences response 2014 blocking twitter turkey information alternate dns servers widely shared using another dns server google public dns allowed users access twitter day block total number posts made turkey 138 according brandwatch internet measurement firm april 2018 ban telegram messaging app iran web searches vpn circumvention software increased much 48x search terms evidence users downloading unsafe software many third iranian internet users used psiphon tool days immediately following block june 2018 many 3.5 million iranian users continued use tool circumvention anonymity different circumvention systems designed bypass blocking usually protect identities anonymous systems protect user identity contribute circumvention primary function important understand open public proxy sites provide anonymity view record location computers making requests well websites accessed many jurisdictions accessing blocked content serious crime particularly content considered child pornography threat national security incitement violence thus important understand circumvention technologies protections provide use tools appropriate particular context great care must taken install configure use circumvention tools properly individuals associated high-profile rights organizations dissident protest reform groups take extra precautions protect online identities circumvention sites tools provided operated trusted third parties located outside censoring jurisdiction collect identities personal information best trusted family friends personally known circumventor family friends available sites tools provided individuals organizations known reputations recommendations endorsement others may need used commercial circumvention services may provide anonymity surfing internet could compelled law make records users personal information available law enforcement five general types internet censorship circumvention software cgi proxies use script running web server perform proxying function cgi proxy client sends requested url embedded within data portion http request cgi proxy server cgi proxy server pulls ultimate destination information data embedded http request sends http request ultimate destination returns result proxy client cgi proxy tool security trusted far operator proxy server trusted cgi proxy tools require manual configuration browser client software installation require user use alternative potentially confusing browser interface within existing browser http proxies send http requests intermediate proxying server client connecting http proxy sends exactly http request proxy would send destination server unproxied http proxy parses http request sends http request ultimate destination server returns response back proxy client http proxy tool security trusted far operator proxy server trusted http proxy tools require either manual configuration browser client side software configure browser user configured http proxy tool allows user transparently use normal browser interface application proxies similar http proxies support wider range online applications peer-to-peer systems store content across range participating volunteer servers combined technical techniques re-routing reduce amount trust placed volunteer servers social networks establish trust relationships server client users peer-to-peer system trusted far operators various servers trusted extent architecture peer-to-peer system limits amount information available single server server operators trusted cooperate combine information hold re-routing systems send requests responses series proxying servers encrypting data proxy given proxy knows either data came going decreases amount trust required individual proxy hosts list different internet censorship circumvention software | [
4224,
10368,
5254,
138,
9868,
1169,
9233,
2076,
9117,
1317,
3625,
1070,
11695,
10417,
6834,
2485,
8630,
4797,
8640,
3777,
7873,
2884,
3781,
2887,
7248,
11221,
5085,
2661,
10341,
615,
9193,
6000,
4725,
5749,
7541,
8054,
5887
] | Test |
1,693 | 3 | Bubble_Bobble:bubble bobble creator bubble bobble fukio mitsuji mtj went create games syvalion volfied died december 11 2008 game plot baron von blubba kidnapped brothers bubby bobby girlfriends turned brothers bubble dragons bub bob bub bob finish 100 levels cave monsters order rescue game player controls one two dragons players move along platforms fall lower ones jump higher ones gaps level limited single screen scrolling however screen gaps bottom edge players fall reappear top level certain number enemies must defeated order advance players must blow bubbles trap enemies burst bubbles colliding enemy defeated manner turns food item picked extra points defeating multiple enemies awards higher scores causes valuable food items appear bubbles float certain length time bursting players jump ride otherwise inaccessible areas magic items appear time time grant special abilities advantages picked special bubbles occasionally appear burst attack enemies fire water lightning furthermore player collects letter bubbles form extend bonus life earned players immediately advance next level player loses one life upon touching free enemies projectiles rocks fireballs lasers bottles enemies turn angry —turning pink color moving faster—if escape bubble left long players spend certain amount time current level return normal either player loses life time limit expires additional invincible enemy appears player actively chasing using vertical horizontal movements disappear level cleared player loses life one enemy left immediately becomes angry remains state defeated 100th final level players face boss one first games feature multiple endings completing level 100 single-player mode reveals message stating game truly ended hint player come friend two players complete game see happy end brothers transformed human selves reunited girlfriends ending also includes code deciphered allows game played faster difficult super mode mode completed two players second happy end displayed super drunk defeated boss revealed brothers parents control outside influence brothers return normal reunited parents girlfriends ports bubble bobble released commodore 64 zx spectrum amiga atari st msx2 amstrad cpc x68000 ms-dos apple ii fm towns marty master system game boy game boy color playstation saturn nes famicom disk system game gear mobile phone sprint pcs original 8- 16-bit versions msx2 nes/famicom disk system game boy master system versions made taito though master system version published sega game gear port emulates master system version bubble bobble done south korean developer open corporation commodore 64 spectrum amiga versions developed software creations published uk firebird software computer ports made us-based novalogic exception x68000 game japan done dempa shinbunsha game boy color version co-created video game developers dreams i.t.l commodore 64 coder steve ruddy recalled retro gamer master system/game gear version two hundred levels effect normal super modes consecutively considered one best conversions available version originally released final bubble bobble 1988 master system japan arrived europe three years later title shortened bubble bobble game never released master system north america game gear instead platform region particular version bubble bobble msx2 port like master system/game gear version features one hundred levels normal mode another set hundred super mode unlike master system/game gear version super mode msx2 game alternative normal mode rather succeeding accessed entering special code similar konami code 1 2 player select screen x68000 version bubble bobble includes secret sybubblun mode contains 20 difficult levels characters changed syvalion another game designed fukio mitsuji 1996 taito announced original source code lost probe entertainment charge home conversions taito sent bubble bobble arcade pcb could play original game reproduce mechanics led release bubble bobble also featuring saturn playstation pc 1996 published acclaim entertainment game boy game boy color versions since game boy nature single player device storyline involves bub looking moon water cure brother known bubble bobble classic bubble bobble respectively mean machines gave game boy port game score 91 noting changes made game played identical original arcade port provides much addiction challenge four reviewers electronic gaming monthly stated game gear version faithful conversion original works well portable form particularly praised simplicity gameplay concept graphics two-player link option spectrum version voted number 58 sinclair readers top 100 games time gamesradar ranked 24th best nes game ever made staff praised advancements platform games time use multiple endings october 2005 version released xbox playstation 2 microsoft windows part taito legends compilation end 2006 new port mobile phones europe japan released december 24 2007 nes version bubble bobble released north america nintendo virtual console service wii famicom version bubble bobble also released nintendo eshop october 16 2013 nintendo 3ds january 29 2014 wii u november 11 2016 game included nes classic edition arcade version bubble bobble widely bootlegged due security chip installed taito known ps4 based motorola 6800 none bootlegs play exactly like original decapping mame team reverse engineered workings chip emulate following project bubble bobble redux able implement exact version bubble bobble bootleg boards version exists bbc micro public domain though never officially released according one creators coded independently 1988 clone c64 version approached publishers deemed would financially viable release licensed product bbc micro time double bobble 2000 public domain shareware made port bubble bobble atari falcon030 gameplay converted arcade machine released 1995 atari demo/game group reservoir gods mobygames one last commercial offerings near dead system time game reviewed december 1995 issue uk magazine st format dec 1995 scans receiving rating 96 2002 fan-made clone texas instruments ti-8x series calculators released bubble bobble lost cave fan project added new levels runs original arcade hardware bubble bobble characters made cameo appearances manga gamest nª49 gasmest island mokushiroku october 1992 created shinseisha bub bubble bobble chack chack n'pop appeared manga may 2009 bubblun makes cameo manga high score girl | [
8709,
4043,
8300,
8492,
9166,
5263,
10316,
4690,
10931,
6390,
5882,
5275,
9501,
4894
] | None |
1,694 | 3 | Linux_kernel_oops:linux kernel oops computing oops deviation correct behavior linux kernel one produces certain error log better-known kernel panic condition results many kinds oops instances oops event may allow continued operation compromised reliability term stand anything simple mistake kernel detects problem kills offending processes prints oops message linux kernel engineers use debugging condition created oops fixing underlying programming error system experienced oops internal resources may longer operational thus even system appears work correctly undesirable side effects may resulted active task killed kernel oops often leads kernel panic system attempts use resources lost official linux kernel documentation regarding oops messages resides file kernel sources logger configurations may affect ability collect oops messages codice_1 software collect submit kernel oopses repository www.kerneloops.org website provides statistics public access reported oopses person familiar technical details computers operating systems oops message might look confusing unlike operating systems windows macos linux chooses present details explaining crash kernel rather display simplified user-friendly message bsod windows simplified crash screen proposed times however currently none development | [
2560,
4616,
3082,
2571,
5644,
5139,
9237,
10780,
4637,
10785,
3618,
6180,
9257,
1584,
8242,
9266,
4161,
10817,
8772,
6213,
8268,
589,
593,
2134,
3162,
10333,
2658,
6244,
5222,
10856,
6763,
4207,
5744,
7795,
5244,
4734,
11391,
7812,
8326,
... | Test |
1,695 | 5 | Wireless_Village:wireless village wireless village set specifications mobile instant messaging presence services intended standard cellphones mobile devices use services across platforms many wireless phones include mobile instant messaging capabilities designed hook messaging services using imps carrier network formerly known wireless village protocol phones implement im icon phone typically renamed customized cellphone carrier removed completely supported network level nokia motorola phones feature many sony ericsson phones white paper describes service possible protocol makes use existing internet web technologies technologies implemented widely well tested use within protocol ensure easy implementation interoperability testing xml extensible markup language rapidly emerging lingua franca representing structured data web extent possible protocol uses xml represent protocol data exchanged imps session imps activities ietf impp received widespread interest throughout industry although still development extent possible wireless village initiative support cpim draft build upon useful standards space include multipurpose internet mail extensions mime registering format imps protocol messages announcement made service conceived ericsson motorola nokia specification maintained open mobile alliance currently version 1.3 protocol public services exist using wireless village unlocked phone configured use services therefore connect instant messaging services implemented yamigo free communications service based finland allowed instant messaging mobile phones wireless data services gprs service based protocol wireless village developed open mobile alliance joint venture nokia sony ericsson motorola mobile device manufacturers certain models mobile phones include chat client could access yamigo network included certain models phones nokia motorola sony ericsson siemens registered yamigo users could send messages users yahoo messenger msn messenger aol instant messenger icq yamigo supported importing contact lists services automatically users connected yamigo via wap internet service sign page users selected frequently phone polled yamigo network client-server protocol receiving messages depended often phone set poll network service abandoned late 2005 last upgrade version .19 april 2005 | [
4609,
7396,
1285,
11240,
5875,
9207
] | None |
1,696 | 5 | Compiled_Wireless_Markup_Language:compiled wireless markup language networking mobile devices wmlc format efficient transmission wml web pages wireless application protocol wap primary purpose compress rather tokenise wml page transport low-bandwidth internet connections gprs/2g wmlc apparently synonymous wireless application protocol binary xml wbxml wmlc efficient pages contain frequently repeated strings characters commonly used phrases www nowiki http //www. /nowiki tokenised replaced single byte transmission re-inserted destination wmlc added advantage data progressively decoded unlike compression algorithms require data available decompression begins soon first bytes wmlc data available wap browser start creating page means user see page constructed downloaded content type application/vnd.wap.wmlc | [
11240,
5875
] | None |
1,697 | 1 | Deductive_database:deductive database deductive database database system make deductions i.e. conclude additional facts based rules facts stored deductive database datalog language typically used specify facts rules queries deductive databases deductive databases grown desire combine logic programming relational databases construct systems support powerful formalism still fast able deal large datasets deductive databases expressive relational databases less expressive logic programming systems recent years deductive databases datalog found new application data integration information extraction networking program analysis security cloud computing deductive databases logic programming deductive databases reuse large number concepts logic programming rules facts specified deductive database language datalog look similar prolog however important differences deductive databases logic programming | [
2688,
5632,
8201,
4376,
10137,
9631,
9397,
4155,
7868,
9147,
11324,
2369,
11457,
6085,
9286,
2512,
2901,
7767,
11098,
987,
7650,
8291,
9828,
8421,
10471,
5880,
1146,
6395,
3196
] | None |
1,698 | 9 | JavaScript_framework:javascript framework javascript framework application framework written javascript differs javascript library control flow library offers functions called parent code whereas framework defines entire application design developer call framework instead framework call use code particular way javascript frameworks follow model–view–controller paradigm designed segregate web application orthogonal units improve code quality maintainability examples angularjs ember.js meteor.js | [
8068,
3462,
6791,
1802,
6154,
8605,
6176,
803,
5031,
1203,
438,
7871,
5311,
8262,
5067,
339,
4056,
9560,
9561,
8923,
8289,
9195,
5101,
10991,
10739,
10744
] | Test |
1,699 | 2 | Printer_Setup_Utility:printer setup utility printer setup utility application mac os x served allow user configure printers physically connected computer connected via network utility provided specific tools user friendly printers pane system preferences mac os x 10.5 leopard printer setup utility removed features placed print fax system preferences pane viewing individual printers queues moved printer proxy application | [
11521,
2819,
1796,
3719,
4615,
10888,
11402,
9100,
5647,
10512,
1042,
8852,
9109,
7318,
4888,
3228,
11037,
2207,
1439,
811,
3371,
5292,
1710,
6700,
7983,
8877,
1074,
10036,
3766,
2232,
9912,
11257,
9406,
6849,
4933,
713,
7626,
9035,
9418,
... | Test |
1,700 | 2 | LinHES:linhes linhes linux home entertainment server linux distribution designed use home theater pcs htpcs version 6 called knoppmyth recent release r8 64-bit machines based arch linux though previous versions based knoppix debian linhes includes custom scripts install configure mythtv pvr software well number add-ons standard htpc hardware supported much even configured automatically making often complex installation configuration process relatively easy pain-free cecil watson developed maintains linhes operating system linhes linux distribution equivalent windows media center linhes comes cd-rom software distribution automates setup popular mythtv package well several htpc-related add-ons ultimately linhes used create home theater pc htpcs commonly plugged standard-definition television sdtv high-definition television hdtv rather monitors complete home theater experience htpcs bring power pcs living room one device common complaint mythtv difficult time-consuming install configure goal linhes make creating maintaining home theater pc simple possible blank system transformed fully functional htpc around 20 minutes 20 minutes system capable linhes used install full mythtv client server system means front-end stored device back-end front-end software required visual elements gui regular user utilize find play manipulate media files etc back-end server media files actually stored full front-end back-end system may advantage 'portability i.e standalone device dependent separate server like video game console example alternatively linhes used install mythtv client front-end-only system example users may central storage device server house server accessed numerous devices throughout house devices needing front-end installation devices containing minimal hardware linhes also run directly cd-rom i.e without installation providing network connection pc 'complete installation mythtv back-end server using 'server separate one front-end units obvious advantages multiple simultaneous access shared media files server used would generally hardware relatively high specification would kept outside main living room advantage keeping server pc outside living room cooling fan required accommodate 'fast processor quite noisy certain hard drives expensive invest fanless/heat sinking equipment avoid noise problems linhes also used upgrade existing linhes knoppmyth installations linhes users generally discuss ideas help others official forum website linhes r7.4 last 32-bit release | [
8837,
7435,
6797,
10127,
2321,
5397,
4887,
10394,
673,
3745,
10530,
9253,
10149,
11305,
6058,
7854,
2738,
4147,
7602,
4790,
823,
439,
56,
59,
8124,
3903,
4673,
2375,
4039,
5067,
8907,
3664,
1107,
1110,
9693,
2914,
485,
3685,
9064,
4841,
... | Test |
1,701 | 1 | Quorum_(distributed_computing):quorum distributed computing quorum minimum number votes distributed transaction obtain order allowed perform operation distributed system quorum-based technique implemented enforce consistent operation distributed system quorum-based voting used replica control method well commit method ensure transaction atomicity presence network partitioning distributed database system transaction could executing operations multiple sites since atomicity requires every distributed transaction atomic transaction must fate commit abort every site case network partitioning sites partitioned partitions may able communicate quorum-based technique comes fundamental idea transaction executed majority sites vote execute every site system assigned vote v. let us assume total number votes system v abort commit quorums v v respectively following rules must obeyed implementation commit protocol first rule ensures transaction committed aborted time next two rules indicate votes transaction obtain terminate one way replicated databases data object copies present several sites ensure serializability two transactions allowed read write data item concurrently case replicated databases quorum-based replica control protocol used ensure two copies data item read written two transactions concurrently quorum-based voting replica control due gifford 1979 copy replicated data item assigned vote operation obtain read quorum v write quorum v read write data item respectively given data item total v votes quorums obey following rules first rule ensures data item read written two transactions concurrently additionally ensures read quorum contains least one site newest version data item second rule ensures two write operations two transactions occur concurrently data item two rules ensure one-copy serializability maintained | [
10917,
3398,
3927,
5047,
1049,
9243
] | None |
1,702 | 3 | Burroughs_large_systems:burroughs large systems 1970s burroughs corporation organized three divisions different product line architectures high-end mid-range entry-level business computer systems division product line grew different concept optimize computer instruction set particular programming languages burroughs large systems group designed large mainframes using stack machine instruction sets dense syllables 48-bit data words first design b5000 1961 optimized running algol 60 extremely well using simple compilers evolved b5500 subsequent major redesigns include b6500/b6700 line successors separate b8500 line 'burroughs large systems referred product lines together contrast cobol-optimized medium systems b2000 b3000 b4000 flexible-architecture small systems b1000 founded 1880s burroughs oldest continuously operating entity computing late 1950s computing equipment still limited electromechanical accounting machines sensimatic nothing compete traditional rivals ibm ncr started produce larger-scale computers recently founded univac 1956 branded b205 machine produced company bought first internally developed machine b5000 designed 1961 burroughs sought address late entry market strategy completely different design based advanced computing ideas available time b5000 architecture dead inspired b6500 subsequent b6700 b7700 computers using architecture still production unisys clearpath libra servers run evolved compatible version mcp operating system first introduced b6700 third largest line b8500 commercial success addition proprietary cmos processor design unisys also uses intel xeon processors runs mcp microsoft windows linux operating systems libra servers use custom chips gradually eliminated 2018 libra servers strictly commodity intel years first member first series b5000 designed beginning 1961 team leadership robert bob barton unique machine well ahead time listed influential computing scientist john mashey one architectures admires always thought one innovative examples combined hardware/software design 've seen far ahead time b5000 succeeded b5500 used disks rather drum storage b5700 allowed multiple cpus clustered around shared disk successor b5700 b5000 line heavily influenced design b6500 burroughs ported master control program mcp machine b5000 revolutionary time architecture instruction set designed needs software taken consideration large departure computer system design time processor instruction set would designed handed software people still instruction sets ibm system/360 instruction set era later instruction set designs x86 ppc arm instruction set architectures essentially traditional instruction set based architectures rather holistic designs like original burroughs systems b5000 b5500 b5700 word mode two different addressing modes depending whether executing main program salf subroutine salf main program field operand call descriptor call syllable relative program reference table prt subroutines type addressing dependent high three bits mark stack flipflop msff shown b5x00 relative addressing b5000 designed exclusively support high-level languages time languages coming prominence fortran cobol fortran cobol considered weaker languages comes modern software techniques newer mostly untried language adopted algol-60 algol dialect chosen b5000 elliott algol first designed implemented c.a.r hoare elliott 503 practical extension algol io instructions algol ignored powerful string processing instructions hoare famous turing award lecture subject thus b5000 based powerful language vendors could dream implementing algol compiler industry dismissed algol unimplementable however bright young student named donald knuth previously implemented algol 58 earlier burroughs machine three months summer break peripherally involved b5000 design consultant many wrote algol mistakenly believing high-level languages could power assembler thus realizing algol potential systems programming language burroughs algol compiler fast — impressed dutch scientist edsger dijkstra submitted program compiled b5000 pasadena plant deck cards compiled almost immediately immediately wanted several machines university eindhoven university technology netherlands compiler fast several reasons primary reason one-pass compiler early computers enough memory store source code compilers even assemblers usually needed read source code burroughs algol syntax unlike official language requires variable object declared used feasible write algol compiler reads data concept profound theoretical implications also permits fast compiling burroughs large systems could compile fast could read source code punched cards fastest card readers industry powerful burroughs cobol compiler also one-pass compiler equally fast 4000-card cobol program compiled fast 1000-card/minute readers could read code program ready use soon cards went reader b6500 delivery 1969 b7500 first computers line burroughs systems survive present day inspired b5000 totally new architecture among important differences b8500 line derives d825 military computer inspired b5000 b8500 designed 1960s attempt merge b5500 d825 designs system used monolithic integrated circuits magnetic thin-film memory architecture employed 48-bit word stack descriptors like b5500 advertised upward-compatible b8500 could never gotten work reliably project canceled 1970 never delivered completed system first burroughs large systems b5000 designed 1961 second-generation computer using discrete transistor logic magnetic core memory first machines replace b5000 architecture b6500 b7500 successor machines followed hardware development trends re-implement architectures new logic next 25 years b5500 b6500 b5700 b6700 b7700 b6800 b7800 finally burroughs series merger burroughs acquired sperry corporation changed name unisys company continued develop new machines based mcp cmos asic machines libra 100 libra 500 libra 590 announced 2005 later libras including 590 also incorporate intel xeon processors run burroughs large systems architecture emulation well mcp cmos processors unclear unisys continue development new mcp cmos asics hardware software design development manufacturing split two primary locations orange county california outskirts philadelphia initial large systems plant developed b5000 b5500 located pasadena california moved city industry california developed b6500 orange county location based plant mission viejo california times included facilities nearby irvine lake forest responsible smaller b6x00 line east coast operations based tredyffrin pennsylvania handled larger b7x00 line machines lines fully object-compatible meaning program compiled one could executed another newer larger models instructions supported older slower models hardware encountering unrecognized instruction invoked operating system function interpreted differences include process switching i/o handled maintenance cold-starting functionality larger systems included hardware process scheduling capable input/output modules highly functional maintenance processors bxx00 models replaced series models differences retained longer readily identifiable model number burroughs large systems implement algol-derived stack architecture unlike linear architectures pdp-11 motorola m68k itanium segmented architectures x86 texas instruments refers layout memory program uses b5000 specifically designed support algol starting point business-oriented languages cobol also well supported notably powerful string operators included development fast compilers algol used b5000 extended algol subset includes powerful string manipulation instructions excludes certain algol constructs notably unspecified formal parameters define mechanism serves similar purpose defines found c fully integrated language rather preprocessor event data type facilitates coordination processes fault blocks enable handling program faults user level algol include many insecure constructs needed operating system system software two levels language extensions provide additional constructs espol newp writing mcp closely related software dcalgol dmalgol provide specific extensions specific kinds system software originally b5000 mcp operating system written extension extended algol called espol executive systems programming oriented language replaced mid-to-late 70s language called newp though newp probably meant new programming language legends surround name common perhaps apocryphal story within burroughs time suggested came “ executive washroom privileges ” another story circa 1976 john mcclintock burroughs software engineer developing newp named language newp asked yet name yet answering nyoooop adopted name newp subset algol extension secure espol dropped little-used complexities algol fact unsafe constructs rejected newp compiler unless block specifically marked allow instructions marking blocks provide multi-level protection mechanism newp programs contain unsafe constructs initially non-executable security administrator system able bless programs make executable normal users able even privileged users normally essentially root privilege may unable depending configuration chosen site newp used write general programs number features designed large software projects support everything algol newp number facilities enable large-scale software projects operating system including named interfaces functions data groups interfaces modules super-modules modules group data functions together allowing easy access data global within module interfaces allow module import export functions data super-modules allow modules grouped second intermediate level security operating system code newp user programs algol middleware programs written dcalgol data comms algol used message reception dispatching remove messages input queues places queues processes system handle middleware coms introduced around 1984 receive messages around network dispatch messages specific handling processes mcs message control system cande command edit program development environment mcss items software worth noting – control user sessions provide keeping track user state without run per-user processes since single mcs stack shared many users load balancing also achieved mcs level example saying want handle 30 users per stack case 31 60 users two stacks 61 90 users three stacks etc gives b5000 machines great performance advantage server since n't need start another user process thus create new stack time user attaches system thus efficiently service users whether require state mcss mcss also provide backbone large-scale transaction processing mcs talked external co-processor dcp datacomm control processor 24-bit minicomputer conventional register architecture hardware i/o capability handle thousands remote terminals dcp b6500 communicated messages memory essentially packets today terms mcs b6500-side processing messages early years dcp assembler dacoma application program called dcpprogen written b6500 algol later ndl network definition language compiler generated dcp code ndf network definition file one algol function kind dcp instruction called function corresponding dcp instruction bits would emitted output dcp program algol program comprising nothing long list calls functions one assembly language statement essentially algol acted like macro pass macro assembler first pass algol compiler second pass running resulting program b6500 would emit binary dcp another variant algol dmalgol data management algol dmalgol algol extended compiling dmsii database software database description files created dasdl data access structure definition language compiler database designers administrators compile database descriptions generate dmalgol code tailored tables indexes specified administrators never need write dmalgol normal user-level programs obtain database access using code written application languages mainly algol cobol extended database instructions transaction processing directives notable feature dmalgol preprocessing mechanisms generate code handling tables indices dmalgol preprocessing includes variables loops generate names based compile-time variables enables tailoring far beyond done preprocessing facilities lack loops dmalgol used provide tailored access routines dmsii databases database defined using data access structure definition language dasdl schema translated preprocessor tailored dmalgol access routines compiled means unlike dbms implementations often need database-specific if/then/else code run-time 1970s tailoring used extensively reduce code footprint execution time became much less used later years partly low-level fine tuning memory speed became less critical partly eliminating preprocessing made coding simpler thus enabled important optimizations dmalgol included verbs like find lock store also verbs begintransaction endtransaction included solving deadlock situation multiple processes accessed updated structures roy guck burroughs one main developers dmsii later years compiler code size less concern preprocessing constructs made available user level algol unsafe constructs direct processing database description file remain restricted dmalgol many early systems languages programmers often told make routines small procedure calls returns expensive number operations performed maintain stack b5000 designed stack machine – program data except arrays include strings objects kept stack meant stack operations optimized efficiency stack-oriented machine programmer addressable registers multitasking also efficient b5000 machines one specific instruction perform process switches – mvst move stack stack represents process task thread tasks become blocked waiting resource requests includes waiting processor run task interrupted preemptive multitasking user programs issue mvst one line code operating system done process switch proceeds something like – process requests resource immediately available maybe read record file block currently memory system timer triggered interrupt operating system code entered run top user stack turns user process timers current process placed appropriate queue resource requested ready queue waiting processor preemptive context switch operating system determines first process ready queue invokes instruction move_stack makes process head ready queue active detractors b5000 architecture believed stack architecture inherently slow compared register-based architectures trick system speed keep data close processor possible b5000 stack done assigning top two positions stack two registers b operations performed two top stack positions faster machines past b5000 stack may kept registers cache near processor thus designers current successors b5000 systems optimize whatever latest technique programmers adjust code run faster – even need recompile thus protecting software investment programs known run years many processor upgrades speed limited register-based machines another point speed promoted risc designers processor speed considerably faster everything single chip valid point 1970s complex architectures b5000 required many transistors fit single chip however case today every b5000 successor machine fits single chip well performance support techniques caches instruction pipelines fact series line b5000 successors included first single chip mainframe micro-a late 1980s mainframe chip named scamp single-chip a-series mainframe processor sat intel-based plug-in pc board example programs map stack structure stack frame corresponds lexical level current execution environment see lexical level static textual nesting program dynamic call nesting visibility rules algol language designed single pass compilers mean variables declared current position visible part code thus requirement forward declarations variables declared enclosing blocks visible another case variables name may declared inner blocks effectively hide outer variables become inaccessible lexical nesting static unrelated execution nesting recursion etc rare find procedure nested five levels deep could argued programs would poorly structured b5000 machines allow nesting 32 levels could cause difficulty systems generated algol source output tailored solve special problem generation method frequently nested procedure within procedure procedures invoked four ways – normal call process run normal invocation invokes procedure normal way language invokes routine suspending calling routine invoked procedure returns call mechanism invokes procedure coroutine coroutines partner tasks control explicitly passed tasks means continue instruction synchronous processes process mechanism invokes procedure asynchronous task case separate stack set starting lexical level processed procedure asynchronous task control exactly control passed tasks unlike coroutines note also processed procedure still access enclosing environment efficient ipc inter process communication mechanism since two tasks access common variables tasks must synchronized prevent race conditions handled event data type processes wait event caused another cooperating process events also allow mutual exclusion synchronization procure liberate functions reason child task dies calling task continue – however parent process dies child processes automatically terminated machine one processor processes may run simultaneously event mechanism basic enabler multiprocessing addition multitasking last invocation type run runs procedure independent task continue originating process terminates reason child process access variables parent environment parameters passed invoked procedure must call-by-value thus burroughs extended algol multi-processing synchronization features later languages like ada made use support asynchronous processes built hardware one last possibility procedure may declared inline compiler sees reference code procedure generated inline save overhead procedure call best done small pieces code inline functions similar parameterized macros c defines except n't get problems parameters macros facility available newp example program normal calls used information single stack asynchronous calls stack would split multiple stacks processes share data run asynchronously stack hardware optimization provision display registers registers point start called stack frame registers updated automatically procedures entered exited accessible software 32 registers limits 32 levels lexical nesting consider would access lexical level 2 2 global variable lexical level 5 5 suppose variable 6 words away base lexical level 2 thus represented address couple 2 6 n't registers look control word base 5 frame points frame containing 4 environment look control word base environment find 3 environment continue fashion followed links back required lexical level note path return path back procedures called order get point architecture keeps data stack call stack structure uses control words tell apart see quite inefficient access variable registers 2 register points base lexical level 2 environment need generate address variable add offset stack frame base frame base address register efficient linked list search operator lllu could search stack fashion register approach still going faster registers access entities outer global environments efficient local variable access invoked procedure p coroutine process instruction 3 environment would become separate 3 -based stack note means asynchronous processes still access 2 environment implied algol program code taking one step totally different program could call another program ’ code creating 3 stack frame pointing another process ’ 2 environment top process stack instant whole address space code ’ execution environment changes making 2 environment process stack directly addressable instead make 2 environment another process stack directly addressable library calls implemented cross-stack call calling code called code could even originate programs written different source languages compiled different compilers note 1 0 environments occur current process stack 1 environment code segment dictionary shared processes running code 0 environment represents entities exported operating system stack frames actually ’ even exist process stack feature used early file io optimization fib file information block linked display registers 1 io operations early nineties ability implemented language feature structure blocks – combined library technology connection blocks ability link data structure display register address scope implemented object orientation thus b5000 actually used form object orientation long term ever used systems compiler might build symbol table similar manner eventually storage requirements would collated machine code would written use flat memory addresses 16-bits 32-bits even 64-bits addresses might contain anything write wrong address could damage anything instead two-part address scheme implemented hardware lexical level variables placed displacements base level stack typically occupying one word double precision complex variables would occupy two arrays stored area one word descriptor array thus lexical level total storage requirement great dozens hundreds thousand extreme cases certainly count requiring 32-bits indeed reflected form valc instruction value call loaded operand onto stack op-code two bits long rest byte bits concatenated following byte give fourteen-bit addressing field code executed would lexical level say six meant lexical levels zero six valid three bits needed specify lexical level desired address part valc operation thus reserved three bits purpose remainder available referring entities lower levels deeply nested procedure thus high lexical level would fewer bits available identify entities level sixteen upwards number restricted deepest nesting five bits would needed specify choice levels 0–31 thus leaving nine bits identify 512 entities severe constraint much compact addressing entities literal memory address 32-bit addressing space valc opcode loaded data opcodes add mult forth addressing working entirely top elements stack much important method meant many errors available systems employing flat addressing could occur simply unspeakable even machine code level task way corrupt memory use another task way develop address similarly within task array descriptor contained information array bounds indexing operation checked hardware put another way array formed address space case tagging memory words provided second level protection misdirected assignment value could go data-holding location one holding pointer array descriptor etc certainly location holding machine code arrays stored contiguous memory variables granted address space located via descriptor access mechanism calculate stack index variable therefore full integer range potential fourteen bits use offset array address space bound checking provided hardware array length exceed 1,024 words array would segmented index converted segment index offset indexed segment algol case multidimensional array would employ multiple levels addressing reference j first index would array descriptors one descriptor rows row would indexed j single-dimensional array higher dimensions hardware checking known bounds array indices would prevent erroneous indexing fortran however regards multidimensional arrays equivalent single-dimensional array size multidimensional array simple integer arithmetic used calculate offset element j k would found single sequence single-dimensional equivalent array possibly segmented large enough would accessed manner single-dimensional array algol although accessing outside array would prevented wrong value one index combined suitably wrong value another index might result bounds violation single sequence array words indices checked individually array storage bounded side storage items easy system resize array though changing number dimensions precluded compilers required references number dimensions algol case enabled development ragged arrays rather usual fixed rectangular higher dimension arrays thus two dimensions ragged array would rows different sizes instance given large array 100,100 mostly-zero values sparse array representation declared sa 100,0 could row resized exactly enough elements hold non-zero values along row arrays larger 1024 words segmented smaller arrays system short real memory increasing declared size collection scratchpad arrays 1,000 say 1,050 could mean program would run far less thrashing smaller individual segments use needed memory actual storage array segment would allocated run time element segment accessed elements created segment would initialised zero initialising array zero start therefore encouraged normally unwise omission one nice thing stack structure program happen fail stack dump taken easy programmer find exactly state running program compare core dumps exchange packages systems another thing stack structure programs implicitly recursive fortran expected support recursion perhaps one stumbling block people understanding algol implemented implement recursion b5000 problem – fact reverse problem stop programs recursive end n't bother burroughs fortran compiler allowed recursive calls every fortran compiler unlike many computers stack-based system returns calls succeeded well could odd effects system formal manipulation mathematical expressions whose central subroutines repeatedly invoked without ever returning large jobs ended stack overflow thus burroughs fortran better error checking contemporary implementation fortran instance subroutines functions checked invoked correct number parameters normal algol-style compilers computers mismatches common causes crashes similarly array-bound checking programs used years systems embarrassingly often would fail run burroughs system fact burroughs became known superior compilers implementation languages including object-oriented simula superset algol iverson designer apl declared burroughs implementation apl best 'd seen john mccarthy language designer lisp disagreed since lisp based modifiable code like unmodifiable code b5000 lisp implementations would run interpretive environment anyway note also storage required multiple processes came system memory pool needed need sysgens burroughs systems competing systems order preconfigure memory partitions run tasks defining aspect b5000 stack machine treated however two important features architecture tag-based descriptor-based original b5000 flag bit control numeric word set aside identify word control word numeric word partially security mechanism stop programs able corrupt control words stack later b6500 designed realized 1-bit control word/numeric distinction powerful idea extended three bits outside 48 bit word tag data bits bits 0–47 tag bits 48–50 bit 48 read-only bit thus odd tags indicated control words could written user-level program code words given tag 3 list tags function note internally machines 60 bit words extra bits used engineering purposes hamming code error-correction field never seen programmers note current incarnation machines unisys clearpath extended tags four bit tag microcode level specified four bit tags referred level gamma even-tagged words user data modified user program user state odd-tagged words created used directly hardware represent program execution state since words created consumed specific instructions hardware exact format words change hardware implementation user programs need recompiled since code stream produce results even though system word format may changed tag 1 words represent on-stack data addresses normal irw simply stores address couple data current stack sirw references data stack including stack number address tag 5 words descriptors fully described next section tag 5 words represent off-stack data addresses tag 7 program control word describes procedure entry point operators hit pcw procedure entered entr operator explicitly enters procedure non-value-returning routine functions value-returning routines implicitly entered operators value call valc note global routines stored 2 environment sirws point pcw stored code segment dictionary 1 environment 1 environment stored current stack referenced processes sharing code thus code reentrant shared tag 3 represents code words wo n't occur stack tag 3 also used stack control words mscw rcw toscw figure left shows burroughs large system architecture fundamentally hardware architecture object-oriented programming something still n't exist conventional architectures b5000 line also pioneers multiple processors connected together high-speed bus b7000 line could eight processors long least one i/o module note rdlk low-level way synchronizing processors high level used user programs event data type event data type system overhead avoid overhead special locking technique called dahm locks named burroughs software guru dave dahm used notable operators heyu — send interrupt another processor rdlk — low-level semaphore operator load register memory location given register place value b register memory location single uninterruptible cycle algol compiler produced code invoke operator via special function enabled swap operation single-word data without explicit temporary value codice_1 whoi — processor identification idle — idle interrupt received two processors could infrequently simultaneously send 'heyu command resulting lockup known deadly embrace direct influence b5000 seen current unisys clearpath range mainframes direct descendants b5000 still mcp operating system 40 years consistent development architecture called emode emulation mode since b5000 architecture implemented machines built intel xeon processors running x86 instruction set native instruction set code running processors emulating b5000 instruction set machines also going nmode native mode dropped may often hear b5000 successor machines referred emode machines b5000 machines programmed exclusively high-level languages assembler b5000 stack architecture inspired chuck moore designer programming language forth encountered b5500 mit forth early years moore described influence noting forth dup drop swap came corresponding b5500 instructions dupl dlet exch b5000 machines stack-based architecture tagged memory also heavily influenced soviet elbrus series mainframes supercomputers first two generations series featured tagged memory stack-based cpus programmed high-level languages existed kind assembly language called el-76 less modification algol 68 supported structured programming first-class procedures later generations series though switched away architecture epic-like vliw cpus hewlett-packard designers hp 3000 business system used b5500 greatly impressed hardware software aimed build 16-bit minicomputer similar software several hp divisions created similar minicomputer microprocessor stack machines bob barton work reverse polish notation rpn also found way hp calculators beginning 9100a notably hp-35 subsequent calculators nonstop systems designed tandem computers late 1970s early 1980s also 16-bit stack machines influenced b5000 indirectly hp 3000 connection several early tandem engineers formerly hp around 1990 systems migrated mips risc architecture continued support execution stack machine binaries object code translation direct emulation sometime 2000 systems migrated itanium architecture continued run legacy stack machine binaries bob barton also influential alan kay kay also impressed data-driven tagged architecture b5000 influenced thinking developments object-oriented programming smalltalk another facet b5000 architecture secure architecture runs directly hardware technique descendants virtual machines today attempts provide secure environments one notable product java jvm provides secure sandbox applications run value hardware-architecture binding existed emode would substantially preserved x86-based machines extent mcp one control program support provided machines still inferior provided machines b5000 instruction set native instruction set little-known intel processor architecture actually preceded 32-bit implementations x86 instruction set intel iapx 432 would provided equivalent physical basis essentially object-oriented architecture | [
512,
6529,
3716,
5384,
10508,
6797,
5523,
3350,
1820,
5501,
11295,
4900,
5156,
5503,
2345,
428,
2477,
10668,
7983,
5040,
1073,
10669,
11059,
823,
8122,
1469,
4799,
3904,
2625,
8001,
2115,
1606,
1480,
3529,
1610,
1611,
4424,
5065,
8136,
98... | Test |
1,703 | 2 | Microsoft_Transaction_Server:microsoft transaction server microsoft transaction server mts software provided services component object model com software components make easier create large distributed applications major services provided mts automated transaction management instance management just-in-time activation role-based security mts considered first major software implement aspect-oriented programming mts first offered windows nt 4.0 option pack windows 2000 mts enhanced better integrated operating system com renamed com+ com+ added object pooling loosely-coupled events user-defined simple transactions compensating resource managers features mts com+ still provided windows server 2003 windows server 2008 microsoft .net framework provides wrapper com+ enterpriseservices namespace windows communication foundation wcf provides way calling com+ applications web services however com+ based com microsoft strategic software architecture web services .net com pure .net-based alternatives many features provided com+ long term likely com+ phased basic mts architecture comprises com components run control mts executive called mts components com+ referred com+ applications mts components in-process dlls mts components deployed run mts executive manages com components object implementing iclassfactory interface serves factory object create new instances components mts inserts factory wrapper object object wrapper actual mts object client interposing wrappers called interception whenever client makes call mts component wrappers factory object intercept call inject instance-management algorithm called just-in-time activation jita call wrapper makes call actual mts component interception considered difficult time due lack extensible metadata addition based information component deployment properties transaction logic security checks also take place wrapper objects every mts-hosted object also exists context object implements iobjectcontext interface context object maintains specific information object transactional information security information deployment information methods mts component call context object iobjectcontext interface mts create actual middle-tier mts object call client reaches container since object running time use lot system resources even though object wrapper skeleton object persist soon call comes client mts wrapper process activates instance management algorithm called jita actual mts object created time service request wrapper request serviced reply sent back client component either calls setcomplete /setabort transaction ends client calls release reference object actual mts object destroyed short mts uses stateless component model generally client requests services typical mts component following sequence occurs server thus possible implement high-latency resources asynchronous resource pools take advantage stateless jit activation afforded middleware server | [
11270,
5643,
4624,
537,
540,
3102,
9762,
8227,
8740,
1577,
10281,
2101,
10812,
3648,
10310,
1098,
7754,
10828,
4173,
4174,
9808,
4178,
10839,
603,
9819,
3170,
622,
9839,
4210,
7796,
1656,
6265,
7290,
4731,
10879,
8841,
6797,
2193,
9874,
1... | Test |
1,704 | 7 | Stackdriver:stackdriver google stackdriver freemium credit card required cloud computing systems management service offered google provides performance diagnostics data form monitoring logging tracing error reporting alerting public cloud users stackdriver hybrid cloud solution providing support google cloud aws cloud environments stackdriver company created 2012 founders dan belcher izzy azeri company goal provide consistent monitoring across cloud computing multiple service layers using single saas solution stackdriver secured 5 million funding bain capital ventures july 2012 beta version product became publicly available april 30 2013 may 2014 stackdriver company acquired google expanded version product adding support logs analysis hybrid cloud support deep integration google cloud rebranded google stackdriver launched general availability october 2016 stackdriver focus improving performance availability large complex applications running public cloud provides metrics detailing every layer 'stack form charts graphs supports multi-cloud environments provides single pane glass users cloud services provides views logs generated allows users generate metrics logs allows users receive alerts metrics breach normal levels | [
7248,
4194
] | Test |
1,705 | 7 | PerfKitBenchmarker:perfkitbenchmarker perfkit benchmarker open source benchmarking tool used measure compare cloud offerings perfkit benchmarker licensed apache 2 license terms perfkit benchmarker community effort involving 500 participants including researchers academic institutions companies together originator google perfkit benchmarker pkb community effort deliver repeatable consistent open way measuring cloud performance supports growing list cloud providers including alibaba cloud amazon web services cloudstack digitalocean google cloud platform kubernetes microsoft azure openstack rackspace ibm bluemix softlayer addition cloud providers supports container orchestration including kubernetes mesos local static workstations clusters computers goal create open source living benchmark framework represents cloud developers building applications evaluating cloud alternatives learning architect applications cloud living change morph quickly developers change perfkit benchmarker measures end end time provision resources cloud addition reporting standard metrics peak performance e.g latency throughput time-to-complete iops perfkit benchmarker reduces complexity running benchmarks supported cloud providers unified simple commands designed operate via vendor provided command line tools perfkit benchmarker contains canonical set public benchmarks benchmarks running default/initial state configuration tuned favor providers provides way benchmark across cloud platforms getting transparent view application throughput latency variance overhead perfkit benchmarker pkb started anthony f. voellm alain hamel eric hankland google 2014 initial alpha place anthony f. voellm ivan santa maria filho built community including arm broadcom canonical centurylink cisco cloudharmony cloudspectator ecocloud epfl intel mellanox microsoft qualcomm technologies inc. rackspace red hat tradeworx inc. thesys technologies llc community worked together behind scenes private github project create open way measure cloud performance community released first public beta released february 11 2015 announced blog post point github project open everyone almost year large adaption 600+ participants github v1.0.0 released along detailed architectural design december 10 2015 many members made significant contributions pkb community appreciative particular carlos torres rackspace mateusz blaszkowski intel made significant contributions became first members outside google committer rights find pkb community github participate list available benchmarks perfkitbenchmarker latest set benchmarks found github readme file since google open sourced perfkitbenchmarker became community effort 30 leading researchers academic schools industry companies organizations include arm broadcom canonical centurylink cisco cloudharmony cloud spectator ecocloud epfl intel mellanox microsoft qualcomm technologies rackspace red hat thesys technologies addition stanford mit leading quarterly discussions default benchmarks settings proposed community ecocloud epfl integrating cloudsuite perfkit benchmarker example run google cloud platform example run aws example run azure example run rackspace example run local machine | [
448,
2081,
9863,
3819,
1935,
5295,
7248,
9455,
1363,
8692
] | Test |
1,706 | 8 | Web_Bot:web bot web bot internet bot computer program whose developers claim able predict future events tracking keywords entered internet developed 1997 originally predict stock market trends creator web bot project clif high along associate george ure keep technology algorithms largely secret sell predictions via website internet bots monitor news articles blogs forums forms internet chatter words lexicon assigned numeric values emotional quantifiers duration impact immediacy intensity others lexicon dynamic changes according shifts emotional tension humans communicate changes using internet 2008 300,000 keywords lexicon along emotional context fed computer-generated modelspace operators web bot interpret bot results make report called alta report available website paying subscribers alta stands asymmetric language trend analysis many believe predictions pseudoscientific vague meaningful despite creators made many claims fact reports predicted important events history channel discussed web bot special doomsday 2012 shows feature predictions end world nostradamus effect globe mail journalist noted tom chivers daily telegraph notes three criticisms project | [] | Test |
1,707 | 3 | SPARC_Enterprise:sparc enterprise sparc enterprise series range unix server computers based sparc v9 architecture co-developed sun microsystems fujitsu introduced 2007 marketed sold sun microsystems later oracle corporation acquisition sun fujitsu fujitsu siemens computers common brand sparc enterprise superseding sun sun fire fujitsu primepower server product lines since 2010 servers based new sparc cmt processors sparc t3 later branded oracle sparc t-series servers midrange high-end sparc64 vi sparc64 vii sparc64 vii+ processor based servers designated m-series indicates ras features similar mainframe class machines sparc64 vi dual-core processor core featuring two-way vertical multi-threading vmt m9000 server configured maximum number processors supports running 256 concurrent threads vmt coarse-grained multi-threading implementation core sparc64 vi handle two strands threads vmt switches execution one strand basis events execute instructions another thread pipeline must saved/flushed switched registers thread events include l2 cache misses hardware timer exception interrupts multi-threading-related control instructions also called switch event soe threading 2008 fujitsu released sparc64 vii quad-core processor core featuring two-way simultaneous multi-threading existing m-class servers able upgrade sparc64 vii processors field 2010 fujitsu released sparc64 vii+ running higher frequency larger l2 cache predecessor sparc64 vii sparc64 vii+ processor module includes four physical cores core execute two threads physical core able run threads simultaneously smt context-switch time two threads share instruction pipeline smoothly ready run alternate cycles superscalar instruction issue share functional units according need important capability m-series ability mix processor generations clock speeds system domain m-series servers sparc64 vi sparc64 vii cpus installed run native speeds clocking slowest cpu april 17 2007 sun sparc enterprise m9000 achieved 1.032 tflops linpack benchmark making fastest single system supercomputer time may 2 2008 sun sparc enterprise m9000 server achieved world performance record tpc-h data warehousing benchmark 1 terabyte scale factor using oracle database february 19 2009 sparc enterprise m8000 holds 64-thread world performance records spec omp2001 benchmark medium large ultrasparc t1-based sun fire t1000 t2000 rebranded sparc enterprise october 2007 sun added ultrasparc t2-based servers sparc enterprise line april 2008 sun added ultrasparc t2 plus-based servers sparc enterprise line october 2008 sun released 4-way smp ultrasparc t2 plus-based server sparc enterprise models licensed run solaris 10 solaris 11 m-series supports dynamic domains dynamic reconfiguration enable single machine divided multiple electrically isolated partitions ultrasparc t1 ultrasparc t2/t2+ models partition system using logical domains m-series t-series models support solaris containers supports maximum 8191 non-global zones dynamic domain logical domain | [
1539,
9731,
36,
10789,
9766,
5677,
7218,
4664,
1594,
597,
10837,
10327,
11363,
10340,
7270,
5233,
9333,
631,
9343,
1675,
4235,
4241,
2710,
6815,
8863,
8353,
8871,
2731,
3247,
6322,
4285,
9920,
6338,
10436,
6341,
3285,
1755,
2269,
1250,
99... | Test |
1,708 | 4 | Norton_Personal_Firewall:norton personal firewall norton personal firewall developed symantec discontinued personal firewall ad blocking program control privacy protection capabilities norton personal firewall program control module able allow deny individual applications access internet programs automatically allowed denied internet access norton personal firewall uses blacklist whitelist determine program allowed internet access advertisement-blocking feature software rewrites html one browser uses display web pages searches code related advertisements blacklist prevents web page displayed privacy control component blocks browser cookies active content prevents transmission sensitive data standard pop3 e-mail clients microsoft office e-mail attachments instant messaging services msn messenger windows messenger aol instant messenger without user consent | [
1792,
2049,
4480,
2563,
5512,
6797,
7955,
1172,
10903,
9496,
6297,
3482,
1436,
4511,
5536,
6431,
10531,
5924,
550,
8998,
10790,
3243,
3885,
7983,
8368,
8753,
2870,
823,
569,
5178,
11065,
11577,
9279,
3520,
5057,
1858,
10433,
11073,
2118,
... | None |
1,709 | 4 | Computational_trust:computational trust information security computational trust generation trusted authorities user trust cryptography centralised systems security typically based authenticated identity external parties rigid authentication mechanisms public key infrastructures pkis kerberos allowed model extended distributed systems within closely collaborating domains within single administrative domain recent years computer science moved centralised systems distributed computing evolution several implications security models policies mechanisms needed protect users ’ information resources increasingly interconnected computing infrastructure identity-based security mechanisms authorise operation without authenticating claiming entity means interaction occur unless parties known authentication frameworks spontaneous interactions would therefore require single trusted certificate authorities cas present context pki considered since issues thus unlikely establish reference standard near future user wishes collaborate another party choose enabling security thereby disabling spontaneous collaboration disabling security enabling spontaneous collaboration fundamental mobile users devices authenticate autonomous way without relying common authentication infrastructure order face problem need examine challenges introduced global computing term coined eu future global information society identify impact security computational trust applies human notion trust digital world seen malicious rather cooperative expected benefits according marsh et al. result use others ability delegation increased cooperation open less protected environment research area computational mechanisms trust reputation virtual societies directed towards increased reliability performance digital communities trust-based decision specific domain multi-stage process first step process consists identifying selecting proper input data trust evidence general domain-specific derived analysis conducted application involved next step trust computation performed evidence produce trust values means estimation trustworthiness entities particular domain selection evidence subsequent trust computation informed notion trust defined trust model finally trust decision taken considering computed values exogenous factors like disposition risk assessments concepts heightened relevance last decade computer science particularly area distributed artificial intelligence multi-agent system paradigm growth e-commerce increased interest trust reputation fact trust reputation systems recognized key factors electronic commerce systems used intelligent software agents incentive decision-making deciding whether honor contracts mechanism search trustworthy exchange partners particular reputation used electronic markets trust-enforcing mechanism method avoid cheaters frauds another area application concepts agent technology teamwork cooperation several definitions human notion trust proposed last years different domains sociology psychology political business science definitions may even change accordance application domain example romano recent definition tries encompass previous work domains trust reputation social value someone trustworthy person may expected perform beneficial least suspicious way assure others high probability good collaborations contrary someone appears trustworthy others refrain collaborating since lower level probability collaborations successful trust strongly connected confidence implies degrees uncertainty hopefulness optimism eventually marsh addressed issue formalizing trust computational concept phd thesis trust model based social psychological factors lot proposals appeared literature selection computational trust reputation models represent good sample current research presented trust reputation analysed different points view applied many situations next classification based considering peculiar characteristics models environment evolve trust reputation model characterized models based cognitive approach trust reputation made underlying beliefs function degree beliefs mental states lead trust another agent assign reputation essential part model well mental consequences decision act relying another agent neurological trust models based neurological theories interaction affective cognitive states modeled neurological level well using theories embodiment emotions models trust dynamics relate experiences external sources cognitive affective perspective specifically feeling emotion associated mental state converging recursive body loops modeled addition based hebbian learning strength connections emotional responses different adaptation processes introduced inspired somatic marker hypothesis trust reputation considered subjective probabilities individual expects individual b perform given action welfare depends approach trust reputation result mental state agent cognitive sense result pragmatic game utility functions numerical aggregation past interactions possible sort models considering information sources used compute trust reputation values traditional information sources direct experiences witness information recent models started consider connection information sociological aspect agent behavior model contains several information sources increase reliability results conversely increase complexity model direct experience relevant reliable information source trust/reputation model two types direct experiences recognizable witness information also called indirect information comes experience members community based direct experience data gathered others ’ experience witness information usually abundant use complex trust reputation modelling fact introduces uncertainty agents manipulate hide parts information benefit people belong community establish different types relations individual plays one several roles society influencing behavior interaction people multi-agent system plenty interactions social relations among agents simplified reflection complex relations human counterparts trust reputation models adopt sociological information using techniques like social network analysis methods study social relationships among individuals society emerged set methods analysis social structures methods specifically allow investigation relational aspects structures prejudice another though uncommon mechanism influences trust reputation according method individual given properties particular group make recognisable member signs uniform definite behavior etc people today use word prejudice refers negative hostile attitude towards another social group often racially defined however negative connotation revised applied agent communities set signs used computational trust reputations models usually ethical discussion differently signs used human societies like skin color gender literature cognitive social sciences claims humans exhibit non-rational biased behavior respect trust recently biased human trust models designed analyzed validated empirical data results show biased trust models able predict human trust significantly better unbiased trust models relevant sources information considered trust reputation models presented direct experiences witness information e-markets sociological information almost non-existent order increase efficiency actual trust reputation models considered however reason increase complexity models introducing trust evidence later used environment possible realise capabilities aggregation trust reputation evidence useful computational model increase complexity making general solution difficult several models dependent characteristics environment possible solution could use adaptive mechanisms modify combine different sources information given environment lot trust reputation definitions presented several works give meaning concepts relation concepts considered depth reputation concept helps build trust others nowadays game theory predominant paradigm considered design computational trust reputation models likelihood theory taken account significant number economists computer scientists strong background game theory artificial intelligence techniques working multi-agent e-commerce contexts game theoretical models produce good results may appropriate complexity agents terms social relations interaction increases becomes restrictive exploration new possibilities considered example merging cognitive approaches game theoretical ones apart trust evidence considered well time-sensitive trust metrics represent first step encourage improvement computational trust important issue modeling trust represented transferability trust judgements different agents social scientists agree consider unqualified trust values transferable pragmatic approach would conclude qualified trust judgments worth transferred far decisions taken considering others ’ opinion better ones taken isolation authors investigated problem trust transferability open distributed environments proposing translation mechanism able make information exchanged one agent another accurate useful currently commonly accepted evaluation framework benchmark would allow comparison models set representative common conditions game-theoretic approach direction proposed configuration trust model optimized assuming attackers optimal attack strategies allows next step compare expected utility different trust models similarly model-based analytical framework predicting effectiveness reputation mechanisms arbitrary attack models arbitrary system models proposed peer-to-peer systems | [
3552,
3776,
9248,
7368,
5389,
10831,
11567,
6098,
755,
5433,
5373
] | Validation |
1,710 | 2 | Image_Capture:image capture image capture application program apple enables users upload pictures digital cameras scanners either connected directly computer network provides organizational tools like iphoto useful collating pictures variety sources need drivers image capture scriptable applescript may manipulated mac os x v10.4 tiger automator application mac os x 10.4 image capture applescript dictionary open script editor mac os x 10.6 image capture web server opens script editor | [
4615,
5647,
1042,
6700,
4657,
1074,
576,
9802,
5713,
3670,
4184,
2141,
4702,
2149,
8303,
6771,
2676,
9343,
3719,
10888,
11402,
8852,
1686,
7318,
3228,
2207,
1699,
5292,
8877,
3766,
2232,
9912,
9406,
1729,
6849,
713,
9418,
3790,
9430,
3289... | Test |
1,711 | 4 | Information_security_indicators:information security indicators information technology benchmarking computer security requires measurements comparing different systems single systems dedicated situations technical approach pre-defined catalog security events security incident vulnerability together corresponding formula calculation security indicators accepted comprehensive information security indicators standardized etsi industrial specification group isg isi indicators provide basis switch qualitative quantitative culture security scope measurements external internal threats attempt success user deviant behaviours nonconformities and/or vulnerabilities software configuration behavioural general security framework 2019 isg isi terminated related standards maintained via etsi tc cyber list information security indicators belongs isi framework consists following eight closely linked work items preliminary work information security indicators done french club r2gs first public set isi standards security indicators list event model released april 2013 | [
6360,
5636,
5373,
2558
] | Test |
1,712 | 6 | ExtremeZ-IP:extremez-ip extremez-ip apple filing protocol server grouplogic inc arlington virginia usa runs windows operating systems enabling mac clients access files via apple filing afp 3.3 protocol starting version 8.0 network reshare capability allows extremez-ip server proxy access file shares secondary file server nas device netapp isilon extremez-ip also provides access windows services printing searching file system archiving distributed file system volume shadow service extremez-ip supports macintosh clients running mac os 9.2 mac os 10.9 mavericks extremez-ip extremez-ip.exe requires windows supports windows server 2012 windows server 2008 r2 32-bit 64-bit windows storage server windows home server windows 2003 server windows xp windows xp embedded windows powered nas extremez-ip first third party file server support time machine apple software support searching via apple network spotlight software provides indexed content search search accomplished translating passing search query microsoft windows search service passing results back mac user via reverse process extremez-ip links macs microsoft distributed file system microsoft dfs optional shadowconnect microsoft volume shadow copy service vss snapshots extremez-ip version 9.0 added option index remote volumes enable spotlight searching mac users remote volumes n't local index search capabilities including network attached storage nas emc netapp isilon stornext san volumes | [
11011,
6797,
7983,
2193,
8404,
1212
] | Test |
1,713 | 8 | ORBX.js:orbx.js orbx.js javascript library codec able stream video html5-compliant browser project partnership mozilla otoy | [
1664,
3462,
6791,
9736,
1295,
7951,
2836,
10006,
11418,
9757,
803,
7983,
7861,
11449,
5054,
7871,
9152,
9281,
10057,
2893,
7889,
5078,
6231,
10078,
482,
10722,
8169,
5612,
10860,
6133,
7543,
4728,
5114,
8443,
637,
6143
] | Test |
1,714 | 4 | Robert_E._Rich:robert e. rich robert ellett rich born december 15 1926 american intelligence official deputy director national security agency 1982 1986 time highest ranking civilian agency working internal management also far east expert joined nsa 1962 worked office assistant secretary defense special operations prior worked armed forces security agency starting 1950 nsa predecessor time nsa also served japan office agency well special u.s. liaison officer london recipient national security medal presented president ronald reagan 1996 2003 served president board directors national cryptological museum foundation | [
289,
4898,
7137,
10305,
11302,
327,
266,
6668,
365,
9357,
4719,
7887,
2897,
10832,
4566,
2712,
6749
] | None |
1,715 | 2 | Automatic_Reference_Counting:automatic reference counting automatic reference counting arc memory management feature clang compiler providing automatic reference counting objective-c swift programming languages compile time inserts object code messages codice_1 codice_2 increase decrease reference count run time marking deallocation objects number references reaches zero arc differs tracing garbage collection background process deallocates objects asynchronously runtime unlike tracing garbage collection arc handle reference cycles automatically means long strong references object deallocated strong cross-references accordingly create deadlocks memory leaks developer break cycles using weak references apple inc. deploys arc operating systems macos ios limited support arclite available since snow leopard ios 4 complete support following lion ios 5 garbage collection declared deprecated mountain lion favor arc removed objective-c runtime library macos sierra following rules enforced compiler arc turned // without arc void dealloc // arc void dealloc // without arc nsstring givemeastring // arc nsstring givemeastring // without arc void loopthrougharray nsarray array // arc void loopthrougharray nsarray array arc introduces new property declaration attributes replace old attributes zeroing weak references feature objective-c arc automatically clears sets codice_19 weak-reference local variables instance variables declared properties immediately object pointed starts deallocating ensures pointer goes either valid object codice_19 avoids dangling pointer s. prior introduction feature weak references referred references retaining set codice_19 object pointed deallocated equivalent codice_22 arc thus possibly leading dangling pointer programmer typically ensure possible weak references object set nil manually deallocated zeroing weak references obviates need zeroing weak references indicated using property declarations|declared property attribute codice_23 using variable attribute codice_24 zeroing weak references available mac os x lion 10.7 later ios 5 later require additional support objective-c runtime however os x classes currently support weak references code uses arc needs support versions os older use zeroing weak references therefore must use codice_22 weak references exists third-party library called plweakcompatibility allows one use zeroing weak references even older os versions xcode 4.2 later provides way convert code arc xcode 4.5 found choosing edit refactor convert objective-c arc ... although xcode automatically convert code code may converted manually xcode inform developer complex use cases arise variable declared inside autorelease pool used outside two objects need toll-free bridged special casts swift references objects strong unless declared codice_23 codice_27 swift requires explicit handling nil optional type value type either value nil optional type must handled unwrapping conditional computer programming |conditional statement allowing safe usage value present conversely non-optional type always value nil var mystring string // string var myotherstring string // string nil let mystring myotherstring // unwrap optional accordingly strong reference object type optional object kept heap reference deallocated weak reference type optional object deallocated reference set nil unowned references fall in-between neither strong type optional instead compiler assumes object unowned reference points deallocated long reference remains allocated typically used situations target object holds reference object holds unowned reference var strongreference myclass // strong reference nil weak var weakreference myclass // weak reference nil unowned var unownedreference myclass // weak reference nil swift also differs objective-c usage encouragement value type|value types instead reference type|reference types types swift standard library value types copied value whereas classes closure computer programming |closures reference types passed reference value types copied passed around deallocated automatically reference created category objective-c category memory management | [
2304,
4998,
4747,
9490,
541,
10783,
1952,
3871,
1954,
5154,
10581,
10584,
7133,
8037,
10470,
3948,
10478,
8303,
7292
] | Validation |
1,716 | 9 | Richard_Merrill:richard merrill richard merrill digital equipment corporation employee invented focal programming language programmed first two interpreters language 1968 1969 pdp-8 also developed later versions interpreter pdp-7 pdp-9 later ported pdp-11 merrill also designed programmed edit-8 text editor using paper-tape merrill alumnus phillips andover preparatory school mit | [
8732,
8910,
8503
] | None |
1,717 | 2 | Dave_Taylor_(game_programmer):dave taylor game programmer dave d. taylor american game programmer best known former id software employee noted work promoting linux gaming 1993 graduated university texas austin bachelor science degree electrical engineering taylor worked id software 1993 1996 time involved development doom quake created ports games irix aix solaris linux helped program atari jaguar ports doom wolfenstein 3d also considers spackle coder doom adding things status bar sound library integration automap level transitions cheat codes network chat system quake wrote original sound engine dos tcp/ip network library added vesa 2.0 support one musical themes doom ii dave d. taylor blues named robert prince 2003 book mentions habit passing prolonged playing doom employees would incidents sketch body outline unconscious form masking tape success game bought couch pass attempts talk quake on-line purchase acura nsx doom money friendship american mcgee eventual departure company also mentioned taylor founded small game company called crack dot com 1996 1998 crack dot com released one game abuse pc platform shooter 1997 interview claimed n't particularly proud abuse set prove person could sell 50,000 copies so-so game led effort build golgotha first-person shooter real-time strategy hybrid company folded completion 1998 2001 worked transmeta president carbon6 2001 2002 also working lead designer producer game boy advance game spy kids challenger since 2002 vice president naked sky entertainment since 2003 also advisor freelance game designer also willing act pay projects 2009 produced abuse classic apple iphone beakiez pc | [
1026,
5644,
4367,
8848,
657,
10642,
1939,
2581,
3478,
6808,
921,
7450,
6302,
7584,
802,
5410,
6691,
6947,
8354,
5931,
8364,
823,
2109,
11069,
10687,
10822,
8263,
843,
589,
6352,
4177,
11602,
8787,
4437,
6489,
3802,
4831,
9696,
11232,
1163... | Test |
1,718 | 2 | Jordan_Hubbard:jordan hubbard jordan k. hubbard born april 8 1963 open source software developer authoring software ardent window manager various open source tools libraries co-founding freebsd project nate williams rodney w. grimes 1993 contributed initial freebsd ports collection package management system sysinstall july 2001 hubbard joined apple computer role manager bsd technology group 2005 title director unix technology october 2007 hubbard promoted director engineering unix technologies apple remained june 2013 july 15 2013 became cto ixsystems also led freenas open source project march 24 2017 announced plan depart ixsystems would joining twoporeguys biotechnology company vp engineering.. january 2019 linkedin profile notes part engineering leadership team uber march 31 1987 hubbard executed rwall command expecting send message every machine network university california berkeley headed distributed unix group command instead began broadcasting hubbard message every machine internet stopped hubbard realised message broadcast remotely received complaints people purdue university university texas even though command terminated resulted hubbard receiving 743 messages complaints including one inspector general arpanet | [
10761,
2061,
9743,
8725,
4636,
1071,
1080,
5177,
9784,
3651,
7748,
8266,
5710,
7249,
9306,
607,
9320,
8816,
9844,
633,
8316,
9343,
2180,
4745,
2212,
684,
3248,
5819,
11459,
10436,
9927,
8395,
8909,
6864,
10455,
6361,
8410,
9452,
11506,
12... | Validation |
1,719 | 1 | XLeratorDB:xleratordb xleratordb suite database function libraries enable microsoft sql server perform wide range additional non-native business intelligence ad hoc analytics libraries embedded run centrally database include 450 individual functions similar found microsoft excel spreadsheets individual functions grouped sold six separate libraries based usage finance statistics math engineering unit conversions strings westclintech company developed xleratordb claims first commercial function package add-in microsoft sql server westclintech llc founded software industry veterans charles flock joe stampf 2008 located irvington new york united states flock co-founder frustum group developer opics enterprise banking trading platform acquired london-based misys plc 1996 stampf joined frustum 1994 flock remained active company acquisition helping develop successive generations opics employed 150 leading financial institutions worldwide following full year research development testing westclintech introduced recorded first commercial sale xleratordb april 2009 september 2009 xleratordb became available federal agencies nasa strategic enterprise-wide procurement sewp-iv program government-wide acquisition contract xleratordb uses microsoft sql clr common language runtime technology sql clr allows managed code hosted run microsoft sql server environment sql clr relies creation deployment registration .net framework assemblies physically stored managed code dynamic-link libraries dll assemblies may contain .net namespaces classes functions properties managed code compiles native code prior execution functions using sql clr achieve significant performance increases versus equivalent functions written t-sql scenarios xleratordb requires microsoft sql server 2005 sql server 2005 express editions later compatibility mode 90 higher product installs permission_set=safe safe mode restrictive permission set accessible users code executed assembly safe permissions access external system resources files network internet environment variables registry computer science function portion code within larger program performs specific task relatively independent remaining code used database spreadsheet applications functions generally represent mathematical formulas widely used across variety fields code may user-generated also embedded pre-written sub-routine applications functions typically identified common nomenclature corresponds underlying operations e.g irr identifies function calculates internal rate return series periodic cash flows sub-routines functions integrated used variety ways wide variety larger complicated applications within large enterprise applications may example play important role defining business rules risk management parameters remaining virtually undetected end users within database management systems spreadsheets however kinds functions also represent discrete sets tools accessed directly utilized stand-alone basis complex user-defined configurations context functions used business intelligence ad hoc analysis data fields finance statistics engineering math etc xleratordb uses three kinds functions perform analytic operations scalar aggregate hybrid form westclintech calls range queries scalar functions take single value perform operation return single value example type function log returns logarithm number specified base aggregate functions operate series values return single summarizing value example type function avg returns average values specified group xleratordb functions characteristics aggregate functions operating multiple series values processed sql clr using single column inputs avg example irregular internal rate return xirr financial function operates collection cash flow values one column must also apply variable period lengths another column initial iterative assumption third order return single summarizing value westclintech documentation notes range queries specify data included result set function independently clause associated t-sql statement incorporating select statement function string argument function traps select statement executes internally processes result xleratordb functions employ range queries npv xnpv irr xirr mirr multinomial seriessum within application functions identified _q naming convention e.g npv_q irr_q etc microsoft sql server 3 selling database management system dbms behind oracle ibm versions sql server market since 1987 xleratordb compatible 2005 edition later like major dbms sql server performs variety data mining operations returning arraying data different views also known drill-down addition sql server uses transact-sql t-sql execute four major classes pre-defined functions native mode functions operating dbms offer several advantages client layer applications like excel utilize up-to-date data available process far larger quantities data data subject exporting transcription errors sql server 2008 includes total 58 functions perform relatively basic aggregation 12 math 23 string manipulation 23 operations useful analytics includes native functions perform complex operations directly related finance statistics engineering microsoft excel component microsoft office suite one widely used spreadsheet applications market today addition inherent utility stand-alone desktop application excel overlaps complements functionality dbms several ways storing arraying data rows columns performing certain basic tasks pivot table aggregating values facilitating sharing importing exporting database data excel chief limitation relative true database capacity excel 2003 limited 65k rows 256 columns excel 2007 extends capacity roughly 1million rows 16k columns comparison sql server able manage 500k terabytes memory excel offers however extensive library specialized pre-written functions useful performing ad hoc analysis database data excel 2007 includes 300 pre-defined functions although customized functions also created users imported third party developers add-ons excel functions grouped type operating client computing layer excel plays important role business intelligence tool microsoft reinforces positioning business intelligence documentation positions excel clearly pivotal role operating within database environment xleratordb functions utilize naming conventions input formats cases return calculation results excel functions xleratordb coupled sql server native capabilities compares excel function sets follows | [
4490,
3573,
2901,
11030,
8028
] | Test |
1,720 | 3 | The_Light_Corridor:light corridor light corridor first-person puzzle game available atari st amiga amstrad cpc commodore 64 ms-dos msx zx spectrum released 1990 infogrames player must capture light rays order accomplish ultimate challenge illumination stars newborn universe player uses paddle hit metal ball long corridor player releases ball stuck paddle beginning game travel corridor hits wall similar obstacle bounces back towards player point player need hit ball ball hit lose life game continue player stopped ball attached paddle ball travelling corridor player must walk follow object game reach end corridor obstacles moving elevator-style doors make navigating corridor difficult success relies player ’ quick reactions forward planning collectable power-ups make progress easier colour corridor changes every four levels fifty levels total game played one two players two player games players alternate turns level construction kit included player create levels save future use sinclair user gave 93 overall score crash called simple wildly addictive sinclair said frustratingly difficult worth going back | [
9166,
9006
] | Test |
1,721 | 9 | GoldSim:goldsim goldsim dynamic probabilistic simulation software developed goldsim technology group general-purpose simulator hybrid several simulation approaches combining extension system dynamics aspects discrete event simulation embedding dynamic simulation engine within monte carlo simulation framework general-purpose simulator goldsim extensively used environmental engineering risk analysis applications areas water resource management mining radioactive waste management geological carbon sequestration aerospace mission risk analysis energy 1990 golder associates international engineering consulting firm asked united states department energy doe develop probabilistic simulation software could used help decision support management within office civilian radioactive waste management results effort two dos-based programs rip strip used support radioactive waste management projects within doe 1996 effort funded golder associates us doe japan nuclear cycle development institute currently japan atomic energy agency enresa capabilities rip strip incorporated general purpose windows-based simulator called goldsim subsequent funding also provided nasa initially offered original funding organizations goldsim released public 2002 2004 goldsim technology group llc spun golder associates wholly independent company notable applications include providing simulation framework 1 yucca mountain repository performance assessment model developed sandia national laboratories 2 comprehensive system-level computational model performance assessment geological sequestration co developed los alamos national laboratory 3 flood operations model help better understand fine tune operations large dam used water supply flood control queensland australia 4 models simulating risks associated future manned space missions nasa ’ constellation program developed nasa ames research center goldsim provides visual hierarchical modeling environment allows users construct models adding “ elements ” model objects represent data equations processes events linking together graphical representations resemble influence diagrams influence arrows automatically drawn elements referenced elements complex systems translated hierarchical goldsim models creating layer “ containers ” sub-models visual representations hierarchical structures help users build large complex models still explained interested stakeholders e.g. government regulators elected officials public though primarily continuous simulator goldsim number features typically associated discrete simulators combining two simulation methods systems best represented using continuous discrete dynamics often accurately simulated examples include tracking quantity water reservoir subject continuous inflows outflows well sudden storm events tracking quantity fuel space vehicle subjected random perturbations e.g. component failures extreme environmental conditions software originally developed complex environmental applications many inputs uncertain and/or stochastic addition dynamic simulator goldsim monte carlo simulator inputs defined distributions entire system simulated large number times provide probabilistic outputs software incorporates number computational features facilitate probabilistic simulation complex systems including tools generating correlating stochastic time series advanced sampling capabilities including latin hypercube sampling nested monte carlo analysis importance sampling support distributed processing | [
4792,
6797,
9166,
7983
] | Test |
1,722 | 3 | Lockstep_(computing):lockstep computing lockstep systems fault-tolerant computer systems run set operations time parallel redundancy duplication allows error detection error correction output lockstep operations compared determine fault least two systems dual modular redundancy error automatically corrected least three systems triple modular redundancy via majority vote term lockstep originates army usage refers synchronized walking marchers walk closely together physically practical run lockstep system set progress one well-defined state next well-defined state new set inputs reaches system processes generates new outputs updates state set changes new inputs new outputs new state considered define step must treated atomic transaction words either happens none happens something sometimes timeshift delay set systems increases detection probability errors induced external influences e.g voltage spikes ionizing radiation situ reverse engineering vendors including intel use term lockstep memory describe multi-channel memory layout cache lines distributed two memory channels one half cache line stored dimm first channel second half goes dimm second channel combining single error correction double error detection secded capabilities two ecc-enabled dimms lockstep layout single-device data correction sddc nature extended double-device data correction dddc providing protection failure single memory chip downsides intel lockstep memory layout reduction effectively usable amount ram case triple-channel memory layout maximum amount memory reduces one third physically available maximum reduced performance memory subsystem computing systems duplicated actively process step difficult arbitrate outputs differ end step reason common practice run dmr systems master/slave configurations slave hot-standby master rather lockstep since advantage slave unit actively process step common method working master copy state end step processing slave master fail point slave ready continue previous known good step either lockstep dmr approach combined means detecting errors master provide redundancy hardware failure master protect software failure master fails software error highly likely slave attempting repeat execution step failed simply repeat error fail way example common mode failure computing systems triplicated becomes possible treat voting systems one unit output disagrees two detected failed matched output two treated correct | [
4868,
8229,
5384,
8233,
10220,
9677,
6926,
7631,
6033,
4821,
9685,
10173
] | Test |
1,723 | 8 | Link_rot:link rot link rot linkrot process hyperlinks individual websites internet general tend point web pages servers resources become permanently unavailable reliable data long web pages resources survive estimates vary dramatically different studies well different sets links studies based see prevalance section link rot also called link death link breaking reference rot link work called broken link dead link dangling link formally form dangling reference target reference longer exists one common reasons broken link target web page longer exists frequently results 404 error indicates web server responded specific page could found another type dead link occurs server hosts target page stops working removed service relocates new domain name browser may return dns error display site unrelated content sought latter occur domain name lapses subsequently registered another party reasons broken links include 404 found response ubiquitous familiar even occasional web user number studies examined prevalence link rot web academic literature digital libraries 2003 experiment discovered one link every 200 disappeared week internet another study 2005 discovered half urls cited d-lib magazine articles longer accessible 10 years publication studies shown link rot academic literature even worse 2002 study examined link rot digital libraries found 3 objects longer accessible one year 2014 bookmarking site pinboard owner maciej cegłowski reported pretty steady rate 5 link rot per year study links yahoo directory showed 2016–2017 shortly yahoo stopped publishing directory half-life links time around two years research fairly early stages world wide web existence late 1990s – early 2000s showed dramatically different half-lives one order magnitude different collections links 2014 harvard law school study jonathan zittrain kendra albert lawrence lessig determined approximately 50 urls u.s. supreme court opinions longer link original information also found selection legal journals published 1999 2011 70 links longer functioned intended 2013 study bmc bioinformatics analyzed nearly 15,000 links abstracts thomson reuters web science citation index found median lifespan web pages 9.3 years 62 archived august 2015 weblock analyzed 180,000 links references full-text corpora three major open access publishers found overall 24.5 links cited longer available discovering broken links might done manually automatically automated methods including plug-ins wordpress drupal content management system used detect presence broken urls alternative using specific broken link checker like xenu link sleuth however url returns http 200 ok response may accessible contents page could changed may longer relevant manual checking links seems must web servers also return soft 404 reporting computers link works even though n't study published 2004 heuristic developed detecting soft 404s numerous solutions tackling broken links work prevent first place others try resolve occurred also numerous tools developed help combat link rot recommendations common-sense include combat link rot web archivists actively engaged collecting web particular portions web ensuring collection preserved archive archive site future researchers historians public goal internet archive maintain archive entire web taking periodic snapshots pages accessed free via wayback machine january 2013 company announced reached milestone 240 billion archived urls national libraries national archives organizations also involved archiving culturally important web content individuals may use number tools allow archive web resources may go missing future however preserving systems may encounter service interruption preserved urls intermittently unavailable | [
2945,
5641,
1167,
5012,
1944,
1954,
1443,
2339,
8627,
8644,
2887,
7370,
2016,
9325,
6002,
5622,
119,
10102,
7673,
3323
] | None |
1,724 | 9 | Name_mangling:name mangling compiler construction name mangling also called name decoration technique used solve various problems caused need resolve unique names programming entities many modern programming languages provides way encoding additional information name function structure class another datatype order pass semantic information compilers linkers need arises language allows different entities named identifier long occupy different namespace namespace typically defined module class explicit namespace directive different signatures function overloading object code produced compilers usually linked pieces object code produced another compiler type program called linker linker needs great deal information program entity example correctly link function needs name number arguments types although name mangling generally required used languages support function overloading c classic pascal use cases provide additional information function example compilers targeted microsoft windows platforms support variety calling conventions determine manner parameters sent subroutines results returned different calling conventions compatible one another compilers mangle symbols codes detailing convention used call specific routine mangling scheme established microsoft informally followed compilers including digital mars borland gnu gcc compiling code windows platforms scheme even applies languages pascal delphi fortran c allows subroutines written languages call called existing windows libraries using calling convention different default compiling following c examples 32 bit compilers emit respectively mangling schemes function encoded codice_1 codice_2 respectively number bytes decimal argument parameter list including passed registers fastcall case function name merely prefixed underscore 64-bit convention windows microsoft c leading underscore difference may rare cases lead unresolved externals porting code 64 bits example fortran code use 'alias link c method name follows compile link fine 32 bits generate unresolved external codice_3 64 bits one workaround use 'alias method names typically need capitalized c fortran another use bind option c++ compilers widespread users name mangling first c++ compilers implemented translators c source code would compiled c compiler object code symbol names conform c identifier rules even later emergence compilers produced machine code assembly directly system linker generally support c++ symbols mangling still required c++ language define standard decoration scheme compiler uses c++ also complex language features classes templates namespaces operator overloading alter meaning specific symbols based context usage meta-data features disambiguated mangling decorating name symbol name-mangling systems features standardized across compilers linkers link object code produced different compilers single c++ translation unit might define two functions named distinct functions relation apart name c++ compiler therefore encode type information symbol name result something resembling even though name unique still mangled name mangling applies symbols mangled symbols example comments respective identifier name produced gnu gcc 3.x compilers mangled symbols begin codice_4 note identifier beginning underscore followed capital reserved identifier c conflict user identifiers avoided nested names including namespaces classes followed codice_5 series length id pairs length length next identifier finally codice_6 example codice_7 becomes functions followed type information function simply codice_8 hence standard type codice_9 used special alias codice_10 reference type therefore codice_11 complete name function n't standard scheme even trivial c++ identifiers mangled consequently different compilers even different versions compiler compiler different platforms mangle public symbols radically different thus totally incompatible ways consider different c++ compilers mangle functions notes job common c++ idiom ensure symbols within unmangled – compiler emits binary file names undecorated c compiler would c language definitions unmangled c++ compiler needs avoid mangling references identifiers example standard strings library usually contains something resembling thus code uses correct unmangled used sunpro c++ compiler would produce code equivalent since symbols exist c runtime library e.g libc link errors would result though would seem standardised name mangling c++ language would lead greater interoperability compiler implementations standardization would suffice guarantee c++ compiler interoperability might even create false impression interoperability possible safe n't name mangling one several application binary interface abi details need decided observed c++ implementation abi aspects like exception handling virtual table layout structure stack frame padding etc also cause differing c++ implementations incompatible requiring particular form mangling would cause issues systems implementation limits e.g. length symbols dictate particular mangling scheme standardised requirement name mangling would also prevent implementation mangling required — example linker understood c++ language c++ standard therefore attempt standardise name mangling contrary annotated c++ reference manual also known arm section 7.2.1c actively encourages use different mangling schemes prevent linking aspects abi exception handling virtual table layout incompatible nevertheless detailed section platforms full c++ abi standardized including name mangling c++ symbols routinely exported dll shared object files name mangling scheme merely compiler-internal matter different compilers different versions compiler many cases produce binaries different name decoration schemes meaning symbols frequently unresolved compilers used create library program using employed different schemes example system multiple c++ compilers installed e.g. gnu gcc os vendor compiler wished install boost c++ libraries would compiled multiple times gcc vendor compiler good safety purposes compilers producing incompatible object codes codes based different abis regarding e.g. classes exceptions use different name mangling schemes guarantees incompatibilities detected linking phase executing software could lead obscure bugs serious stability issues reason name decoration important aspect c++-related abi output java signature method class contains name types method arguments return value applicable format signatures documented language compiler .class file format designed together object-orientation universal interoperability mind start scope anonymous classes confined parent class compiler must produce qualified public name inner class avoid conflict classes name inner exist namespace similarly anonymous classes must fake public names generated concept anonymous classes exists compiler runtime compiling following java program produce three .class files class names valid symbols permitted jvm specification names safe compiler generate java language definition advices use symbols normal java class definitions name resolution java complicated runtime fully qualified class names unique inside specific classloader instance classloaders ordered hierarchically thread jvm so-called context class loader cases two different classloader instances contain classes name system first tries load class using root system classloader goes hierarchy context class loader java native method support allows java language programs call programs written another language generally either c c++ two name-resolution concerns neither implemented particularly standard manner python mangling used private class members designated giving name two leading underscores one trailing underscore example codice_13 mangled codice_14 codice_15 codice_16 codice_17 python runtime restrict access members mangling prevents name collisions derived class defines member name encountering name mangled attributes python transforms names prepending single underscore name enclosing class example avoid name mangling pascal use free pascal supports function operator overloading thus also uses name mangling support features hand free pascal capable calling symbols defined external modules created another language exporting symbols called another language information consult chapter 6.2 chapter 7.1 free pascal programmer guide name mangling also necessary fortran compilers originally language case insensitive mangling requirements imposed later evolution language addition modules features fortran 90 standard case mangling especially common issue must dealt order call fortran libraries lapack languages c case insensitivity name subroutine function foo must converted canonical case format fortran compiler linked way regardless case different compilers implemented various ways standardization occurred aix hp-ux fortran compilers convert identifiers lower case foo cray unicos fortran compilers converted identifiers upper case foo gnu g77 compiler converts identifiers lower case plus underscore foo_ except identifiers already containing underscore foo_bar two underscores appended foo_bar__ following convention established f2c many compilers including sgi irix compilers gnu fortran intel fortran compiler except microsoft windows convert identifiers lower case plus underscore foo_ foo_bar_ microsoft windows intel fortran compiler defaults uppercase without underscore identifiers fortran 90 modules must mangled procedure name may occur different modules since fortran 2003 standard requires module procedure names conflict external symbols compilers tend use module name procedure name distinct marker example following module name function mangled e.g. gnu fortran e.g. intel ifort e.g. oracle sun95 etc since fortran allow overloading name procedure uses generic interface blocks generic type-bound procedures instead mangled names need incorporate clues arguments fortran 2003 bind option overrides name mangling done compiler shown function names mangled default rust however disabled function attribute attribute used export functions c c++ objective-c. additionally along function attribute crate attribute allows user define c-style entry point program starting rust 1.9 rust uses c++-style name-mangling scheme partly follows itanium c++ abi essentially two forms method exist objective-c class static method instance method method declaration objective-c following form class methods signified instance methods use typical class method declaration may look like instance methods looking like method declarations specific internal representation compiled method named according following scheme class methods instance methods colons objective-c syntax translated underscores objective-c class method belonging codice_18 class would translate codice_19 instance method belonging class would translate codice_20 methods class labeled way however order look method class may respond would tedious methods represented fashion methods assigned unique symbol integer symbol known selector objective-c one manage selectors directly — specific type objective-c — codice_21 compilation table built maps textual representation codice_20 selectors given type codice_21 managing selectors efficient manipulating textual representation method note selector matches method name class belongs — different classes different implementations method name implementations method given specific identifier — known implementation pointers given type also codice_24 message sends encoded compiler calls function one cousins codice_25 receiver message codice_21 determines method call class table maps selectors implementations — implementation pointer specifies memory actual implementation method resides separate tables class instance methods apart stored codice_21 codice_24 lookup tables functions essentially anonymous codice_21 value selector vary classes enables polymorphism objective-c runtime maintains information argument return types methods however information part name method vary class class since objective-c support namespaces need mangling class names appear symbols generated binaries swift keeps metadata functions mangled symbols referring metadata includes function name attributes module name parameter types return type example mangled name method codice_30 codice_31 class module codice_32 _tfc4test7myclass9calculatefs0_ft1xsi_si components meanings follows codice_33 prefix swift symbols everything start codice_34 non-curried function codice_35 function class method codice_36 module name prefixed length codice_37 class name function belongs prefixed length codice_38 function name codice_39 function attribute case ‘ f ’ normal function codice_40 designates type first parameter namely class instance first type stack codice_31 nested thus index 0 codice_42 begins type list parameter tuple function codice_43 external name first parameter function codice_44 indicates builtin swift type codice_45 first parameter codice_46 return type codice_45 | [
1922,
8966,
6664,
7432,
1304,
2204,
3102,
5663,
1952,
7071,
5040,
2481,
11574,
10176,
9921,
10051,
8262,
4424,
585,
5065,
8012,
8396,
7889,
3960,
6102,
7421,
8037,
10470,
8554,
6126,
1775,
5872,
6640,
2804,
2936,
2556,
2045,
5630
] | Test |
1,725 | 3 | POWER3:power3 power3 microprocessor designed exclusively manufactured ibm implemented 64-bit version powerpc instruction set architecture isa including optional instructions isa time instructions present power2 version power isa powerpc isa introduced 5 october 1998 debuting rs/6000 43p model 260 high-end graphics workstation power3 originally supposed called powerpc 630 renamed probably differentiate server-oriented power processors replaced consumer-oriented 32-bit powerpcs power3 successor p2sc derivative power2 completed ibm long-delayed transition power powerpc originally scheduled conclude 1995 power3 used ibm rs/6000 servers workstations 200 mhz competed digital equipment corporation dec alpha 21264 hewlett-packard hp pa-8500 power3 based powerpc 620 earlier 64-bit powerpc implementation late under-performing commercially unsuccessful like powerpc 620 power3 three fixed-point units single floating-point unit fpu replaced two floating-point fused multiply–add units extra load-store unit added total two improve floating-point performance power3 superscalar design executed instructions order seven-stage integer pipeline minimal eight-stage load/store pipeline ten-stage floating-point pipeline front end consists two stages fetch decode first stage eight instructions fetched 32 kb instruction cache placed 12-entry instruction buffer second stage four instructions taken instruction buffer decoded issued instruction queues restrictions instruction issue two integer instruction queues one accept one instruction accept four floating-point instruction queue queues enough unused entries instructions issued front end short pipeline resulting small three-cycle branch misprediction penalty stage three instructions instruction queues ready execution operands read register files general-purpose register file contains 48 registers 32 general-purpose registers 16 rename registers register renaming reduce number ports required provide data receive results general purpose register file duplicated two copies first supporting three integer execution units second supporting two load/store units scheme similar contemporary microprocessor dec alpha 21264 simpler require extra clock cycle synchronize two copies due power3 higher cycle times floating-point register file contains 56 registers 32 floating-point registers 24 rename registers compared powerpc 620 rename registers allowed instructions executed order improving performance execution begins stage four instruction queues dispatch eight instructions execution units integer instructions executed three integer execution units termed fixed-point units ibm two units identical execute integer instructions except multiply divide instructions executed one-cycle latency third unit executes multiply divide instructions instructions pipelined multi-cycle latencies 64-bit multiply nine-cycle latency 64-bit divide 37-cycle latency floating-point instructions executed two floating-point units fpus fpus capable fused multiply–add multiplication addition performed simultaneously instructions along individual add multiply four-cycle latency divide square-root instructions executed fpus assisted specialized hardware single-precision 32-bit divide square-root instructions 14-cycle latency whereas double-precision 64-bit divide square-root instructions 18-cycle 22-cycle latency respectively execution completed instructions held buffers committed made visible software execution finishes stage five integer instructions stage eight floating-point committing occurs stage six integers stage nine floating-point writeback occurs stage commit power3 retire four instructions per cycle powerpc 620 data cache optimized technical scientific applications capacity doubled 64 kb improve cache-hit rate cache dual-ported implemented interleaving eight banks enable two loads two stores performed one cycle certain cases line-size increased 128-bytes l2 cache bus doubled width 256 bits compensate larger cache line size retain four-cycle latency cache refills power3 contained 15 million transistors 270 mm die fabricated ibm cmos-6s2 process complementary metal–oxide–semiconductor process hybrid 0.25 µm feature sizes 0.35 µm metal layers process features five layers aluminium packaged 1,088-column ceramic column grid array p2sc different pin power3-ii improved power3 increased clock frequency 450 mhz contains 23 million transistors measured 170 mm fabricated ibm cmos7s process 0.22 µm cmos process six levels copper interconnect succeeded power4 2001 | [
6914,
4868,
10501,
3846,
4743,
5384,
6663,
5642,
1548,
1933,
3470,
6926,
3472,
4881,
5015,
7065,
1563,
1309,
6815,
3493,
6949,
6311,
8102,
1321,
9391,
10543,
4017,
5297,
1461,
8120,
6715,
9020,
1983,
1985,
10180,
336,
8530,
3540,
10837,
3... | Test |
1,726 | 1 | Pseudocolumn:pseudocolumn pseudocolumn column yields value selected actual column table example rowid sysdate often used combination dual table | [
5546,
2901,
11551
] | Test |
1,727 | 4 | NotCompatible:notcompatible notcompatible complex malware infects android-based phones revealed late 2014 thought infected hundreds thousands phones | [
7515
] | Test |
1,728 | 2 | Nokia_N9:nokia n9 nokia n9 codename lankku smartphone developed nokia running linux-based meego harmattan mobile operating system announced june 2011 released september first device nokia meego partly company alliance microsoft announced year initially released three colors black cyan magenta white version announced nokia world 2011 despite limited release n9 received widespread critical acclaim describing nokia finest device date praised software hardware including meego operating system buttonless 'swipe user interface high-end features design would form basis windows phone-powered nokia lumia 800 later year successor nokia n900 internally known n9-00 scheduled released late 2010 approximately one year n900 launched pictures prototype leaked august 2010 showed industrial design 4-row keyboard software engineer working nokia device division cited n9-00 product number public bug tracker qt open source application development framework used meego would later known n950 design dropped nokia started working n9-01 codenamed lankku new variant without keyboard nokia planned 2010 make meego flagship smartphone platform replacing symbian whose n8 flagship launched year thus effectively n9 originally meant flagship device company 11 february 2011 nokia partnered microsoft use windows phone 7 flagship operating system replace symbian meego also sidelined nokia ceo stephen elop promised still ship one meego device year would end n9 nokia n9 announced 21 june 2011 nokia connection event singapore time phone presumed become available public september 2011 users get notified via e-mail availability n9 country webpage nokia online store since nokia closed nokia online shop many countries including poland germany netherlands france italy spain united kingdom united states 30 june 2011 availability countries hands retailers operators elop restated company continuing development meego even n9 would success focusing solely future lumia series something meego supporters already felt n9 announcement due microsoft deal responded creating petition want nokia keep meego even severe meego linux also form continuation maemo linux established combining nokia maemo intel moblin frames nokia intel alliance created purposes cooperation despite success alliance broken meego canceled stephen elop decision intel officially expressed regrets situation n9 positive reception generally weak sales lumia range elop criticised move said contributed company demise smartphone market according elop following microsoft alliance meego became experimental project harmattan interface elements used cancelled meltemi project later nokia asha platform august 2011 nokia announced nokia n9 released united states reports indicated device available markets japan canada germany nokia posted official blog last week september 2011 n9 phones heading stores initial retail price announced around €480 16gb €560 64gb applicable taxes subsidies germany devices imported switzerland available online amazon german cyberport gmbh january 2012 also made available major stores saturn media markt chain february 2012 nokia n9 appeared italian nokia site supposed sign n9 official nokia distribution italian market prices january 2012 depending size internal memory €500 €630 nokia n9 powered texas instruments omap 3630 system-on-a-chip based 45 nanometer cmos process includes three processor units 1 ghz arm cortex a8 cpu runs operating system applications imagination technologies powervr sgx530 gpu supporting opengl es 2.0 capable processing 14 million polygons per second 430 mhz ti tms320c64x digital signal processor image processing camera audio processing telephony data transmission system also 1 gb low power single channel ram mobile ddr compcache uses part memory compressed fast swap time powerful device nokia created user data stored internal emmc chip 16 64 gb variants n9 first smartphone encompass 64 gb storage nokia n9 capacitive touchscreen 6 simultaneous points resolution 854 × 480 pixel fwvga 251 ppi pentile rgbg layout according nokia capable displaying 16.7 million colors oled screen covered curved scratch-resistant corning gorilla glass gap glass display reduced screen coated anti-glare polarizer ease usability daylight proximity sensor deactivates display touchscreen device brought near face call also ambient light sensor adjusts display brightness device also makes use accelerometer rotate screen portrait/landscape mode applications web browser n9 autonomous gps feature optional a-gps functionality wi-fi network positioning magnetometer comes pre-loaded nokia maps nokia drive applications nokia maps similar ovi maps found recent symbian devices nokia mostly finding nearby places restaurants metro station theater etc ... around user nokia maps meego also integrated contacts calendar applications nokia drive dedicated application car navigation provides free lifetime turn-by-turn voice guided car navigation nokia n9 comes preloaded maps continent purchased nokia drive require active data connection work stand-alone gps navigator main back camera autofocus feature dual led flash optimized 16:9 4:3 aspect ratios 4× digital zoom video camera sensor size back camera 8.7 megapixels 3552 × 2448 px effective resolution 16:9 aspect ratio 3552 × 2000 px 7.1 megapixels 3248 × 2448 px 8 megapixels 4:3 aspect ratio typically 16:9 picture format digital camera achieved cropping top bottom 4:3 image since sensor 4:3 nokia n9 genuinely provides width picture choosing 16:9 aspect ratio option using full 3552-pixel width sensor height picture choosing 4:3 aspect ratio option using full 2448-pixel height sensor carl zeiss lens quite unusual specifications mobile phone 28mm wide-angle lens focal length fast class f/2.2 aperture 10 cm-to-infinity focus range capable recording 720p video 30 fps stereo sound holding device facing screen right side power on/off long press lock/unlock short press button volume keys nokia n9 fewer hardware buttons smartphones makes extensive use touchscreen navigate user interface example minimize running application user swipe finger one side bezel surrounding screen opposite side also dedicated shutter key camera touch screen instead used focus take picture screen unlocked double tapping n9 two microphones loudspeaker situated bottom phone main microphone enables conversation recording second microphone located back device near flash leds main camera used meego system noise cancellation make phone conversations clearer noisy environment top 3.5 mm av connector simultaneously provides stereo audio output support dolby headphone either microphone input video output next 3.5 mm connector high-speed usb 2.0 usb micro-b connector provided data synchronization mass storage mode client battery charging usb connector protected small door built-in bluetooth v2.1 +edr enhanced data rate supports stereo audio output a2dp profile built-in car hands-free kits also supported hfp profile file transfer supported ftp along opp profile sending/receiving objects possible remote control device avrcp profile bluetooth chip also functions fm receiver/transmitter allowing one listen fm radio using headphones connected 3.5 jack antenna nokia n800 n810 n900 ship without software support however fm radio application already available ovi store independent developer nfc also supported sharing photos contacts music devices supporting nfc e.g nokia c7 nokia 701 also pairing connecting stereo speakers e.g nokia play 360 headset e.g nokia bh-505 one device connected simultaneously n9 via nfc nokia n9 bv-5jw 3.8v 1450mah battery according nokia provides 7h 11h continuous talk time 16 19.5 days standby 4.5h video playback 50h music playback phone supports usb charging number devices used n9 via several connectivity options external keyboards via bluetooth wireless headphones via nfc wireless loudspeakers via nfc many others strictly speaking nokia n9 run meego 1.2 operating system instead runs nokia refers meego instance development harmattan previously marketed maemo 6 nokia intel merged open source projects one new common project called meego postpone development schedule nokia decided keep core harmattan middleware components gstreamer packaging managers harmattan system uses debian packages instead rpm packages nonetheless harmattan designed fully api compatible meego 1.2 via qt far end users application developers concerned distinction harmattan meego 1.2 minimal since marketing effort would directed meego nokia dropped maemo branding adopt meego confuse customers. ref name= renaming maemo 6 meego/harmattan /ref nokia n9 user experience provides three panes called home lock screen dragging flicking horizontally navigates three panes home home consists application swipe gesture one edge screen one return user one three views home close application either suspended keep running background depending application close application user must press hold red x appears upper left corner application thumbnail open application view close user may also close apps swiping top device application fadeout effect tapping status bar top screen using application display menu allowing user adjust volume change active profile silent beep ringing internet connection wifi gsm data bluetooth control shortcut enabled bluetooth settings media sharing dlna shortcut enabled media sharing settings introduced pr 1.2 availability lock screen display status bar clock notifications screen also holds music controls introduced pr 1.1 music player active customizable end user phone unlocked double tapping screen sliding holding lock screen reveals 4 shortcuts called quick launcher quick launcher also accessed using application swiping ui n9 including visual style double-tap feature resurrected nokia asha platform introduced nokia asha 501 device 2013 nokia n9 announced nokia connections event singapore june 2011 reception device positive citing meego v1.2 harmattan ui pseudo-buttonless design polycarbonate unibody construction nfc capabilities still many reviewers recommend buy n9 nokia earlier decision drop meego windows phone future smartphones – often questioning decision time engadget editor vlad savov said june 2011 terrific phone got legitimately excited use future clouded parent investing time money building whole os later review engadget writes love first sight — possibly beautiful phone ever made meego 1.2 harmattan breath fresh air leave gasping — remember 're dealing dead man walking review ars technica ryan paul writes n9 impressively engineered device matched sophisticated touch-oriented interface powerful software stack open source underpinnings verge website writes nokia n9 without doubt one fascinating phones last years german der spiegel titles could nokia winner german magazine stern describes one best devices ever made nokia delimiter called n9 nokia significant handset since nokia n95 nokia n9 released largest smartphone markets u.s. canada uk netherlands germany france italy spain others nokia disclose number sales n9 november 2011 nokia n9 3 4 applicable titles including design camera cellphone year gala held swedish magazine webzine mobil.se january 2012 nokia n9 swipe ui nominated ixda interaction award february 2012 n9 reached number 1 ranking rate rate 8.432 10 votes 74,940 also number 5 daily interest hits gsmarena ranking april 2012 n9 awarded design art direction yellow pencil interactive product design category beating among others ipad 2 nokia lumia 800 approach applied nokia one open platform exception closed user experience maemo 5 nokia n900 community request closed source component owned nokia released open source hundreds 3rd party applications mostly free open source already created ported gnu/linux meego harmattan platform nokia decision abandon meego even n9 success left much team unhappy staff left form new company jolla continue development meego resulted fork called sailfish os ported n9 see released two new smartphones created jolla images n9 prototype running android 2.3 leaked sina weibo user previously uploaded prototype images nokia sea ray later lumia 800 windows phone believed likely genuine steven elop mentioned nokia considered android past unofficial android 4.1.1 port nitdroid community made port features general functionality misses features voice calling use camera 21 november 2012 jolla announced demonstrated sailfish os direct continuation based meego 80 first linux sailfish os open source part linux meego original meego open source code developed frames mer software distribution comes meego reinstated established current standard middleware stack core software kernel ui os open source free vendors harmattan ui several software applications used n9 closed proprietary nokia hence could used neither mer project sailfish os jolla introduced swipe ui used mer core standard created sailfish os videos sailfish os running nokia n950 appeared internet day announcement n950 similar technical specifications n9 slight differences including physical qwerty keyboard led many owners n9 believe sailfish os ported n9 jolla confirmed also stated official possibilities kind support n9 instead community provide unofficial port sailfish os however jolla maintained experience sailfish official jolla phones jolla released first jolla mobile phone november 27 2013 sailfish os first full linux meego os meego harmattan meego instance fully finished combining maemo moblin sailfish os actively developed commonly assumed next better incarnation meego also jolla device assumed unofficial successor n9 legacy means early 2019 kaios technologies inc. demonstrate devices running kaios nokia 8110 2018 jio phone one full touch device suspected nokia n9 | [
1537,
3585,
529,
10770,
5143,
2072,
5659,
6178,
4132,
40,
3626,
9266,
10802,
7220,
5175,
1083,
10820,
11337,
9292,
7246,
1615,
5201,
7253,
10838,
3162,
5211,
6748,
8285,
1633,
109,
2684,
3205,
9359,
1682,
10393,
5274,
669,
6310,
167,
5290... | Test |
1,729 | 2 | Apple_Advanced_Typography:apple advanced typography apple advanced typography aat apple inc. computer technology advanced font rendering supporting internationalization complex features typographers successor apple little-used quickdraw gx font technology mid-1990s set extensions truetype outline font standard smartfont features similar opentype font format developed adobe microsoft graphite also incorporates concepts adobe multiple master font format allowing axes traits defined morphing glyph independently along axes aat font features alter underlying typed text affect characters representation glyph conversion significant features aat currently include aat font features supported mac os 8.5 versions macos cross-platform icu library provided basic aat support left-to-right scripts harfbuzz version 2 added aat shaping support open-source implementation technology chrome/chromium version 72 uses instead coretext rendering macos aat fonts cross-platform way os x yosemite ios 8 aat supports language-specific shaping—that changing glyphs processed depending human language used represent support available use language tags core text provision added time relative positioning two glyphs via anchor points via ‘ kerx ’ ‘ ankr ’ tables mac os x 10.5 leopard partial support opentype available 2011 support limited western arabic scripts font aat tables used typography font aat tables opentype tables used extent system supports means many opentype fonts western middle eastern scripts used without modification mac os x 10.5 south asian scripts thai devanagari require aat tables proper layout aat first requires text turned entirely glyphs text layout occurs operations text take place entirely within glyph layer core table used aat layout process morx table table divided series chains divided subtables chains subtables processed order subtable encountered layout engine compares flags subtable control flags generally derived user settings determines whether subtable processed set available features font made accessible user via feat table table provides pointers localizable strings used describe feature end user appropriate flags send text engine feature selected features made invisible user simple expedient including entries feat table apple uses approach example support required ligatures subtables may perform non-contextual glyph substitutions contextual glyph substitutions glyph rearrangements glyph insertions ligature formation contextual actions sensitive surrounding text used example automatically turn medial anywhere word except end morx subtables non-contextual glyph substitutions simple mapping tables glyph substituted substitute others involve use finite state machines purposes processing finite state machine glyphs organized classes class may small containing single glyph something like ligature formation may include dozens glyphs even special class automatically defined glyph included explicit classes special classes also available end glyph stream glyphs deleted glyph stream beginning start-of-text state layout engine parses text glyph glyph depending current state class glyph encounters switch new state possibly perform appropriate action process continues glyph stream exhausted use finite state machines allows morx tables relatively small processed relatively quickly also provide considerable flexibility inasmuch however apple font tools require generation morx tables via raw state table information difficult produce debug font designer also responsible making sure morx subtables ordered correctly desired effect since aat operates entirely glyphs never characters layout information necessary producing proper display resides within font allows fonts added new scripts without requiring specific support os third parties produce fonts scripts officially supported apple work macos hand also means every font given script requires copy script shaping information morx tables aat tables aat-specific extensions standard truetype tables allow context-sensitive kerning justification ligature splitting aat also supports variation fonts font shape vary depending scaled value supplied user variation fonts similar adobe defunct multiple master fonts endpoints defined medial value valid user drag sliders user interface make glyphs taller shorter make fatter thinner increase decrease size serifs like independently one another glyphs may even fundamental shapes radically altered opentype introduced font variation september 2016 nothing like opentype aat tables also point-size dependent effects example 12 points horizontal vertical strokes similar width 300 points stroke width variation could quite great practice aat fonts use features technology available morx table zapfino hoefler text skia fonts ship macos illustrate variety aat capabilities indic scripts features necessary glyph reordering substitution aat supports noted opentype fonts indic scripts require aat tables added function properly macos however applies software dependent system support opentype programs provide implementation opentype render indic properly opentype fonts may however render indic fonts aat tables correctly mac os x 10.5 shipped fonts devanagari gurmukhi gujarati thai tibetan tamil fonts indic scripts included later versions macos ios well available third parties | [
11521,
2819,
1796,
3719,
4615,
137,
6023,
10888,
9100,
11402,
5647,
10512,
1042,
8852,
9109,
7318,
4888,
3228,
11037,
2207,
1439,
811,
3371,
5292,
1710,
6700,
8877,
1074,
8627,
10036,
3766,
2232,
9912,
11449,
11257,
9406,
6849,
4933,
713,
... | None |
1,730 | 2 | PurifyPlus:purifyplus purifyplus memory debugger program used software developers detect memory access errors programs especially written c c++ originally written reed hastings pure software pure software later merged atria software form pure atria software turn later acquired rational software turn acquired ibm divested unicom systems inc. dec 31 2014 functionally similar memory debuggers insure++ valgrind boundschecker purifyplus allows dynamic verification process program discovers errors occur program runs much like debugger static verification static code analysis contrast involves detecting errors source code without ever compiling running discovering logical inconsistencies type checking c compiler example static verification program linked purifyplus corrected verification code automatically inserted executable parsing adding object code including libraries way memory error occurs program print exact location error memory address involved relevant information purifyplus also detects memory leaks default leak report generated program exit also generated calling purifyplus leak-detection api within instrumented application errors purifyplus discovers include array bounds reads writes trying access unallocated memory freeing unallocated memory usually due freeing memory second time well memory leaks allocated memory pointer reference errors fatal least site error often running program way detect except observing something wrong due incorrect program behavior hence purifyplus helps detecting errors telling programmer exactly occur purifyplus works instrumenting object code detects errors occur inside third-party operating system libraries errors often caused programmer passing incorrect arguments library calls misunderstandings protocols freeing data structures used libraries often difficult errors find fix ability detect non-fatal errors major distinction purifyplus similar programs usual debuggers contrast debuggers generally allow programmer quickly find sources fatal errors program crash due dereferencing null pointer help detect non-fatal memory errors debuggers useful things purifyplus intended stepping code line line examining program memory hand particular moment execution words tools complement skilled developer purifyplus also includes functionality high-performance watchpoints general use using debugger one code worth noting using purifyplus makes sense programming languages leave memory management programmer hence java lisp visual basic example automatic memory management reduces occurrence memory leaks languages however still leaks unnecessary references objects prevent memory re-allocated ibm product called rational application developer uncover sorts errors | [
1952,
8037,
3048,
6664,
5677,
814,
847,
815,
7983,
4407,
3323,
2045
] | Test |
1,731 | 7 | Simple_Grid_Protocol:simple grid protocol simple grid protocol freeware grid computing package developed maintained brendan kosowski package includes protocol software tools needed get computational grid running linux bsd based clisp common lisp implementation simple grid protocol allows computer programs utilize unused cpu resources computers network internet | [
8258,
5956,
2062,
823
] | Test |
1,732 | 2 | TextClipping:textclipping textclipping extension used macintosh computers strings text used since mac os 9 released string text selected dragged desktop anywhere macintosh computer computer automatically converts .textclipping file file formed conveniently dragged text box replicate exact text including formatting legacy origins contents textclipping files stored inside actual data fork file files easily shared macs sent machines like attachment opening textclipping file applications show 0 byte empty data file osx views performs action textclipping file performs lookup file resource fork contents actually stored unlike file extensions .textclipping separates words name using capitalisation reminiscent programming languages javascript | [
9109,
3462
] | None |
1,733 | 7 | Guifi.net:guifi.net guifi.net free open neutral mostly wireless community network 35,000 active nodes 63,000 km wireless links july 2018 majority nodes located catalonia valencian community spain network growing parts world network self-organized operated users using unlicensed wireless links open optical fibre links nodes network contributed individuals companies administrations freely connect open network telecommunications extend network wherever infrastructure content might otherwise accessible nodes join network following self-provision model since whole structure explicitly open facilitate understanding structured everyone create new sections required results network infrastructure commons provides abundant connectivity guifi.net supported guifi.net foundation registered operator spanish telecommunications market commission cmt since april 2009 august 2009 first deployment optical fiber started known fiber farms fftf broadband initiative covering 2 km linking dozens farms farmhouses town gurb since early 2011 guifi.net connected catalonia neutral internet exchange point catnix exchanges data international telecommunications operators cogent communications hurricane electric internet connection used several associations offer members internet access low-cost high speeds internet service providers currently offer model oriented cost sharing compensation mechanism basic principle operation based wireless commons license | [
3016,
9098,
10021
] | Validation |
1,734 | 5 | PhoneNet:phonenet phonenet implementation appletalk networking physical layer created farallon computing netopia instead using expensive shielded twisted pair wiring apple localtalk implementation phonenet uses standard four-conductor telephone category 1 patch cords modular connectors like localtalk theoretical maximum speed data transfer 230 kbit/s generally used daisy chain topology unlike localtalk balanced grounded implementation phonenet used two lines four typical cable normal telephone equipment also normally used two lines phonenet could plugged existing phone lines instances allowing phone calls networking single cable generally requires hand-crimping cable using three rj11 jacks connecting single jack two one two wires phone two networking though phonenet transceivers still available third parties use legacy macintosh networks current apple computer device model comes rs-422 serial ports required phonenet transceivers modern apple devices network use ethernet wi-fi bluetooth | [
7706,
11554
] | Test |
1,735 | 3 | MIC-1:mic-1 mic-1 processor architecture invented andrew s. tanenbaum use simple complete example teaching book structured computer organization consists simple control unit runs microcode 512-words store micro-assembly language mal engineered allow simple writing ijvm interpreter source code interpreter found book data path core mic-1 contains 32-bit registers buses alu shifter 2 main buses 32 lines 32 bits registers selected 2 control lines one enable b bus enable c bus b bus enabled one register time since transfer data 2 registers time would make data inconsistent contrast c bus enabled 1 register time matter fact current value present c bus written 1 register without problems reading writing operations carried 1 clock cycle mbr register readonly register contains 2 control lines since 8-bit register output connected least significant 8 bits b bus set provide output 2 ways alu arithmetic logic unit following input output control lines shifter contains 32-bit input output output connected directly c bus shifter used perform logical arithmetic shift operations simply setting respectively control signal sll8 shift left logical sra1 shift right arithmetic | [
2241,
7173,
9714,
477
] | Test |
1,736 | 2 | Zswap:zswap zswap linux kernel feature provides compressed write-back cache swapped pages form virtual memory compression instead moving memory pages swap device swapped zswap performs compression stores memory pool dynamically allocated system ram later writeback actual swap device deferred even completely avoided resulting significantly reduced i/o linux systems require swapping tradeoff need additional cpu cycles perform compression result reduced i/o zswap offers advantages various devices use flash-based storage including embedded devices netbooks similar low-end hardware devices well devices use solid-state drives ssds storage flash memory limited lifespan due nature avoiding used providing swap space prevents wearing quickly zswap integrated rest linux kernel virtual memory subsystem using api provided frontswap mechanism linux kernel abstracts various types storage used swap space result zswap operates backend driver frontswap providing internally visible pseudo-ram device words frontswap api makes zswap capable intercepting memory pages swapped capable intercepting page faults already swapped pages access two paths allows zswap act compressed write-back cache swapped pages internally zswap uses compression modules provided linux kernel crypto api makes possible example offload compression tasks main cpu using hardware compression accelerators supported linux kernel selection desired compression module performed dynamically boot time value kernel boot parameter specified defaults selects lempel–ziv–oberhumer lzo compression version 3.13 linux kernel zswap also needs explicitly enabled specifying value kernel boot parameter maximum size memory pool used zswap configurable parameter specifies maximum percentage total system ram occupied pool memory pool preallocated configured maximum size instead grows shrinks required configured maximum pool size reached result performed swapping growing pool impossible due out-of-memory condition swapped pages evicted memory pool swap device least recently used lru basis approach makes zswap true swap cache oldest cached pages evicted swap device cache full making room newer swapped pages compressed cached zbud special-purpose memory allocator used internally zswap storing compressed pages implemented rewrite zbud allocator used oracle zcache another virtual memory compression implementation linux kernel internally zbud works storing two compressed pages buddies hence allocator name per physical memory page brings advantages due easy coalescing reusing freed space disadvantages due possible lower memory utilization however result design zbud allocate memory space would originally occupied uncompressed pages zswap zbud created seth jennings first public announcement december 2012 development continued may 2013 point codebase reached maturity although still status experimental kernel feature zswap together zbud merged linux kernel mainline kernel version 3.11 released september 2 2013 since version 3.15 linux kernel released june 8 2014 zswap properly supports multiple swap devices one alternatives zswap zram provides similar still different swap compressed pages ram mechanism linux kernel main difference zram provides compressed block device using ram storing data acts regular separate swap device comparison zswap acts ram-based cache swap devices provides zswap eviction mechanism less used swapped pages zram lacks though result design least one already existing swap device required zswap used | [
4616,
3082,
5139,
6675,
7187,
10776,
25,
10780,
541,
4637,
3615,
10785,
9762,
6180,
5158,
5681,
7217,
8242,
9266,
9784,
10809,
4668,
576,
2625,
4161,
8772,
6213,
6730,
8268,
589,
6221,
593,
86,
10333,
97,
6244,
5222,
2152,
10856,
8298,
... | Validation |
1,737 | 0 | Computational_semantics:computational semantics computational semantics study automate process constructing reasoning meaning representations natural language expressions consequently plays important role natural language processing computational linguistics traditional topics interest construction meaning representations semantic underspecification anaphora resolution presupposition projection quantifier scope resolution methods employed usually draw formal semantics statistical semantics computational semantics points contact areas lexical semantics word sense disambiguation semantic role labeling discourse semantics knowledge representation automated reasoning particular automated theorem proving since 1999 acl special interest group computational semantics sigsem | [
416,
1825,
1890,
3617,
7780,
9796,
9288,
7724,
2223,
11056,
10577,
116,
5781,
10452,
2999,
6745
] | Test |
1,738 | 5 | Presence_and_Instant_Messaging:presence instant messaging presence instant messaging prim early proposal ietf standard protocol instant messaging abstract model first published ietf request comments nowiki rfc 2778 /nowiki model presence instant messaging february 2000 authored mark day sightpath formerly lotus software helped develop ibm lotus sametime chief scientist riverbed technology jonathan rosenberg dynamicsoft chief technology officer vice president collaboration cisco systems hiroyasu sugano fujitsu laboratories ltdltd work done since 2001 currently sip derivative simple jonathan rosenberg also co-authored invented xmpp considered use instant messaging protocols | [
10242,
5251,
5382,
4746,
1036,
11408,
3228,
10271,
3105,
9511,
1962,
9519,
9137,
6834,
8758,
1467,
6208,
1218,
2760,
2892,
4318,
3812,
4068,
6628,
7928,
10748
] | Test |
1,739 | 1 | Structurae:structurae structurae online database containing pictures information structural civil engineering works associated engineers architects builders entries contributed volunteers saved mysql database structurae founded 1998 nicolas janberg studied civil engineering princeton university march 2012 structurae acquired subsidiary john wiley sons inc. janberg joining company structurae editor-in-chief time web site received one million pageviews per month available english french german 2015 janberg bought site back operate freelancer | [
7022,
2901,
5398
] | Validation |
1,740 | 7 | Apigee:apigee apigee corp. silicon valley based company providing api management predictive analytics software founded 2004 sonoa systems rebranded apigee 2010 apigee acquired google deal worth 625 million 2016 sonoa systems founded 2004 santa clara california raj singh ravi chandra early 2006 sonoa brought chet kapoor ceo initially company developed router-like appliance xml soa governance time branched application platforms cloud computing 2009 sonoa released public beta api management tool called apigee providing app developers free cloud-based platform providing security analytics apis 2010 sonoa rebranded apigee api management platform became core business premium features added shortly apigee quickly expanded corporate customer base including likes netflix walgreens 2012 apigee acquired mobile api company usergrid 2014 acquired predictive analytics company insightsone apigee raised 87 million public ipo nasdaq 2015 apigee became founding member along smartbear ibm openapi initiative sponsorship linux foundation google announced would purchase apigee 625 million deal completed november 2016 apigee revenues generated subscriptions api management platform professional services subscribing customers apigee offers free tiers products premium features reserved subscribers apigee also sells additional functionality subscribing customers including ability monetize apis pci-dss compliance multi-region deployment amazon web services traffic isolation | [
4194,
11588,
4011,
7248,
8566,
3323
] | Test |
1,741 | 2 | Shutdown_(computing):shutdown computing shut power computer remove power computer main components controlled way computer shut main components cpus ram modules hard disk drives powered although internal components internal clock may retain power shutdown feature command available microsoft windows reactos hp mpe/ix number unix unix-like operating systems apple macos microsoft windows reactos pc server shut selecting shutdown item start menu desktop options include shutting system powering automatically restarting system shutting putting system stand-by mode also codice_1 command executed within command shell window codice_2 command-line shutdown application located windir \system32\shutdown.exe shut user computer another computer user network different parameters allow different functions one parameter used time command like operating systems windows option prohibit selected users shutting computer home pc every user may shutdown option computers large networks active directory administrator revoke access rights selected users shut windows computer nowadays many software utilities automate task shutting windows computer enabling automatic computer control windows shutdown website lists various software utilities automate task shutting windows program shut system calling codice_3 codice_4 function apple macos computer shut choosing shut down… apple menu pressing power key bring power management dialog box selecting button shut administrator may also use unix codice_1 command well also shut pressing alt command eject optical disc optical drive prompt user anything unix linux codice_1 command used turn reboot computer superuser shut system one commonly issued form command codice_7 shut system immediately another one codice_8 reboot another form allows user specify exact time delay shutdown codice_9 turn computer 8:00 pm codice_10 automatically reboot machine within 60 seconds one minute issuing command | [
2432,
3970,
515,
8834,
9733,
9735,
2568,
3976,
5384,
6281,
10631,
6797,
4750,
3856,
8080,
6674,
5397,
2198,
4248,
8729,
9978,
6812,
7325,
929,
4001,
4771,
3109,
7847,
808,
3496,
4398,
7088,
10033,
11568,
9780,
823,
1336,
1978,
700,
5437,
... | Test |
1,742 | 2 | NewIcons:newicons newicons third-party extension icon handling system amigaos 2 newer newicons first invented developed italian programmer nicola salmoria subsequent development done eric sauvageau phil vedovatti need newicons arose poor overall quality icons amigaos versions prior 3.0 amigaos gui revolutionary first launched early 1980s operating systems mac os microsoft windows quickly caught started become professional-looking standard amigaos workbench icons plain uninteresting limited four colours standard size viewed straight-on perspective left looking two-dimensional aim newicons solve faults unlike standard workbench icon includes palette index information thus mercy user chosen workbench palette newicons icons natively drawn 32 colours 5-bit colour hold actual rgb colour information icon file memory-resident program called commodity amiga terminology tries best adapt icon colours current workbench screen palette 256 colour icons supported newicons system newicons also establishes standard icon size 36×40 pixels similar mac os windows design guidelines recommend icons drawn diagonal perspective thus creating illusion three dimensions guidelines also strongly encourage use workbench image highlights selected image changes actual shape clicked instead simply inverting colours becoming darker shade example computer terminal could screen powered pen could write letters paper robot symbolising computer game could move around newicons relatively large file size compared conventional amiga icons magicwb icons newicons stored 8-bit data even colours used image data encoded ascii application metadata consuming even space icon newicons also includes deficons package ready-made icons aims provide default icon image files associated icons provided codice_1 files amigaos deficons uses scheme actually examines file contents instead simply looking filename extension determine file type approach slower file extension system used microsoft windows ultimately accurate png image file .jpg extension appear png-specific icon amigaos 3.5 introduced glowicons icon format supported newicons without need third-party applications glowicons format based newicons file format native icon format used amigaos 3.5 3.9 4.0 matt chaput major difference newicons image data stored newicons uses inefficient ascii encoding embedded application tool type metadata glowicons system developers extended internal icon definition without need resort storing information tool types standard icon size 46×46 pixels maximum 256 8-bit colors two image states example open closed drawers second image state uses glow effect indicate icon pressed starting final update amigaos 4.0 supports 32 bit icon images | [
6797,
5264,
2193,
7188,
9236,
3233,
9249,
8618,
6062,
432,
8369,
8115,
11076,
10570,
5709,
4564,
11370,
5743,
11123
] | Test |
1,743 | 5 | Fibre_Channel_over_IP:fibre channel ip fibre channel ip fcip fc/ip also known fibre channel tunneling storage tunneling internet protocol ip created internet engineering task force ietf storage technology fcip entity functions encapsulate fibre channel frames forward ip network fcip entities peers communicate using tcp/ip fcip technology overcomes distance limitations native fibre channel enabling geographically distributed storage area networks connected using existing ip infrastructure keeping fabric services intact fibre channel fabric devices remain unaware presence ip network competing technology fcip known ifcp uses routing instead tunneling enable connectivity fibre channel networks ip | [
5472,
5322,
6993,
7863,
216,
4638
] | Test |
1,744 | 3 | Macintosh_TV:macintosh tv macintosh tv personal computer integrated television capabilities released apple computer 1993 apple first attempt computer-television integration shares external appearance macintosh lc 500 series black macintosh tv essentially performa 520 switch built-in 14 sony trinitron crt computer display cable-ready television incapable showing television desktop window although capture still frames pict files comes small credit card-sized remote control also compatible sony televisions first macintosh made black comes matching black keyboard mouse later apple would issue custom black performa 5420 markets outside united states many features mac tv apple similar tv tuner card popular option later lc performa series select models power macintosh g3 beige computers 10,000 made model short time market | [
7697,
4114,
6165,
11289,
7706,
8222,
1057,
6183,
1576,
4139,
7211,
8253,
1090,
4180,
10838,
10840,
9312,
8806,
6258,
10357,
4220,
10365,
10878,
6783,
7299,
4741,
8842,
6283,
7824,
147,
7830,
6807,
4258,
7842,
7844,
7869,
8893,
8896,
4807,
... | Test |
1,745 | 4 | Bromium:bromium bromium venture capital–backed startup based cupertino california works virtualization technology bromium focuses virtual hardware claiming reduce eliminate endpoint computer threats like viruses malware adware bromium founded 2010 gaurav banga later joined former citrix xensource executives simon crosby ian pratt 2013 company raised total 75.7 million three rounds venture funding rounds raised 9.2 million 26.5 million 40 million respectively venture firms andreessen horowitz ignition partners lightspeed venture partners highland capital partners intel capital meritech capital partners bromium shipped first product vsentry 1.0 sept 2012. notable early clients include nyse adp february 2014 company published information bypassing several key defenses microsoft enhanced mitigation experience toolkit emet taking advantage inherent weakness reliance known vectors return-oriented programming rop attack methods feb 2017 hp bromium announced partnership build ship laptop micro-virtualization technology built starting hp elitebook x360 bromium technology called micro-virtualization designed protect computers malicious code execution initiated end user including rogue web links email attachments files virtualization technology relies hardware isolation protection implemented late-load hypervisor called microvisor based open source xen hypervisor microvisor similar concept traditional hypervisor ’ installed server desktop ’ operating system traditional vms full versions operating system complete full suites applications microvisor uses hardware virtualization present desktop processors create micro-vms specialized virtual machines tailored support specific task new application opened link clicked email attachment downloaded microvisor creates micro-vm tailored specific task access resources required execute placing vulnerable tasks inside micro-vms tied hardware way malware work sandbox layer attack host environment i.e operating system micro-vms executed process gets micro-vm vm dissolved process stops taking malware microvisor enforces principle least privilege isolating applications operating system functions within micro-vm interacting micro-vm protected desktop system network protected desktop embedded architecture specifically relies x86 virtualization guarantee task-specific mandatory access control mac policies executed whenever micro-vm attempts access key windows services since micro-vms hardware-isolated protected os trusted untrusted tasks coexist single system mutual isolation microvisor ’ attack surface extremely narrow making exploits prohibitively expensive execute report nss labs details penetration testing bromium architecture achieved perfect score defeating malware expert human attempts penetration vsentry 1.0 available windows 7. vsentry requires intel processor vt-x ept vsentry 2.0 became available june 2013 offers protection users exchanging documents bromium live attack visualization analysis lava released 2014 provided ability collect attack data detected within micro-vm analysis supported structured threat information expression stix emerging xml standard threat information time vsentry 3.0 became available dec 2015 included support behavioral analysis executable code | [
2213,
5799,
877,
1103,
7983,
7515,
10835,
4695,
7739,
5371,
479
] | Test |
1,746 | 4 | Robert_C._Seacord:robert c. seacord robert c. seacord born june 5 1963 american computer security specialist writer author books computer security legacy system modernization component-based software engineering seacord earned bachelor degree computer science rensselaer polytechnic institute december 1983 also completed graduate-level courses carnegie-mellon university software design creation maintenance user interfaces software project management formal methods human factors operating systems entrepreneurship seacord began programming professionally ibm 1984 working processor development communications operating system software software engineering led secure coding initiative cert division ’ software engineering institute sei pittsburgh pennsylvania 1991 also worked x consortium cambridge massachusetts developed maintained code common desktop environment x window system returned sei 1996 working component-based software engineering seacord joined ncc group 2015 currently technical director seacord adjunct professor carnegie mellon school computer science information networking institute also part-time faculty member university pittsburgh.. seacord advisory board linux foundation technical expert iso/iec jtc1/sc22/wg14 international standardization working group c programming language | [
2464,
4320,
2558,
4011,
3323,
2045,
2878
] | Test |
1,747 | 8 | NanoHTTPD:nanohttpd nanohttpd open-source small-footprint web server suitable embedding applications written java programming language source code consists single .java file used library component developing software measurement science database applications standalone ad-hoc style http daemon serving files nanohttpd available 2 flavors one utilizing up-to-date java features one strictly conforming java 1.1 due independence java features beyond jdk 1.1 nanohttpd suited embedded application development nanohttpd used build example android software original version released 2003 included simple http 1.0 features software since extended support advanced techniques http 'keep-alive connections full rest style http methods html5 video streaming http uploading multipart extensions current version includes websocket experimental https support | [
225,
9320,
9834,
5612,
5677,
9580,
2287,
7983,
11189,
4797
] | None |
1,748 | 5 | Media_Delivery_Index:media delivery index media delivery index mdi set measures used monitor quality delivered video stream well show system margin iptv systems providing accurate measurement jitter delay network level internet protocol ip main causes quality loss identifying quantizing problems kind networks key maintaining high quality video delivery providing indications warn system operators enough advance notice allow corrective action media delivery index typically displayed two numbers separated colon delay factor df media loss rate mlr media delivery index mdi may able identify problems caused packets delayed network packets arrive bursts interpacket delays shorter transmitted others delayed arrive greater delay packets transmitted source see figure time difference packet actually arrives expected arrival time defined packet jitter time distortion receiver displaying video nominal rate must accommodate varying input stream arrival times buffering data arriving early assuring enough already stored data face possible delays received data buffer filled displaying similarly network infrastructure switches routers … uses buffers node avoid packet loss buffers must sized appropriately handle network congestion packet delays caused multiple facts among way traffic routed infrastructure possible differences link speeds infrastructure moreover methods delivering quality service qos using packet metering algorithms may intentionally hold back packets meet quality specifications transmission effects facts amount packets received specific point network seen next graphics packets may lost due buffer overflows environmental electrical noise creates corrupted packets even small packet loss rates result poor video display packet delay variation packet loss shown key characteristics determining whether network transport good quality video features represented delay factor df media loss rate mlr combined produce media delivery index mdi displayed different components media delivery index mdi explained section delay factor temporal value given milliseconds indicates much time required drain virtual buffer concrete network node specific time words time value indicating many milliseconds ’ worth data buffers must able contain order eliminate time distortions jitter computed packets arrive node displayed/recorded regular intervals typically one second calculated follows 1 every packet arrival difference bytes received bytes drained calculated determines mdi virtual buffer depth 2 time interval difference minimum maximum values δ taken divided media rate maximum acceptable df 9–50 ms media loss rate number media packets lost certain time interval typically one second computed subtracting number media packets received interval number media packets expected interval scaling value chosen time period typically one second maximum acceptable channel zapping mlr 0 maximum acceptable average mlr must said maximum acceptable mlr depends implementation channel zapping channel generally viewed brief period one would bothered packet loss occurred case maximum acceptable mlr 0 stated greater value would mean loss one packets small viewing timeframe zap time generally media delivery index mdi used install modify evaluate video network following next steps given results measures must taken provide solutions problems found network redefining system specifications modifying network components order meet expected quality requirements number users etc parameters may also desired order troubleshoot concerns identified mdi aid system configuration monitoring | [
5472,
1474,
1541
] | None |
1,749 | 0 | Solomon_Marcus:solomon marcus solomon marcus 1 march 1925 – 17 march 2016 romanian mathematician member mathematical section romanian academy full member since 2001 emeritus professor university bucharest faculty mathematics main research fields mathematical analysis mathematical computational linguistics computer science also published numerous papers various cultural topics poetics linguistics semiotics philosophy history science education born bacău romania sima alter marcus jewish family tailors early age live dictatorships war infringements free speech free thinking well anti-semitism age 16 17 started tutoring younger pupils order help family financially graduated ferdinand high school 1944 completed studies university bucharest faculty science department mathematics 1949 continued tutoring throughout college later recounted interview endure hunger years till age 20 wore hand-me-downs older brothers obtained phd mathematics 1956 thesis monotonic functions two variables written direction miron nicolescu appointed lecturer 1955 associate professor 1964 became professor 1966 emeritus 1991 marcus contributed following areas 1 mathematical analysis set theory measure integration theory topology 2 theoretical computer science 3 linguistics 4 poetics theory literature 5 semiotics 6 cultural anthropology 7 history philosophy science 8 education marcus published 50 books romanian english french german italian spanish russian greek hungarian czech serbo-croatian 400 research articles specialized journals almost european countries united states canada south america japan india new zealand among others cited thousand authors including mathematicians computer scientists linguists literary researchers semioticians anthropologists philosophers recognised one initiators mathematical linguistics mathematical poetics member editorial board tens international scientific journals covering domains interest marcus featured people ideas theoretical computer science human face computing collection papers english followed interviews brief autobiography published 2007 words languages everywhere book meetings solomon marcus spandugino publishing house bucharest romania 2010 1500 pages edited lavinia spandonide gheorghe păun marcus ’ 85th birthday includes recollections several hundred people large variety scientific cultural fields 25 countries also contains longer autobiography died cardiac infections bucharest short stay elias hospital bucharest | [
1890,
1783
] | Test |
1,750 | 6 | Copy_(command):copy command computing codice_1 command various operating systems command copies computer files one directory another generally command copies files one location another used make copies existing files also used combine concatenate multiple files target files destination defaults current working directory multiple source files indicated destination must directory error result command copy text mode binary mode text mode codice_1 stop reaches eof character binary mode files concatenated entirety ignoring eof characters files may copied devices example codice_3 outputs file screen console devices may copied destination file example codice_4 takes text typed console puts file stopping eof ctrl+z typed command available dec rt-11 rsx-11 os/8 intel isis-ii irmx 86 dec tops-10 tops-20 openvms metacomco tripos microware os-9 dos dr flexos ibm/toshiba 4690 os hp mpe/ix ibm os/2 microsoft windows reactos symbos dexos ms-dos available versions 1 later also available open-source ms-dos emulator dosbox dr dos 6.0 also includes implementation command equivalent unix command codice_5 cp/m command codice_6 advanced copy command called codice_7 command analogous stratus openvos codice_8 command copy letter.txt destination files may copied device files e.g codice_9 sends file printer lpt1 codice_10 would output stdout like codice_11 command note codice_12 concatenate files output codice_13 like codice_14 command also copy files different disk drives two command-line switches modify behaviour concatenating files | [
2568,
2573,
6674,
532,
8729,
9780,
10818,
2637,
4174,
5220,
8301,
1647,
9839,
4727,
8831,
9345,
8834,
6281,
6797,
2198,
4248,
4771,
7847,
8876,
178,
9907,
6329,
7356,
10428,
1741,
9946,
1253,
4850,
7411,
10489,
3323,
6396,
1278,
1790,
793... | None |
1,751 | 1 | Event_store:event store event store type database optimized storage events conceptually event store events dossier policy stored idea behind dossier policy derived events events corresponding data real facts stored database instantiation objects derived events code instantiates objects memory event store database means objects instantiated stored database instead objects instantiated 'on fly memory code based events usage objects e.g shown user interface instantiated objects removed memory example event store concept database applied insurance policies pension dossiers policies dossiers instantiation object make dossier policy person partner employments etc derived instantiated memory based real world events crucial part event store database event double timeline enables event stores correct errors events entered event store database another crucial part event store database events stored allowed changed stored also erroneous events changed anymore way change better correct events instantiate new event new values using double timeline correcting event would new values original event event data corrected event different transaction date mechanism ensures reproducibility moment time even time period correction taken place also allows reproduce situations based erroneous events required one advantage event store concept handling effects back dated events events take effect previous events may even invalidate much easier regular databases handling backdated events correct previous erroneous events painful often results rolling back previous erroneous transactions objects rolling new correct transactions objects event store new event corresponding facts stored code redetermine transactions objects based new facts memory event store simplify code rolling back erroneous situations rolling new correct situations needed anymore disadvantage may code needs re-instantiate objects memory based events time service call received specific dossier policy | [
2512,
2901
] | Test |
1,752 | 3 | Darwin_Core_Archive:darwin core archive darwin core archive dwc-a biodiversity informatics data standard makes use darwin core terms produce single self-contained dataset species occurrence checklist sampling event material sample data essentially set text csv files simple descriptor meta.xml inform others files organized format defined darwin core text guidelines preferred format publishing data gbif network darwin core standard used mobilize vast majority specimen occurrence observational records within gbif network darwin core standard originally conceived facilitate discovery retrieval integration information modern biological specimens spatio-temporal occurrence supporting evidence housed collections physical digital darwin core today broader scope aims provide stable standard reference sharing information biological diversity glossary terms darwin core provides stable semantic definitions goal maximally reusable variety contexts means darwin core may still used way historically used may also serve basis building complex exchange formats still ensuring interoperability common set terms central idea archive data files logically arranged star-like manner one core data file surrounded number ’ extensions ’ extension record ‘ extension file row ’ points record core file way zero many extension records exist single core record space-efficient method data transfer alternative including data within single table could otherwise contain many empty cells details recommended extensions found respective subsections extensively documented gbif registry catalogue available extensions sharing entire datasets instead using pageable web services like digir tapir allows much simpler efficient data transfer example retrieving 260,000 records via tapir takes nine hours issuing 1,300 http requests transfer 500 mb xml-formatted data exact dataset encoded dwc-a zipped becomes 3 mb file therefore gbif highly recommends compressing archive using zip gzip generating dwc-a archive requires stable identifiers core records extensions kind shared data therefore necessary sort local record identifiers good practice maintain – original data – identifiers stable time reused record deleted please provide globally unique identifiers instead local ones completed darwin core archive contain file containing metadata describing whole dataset ecological metadata language eml common format simple dublin core files used | [
9669
] | Test |
1,753 | 3 | Puyo_Puyo_(video_game):puyo puyo video game game released tokuma shoten day msx2 release name part famimaga disk series family computer disk system year msx2 fds versions sega released arcade version heavily expanded previous versions including one-player story mode two-player competitive mode main game puyo puyo played least one opponent computer human game three modes single puyo puyo double puyo puyo endless puyo puyo single mode player takes role arle nadja 16-year-old female spellcaster pleasure foiling dark prince plans dark prince wishes take world arle stands way arle must first however battle way 12 opponents facing dark prince exception rulue sent dark prince mostly want pull shenanigans rulue fell love dark prince arle beaten dark prince world saved return home main puyo games story mode consists playing puyo matches fixed sequence characters one three courses double mode two players play exactly fashion out-chaining one another player tries fill opponent grid since rules sending many garbage blocks made games short-lived matter many chains sent compile added rule offsetting puyo puyo 2 onwards lets players counter opponents attacks chains sending garbage blocks back result overflow endless mode player must continually match puyos get highest score mission mode player must complete 52 missions requiring puyos field eliminated using limited pieces english-translated version arcade original created released internationally replaces original voice work changes many characters names removes wings harpies called dark elves english version sega re-released puyo puyo mega drive december 18 1992 game gear march 19 1993 japan game gear port puyo puyo contains english version named puzlow kids version appears whenever game cartridge used north american european system pc-9801 port released compile pc-9801 march 19 1993 day game gear port released tokuma shoten re-released version puyo puyo family computer july 23 1993 added 2-player competitive mode banpresto released version super famicom title december 10 1993 port game boy developed winkysoft published banpresto released july 31 1994 original name nec released version puyo puyo pc engine cd-rom² april 22 1994 titled cri middleware released version puyo puyo fm towns december 1994 game ported amiga request amiga power magazine featured cover disk name super foul egg ported risc os acorn owain cole featured acorn user cover disk finally ported java late 1995 ported apple iigs bret victor branded puyo pop internationally first game saw release outside japan 1993 dr. robotnik mean bean machine north america europe mega drive/genesis well game gear master system europe brazil two years later released kirby avalanche kirby ghost trap europe super nes north america europe respectively mega drive version bestseller japan four months mega drive version re-released wii virtual console japan december 2 2006 arcade version released april 12 2011 two gameboy versions released first puyo puyo 1994 sequel pocket puyo puyo tsuu 1996 arcade vc release features online play | [
321,
8355,
9006,
3130,
126
] | Test |
1,754 | 5 | Mumble_(software):mumble software mumble voice ip voip application primarily designed use gamers similar programs teamspeak mumble uses client–server architecture allows users talk via server simple administrative interface features high sound quality low latency communication encrypted ensure user privacy mumble free open-source software cross-platform released terms new bsd license mumble server called murmur root channel hierarchical tree channels beneath users temporarily connect channels create larger virtual channels useful larger events small group users may chatting channel linked common channel users hear announcements also matches team-based first-person shooter fps games channel associated set groups access control lists control user permissions system supports many usage scenarios cost added configuration complexity mumble uses low-latency audio codec opus version 1.2.4 codec succeeds previous defaults speex celt rest mumble design allow low-latency communication meaning shorter delay something said one end heard mumble also incorporates echo cancellation reduce echo using speakers poor quality sound hardware mumble connects server via tls control channel audio travelling via udp encrypted aes ocb mode 1.2.9 mumble prefers ecdhe aes-gcm cipher suites possible providing perfect forward secrecy password authentication users supported since 1.2.0 typically eschewed favor strong authentication form public key certificates integrated overlay use games overlay shows talking linked channel version 1.0 users could upload avatars represent overlay creating personalized experience version 1.2 overlay works direct3d 9/10 opengl games windows opengl support linux mac os x. directx 11 game support later added certain games mumble modifies audio position players voices according relative position game includes giving sense direction also distance realise mumble sends player in-game position players game every audio packet mumble gather information needed two ways either reads needed information directly memory game games provide via so-called link plugin interface link plugin provides games way expose information needed positional audio including small piece source code provided mumble project several high-profile games implemented functionality including many valve source engine based games team fortress 2 guild wars 2 mobile apps available mumble mumblefy ios plumble android mumble fits existing technological social structures server fully remote controllable ice user channels well virtual server instances manipulated project provides number sample scripts illustrating abilities interface well prefabricated scripts offering features like authenticating users using existing phpbb simple machines forum database murmur server uses port 64738 tcp udp default alternative minimalist implementation mumble-server murmur called umurmur intended installation embedded devices limited resources example residential gateways running openwrt like many voip clients mumble servers rented hosted locally hosting mumble server locally requires downloading murmur included option mumble installer launching configuring server achieved via editing configuration file configuration file holds information server name user authentication audio quality restrictions port administrating server within requires user given administrator rights also done logging superuser account administrators within server add edit rooms manage users view server information | [
4611,
2825,
6797,
11413,
1814,
10924,
7983,
8758,
7095,
823,
9279,
10433,
5959,
5322,
11086,
6993,
10451,
2901,
9048,
5612
] | None |
1,755 | 7 | Oracle_Exalogic:oracle exalogic exalogic computer appliance made oracle corporation commercially available since 2010 cluster x86-64-servers running oracle linux solaris preinstalled full trade mark oracle exalogic elastic cloud derived si prefix exa- -logic probably weblogic positioned vendor preconfigured clustered application server use cloud computing elastic computing abilities oracle corporation announced exalogic oracle openworld conference san francisco september 2010 company presented continuation oracle-engineered systems product-line started 2008 exadata preconfigured database cluster exalogic factory assembled 19-inch rack 42 rack units completed servers network equipment 4 configurations different prices depending fills rack weight full rack 1 ton 2000 lbs quarter rack weighs half much hardware component x2-2 appliance consisted group 1-unit intel xeon servers equipped two six-core 2.93 ghz processors two solid-state drives operating system swap space common storage area network set infiniband ethernet switches full rack contains 30 server nodes half rack 16 quarter rack 8 eighth rack 4 server node installed 96 gb ram four 10 gigabit ethernet interfaces double infiniband port storage area network configurations similar 40 tb raw space vendor specifications advertising content usually indicate total parameters 360 processor kernels 2.9 tb ram full rack x3-2 model announced 2012 newer processors memory since late 2013 x4-2 model commercially available yet processor cores four times large capacity solid-state drives two 64-bit operating systems run server nodes appliance oracle linux version 5.5 solaris 11 servers installed cluster configuration oracle weblogic server distributed memory cache oracle coherence run java applications machine choice hotspot jrockit management appliance available oracle enterprise manager toolset also pre-installed appliance transaction monitor tuxedo optionally supplied exalogic deployed university melbourne food drug administration fda united states amway hyundai motor group bank chile haier deutsche post dhl public authority minors affairs pama kuwait mark benioff founder salesforce.com presumes appliance principally lacks scalability end-user compared infrastructure supplied service notes exalogic approach actually rollback obsolete mainframe computer concept also commentators expressed concerns appropriateness placing word elastic name despite ability load balance obvious computing limits box limits transcended like true elastic environment criticism applies solutions designed private cloud computing particular applies emc corporation hewlett-packard products however computing environment collection servers since many exalogic machines combined limited single box capacity may considered merely building block | [
1539,
5384,
9867,
8353,
8994,
8871,
1707,
5677,
9010,
8627,
9012,
10553,
1594,
9665,
6338,
6341,
597,
6107,
2269,
1250,
4194,
10340,
10090,
1259,
5356,
7022,
8434,
1399
] | Validation |
1,756 | 9 | Java_Business_Integration:java business integration java business integration jbi specification developed java community process jcp approach implementing service-oriented architecture soa jcp reference jsr 208 jbi 1.0 jsr 312 jbi 2.0 jsr 312 removed jcp balloting process 17 dec 2010 submitters without accepted jbi built web services model provides pluggable architecture container hosts service producer consumer components services connect container via binding components bc hosted inside container part service engine se services model used web services description language 2.0 central message delivery mechanism normalized message router nmr delivers normalized messages via one four message exchange patterns meps taken wsdl 2.0 handle functionality deals installation deployment monitoring lifecycle concerns amongst bcs ses java management extensions jmx used jbi defines standardized packaging bcs ses allowing components portable jbi implementation without modification jbi defines standard packaging composite applications applications composed service consumers providers individual service units deployable components groups service units gathered together service assembly service assembly includes metadata wiring service units together associating service providers consumers well wiring service units external services provides simple mechanism performing composite application assembly using services following open-source software jbi based esb implementations available following esbs certified jbi/jsr 208 tck open esb petals esb addition project glassfish open-source java ee application server comes jbi runtime open esb project java ee sdk also includes jbi runtime bpel orchestration engine oracle claims fusion middleware comes jbi implementation tibco activematrix service grid provides service container framework based jsr 208 sca specifications service component architecture allowing service containers java java ee .net bpel added needed composite applications common foundation open jbi components project java.net incubator project started foster community-based development jbi components conform java business integration specification jsr 208 | [
4960,
8929,
2501,
8070,
8425,
4107,
6860,
1041,
6067
] | Validation |
1,757 | 8 | In-kernel_web_server:in-kernel web server in-kernel web server unlimited http server runs kernel space equivalent also called accelerator | [
225,
9580,
823,
8080,
8976,
4439,
1304
] | Test |
1,758 | 4 | Infysec:infysec infysec company provides cybersecurity services medium-sized enterprises governments across world company located chennai india focuses security technology services security consulting security training research development company founded 2010 t. vinod senthil ethical hacker along karthick vigneshwar aadhavan rajadurai gathered team security professionals started company objective providing cybersecurity services training november 2009 senthil first person chennai demonstrate wardriving assisted cyber crime department ndtv hindu news july 2013 company conducted event dubbed e-hack 24-hour hackathon company presented assocham two consecutive years cybersecurity 2016 company awarded notable startup startup story company completed 200 security projects various countries including australia maldives dubai well various governments conducted 1000+ workshops raise awareness issue cybersecurity products include capture flag cybersecurity enthusiasts test skills field cybersecurity ad-free android app called cybersec tabloid cybersecurity news updates free android app called androsentry helps monitor android devices includes theft tracker call blocker virus scanner app locker | [
7222,
2558
] | None |
1,759 | 7 | Buildium:buildium buildium american property management software company founded 2004 headquartered boston massachusetts providing cloud-based software service real estate software property management software allows real estate professionals manage property portfolios including leasing accounting operations buildium co-founded 2004 michael monteiro dimitris georgakopoulos company bootstrapped first eight years 2012 2014 buildium raised two rounds funding totaling 20 million k1 investment management june 2016 company raised 65m sumeru equity partners february 2015 buildium acquired property management provider online marketing services property managers april 2017 buildium named leader gartner frontrunners quadrant property management software | [
4194,
467
] | None |
1,760 | 9 | IBM_Intelligent_Printer_Data_Stream:ibm intelligent printer data stream intelligent printer data stream ipds infoprint solution company systems application architecture host-to-printer data stream advanced function presentation subsystems provides attachment-independent interface controlling managing points addressable apa printers allows presentation pages containing architecturally unlimited mixture different data types including text image graphics bar code object container used variety infoprint oem print servers drive points addressable apa page printers generally printers medium high end print speed volume spectrum ipds architecture allows spooled data print job management flow bidirectionally print server print driver printer controller examples print job management controls examples spooled data ipds data streams purely used carry print information data network transport layer typically tcp/ip sna supporting hardware lans channels network controllers ipds carries data instructions print server printer structured fields printer controller processes ipds commands returns acknowledgment back print server similar ppds ipds uses binary encoded commands parameters ipds compatible ppds | [
10280,
4546,
8763,
9683
] | Test |
1,761 | 2 | Linux_adoption:linux adoption linux adoption adoption linux computer operating systems os households nonprofit organizations businesses governments many factors resulted expanded use linux systems traditional desktop users well operators server systems including desire minimize software costs increase network security support open-source philosophical principles recent years several governments various levels enacted policies shifting state-owned computers linux proprietary software regimes august 2010 jeffrey hammond principal analyst forrester research declared linux crossed chasm mainstream adoption statement attested large number enterprises transitioned linux late-2000s recession company survey completed third quarter 2009 48 surveyed companies reported using open-source operating system linux foundation regularly releases publications regarding linux kernel linux os distributions related themes one publication linux adoption trends survey enterprise end users freely available upon registration traditionally term linux adoption refers adoption linux os made desktop computers original intended use adoption servers essentially form os adoption form personal computers still low relatively adoption android operating system high term linux adoption often overlooks operating system uses chrome os also use linux kernel almost nothing else common even name – linux – usually applied android popular variant – fact popular operating system world outside traditional web services linux powers many biggest internet properties e.g. google amazon facebook ebay twitter yahoo linux used desktop computers servers supercomputers well wide range devices linux desktop distributions usually distributed retail sale sales numbers indicate number users one downloaded file may used create many cds cd may used install operating system multiple computers hand file might used test installation erased soon due factors estimates current linux desktop often rely webpage hits computers identifying running linux use statistics criticized unreliable underestimating linux use using webpage hits measure 2008 linux accounted 1 desktop market share microsoft windows operating systems held 90 might linux seen time direct replacement windows w3counter estimated linux web browser market share 4.63 android versions 6 5 4 combined based linux kernel estimated 33.77 linux counter uses alternate method estimating adoption asking users register using mathematical model estimate total number desktop users november 2014 method estimated 73 million linux users september 2014 pornhub released usage statistics website reported 1.7 linux users unity game engine gathers user statistics showed march 2016 0.4 linux users similarly steam client tracks usage reported may 2015 around 1 linux users april 2009 aaron seigo kde indicated web-page counter methods produce linux adoption numbers far low given system extensive penetration non-north american markets especially china stated north american-based web-measurement methods produce high windows numbers ignore widespread use linux parts world estimating true worldwide desktop adoption accounting windows-distorted environment usa canada indicated least 8 world desktops run linux distributions possibly high 10–12 numbers rising quickly commentators echoed belief noting competitors expending lot effort discredit linux incongruent tiny market share may 2009 preston gralla contributing editor computerworld.com reacting net applications web hit numbers showing linux use 1 said linux never become important desktop notebook operating system reasoned upsurge linux desktop use recently seen due linux netbooks trend saw already diminishing would eroded windows 7 became available indeed linux netbooks fall wayside though whether solely responsible upsurge linux usage open question concluded desktop operating system linux n't important enough think servers top-notch likely wo n't use desktop – even though finally manage crack 1 barrier 18 years 2009 microsoft then-ceo steve ballmer indicated linux greater desktop market share mac stating recent years linux certainly increased share somewhat third dell netbook sales 2009 linux installed caitlyn martin researching retail market numbers summer 2010 also concluded traditional numbers mentioned linux desktop adoption far low reasons change operating systems linux include better system stability better malware protection low cost distributions come complete application software hardware drivers simplified updates installed software free software licensing availability application repositories access source code linux desktop distributions also offer multiple desktop workspaces greater customization free unlimited support forums operating system n't slow time environmental reasons also cited linux operating systems usually come boxes retail packaging downloaded via internet lower system specifications also mean older hardware kept use instead recycled discarded linux distributions also get security vulnerabilities patched much quickly non-free operating systems improvements linux occurring faster rate windows report economist december 2007 said investments made improve desktop linux usability since 2007 report indian bulk computer purchaser electronics corporation tamil nadu elcot started recommending linux june 2008 following testing stated elcot using suse linux ubuntu linux operating systems desktop laptop computers numbering 2,000 past two years found far superior compared operating systems notably microsoft operating system many developing nations china due widespread software piracy microsoft windows easily obtained free linux distributions gaining high level adoption hence countries essentially cost barrier obtaining proprietary operating systems users adopting linux based merit rather price january 2001 microsoft then-ceo bill gates explained attraction adopting linux internal memo released comes vs microsoft case said greatest barrier linux desktop adoption probably desktop pcs come factory a.y siu asserted 2006 people use windows simply pcs come windows pre-installed n't choose linux much lower market penetration cases users install task beyond capabilities many pc users users ’ even use windows restore cds let alone install windows scratch would install unfamiliar operating system computers techrepublic writer jack wallen expands barrier saying august 2008 linus torvalds stated june 2012 interaction students aalto university although linux originally conceived desktop system market flourished suggested key reason keeps linux getting substantial presence desktop market average desktop user want install operating system getting manufacturers sell computers linux pre-installed would missing piece fulfill vision linux desktop market added chromebooks shipping linux-based chrome os could provide key turning point transition much like android allowed linux spread mobile space september 2012 gnome developer michael meeks also indicated main reason lack adoption linux desktops lack manufacturers shipping computers pre-installed supporting siu arguments six years earlier meeks also indicated users would n't embrace desktop linux wider range applications developers wo n't create wider range applications users classic catch-22 situation opensuse survey conducted 2007 69.5 respondents said dual booted microsoft windows operating system addition linux operating system early 2007 bill whyman analyst precursor advisors noted still n't compelling alternative microsoft infrastructure desktop application support quality peripheral support end user support one time seen biggest obstacles desktop linux adoption according 2006 survey linux foundation factors seen major obstacle 56 49 33 respondents respectively time november 2006 desktop linux client survey identified foremost barrier deploying linux desktops users accustomed windows applications ported linux ca n't live without included microsoft office adobe photoshop autodesk autocad microsoft project visio intuit quickbooks creates chicken egg situation developers make programs windows due market share consumers use windows due availability said programs desktoplinux.com survey conducted 2007 72 respondents said used ways run windows applications linux 51 respondents 2006 linux foundation survey believed cross-distribution linux desktop standards top priority linux desktop community highlighting fact fragmented linux market preventing application vendors developing distributing supporting operating system may 2008 gartner predicted version control incompatibilities continue plague open-source oss associated middleware 2013 timeframe 2008 design linux applications porting windows apple applications progressed point difficult find application equivalent linux providing adequate better capabilities example application progress seen comparing main productivity suite linux openoffice.org microsoft office release openoffice.org 3.0 october 2008 ars technica assessed two past availability quality open source device drivers issues linux desktops particular areas lacking drivers included printers well wireless audio cards example early 2007 dell sell specific hardware software ubuntu 7.04 computers including printers projectors bluetooth keyboards mice tv tuners remote controls desktop modems blu-ray disc drives due incompatibilities time well legal issues 2008 linux hardware support driver issues adequately addressed september 2008 jack wallen assessment critics stated compared windows linux lacking end-user support linux traditionally seen requiring much technical expertise dell website described open source software requiring intermediate advanced knowledge use september 2007 founder ubuntu project mark shuttleworth commented would reasonable say ready mass market october 2004 chief technical officer adeptiva linux stephan february noted time linux technical software product people outside technical community able support consumers windows users able rely friends family help linux users generally use discussion boards uncomfortable consumers 2005 dominic humphries summarized difference user tech support recently critics found linux user support model using community-based forum support greatly improved 2008 jack wallen stated addressing question user support manu cornet said linux credibility also attack times ron miller linuxplanet points continuing debate total cost ownership linux gartner warning 2005 costs migration may exceed cost benefits linux gartner reiterated warning 2008 predicting 2013 majority linux deployments real software total cost ownership tco advantage operating systems however comes v. microsoft lawsuit plaintiff exhibit 2817 revealed microsoft successfully lobbied gartner changing tco model favour microsoft 1998 organizations moved linux disagreed warnings sterling ball ceo ernie ball world leading maker premium guitar strings 2003 linux adopter said total cost ownership arguments think propaganda ... cost dealing virus n't 'em ... doubt 'm cheaper operate analyst guys say whatever want sco-linux controversies sco group alleged unix source code donated ibm illegally incorporated linux threat sco might able legally assert ownership linux initially caused potential linux adopters delay move court cases bankrupted sco 2007 lost four-year court battle ownership unix copyrights sco case hinged showing linux included intellectual property misappropriated unix case failed court discovered novell sco rightful owner copyrights legal process revealed sco claims linux fraudulent sco internal source code audits showed evidence infringement rival operating system vendor green hills software called open source paradigm linux fundamentally insecure us army agree linux security problem brigadier general nick justice deputy program officer army program executive office command control communications tactical peo c3t said april 2007 2008 gartner analysts predicted mobile devices like netbooks linux could potentially break dominance microsoft windows operating system provider netbook concept focuses os-agnostic applications built web applications browsing 2008 netbook market dominated linux-powered devices changed 2009 windows xp became available option one reasons given many customers returned linux-based netbooks still expecting windows-like environment despite netbook vision web-surfing web-application device 2011 google introduced chromebook web thin client running linux-based chrome os ability use web applications remote desktop computers running windows mac os x traditional linux distribution chrome os using chrome remote desktop 2012 google samsung introduced first version chromebox small-form-factor desktop equivalent chromebook 2013 chromebooks captured 20–25 sub- 300 us laptop market note term mobile devices computing context refers cellphones tablets term include regular laptops despite fact always designed mobile android based linux open source popular mobile platform second quarter 2013 79.3 smartphones sold worldwide running android android tablets also available firefox os another open source linux-based mobile operating system discontinued nokia previously produced phones running variant linux e.g nokia n900 2013 nokia handset division bought microsoft smartphones gradually replacing kinds embedded devices still exist example portable media players oem firmware linux based community-driven fully free open-source project rockbox in-vehicle infotainment hardware usually involves kind display either built dashboard additional displays genivi alliance works linux-based open platform run ivi may interface values delivered engine control unit albeit completely separate system special variant tizen ivi different tizen smartphones several regards linux often used various single- multi-purpose computer appliances embedded systems customer-premises equipment group devices embedded graphical user interface common sense remotely operated via secure shell via web-based user interface running lightweight web server software oem firmware based linux kernel free open-source software e.g das u-boot busybox also couple community driven projects e.g openwrt smaller scale embedded network-attached storage-devices also mostly linux-driven linux became popular internet server market particularly due lamp software bundle september 2008 steve ballmer microsoft ceo claimed 60 servers run linux 40 run windows server according idc report covering q2 2013 linux 23.2 worldwide server revenue although compensate potential price disparity linux non-linux servers may 2014 w3techs estimated 67.5 top 10 million according alexa websites run form unix linux used least 57.2 websites use unix linux-based solution stacks come general advantages benefits free open-source software commonly known examples according netcraft apache http server highest market share various freely available implementations ldap servers additionally univention corporate server integrated management system based debian supports functions provided microsoft active directory administration computers running microsoft windows free routing software available linux includes bird b.a.t.m.a.n. quagga xorp whether customer-premises equipment personal computer hardware server-hardware mainline linux kernel adapted highly optimized linux kernel capable routing rates limited hardware bus throughput linux popular operating system among supercomputers due general advantages benefits free open-source software like superior performance flexibility speed lower costs november 2008 linux held 87.8 percent share world top 500 supercomputers june 2016 operating systems used world top 500 supercomputers january 2010 weiwu hu chief architect loongson family cpus institute computing technology part chinese academy sciences confirmed new dawning 6000 supercomputer use chinese-made loongson processors run linux operating system recent supercomputer organization built dawning 5000a first run 2008 used amd chips ran windows hpc server 2008 many organizations advocate linux adoption foremost linux foundation hosts sponsors key kernel developers manages linux trademark manages open source developer travel fund provides legal aid open source developers companies linux legal defense fund sponsors kernel.org also hosts patent commons project international free open source software foundation ifossf nonprofit organization based michigan usa dedicated accelerating promoting adoption foss worldwide research civil society partnership networks open invention network formed protect vendors customers patent royalty fees using oss advocates linux include gartner claimed linux-powered personal computers accounted 4 unit sales 2008 however common users install linux addition dual boot arrangement place factory-installed microsoft windows operating system | [
2560,
4616,
3082,
5644,
5139,
9237,
10780,
4637,
8735,
10785,
3618,
6180,
9257,
1584,
5681,
8242,
9266,
3129,
1083,
2111,
4161,
10817,
8772,
6213,
8268,
589,
593,
2134,
3162,
1632,
1121,
2658,
6244,
10341,
5222,
10856,
6763,
4207,
9851,
5... | Test |
1,762 | 4 | Tapestry_Technologies:tapestry technologies tapestry technologies small privately owned systems integration defense contractor based chambersburg pennsylvania company provides professional services united states department defense united states navy u.s. army information technology agency areas cybersecurity network systems engineering training support tapestry technologies founded 2005 jacquie sipes jim govekar cindy whitmer sipes serving company ’ ceo since inception company focused performing defense contract work category woman-owned small business recognized fortune magazine one top 20 great workplaces technology 2014 listed inc. 5000 one fastest growing private companies united states start 2015 tapestry 10 million revenue three-year sales growth 217 may 2015 company 73 employees occupying 20,000 square feet office space since october 2013 tapestry technologies served prime contractor gsa schedule 70 contract gs-35f-007ba company also performed work sub-contractor encore ii veterans administration transformation twenty-one total technology va-t4 gsm-eti contract vehicles tapestry centers business niche market within defense information systems agency providing information assurance cyber security services including certification accreditation security readiness reviews ssr security technical implementation guides stig technical training company main areas expertise cyber defense cyber training cyber integration help desk services areas expertise tapestry performed work various government task orders including writing “ security policy consolidated email system used 4.6 million dod users clients ” | [
7979,
4820
] | Test |
1,763 | 3 | Parodius:_The_Octopus_Saves_the_Earth:parodius octopus saves earth referred parodius scrolling shooter video game developed konami msx computer released japan game notable first title parodius series although often confused sequel parodius myth laughter name portmanteau gradius parody eponymously game parody gradius series space-based horizontally scrolling shooters many characters enemies derived famous shooter series elements extracted konami titles antarctic adventure twinbee game particular note series heavily infused japanese culture folklore gameplay similar gradius games aspects games twinbee however characters replaced silly characters taken either konami games well japanese culture music mostly taken classical music pieces player play either takosuke octopus penguin father pentarou antarctic adventure exclusive msx game penguin adventure goemon ganbare goemon series popolon knight msx game knightmare vic viper spaceship gradius game composed six stages consisting various obstacles enemies penguins bees well traditional gradius enemies moai gradius game utilizes similar selection-bar based power-up system parodius awarded best game never came u.s. 1992 electronic gaming monthly parodius later included konami antiques msx collection vol.3 playstation konami antiques msx collection ultra pack sega saturn parodius portable playstation portable enhanced graphics addition released mobile phones december 2006 wii virtual console january 12 2010 wii u december 25 2013 japan also msx version re-released windows pc online store project egg april 11 2014 japan addition disc 8 legend game music ~premium box~ released march 24 2005 devoted msx parodius | [
4357,
9006,
11061,
8887,
1626
] | None |
1,764 | 4 | HackerOne:hackerone hackerone vulnerability coordination bug bounty platform connects businesses penetration testers cybersecurity researchers one first companies along synack bugcrowd embrace utilize crowd-sourced security cybersecurity researchers linchpins business model largest cybersecurity firm kind july 2018 hackerone network consisted approximately 200,000 researchers resolved 72,000 vulnerabilities across 1,000 customer programs paid 31 million bounties 2011 dutch hackers jobert abma michiel prins attempted find security vulnerabilities 100 prominent high-tech companies discovered flaws companies including facebook google apple microsoft twitter dubbing efforts hack 100 abma prins contacted at-risk firms many firms ignored disclosure attempts coo facebook sheryl sandberg gave warning head product security alex rice rice abma prins connected together merijn terheggen founded hackerone 2012 november 2015 terheggen stepped role ceo replaced marten mickos november 2013 company hosted program encouraging discovery responsible disclosure software bugs microsoft facebook funded initiative known internet bug bounty project june 2015 hackerone bug bounty platform identified approximately 10,000 vulnerabilities paid researchers 1 million bounties september 2015 company launched vulnerability coordination maturity model then-policy chief katie moussouris described “ important effort hackerone codify reasonable minimum standards organizations handle incoming unsolicited vulnerability reports. ” april 2017 company announced 240 year-over-year customer growth europe subsequent opening additional european offices serve increasing customer demand may 2014 hackerone received 9 million usd series funding venture capital firm benchmark 25 million series b round led new enterprise associates angel investors include salesforce ceo marc benioff digital sky technologies founder yuri milner dropbox chief executive drew houston yelp ceo jeremy stoppelman series c round led dragoneer investment group netted 40 million february 2017 total 74 million investments date april 2017 european-based venture capital fund eqt ventures invested 40 million series c funding round march 2016 u.s. department defense dod launched initiative dubbed hack pentagon using hackerone platform 24-day program resulted discovery mitigation 138 vulnerabilities dod websites 70,000 usd bounties paid participating researchers october year dod developed vulnerability disclosure policy vdp first kind created u.s. government policy outlines conditions cybersecurity researchers may legally explore front-facing programs security vulnerabilities first use vdp launched part hack army initiative also first time branch u.s. military welcomed hackers find report security flaws systems hack army initiative resulted 118 valid vulnerability reports 371 participants including 25 government workers 17 military personnel took part approximately 100,000 usd total awarded participating researchers may 2017 dod extended program hack air force program led discovery 207 vulnerabilities netting 130,000 usd paid bounties end 2017 dod learned fixed thousands vulnerabilities vulnerability disclosure initiatives february 2017 hackerone sponsored invitation-only hackathon gathering security researchers around world hack e-commerce sites airbnb shopify vulnerabilities second hackathon company hosting one las vegas august 2016 black hat security conference throughout 2017 far 2018 hackerone hosted seven live hacking events cities across us europe 1 million bounty cash awarded events oath inc. called verizon media paying 400,000 bounties single event san francisco ca april 2018 october 2017 hackerone hosted first conference called security san francisco 200-attendee event included speakers dod general motors uber also featured talks hackers hackerone headquartered san francisco company maintains development office groningen netherlands april 2017 company announced addition offices uk germany | [
5636,
10726,
711,
1259,
4623,
1912,
7257,
7547,
2558
] | None |
1,765 | 7 | Mailchimp:mailchimp mailchimp capitalized mailchimp 2018 marketing automation platform email marketing service platform trading name operator rocket science group american company founded 2001 ben chestnut mark armstrong dan kurzius joining later date mailchimp began paid service added freemium option 2009 within year user base grown 85,000 450,000 june 2014 sending 10 billion emails per month behalf users 2017 company gaining 14,000 new customers every day company still owned co-founders never accepted venture capital funds 2016 mailchimp ranked 7 forbes cloud 100 list february 2017 company named one fast company innovative companies 2017 august 2017 reported mailchimp would opening offices brooklyn oakland california february 2019 mailchimp acquired lemonstand smaller competitor later 2019 company announced annual revenue would reach 700 million mailchimp going become full marketing platform aimed smaller organizations may 2019 new users charged per contact opposed subscribed contacts new users paying unsubscribed contacts yet confirmed podcast advertiser mailchimp also sponsored launch serial podcast exploring murder case multiple episodes series parodies serial targeted several show aspects including podcast sponsor especially meme mailkimp february 2016 mailchimp announced merging mandrill transactional email service mailchimp add-on feature gave customers 60 days notice switch new pricing structure find alternative service platform announcement met widespread criticism customer outrage due new pricing structure requiring paid mailchimp plan able purchase mandrill credits resulting customers paying two products order access mandrill previously customers able purchase mandrill credits sending emails without signing mailchimp credits originally priced 9.95 25,000 emails increased 20 number emails new pricing scheme addition needing purchase mandrill credits customers need paid mailchimp monthly plan minimum monthly plan 10 month even customer need mailchimp services wants access mandrill mandrill renamed mailchimp transactional | [
970,
4197,
5830
] | Test |
1,766 | 3 | Prpl_Foundation:prpl foundation prpl foundation non-profit computer industry association started imagination technologies others encourage use mips architecture “ open others ” promotion standards open source solutions particular focus equipment data centers networking devices internet things foundation manages projects specific topic areas via “ pegs ” prpl engineer groups including groups focused processor emulation qemu carrier-grade networking prplwrt based openwrt virtualization security organization also collects disseminates information interest members including patterns consumer use smart devices security issues 2016 organization released study prpl foundation smart home security report group also finds reports security issues smart devices members prpl include broadcom cavium ikanos imagination technologies ineda systems ingenic semiconductor lantiq nevales networks pmc-sierra qualcomm security peg includes several well cupp computing elliptic technologies imperas software kernkonzept seltech | [
7234,
4124,
9863
] | None |
1,767 | 1 | Diplomatic_Documents_of_Switzerland:diplomatic documents switzerland diplomatic documents switzerland dodis research project edits important documents swiss foreign relations contemporary history project includes book series several volumes online database dodis contrast editions foreign policy dodis state-run project product academic research research group chooses documents published according independently defined criteria bound scientific principles choice published documents researchers aim show main features international relations switzerland maintaining diversity basic research done dodis provides historians primary sources allowing work specific aspects swiss foreign policy contextualise complex developments diplomatic documents switzerland enterprise swiss academy humanities social sciences sagw works auspices swiss society history ssh funding administration project taken academy january 2000 swiss national science foundation snf major financial contributor dodis furthermore project supported swiss federal archives sfa research centre located federal department foreign affairs fdfa research centre diplomatic documents switzerland managed director director accountable dodis-committee consists representatives contributing organisations professors history departments switzerland 1972 group historians took initiative publish documents study swiss foreign policy international relations switzerland fifteen volumes covering period 1848 1945 subsequently published 1979 1997 volume published different team researchers based swiss university project restructured mid 1990s course planning second series dodis online-database various changing research teams replaced permanent research centre assigned staff work second series dodis covering period 1945 1989 started 1997 time database dodis.ch went online dodis.ch integrative freely accessible internet database diplomatic documents switzerland dodis contains thousands documentes primarily sourced swiss federal archives related swiss foreign relations database also links meta-data regarding persons organisations important international swiss history sources thus critically contextualised research extended dodis documents well relevant archival holdings relational database works addition printed volumes aims illustrate detail various aspects swiss international relations thousands documents dodis.ch contrary volumes annotated indexed tagged according scientific criteria documents dodis.ch scans downloaded pdf format book series several volumes aims illustrate main features guidelines international relations switzerland documents printed volumes therefore primarily either show general orientation swiss foreign relations indicate certain time strongly influenced orientation 1979 1997 first series published fifteen volumes covering period 1848 1945 volumes later digitalised accessed swiss federal archives search engine publications officielles numérisées uses full text search second series covering period 1945 1989 completed 2020 planned published fifteen volumes well recent volume vol 26 1973-75 published 2018 | [
9286
] | Validation |
1,768 | 9 | John_Launchbury:john launchbury john launchbury american british computer scientist currently chief scientist galois inc previously directed one darpa ’ technical offices oversaw nation-scale scientific engineering research cybersecurity data analysis artificial intelligence known research entrepreneurship implementation application functional programming languages 2010 launchbury inducted fellow association computing machinery launchbury received first-class honors mathematics oxford university 1985 m.sc computation 1986 holds ph.d. computing science university glasgow 1991 cambridge university press published thesis projection factorizations partial evaluation british computer society distinguished dissertation prize lecturer university glasgow launchbury focused early research semantics analysis lazy functional languages one contributing designers haskell programming language apple developers later cited one influences behind swift programming language 1993 launchbury provided formal description lazy evaluation addressing challenges analyzing program ’ storage requirements operational semantics widely cited later research haskell context glasgow haskell compiler team launchbury established effective partnership simon l. peyton jones write number papers dramatically influenced design haskell 1995 paper state haskell introduced “ io monad ” mathematically-clean practical way expressing effects external world solidified “ ” launchbury introduced earlier papers unboxed values removal intermediate data structures addressed many efficiency challenges inherent lazy evaluation 1994 launchbury relocated west coast united states becoming full professor oregon graduate institute 2000 research addressed creation optimization domain-specific programming languages dsls ranging fundamental research combining disparate semantic elements embedding dsls haskell applied research modeling reasoning very-large scale integration vlsi micro-architectures launchbury founded galois inc. 1999 address challenges information assurance application functional programming formal methods served company ’ ceo chief scientist 2000 2014 launchbury ’ direction galois inc. developed cryptol domain-specific language specifying verifying cryptographic implementations originally designed use national security agency language made available public 2008 launchbury holder two patents cryptographic structures data storage one effective mechanisms configuring programmable cryptographic components 2014 launchbury joined darpa initially program manager director information innovation office i2o 2015 launchbury led programs homomorphic cryptography proceed cybersecurity vehicles embedded systems hacms data privacy brandeis 2017 launchbury rejoined galois chief scientist launchbury published theological perspective moral exemplar interpretation doctrine atonement entitled change us god biblical meditations death jesus | [
5527,
4769,
2818,
3876,
9926,
6536,
7887,
1783,
7292,
10813,
2558
] | Test |
1,769 | 9 | A-normal_form:a-normal form computer science a-normal form abbreviated anf intermediate representation programs functional compilers introduced sabry felleisen 1992 simpler alternative continuation-passing style cps advantages using cps intermediate representation optimizations easier perform programs cps source language also easier compilers generate machine code programs cps flanagan et al showed compilers could use anf achieve benefits one source-level transformation contrast realistic compilers cps transformation typically involves additional phases example simplify cps terms anf arguments function must trivial evaluation argument must halt immediately article deals basic definition expressed terms λ-calculus weak reduction let-expressions restriction enforced following bnf grammar describes pure λ-calculus modified support constraints anf variants anf used compilers research often allow constants records tuples multiargument functions primitive operations conditional expressions well expression written anf | [
10560,
8262,
7245,
5837,
10510,
10703,
10395,
7421
] | None |
1,770 | 2 | DirectX_Video_Acceleration:directx video acceleration directx video acceleration dxva microsoft api specification microsoft windows xbox 360 platforms allows video decoding hardware accelerated pipeline allows certain cpu-intensive operations idct motion compensation deinterlacing offloaded gpu dxva 2.0 allows operations including video capturing processing operations hardware accelerated well dxva works conjunction video rendering model used video card dxva 1.0 introduced standardized api windows 2000 currently available windows 98 later use either overlay rendering mode vmr 7/9 dxva 2.0 available windows vista windows 7 windows 8 later oss integrates media foundation mf uses enhanced video renderer evr present mf dxva used software video decoders define codec-specific pipeline hardware-accelerated decoding rendering codec pipeline starts cpu used parsing media stream conversion dxva-compatible structures dxva specifies set operations hardware accelerated device driver interfaces ddis graphic driver implement accelerate operations codec needs defined operations use interfaces access hardware-accelerated implementation operations graphic driver implement one interfaces codec provide software fallback decoded video handed hardware video renderer video post-processing might applied rendered device resulting pipeline usable directshow compatible application dxva specifies motion compensation ddi specifies interfaces idct operations huffman coding motion compensation alpha blending inverse quantization color space conversion frame-rate conversion operations among others also includes three sub-specifications deinterlacing ddi copp ddi procamp ddi deinterlacing ddi specifies callbacks deinterlacing operations copp certified output protection protocol ddi functions allow pipeline secured drm-protected media specifying encryption functions procamp ddi used accelerate post-processing video procamp driver module sits hardware video renderer display driver provides functions applying post-processing filters decompressed video functions exposed dxva ddis accessible directly directshow client supplied callback functions video renderer renderer plays important role anchoring pipeline dxva 2.0 enhances implementation video pipeline adds host ddis including capture ddi video capture ddis shares dxva 1.0 also enhanced ability use hardware acceleration operations also ddi functions directly available callers need mediated video renderer program also create pipeline simply decoding media without rendering post-processing rendering without decoding features require windows display driver model drivers limits dxva 2.0 windows vista windows server 2008 windows 7 windows server 2008 r2 windows 8 windows xp windows 2000 programs use dxva 1.0 dxva 2.0 allows enhanced video renderer video renderer vista windows 7 windows 8 windows xp dxva-rendering possible vmr9 well-known overlay mixer dxva integrates media foundation allows dxva pipelines exposed media foundation transforms mfts even decoder pipelines post-processing pipelines exposed mfts used media foundation topology loader create full media playback pipeline dxva 1.0 emulated using dxva 2.0 dxva 2.0 include copp ddi rather uses pvp protected content windows 7 implements dxva-hd driver complies wddm 1.1 dxva2 implementations come two variants native copy-back native implementation decoded video stays gpu memory displayed video decoder must connected video renderer intermediary processing filter video renderer must also support dxva gives less freedom choice renderers copy-back implementation decoded video copied gpu memory back cpu memory implementation n't limitations mentioned acts similarly normal software decoder however video stuttering occur gpu fast enough copy memory back cpu memory native mode advantageous unless need customized processing additional copy-back operations increase gpu memory load | [
10243,
5643,
4624,
10769,
9234,
1043,
7699,
537,
540,
3102,
1055,
9762,
2083,
8227,
8740,
1577,
10281,
10282,
3629,
4143,
9263,
11316,
1077,
2101,
8246,
10812,
2623,
3648,
7754,
10828,
4173,
4174,
9808,
4178,
9813,
10839,
603,
9819,
2145,
... | Test |
1,771 | 4 | CRM114_(program):crm114 program crm114 full name crm114 discriminator program based upon statistical approach classifying data especially used filtering email spam name comes crm-114 discriminator stanley kubrick movie piece radio equipment designed filter messages lacking specific code-prefix others done statistical bayesian spam filtering based upon frequency single word occurrences email crm114 achieves higher rate spam recognition creating hits based upon phrases five words length phrases used form markov random field representing incoming texts additional contextual recognition one accurate spam filters available initial testing 2002 author bill yerazunis gave 99.87 accuracy holden trec 2005 2006. gave results better 99 significant variation depending particular corpus crm114 classifier also switched use littlestone winnow algorithm character-by-character correlation variant knn k-nearest neighbor algorithm classification called hyperspace bit-entropic classifier uses entropy encoding determine similarity svm mutual compressibility calculated modified lz77 algorithm experimental classifiers actual features matched based generalization skip-grams crm114 algorithms multi-lingual compatible utf-8 encodings null-safe voting set crm114 classifiers demonstrated detect confidential versus non-confidential documents written japanese better 99.9 detection rate 5.3 false alarm rate crm114 good example pattern recognition software demonstrating machine learning accomplished reasonably simple algorithm program c source code available gpl deeper level crm114 also string pattern matching language similar grep even perl although turing complete highly tuned matching text even simple recursive definition factorial takes almost ten lines part crm114 language syntax positional declensional programming language may used many applications aside detecting spam crm114 uses tre approximate-match regex engine possible write programs depend absolutely identical strings matching function correctly crm114 applied number applications including detection bots twitter yahoo well first-level filter us dept transportation vehicle defect detection system also used predictive method classifying fault-prone software modules | [
5249,
8582,
3336,
4105,
6762,
8747,
10541,
6094,
4272,
1044,
1305,
9053
] | Validation |
1,772 | 2 | IPhone_XS:iphone xs iphone xs iphone xs max stylized marketed iphone iphone max roman numeral x pronounced ten smartphones designed developed marketed apple inc twelfth-generation flagships iphone succeeding iphone x announced september 12 2018 alongside lower-priced iphone xr steve jobs theater apple park cupertino apple ceo tim cook pre-orders beginning september 14 2018 official release september 21 2018 iphone xs max first plus-sized iphone new bezel-less form factor 2017 iphone x larger variant upon release xs xs max iphone x discontinued meaning shelf life 10 months shortest ever tenure flagship device history iphone release xs xs max starting prices 999/ 1099 us £999/£1099 uk €1149/€1249 europe rmb8699/rmb9599 china ₹99900/₹109900 india xs design visually near-identical x includes upgraded hardware featuring a12 bionic chip built 7 nanometer process also features 5.85-inch 149 mm oled display contains dual 12-megapixel rear cameras one 7-megapixel front-facing camera xs max features hardware cameras larger 6.46-inch 164 mm oled display battery 3,174mah also noted media xs received smaller battery x dropping 2,658 mah 2,716 mah xs battery new single-cell l-shaped battery iphone xs max battery remains two cells like iphone x. additionally apple states iphone xs lasts 30 minutes longer iphone x iphone xs max lasts 1.5 hours longer iphone x. apple claims devices faster face id technology also announced june 2019 wwdc face id iphone xs iphone xs max iphone xr iphone x would 30 faster ios 13 set arrive fall xs xs max rated ip68 dust water resistance iec standard 60529 apple specifying maximum depth 2 meters 30 minutes submersion water improvement ip67 water resistance iphone 8 x. apple performed tests various liquids including chlorinated water salt water tea wine beer juices unlike xr iphone xs devices optical zoom xs xs max support dual sims nano-sim esim mainland china hong kong macau however xs max comes dual nano-sim tray esim xs dual nano-sim tray esim functionality enabled use hong kong macau mainland china wireless charging coil made copper reduce charging time power loss iphones starting iphone 6s iphone 6s plus iphone se iphone 7 iphone 7 plus iphone 8 iphone 8 plus iphone x main camera 12mp 1/2.94 sensor size 1.22 μm pixel size starting iphone 2018 series xs xs max xr iphones updated 12mp 1/2.55 sensor size 1.4 μm pixel size sensor pixel size primary cameras samsung galaxy s10 samsung galaxy s9 samsung galaxy s8 samsung galaxy s7 pixel 2 pixel 3a pixel 3a xl pixel 3 pixel 3 xl moto x4 users reported problems charging iphone xs xs max lightning cable device failed charge would begin charge screen turned would occur due software bug apple ’ “ disable usb accessories locked ” setting feature intended prevent unknown devices accessing user content within iphone press dubbed issue chargegate issue resolved release ios 12.0.1 october 8 2018 customers also reported seeing unrealistic smoothness skin taking selfie automatic filter observers noted face-smoothing effect likely unintentionally caused new smart hdr camera feature xs xs max technology combines multiple photos varying exposures increase dynamic range iphones photos also lead less pronounced facial imperfections decreased highlights selfies speculated result hidden “ beauty mode ” actual feature smartphones dubbed issue “ beautygate. ” general dispute community whether camera actually intends perfect faces appear way result better quality camera apple said results due smart hdr algorithm incorrectly selecting blurrier long exposure base frame instead sharpest short exposure issue resolved software release ios 12.1 october 30 2018 iphone xs users issues lte wi-fi reception bluetooth connection radio expert claims faulty antenna blame apple contacted users help investigation ios 12.0.1 addresses issue bluetooth could become unavailable | [
10755,
9732,
1549,
5647,
7697,
4114,
6165,
11289,
7706,
8222,
1057,
6183,
1576,
6186,
4139,
6700,
7211,
1074,
8754,
9784,
1083,
8253,
576,
1090,
8783,
4180,
10838,
1623,
3672,
10840,
9312,
1121,
3681,
9826,
8806,
3691,
2673,
6258,
10357,
... | Test |
1,773 | 3 | Door_Door:door door door door designed koichi nakamura known creator dragon quest part programming contest held enix early 1980 winning first prize enix given rights game ported game several japanese home computers chun name protagonist nickname given nakamura one friends door door critical commercial success— pc-8801 port alone sold 200,000 copies considered classic title famicom players control chun small spherical animal outfitted baseball cap chun relentlessly pursued quartet game ai aliens traveling unique deterministic algorithm paths predictable aliens namegon amechan follow chun direct path possible invekun deviates follows roundabout paths using ladders otapyon shadows chun jumps player objective trap aliens behind sliding doors positioned throughout level courses composed platforms conjoined assorted ladders trap aliens players approach door side handle open running across lure advancing villains inside shut door escape trapped doors opened chun jump avoid aliens whose touch spells death bombs nails sometimes appear screen also lethal player dies provided continues restart level previously trapped aliens vanished doors accessible status bar running along top playing screen gives player score high score level number number lives remaining points awarded trapping aliens behind doors extra points going players corral multiple aliens behind one door collecting confectionery intermittently appear disappear playing screen include striped piece candy ice pop lollipop bowl ice cream slice cake mahjong tile players begin three lives scoring 10,000 points awards player extra life scoring intervals 20,000 points thereafter awards player lives player loses lives game forcing player restart first level players advance levels become complicated many requiring abstract strategies eighth level pits chun lone otapyon alien player strategy requires purposely allowing otapyon shadow jumps intention guiding unsuspecting otapyon across level myriad platforms doorway alien remains doors closed player placed no-win situation tenth level flat expanse two namegon aliens one door illustrates dilemma level begins spaced far apart initially impossible guide aliens single door without one escaping allowing one escape however places closer counterpart turn enabling player trap player traps one must sacrifice one life stage impossible complete 50th level requires timing failure part guarantees impossible-to-win scenario previous case player option kamikaze continue play programming error another aspect game difficulty level unique trait door door games prevent scenario time limit super mario bros. physical restriction tetris ending door door completing final level game simply restarts first level although player keeps allocated score allowed build upon successive plays game inspired popularity personal computers united states yasuhiro fukushima decided set enix pc business 1982 fukushima n't programmer enix broad sense simply intended publishing company pool talent individual game designers enix sponsored national programming contest three hundred programs entered contest first prize went programming prodigy high school student koichi nakamura puzzle game door door yuji horii placed finals contest computer tennis game subsequently hired enix rights door door became property enix enix published game wide range japanese computers including nec pc-8801 fujitsu fm-7 sharp mz-2000 sales exceeding 200,000 copies door door huge success popularity budding console market prompted 1985 release nintendo famicom 1986 enix third famicom production first role-playing video game made hori nakamura household names japan dragon quest enix unique approach game company—contracting talent game development publishing games—started new trend computer video game industry like publishing companies writers enix established concept royalties contractors 1984 nakamura created relatively exclusive contracting company christened chunsoft honor door door diminutive hero expanded version game branded door door mkii released three years original february 1985 game ported msx computers nec pc-6001 pc-6001mkii pc-6601 pc-8801 pc-8801mkii pc-8801mkiisr models sharp mz-2000 fujitsu fm-7 features 100 levels option start game new set levels beginning level 51 encouraged rapidly increasing popularity video game consoles japan enix also ported door door nintendo famicom march 2004 chunsoft celebrated 20th anniversary releasing version door door japanese mobile phone networks faithful reproduction famicom version application available ntt docomo foma 505i 900i series phones downloaded i-chunsoft ¥300 per month right table licensed ports door door | [
8355,
10855,
9006,
7023,
10931,
4894
] | None |
1,774 | 8 | Behavioral_retargeting:behavioral retargeting behavioral retargeting also known behavioral remarketing simply retargeting form online targeted advertising online advertising targeted consumers based previous internet actions retargeting tags online users including pixel within target webpage email sets cookie user browser cookie set advertiser able show display ads user elsewhere internet via ad exchange dynamic creative also known personalized retargeting allows advertiser display banner created on-the-fly particular consumer based specific pages viewed example consumer visits advertiser website browses products b c – retargeted display banner featuring exact products b c previously viewed typically restricted visitor browsing single website refined version improves re-engagement customers customer begins online order example fails complete flag indicates interest product ordered later ads showing product interest custom-linked point back order system user clicks ad returned incomplete order implementation requires order system support deep linking retargeting services retargeting depends setting cookies user browser several different methods retargeting ad campaigns usually run lower cost media display ads increases effectiveness specifically targeting interested audience also improves overall roi advertiser common use-case retargeting situations website visitor actions result sale conversion retargeting providers employ variety pricing models charge advertisers ads viewed consumers three prominent models include cost per impression cpm common metric used online advertising industry charge advertisers inventory based set price per thousand page impressions impression defined time banner ad loads individual ’ web browser pay per click ppc charges advertisers every verifiable click leads consumers back retailer ’ website unlike cpm model charges advertisers flat rate advertisers working ppc model charged person clicks ad cost per action cpa pricing model advertisers charged based pre-arranged action purchase view etc although completed sale common action used cpa model united states several organizations including federal trade commission congress media expressed privacy concerns around practice retargeting however responsible personalized retargeting providers ’ collect personally identifiable information pii consumers providers blind user ’ age sex personal information instead providers rely upon data gathered cookies placed consumer ’ browser websites visit information shared among publishers advertisers third parties linked specific user united states legislated many laws around practice instead relies upon industry overarching organizations interactive advertising bureau network advertising initiative truste self-regulate october 2010 iab announced advertising option icon partner sites place near banner advertisements collect non-pii user data eu 2002 eprivacy directive 2009 revision require opt-in consent use cookies stipulate users must given option opting | [
1944,
7965
] | Test |
1,775 | 2 | Year_2038_problem:year 2038 problem year 2038 problem relates representing time many digital systems number seconds passed since 1 january 1970 storing signed 32-bit binary integer implementations encode times 03:14:07 utc 19 january 2038 like y2k problem year 2038 problem caused insufficient capacity chosen storage unit latest time represented unix signed 32-bit integer time format 2-1 2,147,483,647 seconds 1 january 1970 times beyond wrap around stored internally negative number systems interpret occurred 13 december 1901 rather 19 january 2038 caused integer overflow counter runs usable digit bits flips sign bit instead reports maximally negative number continues count zero positive integers resulting erroneous calculations systems likely cause problems users reliant parties programs work future dates begin run problems sooner example program works dates 20 years future fixed later 19 january 2018 may 2006 reports surfaced early manifestation y2038 problem aolserver software software designed kludge handle database request never time rather specifically handling special case initial design simply specified arbitrary time-out date future default configuration server specified request time one billion seconds one billion seconds approximately 32 years 01:27:28 utc 13 may 2006 beyond 2038 cutoff date thus time time-out calculation overflowed returned date actually past causing software crash problem discovered aolserver operators edit configuration file set time-out lower value players games apps programmed impose waiting periods running problem attempt work around waiting period devices harbor coding manually setting devices date past 19 january 2038 unable since 32-bit unix time format used embedded systems use dates either computation diagnostic logging likely affected 2038 bug many transportation systems flight automobiles use embedded systems extensively automotive systems may include anti-lock braking system abs electronic stability control esc/esp traction control tcs automatic four-wheel drive aircraft may use inertial guidance systems gps receivers however imply systems suffer bug since many systems require access dates systems track difference times/dates absolute times/dates nature calculation experience major problem case automotive diagnostics based legislative standards carb california air resources board another major use embedded systems communications devices including cell phones internet appliances routers wireless access points etc rely storing accurate time date increasingly based unix-like operating systems example bug makes devices running 32-bit android crash restart time changed date despite modern 18–24 month generational update computer systems technology embedded systems designed last lifetime machine component conceivable systems may still use 2038 may impractical cases impossible upgrade software running systems ultimately requiring replacement 32-bit codice_1 limitations corrected mysql database built-in functions like codice_2 return 0 03:14:07 utc 19 january 2038 many data structures use today 32-bit time representations embedded structure full list data structures virtually impossible derive well-known data structures unix time problem examples systems using data structures may contain 32-bit time representations include system making use data structures containing 32-bit time representations present risk degree risk dependent mode failure network time protocol ntp related overflow issue manifests 2036 rather 2038 64-bit timestamps used ntp consist 32-bit part seconds 32-bit part fractional second giving ntp time scale rolls every 2 seconds 136 years theoretical resolution 2 seconds 233 picoseconds ntp uses epoch 1 january 1900 first rollover occurs 2036 prior unix year 2038 problem implementations disambiguate ntp time using knowledge approximate time sources since ntp works differences timestamps never absolute values wraparound invisible calculations long timestamps within 68 years however wraparound clients still face two problems means ntp rollover invisible running systems since correct time within small tolerance however systems starting need know date within 68 years given large allowed error expected onerous requirement one suggested method set clock earlier system build date release date current version ntp software many systems use battery-powered hardware clock avoid problem even future versions ntp may extend time representation 128 bits 64 bits second 64 bits fractional-second current ntp4 format support era number era offset used properly aid fixing date rollover issues according mills 64 bit value fraction enough resolve amount time takes photon pass electron speed light 64 bit second value enough provide unambiguous time representation universe goes dim universal solution year 2038 problem change definition codice_1 data type would result code compatibility problems application date time representations dependent nature signed 32-bit codice_1 integer example changing codice_1 unsigned 32-bit integer would extend range 2106 specifically 06:28:15 utc sunday 7 february 2106 would adversely affect programs store retrieve manipulate dates prior 1970 dates represented negative numbers increasing size codice_1 type 64-bit existing system would cause incompatible changes layout structures binary interface functions also universal solution issue dvb atsc real-time transmitted dates due issues legacy receivers issue yet acknowledged resolved either organization workaround would discontinue time-related metadata services programming guides automatic date synchronization affected dates one possible option would create new table types affected part specifications use iso 8601 date strings rather fixed integers—as used iso 9660 iso 13346 filesystems operating systems designed run 64-bit hardware already use signed 64-bit codice_1 integers using signed 64-bit value introduces new wraparound date twenty times greater estimated age universe approximately 292 billion years 15:30:08 utc sunday 4 december 292,277,026,596 ability make computations dates limited fact codice_9 uses signed 32 bit integer value starting 1900 year limits year maximum 2,147,485,547 2,147,483,647 1900 freebsd uses 64-bit codice_1 32-bit 64-bit architectures except 32-bit i386 uses unsigned 32-bit codice_1 instead starting netbsd version 6.0 released october 2012 netbsd operating system uses 64-bit codice_1 32-bit 64-bit architectures applications compiled older netbsd release 32-bit codice_1 supported via binary compatibility layer older applications still suffer year 2038 problem openbsd since version 5.5 released may 2014 also uses 64-bit codice_1 32-bit 64-bit architectures contrast netbsd binary compatibility layer therefore applications expecting 32-bit codice_1 applications using anything different codice_1 store time values may break linux uses 64-bit codice_1 64-bit architectures pure 32-bit abi changed due backward compatibility ongoing work mostly embedded linux systems support 64-bit codice_1 32-bit architectures x32 abi linux defines environment programs 32-bit addresses running processor 64-bit mode uses 64-bit codice_1 since new environment need special compatibility precautions network file system version 4 defined time fields codice_20 since december 2000 values greater zero seconds field denote dates 0-hour january 1 1970 values less zero seconds field denote dates 0-hour january 1 1970 cases nseconds nanoseconds field added seconds field final time representation alternative proposals made use storing either milliseconds microseconds since epoch typically either 1 january 1970 1 january 2000 signed 64-bit integer providing minimum range 300,000 years microsecond resolution proposals new time representations provide different precisions ranges sizes almost always wider 32 bits well solving related problems handling leap seconds particular tai64 implementation temps atomique international standard current international real-time standard defining second frame reference | [
1922,
8582,
8966,
6664,
9236,
7702,
2199,
4763,
7071,
5413,
10413,
5040,
7734,
823,
1724,
10176,
9921,
8260,
4424,
5065,
3659,
9557,
2273,
7139,
2404,
8037,
10344,
8298,
7022,
1263,
2804,
5492,
246,
8186,
7421
] | Validation |
1,776 | 3 | Central_processing_unit:central processing unit central processing unit cpu also called central processor main processor electronic circuitry within computer carries instructions computer program performing basic arithmetic logic controlling input/output i/o operations specified instructions computer industry used term central processing unit least since early 1960s traditionally term cpu refers processor specifically processing unit control unit cu distinguishing core elements computer external components main memory i/o circuitry form design implementation cpus changed course history fundamental operation remains almost unchanged principal components cpu include arithmetic logic unit alu performs arithmetic logic operations processor registers supply operands alu store results alu operations control unit orchestrates fetching memory execution instructions directing coordinated operations alu registers components modern cpus microprocessors cpu contained single metal-oxide-semiconductor mos integrated circuit ic chip ic contains cpu may also contain memory peripheral interfaces components computer integrated devices variously called microcontrollers systems chip soc computers employ multi-core processor single chip containing two cpus called cores context one speak single chips sockets array processors vector processors multiple processors operate parallel unit considered central also exists concept virtual cpus abstraction dynamical aggregated computational resources early computers eniac physically rewired perform different tasks caused machines called fixed-program computers since term cpu generally defined device software computer program execution earliest devices could rightly called cpus came advent stored-program computer idea stored-program computer already present design j. presper eckert john william mauchly eniac initially omitted could finished sooner june 30 1945 eniac made mathematician john von neumann distributed paper entitled first draft report edvac outline stored-program computer would eventually completed august 1949 edvac designed perform certain number instructions operations various types significantly programs written edvac stored high-speed computer memory rather specified physical wiring computer overcame severe limitation eniac considerable time effort required reconfigure computer perform new task von neumann design program edvac ran could changed simply changing contents memory edvac however first stored-program computer manchester baby small-scale experimental stored-program computer ran first program 21 june 1948 manchester mark 1 ran first program night 16–17 june 1949 early cpus custom designs used part larger sometimes distinctive computer however method designing custom cpus particular application largely given way development multi-purpose processors produced large quantities standardization began era discrete transistor mainframes minicomputers rapidly accelerated popularization integrated circuit ic ic allowed increasingly complex cpus designed manufactured tolerances order nanometers miniaturization standardization cpus increased presence digital devices modern life far beyond limited application dedicated computing machines modern microprocessors appear electronic devices ranging automobiles cellphones sometimes even toys von neumann often credited design stored-program computer design edvac design became known von neumann architecture others konrad zuse suggested implemented similar ideas so-called harvard architecture harvard mark completed edvac also used stored-program design using punched paper tape rather electronic memory key difference von neumann harvard architectures latter separates storage treatment cpu instructions data former uses memory space modern cpus primarily von neumann design cpus harvard architecture seen well especially embedded applications instance atmel avr microcontrollers harvard architecture processors relays vacuum tubes thermionic tubes commonly used switching elements useful computer requires thousands tens thousands switching devices overall speed system dependent speed switches tube computers like edvac tended average eight hours failures whereas relay computers like slower earlier harvard mark failed rarely end tube-based cpus became dominant significant speed advantages afforded generally outweighed reliability problems early synchronous cpus ran low clock rates compared modern microelectronic designs clock signal frequencies ranging 100 khz 4 mhz common time limited largely speed switching devices built design complexity cpus increased various technologies facilitated building smaller reliable electronic devices first improvement came advent transistor transistorized cpus 1950s 1960s longer built bulky unreliable fragile switching elements like vacuum tubes relays improvement complex reliable cpus built onto one several printed circuit boards containing discrete individual components 1964 ibm introduced ibm system/360 computer architecture used series computers capable running programs different speed performance significant time electronic computers incompatible one another even made manufacturer facilitate improvement ibm used concept microprogram often called microcode still sees widespread usage modern cpus system/360 architecture popular dominated mainframe computer market decades left legacy still continued similar modern computers like ibm zseries 1965 digital equipment corporation dec introduced another influential computer aimed scientific research markets pdp-8 transistor-based computers several distinct advantages predecessors aside facilitating increased reliability lower power consumption transistors also allowed cpus operate much higher speeds short switching time transistor comparison tube relay increased reliability dramatically increased speed switching elements almost exclusively transistors time cpu clock rates tens megahertz easily obtained period additionally discrete transistor ic cpus heavy usage new high-performance designs like simd single instruction multiple data vector processors began appear early experimental designs later gave rise era specialized supercomputers like made cray inc fujitsu ltd. period method manufacturing many interconnected transistors compact space developed integrated circuit ic allowed large number transistors manufactured single semiconductor-based die chip first basic non-specialized digital circuits gates miniaturized ics cpus based building block ics generally referred small-scale integration ssi devices ssi ics ones used apollo guidance computer usually contained dozen transistors build entire cpu ssi ics required thousands individual chips still consumed much less space power earlier discrete transistor designs ibm system/370 follow-on system/360 used ssi ics rather solid logic technology discrete-transistor modules dec pdp-8/i ki10 pdp-10 also switched individual transistors used pdp-8 pdp-10 ssi ics extremely popular pdp-11 line originally built ssi ics eventually implemented lsi components became practical mosfet metal-oxide-semiconductor field-effect transistor also known mos transistor invented mohamed atalla dawon kahng bell labs 1959 demonstrated 1960 led development mos metal-oxide-semiconductor integrated circuit proposed kahng 1961 fabricated fred heiman steven hofstein rca 1962 high scalability much lower power consumption higher density bipolar junction transistors mosfet made possible build high-density integrated circuits lee boysel published influential articles including 1967 manifesto described build equivalent 32-bit mainframe computer relatively small number large-scale integration circuits lsi way build lsi chips chips hundred gates build using mos semiconductor manufacturing process either pmos logic nmos logic cmos logic however companies continued build processors bipolar transistor–transistor logic ttl chips bipolar junction transistors faster mos chips 1970s companies datapoint continued build processors ttl chips early 1980s 1960s mos ics slower initially considered useful applications required low power following development silicon-gate mos technology federico faggin fairchild semiconductor 1968 mos ics largely replaced bipolar ttl standard chip technology early 1970s microelectronic technology advanced increasing number transistors placed ics decreasing number individual ics needed complete cpu msi lsi ics increased transistor counts hundreds thousands 1968 number ics required build complete cpu reduced 24 ics eight different types ic containing roughly 1000 mosfets stark contrast ssi msi predecessors first lsi implementation pdp-11 contained cpu composed four lsi integrated circuits advances mos ic technology led invention microprocessor early 1970s since introduction first commercially available microprocessor intel 4004 1971 first widely used microprocessor intel 8080 1974 class cpus almost completely overtaken central processing unit implementation methods mainframe minicomputer manufacturers time launched proprietary ic development programs upgrade older computer architectures eventually produced instruction set compatible microprocessors backward-compatible older hardware software combined advent eventual success ubiquitous personal computer term cpu applied almost exclusively microprocessors several cpus denoted cores combined single processing chip previous generations cpus implemented discrete components numerous small integrated circuits ics one circuit boards microprocessors hand cpus manufactured small number ics usually one overall smaller cpu size result implemented single die means faster switching time physical factors like decreased gate parasitic capacitance allowed synchronous microprocessors clock rates ranging tens megahertz several gigahertz additionally ability construct exceedingly small transistors ic increased complexity number transistors single cpu many fold widely observed trend described moore law proven fairly accurate predictor growth cpu ic complexity 2016 complexity size construction general form cpus changed enormously since 1950 basic design function changed much almost common cpus today accurately described von neumann stored-program machines moore law longer holds concerns arisen limits integrated circuit transistor technology extreme miniaturization electronic gates causing effects phenomena like electromigration subthreshold leakage become much significant newer concerns among many factors causing researchers investigate new methods computing quantum computer well expand usage parallelism methods extend usefulness classical von neumann model fundamental operation cpus regardless physical form take execute sequence stored instructions called program instructions executed kept kind computer memory nearly cpus follow fetch decode execute steps operation collectively known instruction cycle execution instruction entire process repeats next instruction cycle normally fetching next-in-sequence instruction incremented value program counter jump instruction executed program counter modified contain address instruction jumped program execution continues normally complex cpus multiple instructions fetched decoded executed simultaneously section describes generally referred classic risc pipeline quite common among simple cpus used many electronic devices often called microcontroller largely ignores important role cpu cache therefore access stage pipeline instructions manipulate program counter rather producing result data directly instructions generally called jumps facilitate program behavior like loops conditional program execution use conditional jump existence functions processors instructions change state bits flags register flags used influence program behaves since often indicate outcome various operations example processors compare instruction evaluates two values sets clears bits flags register indicate one greater whether equal one flags could used later jump instruction determine program flow first step fetch involves retrieving instruction represented number sequence numbers program memory instruction location address program memory determined program counter pc stores number identifies address next instruction fetched instruction fetched pc incremented length instruction contain address next instruction sequence often instruction fetched must retrieved relatively slow memory causing cpu stall waiting instruction returned issue largely addressed modern processors caches pipeline architectures see instruction cpu fetches memory determines cpu decode step performed circuitry known instruction decoder instruction converted signals control parts cpu way instruction interpreted defined cpu instruction set architecture isa often one group bits field within instruction called opcode indicates operation performed remaining fields usually provide supplemental information required operation operands operands may specified constant value called immediate value location value may processor register memory address determined addressing mode cpu designs instruction decoder implemented hardwired unchangeable circuit others microprogram used translate instructions sets cpu configuration signals applied sequentially multiple clock pulses cases memory stores microprogram rewritable making possible change way cpu decodes instructions fetch decode steps execute step performed depending cpu architecture may consist single action sequence actions action various parts cpu electrically connected perform part desired operation action completed typically response clock pulse often results written internal cpu register quick access subsequent instructions cases results may written slower less expensive higher capacity main memory example addition instruction executed arithmetic logic unit alu inputs connected pair operand sources numbers summed alu configured perform addition operation sum operand inputs appear output alu output connected storage e.g. register memory receive sum clock pulse occurs sum transferred storage resulting sum large i.e. larger alu output word size arithmetic overflow flag set hardwired cpu circuitry set basic operations perform called instruction set operations may involve example adding subtracting two numbers comparing two numbers jumping different part program basic operation represented particular combination bits known machine language opcode executing instructions machine language program cpu decides operation perform decoding opcode complete machine language instruction consists opcode many cases additional bits specify arguments operation example numbers summed case addition operation going complexity scale machine language program collection machine language instructions cpu executes actual mathematical operation instruction performed combinational logic circuit within cpu processor known arithmetic logic unit alu general cpu executes instruction fetching memory using alu perform operation storing result memory beside instructions integer mathematics logic operations various machine instructions exist loading data memory storing back branching operations mathematical operations floating-point numbers performed cpu floating-point unit fpu control unit cu component cpu directs operation processor tells computer memory arithmetic logic unit input output devices respond instructions sent processor directs operation units providing timing control signals computer resources managed cu directs flow data cpu devices john von neumann included control unit part von neumann architecture modern computer designs control unit typically internal part cpu overall role operation unchanged since introduction arithmetic logic unit alu digital circuit within processor performs integer arithmetic bitwise logic operations inputs alu data words operated called operands status information previous operations code control unit indicating operation perform depending instruction executed operands may come internal cpu registers external memory may constants generated alu input signals settled propagated alu circuitry result performed operation appears alu outputs result consists data word may stored register memory status information typically stored special internal cpu register reserved purpose address generation unit agu sometimes also called address computation unit acu execution unit inside cpu calculates addresses used cpu access main memory address calculations handled separate circuitry operates parallel rest cpu number cpu cycles required executing various machine instructions reduced bringing performance improvements performing various operations cpus need calculate memory addresses required fetching data memory example in-memory positions array elements must calculated cpu fetch data actual memory locations address-generation calculations involve different integer arithmetic operations addition subtraction modulo operations bit shifts often calculating memory address involves one general-purpose machine instruction necessarily decode execute quickly incorporating agu cpu design together introducing specialized instructions use agu various address-generation calculations offloaded rest cpu often executed quickly single cpu cycle capabilities agu depend particular cpu architecture thus agus implement expose address-calculation operations also include advanced specialized instructions operate multiple operands time furthermore cpu architectures include multiple agus one address-calculation operation executed simultaneously bringing performance improvements capitalizing superscalar nature advanced cpu designs example intel incorporates multiple agus sandy bridge haswell microarchitectures increase bandwidth cpu memory subsystem allowing multiple memory-access instructions executed parallel high-end microprocessors desktop laptop server computers memory management unit translating logical addresses physical ram addresses providing memory protection paging abilities useful virtual memory simpler processors especially microcontrollers usually n't include mmu cpu cache hardware cache used central processing unit cpu computer reduce average cost time energy access data main memory cache smaller faster memory closer processor core stores copies data frequently used main memory locations cpus different independent caches including instruction data caches data cache usually organized hierarchy cache levels l1 l2 l3 l4 etc. modern fast cpus specialized exceptions multiple levels cpu caches first cpus used cache one level cache unlike later level 1 caches split l1d data l1i instructions almost current cpus caches split l1 cache also l2 caches larger processors l3 caches well l2 cache usually split acts common repository already split l1 cache every core multi-core processor dedicated l2 cache usually shared cores l3 cache higher-level caches shared cores split l4 cache currently uncommon generally dynamic random-access memory dram rather static random-access memory sram separate die chip also case historically l1 bigger chips allowed integration generally cache levels possible exception last level extra level cache tends bigger optimized differently types caches exist counted towards cache size important caches mentioned translation lookaside buffer tlb part memory management unit mmu cpus caches generally sized powers two 4 8 16 etc kib mib larger non-l1 sizes although ibm z13 96 kib l1 instruction cache cpus synchronous circuits means employ clock signal pace sequential operations clock signal produced external oscillator circuit generates consistent number pulses second form periodic square wave frequency clock pulses determines rate cpu executes instructions consequently faster clock instructions cpu execute second ensure proper operation cpu clock period longer maximum time needed signals propagate move cpu setting clock period value well worst-case propagation delay possible design entire cpu way moves data around edges rising falling clock signal advantage simplifying cpu significantly design perspective component-count perspective however also carries disadvantage entire cpu must wait slowest elements even though portions much faster limitation largely compensated various methods increasing cpu parallelism see however architectural improvements alone solve drawbacks globally synchronous cpus example clock signal subject delays electrical signal higher clock rates increasingly complex cpus make difficult keep clock signal phase synchronized throughout entire unit led many modern cpus require multiple identical clock signals provided avoid delaying single signal significantly enough cause cpu malfunction another major issue clock rates increase dramatically amount heat dissipated cpu constantly changing clock causes many components switch regardless whether used time general component switching uses energy element static state therefore clock rate increases energy consumption causing cpu require heat dissipation form cpu cooling solutions one method dealing switching unneeded components called clock gating involves turning clock signal unneeded components effectively disabling however often regarded difficult implement therefore see common usage outside low-power designs one notable recent cpu design uses extensive clock gating ibm powerpc-based xenon used xbox 360 way power requirements xbox 360 greatly reduced another method addressing problems global clock signal removal clock signal altogether removing global clock signal makes design process considerably complex many ways asynchronous clockless designs carry marked advantages power consumption heat dissipation comparison similar synchronous designs somewhat uncommon entire asynchronous cpus built without using global clock signal two notable examples arm compliant amulet mips r3000 compatible minimips rather totally removing clock signal cpu designs allow certain portions device asynchronous using asynchronous alus conjunction superscalar pipelining achieve arithmetic performance gains altogether clear whether totally asynchronous designs perform comparable better level synchronous counterparts evident least excel simpler math operations combined excellent power consumption heat dissipation properties makes suitable embedded computers every cpu represents numerical values specific way example early digital computers represented numbers familiar decimal base 10 numeral system values others employed unusual representations ternary base three nearly modern cpus represent numbers binary form digit represented two-valued physical quantity high low voltage related numeric representation size precision integer numbers cpu represent case binary cpu measured number bits significant digits binary encoded integer cpu process one operation commonly called word size bit width data path width integer precision integer size cpu integer size determines range integer values directly operate example 8-bit cpu directly manipulate integers represented eight bits range 256 2 discrete integer values integer range also affect number memory locations cpu directly address address integer value representing specific memory location example binary cpu uses 32 bits represent memory address directly address 2 memory locations circumvent limitation various reasons cpus use mechanisms bank switching allow additional memory addressed cpus larger word sizes require circuitry consequently physically larger cost consume power therefore generate heat result smaller 4- 8-bit microcontrollers commonly used modern applications even though cpus much larger word sizes 16 32 64 even 128-bit available higher performance required however benefits larger word size larger data ranges address spaces may outweigh disadvantages cpu internal data paths shorter word size reduce size cost example even though ibm system/360 instruction set 32-bit instruction set system/360 model 30 model 40 8-bit data paths arithmetic logical unit 32-bit add required four cycles one 8 bits operands even though motorola 68000 series instruction set 32-bit instruction set motorola 68000 motorola 68010 16-bit data paths arithmetic logical unit 32-bit add required two cycles gain advantages afforded lower higher bit lengths many instruction sets different bit widths integer floating-point data allowing cpus implementing instruction set different bit widths different portions device example ibm system/360 instruction set primarily 32 bit supported 64-bit floating point values facilitate greater accuracy range floating point numbers system/360 model 65 8-bit adder decimal fixed-point binary arithmetic 60-bit adder floating-point arithmetic many later cpu designs use similar mixed bit width especially processor meant general-purpose usage reasonable balance integer floating point capability required description basic operation cpu offered previous section describes simplest form cpu take type cpu usually referred subscalar operates executes one instruction one two pieces data time less one instruction per clock cycle process gives rise inherent inefficiency subscalar cpus since one instruction executed time entire cpu must wait instruction complete proceeding next instruction result subscalar cpu gets hung instructions take one clock cycle complete execution even adding second execution unit see improve performance much rather one pathway hung two pathways hung number unused transistors increased design wherein cpu execution resources operate one instruction time possibly reach scalar performance one instruction per clock cycle however performance nearly always subscalar less one instruction per clock cycle attempts achieve scalar better performance resulted variety design methodologies cause cpu behave less linearly parallel referring parallelism cpus two terms generally used classify design techniques methodology differs ways implemented well relative effectiveness afford increasing cpu performance application one simplest methods used accomplish increased parallelism begin first steps instruction fetching decoding prior instruction finishes executing simplest form technique known instruction pipelining used almost modern general-purpose cpus pipelining allows one instruction executed given time breaking execution pathway discrete stages separation compared assembly line instruction made complete stage exits execution pipeline retired pipelining however introduce possibility situation result previous operation needed complete next operation condition often termed data dependency conflict cope additional care must taken check sorts conditions delay portion instruction pipeline occurs naturally accomplishing requires additional circuitry pipelined processors complex subscalar ones though significantly pipelined processor become nearly scalar inhibited pipeline stalls instruction spending one clock cycle stage improvement upon idea instruction pipelining led development method decreases idle time cpu components even designs said superscalar include long instruction pipeline multiple identical execution units load-store units arithmetic-logic units floating-point units address generation units superscalar pipeline multiple instructions read passed dispatcher decides whether instructions executed parallel simultaneously dispatched available execution units resulting ability several instructions executed simultaneously general instructions superscalar cpu able dispatch simultaneously waiting execution units instructions completed given cycle difficulty design superscalar cpu architecture lies creating effective dispatcher dispatcher needs able quickly correctly determine whether instructions executed parallel well dispatch way keep many execution units busy possible requires instruction pipeline filled often possible gives rise need superscalar architectures significant amounts cpu cache also makes hazard-avoiding techniques like branch prediction speculative execution register renaming out-of-order execution transactional memory crucial maintaining high levels performance attempting predict branch path conditional instruction take cpu minimize number times entire pipeline must wait conditional instruction completed speculative execution often provides modest performance increases executing portions code may needed conditional operation completes out-of-order execution somewhat rearranges order instructions executed reduce delays due data dependencies also case single instruction stream multiple data stream—a case lot data type processed— modern processors disable parts pipeline single instruction executed many times cpu skips fetch decode phases thus greatly increases performance certain occasions especially highly monotonous program engines video creation software photo processing case portion cpu superscalar part part suffers performance penalty due scheduling stalls intel p5 pentium two superscalar alus could accept one instruction per clock cycle fpu could accept one instruction per clock cycle thus p5 integer superscalar floating point superscalar intel successor p5 architecture p6 added superscalar capabilities floating point features therefore afforded significant increase floating point instruction performance simple pipelining superscalar design increase cpu ilp allowing single processor complete execution instructions rates surpassing one instruction per clock cycle modern cpu designs least somewhat superscalar nearly general purpose cpus designed last decade superscalar later years emphasis designing high-ilp computers moved cpu hardware software interface isa strategy long instruction word vliw causes ilp become implied directly software reducing amount work cpu must perform boost ilp thereby reducing design complexity another strategy achieving performance execute multiple threads processes parallel area research known parallel computing flynn taxonomy strategy known multiple instruction stream multiple data stream mimd one technology used purpose multiprocessing mp initial flavor technology known symmetric multiprocessing smp small number cpus share coherent view memory system scheme cpu additional hardware maintain constantly up-to-date view memory avoiding stale views memory cpus cooperate program programs migrate one cpu another increase number cooperating cpus beyond handful schemes non-uniform memory access numa directory-based coherence protocols introduced 1990s smp systems limited small number cpus numa systems built thousands processors initially multiprocessing built using multiple discrete cpus boards implement interconnect processors processors interconnect implemented single chip technology known chip-level multiprocessing cmp single chip multi-core processor later recognized finer-grain parallelism existed single program single program might several threads functions could executed separately parallel earliest examples technology implemented input/output processing direct memory access separate thread computation thread general approach technology introduced 1970s systems designed run multiple computation threads parallel technology known multi-threading mt approach considered cost-effective multiprocessing small number components within cpu replicated support mt opposed entire cpu case mp mt execution units memory system including caches shared among multiple threads downside mt hardware support multithreading visible software mp thus supervisor software like operating systems undergo larger changes support mt one type mt implemented known temporal multithreading one thread executed stalled waiting data return external memory scheme cpu would quickly context switch another thread ready run switch often done one cpu clock cycle ultrasparc t1 another type mt simultaneous multithreading instructions multiple threads executed parallel within one cpu clock cycle several decades 1970s early 2000s focus designing high performance general purpose cpus largely achieving high ilp technologies pipelining caches superscalar execution out-of-order execution etc trend culminated large power-hungry cpus intel pentium 4 early 2000s cpu designers thwarted achieving higher performance ilp techniques due growing disparity cpu operating frequencies main memory operating frequencies well escalating cpu power dissipation owing esoteric ilp techniques cpu designers borrowed ideas commercial computing markets transaction processing aggregate performance multiple programs also known throughput computing important performance single thread process reversal emphasis evidenced proliferation dual core processor designs notably intel newer designs resembling less superscalar p6 architecture late designs several processor families exhibit cmp including x86-64 opteron athlon 64 x2 sparc ultrasparc t1 ibm power4 power5 well several video game console cpus like xbox 360 triple-core powerpc design playstation 3 7-core cell microprocessor less common increasingly important paradigm processors indeed computing general deals data parallelism processors discussed earlier referred type scalar device name implies vector processors deal multiple pieces data context one instruction contrasts scalar processors deal one piece data every instruction using flynn taxonomy two schemes dealing data generally referred single instruction stream multiple data stream simd single instruction stream single data stream sisd respectively great utility creating processors deal vectors data lies optimizing tasks tend require operation example sum dot product performed large set data classic examples types tasks include multimedia applications images video sound well many types scientific engineering tasks whereas scalar processor must complete entire process fetching decoding executing instruction value set data vector processor perform single operation comparatively large set data one instruction possible application tends require many steps apply one operation large set data early vector processors cray-1 associated almost exclusively scientific research cryptography applications however multimedia largely shifted digital media need form simd general-purpose processors become significant shortly inclusion floating-point units started become commonplace general-purpose processors specifications implementations simd execution units also began appear general-purpose processors early simd specifications like hp multimedia acceleration extensions max intel mmx integer-only proved significant impediment software developers since many applications benefit simd primarily deal floating-point numbers progressively developers refined remade early designs common modern simd specifications usually associated one isa notable modern examples include intel sse powerpc-related altivec also known vmx cloud computing involve subdividing cpu operation virtual central processing units vcpus host virtual equivalent physical machine virtual system operating several physical machines operating tandem managed whole grouped computing memory resources form cluster systems possible dynamically add remove cluster resources available host cluster level partitioned resources pools fine granularity performance speed processor depends among many factors clock rate generally given multiples hertz instructions per clock ipc together factors instructions per second ips cpu perform many reported ips values represented peak execution rates artificial instruction sequences branches whereas realistic workloads consist mix instructions applications take longer execute others performance memory hierarchy also greatly affects processor performance issue barely considered mips calculations problems various standardized tests often called benchmarks purposesuch specinthave developed attempt measure real effective performance commonly used applications processing performance computers increased using multi-core processors essentially plugging two individual processors called cores sense one integrated circuit ideally dual core processor would nearly twice powerful single core processor practice performance gain far smaller 50 due imperfect software algorithms implementation increasing number cores processor i.e dual-core quad-core etc increases workload handled means processor handle numerous asynchronous events interrupts etc take toll cpu overwhelmed cores thought different floors processing plant floor handling different task sometimes cores handle tasks cores adjacent single core enough handle information due specific capabilities modern cpus simultaneous multithreading uncore involve sharing actual cpu resources aiming increased utilization monitoring performance levels hardware use gradually became complex task response cpus implement additional hardware logic monitors actual use various parts cpu provides various counters accessible software example intel performance counter monitor technology | [
4098,
8196,
6151,
8199,
2066,
4114,
6165,
2073,
4124,
8222,
6178,
36,
4132,
38,
6181,
40,
6183,
8231,
4139,
6187,
8233,
10284,
10285,
10287,
2097,
4147,
6197,
4152,
8250,
8253,
2111,
2113,
10310,
2121,
4172,
4173,
10316,
4180,
4185,
6233,... | Validation |
1,777 | 7 | Fedena:fedena fedena open-source school management software developed ruby rails framework web 2.0 web application developed foradian technologies fedena cloud based school erp software used schools administration purposes fedena used education department government kerala automate system process 15,000 schools state named sampoorna fedena used 40,000 institutions world development support fedena foradian mit tr35 2012 india award innovation education domain fedena pro commercial version software comes add-on modules premium modules open source version fedena seen updates since version 2.3 2013 developed ruby rails framework mvc architecture application composed basic module satisfies necessary requirements simple sis fedena optimized customization many add-on modules installed easily extend power usability fedena currently integrated moodle google apps tally fedena supports multitenant architecture used manage group institutions fedena started development june 2009 currently version 3.5.3 released march 2017 fedena project owned foradian technologies internet engineering company based bangalore india company raised 2 million funding william bissell managing director fabindia april 2014 foradian initiated successfully implemented fedena state kerala government schools project named sampoorna project implemented coordination education department government kerala india automate system process 15,000 schools state thank | [
7980,
7983
] | None |
1,778 | 3 | Haitz's_law:haitz law haitz law observation forecast steady improvement many years light-emitting diodes leds claims every decade cost per lumen unit useful light emitted falls factor 10 amount light generated per led package increases factor 20 given wavelength color light considered led counterpart moore law states number transistors given integrated circuit doubles every 18 24 months laws rely process optimization production semiconductor devices haitz law named roland haitz 1935–2015 scientist agilent technologies among others first presented larger public strategies light 2000 first series annual conferences organized strategies unlimited besides forecast exponential development cost per lumen amount light per package publication also forecast luminous efficacy led-based lighting could reach 200 lm/w lumen per watt 2020 crossing 100 lm/w 2010 would case enough industrial government resources spent research led-lighting 50 electricity consumption lighting 20 totally consumed electrical energy would saved reaching 200 lm/w prospect stepping-stone applications leds e.g mobile phone flash lcd-backlighting led massive investment led-research led efficacy indeed cross 100 lm/w 2010 trend continues leds become efficient light source 2020 theoretical maximum continuous wavelength opposed one made combination discrete-wavelength sources white light source 5800k colour temperature wavelengths restricted visible band 400nm 700nm 251 lm/w however non-continuous wavelength composite white leds achieved efficacies 300 lm/w 2010 cree inc. developed marketed xm-l led claimed 1000 lumens 100 lm/w efficacy 160 lm/w 350 150 lm/w 700 also claimed broken 200 lm/w barrier r prototype producing 208 lm 350 may 2011 cree announced another prototype 231 lm/w efficacy 350 march 2014 cree announced another prototype record breaking 303 lm/w efficacy 350 2017 philips lighting started offering consumer led lights 200 lm/w efficacy dubai using filament technology full 3 years haitz law predicted | [
6656,
2273,
5798,
5802,
78,
8367,
785,
6801,
153,
7006
] | Validation |
1,779 | 4 | Protocol_for_Carrying_Authentication_for_Network_Access:protocol carrying authentication network access pana protocol carrying authentication network access ip-based protocol allows device authenticate network granted access pana define new authentication protocol key distribution key agreement key derivation protocols purposes extensible authentication protocol eap used pana carry eap payload pana allows dynamic service provider selection supports various authentication methods suitable roaming users independent link layer mechanisms pana internet engineering task force ietf protocol described rfc 5191 pac pana client pac client part protocol element located node wants reach access network paa pana authentication agent entity represents server part pana protocol main task message exchange pac authenticating authorizing network access addition scenarios paa entity message exchange aaa server order offer pac credentials case eap configured pass-through aaa server placed physically different place paa authentication server element contains information needed check pac credentials node receives pac credentials paa sends packet result credential checking process moreover result ok packet contains information access parameters bandwidth allowed ip configuration session paa pac established session session time expires needs re-authentication process order get network access pac ep enforcement point works filter packets source authenticated pac basically ep network node drops packets according parameters provided results authentication processes typically function applied communication device access point router authentication process done successfully key installed ep pac establishing session ep pac session n't expire pac access network services authorised session expires indicate situation paa order re-authentication | [
6904,
2996
] | Test |
1,780 | 1 | SQLJ:sqlj sqlj deprecated working title efforts combine java sql common effort started around 1997 engineers ibm oracle compaq informix sybase cloudscape sun microsystems consists three parts 0 1 2 part 0 describes embedding sql statements java programs sqlj part 0 basis part 10 standard aka sql object language bindings sql/olb sqlj parts 1 2 describes converse possibility use java classes routines types sql statements parts 1 2 basis part 13 sql standard sql routines types using java programming language sql/jrt sqlj commonly used refer sqlj part 0 usually contrasted means embedding sql java like jdbc part 0 updated jdbc 2.0 compatibility ratified iso 2000 last two parts combined submitted iso part 2 substantially rewritten iso submission ansi version formal enough specification closer style user manual combined version ratified 2002 sqlj part 0 specification largely originated oracle also provided first reference implementation following sqlj synonym sqlj part 0 whereas jdbc provides api sqlj consists language extension thus programs containing sqlj must run preprocessor sqlj translator compiled advantages sqlj jdbc include following examples compare sqlj syntax jdbc usage | [
9665,
2596,
8262,
5896,
6860,
5677,
10413,
5872,
3323,
8188
] | Test |
1,781 | 4 | PunkeyPOS_Malware:punkeypos malware punkeypos new type point sale malware recently discovered pandalabs new point sale malware infects point sale pos systems two types malware applications keylogger ram scraper punkeypos gets installed computer automatically without knowledge user similar manner pos malware keylogger captures records keystrokes made pos terminals retail stores captures data related credit cards ram scraper reads memory system processes pos terminals information magnetic strips cards gets stored pos terminal/ device memory stolen information encrypted forwarded cybercriminal ’ control command server c c reported pandalabs 200 retail stores use pos systems infected new variant punkeypos malware | [
10309,
202,
6091,
4945,
8978,
4471,
6360
] | Train |
1,782 | 2 | Tomsrtbt:tomsrtbt tomsrtbt pronounced tom root boot small linux distribution short tom floppy root filesystem also bootable author tom oehser touts gnu/linux one floppy disk containing many common linux command-line tools useful system recovery linux operating systems also features drivers many types hardware network connectivity could created within linux earlier versions windows running ms-dos mode either formatting standard 1.44mb floppy disk higher density 1.722mb disk writing tomsrtbt image disk burning bootable cd capable reading writing filesystems many operating systems era including ext2/ext3 used linux fat used dos windows ntfs used windows nt 2000 xp minix used minix operating system windows nt later versions windows including 2000 xp vista create tomsrtbt floppy floppy driver allow extended format utilities tomsrtbt written lua programming language many use busybox space saving compiler options used throughout kernel patched support loading image compressed bzip2 many cases older alternate versions programs selected due smaller size | [
516,
8837,
7435,
10127,
8976,
2193,
2321,
2197,
5397,
2199,
4887,
10394,
673,
3745,
10530,
9253,
10149,
11305,
7854,
7983,
2738,
4790,
439,
56,
59,
3903,
4673,
2375,
4039,
8907,
1110,
9693,
2914,
485,
3685,
9064,
4841,
6890,
7913,
7020,
... | Validation |
1,783 | 1 | Mathematics_Genealogy_Project:mathematics genealogy project mathematics genealogy project web-based database academic genealogy mathematicians 13 february 2019 contained information 238,725 mathematical scientists contributed research-level mathematics typical mathematician project entry includes graduation year thesis title alma mater doctoral advisor doctoral students project grew founder harry coonce desire know name advisor advisor coonce professor mathematics minnesota state university mankato time project founding project went online fall 1997 coonce retired mankato 1999 fall 2002 university decided would longer support project project relocated time north dakota state university since 2003 project also operated auspices american mathematical society 2005 received grant clay mathematics institute harry coonce assisted mitchel t. keller assistant professor washington lee university keller currently managing director project mathematics genealogy mission statement states throughout project use word mathematics mathematician mean word inclusive sense thus relevant data statistics computer science philosophy operations research welcome genealogy information obtained sources dissertation abstracts international notices american mathematical society may supplied anyone via project website searchable database contains name mathematician university awarded degree year degree awarded title dissertation names advisor second advisor flag country degree awarded listing doctoral students count academic descendants historically significant figures lacked doctoral degree listed notably joseph louis lagrange noted data collected mathematics genealogy project self-reported guarantee observed genealogy network complete description mentorship network fact 16,147 mathematicians recorded mentor 8,336 recorded proteges maimgren ottino amaral 2010 stated mathematicians graduated 1900 1960 believe graduation mentorship record reliable | [
6662,
10246,
10762,
6673,
2595,
5676,
3119,
2608,
9271,
11328,
70,
9288,
588,
589,
9294,
9298,
1114,
7775,
9825,
9315,
9845,
5248,
7808,
10881,
4749,
144,
3728,
1180,
4769,
6306,
9895,
9384,
3252,
3774,
4799,
4800,
5310,
11473,
1236,
1749... | Test |
1,784 | 3 | Peter_Hofstee:peter hofstee harm peter hofstee born 1962 dutch physicist computer scientist currently distinguished research staff member ibm austin usa part-time professor big data systems delft university technology netherlands hofstee best known contributions heterogeneous computing chief architect synergistic processor elements cell broadband engine processor used sony playstation 3 first supercomputer reach sustained petaflop operation returning ibm research 2011 focused optimizing system roadmap big data analytics cloud including use accelerated compute early research work coherently attached reconfigurable acceleration power7 paved way new coherent attach processor interface power8 hofstee ibm master inventor 100 issued patents hofstee born groningen obtained master degree theoretical physics university groningen 1988 continued study california institute technology wrote master thesis constructing distributed programs 1991 obtained ph.d. thesis titled synchronizing processes 1995 joined caltech lecturer two years moved ibm austin texas research laboratory staff member senior technical staff member distinguished engineer positions since 2011 peter leading big data system design work ibm march 2016 peter appointed professor chair big data computer systems faculty electrical engineering mathematics computer science delft university technology | [
9472,
643,
1309,
9126,
6311,
4017,
306,
7218,
6072,
8120,
1985,
3025,
6738,
342,
1115,
859,
3677,
4060,
9445,
8937,
10985,
4587,
6004,
2293,
3323,
6268,
6909
] | Test |
1,785 | 2 | Niels_Provos:niels provos niels provos researcher security engineering malware cryptography received phd computer science university michigan 2003 2018 worked google distinguished engineer security google cloud platform 2018 left google join stripe new head security many years provos contributed openbsd operating system developed bcrypt adaptive cryptographic hash function author numerous software packages including libevent event driven programming system systrace access control system honeyd honeypot system stegdetect steganography detector bcrypt password encryption technique many others provos outspoken critic effect dmca similar laws security researchers arguing threaten make criminals people conducting legitimate security research provos also served program chair usenix security symposium program committees network distributed system security symposium acm sigcomm numerous conferences served board directors usenix 2006 2010 provos hobbies include swordsmithing forged swords japanese viking styles routinely posts videos blacksmithing activities online | [
9223,
10631,
2825,
3465,
1932,
3984,
274,
7702,
4503,
8344,
6702,
7983,
9520,
1843,
2245,
1993,
8778,
3404,
11086,
5970,
7515,
5084,
7139,
1637,
4071,
6888,
5230,
1783,
10105,
8954,
2558
] | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.