node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
9,286 | 1 | Relational_database:relational database relational database digital database based relational model data proposed e. f. codd 1970 software system used maintain relational databases relational database management system rdbms many relational database systems option using standard sql structured query language querying maintaining database term relational database invented e. f. codd ibm 1970 codd introduced term research paper relational model data large shared data banks paper later papers defined meant relational one well-known definition constitutes relational database system composed codd 12 rules however commercial implementations relational model conform codd rules term gradually come describe broader class database systems minimum 1974 ibm began developing system r research project develop prototype rdbms however first commercially available rdbms oracle released 1979 relational software oracle corporation examples rdbms include db2 sap sybase ase informix 1984 first rdbms macintosh began developed code-named silver surfer later released 1987 4th dimension known today 4d first systems relatively faithful implementations relational model first system sold rdbms multics relational data store 1978 ingres ibm bs12 followed common definition rdbms product presents view data collection rows columns even based strictly upon relational theory definition rdbms products typically implement codd 12 rules second school thought argues database implement codd rules current understanding relational model expressed christopher j date hugh darwen others relational view shared many theorists strict adherents codd principles would disqualify dbmss relational clarification often refer rdbmss truly-relational database management systems trdbms naming others pseudo-relational database management systems prdbms 2009 commercial relational dbmss employ sql query language alternative query languages proposed implemented notably pre-1996 implementation ingres quel model organizes data one tables relations columns rows unique key identifying row rows also called records tuples columns also called attributes generally table/relation represents one entity type customer product rows represent instances type entity lee chair columns representing values attributed instance address price row table unique key rows table linked rows tables adding column unique key linked row columns known foreign keys codd showed data relationships arbitrary complexity represented simple set concepts part processing involves consistently able select modify one one row table therefore physical implementations unique primary key pk row table new row written table new unique value primary key generated key system uses primarily accessing table system performance optimized pks natural keys may also identified defined alternate keys ak often several columns needed form ak one reason single integer column usually made pk pks aks ability uniquely identify row within table additional technology may applied ensure unique id across world globally unique identifier broader system requirements primary keys within database used define relationships among tables pk migrates another table becomes foreign key table cell contain one value pk migrates regular entity table design pattern represent either one-to-one one-to-many relationship relational database designs resolve many-to-many relationships creating additional table contains pks entity tables—the relationship becomes entity resolution table named appropriately two fks combined form pk migration pks tables second major reason system-assigned integers used normally pks usually neither efficiency clarity migrating bunch types columns relationships logical connection different tables established basis interaction among tables order database management system dbms operate efficiently accurately must use acid transactions programming within rdbms accomplished using stored procedures sps often procedures used greatly reduce amount information transferred within outside system increased security system design may grant access stored procedures directly tables fundamental stored procedures contain logic needed insert new update existing data complex procedures may written implement additional rules logic related processing selecting data relational database first defined june 1970 edgar codd ibm san jose research laboratory codd view qualifies rdbms summarized codd 12 rules relational database become predominant type database models besides relational model include hierarchical database model network model table summarizes important relational database terms corresponding sql term relation defined set tuples attributes tuple usually represents object information object objects typically physical objects concepts relation usually described table organized rows columns data referenced attribute domain conform constraints relational model specifies tuples relation specific order tuples turn impose order attributes applications access data specifying queries use operations select identify tuples project identify attributes join combine relations relations modified using insert delete update operators new tuples supply explicit values derived query similarly queries identify tuples updating deleting tuples definition unique tuple contains candidate primary key obviously unique however primary key need defined row record tuple definition tuple requires unique require primary key defined tuple unique attributes definition constitute superkey relational database data stored accessed via relations relations store data called base relations implementations called tables relations store data computed applying relational operations relations relations sometimes called derived relations implementations called views queries derived relations convenient act single relation even though may grab information several relations also derived relations used abstraction layer domain describes set possible values given attribute considered constraint value attribute mathematically attaching domain attribute means value attribute must element specified set character string abc instance integer domain integer value 123 another example domain describes possible values field coinface heads tails field coinface accept input values like 0,1 h constraints make possible restrict domain attribute instance constraint restrict given integer attribute values 1 10 constraints provide one method implementing business rules database support subsequent data use within application layer sql implements constraint functionality form check constraints constraints restrict data stored relations usually defined using expressions result boolean value indicating whether data satisfies constraint constraints apply single attributes tuple restricting combinations attributes entire relation since every attribute associated domain constraints domain constraints two principal rules relational model known entity integrity referential integrity primary key uniquely specifies tuple within table order attribute good primary key must repeat natural attributes attributes used describe data entered sometimes good primary keys surrogate keys often used instead surrogate key artificial attribute assigned object uniquely identifies instance table information students school might assigned student id order differentiate surrogate key intrinsic inherent meaning rather useful ability uniquely identify tuple another common occurrence especially regard n cardinality composite key composite key key made two attributes within table together uniquely identify record example database relating students teachers classes classes could uniquely identified composite key room number time slot since class could exactly combination attributes fact use composite key form data verification albeit weak one foreign key field relational table matches primary key column another table relates two keys foreign keys need unique values referencing relation foreign key used cross-reference tables effectively uses values attributes referenced relation restrict domain one attributes referencing relation concept described formally tuples referencing relation projected referencing attributes must exist tuple referenced relation projected attributes values referencing attributes match corresponding values referenced attributes stored procedure executable code associated generally stored database stored procedures usually collect customize common operations like inserting tuple relation gathering statistical information usage patterns encapsulating complex business logic calculations frequently used application programming interface api security simplicity implementations stored procedures sql rdbms often allow developers take advantage procedural extensions often vendor-specific standard declarative sql syntax stored procedures part relational database model commercial implementations include index one way providing quicker access data indexes created combination attributes relation queries filter using attributes find matching tuples randomly using index without check tuple turn analogous using index book go directly page information looking found read entire book find looking relational databases typically supply multiple indexing techniques optimal combination data distribution relation size typical access pattern indices usually implemented via b+ trees r-trees bitmaps indices usually considered part database considered implementation detail though indices usually maintained group maintains parts database use efficient indexes primary foreign keys dramatically improve query performance b-tree indexes result query times proportional log n n number rows table hash indexes result constant time queries size dependency long relevant part index fits memory queries made relational database derived relvars database expressed relational calculus relational algebra original relational algebra codd introduced eight relational operators two groups four operators first four operators based traditional mathematical set operations remaining operators proposed codd involve special operations specific relational databases operators introduced proposed since codd introduction original eight including relational comparison operators extensions offer support nesting hierarchical data among others normalization first proposed codd integral part relational model encompasses set procedures designed eliminate non-simple domains non-atomic values redundancy duplication data turn prevents data manipulation anomalies loss data integrity common forms normalization applied databases called normal forms connolly begg define database management system dbms software system enables users define create maintain control access database rdbms extension acronym sometimes used underlying database relational alternative definition relational database management system database management system dbms based relational model databases widespread use today based model rdbmss common option storage information databases used financial records manufacturing logistical information personnel data applications since 1980s relational databases often replaced legacy hierarchical databases network databases rdbms easier implement administer nonetheless relational databases received continued unsuccessful challenges object database management systems 1980s 1990s introduced attempt address so-called object-relational impedance mismatch relational databases object-oriented application programs well xml database management systems 1990s however due expanse technologies horizontal scaling computer clusters nosql databases recently become popular alternative rdbms databases distributed relational database architecture drda designed workgroup within ibm period 1988 1994 drda enables network connected relational databases cooperate fulfill sql requests messages protocols structural components drda defined distributed data management architecture according db-engines july 2019 widely used systems oracle mysql free software microsoft sql server postgresql free software ibm db2 microsoft access sqlite free software mariadb free software according research company gartner 2011 five leading proprietary software relational database vendors revenue oracle 48.8 ibm 20.2 microsoft 17.0 sap including sybase 4.6 teradata 3.7 | [
5632,
4614,
4617,
3594,
8201,
1549,
2063,
2068,
7191,
3096,
1049,
5658,
8217,
5151,
9248,
9762,
4135,
10793,
10286,
9268,
6709,
9782,
10292,
1594,
4155,
5691,
9789,
11324,
11327,
1606,
2631,
2632,
9290,
4174,
8788,
10326,
7767,
5210,
10849,... | Test |
9,287 | 4 | List_of_rogue_security_software:list rogue security software following partial list rogue security software grouped families functionally identical versions program repackaged successive new products vendor | [
224,
8064,
4165,
3333,
1417,
8215,
10392,
10556
] | Test |
9,288 | 0 | Eugene_Charniak:eugene charniak eugene charniak computer science cognitive science professor brown university a.b physics university chicago ph.d. m.i.t computer science research always area language understanding technologies relate knowledge representation reasoning uncertainty learning since early 1990s interested statistical techniques language understanding research area included work subareas part-of-speech tagging probabilistic context-free grammar induction recently syntactic disambiguation word statistics efficient syntactic parsing lexical resource acquisition statistical means fellow american association artificial intelligence previously councilor organization also honored 2011 association computational linguistics lifetime achievement award awarded 2011 calvin rose g hoffman prize 2011 named fellow association computational linguistics 2015 association advancement artificial intelligence aaai classic paper award paper “ statistical parsing context-free grammar word statistics ” presented fourteenth national conference artificial intelligence 1997 published five books | [
4774,
7048,
1737,
9879,
7724,
2062,
1783,
4350
] | None |
9,289 | 4 | Steganalysis:steganalysis steganalysis study detecting messages hidden using steganography analogous cryptanalysis applied cryptography goal steganalysis identify suspected packages determine whether payload encoded possible recover payload unlike cryptanalysis intercepted data contains message though message encrypted steganalysis generally starts pile suspect data files little information files contain payload steganalyst usually something forensic statistician must start reducing set data files often quite large many cases may entire set files computer subset likely altered problem generally handled statistical analysis set unmodified files type ideally source example model digital camera possible digital camera digital audio cd mp3 files ripped etc set inspected analyzed various statistics simple spectrum analysis since image audio files days compressed lossy compression algorithms jpeg mp3 also attempt look inconsistencies way data compressed example common artifact jpeg compression edge ringing high-frequency components high-contrast edges black text white background distort neighboring pixels distortion predictable simple steganographic encoding algorithms produce artifacts detectably unlikely one case detection suspect files straightforward original unmodified carrier available comparison comparing package original file yield differences caused encoding payload—and thus payload extracted cases single image available complicated analysis techniques may required general steganography attempts make distortion carrier indistinguishable carrier noise floor practice however often improperly simplified deciding make modifications carrier resemble white noise closely possible rather analyzing modeling consistently emulating actual noise characteristics carrier particular many simple steganographic systems simply modify least-significant bit lsb sample causes modified samples different noise profiles unmodified samples also lsbs different noise profiles could expected analysis higher-order bits still show amount noise lsb-only modification detected appropriate algorithms cases detecting encoding densities low 1 reasonable reliability detecting probable steganographic payload often part problem payload may encrypted first encrypting payload always done solely make recovery payload difficult strong ciphers desirable property making payload appear indistinguishable uniformly-distributed noise make detection efforts difficult save steganographic encoding technique trouble distribute signal energy evenly see concerning errors emulating native noise carrier inspection storage device considered likely steganographer may attempt barrage potential analyst effectively misinformation may large set files encoded anything random data white noise meaningless drivel deliberately misleading information encoding density files may slightly higher real ones likewise possible use multiple algorithms varying detectability considered steganalyst may forced checking decoys first potentially wasting significant time computing resources downside technique makes much obvious steganographic software available used obtaining warrant taking action based solely steganalytic evidence dicey proposition unless payload completely recovered decrypted otherwise analyst statistic indicating file may modified modification may result steganographic encoding likely frequently case steganalytic suspicions often backed investigative techniques | [
7424,
9319,
1544,
7369,
302,
3924,
1941,
10582
] | None |
9,290 | 1 | SQL_syntax:sql syntax syntax sql programming language defined maintained iso/iec sc 32 part iso/iec 9075 standard freely available despite existence standard sql code completely portable among different database systems without adjustments /math sql language subdivided several language elements including operators times suggested implemented skyline operator finding records 'worse others sql codice_1 expression introduced sql-92 general form called searched case sql standard sql tests codice_2 conditions order appear source source specify codice_3 expression sql defaults codice_4 abbreviated syntax—called simple case sql standard—mirrors switch statements syntax uses implicit equality comparisons usual caveats comparing null two short forms special codice_5 expressions codice_6 codice_7 codice_6 expression returns value first non-null operand found working left right null operands equal null equivalent codice_7 expression two operands returns null operands value otherwise value first operand equivalent standard sql allows two formats comments codice_10 ended first newline codice_11 span multiple lines common operation sql query makes use declarative codice_12 statement codice_12 retrieves data one tables expressions standard codice_12 statements persistent effects database non-standard implementations codice_12 persistent effects codice_16 syntax provided databases queries allow user describe desired data leaving database management system dbms carry planning optimizing performing physical operations necessary produce result chooses query includes list columns include final result normally immediately following codice_12 keyword asterisk codice_18 used specify query return columns queried tables codice_12 complex statement sql optional keywords clauses include clauses query particular order execution denoted number right hand side follows following example codice_12 query returns list expensive books query retrieves rows book table price column contains value greater 100.00 result sorted ascending order title asterisk select list indicates columns book table included result set example demonstrates query multiple tables grouping aggregation returning list books number authors associated book example output might resemble following precondition isbn common column name two tables column named title exists book table one could re-write query following form however many vendors either support approach require certain column-naming conventions natural joins work effectively sql includes operators functions calculating values stored values sql allows use expressions select list project data following example returns list books cost 100.00 additional sales_tax column containing sales tax figure calculated 6 price queries nested results one query used another query via relational operator aggregation function nested query also known subquery joins table operations provide computationally superior i.e faster alternatives many cases use subqueries introduces hierarchy execution useful necessary following example aggregation function codice_38 receives input result subquery subquery use values outer query case known correlated subquery since 1999 sql standard allows codice_39 clauses subqueries i.e named subqueries usually called common table expressions also called subquery factoring ctes also recursive referring resulting mechanism allows tree graph traversals represented relations generally fixpoint computations derived table use referencing sql subquery clause essentially derived table subquery selected joined derived table functionality allows user reference subquery table inline view also referred inline view subselect following example sql statement involves join initial book table derived table sales derived table captures associated book sales information using isbn join book table result derived table provides result set additional columns number items sold company sold books concept null allows sql deal missing information relational model word codice_40 reserved keyword sql used identify null special marker comparisons null instance equality clauses results unknown truth value select statements sql returns results clause returns value true i.e. excludes results values false also excludes whose value unknown along true false unknown resulting direct comparisons null thus brings fragment three-valued logic sql truth tables sql uses correspond common fragment kleene lukasiewicz three-valued logic differ definition implication however sql defines operation however disputes semantic interpretation nulls sql treatment outside direct comparisons seen table direct equality comparisons two nulls sql e.g codice_41 return truth value unknown line interpretation null value member data domain rather placeholder mark missing information however principle two nulls n't equal effectively violated sql specification codice_42 codice_43 operators identify nulls consequently set operations sql may produce results representing sure information unlike operations involving explicit comparisons null e.g codice_23 clause discussed codd 1979 proposal basically adopted sql92 semantic inconsistency rationalized arguing removal duplicates set operations happens lower level detail equality testing evaluation retrieval operations however computer-science professor ron van der meyden concluded inconsistencies sql standard mean possible ascribe intuitive logical semantics treatment nulls sql additionally sql operators return unknown comparing anything null directly sql provides two null-specific comparison predicates codice_45 codice_46 test whether data null sql explicitly support universal quantification must work negated existential quantification also row value expression distinct row value expression infixed comparison operator returns true unless operands equal null likewise distinct defined row value expression distinct row value expression also introduced codice_47 type variables according standard also hold unknown values nullable practice number systems e.g postgresql implement boolean unknown boolean null standard says null boolean unknown may used interchangeably mean exactly thing /ref data manipulation language dml subset sql used add update delete data transactions available wrap dml operations codice_59 codice_60 terminate current transaction release data locks absence codice_54 similar statement semantics sql implementation-dependent following example shows classic transfer funds transaction money removed one account added another either removal addition fails entire transaction rolled back data definition language ddl manages table index structure basic items ddl codice_67 codice_68 codice_69 codice_70 codice_71 statements column sql table declares type column may contain ansi sql includes following data types. ref name= iso/iec /ref codice_89 codice_90 data types multipliers codice_91 1 024 codice_92 1 048 576 codice_93 1 073 741 824 codice_94 1 099 511 627 776 optionally used specifying length codice_100 data type multipliers codice_91 1 024 codice_92 1 048 576 codice_93 1 073 741 824 codice_94 1 099 511 627 776 optionally used specifying length codice_47 data type store values codice_107 codice_108 example number 123.45 precision 5 scale 2 precision positive integer determines number significant digits particular radix binary decimal scale non-negative integer scale 0 indicates number integer decimal number scale exact numeric value integer value significant digits divided 10 sql provides functions codice_119 codice_120 round numerical values popular vendor specific functions codice_121 informix db2 postgresql oracle mysql codice_122 informix sqlite sybase oracle postgresql microsoft sql server mimer sql sql function codice_135 used extracting single field seconds instance datetime interval value current system date time database server called using functions like codice_136 codice_137 codice_138 codice_139 popular vendor specific functions codice_140 codice_141 codice_142 codice_143 codice_144 codice_145 codice_146 codice_147 codice_148 codice_149 codice_150 codice_151 data control language dcl authorizes users access manipulate data two main statements example | [
10632,
8201,
9871,
6161,
8979,
2068,
10389,
7446,
151,
2456,
1049,
5658,
5403,
2972,
5149,
2206,
8854,
9245,
9631,
9634,
11036,
5413,
4263,
2344,
6775,
7080,
10413,
10286,
11056,
9397,
3126,
1079,
5816,
10137,
3004,
10048,
5953,
6977,
9286,... | None |
9,291 | 9 | Literal_pool:literal pool computer science specifically compiler assembler design literal pool lookup table used hold literals assembly execution multiple local literal pools typically used computer architectures lack branch instructions long jumps set instructions optimized shorter jumps examples architectures include arm architecture ibm system/360 later architectures number instructions took 12-bit address offsets case compiler would create literal table every 4k page branches whose target less 4k bytes away could taken immediately longer branches required address lookup via literal table entries literal pool placed object relocation table assembly resolved link edit time certain ways literal pool resembles toc global offset table got except implementation considerably simpler may multiple literal tables per object perhaps common type literal pool literal pools used codice_1 pseudo-instruction arm assembly language similar instructions ibm system/360 assembly language compiled load pc-relative addressing mode constant stored literal pool often particular constant value used multiple times program many linkers default store unique constant single combined literal pool improves code size java virtual machine string literal pool class constant pool | [
1952,
6821,
8037,
8262,
6664,
9932,
9964,
10508,
5872,
477
] | Test |
9,292 | 2 | Nokia_E61:nokia e61 nokia e61 smartphone eseries range s60 3rd edition device targeting business users european market announced part new eseries business line 12 october 2005 along nokia e60 e70 q4 2006 cingular rogers wireless deployed similar yet restricted version designated nokia e62 north american brazilian markets e62 substantially similar without 802.11 wifi chipset w-cdma umts 3g support e61 supports 900/1800/1900 bands e62 operate 850/900/1800/1900 order support american networks 12 february 2007 nokia announced e61i follow product nokia e61i smartphone eseries range s60v3 device targeting business users european market update nokia e61 released 2006 product announced 12 february 2007 3gsm world congress main differences e61 include | [
1537,
8577,
3205,
11655,
9359,
1424,
529,
2449,
8083,
10770,
5143,
2072,
7063,
5274,
5019,
5659,
669,
8472,
10271,
2208,
11545,
4003,
4132,
6310,
167,
40,
3626,
5290,
10410,
10802,
7220,
821,
9909,
5175,
7866,
1083,
1728,
7617,
4291,
7877... | Validation |
9,293 | 4 | OWASP:owasp open web application security project owasp online community produces freely-available articles methodologies documentation tools technologies field web application security mark curphey started owasp september 9 2001 jeff williams served volunteer chair owasp late 2003 september 2011. matt konda chaired board owasp foundation 501 c 3 non-profit organization usa established 2004 supports owasp infrastructure projects since 2011 owasp also registered non-profit organization belgium name owasp europe vzw owasp organization received 2014 sc magazine editor choice award | [
899,
5636,
8585,
522,
10633,
3604,
1429,
7449,
1179,
5404,
2084,
11567,
10492,
11067,
8764,
4797,
2754,
5314,
331,
8526,
4435,
4820,
3552,
7522,
483,
612,
101,
4198,
7526,
2409,
6636,
8176,
113,
8956,
2558
] | None |
9,294 | 9 | Adriaan_van_Wijngaarden:adriaan van wijngaarden adriaan aad van wijngaarden 2 november 1916 – 7 february 1987 dutch mathematician computer scientist considered many founding father informatica computer science netherlands even though trained engineer van wijngaarden would emphasize promote mathematical aspects computing first numerical analysis programming languages finally design principles programming languages education mechanical engineering received degree delft university technology 1939 studied doctorate hydrodynamics abandoned area joined nationaal luchtvaartlaboratorium 1945 went group england following year learn new technologies developed world war ii van wijngaarden intrigued new idea automatic computing 1 january 1947 became head computing department brand-new mathematisch centrum mc amsterdam made visits england united states gathering ideas construction first dutch computer arra electromechanical construction first demonstrated 1952 year van wijngaarden hired edsger dijkstra worked software arra visiting edinburgh 1958 van wijngaarden seriously injured automobile accident wife killed recovered focused programming language research one designers original algol later algol 68 developed two-level type grammar became known van wijngaarden grammars became director mc 1961 remained post next twenty years 1959 became member royal netherlands academy arts sciences awarded every 5 years 60th anniversary centrum wiskunde informatica 2006 consists bronze sculpture | [
512,
8262,
840,
1672,
1610,
1611,
3529,
9224,
6652,
6460,
1783,
2012
] | Test |
9,295 | 9 | Brad_Cox:brad cox brad cox computer scientist known mostly creating objective-c programming language business partner tom love work software engineering specifically software reuse software componentry cox received bachelor science degree organic chemistry mathematics furman university ph.d. department mathematical biology university chicago among first known software projects wrote pdp-8 program simulating clusters neurons worked national institutes health woods hole oceanographic institute moving software profession although cox invented programming language objective-c used early career stated interview masterminds programming book n't interested programming languages rather software components regards languages mere tools building combining parts software cox also entrepreneur founded stepstone company together tom love releasing first objective-c implementation later next acquired objective-c stepstone objective-c continued primary programming language writing software apple os x ios | [
8262,
10470,
3733,
8732,
7806
] | Test |
9,296 | 5 | Acoustic_telegraphy:acoustic telegraphy acoustic telegraphy also known harmonic telegraphy name various methods multiplexing transmitting one telegraph messages simultaneously single telegraph wire using different audio frequencies channels message telegrapher used conventional morse key tap message morse code key pulses transmitted pulses specific audio frequency receiving end device tuned frequency resonated pulses others wire inventors worked acoustic telegraph included charles bourseul thomas edison elisha gray alexander graham bell efforts develop acoustic telegraphy order reduce cost telegraph service led invention telephone thomas edison devices used multiple synchronized tuning forks tuned selected audio frequencies opened closed electrical circuits selected audio frequencies acoustic telegraphy similar concept present-day fdma frequency division multiple access used radio frequencies word acoustic comes greek akoustikos meaning hearing hearing sound waves air acoustic telegraphy devices electromechanical made musical buzzing humming sound waves air feet primary function devices generate sound waves rather generate alternating electrical currents selected audio frequencies wires transmitted telegraphic messages electrically long distances five edison patents assigned western union telegraph company new york | [
3168,
7490,
2057,
7723,
1969,
2802,
2994,
119,
2458,
1083
] | Test |
9,297 | 7 | CloudBees:cloudbees cloudbees provider continuous delivery software services initially cloudbees provided platform service paas build run manage web applications cloudbees supported entire application life-cycle development deployment sacha labourey founded company early 2010 investors include matrix partners lightspeed venture partners verizon ventures cloudbees headquartered san jose ca additional offices lewes de richmond va brussels belgium seville spain neuchâtel switzerland sacha labourey founder ceo cloudbees labourey created company provide developers cloud platform made development java applications faster easier starting cloudbees labourey led jboss europe ultimately becoming chief technology officer remaining role red hat acquisition jboss june 2006 left red hat 2009 founded cloudbees one year later several management core developers coming jboss cloudbees expertise middleware proponent open source september 2014 cloudbees stopped offering runtime paas services order focus solely jenkins tool continuous delivery on-premises cloud kohsuke kawaguchi lead developer founder jenkins project well company cto several jenkins core committers also employed cloudbees 2016 company expanded services releasing private software service saas version continuous delivery platform 2016 cloudbees formed alliance github ca technologies others software development delivery february 2018 cloudbees acquired codeship provider continuous integration continuous delivery ci/cd cloud-based service move company said gives broader portfolio ci/cd solutions organizations sizes support several ci/cd philosophies approaches since 2010 cloudbees raised total 100 million venture financing cloudbees funding cloudbees products enable organizations build test deploy applications production utilizing continuous delivery practices continuous delivery important companies transitioning devops environment cloudbees product family includes enterprise version jenkins cloudbees provides commercial support additional plugins open source jenkins cloudbees jenkins platform includes cloudbees jenkins operations center provides central way manage jenkins across organization masters plugin versions easily maintained resources shared jenkins teams teams use cloudbees jenkins platform version jenkins development deploy popular runtime paas offerings pivotal cf google app engine amazon elastic beanstalk release cloudbees jenkins platform — private saas edition provides enterprises self-service access teams across entire organization software gives enterprises ability access cloudbees jenkins platform private cloud dedicated amazon web services cloudbees clients include range enterprises fortune 500 companies | [
8122,
6853,
2795,
5677,
7248,
11221,
2842
] | Test |
9,298 | 2 | Douglas_McIlroy:douglas mcilroy malcolm douglas mcilroy born 1932 mathematician engineer programmer 2007 adjunct professor computer science dartmouth college mcilroy best known originally developed unix pipelines software componentry several unix tools spell diff sort join graph speak tr seminal work software componentization makes pioneer component-based software engineering software product line engineering mcilroy earned bachelor degree engineering physics cornell university 1954 ph.d. applied mathematics mit 1959 thesis solution differential equations conical shells taught mit 1954 1958 mcilroy joined bell laboratories 1958 1965 1986 head computing techniques research department birthplace unix operating system thereafter distinguished member technical staff 1967 1968 mcilroy also served visiting lecturer oxford university 1990s mcilroy worked improving sorting techniques particularly co-authored optimized quicksort algorithm jon bentley 1997 mcilroy retired bell labs took position adjunct professor dartmouth college computer science department mcilroy member national academy engineering usenix lifetime achievement award flame software tools award previously served association computing machinery national lecturer turing award chairman member publications planning committee associate editor communications acm journal acm acm transactions programming languages systems also served executive committee csnet mcilroy attributed quote real hero programming one writes negative code meaning negative code taken similar famous apple developer team anecdote i.e. change program source makes number lines code decrease 'negative code overall quality readability speed improves | [
10881,
4483,
9735,
4492,
11023,
2198,
9507,
4398,
8499,
310,
823,
8502,
8631,
3134,
9535,
7872,
1987,
9542,
7883,
6617,
475,
8414,
8031,
8671,
6369,
9444,
6120,
5357,
8301,
8430,
2035,
5492,
1783,
4859,
2045
] | Test |
9,299 | 9 | X3J13:x3j13 x3j13 name technical committee part international committee information technology standards incits named x3 x3j13 committee formed 1986 draw american national standards institute ansi common lisp standard based first edition book common lisp language also termed cltl cltl1 guy l. steele jr. formerly de facto standard language primary output x3j13 american national standard programming language common lisp x3.226/1994 approved december 8 1994 x3j13 later worked international organization standardization iso working group sc22/wg16 internationally standardised dialect lisp named islisp original chair committee doctor robert mathis ohio state university mary van deusen secretary guy l. steele jr. originally vice-chair later years mathis stepped chair steele assumed role efforts committee guided charter successful creation credited coordinating efforts susan p. ennis representative amoco production company charter lays committee goals priorities broadly defined list topics addressed committee formed several subcommittees help members better concentrate efforts cleanup subcommittee chaired larry masinter established standardised format submission proposals voting issue writeups part standard deemed sufficiently useful common lisp hyperspec include cross-reference benefit readers providing information original intent committee decisions writeups also serve historical record alternate solutions problems ultimately adopted chaired sandra loosemore subcommittee created proposals issues relating lisp compiling guy steele acknowledged second edition common lisp language large contribution compiler subcommittee toward clarifying compiling process described first edition parts steele describes vague jon l. white chair iteration subcommittee among issues dealt group generalized codice_1 macro – domain-specific language second edition cltl devotes full chapter algol-like syntax macro differing lisp usual s-expression syntax remains somewhat controversial character subcommittee chaired thom linden task defining standard would deal issues surrounding different character sets resolution matters particularly ability use character name symbol intended make common lisp simpler international users chaired kent pitman error handling subcommittee plugged described biggest outstanding hole common lisp condition system general mechanism handling errors warnings exceptional situations committee referred resulting specification condition system rather error system accommodate one system handling exceptional situations various kinds whether fatal non-fatal whether continuable whether result program error simple resource limit stack overflow conditions signaled one point code may handled another point use term signal different typical operating system notion signals except lisp machines variant use term evolved operating system notion signaling scope committee consequently addressed ansi common lisp standard asynchronous interrupts ieee floating point trapping also scope committee work addressed standard kathy chapman chair drafting subcommittee responsible drafting actual standard document subcommittee oversaw efforts keep terminology consistent accurate throughout committee activities final standard produced x3j13 committee published american national standard x3.226 also hypertext form common lisp hyperspec book common lisp language although authored mostly guy l. steele jr. product ad hoc committee formed around 1980 worked collaboratively produce original de facto standard common lisp formation x3j13 x3j13 began work common lisp language base document proceeded design would become ansi common lisp steele served committee gave permission use parts first edition efforts documents published x3j13 later used together quotations certain committee members production common lisp language second edition released 1990 giving common lisp community way preview many features expected appear committee final standard document edition bears similarity standard content though form however substantive changes made form additions deletions publication book final draft ansi standard sum original edition common lisp language document x3j13 originally based work second edition contrast steele work committee product official status within x3j13 ansi acknowledged second edition preface authorized x3j13 choice content snapshot work progress formally synchronized x3j13 final version reviewed approved x3j13 | [
512,
4097,
10752,
11269,
2056,
2062,
9231,
7184,
2577,
9749,
8728,
4633,
4122,
8226,
3119,
2105,
6201,
3132,
6717,
8258,
8771,
1613,
10841,
3675,
7267,
2660,
8293,
3176,
2666,
2667,
5751,
7805,
1159,
9865,
9871,
9877,
4779,
5803,
2225,
88... | Validation |
9,300 | 2 | Working_set:working set working set concept computer science defines amount memory process requires given time interval peter denning 1968 defines “ working set information formula_1 process time formula_2 collection information referenced process process time interval formula_3 ” typically units information question considered memory pages suggested approximation set pages process access future say next formula_4 time units specifically suggested indication pages ought kept main memory allow progress made execution process effect choice pages kept main memory distinct paged auxiliary storage important many pages process kept main memory fewer processes ready one time pages process kept main memory page fault frequency greatly increased number active non-suspended processes currently executing system approaches zero working set model states process ram pages currently using often approximated recently used pages ram model nothing model meaning pages needs use increases room ram process swapped memory free memory processes use often heavily loaded computer many processes queued processes allowed run one scheduling time slice would refer pages ram causing computer thrash swapping processes memory result processes—even processes temporarily removed memory—finish much sooner would computer attempted run processes also finish much sooner would computer ran one process time completion since allows processes run make progress times one process waiting hard drive global resource words working set strategy prevents thrashing keeping degree multiprogramming high possible thus optimizes cpu utilization throughput main hurdle implementing working set model keeping track working set working set window moving window memory reference new reference appears one end oldest reference drops end page working set referenced working set window avoid overhead keeping list last k referenced pages working set often implemented keeping track time last reference considering working set pages referenced within certain period time working set n't page replacement algorithm page-replacement algorithms designed remove pages n't working set particular process one example modified version clock algorithm called wsclock working set divided code working set data working set distinction important code data separate relevant level memory hierarchy either working set fit level hierarchy thrashing occur addition code data systems virtual memory memory map virtual memory physical memory entries pages working set must cached translation lookaside buffer tlb process progress efficiently distinction exists code data cached small blocks cache lines entire pages address lookup done page level thus even code data working sets fit cache working sets split across many pages virtual address working set may fit tlb causing tlb thrashing analogs working set exist limited resources significantly processes set processes requires frequent interaction multiple processes must coscheduled order progress processes scheduled simultaneously – example two processes one core execute – processes advance rate one interaction per time slice resources include file handles network sockets – example copying one file another simply done two file handles one input one output thus file handle working set size two one file handle available copying still done requires acquiring file handle input reading say buffer releasing acquiring file handle output writing releasing acquiring input file handle repeating similarly server may require many sockets limited would need repeatedly release re-acquire sockets rather thrashing resources typically required program acquire enough resources simply fails | [
1025,
3725,
11539,
3871,
3615,
8624,
7351,
3512,
10813,
3267,
4423,
2250,
2383,
5840,
11343,
86,
6624,
8036,
9829,
7273,
8810,
4589,
7032
] | Test |
9,301 | 7 | GridRPC:gridrpc gridrpc remote procedure call grid paradigm proposed gridrpc working group open grid forum ogf api defined order clients access remote servers simply function call used among numerous grid middleware simplicity implementation standardized ogf 2007 interoperability reasons different existing middleware api followed document describing good use behavior different gridrpc api implementations works conducted gridrpc data management standardized 2011 scope standard offer recommendations implementation middleware deals following topics among existing middleware application programming approaches one simple powerful flexible approach consists using servers available different administrative domains classical client-server remote procedure call rpc paradigm network enabled servers nes implement model also called gridrpc clients submit computation requests resource broker whose goal find server available grid scheduling frequently applied balance work among servers list available servers sent back client client able send data request one suggested servers solve problem thanks growth network bandwidth reduction network latency small computation requests sent servers available grid make effective use today scalable resource platforms important ensure scalability middleware layers well service-oriented approach new several research projects targeted paradigm past main middleware implementing api diet netsolve/gridsolve ninf environments use like saga interface ogf without standardized api calls like ommirpc xtremweb rpc model internet also used several applications transparently internet large optimization problems solved using different approaches simply filling web page remote image processing computations use mathematical libraries studies heuristics resolution methods sparse linear algebra like gridtlse approach providing computation services internet also highly close service oriented computing soa paradigm core cloud computing one simple yet effective mean execute jobs computing grid use gridrpc middleware relies gridrpc paradigm request gridrpc middleware manages management submission input output data execution job remote resource etc make available service programmer must implement two codes client data defined run user requesting service server contains implementation service executed remote resource one step ease development codes conducted define gridrpc api proposed draft november 2002 open grid forum ogf standard since september 2007 thus gridrpc source code involve specific middleware data compiled executed gridrpc compliant middleware due difference choice implementation gridrpc api document describing interoperability gridrpc middleware also written main goals describe difference behaviour gridrpc middleware propose common test gridrpc middleware must pass discussions undertaken data management within gridrpc middleware draft api proposed ogf'21 october 2007 motivation document provide explicit functions manipulate data exchange gridrpc platform client since 1 size data used grid applications may large useless data transfers must avoided 2 data always stored client side may made available either storage resource within gridrpc platform hence side effect fully gridrpc-compliant code written compiled gridrpc middleware implementing gridrpc data management api gridrpc model pictured following figure communications handled 1 servers register services registry 2 client needs execution service contacts registry 3 registry returns handle client 4 client uses handle invoke service server 5 eventually receives back results mechanisms involved api must provide means make synchronous and/or asynchronous calls service latter clients must also able wait blocking non-blocking manner completion given service naturally involves data structures conducts rigorous definition functions api gridrpc data types three main data types needed implement api 1 grpc_function_handle_t type variables representing remote function bound given server allocated client variable used launch service many times desired explicitly invalidated user needed anymore 2 grpc_session_t type variables used identify specific non-blocking gridrpc call variable mandatory obtain information status job order client wait cancel know error status call 3 grpc_error_t groups kind errors returns status codes involved gridrpc api gridrpc functions grpc_initialize grpc_finalize functions similar mpi initialize finalize calls mandatory gridrpc call performed two calls read configuration files make gridrpc environment ready finish order initialize destruct function handle grpc_function_handle_init grpc_function_handle_destruct functions called function handle dynamically associated server resource discovery mechanisms example call grpc_function_handle_default let postpone server selection actual call made handle grpc_get_handle let client retrieve function handle corresponding session id e.g. non-blocking call previously performed depending type call blocking non-blocking client use grpc_call grpc_call_async function latter client possesses call session id used respectively probe wait completion cancel call check error status non-blocking call issuing unique numerous non-blocking calls client use grpc_probe know execution service completed grpc_probe_or know one previous non-blocking calls completed grpc_cancel cancel call grpc_wait block completion requested service grpc_wait_and block services corresponding session ids used parameters finished grpc_wait_or block service corresponding session ids used parameters finished grpc_wait_all block non-blocking calls completed grpc_wait_any wait previously issued non-blocking request completed talk lib +link code must compile give basic example | [
4194,
5956,
7018,
4107,
4052,
8122,
8702,
7935
] | Validation |
9,302 | 3 | POWER5:power5 power5 microprocessor developed fabricated ibm improved version power4 principal improvements support simultaneous multithreading smt on-die memory controller power5 dual-core microprocessor core supporting one physical thread two logical threads total two physical threads four logical threads technical details microprocessor first presented 2003 hot chips conference complete description given microprocessor forum 2003 14 october 2003 power5 sold openly used exclusively ibm partners systems using microprocessor introduced 2004 power5 competed high-end enterprise server market mostly intel itanium 2 lesser extent sun microsystems ultrasparc iv fujitsu sparc64 v. superseded 2005 improved iteration power5+ power5 development power4 addition two-way multithreading required duplication return stack program counter instruction buffer group completion unit store queue thread may resources register files execution units shared although thread sees set registers power5 implements simultaneous multithreading smt two threads executed simultaneously power5 disable smt optimize current workload many resources register files shared two threads increased capacity many cases compensate loss performance number integer floating-point registers increased 120 80 integer 72 floating-point registers power4 floating-point instruction cache also increased capacity 24 entries 20 capacity l2 unified cache increased 1.875 mb set-associativity 10-way unified l3 cache brought on-package instead located externally separate chips capacity increased 36 mb like power4 cache shared two cores cache accessed via two unidirectional 128-bit buses operating half core frequency on-die memory controller supports 64 gb ddr ddr2 memory uses high-frequency serial buses communicate external buffers interface dual inline memory modules dimms microprocessor power5 contains 276 million transistors area 389 mm fabricated ibm 0.13 µm silicon insulator soi complementary metal–oxide–semiconductor cmos process eight layers copper interconnect power5 die packaged either dual chip module dcm multi-chip module mcm dcm contains one power5 die associated l3 cache die mcm contains four power5 dies four l3 cache dies one power5 die measures 95 mm 95 mm several power5 processors high-end systems coupled together act single vector processor technology called viva virtual vector architecture power5+ improved iteration power5 introduced 4 october 2005 improvements initially lower power consumption due newer process fabricated power5+ chip uses 90 nm fabrication process resulted die size decrease 389 mm 243 mm clock frequency increased launch remained 1.5 1.9 ghz 14 february 2006 new versions raised clock frequency 2.2 ghz 2.3 ghz 25 july 2006 power5+ packaged packages previous power5 microprocessors also available quad-chip module qcm containing two power5+ dies two l3 cache dies one power5+ die qcm chips ran clock frequency 1.5 1.8 ghz ibm uses dcm mcm power5 microprocessors system p system server families ds8000 storage server embedded microprocessors high-end infoprint printers dcm power5 microprocessors used ibm high-end intellistation power 285 workstation third-party users power5 microprocessors groupe bull escala servers hitachi sr11000 computers 128 power5+ microprocessors several installations featured 2007 top500 list supercomputers ibm uses power5+ system p5 510q 520q 550q 560q servers | [
6914,
4868,
10501,
3846,
4743,
6663,
5642,
9739,
1548,
1933,
3472,
4881,
7065,
1563,
1309,
3493,
6949,
6311,
8102,
1321,
9126,
9391,
10543,
4017,
5297,
7218,
10675,
8120,
6715,
9020,
1725,
2877,
1983,
6464,
1985,
8899,
10180,
8136,
336,
8... | Validation |
9,303 | 3 | R-Type:r-type r-type first game run irem 16-bit m72 arcade system initially joke among staff force based dung beetles development team drew inspiration gradius aliens works h.r giger music composed masato ishizaki character design done akio game title stems word ray ray light reference player ray-like weapons used throughout game r-type celebrated critics graphics addictive gameplay although would receive criticism high difficulty level commonly cited one best shoot-em-up video games well one greatest video games time success would prompt creation several sequel spin-off games alongside home ports releases digital distribution services remake game released r-type dx game boy color 2000 3d remake r-type dimensions released xbox 360 2009 later nintendo switch 2018 game composed several sequential levels boss enemy end player controls small spacecraft must navigate terrain fight enemies using various ship weapons player spacecraft default weak rapid-firing main gun powerful gun called wave cannon requires player hold fire build power cannon game player obtain auxiliary device called force resembles glowing orange ball force attached front back player spacecraft detached fly freely attached force provides one three different powerful weapons addition main gun wave cannon detached weapons used force instead resort secondary set guns fired player even force distance spacecraft force secondary use shield completely indestructible block things fired well damage destroy enemies contact inspiration force came partly joke akibo designer envisioning behavior dung beetle r- series title stands ray ray light reference many different types ray-like weapons players use series another theory suggests r-type refers bydo r-strategists r/k selection theory original r-type well received gaming critics however also infamous relentless difficulty zx spectrum version r-type awarded 9/10 january 1989 issue sinclair placed number 6 sinclair official top 100 games machine praised incredible use colour blows away almost every shoot'em spectrum crash congratulated electric dreams retaining frenetic arcade feel producing brilliant game sinclair user praised weapons system difficulty curve c+vg concluded review saying excellent shoot'em challenging addictive absolute must spectrum blasting fanatics r-type placed number 1 rgtv youtube video top 5 shoot 'em ups zx spectrum successful 1988 port master system immediately recognized one best games available sega library mean machines magazine review praised particular graphics high quality challenge offered game awarding overall rating 92 1995 article next generation stated pc engine conversion irem arcade smash r-type still regarded system definitive contribution shoot 'em genre following year listed arcade original ports game number 98 top 100 games time praising art direction graphics design innovations huge bosses retrospective review allgame editor shawn sackenheim described turbografx-16 version r-type accurate home conversion arcade version game furthermore stating shooter started still thrill ride beginning end game runner-up category best coin-op conversion year golden joystick awards behind operation wolf hudson soft developed fairly accurate port r-type released pc engine turbografx 16 consoles although versions suffered slightly lower resolution reduced colour palette sprite flickering slowdown due slightly reduced resolution playfield also scrolls slightly vertical axis whenever player ship approaches top bottom screen japanese release pc engine split across two game cards hucards titled later north american release turbografx-16 contained entire game single card pc engine version r-type notable boss end stage 6 rather prolonged wave enemies versions xbox live arcade game r-type dimensions released february 4 2009 tozai games port original r-type sequel r-type ii played either original 2d graphics new 3d graphics added co-op gameplay functionality analogous version ps3 released may 2014 name r-type dimensions pc engine version r-type one first games confirmed nintendo virtual console north american european versions include eight levels released turbografx-16 japanese release wii split two downloads mirroring original format game pc engine however japanese releases nintendo 3ds wii u use turbografx-16 version instead pc engine one master system version became available well virtual console japan may 19 2009 north america november 2 2009 europe september 25 2009 however due licensing issues version delisted september 30 2011 north america europe october 18 2011 japan 2010 dotemu developed ios port r-type published electronic arts released also android september 2011 tozai games returned 2018 re-issued updated digital-only release r-type dimensions carrying title r-type dimensions ex landing steam playstation 4 nintendo switch.. strictly limited games released physical copies playstation 4 nintendo switch versions february 2019 limited 2,000 3,000 copies respectively collector edition variants also issued contained hardcover artbook dog tags stickers cards limited 1,000 playstation 4 2,000 nintendo switch irem developed number sequels related games including r-type ii armed police unit gallop xmultiply although part series similar themes gameplay released around time r-type ii however games katakis 1988 clone produced factor 5 commodore 64 amiga 1991 konami released xexex game heavily influenced r-type xmultiply game used similar weapons concepts flint combination r-type force x multiply tentacle equipment games similar r-type rezon released allumer 1991 aicom pulstar blazing star later published yumekobo neo geo technosoft 1992 title thunder force iv sega mega drive | [
7234,
11557,
3915,
9006,
10931,
4405,
6390
] | None |
9,304 | 9 | Programming_Languages:_Application_and_Interpretation:programming languages application interpretation programming languages application interpretation plai free programming language textbook shriram krishnamurthi use 30 universities several high-schools book differs programming language texts attempt wed two different styles programming language education one based language surveys another based interpreters former style easy ignore difficult technical points sometimes best understood trying reproduce via implementation latter easy miss high-level picture forest details plai therefore interleaves two using survey approach motivate ideas interpreters understand book accompanied supporting software runs racket programming language since plai constantly development newer material especially assignments found course pages brown university plai also experiment publishing methods essay books software discusses book self-published addition book currently december 2014 available for-pay print also free for-pay electronic editions | [
2666,
4867,
10324,
8262
] | Test |
9,305 | 7 | Qualtrics:qualtrics qualtrics experience management company co-headquarters provo utah seattle washington united states company founded 2002 scott m. smith ryan smith jared smith stuart orgill qualtrics offers subscription software platform world ’ iconic companies use close experience gaps deliver breakthrough results xm platform makes simple organization collect understand take action experience data x-data —the beliefs emotions sentiments customers employees november 11 2018 announced qualtrics would acquired sap acquisition completed january 23rd 2019 2012 company received 70 million series investment sequoia capital accel generally considered two top venture capital firms country largest joint investment date two firms september 2014 sequoia capital accel returned series b funding led insight partners worth 150 million record utah-based company valuing company 1 billion april 2017 qualtrics received series c investment round 180 million returning investors accel sequoia capital insight venture partners series c raised 2.5 billion pre-money valuation lifetime qualtrics raised total 400 million accel insight partners sequoia capital october 19 2018 qualtrics filed s-1 registration statement intention raising gross proceeds 200 million initial public offering ipo class b shares time company listed 9,000 global customers company meant listed nasdaq exchange ticker xm reference flagship experience management product qualtrics xm platform plans ipo scrapped announced november 2018 qualtrics would acquired sap nyse sap 2016 qualtrics ranked 12 forbes cloud 100 list moving 6 2017 qualtrics reported revenue 190.6 million 2016 289.9 million 2017 representing year year growth 52 2016 qualtrics reported overall net loss 12 million free cash flow 3.4 million 2017 qualtrics reported 2.6 million net profit free cash flow 21.3 million may 2016 qualtrics acquired statistical analysis startup statwing undisclosed sum statwing san francisco-based company created point-and-click software advanced statistical analysis april 2018 qualtrics acquired delighted undisclosed sum delighted 1,500 customers time acquisition november 2018 sap announced intent acquire qualtrics sap acquired outstanding shares qualtrics 8 billion usd cash deal sap secured €7 billion financing time announced qualtrics acquisition sap second-biggest purchase ever behind 8.3 billion acquisition travel expense management firm concur 2014 acquisition formally closed january 23 2019 quantitative statistical analysis performed qualtrics cited number professional academic journals qualtrics became first employee management platform measuring employee experiences key metrics powered predictive intelligence researchers often use qualtrics survey tool combine spss analyze survey data employee experiences many types survey data | [
4107,
8779,
6737,
5268,
2328,
5210,
4604
] | Test |
9,306 | 2 | Poul-Henning_Kamp:poul-henning kamp poul-henning kamp born 1966 danish computer software developer known work various projects currently resides slagelse denmark poul-henning kamp committing freebsd project duration responsible widely used md5crypt implementation md5 password hash algorithm vast quantity systems code including freebsd geom storage layer gbde cryptographic storage transform part ufs2 file system implementation freebsd jails malloc library ntp timecounters code lead architect developer open source varnish cache project http accelerator 2006 kamp dispute electronics manufacturer d-link claimed committing ntp vandalism embedding ip address ntp servers routers dispute resolved 27 april 2006 post poul-henning freebsd mailing lists responsible popularization term bike shed discussion derived term bikeshedding describe parkinson law triviality open source projects amount discussion subject receives inversely proportional importance poul-henning kamp known preference beerware license gnu general public license gpl poul-henning kamp made various anti-semitic comments blaming world jews collectively responsible actions israel may 8 2019 tweeted thought anti-semitism *unfounded* hatred jews hate something awful like implement apartheid anti-semitism perfectly justified critique people particular know better clarifying blog post later wrote readily admit probably skilled use twitter stand point kamp went say detests cowardice appaled sic arms atrocities uns human rights done name religion poul-henning kamp published substantial number articles years publications like communications acm acm queue mostly topics computing time keeping selection publications | [
10761,
2061,
9743,
8725,
4636,
1071,
1080,
5177,
9784,
64,
3651,
7748,
8266,
5710,
7249,
607,
9320,
10344,
8816,
9844,
633,
8316,
9343,
2180,
4745,
2212,
684,
3248,
1718,
5819,
11459,
10436,
9927,
8395,
8909,
6864,
10455,
6361,
8410,
9452... | Test |
9,307 | 3 | Pico-ITXe:pico-itxe pico-itxe pc pico-itx motherboard specification created via technologies sff-sig announced via technologies october 29 2008 released december 2008 pico-itxe specifications call board half area nano-itx 12 layers deep processor via c7 uses via nanobga2 technology uses ddr2 667/533 so-dimm memory support 2gb video supplied via chrome9 hc3 gpu built-in mpeg-2 4 wmv9 vc1 decoding acceleration bios 4 8 mbit award bios first motherboard produced specification called epia-p710 released december 2008 12 layers deep operating temperature range 0°c 50°c operating humidity level relative non-condensing 0 95 uses 1 ghz via c7-m processor via vx800 chip set rohs compliant onboard vga video-out gigabit ethernet supplied via vt6122 requires connector board hd 5.1 channel audio provided via vt1708b chip following standard i/o connections four i/o expansion boards stacked upon using sumit interface | [
10337,
2500,
455,
7113,
1515,
3883,
7151,
10095,
2161,
2803,
8730,
10715,
3037
] | Test |
9,308 | 2 | Apple_SOS:apple sos sophisticated operating system sos primary operating system developed apple iii computer sos developed apple computer inc. released october 1980 sos single-tasking single-user operating system makes resources apple iii available form menu-driven utility program well programming application programming interface api single program loaded boot time called interpreter loaded interpreter use sos api make requests system sos api divided four main areas apple iii system utilities program shipped apple iii computer provides user interface operating system system configuration file management system utilities program menu-driven performs tasks three categories sos two types devices communicates via device drivers character devices block devices examples sos character devices keyboards serial ports disk drives typical block devices block devices read write one 512-byte blocks time character devices read write single characters time powered apple iii runs system diagnostics reads block number zero built-in diskette drive memory executes sos-formatted diskettes place loader program block zero loader program searches loads executes file named sos.kernel kernel api operating system kernel turn searches loads file named sos.interp interpreter program run sos.driver set device drivers use files loaded control passed sos.interp program apple prodos uses file system sos disk formatted prodos prodos loader sos loader written blocks zero one respectively prodos loader includes code execute apple iii chainload sos loader block one sos prodos co-exist volume software adtpro makes use store apple ii apple iii versions program disk bootable systems 1985 steve wozniak critical apple iii hardware flaws called sos finest operating system microcomputer ever regardless sos advantages system backward-compatible dos 3.2 dos 3.3 apple ii software used time though apple iii designed mostly backward-compatible apple ii plus hardware users must boot apple dos separate disk utilize apple ii series software thus losing advantages sos many average computer users also ready 1980 operating system capabilities flexible configuration options sos offers especially combined apple iii bad reputation due poor engineering high retail price nearly | [
2179,
9732,
10755,
6023,
6539,
7307,
4114,
6675,
11171,
11430,
3241,
6186,
5293,
7983,
3248,
8114,
8754,
7991,
9784,
2363,
7483,
2365,
2366,
8767,
576,
11257,
10052,
11513,
8774,
3286,
1623,
7133,
3167,
3681,
5093,
6377,
3948,
5363,
5619,
... | Test |
9,309 | 3 | Elbrus_2000:elbrus 2000 elbrus 2000 e2k russian 512-bit wide vliw microprocessor developed moscow center sparc technologies mcst fabricated tsmc supports two instruction set architecture isa thanks unique architecture elbrus 2000 execute 20 instructions per clock even modest clock speed compete much faster clocked superscalar microprocessors running native vliw mode security reasons elbrus 2000 architecture implements dynamic data type-checking execution order prevent unauthorized access pointer additional type information verified associated data accessed | [
6659,
7941,
1798,
7687,
1425,
6815,
10145,
4386,
6818,
1702,
6957,
823,
2490,
11580,
7234,
2503,
4039,
2523,
5358,
1776,
499,
1399,
3071
] | Validation |
9,310 | 3 | Auf_Wiedersehen_Monty:auf wiedersehen monty auf wiedersehen monty german goodbye monty computer game zx spectrum commodore 64 amstrad cpc msx commodore 16 released 1987 fourth monty series following monty innocent monty run successful original written peter harrap shaun hollingworth music rob hubbard ben daglish player controls monty travels around europe collecting money order buy greek island montos safely retire gameplay style flick-screen platform game similar many games 1980s technician ted jet set willy screens representing eiffel tower pyrenees bear relation real-life counterparts typical platform game screens auf wiedersehen monty contains many interesting features peculiarities player discover examples include suddenly attacked bull head spain collecting red cape presumably reference bullfighting car dropped one two places entering screen representing düsseldorf west germany chef hat found sweden reference swedish chef muppets fame also two rooms representing sweden subtitled bjorn borg record luxembourg collected makes monty breakdance game title music may reference radio luxembourg possible get areas game quickly flying airport using air tickets collected throughout game parts game reached manner well money miscellaneous objects collect game points important need certain number points get montos often particular country monty visiting berets france bottles wine glass beer west germany cause monty briefly become drunk control become slightly erratic leading reversal controls repeated jumping monty climbing ladders drainpipes encounters moley christmas released later year monty mole game called impossamole released 1990 took different form previous games console-style arcade game | [
10931,
9006,
1527
] | Test |
9,311 | 8 | Wholesale_Applications_Community:wholesale applications community wholesale applications community wac organisation set create unified open platform allow mobile software developers easily write applications usable variety devices operating systems networks least 48 companies members organization wac organisation came end gsma announcing july 17 2012 reached agreement integrate wac major programs initiatives gsma additionally apigee acquired technology assets wac wac preceded omtp completed acquisition joint innovation lab 1 october 2010 accelerating commercial launch wac-enabled application stores put position fully operational commercially running end 2010 wholesale application community application development platform based standard technologies html javascript cascading style sheets css specifically platform builds work former open mobile terminal platform ltd. bondi project joint innovation lab jil device apis gsm association oneapi program utilizing web-based technologies rather relying developers write native applications specific devices wac alliance believes spur development applications across much wider range devices group also aims make certain telecoms apis available developers operator billing wac standards development organisation sdo used w3c standard technologies platform particular used w3c widget packaging format specification web apps also furthered use javascript device apis originated omtp bondi project bondi developed defunct open mobile terminals platform omtp jil joint venture china mobile softbank verizon wireless vodafone focused promoting use web based technologies mobile application development jil compliant handsets include sgh-i8320 samsung vodafone 360 h1 27 july 2010 wac announced would join forces jil completed acquisition 1 october 2010 meant developers currently creating jil applications continue working existing jil specification tools software libraries applications deployed jil based devices immediately publication wac specification developers also clear path deploy applications wider range devices supporting wac specification 2011 one question whether large group operators able respond changing market conditions particularly wake influence exerted apple google however vidhya gholkar wac developer relations lead commented mobile 2.0 september 20 2010 wac competing apple similar companies focus making apps available much greater audience requires adherence core set web technologies ability distribute base larger served single device os | [
7936,
11588,
3462,
9063,
3152,
8923
] | None |
9,312 | 3 | Macintosh_LC_500_series:macintosh lc 500 series macintosh lc 500 series series personal computers part apple computer macintosh lc family macintosh computers apple mid-1990s mainstream education-market macintosh featuring all-in-one desktop design built-in 14 crt display cd-rom drive stereo speakers designed successor compact macintosh family computers case similar recently introduced macintosh color classic considerably larger heavier due larger screen bulging midsection house larger electronics 500 series included four main models 520 550 575 580 520 550 using different speeds motorola 68030 575 580 sharing 33mhz motorola 68lc040 processor differing rest hardware computers also sold consumer market department stores macintosh performa brand similar model numbers lc models particular became popular schools small footprint lack cable clutter durability macintosh tv branded lc uses lc 520 case black instead platinum logic board similar lc 550 compact color classic series shares many components able swap logic boards early 500 series machines macintosh lc 520 introduced june 1993 case design larger compact macintosh models precede due large part significantly larger screen lc 520 got start design project codenamed mongo following success color classic apple industrial design group idg began exploring adaptation color classic design language dubbed espresso larger display version would also include cd-rom drive however idg hated design much permanently shelved final concept 1992 apple ceo john sculley demanded large screen all-in-one design fill market strategy less 6 months idg objections apple engineering team retrieved shelved design promptly put production idg universally detested design immediately began re-design project would become power macintosh 5200 lc series less two years later logic board 520 broadly macintosh lc iii motorola 68030 cpu optional motorola 68882 fpu new york times review lc 520 generally positive columnist peter lewis noting 1,599 price point perhaps best value entire macintosh product line ... would difficult put together windows-based pc features price windows computers usually much less expensive macs lewis also noted unit 40-pound weight would make difficult carry home night -- attribute apple previously marketed feature compact macintosh models 1980s macweek wrote timing lc 520 release coincided purchasing timelines schools decision market computer exclusively education market part strategic shift move lc brand away retail market 520 discontinued february 1994 replaced faster otherwise essentially unchanged macintosh lc 550 new 68lc040-equipped macintosh lc 575 apple sold upgrade kits lc 520 brought specifications lc 550 575 initially sold japan canada u.s. educational institutions computer discontinued february 1994 featured caddy-loaded cd-rom drive introduced june 28 1993 macintosh lc 550 replaced lc 520 february 1994 performa variants introduced earlier 550 october 1993 560 january 1994 remained available year longer april 1996 main difference 550 520 faster 68030 cpu clocked 33 mhz instead 25 mhz bus speed also increasing 25 33 mhz like 520 optical drive use loading tray instead utilized caddy disk first inserted caddy loaded drive logic board 550 essentially one used macintosh color classic ii upgrade original color classic available united states apple also offered upgrade package 520 lc 575 logic board two performa variants introduced varying software bundle included 550 included consumer applications performa 560 called money edition owing partnership apple money magazine addition consumer education software also included dozen business software applications lc 575 discontinued favor either lc 580 lower end powerpc-based power macintosh 5200 lc models higher end introduced october 18 1993 introduced january 15 1994 introduced february 2 1994 macintosh lc 575 available 1994 1996 retains all-in-one case lc 520/550 uses lc 475 motherboard motorola 68lc040 cpu speed 33 mhz instead 25 mhz tray-loading optical drive also included high density floppy disk drive cpu clock sometimes given 66 mhz since clock signal frequency however processor runs 33 mhz lc 575 also introduced comm slot included later lc models well may 1994 set performa variants introduced performa 575 577 578 machines identical except amount ram hdd size software packages included performa variants include clarisworks 2.0 quicken 4.0 grolier encyclopedia 1993 time magazine almanac ease educational titles david pogue described machine enthusiastically received mac fans appreciated crisp color screens speedy performance rich sound upgradability power macs line lc variant succeeded macintosh lc 580 performa variants sold 580 discontinued lc 580 performa variants available outside united states model favorite motherboard donor wishing upgrade color classic faster class processor apple also offered upgrade path form powerpc macintosh processor upgrade introduced february 1994 introduced may 1994 macintosh lc 580 sold april 1995 may 1996 like lc 575 built around motorola 68lc040 processor running 33 mhz however instead using sized scsi-only logic boards based lc 475/quadra 605 like lc 575 580 uses larger logic board performa 630 meant changes leading lower prices also lower performance notably hard drives 580 ide drives instead scsi drives also video ram longer mounted simm used 1 mb 4 mb main ram soldered motherboard lastly trinitron display 575 replaced cheaper shadow mask screen causing slight change plastic case surrounding crt one benefit change ability accommodate video capture tv tuner cards designed performa 630 allowed lc 580 users watch record video essentially performing function television well computer lc 580 lc 630 dos compatible introduced time last macintosh desktop systems built around motorola 68000-series processor replacement power macintosh 5200 lc features powerpc processor apple also offered upgrade path 580 form powerpc macintosh processor upgrade 580 also upgraded following logic boards 5200 lc 6200 5260 5300 6300 5400 6400 5500 6500 introduced april 3 1995 introduced april 13 1995 introduced may 1 1995 central processing unit motorola 68lc040 33 mhz 8 kb l1 cache memory 8 mb expandable 52 mb 2 72-pin simms 1 mb 4 mb ram soldered mainboard used video ram storage hard drive 250 mb 500 mb ide floppy drive 1.44 mb superdrive read 400 kb 800 kb diskettes well cd-rom 4x applecd unit expansion 1 lc pds 1 comm slot display 14″ color crt supports 32,768 colors | [
7697,
4114,
6165,
11289,
7706,
8222,
1057,
6183,
1576,
4139,
7211,
8253,
1090,
4180,
10838,
10840,
8806,
6258,
10357,
4220,
10365,
10878,
6783,
7299,
4741,
8842,
6283,
7824,
147,
7830,
6807,
4258,
7842,
7844,
7869,
8893,
8896,
4807,
4810,
... | Test |
9,313 | 4 | Usability_of_web_authentication_systems:usability web authentication systems usability web authentication systems refers efficiency user acceptance online authentication systems examples web authentication systems passwords federated identity systems e.g google oauth 2.0 facebook connect mozilla persona email-based single sign-on sso systems e.g saw hatchet qr code-based systems e.g snap2pass webticket system used authenticate user identity web even though usability web authentication systems key consideration selecting system web authentication systems passwords subjected formal usability studies analysis web authentication system needs usable possible whilst compromising security needs ensure system needs restrict access malicious users whilst allowing access authorised users authentication system sufficient security malicious users could easily gain access system hand authentication system complicated restrictive authorised user would able want use strong security achievable system even secure authentication system undermined users system often referred weak links computer security users tend inadvertently increase decrease security system system usable security could suffer users try minimize effort required provide input authentication writing passwords paper usable system could prevent happening users likely oblige authentication requests systems important e.g online banking opposed less important systems e.g forum user visits infrequently mechanisms might ignored users accept security measures certain point becoming annoyed complicated authentication mechanisms important factor usability web authentication system thus convenience factor user around preferred web authentication system web applications password despite poor usability several security concerns widely used system usually contains mechanisms intended increase security e.g requiring users high entropy passwords lead password systems less usable inadvertently less secure users find high entropy passwords harder remember application creators need make paradigm shift develop usable authentication systems take user ’ needs account replacing ubiquitous password based systems usable possibly secure systems could lead major benefits owners application users measure usability web authentication system one use usability–deployability–security uds framework standard metric system usability scale uds framework looks three broad categories namely usability deployability security web authentication system rates tested system either offering offering specific benefit linked one categories authentication system classified either offering offering specific benefit within categories usability deployability security measuring usability web authentication systems allow formal evaluation web authentication system determine ranking system relative others lot research regarding web authentication system currently done tends focus security usability future research evaluated formally usability using comparable metric technique enable comparison various authentication systems well determining whether authentication system meets minimum usability benchmark found security experts tend focus security less usability aspects web authentication systems problematic needs balance security system ease-of-use study conducted 2015 found users tend prefer single sign-on like provided google facebook based systems users preferred systems found fast convenient use single sign-on based systems resulted substantial improvements usability security sso reduces need users remember many usernames passwords well time needed authenticate thereby improving usability system usability become important applications move online require robust reliable authentication systems usable secure use brainwaves authentication systems proposed possible way achieve however research usability studies required | [
3941,
2558,
7368,
6761,
5433,
7994,
5373,
6750,
10207
] | Test |
9,314 | 7 | Dew_computing:dew computing dew computing information technology paradigm combines core concept cloud computing capabilities end devices personal computers mobile phones etc. used enhance experience end user comparison using cloud computing dew computing attempts solve major problems related cloud computing technology reliance internet access dropbox example dew computing paradigm provides access files folders cloud addition keeping copies local devices allows user access files times without internet connection connection established files folders synchronized back cloud server term dew computing used information technology first appeared 2015 literature since become field cloud-dew architecture proposed possible solution offline data accessibility problem first scope included web applications broader applications later proposed dew computing model derived original concept cloud computing models also emerged cloud computing including fog computing edge computing dew computing others proponents claim novel models dew computing provide better experiences users cloud computing provides universal access scalability however resources far user control occasionally causes problems classic cloud computing paradigm internet connection servers lost user unable access data dew computing aims solve problem information technology paradigm dew computing seeks use capabilities personal computers along cloud services reliable manner key features dew computing independence collaboration independence means local device must able provide service without continuous connection internet collaboration means application must able connect cloud service synchronize data appropriate use word dew reflects natural phenomena clouds far ground fog closer ground dew ground analogically cloud computing remote service fog computing beside user dew computing user end establish cloud-dew architecture pc dew virtual machine dvm needed dvm isolated environment executing dew server local pc consists least three components dew server ds data analytics server das artificial intelligence dew aid dew computing categories classified based application field dew computing faces number technical challenges including issues related power management processor utility data storage factors impacting use dew computing viability operation system network model communication model programming principles dew recommended engine local dew network personal high productivity database security behaviors browser | [
4194,
4964,
3366,
4623,
7248,
2901,
7802,
119,
9112,
154,
8413
] | Test |
9,315 | 9 | Peter_Naur:peter naur peter naur 25 october 1928 – 3 january 2016 danish computer science pioneer turing award winner last name n bnf notation backus–naur form used description syntax programming languages contributed creation algol 60 programming language naur began career astronomer received phd degree 1957 encounter computers led change profession 1959 1969 employed regnecentralen danish computing company time giving lectures niels bohr institute technical university denmark 1969 1998 naur professor computer science university copenhagen main areas inquiry design structure performance computer programs algorithms areas software engineering software architecture also pioneered naur book computing human activity 1992 collection contributions computer science rejected formalist school programming views programming branch mathematics like associated backus–naur form attributed donald knuth said would prefer called backus normal form naur married computer scientist christiane floyd naur disliked term computer science suggested called datalogy data science former term adopted denmark sweden datalogi latter term used data analysis including statistics databases since middle 1960s computer science practiced denmark peter naur term datalogy science data processes starting regnecentralen university copenhagen copenhagen tradition computer science developed special characteristics means close connection applications fields knowledge tradition least visible area education comprehensive project activity integral part curriculum thus presenting theory aspect realistic solutions known primarily actual experience peter naur early recognized particular educational challenges presented computer science innovations shown quality vitality also universities close connection computer science training formed copenhagen university view computer science characterized peter naur research later years quite outspoken pursuit science whole naur possibly identified empiricist school tells one shall seek deeper connections things manifest world keep observable facts attacked certain strands philosophy psychology viewpoint also developing theory human thinking called synapse-state theory mental life naur 2005 acm a.m. turing award work defining algol 60 programming language particular role editor influential report algorithmic language algol 60 pioneering use bnf recognized naur dane turing award naur died 3 january 2016 short illness numbers refer published bibliography naur published large number articles chapters astronomy computer science issues society classical music psychology education | [
512,
7048,
11020,
4877,
1947,
10668,
1841,
2482,
1976,
4799,
4800,
10049,
4930,
10560,
70,
8262,
3529,
1610,
1611,
1883,
7775,
4201,
11242,
2283,
2798,
1783,
511
] | Validation |
9,316 | 1 | Data_pack:data pack data pack fact pack pre-made database fed software software agents internet bots chatterbots teach information facts later look words data pack used feed minor updates system common data packs may include abbreviations acronyms dictionaries lexicons technical data country codes rfcs filename extensions tcp udp port numbers country calling codes data packs may come formats csv sql easily parsed imported database management system database may consist key-value pair like association list data packs commonly used within gaming industry provide minor updates within games user downloads update game downloading loads data packs contain updates game minor bug fixes additional content example data pack used update game found references data pack datapack definition similar data packet contains loads information data stores within pack data compressed reduce file size certain programs read data pack therefore data packed vital know whether receiving program able unpack data example data packs able effective deliver information found reference page refer word data pack come many forms mobile data pack mobile data pack refers add-on enable boost amount data use mobile phone rate use data also monitored know much data left mobile data service provides similar service wi-fi allows connect internet purpose data pack increase amount data mobile access example mobile data pack found references | [
4576,
6208,
10413,
6993,
2901
] | Test |
9,317 | 4 | Elias_Levy:elias levy elias levy also known aleph one computer scientist moderator bugtraq full disclosure vulnerability mailing list may 14 1996 october 15 2001 cto co-founder computer security company securityfocus acquired symantec august 6 2002 also known author article smashing stack fun profit published 1996 phrack magazine issue 49 first high-quality public step-by-step introduction stack buffer overflow vulnerabilities exploitation sale securityfocus symantec august 2002 levy accused many selling compromising high principles bugtraq list full-disclosure mailing list founded part protest sale | [
9569,
1474,
6754,
8368,
4562,
4117
] | None |
9,318 | 4 | SoftEther_VPN:softether vpn softether vpn free open-source cross-platform multi-protocol vpn client vpn server software developed part daiyuu nobori master thesis research university tsukuba vpn protocols ssl vpn l2tp/ipsec openvpn microsoft secure socket tunneling protocol provided single vpn server released using gplv2 license january 4 2014 license switched apache license 2.0 january 21 2019 softether vpn supports nat traversal making useful run vpn servers computers behind residential gateways facility routers firewalls firewalls performing deep packet inspection unable detect softether vpn transport packets vpn tunnel https used camouflage connection softether vpn optimizes performance using full ethernet frame utilization reducing memory copy operations parallel transmission clustering together reduce latency normally associated vpn connections increasing throughput softether vpn server vpn bridge run windows linux os x os x 10.8 freebsd solaris operating systems softether vpn client runs windows linux macos softether vpn server serves softether vpn protocol also serves openvpn microsoft secure socket tunneling protocol sstp ssl vpn etherip l2tpv3 ipsec serves mobile devices running ios android windows phone via l2tp/ipsec vpn clients endpoints supporting vpn protocols may also used includes many routers cisco juniper linksys dd-wrt asus others softether vpn server implements vpn server function listens accepts connections vpn client vpn bridge several vpn protocols vpn server several virtual hubs virtual layer-3 switches virtual hub full layer-2 ethernet packet-switching functions like physical ethernet switch additionally virtual hub configured define ip packet filter entries filter packets virtual hub virtual layer-3 switch layer-3 ip static routing functions like physical router vpn server local bridges local bridge layer-2 packet-switching fabric physical ethernet network-adapter virtual hub administrator defines local bridge virtual hub existing corporate network build remote-access vpn server site-to-site vpn server softether vpn client vpn client program virtualized function ethernet network adapter computer installed softether vpn client establish vpn connection vpn server since vpn server support multiple vpn protocols l2tp/ipsec ms-sstp vpn vpn users required install softether vpn client client computers user uses l2tp/ipsec ms-sstp vpn connect vpn server built-in vpn client programs operating system used establish vpn vpn server however softether vpn client advanced functions e.g detailed vpn communication settings os built-in vpn clients exploit full performance softether vpn server recommended install softether vpn client client computer softether vpn bridge vpn program building site-to-site vpn build site-to-site vpn network system administrator install softether vpn server central site install softether vpn bridge one remote sites vpn bridge connects central vpn server cascade connection cascade connection similar virtualization uplink connection cross-cable connection two physical ethernet switches gui tool administrative tool softether vpn server softether vpn bridge program runs windows linux wine system administrator installs gui tool laptop pc makes connect remote vpn server vpn bridge administration connection made ssl session management commands transported rpc ssl vpncmd cui administrative tool softether vpn server client bridge program runs consoles every supported operating systems user unable use windows linux wine user alternatively use vpncmd manage vpn programs vpncmd also useful execute batch operation creating many users virtual hub creating many virtual hubs vpn server parts architecture softether vpn different typical traditional ipsec-based vpn systems virtual hub software-emulated virtual ethernet switch learns maintains forwarding-database table inside traditional physical ethernet switches implement function hardware softether vpn implements function software vpn server several virtual hubs virtual hub isolated virtual hub performs packet-switching concurrently connected vpn sessions realize communication vpn clients vpn bridges several virtual hubs single instance vpn server virtual hubs isolated security different administrator delegated privilege correspondent virtual hub administrator virtual hub define user-objects acls limited delegated virtual hub virtual network adapter software-emulated virtual ethernet adapter vpn client create several virtual network adapters client computer vpn user establish vpn session virtual network adapter destination virtual hub remote vpn server vpn session established vpn user communicate remote vpn network virtual network adapter since virtual network adapter works physical one applications operating system components used without modification virtual layer-3 switch software-emulated virtual ip router several virtual layer-3 switches created single vpn server instance virtual layer-3 switch virtual ip interfaces connected virtual hubs also several static routing table entries virtual layer-3 switch useful make large-scale site-to-site vpn network although easy way make site-to-site vpn network build layer-2 bridging based vpn number computers huge number broadcasting packets increase load inter-site links prevent scaling problem vpn administrator isolates ip networks virtual layer-3 switch administrator define cascade connection local remote virtual hubs cascade connection established originally-isolated two ethernet segments combined single ethernet segment therefore cascade connection function used build site-to-site layer-2 ethernet bridging since virtual hubs virtual network adapters software-emulated virtual ethernet devices ethernet packets virtual devices communicate physical ethernet devices therefore bridge virtual physical necessary build remote-access vpn site-to-site vpn make bridge local bridge function exchanges ethernet packets virtual hub physical ethernet network adapter combine isolated ethernet segments single ethernet segment defining local bridge softether vpn server vpn client connect vpn server communicate existing ethernet devices e.g servers network equipment local bridge called remote-access vpn network administrator sets remote-site vpn bridge defines two local bridges vpn server vpn bridge defines cascade connection vpn server vpn bridge remote two ethernet segments connected directly layer-2 ethernet level called site-to-site vpn one key features softether vpn transparency firewalls proxy servers nats network address translators softether vpn supports ssl-vpn nat traversal softether vpn uses https protocol order establish vpn tunnel https http ssl protocol uses tcp/ip port 443 may vary destination user chooses ssl-vpn protocol vpn client vpn server softether vpn server vpn client use parallel transmission mechanism improve throughput ssl-vpn tunnel user set number concurrent parallel transmission channels 1 32 environment slow delaying network performance tuning result faster throughput function enabled logical vpn session consist several tcp https connections packets added one appropriate tcp connections calculations optimizing modules packet losses detected tcp connection logical vpn session new packet use another healthy vpn connection fast-switching optimization determine processing tcp connection enables high throughput traditional vpn systems require user ask firewall administrator company open endpoint tcp udp port firewall nat border company internet order reduce necessity open endpoint firewall softether vpn server nat traversal function nat traversal enabled default long enabled softether vpn client computers connect vpn server behind firewall nat special settings firewall nat necessary very-restricted networks permit pass icmp dns packets network tcp udp filtered icmp dns permitted order make possible establish softether vpn client-server session via very-restricted network softether vpn vpn icmp vpn dns function function powerful penetrate restricted firewall vpn packets encapsulated icmp dns packets transmit firewall receiver-side endpoint extracts inner packet capsuled packet useful exploiting public wi-fi public wi-fi pass icmp dns packets filter tcp udp packets vpn server installed home office advance going outdoors enjoy protocol-free network communication using restricted network vpn gate plugin softether vpn allows users connect free vpn servers run volunteers use softether host vpn servers volunteers use personal computers servers vpn gate sponsored university tsukuba | [
2050,
10631,
10889,
4746,
8331,
9722,
8211,
5402,
11162,
3742,
9764,
8998,
4268,
7983,
10417,
7859,
2228,
823,
3770,
8640,
3777,
9281,
2884,
5959,
8265,
11468,
3792,
7376,
11606,
2136,
9048,
6490,
8283,
5084,
6364,
10210,
7139,
8039,
11248,... | Test |
9,319 | 4 | Computer_forensics:computer forensics computer forensics also known computer forensic science branch digital forensic science pertaining evidence found computers digital storage media goal computer forensics examine digital media forensically sound manner aim identifying preserving recovering analyzing presenting facts opinions digital information although often associated investigation wide variety computer crime computer forensics may also used civil proceedings discipline involves similar techniques principles data recovery additional guidelines practices designed create legal audit trail evidence computer forensics investigations usually subjected guidelines practices digital evidence used number high-profile cases becoming widely accepted reliable within u.s. european court systems early 1980s personal computers became accessible consumers leading increased use criminal activity example help commit fraud time several new computer crimes recognized cracking discipline computer forensics emerged time method recover investigate digital evidence use court since computer crime computer related crime grown jumped 67 2002 2003 today used investigate wide variety crime including child pornography fraud espionage cyberstalking murder rape discipline also features civil proceedings form information gathering example electronic discovery forensic techniques expert knowledge used explain current state digital artifact computer system storage medium e.g hard disk cd-rom electronic document e.g email message jpeg image scope forensic analysis vary simple information retrieval reconstructing series events 2002 book computer forensics authors kruse heiser define computer forensics involving preservation identification extraction documentation interpretation computer data go describe discipline art science indicating forensic methodology backed flexibility extensive domain knowledge however several methods used extract evidence given computer strategies used law enforcement fairly rigid lack flexibility found civilian world court computer forensic evidence subject usual requirements digital evidence requires information authentic reliably obtained admissible different countries specific guidelines practices evidence recovery united kingdom examiners often follow association chief police officers guidelines help ensure authenticity integrity evidence voluntary guidelines widely accepted british courts computer forensics used evidence criminal law since mid-1980s notable examples include computer forensic investigations usually follow standard digital forensic process phases acquisition examination analysis reporting investigations performed static data i.e acquired images rather live systems change early forensic practices lack specialist tools led investigators commonly working live data number techniques used computer forensics investigations much written many techniques used law enforcement particular seizing evidence machine still active information stored solely ram recovered powering may lost one application live analysis recover ram data example using microsoft cofee tool windd windowsscope prior removing exhibit captureguard gateway bypasses windows login locked computers allowing analysis acquisition physical memory locked computer ram analyzed prior content power loss electrical charge stored memory cells takes time dissipate effect exploited cold boot attack length time data recoverable increased low temperatures higher cell voltages holding unpowered ram −60 °c helps preserve residual data order magnitude improving chances successful recovery however impractical field examination tools needed extract volatile data however require computer forensic lab maintain legitimate chain evidence facilitate work machine necessary law enforcement applies techniques move live running desktop computer include mouse jiggler moves mouse rapidly small movements prevents computer going sleep accidentally usually uninterruptible power supply ups provides power transit however one easiest ways capture data actually saving ram data disk various file systems journaling features ntfs reiserfs keep large portion ram data main storage media operation page files reassembled reconstruct ram time number open source commercial tools exist computer forensics investigation typical forensic analysis includes manual review material media reviewing windows registry suspect information discovering cracking passwords keyword searches topics related crime extracting e-mail pictures review several computer forensics certifications available isfce certified computer examiner digital forensics investigation professional dfip iacrb certified computer forensics examiner top vendor independent certification especially within eu considered ccfp certified cyber forensics professional others worth mention usa apac iacis international association computer investigative specialists offers certified computer forensic examiner cfce program isfcs international society forensic computer examiners® offers certified computer examiner cce program asian school cyber laws offers international level certifications digital evidence analysis digital forensic investigation courses available online class room mode many commercial based forensic software companies also offering proprietary certifications products example guidance software offering ence certification tool encase accessdata offering ace certification tool ftk passmark software offering oce certification tool osforensics x-ways software technology offering x-pert certification software x-ways forensics | [
8320,
3330,
6916,
2437,
8580,
10372,
7560,
2953,
778,
2193,
2194,
5010,
4500,
1941,
8469,
9109,
3099,
6684,
9630,
1312,
6177,
7458,
7968,
5284,
3109,
9762,
6443,
3629,
11182,
7983,
9392,
10290,
5427,
4789,
4408,
7160,
1978,
8635,
9145,
24... | Test |
9,320 | 2 | BSD_licenses:bsd licenses bsd licenses family permissive free software licenses imposing minimal restrictions use distribution covered software contrast copyleft licenses share-alike requirements original bsd license used namesake berkeley software distribution bsd unix-like operating system original version since revised descendants referred modified bsd licenses bsd license class license generally referred bsd-like modified bsd license wide use today similar license originally used bsd version unix bsd license simple license merely requires code retain bsd license notice redistributed source code format reproduce notice redistributed binary format bsd license unlike licenses require source code distributed addition original 4-clause license used bsd several derivative licenses emerged also commonly referred bsd license today typical bsd license 3-clause version revised original 4-clause version bsd licenses following codice_1 organization codice_2 codice_2 codice_4 year copyright published bsd codice_2 regents university california codice_1 university california berkeley releases bsd prior adoption 4-clause bsd license used license clearly ancestral 4-clause bsd license releases include 4.3bsd-tahoe 1988 net/1 1989 although largely replaced 4-clause license license found 4.3bsd-reno net/2 4.4bsd-alpha original bsd license contained clause found later licenses known advertising clause clause eventually became controversial required authors works deriving bsd-licensed work include acknowledgment original source advertising material clause number 3 original license text clause objected grounds people changed license reflect name organization led escalating advertising requirements programs combined together software distribution every occurrence license different name required separate acknowledgment arguing richard stallman stated counted 75 acknowledgments 1997 version netbsd addition clause presented legal problem wishing publish bsd-licensed software relies upon separate programs using gnu gpl advertising clause incompatible gpl allow addition restrictions beyond already imposes gpl publisher free software foundation recommends developers use license though states reason use software already using today original license sometimes called bsd-old 4-clause bsd advertising clause removed license text official bsd william hoskins director office technology licensing uc berkeley bsd distributions removed clause many similar clauses remain bsd-derived code sources unrelated code using derived license original license sometimes referred bsd-old resulting 3-clause version sometimes referred bsd-new names include new bsd revised bsd bsd-3 3-clause bsd version vetted open source license osi bsd license free software foundation refers license modified bsd license states compatible gnu gpl fsf encourages users specific referring license name i.e simply referring bsd license bsd-style avoid confusion original bsd license version allows unlimited redistribution purpose long copyright notices license disclaimers warranty maintained license also contains clause restricting use names contributors endorsement derived work without specific permission even simplified version come use primarily known usage freebsd use early april 29 1999 likely well primary difference new bsd 3-clause license omits non-endorsement clause also adds disclaimer views opinions expressed software free software foundation refers license freebsd license states compatible gnu gpl addition fsf encourages users specific referring license name i.e simply referring bsd license bsd-style modified/new bsd license avoid confusion original bsd license projects netbsd use similar 2-clause license without additional disclaimer version vetted open source license osi simplified bsd license isc license functionally equivalent endorsed openbsd project license template new contributions formerly known free public license 1.0.0 bsd 0-clause license spdx 0bsd goes 2-clause license dropping requirements include copyright notice license text disclaimer either source binary forms freebsd project argues advantages bsd-style licenses companies commercial use-cases due license compatibility proprietary licenses general flexibility stating bsd-style licenses place minimal restrictions future behavior n't legal time-bombs unlike copyleft licenses bsd license allows proprietary use allows software released license incorporated proprietary products works based material may released proprietary license closed source software allowing usual commercial usages 3-clause bsd license like permissive licenses compatible almost foss licenses well proprietary licenses two variants license new bsd license/modified bsd license 3-clause simplified bsd license/freebsd license 2-clause verified gpl-compatible free software licenses free software foundation vetted open source licenses open source initiative original 4-clause bsd license accepted open source license although original considered free software license fsf fsf consider compatible gpl due advertising clause bsd license family one oldest broadly used license family foss ecosystem also many new licenses derived inspired bsd licenses many foss software projects use bsd license instance bsd os family freebsd etc google bionic toybox bsd 3-clause license ranked popularity number five according black duck software sixth according github data | [
10752,
7684,
10761,
9738,
1036,
2061,
8718,
9743,
10255,
7185,
8725,
4636,
9245,
5663,
3618,
546,
1574,
1064,
3114,
10284,
5677,
7223,
1080,
2105,
5177,
9783,
10813,
6718,
6207,
3651,
7748,
2117,
3654,
5703,
9798,
8266,
1101,
8781,
10317,
... | Test |
9,321 | 3 | DisplayID:displayid displayid vesa standard metadata describing display device capabilities video source designed replace e-edid standard edid structure v1.4 displayid standard initially released december 2007 version 1.1 released march 2009 followed version 1.2 released august 2011 version 1.3 released june 2013 current version 2.0 released september 2017 displayid uses variable-length structures 256 bytes encompass existing edid extensions well new extensions 3d displays embedded displays wide color gamut hdr eotf displayid format includes several blocks describe logical parts display video interfaces display device technology timing details manufacturer information data blocks identified unique tag length block variable fixed specific number bytes base data block mandatory extension blocks optional variable structure based cea edid extension block version 3 first defined cea-861-b displayid standard freely available royalty-free implement version 2.0 introduces new generalized information blocks primarily intended ultrahd high dynamic range hdr displays lcd computer monitors lcd/oled televisions native support bt.2020 color space pq/hlg transfer functions also makes optional predefined crt/lcd timings dmt cea-861 standards switching formula-based structures follow vesa cvt-rb gtf base displayid 2.0 variable-length structure data blocks data block starts mandatory block tag revision number 0-7 payload length 0-248 bytes variable length 251 bytes following blocks currently defined codice_1 product identification block contains standard vendor product ids serial number date manufacture product name comparing legacy block codice_2 microsoft isa plug play identifier replaced ieee oui first used network mac address codice_3 display parameters block contains basic parameters viewable area size pixel count supported color depth factory calibrated rgb color space white point luminance gamma transfer function comparing legacy block codice_4 color calibration values moved block codice_5 max/min luminance values added display size specified 1 mm increments addition default 0.1 mm codice_6 detailed timing block type vii defines cta-861 compatible timings based pixel rate block based type vi block codice_7 codice_8 type viii enumerated timing code block based type iv dmt id block codice_9 provides one-byte two-byte video mode codes defined vesa display monitor timings standard video information codes defined cta-861 hdmi codice_10 type ix formula-based timings block based type v short timings block codice_11 codice_12 dynamic video timing range block based block codice_13 video timing range limits new version allows precise definition pixel rate 1 khz steps adds indication variable refresh rates codice_14 display interface features block describes color depth dynamic range transfer function supported display controller based blocks codice_15 display interface features codice_5 color characteristics codice_17 stereo display interface block based block codice_18and describes stereoscopic 3d/vr modes i.e timings codes stereo frame formats supported display codice_19 tiled display topology block describes displays consist multiple physical display panels driven separate video interface based block codice_20 codice_21 container id block defines unique identifier used associate additional devices may present multifunctional display codice_22 vendor-specific data includes proprietary parameters supported displayid 2.0 structures codice_23 cta displayid block provides information cta-861 edid timings version 1.3 information blocks 0x10-0x1f borrow heavily edid 1.4 standard designed previous generation crt/lcd/dlp/pdp displays following block types defined note indicated difference similar/superseding structures version 2.0 shown sections codice_2 product identification superseded codice_1 difference codice_4 display parameters superseded codice_3 differences codice_5 color characteristics superseded codice_3 display parameters codice_30 type detailed timings superseded codice_6 type vii detailed timings differences codice_32 type ii detailed timings block provides compressed structure less precise pixel coordinates reduced blank intervals comparing type codice_33 type iii short timings block provides short compressed structure uses formula-based cvt timings codice_9 type iv short timing dmt id code block uses video mode codes defined vesa display monitor timings standard well video information codes defined cta-861 hdmi superseded codice_8 enumerated timing codice_11 type v short timings block based type iii short timings block 0x05 provides greater pixel precision supports cvt-rb superseded codice_10 type ix formula-based timings codice_7 type vi detailed timing block supports higher precision pixel clock high-resolution timings block based type block 0x03 allows greater timings precision using 1 khz steps instead 10 khz superseded codice_6 type vii detailed timings codice_40 video timing range limits block describes displays capable variable timings superseded codice_12 dynamic video timings range codice_42 display device data block provides information display panel characteristics embedded applications display technology panel type pixel response times display interface features block superseded codice_14 display interface features data blocks described codice_44 serial number data block provides product serial number ascii string codice_45 general purpose ascii string block provides general purpose text strings may required specific applications codice_46 interface power sequencing block defines display interface signal timings required entering exiting sleep mode codice_47 transfer characteristics block defines detailed gamma curves according vesa display transfer characteristic data block dtcdb standard may required byte 1 codice_5 color characteristics block codice_18 stereo display interface block describes stereoscopic 3d/vr modes superseded codice_17 stereo display interface codice_20 tiled display topology data block defines multi-panel displays superseded codice_19 tiled display topology codice_53 vendor specific block defines proprietary vendor data | [
9057,
3548,
11631,
4567
] | Test |
9,322 | 3 | Manic_Miner:manic miner manic miner platform video game originally written zx spectrum matthew smith released bug-byte 1983 later re-released software projects first game miner willy series among early titles platform game genre game inspired atari 8-bit family game miner 2049er since ported numerous home computers video game consoles mobile phones time stand-out features included in-game music sound effects high replay value colourful graphics well designed graphical limitations zx spectrum spectrum video display allowed background foreground colours exchanged automatically without software attention animated load screen appears swap words manic miner manipulation feature spectrum first game in-game music playing required constant cpu attention thought impossible achieved constantly alternating cpu time music game results music stuttery rhythm in-game music hall mountain king edvard grieg music henrik ibsen play peer gynt music plays title screen arrangement blue danube twenty caverns one screen size several flashing objects player must collect willy oxygen supply runs player collected objects one cavern must go now-flashing portal take next cavern player must avoid enemies listed cassette inlay ... poisonous pansies spiders slime worst manic mining robots ... move along predefined paths constant speeds willy also killed falling far players must time precision jumps movements prevent falls collisions enemies extra lives gained every 10,000 points game ends player either lives left completes twenty caverns escapes open air final portal garden right house white picket fence red car parked front left slope leading backyard pond tree white animal resembling cat mouse watches sun set behind pond upon gaining freedom miner willy simply walks right screen never looking back differences bug-byte software projects versions scroll-text attract mode different reflect new copyright also several cosmetic changes although gameplay remains manic miner placed number 25 sinclair official top 100 spectrum games time voted number 6 readers top 100 games time issue winner golden joystick award best arcade style game computer video games magazine march 1983 edition placed third game year 1983 competition game included 97 polygon 500 best games time list official ports exist commodore 64 commodore 16 amstrad cpc bbc micro dragon 32/64 commodore amiga oric 1 game boy advance msx sam coupé mobile phones unofficial ports exist ibm pc compatibles windows dos linux apple macintosh atari st zx81 trs-80 color computer sony playstation nintendo 64 neo geo pocket color acorn archimedes orao z88 pmd 85 hp48 microsoft zune acorn atom commodore 128 sam coupé version programmed matthew holt like zx original requires pixel-perfect timing graphics audio latter františek fuka greatly updated addition original twenty caverns forty additional caverns included release levels designed david ledbury winners competition run sam computers ltd although sam coupé broadly spectrum clone avoided spectrum original limitations colour graphics spectrum pixels could many colours 8 horizontally adjacent pixels within span character block one two colours manic miner port made use removal restriction detailed use colour visibly character sprites version scored 84 sinclair 88 crash game ported czechoslovak computers pmd 85 1985 authors pmd 85 version vít libovický daniel jenne made accurate could bbc micro version solar power generator instead containing completely different room called meteor shower reflecting machines solar power generator beam light instead meteors descend top screen disintegrate hit platforms like skylabs skylab landing bay also forcefields turn layout completely different also last screen still called final barrier complex difficult unlike spectrum version considered fairly easy completely different layout also features blinking forcefields amstrad version effectively spectrum version software projects except eugene lair renamed eugene layout final barrier completely different similar spectrum version bbc version dragon 32 version programmed roy coates two extra rooms i.e 22 altogether cheat mode accessed typing p p penguin retain resolution original dragon version used pmode 4 black/white mode z88 port functionality cheats bug-byte software projects versions levels even background music hp 48 series version somewhat limited low resolution screen size scrolling area rather displaying level whole makes difficult port previously mastered another version otherwise fairly loyal zx spectrum version sound somewhat different sounding colour omitted obvious hardware reasons game play remains similar despite awkward platform commodore 16 version limited number respects mainly due initial lack developer material c16 machine two-week deadline produce test game generate master tape duplication house issues related lack fast loader system c16 cassette deck result took seven minutes game load bug resulted game entering first screen soon tape finished loading instead waiting user start game issues related lack music game sound way video memory mapped c16 resulted number screens removed load time video mapping could correctly handled version game released xbox 360 xbox live indie game name manic miner 360 21st june 2012 sequel manic miner jet set willy followed jet set willy ii software projects also released game style manic miner commodore vic-20 called perils willy addition quite unofficial sequels remakes homages updates released even day including zx81 version homage loading screen appeared one episode 2005 british sitcom nathan barley | [
4973,
6797,
823,
7536,
9006,
10862,
10931,
1527,
8415
] | Test |
9,323 | 9 | StepTalk:steptalk steptalk official gnustep scripting language framework represents separate scriptable servers applications single object environment meant independent programming language used default language smalltalk running objective-c runtime steptalk ported mac os x goal steptalk provide environment gluing applications together provide framework communication users objects applications major goals default scripting language steptalk smalltalk smalltalk simple language easy learn basic principles user must know able use language similar natural language smalltalk uses similar approach objective-c language used gnustep steptalk works platform gnustep works ports native macos cocoa framework developed various contributors | [
5409,
9345,
10470,
11625,
7983,
8303,
8304,
9780,
1112,
3323,
862,
511
] | None |
9,324 | 2 | Aptitude_(software):aptitude software aptitude front-end apt debian package manager displays list software packages allows user interactively pick packages install remove especially powerful search system utilizing flexible search patterns initially created debian appeared rpm package manager rpm based distributions well conectiva aptitude based ncurses computer terminal library provides interface incorporates elements commonly seen graphical user interfaces guis pull-down menus addition ncurses interface aptitude provides extensive command-line interface cli even though aptitude one executable file provides command-line functions similar apt- family tools apt-get apt-cache apt-listchanges etc. aptitude also emulates apt-get command-line arguments allowing act full replacement apt-get past recommended aptitude apt-get used interchangeably longer true programs correctly track share common list packages automatically installed satisfy dependencies aptitude created 1999 time two terminal-based apt-like front-ends available dselect program used manage packages debian since apt created console-apt program project considered heir apparent dselect aptitude created experiment object-oriented programming design used console-apt hope would result flexible program broader set features first public release aptitude version 0.0.1 november 18 1999 limited ability view list available packages could actually download install packages version 0.0.4a ability added many improvements version included debian 2.2 code name potato late 2000 whole user interface module rewritten new architecture created based libsigc++ callback library concepts modern widget toolkits gtk+ qt enabled interface become much similar guis previously features pull-down menus pop-up dialogs one aptitude unusual features tiny implementation minesweeper added time first official aptitude release following rewrite 0.2.0. aptitude 0.2.11.1 released debian 3.0 woody time console-apt project renamed deity effectively abandoned maintainers removed woody aptitude also ported jailbroken ios part cydia package manager aptitude states unlike advanced packaging tool super cow powers apt-get super cow powers found issuing command apt-get moo however aptitude issuing moo give user prompt saying easter eggs however issuing aptitude -v moo aptitude -vv moo user see series statements denying super cow powers telling go away ending picture reference antoine de saint-exupéry little prince unlike original apt-get easter egg different versions program different sequences addition package description states aptitude also y2k-compliant non-fattening naturally cleansing housebroken | [
10760,
7181,
7188,
8213,
8727,
6680,
4123,
5670,
3131,
3649,
10817,
3654,
1107,
3667,
6227,
4192,
3685,
6257,
1138,
5755,
7293,
2180,
11410,
10900,
6301,
4775,
7847,
6828,
3245,
5819,
190,
2239,
9407,
6361,
741,
231,
7913,
7920,
9971,
280... | None |
9,325 | 4 | Slashdot_effect:slashdot effect slashdot effect also known slashdotting occurs popular website links smaller website causing massive increase traffic overloads smaller site causing slow even temporarily become unavailable name stems huge influx web traffic would result technology news site slashdot linking websites original circumstances changed flash crowds slashdot reported 2005 diminishing due competition similar sites general adoption elastically scalable cloud hosting platforms effect associated websites metablogs fark digg drudge report imgur reddit twitter leading terms farked drudged reddit effect —or receiving hug death site question google doodles link search results doodle topic also result high increases traffic search results page typically less robust sites unable cope huge increase traffic become unavailable – common causes lack sufficient data bandwidth servers fail cope high number requests traffic quotas sites maintained shared hosting services often fail confronted slashdot effect flash crowd generic term without using specific name describes network phenomenon network host suddenly receives lot traffic sometimes due appearance website blog news column according jargon file term slashdot effect refers phenomenon website becoming virtually unreachable many people hitting site mentioned interesting article popular slashdot news service later extended describe similar effect listed popular site similar generic term flash crowd appropriate term term flash crowd coined 1973 larry niven science fiction short story flash crowd predicted consequence inexpensive teleportation would huge crowds materializing almost instantly sites interesting news stories twenty years later term became commonly used internet describe exponential spikes website server usage passes certain threshold popular interest effect anticipated years earlier 1956 alfred bester novel stars destination reddit effect also used describe viral crowd fundraising efforts addition surge web traffic sites slashdot digg reddit stumbleupon fark consist brief submitted stories self-moderated discussion story typical submission introduces news item website interest linking response large masses readers tend simultaneously rush view referenced sites ensuing flood page requests readers exceed site available bandwidth ability servers respond render site temporarily unreachable major news sites corporate websites typically engineered serve large numbers requests therefore normally exhibit effect websites fall victim may hosted home servers offer large images movie files inefficiently generated dynamic content e.g many database hits every web hit even web hits requesting page websites often became unavailable within minutes story appearance even comments posted occasionally paying slashdot subscribers access stories non-paying users rendered site unavailable even story posted general readership definitive numbers exist regarding precise magnitude slashdot effect estimates put peak mass influx page requests anywhere several hundred several thousand hits per minute flood usually peaked article top site front page gradually subsided story superseded newer items traffic usually remained elevated levels article pushed front page could take 12 18 hours initial posting however articles significantly longer lifetimes due popularity newsworthiness interest linked article 2005 reporters commenting slashdot effect diminishing however effect seen involving twitter popular users mention website targeted website community-based structure term also refer secondary effect large group new users suddenly set accounts start participate community cases considered good thing others viewed disdain prior members quite often sheer number new people brings many unwanted aspects slashdot along trolling vandalism newbie-like behavior bears similarity 1990s usenet concept eternal september many solutions proposed sites deal slashdot effect several systems automatically mirror slashdot-linked pages ensure content remains available even original site becomes unresponsive sites process slashdotted may able mitigate effect temporarily redirecting requests targeted pages one mirrors slashdot mirror sites links servers endorse third party solution mirroring content may constitute breach copyright many cases cause ad revenue lost targeted site | [
7488,
225,
3428,
8582,
3688,
2409,
11274,
10126,
4725,
3350,
119,
6550,
11674,
1723,
2076,
10270
] | Validation |
9,326 | 4 | Penelope_Endersby:penelope endersby penelope penny endersby british researcher academic specialising armour explosives appointed chief executive met office december 2018 prior led cyber information systems defence science technology laboratory endersby grew north london educated haberdashers aske school girls elstree studied natural sciences university cambridge member newnham college remains associate newnham became interested materials science metallurgy sponsored british gas researching fuel cells graduating joined royal armament research development establishment 1993 endersby researcher specialising armour explosives served royal armament research development establishment becoming uk expert electric intelligent armours appointed department manager defence science technology laboratory 2009 began focus c4isr cyber security holds royal academy engineering visiting professorship university southampton endersby made division head cyber information systems division defence science technology laboratory 2015 involved international women day celebrations joined council institute physics 2017 endersby appointed chief executive met office december 2018 first woman fill role serves board ploughshare innovations ministry defence united kingdom technology transfer office endersby expert choir singer two children interested wildlife records uk phenology trustee wiltshire wildlife trust | [] | Test |
9,327 | 0 | Aikuma:aikuma aikuma android app collecting speech recordings time-aligned translations app includes text-free interface consecutive interpretation designed users literate aikuma grand prize open source software world challenge 2013 aikuma means meeting place usarufa papuan language software first used 2012 aikuma developed sponsorship national science foundation including 101,501 us project use mobile telephones collect larger amounts data undocumented endangered languages would never possible usual fieldwork aikuma modified version lig-aikuma used collecting substantial quantities audio remote indigenous villages modified version app called lig-aikuma developed université grenoble alpes lig laboratory implements new features elicitation speech text images videos | [
1890,
5677,
7983
] | Test |
9,328 | 2 | Smart_tag_(Microsoft):smart tag microsoft smart tags early selection-based search feature found later versions microsoft word beta versions internet explorer 6 web browser application recognizes certain words types data converts hyperlink also included microsoft office programs well visual web developer selection-based search allows user invoke online service page using mouse microsoft initially intended technology built windows xp operating system changed plans due public criticism smart tags integrated instances user might benefit added formatting assistance part microsoft control technology presented special shortcut menu listing options paste autocorrect date person name addresses among others flag entered information accordingly smart tags work actions recognizers latter checks whether information entered user included list smart tag terms action associated executed accessed dedicated smart tag button smart tags enabled microsoft word attempts recognize certain types data document example dates names automatically makes text smart tag visually indicated purple dotted underline clicking smart tag selection-based search command bring list possible actions data type example microsoft word words john smith would recognized personal name smart tagged list actions available clicked might open contact schedule meeting add contacts insert address word version 2010 smart tag auto-recognition person name smart tag features longer available within web browser smart tag technology passes way web page underlines words pre-programmed react inserts hyperlinks selecting smart tag like many selection-based search commands involved hover followed mouse click keyboard commands required invoke search click takes destination specified smart tag developer without knowledge permission web site proprietor early tests almost links offered sites products microsoft affiliates smart tags also generated third parties example company might contract technology firm develop set smart tags actions specific products services product names automatically recognized linked actions check quantity stock check price security vendors feared smart tags could used propagating viruses user tracking data collection purposes might violate user privacy another concern could used negative harmful ways linking political candidate name website negative advertising sites response criticism microsoft removed technology windows xp operating system made feature could turned ie office xp however microsoft revisited concept smart tags later versions internet explorer 8 implemented selection-based search feature called internet explorer 8 accelerators unlike smarttags feature automatically parsed page looking text interest accelerators relied upon user select text accelerator applied accelerators interface open developers accelerators included default use microsoft affiliates products could replaced within category another provider desired smart tags also included email sms text messages windows phone example dates email messages automatically recognized tapped opens window allows appointment created date field already filled | [
5765,
11144,
9609,
7690,
2059,
6028,
790,
6171,
7713,
11683,
10026,
10282,
10029,
7983,
11060,
440,
10808,
2632,
460,
9167,
9808,
11223,
8281,
2777,
603,
7523,
1904,
5619,
2046
] | Test |
9,329 | 2 | Tom_Rolander:tom rolander thomas alan rolander american entrepreneur engineer developer multitasking multiuser operating system mp/m created microcomputers 1979 working first employee digital research gary kildall father cp/m cp/m mp/m laid groundwork later digital research operating system families concurrent cp/m concurrent dos multiuser dos also developed cp/net 2013 granted 2013 diamond award entrepreneurial excellence university washington uw | [
10113,
6921,
8075,
3216,
2840,
2201,
2729,
7849,
11562,
7983,
178,
4409,
7999,
4548,
10067,
10083,
5220,
2672,
3056,
4337,
9332,
4727,
11513,
6778
] | Validation |
9,330 | 9 | High-level_programming_language:high-level programming language computer science high-level programming language programming language strong abstraction details computer contrast low-level programming languages may use natural language elements easier use may automate even hide entirely significant areas computing systems e.g memory management making process developing program simpler understandable using lower-level language amount abstraction provided defines high-level programming language 1960s high-level programming languages using compiler commonly called autocodes examples autocodes cobol fortran first high-level programming language designed computers plankalkül created konrad zuse however implemented time original contributions largely isolated developments due world war ii aside language influence superplan language heinz rutishauser also degree algol first significantly widespread high-level language fortran machine-independent development ibm earlier autocode systems algol defined 1958 1960 committees european american computer scientists introduced recursion well nested functions lexical scope also first language clear distinction value name-parameters corresponding semantics algol also introduced several structured programming concepts while-do if-then-else constructs syntax first described formal notation – backus–naur form bnf roughly period cobol introduced records also called structs lisp introduced fully general lambda abstraction programming language first time high-level language refers higher level abstraction machine language rather dealing registers memory addresses call stacks high-level languages deal variables arrays objects complex arithmetic boolean expressions subroutines functions loops threads locks abstract computer science concepts focus usability optimal program efficiency unlike low-level assembly languages high-level languages language elements translate directly machine native opcodes features string handling routines object-oriented language features file input/output may also present one thing note high-level programming languages languages allow programmer detached separated machine unlike low-level languages like assembly machine language high-level programming amplify programmer instructions trigger lot data movements background without knowledge responsibility power executing instructions handed machine programmer high-level languages intend provide features standardize common tasks permit rich debugging maintain architectural agnosticism low-level languages often produce efficient code optimization specific system architecture abstraction penalty cost high-level programming techniques pay unable optimize performance use certain hardware n't take advantage certain low-level architectural resources high-level programming exhibits features like generic data structures operations run-time interpretation intermediate code files often result execution far operations necessary higher memory consumption larger binary program size reason code needs run particularly quickly efficiently may require use lower-level language even higher-level language would make coding easier many cases critical portions program mostly high-level language hand-coded assembly language leading much faster efficient simply reliably functioning optimised program however growing complexity modern microprocessor architectures well-designed compilers high-level languages frequently produce code comparable efficiency low-level programmers produce hand higher abstraction may allow powerful techniques providing better overall results low-level counterparts particular settings high-level languages designed independent specific computing system architecture facilitates executing program written language computing system compatible support interpreted jit program high-level languages improved designers develop improvements cases new high-level languages evolve one others goal aggregating popular constructs new improved features example scala maintains backward compatibility java means programs libraries written java continue usable even programming shop switches scala makes transition easier lifespan high-level coding indefinite contrast low-level programs rarely survive beyond system architecture written without major revision engineering 'trade-off 'abstraction penalty examples high-level programming languages active use today include python visual basic delphi perl php ecmascript ruby c java many others terms high-level low-level inherently relative decades ago c language similar languages often considered high-level supported concepts expression evaluation parameterised recursive functions data types structures assembly language considered low-level today many programmers might refer c low-level lacks large runtime-system garbage collection etc basically supports scalar operations provides direct memory addressing therefore readily blends assembly language machine level cpus microcontrollers assembly language may regarded higher level often still one-to-one used without macros representation machine code supports concepts constants limited expressions sometimes even variables procedures data structures machine code turn inherently slightly higher level microcode micro-operations used internally many processors three general modes execution modern high-level languages note languages strictly interpreted languages compiled languages rather implementations language behavior use interpreting compiling example algol 60 fortran interpreted even though typically compiled similarly java shows difficulty trying apply labels languages rather implementations java compiled bytecode executed either interpreting java virtual machine jvm compiling typically just-in-time compiler hotspot jvm moreover compiling transcompiling interpreting strictly limited description compiler artifact binary executable il assembly alternatively possible high-level language directly implemented computer – computer directly executes hll code known high-level language computer architecture – computer architecture designed targeted specific high-level language burroughs large systems target machines algol 60 example | [
512,
5634,
3587,
7684,
7173,
9224,
3594,
4107,
5651,
4121,
3613,
9245,
547,
556,
5677,
10796,
5680,
9780,
1591,
2105,
6718,
10819,
8262,
5703,
1610,
9804,
2638,
9331,
3705,
9345,
2691,
3716,
10387,
8854,
4770,
1702,
4777,
682,
9391,
692,
... | Test |
9,331 | 9 | Low-level_programming_language:low-level programming language low-level programming language programming language provides little abstraction computer instruction set architecture—commands functions language map closely processor instructions generally refers either machine code assembly language word low refers small nonexistent amount abstraction language machine language low-level languages sometimes described close hardware programs written low-level languages tend relatively non-portable low-level languages convert machine code without compiler interpreter – second-generation programming languages use simpler processor called assembler – resulting code runs directly processor program written low-level language made run quickly small memory footprint equivalent program high-level language less efficient use memory low-level languages simple considered difficult use due numerous technical details programmer must remember comparison high-level programming language isolates execution semantics computer architecture specification program simplifies development low-level programming languages sometimes divided two categories first generation second generation machine code language computer process directly without previous transformation currently programmers almost never write programs directly machine code requires attention numerous details high-level language handles automatically furthermore requires memorizing looking numerical codes every instruction extremely difficult modify true machine code stream raw usually binary data programmer coding machine code normally codes instructions data readable form decimal octal hexadecimal translated internal format program called loader toggled computer memory front panel although programs written machine language programmers often become adept reading working core dumps debugging front panel example function hexadecimal representation 32-bit x86 machine code calculate n th fibonacci number second-generation languages provide one abstraction level top machine code early days coding computers like tx-0 pdp-1 first thing mit hackers write assemblers assembly language little semantics formal specification mapping human-readable symbols including symbolic addresses opcodes addresses numeric constants strings typically one machine instruction represented one line assembly code assemblers produce object files link object files loaded assemblers provide macros generate common sequences instructions example fibonacci number calculator x86 assembly language using masm syntax code example hardware features x86 processor registers named manipulated directly function loads input precise location stack 8 bytes higher location stored esp stack pointer performs calculation manipulating values eax ebx ecx edx registers finished returns note assembly language concept returning value result stored eax register ret command simply moves code processing code location stored stack usually instruction immediately one called function author calling code know function stores result eax retrieve x86 assembly language imposes standard returning values function fact concept function calling code examine state procedure returns needs extract value compare function c code similar structure assembly language example significant differences terms abstraction abstractions make c code compilable without modification architecture c compiler written x86 assembly language code specific x86 architecture late 1960s high-level languages pl/s bliss bcpl extended algol burroughs large systems c included degree access low-level programming functions one method inline assembly assembly code embedded high-level language supports feature languages also allow architecture-dependent compiler optimization directives adjust way compiler uses target processor architecture | [
512,
9345,
2691,
3587,
8454,
8966,
6664,
9224,
9739,
9996,
5395,
5651,
5527,
9626,
3613,
1952,
5793,
4770,
10145,
1702,
5415,
7462,
5165,
5677,
5040,
5680,
9780,
1591,
9911,
10680,
3386,
4410,
2620,
191,
10819,
6596,
1349,
8262,
9668,
992... | Test |
9,332 | 4 | IFolder:ifolder ifolder open-source application developed novell inc. intended allow cross-platform file sharing across computer networks ifolder operates concept shared folders folder marked shared contents folder synchronized computers network either directly computers peer-to-peer fashion server intended allow single user synchronize files different computers example work computer home computer share files users example group people collaborating project core ifolder actually project called simias simias actually monitors files changes synchronizes changes controls access permissions folders actual ifolder clients including graphical desktop client web client developed separate programs communicate simias back-end originally conceived developed pgsoft company taken novell 2000 ifolder announced novell march 19 2001 released june 29 2001 software package windows nt/2000 novell netware 5.1 included forthcoming novell netware 6.0 also included ability access shared files web browser ifolder professional edition 2 announced march 13 2002 released month later added support linux solaris web access support windows ce palm os edition also designed share files millions users large companies increased reporting features administrators 2003 ifolder codie award march 22 2004 purchase linux software companies ximian suse novell announced releasing ifolder open source project gpl license also announced open source version ifolder would use mono framework effort ease development ifolder 3.0 released june 22 2005 march 31 2006 novell announced ifolder enterprise server open source april 2 2009 novell released ifolder 3.7.2 included mac client 10.4 10.5 well windows vista client addition improved client lineup version supports ssl ldapgroup support auto-account creation ifolder merge enhanced web access administration ifolder.com website completely redesigned references earlier versions nov 25 2009 novell released ifolder 3.8 | [
4229,
4490,
6797,
8976,
11029,
10522,
546,
3366,
7983,
823,
3770,
8640,
321,
3791,
3792,
728,
3676,
5085,
3428,
3813,
5612,
7921,
9329,
5749
] | Test |
9,333 | 6 | QFS:qfs qfs quick file system filesystem oracle tightly integrated sam storage archive manager hence often referred sam-qfs sam provides functionality hierarchical storage manager qfs supports volume management capabilities allowing many disks grouped together file system file system metadata kept separate set disks useful streaming applications long disk seeks tolerated sam extends qfs file system transparently archival storage sam-qfs file system may relatively small gigabytes terabytes disk cache backed petabytes tape bulk storage files copied archival storage background transparently retrieved disk accessed sam-qfs supports four archival copies disk tape optical media may stored remote site also running sam-qfs shared qfs adds multi-writer global filesystem allowing multiple machines read write disks concurrently use multi-ported disks storage area network qfs also single-writer/multi-reader mode used share disks hosts without need network connection sam-qfs originally developed lsc inc purchased sun 2001 sun released sam-qfs source code opensolaris project march 2008 sun acquisition oracle continues develop sam-qfs product later oracle renamed sam-qfs oracle hsm oracle hierarchical storage manager | [
5120,
9731,
2564,
6669,
3598,
10257,
9236,
6677,
5142,
8214,
3611,
9249,
9762,
10789,
5158,
5677,
7225,
11323,
8772,
597,
1109,
10327,
10851,
4708,
11363,
9836,
7789,
5233,
631,
6263,
9335,
9343,
7818,
4235,
654,
2193,
2194,
2197,
2710,
2... | None |
9,334 | 4 | Seal_(East_Asia):seal east asia seal east southeast asian context general name printing stamps impressions thereof used lieu signatures personal documents office paperwork contracts art item requiring acknowledgement authorship process started china soon spread across east asia china japan korea currently use mixture seals hand signatures increasingly electronic signatures chinese seals typically made stone sometimes metals wood bamboo plastic ivory typically used red ink cinnabar paste word 印 yìn mandarin japanese korean pronounced specifically refers imprint created seal well appearing combination ideographs words related printing word 印刷 printing pronounced yìnshuā mandarin insatsu japanese colloquial name chop referring kinds seals adapted hindi word chapa malay word cap meaning stamp rubber stamps japan seals hanko historically used identify individuals involved government trading ancient times japanese emperors shōguns samurai personal seal pressed onto edicts public documents show authenticity authority even today japanese citizens companies regularly use name seals signing contract important paperwork chinese emperors families officials used large seals known xǐ later renamed bǎo corresponds great seals western countries usually made jade although hard wood precious metal could also used originally square shape changed rectangular form song dynasty reverted square qing dynasty important seals heirloom seal realm created first emperor china qin shi huang seen legitimising device embodying symbolising mandate heaven heirloom seal passed several dynasties lost beginning ming dynasty partly explains qing emperors obsession creating numerous imperial seals emperors official use alone forbidden city beijing collection 25 seals order reduce significance heirloom seal seals typically bore titles offices rather names owners different seals could used different purposes example qianlong emperor number informal appreciation seals used select paintings collection popular style script government seals imperial eras china song dynasty qing dynasty nine-fold script highly stylised script unreadable untrained government republic china taiwan continued use traditional square seals 13 centimetres side known variety names depending user hierarchy part inaugural ceremony president republic china includes bestowing seal republic china seal honor people republic china seal central people government 1949 1954 square bronze seal side lengths 9 centimetres inscription reads seal central people government people republic china notably seal uses relatively modern song typeface rather ancient seal scripts seal called yìn xǐ nod modernity government seals people republic china today usually circular shape five-pointed star centre circle name governmental institution arranged around star semicircle many classes personal seals denotes person name equivalent today email signature contain person personal philosophy literary inclination shape ranging ovals dragon-shaped carry name person private studio 書齋 literati ancient china although probably lesser forms less rectangular shape two types seal paste depending base material made standard colour vermilion red lighter darker shades red colours used black navy etc specific purposes plant-based paste tends dry quickly silk-based pastes plant extract hold onto oil tightly silk depending paper used plant pastes dry 10 15 minutes absorbent paper faster dries paper absorbs oil also plant pastes tend smudge easily silk pastes due loose binding agent paste kept covered used original container plastic ceramic kept environment away direct sunlight away intense heat prevent drying paste silk based pastes need stirred spatula every month avoid oil sinking drying paste well prepare use good paste would produce clear impression one go impression clear requiring impressions indicates paste either dry cinnabar depleted seal pressed onto printing surface procedure differs according plant silk based paste silk based paste user applies pressure often specially made soft flat surface beneath paper plant based paste user simply applies light pressure lifting seal vertically away imprint may rip damage paper seal usually lifted one side time bent page image may blotted piece paper make dry faster although may smudge usually needs pile soft felt paper paper imprinted clear seal impression many people china possess personal name seal artists scholars collectors intellectuals may possess full set name seals leisure seals studio seals well-made seal made semi-precious stones cost 400 4000 yuan seals still used official purposes number contexts collecting parcels registered post name seal serves identification akin signature banks traditionally method identification also seal seals remain customary form identification cheques mainland china taiwan hong kong signatures required today personal identification often hand signature accompanied seal imprint seals serve identification signatures difficult forge compared forging signature owner access seal seals also often used chinese calligraphy works chinese paintings usually imprinted works order top bottom name seal leisure seal studio seal owners collectors paintings books often add studio seals pieces collected practice act appreciation towards work artworks seals inscriptions owner example qianlong emperor many 20 different seals use inscriptions paintings collected provided tastefully done example obscuring body painting appropriate inscription fine calligraphy etc practice devalue painting could possibly enhance giving provenance especially seal famous celebrated individual possessed work point seals usually carved specialist seal carvers users specialist carvers carve user name stone one standard scripts styles described usually fee hand people take carving seals using soapstone fine knives widely available cheaper paying professional expertise craft material results vary possible individuals carve perfectly legitimate seals novelty souvenir seal carvers also ply tourist business chinatowns tourist destinations china often carve on-the-spot translations foreign names inexpensive soapstone sometimes featuring roman characters though seals functional typically nothing curios may inappropriate serious use could actually devalue deface serious works art determining side seal face may done number ways carving top front face user inscription side face left user dot side face away user seals used much paste possible wiped printing surface edges suitable material seals kept constant environment especially seals made sandalwood black ox horn tall thin seals best kept sides case wobble fall important seals authority society seals encased wrapped golden silk cloth add protection japan seals general referred inkan comprehensive term hanko tends refer seals used less important documents first evidence writing japan hanko dating ad 57 made solid gold given ruler nakoku emperor guangwu han called king na gold seal first emperor trusted vassals held hanko symbol emperor authority noble people began using personal hanko 750 samurai began using sometime feudal period samurai permitted exclusive use red ink modernization began 1870 hanko came general use throughout japanese society government offices corporations usually inkan specific bureau company follow general rules outlined jitsuin following exceptions size comparatively large measuring across handles often extremely ornately carved friezes mythical beasts hand-carved hakubun inscriptions might quotes literature names dates original poetry privy seal japan example weighing 3.55 kg measuring 9.09 cm size used official purposes emperor seals carved square tunnels handle underside specific person slide inkan hollow thus signing document name business bureau name seals usually stored jitsuin -style boxes high security except official ceremonies displayed extremely ornate stands boxes personal use least four kinds seals order formal/official least jitsuin ginkō-in mitome-in gagō-in officially registered seal registered seal needed conduct business important legally binding events jitsuin used purchasing vehicle marrying purchasing land size shape material decoration lettering style jitsuin closely regulated law example hiroshima jitsuin expected roughly usually square rarely rectangular never round irregular oval must contain individual full family given name without abbreviation lettering must red white background shubun roughly equal width lines used throughout name font must one several based ancient historical lettering styles found metal woodcarving ancient forms ideographs commonplace red perimeter must entirely surround name decoration underside working surface seal top sides handle seal may decorated fashion completely undecorated historical animal motifs dates names inscriptions throughout japan rules governing jitsuin design stringent design unique vast majority people entrust creation jitsuin professional paying upward us 20 often closer us 100 using decades people desirous opening new chapter lives—say following divorce death spouse long streak bad luck change career—will often new jitsuin made material usually high quality hard stone far less frequently deerhorn soapstone jade sometimes carved machine carved hand intō seal-engraving blade mirror small specialized wooden vice used intō flat-bladed pencil-sized chisel usually round octagonal cross-section sometimes wrapped string give handle non-slip surface intō held vertically one hand point projecting one fist side opposite one thumb new modern intō range price less us 1 us 100 jitsuin kept secure place bank vault hidden carefully one home 're usually stored thumb-sized rectangular boxes made cardboard covered heavily embroidered green fabric outside red silk red velvet inside held closed white plastic deerhorn splinter tied lid passed fabric loop attached lower half box superficial resemblance coffins 're often called coffins japanese enthusiasts hanko boutiques paste usually stored separately used specifically banking ginkō means bank person savings account passbook contains original impression ginkō-in alongside bank employee seal rules size design vary somewhat bank bank generally contain japanese person full name westerner may permitted use full family name without abbreviated given name smith bill smith w smith wm smith place william smith lettering red white font artistic decoration people custom-made professionals make hand since mass-produced ginkō-in offer security wood stone carried variety thumb-shape -size cases resembling cloth purses plastic pencil cases usually hidden carefully owner home banks always provide stamp pads ink paste addition dry cleaning tissues banks also provide small plastic scrubbing surfaces similar small patches red artificial grass attached counters used scrub accumulated ink paste working surface customers seals moderately formal seal typically used signing postal deliveries signing utility bill payments signing internal company memos confirming receipt internal company mail low-security everyday functions mitome-in commonly stored low-security high-utility places office desk drawers anteroom genkan residence mitome-in form governed far fewer customs jitsuin ginkō-in however mitome-in adhere handful strongly observed customs size attribute strongly governed social custom usually size american penny smaller male usually slightly larger female junior employee always smaller bosses senior co-workers keeping office social hierarchy mitome-in always person family name usually person given name shita namae often round oval square ones uncommon rectangular ones unheard-of always geometric figures red lettering blank field shubun opposite hakubun borderlines around edges optional plastic mitome-in popular japanese names obtained stationery stores less us 1 though ones made inexpensive stone also popular inexpensive prefabricated seals called prefabricated rubber stamps unacceptable business purposes mitome-in lesser seals usually stored inexpensive plastic cases sometimes small supplies red paste stamp pad included japanese also far less formal seal used sign personal letters initial changes documents referred broadly generic term hanko often display single hiragana kanji ideograph katakana character carved often round oval square vary size women tend small traditionally inkan hanko engraved end finger-length stick stone wood bone ivory diameter carving form calligraphic art foreign names may carved rōmaji katakana hiragana kanji inkan standard japanese names may purchased prefabricated almost every stationery store discount store large book store department store carries small do-it-yourself kits making hanko include instructions hiragana fonts written forward mirror-writing 'd appear working surface seal slim tou chisel two three grades sandpaper slim marker pen draw design stone one three mottled inexpensive soft square green finger-size stones modern japan people several inkan certificate authenticity required hanko used significant business transaction registration certification inkan may obtained local municipal office e.g. city hall person receives certificate seal impression known increasing ease modern technology allows hanko fraud beginning cause concern present system able survive signatures used transactions cases signing cell phone contract may used sometimes addition stamp mitome-in transactions jitsuin official mitome-in alone insufficient thus signatures used chinese style seals also utilized ryūkyū kingdom seal first introduced korea approximately 2nd century bc remaining oldest record usage korea kings buyeo used royal seal oksae 옥새 玉璽 bore inscription seal king ye 濊王之印 예왕지인 use seals became popular three kingdoms korea period case state seals monarchic korea two types use gugin 국인 國印 conferred emperor china korean kings intent keeping relations two countries brothers sadae used communications china coronation kings others generally called eobo 어보 御寶 eosae 어새 御璽 used foreign communications countries china domestic uses declaration establishment republic korea 1948 government created new state seal guksae 국새 國璽 used promulgation constitution designation cabinet members ambassadors conference national orders important diplomatic documents seals also used government officials documents types seals called gwanin 관인 官印 supervised specialist officials modern korea use seals still common koreans personal seals every government agency commercial corporation seals use public documents signing also accepted many koreans think formal use seals public documents 2008 constitutional court south-korea upheld supreme court judgement signed handwritten lacked registered seal invalid personal seals korea classified legal status ingam 인감 印鑑 sirin 실인 實印 meaning registered seal seal registered local office registering seal person issue certificate seal registration required document significant business transactions civil services legal system registered seals introduced japanese colonial government 1914 scheduled completely replaced electronic certification system 2013 order counter fraud ingam still remains official means verification binding legal agreement identification government pass 'act confirmation etc personal signature 본인서명사실 확인 등에 관한 법률 2012 allows pre-registered handwritten signatures legal effect ingam ingam used important business dojangs used everyday purpose less-significant official transactions thus koreans two seals traditional arts like china japan artist chinese calligraphy paintings would use seals generally leisure seals studio seals identify his/her work types seals called nakkwan 낙관 落款 seal-carving considered form art many artists carved seals seals joseon-period calligraphist natural historian kim jung-hee aka wandang chusa considered antiquity korean seals made wood jade sometimes ivory value state seals generally made gold high-quality jade rare cases bronze steel seals exist philippines also sealing culture prior spanish colonization however spaniards succeeded colonizing islands abolished practice burned documents captured natives forcefully establishing roman catholic-based rule records philippine seals forgotten 1970 actual ancient seals made ivory found archaeological site butuan seal known butuan ivory seal declared national cultural treasure seal inscribed word butwan native suyat script discovery seal proved theory pre-colonial filipinos least coastal areas used seals paper discovery seal thought ancient filipinos used bamboo metal bark leaves writing presence paper documents classical era philippines also backed research dr. h. otley beyer father philippine anthropology stating spanish friars 'boasted burning ancient philippine documents suyat inscriptions one reasons ancient documents philippines almost non-existent present time ivory seal housed national museum philippines nowadays younger generations trying revive usage seals notably signing pieces art drawings paintings calligraphy literary works seal used lesser extent vietnam authorised organisations businesses also traditional vietnamese artists common vietnam prior french rule thereafter practice signature became commonality although western-like signatures usually seen less authority corporate situation chinese style seals typically used china japan korea occasionally used outside east asia example rulers ilkhanate mongol khanate established hulagu khan persia used seals containing chinese characters diplomatic letters letter arghun french king philip iv letter ghazan pope boniface viii seals sent emperors yuan dynasty ruling dynasty china mongolia especially kublai khan successor emperor chengzong | [
1496,
5740,
1821,
9576
] | None |
9,335 | 6 | Journaling_file_system:journaling file system journaling file system file system keeps track changes yet committed file system main part recording intentions changes data structure known journal usually circular log event system crash power failure file systems brought back online quickly lower likelihood becoming corrupted depending actual implementation journaling file system may keep track stored metadata resulting improved performance expense increased possibility data corruption alternatively journaling file system may track stored data related metadata implementations allow selectable behavior regard 1990 ibm jfs introduced aix 3.1 one first unix commercial filesystems implemented journaling later 1993 microsoft ntfs filesystem 2001 ext3 implemented journaling updating file systems reflect changes files directories usually requires many separate write operations makes possible interruption like power failure system crash writes leave data structures invalid intermediate state example deleting file unix file system involves three steps crash occurs step 1 step 2 orphaned inode hence storage leak crash occurs steps 2 3 blocks previously used file used new files effectively decreasing storage capacity file system re-arranging steps help either step 3 preceded step 1 crash could allow file blocks reused new file meaning partially deleted file would contain part contents another file modifications either file would show hand step 2 preceded step 1 crash would cause file inaccessible despite appearing exist detecting recovering inconsistencies normally requires complete walk data structures example tool fsck file system checker must typically done file system next mounted read-write access file system large relatively little i/o bandwidth take long time result longer downtimes blocks rest system coming back online prevent journaled file system allocates special area—the journal—in records changes make ahead time crash recovery simply involves reading journal file system replaying changes journal file system consistent changes thus said atomic divisible either succeed succeeded originally replayed completely recovery replayed skipped yet completely written journal crash occurred file systems allow journal grow shrink re-allocated regular file others put journal contiguous area hidden file guaranteed move change size file system mounted file systems may also allow external journals separate device solid-state drive battery-backed non-volatile ram changes journal may journaled additional redundancy journal may distributed across multiple physical volumes protect device failure internal format journal must guard crashes journal written many journal implementations jbd2 layer ext4 bracket every change logged checksum understanding crash would leave partially written change missing mismatched checksum simply ignored replaying journal next remount physical journal logs advance copy every block later written main file system crash main file system written write simply replayed completion file system next mounted crash write logged journal partial write missing mismatched checksum ignored next mount physical journals impose significant performance penalty every changed block must committed twice storage may acceptable absolute fault protection required logical journal stores changes file metadata journal trades fault tolerance substantially better write performance file system logical journal still recovers quickly crash may allow unjournaled file data journaled metadata fall sync causing data corruption example appending file may involve three separate writes metadata-only journal step 3 would logged step 3 done steps 1 2 replayed recovery file appended garbage write cache operating systems sorts writes using elevator algorithm similar scheme maximize throughput avoid out-of-order write hazard metadata-only journal writes file data must sorted committed storage associated metadata tricky implement requires coordination within operating system kernel file system driver write cache out-of-order write hazard also occur device write blocks immediately underlying storage flush write-cache disk due deferred write enabled complicate matters many mass storage devices write caches may aggressively reorder writes better performance particularly common magnetic hard drives large seek latencies minimized elevator sorting journaling file systems conservatively assume write-reordering always takes place sacrifice performance correctness forcing device flush cache certain points journal called barriers ext3 ext4 ufs implementations avoid journaling instead implement soft updates order writes way on-disk file system never inconsistent inconsistency created event crash storage leak recover leaks free space map reconciled full walk file system next mount garbage collection usually done background log-structured file systems write-twice penalty apply journal file system occupies entire storage device structured traversed would normal file system full copy-on-write file systems zfs btrfs avoid in-place changes file data writing data newly allocated blocks followed updated metadata would point new data disown old followed metadata pointing superblock root file system hierarchy correctness-preserving properties journal without write-twice overhead | [
2560,
5120,
2564,
6155,
6669,
3598,
10257,
6675,
7187,
6677,
5142,
8214,
3096,
25,
1049,
3611,
5658,
4637,
10776,
9249,
9762,
4643,
6180,
5158,
8233,
7217,
10803,
9784,
7225,
10809,
11323,
576,
2625,
3648,
8772,
8266,
6221,
5714,
1109,
67... | Train |
9,336 | 4 | Authentication_server:authentication server authentication server provides network service applications use authenticate credentials usually account names passwords users client submits valid set credentials receives cryptographic ticket subsequently use access various services authentication used basis authorization determination whether privilege may granted particular user process privacy keeps information becoming known non-participants non-repudiation inability deny done something authorized done based authentication major authentication algorithms include passwords kerberos public key encryption | [
8674,
7075,
4423,
7368,
10058,
11244,
10863,
6098,
5433,
7804,
1054
] | Test |
9,337 | 2 | Hackintosh:hackintosh hackintosh portmanteau hack macintosh computer runs macos device authorized apple one longer receives official software updates hackintoshing began result apple 2005 transition intel processors away powerpc since 2005 mac computers use x86-64 computer architecture computer manufacturers maintaining binary-code compatibility hackintosh laptops sometimes referred hackbooks .. apple software license macos permits software use computers apple-branded however modern macintosh computers use intel-based hardware limitations keeping software running types intel-based pcs notably companies psystar attempted release products using macos non-apple machines though many hackintosh systems designed solely macos enthusiasts various hacking forums communities methods apple uses prevent macos installed non-apple hardware protected commercial circumvention united states digital millennium copyright act dmca specific changes law regarding concept jailbreaking placed circumvention methods like legal grey area june 6 2005 apple announced plans switch intel processors worldwide developers conference released developer transition kit selected developers cost 999 efforts immediately began attempt run mac os x non-apple hardware developers quickly found error message saying pc hardware configurations supported january 10 2006 apple released 10.4.4 first generation intel-based macs imac macbook pro machines used extensible firmware interface efi platform firmware instead older style bios found x86 motherboards time february 14 2006 initial hack v10.4.4 released internet programmer pseudonym crg92 within hours apple released 10.4.5 update patched author within two weeks april 3 2006 apple released 10.4.6 update patches released within two weeks allowed users install update non-apple computers although include updated kernel 10.4.6 june hackers released 10.4.7 update non-apple computers using 10.4.4 kernel release 10.4.8 update osx86 patches used 10.4.4 kernel rest operating system version 10.4.8 however newer frameworks relied newer kernels led users 10.4.8 encountering many problems apple also started making use sse3 instructions hardware making even difficult users cpus supporting sse2 older pentium 4s get fully compatible system running solve problem hackers community released kernels instructions emulated sse2 equivalents although produced performance penalty throughout years many distros released download internet distros copies mac os x installer disc modified include additional components necessary make os run non-apple hardware prominent member community jas released many distros mac os x tiger containing patched kernels popular distros iatkos kalyway ipc ideneb niresh distros fallen favour osx86 community grew new bootloaders developed made possible use actual copies os x installer early v10.5 build 9a466 community maintained version leopard run non-apple hardware hacker handle brazilmac created one earliest patching processes made convenient users install onto 3rd party hardware using legally obtained retail version apple simplification made brazilmac patch later revisions quickly popular choice many distros five popular builds go name jas kalyway iatkos ipc ideneb although recently builds way boot-132 method described gains popularity however compilations rely work kernel hackers made lorem build 9a466 synthetix builds 9a499 9a527 9a559 toh builds 9a581 9b13 9b18 recently group calling stagexnu called voodoo darwin 9.4.0 contributions trickled various mac osx86 installers readily available internet continue refined updated builds released maintain compatibility apple releases ever-increasing number third-party components osx86 community quick make necessary modifications enable apple latest releases run non-apple hardware within hours leopard release amd/intel sse2/3 kernel patcher created removed hpet requirement original untouched mach_kernel file core component mac os snow leopard released russian hacker netkas created version chameleon boot mac os x v10.6 main problem many people forced modify dsdt use kexts due specific issues soon possible modbin dmitrik released test versions kernel allow boot snow leopard amd machines stable xnu kernels v10.6 released qoopz pcj popular builds based retail name universal intel hazard iatkos since v10.6.2 nawcom qoopz andy vandijck working legacy kernel unsupported cpus apple released developer preview 1 russian hackintosh developer usr-sse2 first created method install lion method consists deploying mac os x v10.7 image flash drive booting via xpc uefi bootloader see duet changes made chameleon source code became possible boot lion updated version chameleon dmitrik also known bronzovka luck creating kernel supported amd systems months 10.7.3 v2 amd support iatkos l2 10.7.2 intel released shortly release developer preview 1 unknown developers managed install version os x pc using modified version chameleon bootloader version released via main project starting version r1997 general public due problems sourced lion era ways installing required patches never made public leaves scene unknown state towards mountain lion since retail release mountain lion several users reported successful setups using installers purchased mac app store along updated versions chameleon tools including distros niresh distro 10.8 intel first released updated 10.8.2 amd intel 10.8.5 uefi support amd intel support versions iatkos ml2 released niresh release multiple new kernels hackintosh 10.9 works although still minor issues kernels aim allow users run mavericks amd older intel cpus lack certain instruction sets latest intel cpus significant efforts made emulate instruction sets like ssse3 present amd k10-based cpus older intel cpus like intel core duo amd latest cpus 'bulldozer architecture onwards contain almost latest instruction sets hence kernels full sse4 support also released two months niresh distro released mavericks supports amd cpus latest intel cpus also custom kernel allows intel atom processors boot mavericks niresh free distro released mavericks since iatkos team decided release mavericks distro specific hardware donation basis initial release os x yosemite 10.10 beta various developers took role updating bootloaders system members osx86 forum insanelymac set update efi bootloader chameleon new os release time later niresh independent osx86 developer released standalone tool known yosemite zone would automatically install new os various features non-apple device minimal input method consisted torrenting os x 10.10 dmg onto usb flash drive macpwn vanilla installation unibeast updated support yosemite distribution yosemite zone released amd processor support vanilla installation yosemite possible via insanelymac pandora box beta 2.0 unibeast type installation uses kexts drivers possible addition using unaltered version os x installation app preferred distributions clover chameleon updated compatible el capitan unibeast macpwn updated support el capitan well since el capitan unibeast multibeast use clover bootloader instead chimera chameleon-based bootloader clover chameleon updated compatible sierra unibeast pandora box macpwn updated support distribution sierra zone 10.12.3 released amd processor support clover macpwn unibeast updated support distro high sierra zone hackintosh zone 10.13 released amd processor support including ryzen cpus clover updated support mojave revision 4514 unibeast also received mojave support intel-based machines apple authorize use mac os x x86 pc ones developed company used technical means although trusted platform module tpm widely mis-reported tie mac os systems distributed developers announcing switch intel chips macos eula forbids installations macos non-apple-branded computer july 3 2008 apple filed lawsuit psystar corporation violating restriction among claims apple claimed psystar violated digital millennium copyright act dmca dodging copy-protection technologies apple uses protect apple employs technological protection measures effectively control access apple copyrighted works specifically apple charged psystar acquiring creating code avoids bypasses removes descrambles decrypts deactivates impairs technological protection measure without apple authority purpose gaining unauthorized access apple copyrighted works brief revealed apple considers methods uses prevent macos installed non-apple hardware protected digital millennium copyright act dmca november 13 2009 court granted apple motion summary judgment found apple copyrights violated well dmca psystar installed apple operating system non-apple computers hearing remedies set december 14 january 14 2009 gadget lab site wired magazine posted video tutorial installing msi wind netbook removed following complaint apple textual instructions remain include eula violation disclaimer may 15 2012 case apple vs. psystar corporation finally ended court ruled psystar violated apple exclusive reproduction right distribution right right create derivative works putting end case copies mac os x tiger started running non-apple hardware found processors unable run os rosetta binary translator made possible run powerpc programs intel processors later kernel required support sse3 instruction set circumvent programmers community released patched kernels included support emulating sse3 instructions using sse2 equivalents october 2005 apple released update 10.4.3 developers required nx bit microprocessor support however patches released circumvent well patched kernels also later released supported amd processors mac os x leopard released october 26 2007 patches created remove hpet requirement kernel efforts also made emulate ssse3 instruction set processors support kernel used os x mavericks made use ssse3 instructions requiring patches extensible firmware interface efi specification defines software interface operating system platform firmware since method generally require copying modification macos considered legal way installing macos non-apple computers despite untested courts early november 2007 group hackers fronted russian hacker known netkas using already modified boot-132 source root david elliot also known dfe developed method emulating efi environment using specially modified darwin bootloader practical terms meant regular pcs meeting minimum set hardware requirements could seen real macintosh computers os allowing use unmodified stock apple kernels long cpu supports thus giving transparent reliable operation several methods real world deployment innovative solution arisen around internet explanation achievement along usage guide provided website digitmemo.com true efi emulation highly sought asset osx86 community previous efforts based upon apple open source darwin project hackintosh gurus allowed users use macos normal pcs patched kernels/kernel modules simply bypassed efi using efi patch hackintosh could boot vanilla unmodified macos kernels use vanilla kernel extensions allowed system compatible future system updates also offered increased stability method also circumvents one aspect apple end user license agreement states modification non-open source components os forbidden mid-2008 new commercial product efi-x released claims allow full simple booting official leopard install disks subsequent install without patching required possibly repackaging boot-132 technology usb-attached device rebel efi another commercial product also seems use open source software thought windows 7 support efi would result pc motherboards replacing bios efi msi announced efinity mainboard early 2008 2011 efi-based computers entered market however none natively boot mac os x due lack hfs+ driver efi implementation boot-132 bootloader provided apple loading xnu kernel mid-2008 new modified boot-132 came scene method allows users conduct leopard-based osx86 installation using stock retail-purchased copy leopard eradicates necessity hacked installation like jas kalyway mentioned previously boot-132 bootloader essentially preloads environment system leopard boot operate bootloader stores necessary files kext files .img collection simply folder luxury new installation method includes ability boot install retail leopard dvd update straight apple without breaking dmca possible problem breaks macos eula bootloader behaves like linux kernel one use mboot-compatible patched syslinux used hack bootloader tells boot-dfe .img file ramdisk initrd known linux users boot-dfe use kexts mkext new boot-dfe tested retail leopard dvd boot install run leopard without build modified dvd since early developer builds mac os x v10.6 members osx86 community booting new operating system using yet another bootloader called pc efi provided russian hacker netkas bootloader voodoo team chameleon chameleon based david elliot boot-132 bootloader supports acpi smbios graphics ethernet injections allows boot macos non-macintosh hardware chameleon supports lot amd well nvidia graphics cards lot branches different developers chameleon currently 2.1 development state fakeefi invented david elliot many years ago operates assumption efi already work leaves activity traces boot-args tables tree efiruntime routines simple form memory starts kernel mach_kernel realefi theoretically flashed instead bios alternatively loadable efi used bios motherboard system invented intel currently active open source development tianocore bootloader named duet capable loading efi designed load mac os x one step needed adapt duet requirements mac os x also newer motherboards already contain efi suitable running macintosh beginning march 2011 slice discussed idea community members resulting development bootloader emulate efi firmware one choice use real uefi firmware boot mac os x march 2007 osx86 community made significant progress development live dvd live dvd allows booting working system mac os x v10.4.8 january 2 2009 insanelymac live dvd team published new method mac os x v10.5.x live dvd could produced allowing users boot fully working macos desktop dvd usb flash drive method reliable previous methods manipulated apple existing netboot imageboot functionalities behaved system running network disk easier produce requiring single script added existing installation distributions live dvd made since inception since notable method shown work normal apple mac hardware also possible run macos virtual machine inside operating systems installed standard pc hardware using virtualization software oracle virtualbox though officially supported oracle likewise also possible install macos vmware software though company states officially supported vmware running apple-labeled computers according apple licensing policies | [
6153,
1042,
7963,
2088,
10153,
5681,
823,
7354,
977,
5844,
3428,
2149,
8676,
231,
1515,
5356,
5358,
499,
11513,
4603,
8700
] | Test |
9,338 | 3 | Static_core:static core static core generally refers microprocessor mpu entirely implemented static logic static core mpu may halted stopping system clock oscillator driving maintaining state resume processing point stopped clock signal restarted long power continues applied static core mpus fabricated cmos process hence consume little power clock stopped making useful designs mpu remains standby mode needed minimal loading power source often battery desirable standby comparison typical microprocessor designs without static core refresh present valid outputs pins specific periods clock cycle clock slowed stopped charge pin leaks capacitors time quickly moving default state longer valid designs run within set range clock frequencies avoid problem static core microprocessors include rca 1802 intel 80386ex wdc w65c02s wdc w65c816s freescale 683xx family many low-power electronics systems designed fully static systems—such example psion organiser trs-80 model 100 galileo spacecraft fully static system processor static core data stored static ram rather dynamic ram design features allow entire system paused indefinitely low power state instantly resumed needed | [
3010,
4244,
3319
] | None |
9,339 | 4 | Generalized_TTL_security_mechanism:generalized ttl security mechanism generalized ttl security mechanism gtsm proposed internet data transfer security method relying packet time live ipv4 hop limit ipv6 thus protect protocol stack spoofing denial service attacks desired purpose proposal verify whether packet originated adjacent node protect router infrastructure overload-based attacks protocols gtsm enabled following procedure performed many people given credit creating idea among paul traina jon stewart similar method also proposed ryan mcdowell | [
2409,
11250,
5469,
5470
] | Test |
9,340 | 2 | VxD:vxd vxd device driver model used microsoft windows/386 386 enhanced mode windows 3.x windows 9x extent also novell dos 7 opendos 7.01 dr-dos 7.02 higher multitasker codice_1 vxds access memory kernel running processes well raw access hardware name vxd abbreviation virtual xxx driver xxx class hardware device derives fact drivers filenames form codice_2 windows 3.x examples vjoyd.386 joystick vmm.386 memory manager vxds usually filename extension codice_3 windows 3.x codice_4 windows 9x vxds written windows 3.x used windows 9x vice versa prior advent windows dos applications would either communicate directly various pieces hardware responding interrupts reading writing device memory etc go dos device driver dos multitasking application would exclusive complete control hardware running though windows applications n't often communicate directly hardware way windows drivers still real standard modes windows 3.x windows/386 onward allowed multiple dos applications execute concurrently executing within virtual machine share physical resources among virtual machines microsoft introduced virtual device drivers drivers solved issues relating conflicting usage physical resources intercepting calls hardware instead machine port representing actual device would represent virtual device could managed operating system although windows 98 introduced windows driver model wdm vxd device drivers used windows 98 windows vxds usable windows nt descendants starting windows 2000 windows nt-based operating systems also use windows driver model windows nt 4 earlier versions must use drivers written specifically using vxd drivers instead wdm drivers windows 9x resulted advanced acpi states like hibernation unavailable vxds confused similarly named ntvdm-specific 'vdds virtual device drivers provide method emulating direct i/o windows nt dos box ntvdm vdds run regular 32-bit user-mode dlls must rely win32 api another wdm driver emulate desired i/o behalf 16-bit program | [
10243,
10769,
9234,
1043,
1055,
2083,
8227,
3109,
1577,
4143,
9263,
11316,
1077,
8246,
4174,
4178,
9813,
4695,
603,
2145,
1656,
5754,
639,
5761,
9348,
5765,
10886,
2183,
5259,
653,
6797,
3224,
4771,
7846,
10414,
178,
8391,
214,
9943,
9434... | Test |
9,341 | 4 | Cylance:cylance cylance inc. software firm develops antivirus programs kinds computer software prevent rather reactively detect viruses malware company based irvine california cylance described “ first company apply artificial intelligence algorithms machine learning cyber security. ” february 2019 company acquired blackberry limited company mission block computer viruses malware effect user computer cylance founded stuart mcclure ryan permeh mcclure previously co-founder foundstone security consultancy sold mcafee 2004 becoming firm chief tech officer mcclure also author hacking exposed reportedly best-selling security book date cylance founding came result mcclure speeches previously given cybersecurity often asked protected computer noted lacked trust security technology since reactive nature meaning cleaned attack consequently mcclure began developing technology based proactive protection initial funding 15 million reported february 2013 another 20 million february 2014 july 2015 report indicated cylance raised additional 42 million investors including draper fisher jurvetson kohlberg kravis roberts dell capitalone teneleven ventures received 100 million june 2016 lead investors blackstone tactical opportunities part blackstone group insight venture partners mcclure stated cylance antivirus product use typical security features unique signatures heuristics behavioral analysis sandboxing virtualization blacklisting rather product uses artificial intelligence identify stop attackers mcclure stated cylance security features similar human brain way identifying threats wherein teaches computers identify indicators attack operation cleaver covert cyberwarfare operation carried iranian government targets around world specifically critical infrastructure entities cylance uncovered operation described report released late 2014 iranian officials rejected cylance conclusions fbi tacitly confirmed may 2016 cylance announced new collaboration motex osaka-based firm integrate motex lanscope endpoint security management cylanceprotect cylance leading product proactively detects prevents malware end product called cylanceprotect cat collaboration brings cylance activities japanese market february 2019 company acquired blackberry limited 1.4 billion march 2018 cylance 2018 mspworld cup award november 2017 linkedin recognized cylance one top companies startups year 2017 october 2017 cylance certified great place work greatplacetowork.com october 2017 cylance recognized cyber security leader 2017 cyber defense magazine september 2017 cylance announced winner gartner peer insights customer choice award endpoint protection platforms gartner inc august 2017 cylance made inc. magazine inc. 5000 list second year row june 2017 cylance special jury award best show security product interop tokyo 2017 june 2017 cylance top product cylanceprotect named best enterprise security solution 2017 sc media awards europe event may 2017 cylance made cnbc disruptor 50 list second year row april 2017 cylance given 5-star rating crn 2017 partner program guide march 2017 cylanceprotect named best endpoint protection product 2016 sans community july 2016 mcclure named orange county entrepreneur year category technology 2016 cylance ranked 23 forbes cloud 100 list | [
2049,
7809,
131,
5891,
1417,
3981,
10637,
410,
1052,
156,
6431,
2721,
5924,
2213,
550,
1318,
6823,
2601,
8614,
2859,
3243,
6699,
8615,
10539,
10872,
6834,
4403,
9523,
10166,
7739,
6271,
704,
7103,
7362,
9408,
9537,
4421,
10308,
202,
1355,... | None |
9,342 | 2 | Gentoo/Alt:gentoo/alt gentoo/alt gentoo linux project created manage porting portage framework features operating systems mac os x free bsds gentoo/alt set pieter van den abeele daniel robbins pieter van den abeele founded gentoo mac os x. gentoo mac os x first non-linux project gentoo focused making gentoo experience available apple operating system introducing portage system separate entity roughly similar fink macports used portage instead debian-like ports-like system later gentoo mac os x made subproject gentoo/alt currently project longer active prime assumption using modifying host os appeared realistic eventually broke packages made hardly maintainable gentoo mac os x superseded gentoo prefix currently gentoo offers mac os x users gentoo/*bsd subproject covers ports bsd-derived operating systems currently consists three sections gentoo/freebsd gentoo/netbsd gentoo/openbsd gentoo/*bsd project umbrella better classify three subprojects often lot similar issues practice decision-making development handled gentoo/alt project subprojects gentoo/freebsd unix-like operating system developed gentoo linux developers order bring gentoo linux design structure tools portage gentoo linux base layout freebsd operating system gentoo gnu toolchain used instead original freebsd one although project longer maintained active gentoo developers instructions allow installation full gentoo/freebsd system freebsd system ebuilds integrated main portage tree port far complete due amount packages needing ported lack proper live cd right freesbie live cd freebsd setup cd used installation current semi official logo gentoo/freebsd daemonized g derived original gentoo linux logo inspired bsd daemon designed marius morawski responding unofficial contest launched diego elio pettenò blog gentoo/netbsd project provide gnu userland managed portage netbsd kernel project started damian florczyk currently x86 architecture targeted system whole incomplete state gentoo/openbsd gentoo/*bsd subproject port gentoo features portage openbsd operating system originally started grant goodyear currently development hiatus iso image based openbsd 3.8 currently maintained karol pasternak downloaded project web site gentoo/dragonflybsd currently unofficial port dragonflybsd kernel project developed robert sebastian gerus unofficial port gnu hurd also developed abandoned late 2006 youngest member gentoo/alt gentoo prefix project emerged gentoo mac os x project suffered multiple practical problems initially allows installation mac os x solaris freebsd linux distributions core principle gentoo prefix installation packages portage done offset thereby leaving host os unmodified side effect administrative privileges required led benda xu gentoo rap android devices installs variant gentoo called gentoo rap directory prefix alongside android linux kernel used android gentoo rap gentoo/interix eprefix port gentoo runs atop interix subsystem windows also known microsoft windows services unix sfu subsystem unix-based applications sua result gentoo/interix project ability install use portage system emerge native windows applications requires visual studio 2008 express edition however feature support wide variety packages supported platforms including interix prefix project mac os x tested supported mac os x tiger leopard snow leopard powerpc ia-32 x86-64 architectures unofficial port solaris operating system portaris announced around 2006 never got public state superseded gentoo prefix project started 2011 google summer code project plan 9 gentoo takes gentoo base overlays userspace inspired plan 9 stated objectives project better hardware support better software support create culture shock people previously used linux systems project presently maintained robert seaton | [
7552,
5380,
9487,
5397,
8725,
10016,
11174,
4775,
7983,
823,
7483,
9151,
9153,
5067,
6361,
3802,
1379,
741,
5356,
3058,
499,
5363,
8700
] | None |
9,343 | 6 | ZFS:zfs zfs combined file system logical volume manager designed sun microsystems zfs scalable includes extensive protection data corruption support high storage capacities efficient data compression integration concepts filesystem volume management snapshots copy-on-write clones continuous integrity checking automatic repair raid-z native nfsv4 acls precisely configured two main implementations oracle openzfs project extremely similar making zfs widely available within unix-like systems zfs name stands nothing—briefly assigned backronym zettabyte file system longer considered initialism originally zfs proprietary closed-source software developed internally sun part solaris team led cto sun storage business unit sun fellow jeff bonwick 2005 bulk solaris including zfs licensed open-source software common development distribution license cddl opensolaris project zfs became standard feature solaris 10 june 2006 2010 sun microsystems acquired oracle zfs became registered trademark belonging oracle oracle stopped releasing updated source code new opensolaris zfs development effectively reverting oracle zfs closed source response illumos project founded maintain enhance existing open source solaris 2013 openzfs founded coordinate development open source zfs openzfs maintains manages core zfs code organizations using zfs maintain specific code validation processes required zfs integrate within systems openzfs widely used unix-like systems 2017 one analyst described openzfs proven open source data-validating enterprise file system management stored data generally involves two aspects physical volume management one block storage devices hard drives sd cards organization logical block devices seen operating system often involving volume manager raid controller array manager suitable device driver management data files stored logical block devices file system data storage zfs unusual unlike storage systems unifies roles acts volume manager file system therefore complete knowledge physical disks volumes including condition status logical arrangement volumes also files stored zfs designed ensure subject suitable hardware data stored disks lost due physical errors misprocessing hardware operating system bit rot events data corruption may happen time complete control storage system used ensure every step whether related file management disk management verified confirmed corrected needed optimized way storage controller cards separate volume file managers achieve zfs also includes mechanism dataset pool level snapshots replication including snapshot cloning described freebsd documentation one powerful features features even file systems snapshot functionality lack large numbers snapshots taken without degrading performance allowing snapshots used prior risky system operations software changes entire production live file system fully snapshotted several times hour order mitigate data loss due user error malicious activity snapshots rolled back live previous file system states viewed even large file systems leading savings comparison formal backup restore processes snapshots also cloned form new independent file systems pool level snapshot known checkpoint available allows rollback operations may affect entire pool structure add remove entire datasets examples features specific zfs include unlike many file systems zfs intended work towards specific aims primary targets enterprise standard data management commercial environments hardware capable supporting zfs capabilities data resilience resources needed serve data efficiently system configuration poorly matched zfs zfs may underperform significantly 2017 zfs benchmarks zfs developers calomel stated common system design failures include zfs acts volume manager file system terminology layout zfs storage covers two aspects many terms particular zfs list covers zfs commands allow examination physical storage terms devices vdevs organized data pools stored across vdevs various ways various commands expose in-depth statistics zfs internal status internal performance/statistics data allow settings optimized physical devices used zfs hard drives hdds ssds organized groups known vdevs virtual devices used store data vdevs fundamental part zfs conceived groups disks provide redundancy failure physical devices vdev must able maintain integrity data holds must contain enough disks risk data loss within acceptably tiny vdev become unreadable due disk errors otherwise entire pool part also fail see data recovery vdev one vdev acts independent unit redundant storage devices might vdev unused spare disks disks formatted non-zfs filing systems offline disks cache devices physical structure pool defined configuring many vdevs type adding pool zfs exposes manages individual disks within system well vdevs pools datasets volumes organized within pool data automatically distributed zfs across vdevs making pool zfs stripes data pool across vdevs pool speed efficiency vdev user defines completely independent every vdev different types vdev mixed arbitrarily single zfs system data redundancy required data protected physical device failure ensured user organize devices vdevs either using mirrored vdev raidz vdev data single device vdev may lost device develops fault data mirrored raidz vdev lost enough disks fail time system resilvered replacements due recent disk failures zfs vdev continue function service capable providing least one copy data stored although may become slower due error fixing resilvering part self-repair data integrity processes however zfs designed become unreasonably slow due self-repair unless directed administrator since one goals capable uninterrupted continual use even self checking self repair since zfs device redundancy vdev level also means pool stored across several vdevs one vdevs completely fails entire pool content lost similar raid redundancy systems require data stored capable reconstruction enough devices ensure data unlikely lost due physical devices failing therefore intended vdevs made either mirrored devices raidz array devices sufficient redundancy important data zfs automatically limit possible avoid data loss device fails backups replication also expected part data protection vdevs manipulated active use single disk additional devices added create mirrored vdev mirrored vdev physical devices added removed leave larger smaller number mirrored devices single device raidz vdev converted mirror although additional vdevs always added expand storage capacity kind including raidz device vdev marked removal zfs de-allocate data allow removed replaced note devices vdev size zfs may use full capacity disks vdev larger others applies devices within single vdev vdevs independent zfs care different vdevs different sizes built different devices also vdev shrunk size common set aside small amount unused space example 1-2gb multi-tb disk disk needs replacing possible allow slight manufacturing variances replace another disk nominal capacity slightly smaller actual capacity addition devices used main data storage zfs also allows manages devices used caching purposes single devices multiple mirrored devices fully dedicated type cache designated cache usage detailed settings fully deleted created modified without limit live use list zfs cache types given zfs handle devices formatted partitions certain purposes common use generally caches data pools given complete devices multiple complete devices top level data management zfs pool zpool zfs system multiple pools defined vdevs used pool specified pool created others added later zfs use specified vdevs maximize performance storing data – form striping across vdevs therefore important ensure vdev sufficiently redundant loss vdev pool would cause loss pool striping zfs pool expanded time adding new vdevs including system 'live storage space vdevs already allocated pool shrunk data stored across vdevs pool even yet full however explained individual vdevs modified time within stated limits new vdevs added time since addition removal mirrors marking redundant disk offline affect ability vdev store data within pools zfs recognizes two types data store since volumes presented block devices also formatted file system add zfs features file system although usual practice example zfs volume created block device presents partitioned formatted file system ext4 ntfs done either locally network using iscsi similar resulting file system accessible normal also gain zfs benefits data resilience data integrity/scrubbing snapshots additional option data compression snapshots integral feature zfs provide immutable read copies file system single point time even large file systems snapshotted many times every hour sustain tens thousands snapshots snapshot versions individual files entire dataset pool easily accessed searched restored entire snapshot cloned create new copy copied separate server replicated backup pool dataset quickly rolled back specific snapshot snapshots also compared current data check modified data.snapshots take much disk space data deleted space marked free data longer referenced current system snapshot snapshots also easy way avoid impact ransomware generally zfs expect reduce size pool tools reduce set vdevs pool stored tools remove vdevs rolled oracle zfs also exist derivatives openzfs yet generally released openzfs platforms generally therefore 2018 remove entire vdev active use reduce size pool data stored must moved another pool temporary copy made easier deleted later restored backups/copies devices making vdev freed use pool deleted recreated using fewer vdevs smaller size additional capacity added pool time simply adding devices needed defining unused devices vdevs adding new vdevs pool capacity individual vdev generally fixed defined one exception rule single drive mirrored vdevs expanded larger smaller capacities without affecting vdev operation adding larger disks replacing/removing smaller disks shown example pool expanded unused space datasets volumes within pool likewise expanded use unused pool space datasets need fixed size dynamically grow data stored volumes block devices need size defined user must manually resized required done 'live resizing example one major feature distinguishes zfs file systems designed focus data integrity protecting user data disk silent data corruption caused data degradation current spikes bugs disk firmware phantom writes previous write make disk misdirected reads/writes disk accesses wrong block dma parity errors array server memory driver since checksum validates data inside array driver errors data winds wrong buffer inside kernel accidental overwrites swapping live file system etc 1999 study showed neither then-major widespread filesystems ufs ext xfs jfs ntfs hardware raid issues data integrity provided sufficient protection data corruption problems initial research indicates zfs protects data better earlier efforts also faster ufs seen replacement within zfs data integrity achieved using fletcher-based checksum sha-256 hash throughout file system tree block data checksummed checksum value saved pointer block—rather actual block next block pointer checksummed value saved pointer checksumming continues way file system data hierarchy root node also checksummed thus creating merkle tree in-flight data corruption phantom reads/writes data written/read checksums correctly actually wrong undetectable filesystems store checksum data zfs stores checksum block parent block pointer entire pool self-validates block accessed regardless whether data meta-data checksum calculated compared stored checksum value checksums match data passed programming stack process asked values match zfs heal data storage pool provides data redundancy internal mirroring assuming copy data undamaged matching checksums optionally possible provide additional in-pool redundancy specifying means data stored twice three times disk effectively halving reducing one third storage capacity disk additionally kinds data used zfs manage pool stored multiple times default safety even default copies=1 setting copies damaged data exist reconstructed checksums parity data zfs use copy data recreate via raid recovery mechanism recalculate checksum—ideally resulting reproduction originally expected value data passes integrity check system update faulty copies known-good data redundancy restored consistency data held memory cached data arc checked default zfs expected run enterprise quality hardware error correcting ram capability check in-memory data exists enabled using debug flags zfs able guarantee data integrity needs multiple copies data usually spread across multiple disks typically achieved using either raid controller so-called soft raid built file system zfs work hardware raid devices zfs usually work efficiently greater protection data raw access storage devices disks connected system using hardware firmware soft raid controller modifies usual zfs-to-disk i/o path zfs relies disk honest view determine moment data confirmed safely written numerous algorithms designed optimize use caching cache flushing disk handling third-party device performs caching presents drives zfs single system without low level view zfs relies upon much greater chance system perform less optimally failure preventable zfs quickly fully recovered zfs example hardware raid card used zfs may able determine condition disks whether raid array degraded rebuilding may know data corruption place data optimally across disks make selective repairs control repairs balanced ongoing use may able make repairs even could usually hardware raid card interfere raid controllers also usually add controller-dependent data drives prevents software raid accessing user data possible read data compatible hardware raid controller n't always possible controller card develops fault replacement may available cards may understand manufacturer custom data needed manage restore array new card therefore unlike systems raid cards similar used offload resources processing enhance performance reliability zfs strongly recommended methods used typically reduce system performance reliability disks must connected raid controller recommended use plain hba host adapter fanout card configure card jbod mode i.e turn raid caching functions allow devices attached zfs-to-disk i/o pathway unchanged raid card jbod mode may still interfere cache depending upon design may detach drives respond time seen many energy-efficient consumer-grade hard drives may require time-limited error recovery tler /cctl/erc-enabled drives prevent drive dropouts cards suitable even raid functions disabled instead hardware raid zfs employs soft raid offering raid-z parity based like raid 5 similar disk mirroring similar raid 1 schemes highly flexible raid-z data/parity distribution scheme like raid-5 uses dynamic stripe width every block raid stripe regardless blocksize resulting every raid-z write full-stripe write combined copy-on-write transactional semantics zfs eliminates write hole error raid-z also faster traditional raid 5 need perform usual read-modify-write sequence stripes different sizes raid-z reconstruction traverse filesystem metadata determine actual raid-z geometry would impossible filesystem raid array separate products whereas becomes feasible integrated view logical physical structure data going metadata means zfs validate every block 256-bit checksum goes whereas traditional raid products usually addition handling whole-disk failures raid-z also detect correct silent data corruption offering self-healing data reading raid-z block zfs compares checksum data disks return right answer zfs reads parity figures disk returned bad data repairs damaged data returns good data requestor raid-z mirroring require special hardware need nvram reliability need write buffering good performance data protection raid-z zfs provides fast reliable storage using cheap commodity disks five different raid-z modes raid-z0 similar raid 0 offers redundancy raid-z1 similar raid 5 allows one disk fail raid-z2 similar raid 6 allows two disks fail raid-z3 raid 7 configuration allows three disks fail mirroring similar raid 1 allows one disk fail need raid-z3 arose early 2000 muti-terabyte capacity drives became common increase capacity without corresponding increase throughput speeds meant rebuilding array due failed drive could take weeks even months complete time older disks array stressed additional workload could result data corruption drive failure increasing parity raid-z3 reduces chance data loss simply increasing redundancy zfs tool equivalent fsck standard unix linux data checking repair tool file systems instead zfs built-in scrub function regularly examines data repairs silent corruption problems differences official recommendation sun/oracle scrub enterprise-level disks month cheaper commodity disks week zfs 128-bit file system address 1.84 × 10 times data 64-bit systems btrfs maximum limits zfs designed large never encountered practice instance fully populating single zpool 2 bits data would require 3×10 tb hard disk drives theoretical limits zfs oracle solaris encryption capability zfs embedded i/o pipeline writes block may compressed encrypted checksummed deduplicated order policy encryption set dataset level datasets file systems zvols created wrapping keys provided user/administrator changed time without taking file system offline default behaviour wrapping key inherited child data sets data encryption keys randomly generated dataset creation time descendant datasets snapshots clones share data encryption keys command switch new data encryption key clone time provided—this re-encrypt already existing data instead utilising encrypted master-key mechanism zfs automatically allocate data storage across vdevs pool devices vdev way generally maximises performance pool zfs also update write strategy take account new disks added pool added general rule zfs allocates writes across vdevs based free space vdev ensures vdevs proportionately less data already given writes new data stored helps ensure pool becomes used situation develop vdevs become full forcing writes occur limited number devices also means data read reads much frequent writes uses different parts data read many disks possible time giving much higher read performance therefore general rule pools vdevs managed new storage added situation arise vdevs pool almost full others almost empty make pool less efficient pools hot spares compensate failing disks mirroring block devices grouped according physical chassis filesystem continue case failure entire chassis storage pool composition limited similar devices consist ad-hoc heterogeneous collections devices zfs seamlessly pools together subsequently doling space needed arbitrary storage device types added existing pools expand size storage capacity vdevs available file system instances zpool quota set limit amount space file system instance occupy reservation set guarantee space available file system instance zfs uses different layers disk cache speed read write operations ideally data stored ram usually expensive therefore data automatically cached hierarchy optimize performance versus cost often called hybrid storage pools frequently accessed data stored ram less frequently accessed data stored slower media solid state drives ssds data often accessed cached left slow hard drives old data suddenly read lot zfs automatically move ssds ram zfs caching mechanisms include one reads writes case two levels caching exist one computer memory ram one fast storage usually solid state drives ssds total four caches number caches cache divisions queues also exist within zfs example vdev data cache arc cache divided data stored user metadata used zfs control balance zfs uses copy-on-write transactional object model block pointers within filesystem contain 256-bit checksum 256-bit hash currently choice fletcher-2 fletcher-4 sha-256 target block verified block read blocks containing active data never overwritten place instead new block allocated modified data written metadata blocks referencing similarly read reallocated written reduce overhead process multiple updates grouped transaction groups zil intent log write cache used synchronous write semantics required blocks arranged tree checksums see merkle signature scheme advantage copy-on-write zfs writes new data blocks containing old data retained allowing snapshot version file system maintained zfs snapshots consistent reflect entire data existed single point time created extremely quickly since data composing snapshot already stored entire storage pool often snapshotted several times per hour also space efficient since unchanged data shared among file system snapshots snapshots inherently read-only ensuring modified creation although relied sole means backup entire snapshots restored also files directories within snapshots writeable snapshots clones also created resulting two independent file systems share set blocks changes made clone file systems new data blocks created reflect changes unchanged blocks continue shared matter many clones exist implementation copy-on-write principle zfs file systems moved pools also remote hosts network send command creates stream representation file system state stream either describe complete contents file system given snapshot delta snapshots computing delta stream efficient size depends number blocks changed snapshots provides efficient strategy e.g. synchronizing offsite backups high availability mirrors pool dynamic striping across devices maximize throughput means additional devices added zpool stripe width automatically expands include thus disks pool used balances write load across zfs uses variable-sized blocks 128 kb default size available features allow administrator tune maximum block size used certain workloads perform well large blocks data compression enabled variable block sizes used block compressed fit smaller block size smaller size used disk use less storage improve io throughput though cost increased cpu use compression decompression operations zfs filesystem manipulation within storage pool easier volume manipulation within traditional filesystem time effort required create expand zfs filesystem closer making new directory volume manipulation systems pools associated zfs file systems moved different platform architectures including systems implementing different byte orders zfs block pointer format stores filesystem metadata endian-adaptive way individual metadata blocks written native byte order system writing block reading stored endianness match endianness system metadata byte-swapped memory affect stored data usual posix systems files appear applications simple arrays bytes applications creating reading data remain responsible way independent underlying system endianness data deduplication capabilities added zfs source repository end october 2009 relevant opensolaris zfs development packages available since december 3 2009 build 128 effective use deduplication may require large ram capacity recommendations range 1 5 gb ram every tb storage accurate assessment memory required deduplication made referring number unique blocks pool number bytes disk ram core required store record figures reported inbuilt commands zpool zdb insufficient physical memory lack zfs cache result virtual memory thrashing using deduplication cause performance plummet result complete memory starvation deduplication occurs write-time also cpu-intensive also significantly slow system storage vendors use modified versions zfs achieve high data compression ratios two examples 2012 greenbytes tegile may 2014 oracle bought greenbytes zfs deduplication replication technology described deduplication usually recommended due heavy resource requirements especially ram impact performance especially writing specific circumstances system data well-suited space-saving technique authors 2010 study examined ability file systems detect prevent data corruption particular focus zfs observed zfs effective detecting correcting data errors storage devices assumes data ram safe prone error study comments single bit flip memory causes small non-negligible percentage runs experience failure probability committing bad data disk varying 0 3.6 according workload zfs caches pages stores copies metadata ram holds data dirty cache writing disk test made whether checksums still match data point use much risk mitigated one two ways zfs protect data disk failure needs configured redundant storage either raid-z mirrored data copied least two disks single disk used redundant copies data enabled duplicates data logical drive far less safe since vulnerable failure single disk using zfs copies good feature use notebooks desktop computers since disks large least provides limited redundancy single drive historically zfs shipped tools fsck repair damaged file systems file system designed self-repair long built sufficient attention design storage redundancy data pool compromised poor hardware inadequate design redundancy unfortunate mishap point zfs unable mount pool traditionally tools allowed end-user attempt partial salvage stored data led threads online forums zfs developers sometimes tried provide ad-hoc help home small scale users facing loss data due inadequate design poor system management modern zfs improved considerably situation time continues zfs part sun solaris operating system thus available sparc x86-based systems oracle solaris 11 express release os/net consolidation main os code made proprietary closed-source zfs upgrades implementations inside solaris encryption compatible non-proprietary implementations use previous versions zfs creating new zfs pool retain ability use access pool non-proprietary solaris-based distributions recommended upgrade solaris 11 express opensolaris snv_134b thereby stay zfs version 28 opensolaris 2008.05 2008.11 2009.06 use zfs default filesystem dozen 3rd-party distributions nearly dozen mentioned openindiana illumos two new distributions included opensolaris distribution reference page openindiana uses openzfs feature flags implemented illumos zfs version 28 used version 151a3 upgrading opensolaris snv_134 openindiana solaris 11 express one also ability upgrade separately boot solaris 11 express zfs pool one install solaris 11 express first zfs incompatibilities introduced oracle past zfs version 28 openzfs osx abbreviated o3x implementation zfs macos o3x active development close relation zfs linux illumos zfs implementation maintaining feature flag compatibility zfs linux o3x implements zpool version 5000 includes solaris porting layer spl originally written maczfs enhanced include memory management layer based illumos kmem vmem allocators o3x fully featured supporting lz4 compression deduplication arc l2arc slog maczfs free software providing support zfs macos stable legacy branch provides zfs pool version 8 zfs filesystem version 2 development branch based zfs linux openzfs provides updated zfs functionality zfs zpool version 5000 feature flags proprietary implementation zfs zevo available cost greenbytes inc. implementing zfs file system version 5 zfs pool version 28 zevo offered limited zfs feature set pending commercial development sold oracle 2014 unknown future plans edward o'callaghan started initial port zfs dragonflybsd netbsd zfs port started part 2007 google summer code august 2009 code merged netbsd source tree paweł jakub dawidek ported zfs freebsd part freebsd since version 7.0 includes zfsboot allows booting freebsd directly zfs volume freebsd zfs implementation fully functional missing features kernel cifs server iscsi latter added using externally available packages samba used provide userspace cifs server freebsd 7-stable updates series versions 7.x committed uses zpool version 6 freebsd 8 includes much-updated implementation zfs zpool version 13 supported zpool version 14 support added 8-stable branch january 11 2010 included freebsd release 8.1. zpool version 15 supported release 8.2 8-stable branch gained support zpool version v28 zfs version 5 early june 2011 changes released mid-april 2012 freebsd 8.3 freebsd 9.0-release uses zfs pool version 28 freebsd 9.2-release first freebsd version use new feature flags based implementation thus pool version 5000 midnightbsd desktop operating system derived freebsd supports zfs storage pool version 6 0.3-release derived code included freebsd 7.0-release update storage pool 28 progress 0.4-current based 9-stable sources around freebsd 9.1-release code trueos formerly known pc-bsd desktop-oriented distribution freebsd inherits zfs support freenas embedded open source network-attached storage nas distribution based freebsd zfs support freebsd pc-bsd zfs guru embedded open source network-attached storage nas distribution based freebsd pfsense open source bsd based router supports zfs including installation booting zfs pools version 2.4 nas4free embedded open source network-attached storage nas distribution based freebsd zfs support freebsd zfs storage pool version 5000 project continuation freenas 7 series project based freebsd kernel debian gnu/kfreebsd zfs support kernel however additional userland tools required possible zfs root /boot file system case required grub configuration performed debian installer since wheezy release 31 january 2013 zpool version available 14 squeeze release 28 wheezy-9 release although zfs filesystem supports linux-based operating systems difficulties arise linux distribution maintainers wishing provide native support zfs products due potential legal incompatibilities cddl license used zfs code gpl license used linux kernel enable zfs support within linux loadable kernel module containing cddl-licensed zfs code must compiled loaded kernel according free software foundation wording gpl license legally prohibits redistribution resulting product derivative work though viewpoint caused controversy one potential workaround licensing incompatibility trialed 2006 experimental port zfs code linux fuse system filesystem ran entirely userspace instead integrated linux kernel therefore considered derivative work kernel approach functional suffered significant performance penalties compared integrating filesystem native kernel module running kernel space 2016 zfs fuse project appears defunct native port zfs linux produced lawrence livermore national laboratory llnl released march 2013 following key events zfs linux uses openzfs pool version number 5000 indicates features supports defined via feature flags pool version unchanging number expected never conflict version numbers given oracle another native port linux developed kq infotech 2010 port used zvol implementation lawrence livermore national laboratory starting point release supporting zpool v28 announced january 2011 april 2011 kq infotech acquired stec inc. work zfs ceased source code port found github work kq infotech ultimately integrated llnl native port zfs linux license incompatibility may arise distribution compiled binaries containing zfs code generally agreed distribution source code affected gentoo configuring zfs root filesystem well documented required packages installed package repository slackware also provides documentation supporting zfs kernel module built kernel question cddl license compatibility gpl license resurfaced 2015 linux distribution ubuntu announced intended make precompiled openzfs binary kernel modules available end-users directly distribution official package repositories 2016 ubuntu announced legal review resulted conclusion providing support zfs via binary kernel module violation provisions gpl license others software freedom law center followed ubuntu conclusion fsf sfc reiterated opposing view ubuntu 16.04 lts xenial xerus released april 21 2016 allows user install openzfs binary packages directly ubuntu software repositories legal challenge brought canonical regarding distribution packages 2019 ubuntu support install zfs root filesystem maas allows zfs installed root filesystem port open source zfs attempted 2010 hiatus one year development ceased 2012 october 2017 new port openzfs announced jörgen lundman openzfs developer summit list operating systems distributions add-ons support zfs zpool version supports solaris build based zfs designed implemented team sun led jeff bonwick bill moore matthew ahrens announced september 14 2004 development started 2001 source code zfs integrated main trunk solaris development october 31 2005 released part build 27 opensolaris november 16 2005 sun announced zfs included 6/06 update solaris 10 june 2006 one year opening opensolaris community name one point said stand zettabyte file system 2006 longer considered abbreviation zfs file system store 256 quadrillion zettabytes zb september 2007 netapp sued sun claiming zfs infringed netapp patents write anywhere file layout sun counter-sued october year claiming opposite lawsuits ended 2010 undisclosed settlement following list events development open-source zfs implementations first indication apple inc. interest zfs april 2006 post opensolaris.org zfs-discuss mailing list apple employee mentioned interested porting zfs mac os x operating system release version mac os x 10.5 zfs available read-only mode command line lacks possibility create zpools write 10.5 release apple released zfs beta seed v1.1 allowed read-write access creation zpools however installer zfs beta seed v1.1 reported work version 10.5.0 updated version 10.5.1 august 2007 apple opened zfs project mac os forge web site site apple provided source code binaries port zfs includes read-write access installer available third-party developer created one october 2009 apple announced shutdown zfs project mac os forge say hosting involvement zfs summarily discontinued explanation given following statement zfs project discontinued mailing list repository also removed shortly apple would eventually release legally required cddl-derived portion source code final public beta zfs code named 10a286 complete zfs support advertised feature snow leopard server mac os x server 10.6 however time operating system released references feature silently removed features page apple commented regarding omission apple 10a286 source code release versions previously released source binaries preserved new development adopted group enthusiasts maczfs project acted quickly mirror public archives apple project materials would disappeared internet resume development elsewhere maczfs community curated matured project supporting zfs mac os releases since 10.5 project active mailing list july 2012 maczfs implements zpool version 8 zfs version 2 october 2008 release solaris additional historical information commentary found maczfs web site faq 17th september 2013 launch openzfs included zfs-osx become new version maczfs distribution darwin zfs oracle solaris new features introduced version numbers pool file system incremented designate format features available features available specific file system versions require specific pool version distributed development openzfs involves feature flags pool version 5000 unchanging number expected never conflict version numbers given oracle legacy version numbers still exist pool versions 1–28 implied version 5000 illumos uses pool version 5000 purpose future on-disk format changes enabled disabled independently via feature flags note solaris version development sun since release solaris 10 2005 codenamed 'nevada derived opensolaris codebase 'solaris nevada codename next-generation solaris os eventually succeed solaris 10 new code pulled successively new opensolaris 'nevada snapshot builds opensolaris discontinued openindiana forked final build b134 opensolaris published oracle 2010-nov-12 upgrade path solaris 11 express | [
2051,
10257,
8214,
39,
10302,
8266,
2123,
2135,
4184,
10327,
2141,
2149,
8303,
6263,
2180,
4235,
2193,
2194,
2197,
2199,
2207,
2212,
6309,
10405,
6322,
2230,
2232,
8379,
8380,
6338,
10436,
8395,
8402,
8404,
10455,
6361,
8410,
6365,
231,
2... | Test |
9,344 | 7 | Cloudera:cloudera cloudera inc. us-based software company provides software platform data engineering data warehousing machine learning analytics runs cloud premises cloudera started hybrid open-source apache hadoop distribution cdh cloudera distribution including apache hadoop targeted enterprise-class deployments technology cloudera states 50 engineering output donated upstream various apache-licensed open source projects apache spark apache hive apache avro apache hbase combine form apache hadoop platform cloudera also sponsor apache software foundation cloudera founded 2008 three engineers google yahoo facebook christophe bisciglia amr awadallah jeff hammerbacher respectively joined former oracle executive mike olson form cloudera 2008 olson ceo sleepycat software creator open-source embedded database engine berkeley db acquired oracle 2006 awadallah yahoo ran one first business units using apache hadoop data analysis facebook hammerbacher used hadoop building analytic applications involving massive volumes user data architect doug cutting also former chairman apache software foundation authored open-source lucene nutch search technologies mike cafarella wrote initial hadoop software 2004 designed managed hadoop storage analysis cluster yahoo joining cloudera 2009 chief operating officer kirk dunn 2015 march 2009 cloudera announced availability cloudera distribution including apache hadoop conjunction 5 million investment led accel partners 2011 company raised 40 million ignition partners accel partners greylock partners meritech capital partners in-q-tel venture capital firm open connections cia june 2013 tom reilly became chief executive although olson remained chairman board chief strategist reilly chief executive arcsight acquired hewlett-packard 2010 march 2014 cloudera announced 900 million funding round led intel capital 740 million intel received 18 share cloudera intel dropped hadoop distribution dedicated 70 intel engineers work exclusively cloudera projects additional funds came rowe price google ventures affiliate msd capital l.p. private investment firm michael s. dell others january 2012 oracle corporation announced partnership cloudera oracle big data appliance january 2013 dell announced partnership cloudera march 2013 intel invested 740 million cloudera 18 investment may 2013 sas institute announced partnership june 2014 accenture announced service offering based cloudera june 2014 cloudera acquired gazzang developed encryption key management software october 2014 cloudera announced first payment card industry data security standard pci mastercard february 2015 deloitte announced alliance cloudera may 2015 capgemini announced marketing program sap hana cloudera july 9 2015 cloudera announced partnership teradata september 2015 cloudera announced kudu storage manager september 2015 microsoft azure announced full support cloudera enterprise january 2016 tata consultancy services announced internet things framework based cloudera sensor data analytics february 2016 emc announces evolution advanced storage dssd support cloudera 2016 cloudera ranked 5 forbes cloud 100 list cloudera filed initial public offering march 2017 april 28 2017 shares listed new york stock exchange symbol cldr september 2017 cloudera acquired fast forward labs ffl leading machine learning applied artificial intelligence research development company effort deepen cloudera ’ expertise application machine learning practical business problems new division headed ffl co-founder ceo hilary mason october 2018 cloudera hortonworks announced would merging all-stock merger equals.. merger completed january 2019 cloudera offers software services support five bundles available on-premise across multiple cloud providers cloudera also offers managed-service offering cloud cloudera also offers following free software versions additional technologies addition open-source distribution | [
5384,
11016,
6156,
1935,
8217,
11161,
8735,
10661,
1594,
1222,
5332,
982,
8408,
9179,
11111,
8810,
747,
10738,
2163,
1400,
4604
] | Test |
9,345 | 9 | Programming_paradigm:programming paradigm programming paradigms way classify programming languages based features languages classified multiple paradigms paradigms concerned mainly implications execution model language allowing side effects whether sequence operations defined execution model paradigms concerned mainly way code organized grouping code units along state modified code yet others concerned mainly style syntax grammar common programming paradigms include symbolic techniques reflection allow program refer might also considered programming paradigm however compatible major paradigms thus real paradigm right example languages fall imperative paradigm two main features state order operations occur constructs explicitly control order allow side effects state modified one point time within one unit code later read different point time inside different unit code communication units code explicit meanwhile object-oriented programming code organized objects contain state modified code part object object-oriented languages also imperative languages contrast languages fit declarative paradigm state order execute operations instead supply number operations available system along conditions allowed execute implementation language execution model tracks operations free execute chooses order comparison multi-paradigm programming languages software engineering process defined differing methodologies programming languages models computation defined differing paradigms languages designed support one paradigm smalltalk supports object-oriented programming haskell supports functional programming programming languages support multiple paradigms object pascal c++ java c scala visual basic common lisp scheme perl php python ruby wolfram language oz f example programs written c++ object pascal php purely procedural purely object-oriented contain elements paradigms software designers programmers decide use paradigm elements object-oriented programming programs treated set interacting objects functional programming programs treated sequence stateless function evaluations programming computers systems many processors process-oriented programming programs treated sets concurrent processes act logical shared data structures many programming paradigms well known techniques forbid enable instance pure functional programming disallows use side-effects structured programming disallows use goto statement partly reason new paradigms often regarded doctrinaire overly rigid accustomed earlier styles yet avoiding certain techniques make easier understand program behavior prove theorems program correctness programming paradigms also compared programming models allow invoking execution model using api programming models also classified paradigms based features execution model parallel computing using programming model instead language common reason details parallel hardware leak abstractions used program hardware causes programmer map patterns algorithm onto patterns execution model inserted due leakage hardware abstraction consequence one parallel programming language maps well computation problems thus convenient use base sequential language insert api calls parallel execution models via programming model parallel programming models classified according abstractions reflect hardware shared memory distributed memory message passing notions place visible code forth considered flavors programming paradigm apply parallel languages programming models programming language researchers criticise notion paradigms classification programming languages e.g harper krishnamurthi argue many programming languages strictly classified one paradigm rather include features several paradigms see comparison multi-paradigm programming languages different approaches programming developed time identified either time retrospectively early approach consciously identified structured programming advocated since mid 1960s concept programming paradigm dates least 1978 turing award lecture robert w. floyd entitled paradigms programming cites notion paradigm used thomas kuhn structure scientific revolutions 1962 lowest-level programming paradigms machine code directly represents instructions contents program memory sequence numbers assembly language machine instructions represented mnemonics memory addresses given symbolic labels sometimes called first- second-generation languages 1960s assembly languages developed support library copy quite sophisticated conditional macro generation preprocessing abilities call subroutines external variables common sections globals enabling significant code re-use isolation hardware specifics via use logical operators read/write/get/put assembly still used time critical systems often embedded systems gives direct control machine next advance development procedural languages third-generation languages first described high-level languages use vocabulary related problem solved example languages follow procedural paradigm describe step step exactly procedure according particular programmer least followed solve specific problem efficacy efficiency solution therefore entirely subjective highly dependent programmer experience inventiveness ability following widespread use procedural languages object-oriented programming oop languages created simula smalltalk c++ c eiffel php java languages data methods manipulate kept one unit called object perfect encapsulation one distinguishing features oop way another object user would able access data via object methods thus inner workings object may changed without affecting code uses object still controversy raised alexander stepanov richard stallman programmers concerning efficacy oop paradigm versus procedural paradigm need every object associative methods leads skeptics associate oop software bloat attempt resolve dilemma came polymorphism object-oriented programming considered paradigm language possible create even object-oriented assembler language high level assembly hla example fully supports advanced data types object-oriented assembly language programming despite early origins thus differing programming paradigms seen rather like motivational memes advocates rather necessarily representing progress one level next precise comparisons efficacy competing paradigms frequently made difficult new differing terminology applied similar entities processes together numerous implementation distinctions across languages literate programming form imperative programming structures programs human-centered web hypertext essay documentation integral program program structured following logic prose exposition rather compiler convenience independent imperative branch declarative programming paradigms developed languages computer told problem solve problem program structured set properties find expected result procedure follow given database set rules computer tries find solution matching desired properties archetype declarative language fourth generation language sql family functional languages logic programming functional programming subset declarative programming programs written using paradigm use functions blocks code intended behave like mathematical functions functional languages discourage changes value variables assignment making great deal use recursion instead logic programming paradigm views computation automated reasoning body knowledge facts problem domain expressed logic formulas programs executed applying inference rules answer problem found set formulas proved inconsistent symbolic programming paradigm describes programs able manipulate formulas program components data programs thus effectively modify appear learn making suited applications artificial intelligence expert systems natural-language processing computer games languages support paradigm include lisp prolog differentiable programming structures programs differentiated throughout usually via automatic differentiation programming languages support one programming paradigm allow programmers use suitable programming style associated language constructs given job | [
4107,
2062,
15,
6160,
4121,
8225,
8226,
6182,
2105,
8262,
6228,
8293,
119,
136,
10387,
159,
2216,
10413,
2225,
191,
2242,
219,
10463,
228,
8421,
10470,
10471,
2283,
8430,
8435,
4341,
2294,
256,
4354,
6406,
267,
2335,
6437,
4398,
2351,
3... | Test |
9,346 | 4 | Agent.BTZ:agent.btz agent.btz also named autorun computer worm infects usb flash drives spyware variant sillyfdc worm used massive 2008 cyberattack us military agent.btz worm dll file written assembler x86-32 bit spreads creating autorun.inf file root drive dll file ability scan computers data open backdoors send backdoors remote command control server 2008 us military base middle east usb flash drive infected agent.btz inserted laptop attached united states central command spread undetected systems classified unclassified order try stop spread worm pentagon banned usb drives removable media device also disabled windows autorun feature computers pentagon spent nearly 14 months cleaning worm military networks russian hackers thought behind attack used code made agent.btz previous attacks according article economist clear agent.btz designed specifically target military networks indeed comes either russia china article los angeles times reported us defense officials described malicious software apparently designed specifically target military networks thought inside russia although clear whether destructive program created individual hacker whether russian government may involvement 2010 american journalist noah shachtman wrote article investigate theory worm written single hacker later analyses kaspersky lab found relations spyware including red october turla flame december 2016 united states fbi dhs issued joint analysis report included attribution agent.btz one russian civilian military intelligence services ris | [
7809,
5764,
107,
10392,
2041,
477
] | Test |
9,347 | 7 | Online_office_suite:online office suite online office suite online productivity suite cloud office suite office suite offered form web application accessed online using web browser allows people work together worldwide time thereby leading web-based collaboration virtual teamwork online office suites installed on-premises offered software service latter basic versions offered free advanced versions often made available subscription fee latest offerings created run pure html5 web pages known progressive web apps longer requiring cloud online connection function online office suites exist proprietary open-source software online office suite may include broad set applications following document creation editing applications publishing applications collaborative applications management applications | [
546,
3690,
3691,
11372,
7983,
467,
1302,
2328,
1817,
2046,
6367
] | None |
9,348 | 2 | ADO.NET_data_provider:ado.net data provider ado.net data provider software component interacts data source ado.net data providers analogous odbc drivers jdbc drivers ole db providers ado.net providers created access simple data stores text file spreadsheet complex databases oracle database microsoft sql server mysql postgresql sqlite ibm db2 sybase ase many others also provide access hierarchical data stores email systems however different data store technologies different capabilities every ado.net provider implement every possible interface available ado.net standard microsoft describes availability interface provider-specific may applicable depending data store technology involved note also providers may augment capabilities data store capabilities known services microsoft parlance components data provider include | [
10243,
10769,
9234,
1043,
1055,
2083,
8227,
1577,
2603,
4143,
9263,
11316,
1077,
8246,
4174,
4178,
9813,
603,
2145,
10340,
1656,
9340,
5761,
5765,
10886,
2183,
4231,
5259,
653,
6797,
9362,
4771,
7846,
10414,
8391,
214,
9943,
9434,
2783,
7... | None |
9,349 | 9 | Sanguino3_G-Code:sanguino3 g-code sanguino3 g-code protocol 3rd-generation reprap project electronics communicate host machine well protocol reprap host communicates subsystems also written binary format storage later replay usually file .s3g extension protocol intended simplification g-code ease processing somewhat limited cpu sanguino arduino-based controller | [
4121
] | Test |
9,350 | 9 | Advanced_Multimedia_Supplements:advanced multimedia supplements computing advanced multimedia supplements also jsr-234 amms api specification java platform practically speaking extension jsr 135 mobile media api providing new features positional 3d audio processing audio video effects processing better controls digital camera better support analog radio tuner including radio data system amms developed java community process jsr 234 jsr-234 defines six feature sets namely media capabilities define minimum implementation requirements order try avoid fragmentation define common minimal base line implementations every jsr-234 implementation must support least one media capability six media capabilities described table addition media capabilities device free support optional features including also implementations targeted mainly mobile device manufacturers | [
4960,
3561,
3626,
7246,
9011,
3416
] | Validation |
9,351 | 2 | IBM_Power_(software):ibm power software power ibm operating system enhancement package provided spooling facilities ibm system/360 running dos/360 retrofitted modified dos/360 upgrades power/vs power/vse available ibm system/370 running dos/vs dos/vse respectively power acronym priority output writers execution processors input readers power operating system enhancement available dos/360 dos/vs dos/vse came packaged third party dos-based operating systems international business machines released power 1969 following public introduction ibm wall street data center 'spooled queued printer card data freeing programs dependent upon speed printers punched card equipment power competed non-ibm products namely datacorp spooler sdi grasp unlike products power required dedicated partition allowed single printer 1403/2311 punch 2520 2540 reader 2540 2501 shared two processing partitions input data asynchronously loaded directed proper partition job class output directed disk stored directed printer punch writer type prt pun job class priority form code provided prt pun control cards input stream operator put proper form printer/punch told power start g pun g prt console device would continue output type available new form encountered would alert operator change forms wait next go command product ran ibm systems s/360 model 30 larger machines generally smaller machines less 128k core memory would called ram today actually magnetic cores strung wire matrices ability run power power/vs ran well later s/370 series usually models 135 145 later 4331 4341 product ran several dos-related platforms hardware platforms included clones included | [
3969,
9345,
4483,
10756,
4107,
10508,
10392,
2075,
3493,
10617,
9771,
7983,
9137,
1970,
11457,
1219,
8900,
3529,
3916,
10061,
467,
7515,
7775,
2283,
877,
3320,
2041,
3323,
511
] | Test |
9,352 | 5 | Directory_Access_Protocol:directory access protocol directory access protocol dap computer networking standard promulgated itu-t iso 1988 accessing x.500 directory service dap intended used client computer systems popular implementations full osi protocol stack desktop computers available run hardware operating systems typical time basic operations dap bind read list search compare modify add delete modifyrdn adapted novell directory services nds internet lightweight directory access protocol ldap dap specified x.511 | [
6651,
10238
] | Test |
9,353 | 2 | Red_Hat_Linux:red hat linux red hat linux created company red hat widely used linux distribution discontinuation 2004 early releases red hat linux called red hat commercial linux red hat published first non-beta release may 1995 first linux distribution use rpm package manager packaging format time served starting point several distributions mandriva linux yellow dog linux 2003 red hat discontinued red hat linux line favor red hat enterprise linux rhel enterprise environments fedora developed community-supported fedora project sponsored red hat free-of-cost alternative intended home use red hat linux 9 final release hit official end-of-life april 30 2004 although updates published 2006 fedora legacy project shut early 2007 version 3.0.3 one first linux distributions support executable linkable format instead older a.out format red hat linux introduced graphical installer called anaconda developed ketan bagal intended easy use novices since adopted linux distributions also introduced built-in tool called lokkit configuring firewall capabilities version 6 red hat moved glibc 2.1 egcs-1.2 2.2 kernel also introduced kudzu software library automatic discovery configuration hardware version 7 released preparation 2.4 kernel although first release still used stable 2.2 kernel glibc updated version 2.1.92 beta upcoming version 2.2 red hat used patched version gcc cvs called 2.96 decision ship unstable gcc version due gcc 2.95 bad performance non-i386 platforms especially dec alpha newer gccs also improved support c++ standard caused much existing code compile particular use non-released version gcc caused criticism e.g linus torvalds gcc steering committee red hat forced defend decision gcc 2.96 failed compile linux kernel software used red hat due stricter checks also incompatible c++ abi compilers distribution included previous version gcc compiling kernel called kgcc red hat linux 7.0 utf-8 enabled default character encoding system little effect english-speaking users enabled much easier internationalisation seamless support multiple languages including ideographic bi-directional complex script languages along european languages however cause negative reactions among existing western european users whose legacy iso-8859-based setups broken change version 8.0 also second include bluecurve desktop theme used common theme gnome-2 kde 3.0.2 desktops well openoffice-1.0 kde members appreciate change claiming best interests kde version 9 supported native posix thread library ported 2.4 series kernels red hat red hat linux lacked many features due possible copyright patent problems example mp3 support disabled rhythmbox xmms instead red hat recommended using ogg vorbis patents mp3 support however could installed afterwards although royalties required everywhere mp3 patented support microsoft ntfs file system also missing could freely installed well red hat linux originally developed exclusively inside red hat feedback users coming bug reports contributions included software packages – contributions distribution changed late 2003 red hat linux merged community-based fedora project new plan draw codebase fedora creating new red hat enterprise linux distributions fedora replaces original red hat linux download retail version model similar relationship netscape communicator mozilla staroffice openoffice.org although case resulting commercial product also fully free software release dates drawn announcements comp.os.linux.announce version names chosen cognitively related prior release yet related way release fedora red hat projects merged september 22 2003 | [
6150,
9742,
15,
1553,
6675,
10780,
3618,
9762,
9253,
11305,
10797,
1584,
56,
59,
5179,
4673,
3142,
1110,
2134,
4186,
5723,
2143,
3685,
10860,
5742,
2671,
4729,
5243,
11388,
8837,
7311,
2193,
2197,
2201,
10394,
6302,
673,
3745,
7854,
9902,... | None |
9,354 | 9 | Codea:codea codea lua code editor ios devices made two lives left designed rapidly prototyping visual ideas especially games simulations finished projects exported directly app xcode closely related processing programming language using many methods drawing functions found processing codea released app store late 2011 making one first ios lua editors april 2012 first game programmed entirely ipad using codea released app store march 2014 codea 2.0 released added 64-bit architecture redesigned code editor various api improvements october 4 2017 version 2.5 released added 3d voxel editing capability construction 3d worlds loading 3d models wavefront .obj file format also added february 2018 latest version codea released 2.52 | [
4777,
4186,
10478,
9063
] | Validation |
9,355 | 2 | Input/Output_Configuration_Program:input/output configuration program original s/360 s/370 architectures processor set i/o channels addressed i/o devices 12-bit cuu address containing 4-bit channel number 8-bit unit device number sent channel bus order select device operating system configured reflect processor cuu address device operating system logic queue pending i/o channel handle selection alternate channels initiating i/o channel different processor required causing shoulder tap interrupt processor could initiate i/o starting ibm 3081 ibm 4381 s/370-extended architecture mode ibm changed i/o architecture allow channel subsystem handle channel scheduling operating system handle s/370 mode new i/o architecture used 16-bit channel path id chpid channel subsystem responsible mapping chpid channel device numbers queuing i/o requests selecting available paths installation responsible defining input/output configuration data sets iocds operator could select specific iocds part power reset por input/output configuration program iocp program ibm mainframes compiles description channel subsystem lpar configuration optionally loading input/output configuration data set iocds recognizes syntax mvs configuration program mvscp input need maintain separate input files direct use iocp mvscp mostly supplanted hardware configuration definition hcd | [
8275,
10508,
6325,
7983
] | Train |
9,356 | 4 | Mobile_security:mobile security mobile security specifically mobile device security become increasingly important mobile computing particular concern security personal business information stored smartphones users businesses use smartphones communicate also plan organize users work also private life within companies technologies causing profound changes organization information systems therefore become source new risks indeed smartphones collect compile increasing amount sensitive information access must controlled protect privacy user intellectual property company smartphones computers preferred targets attacks attacks exploit weaknesses inherent smartphones come communication mode—like short message service sms aka text messaging multimedia messaging service mms wifi bluetooth gsm de facto global standard mobile communications also exploits target software vulnerabilities browser operating system malicious software relies weak knowledge average user security countermeasures developed applied smartphones security different layers software dissemination information end users good practices observed levels design use development operating systems software layers downloadable apps smartphone user exposed various threats use phone last two-quarters 2012 number unique mobile threats grew 261 according abi research threats disrupt operation smartphone transmit modify user data applications must guarantee privacy integrity information handle addition since apps could malware functionality activities limited example restricting apps accessing location information via gps blocking access user address book preventing transmission data network sending sms messages billed user etc. three prime targets attackers number threats mobile devices including annoyance stealing money invading privacy propagation malicious tools source attacks actors found non-mobile computing space smartphone infected attacker attacker attempt several things attacks derive flaws management sms mms mobile phone models problems managing binary sms messages possible sending ill-formed block cause phone restart leading denial service attacks user siemens s55 received text message containing chinese character would lead denial service another case standard requires maximum size nokia mail address 32 characters nokia phones verify standard user enters email address 32 characters leads complete dysfunction e-mail handler puts commission attack called curse silence study safety sms infrastructure revealed sms messages sent internet used perform distributed denial service ddos attack mobile telecommunications infrastructure big city attack exploits delays delivery messages overload network another potential attack could begin phone sends mms phones attachment attachment infected virus upon receipt mms user choose open attachment opened phone infected virus sends mms infected attachment contacts address book real-world example attack virus commwarrior uses address book sends mms messages including infected file recipients user installs software received via mms message virus began send messages recipients taken address book attacker may try break encryption mobile network gsm network encryption algorithms belong family algorithms called a5 due policy security obscurity possible openly test robustness algorithms originally two variants algorithm a5/1 a5/2 stream ciphers former designed relatively strong latter designed weak purpose allow easy cryptanalysis eavesdropping etsi forced countries typically outside europe use a5/2 since encryption algorithm made public proved possible break encryption a5/2 could broken fly a5/1 6 hours july 2007 3gpp approved change request prohibit implementation a5/2 new mobile phones means decommissioned longer implemented mobile phones stronger public algorithms added gsm standard a5/3 a5/4 block ciphers otherwise known kasumi uea1 published etsi network support a5/1 a5 algorithm implemented phone base station specify a5/0 null-algorithm whereby radio traffic sent unencrypted even case mobile phones able use 3g 4g much stronger encryption 2g gsm base station downgrade radio communication 2g gsm specify a5/0 encryption basis eavesdropping attacks mobile radio networks using fake base station commonly called imsi catcher addition tracing mobile terminals difficult since time mobile terminal accessing accessed network new temporary identity tmsi allocated mobile terminal tsmi used identity mobile terminal next time accesses network tmsi sent mobile terminal encrypted messages encryption algorithm gsm broken attacker intercept unencrypted communications made victim smartphone attacker try eavesdrop wi-fi communications derive information e.g username password type attack unique smartphones vulnerable attacks often wi-fi means communication access internet security wireless networks wlan thus important subject initially wireless networks secured wep keys weakness wep short encryption key connected clients addition several reductions search space keys found researchers wireless networks protected wpa security protocol wpa based temporal key integrity protocol tkip designed allow migration wep wpa equipment already deployed major improvements security dynamic encryption keys small networks wpa pre-shared key based shared key encryption vulnerable length shared key short limited opportunities input i.e numeric keypad mobile phone users might define short encryption keys contain numbers increases likelihood attacker succeeds brute-force attack successor wpa called wpa2 supposed safe enough withstand brute force attack gsm attacker succeeds breaking identification key possible attack phone also entire network connected many smartphones wireless lans remember already connected mechanism prevents user re-identify connection however attacker could create wifi access point twin parameters characteristics real network using fact smartphones remember networks could confuse two networks connect network attacker intercept data transmit data encrypted form lasco worm initially infects remote device using sis file format sis file format software installation script script file executed system without user interaction smartphone thus believes file come trusted source downloads infecting machine security issues related bluetooth mobile devices studied shown numerous problems different phones one easy exploit vulnerability unregistered services require authentication vulnerable applications virtual serial port used control phone attacker needed connect port take full control device another example phone must within reach bluetooth discovery mode attacker sends file via bluetooth recipient accepts virus transmitted example cabir worm spreads via bluetooth connection worm searches nearby phones bluetooth discoverable mode sends target device user must accept incoming file install program installing worm infects machine attacks based flaws os applications phone mobile web browser emerging attack vector mobile devices common web browsers mobile web browsers extended pure web navigation widgets plug-ins completely native mobile browsers jailbreaking iphone firmware 1.1.1 based entirely vulnerabilities web browser result exploitation vulnerability described underlines importance web browser attack vector mobile devices case vulnerability based stack-based buffer overflow library used web browser libtiff vulnerability web browser android discovered october 2008 iphone vulnerability due obsolete vulnerable library significant difference iphone vulnerability android sandboxing architecture limited effects vulnerability web browser process smartphones also victims classic piracy related web phishing malicious websites software run background etc big difference smartphones yet strong antivirus software available sometimes possible overcome security safeguards modifying operating system real-world examples section covers manipulation firmware malicious signature certificates attacks difficult 2004 vulnerabilities virtual machines running certain devices revealed possible bypass bytecode verifier access native underlying operating system results research published detail firmware security nokia symbian platform security architecture psa based central configuration file called swipolicy 2008 possible manipulate nokia firmware installed fact downloadable versions file human readable possible modify change image firmware vulnerability solved update nokia theory smartphones advantage hard drives since os files rom changed malware however systems possible circumvent symbian os possible overwrite file file name windows os possible change pointer general configuration file editable file application installed signing application verified series certificates one create valid signature without using valid certificate add list symbian os certificates directory firmware changes explained easy insert seemingly valid malicious certificate 2015 researchers french government agency agence nationale de la sécurité des systèmes d'information anssi demonstrated capability trigger voice interface certain smartphones remotely using specific electromagnetic waveforms exploit took advantage antenna-properties headphone wires plugged audio-output jacks vulnerable smartphones effectively spoofed audio input inject commands via audio interface juice jacking physical hardware vulnerability specific mobile platforms utilizing dual purpose usb charge port many devices susceptible data exfiltrated malware installed onto mobile device utilizing malicious charging kiosks set public places hidden normal charge adapters jail-breaking also physical access vulnerability mobile device users initiate hack devices unlock exploit weaknesses operating system mobile device users take control device jail-breaking customize interface installing applications change system settings allowed devices thus allowing tweak mobile devices operating systems processes run programs background thus devices expose variety malicious attack lead compromise important private data 2010 researcher university pennsylvania investigated possibility cracking device password smudge attack literally imaging finger smudges screen discern user password researchers able discern device password 68 time certain conditions outsiders may perform over-the-shoulder victims watching specific keystrokes pattern gestures unlock device password passcode smartphones permanent point access internet mostly compromised easily computers malware malware computer program aims harm system resides mobile malware variants increased 54 year 2017 trojans worms viruses considered malware trojan program smartphone allows external users connect discreetly worm program reproduces multiple computers across network virus malicious software designed spread computers inserting legitimate programs running programs parallel however must said malware far less numerous important smartphones computers nonetheless recent studies show evolution malware smartphones rocketed last years posing threat analysis detection typically attack smartphone made malware takes place 3 phases infection host accomplishment goal spread malware systems malware often uses resources offered infected smartphones use output devices bluetooth infrared may also use address book email address person infect user acquaintances malware exploits trust given data sent acquaintance infection means used malware get smartphone either use one faults previously presented may use gullibility user infections classified four classes according degree user interaction malware infected phone also seek accomplish goal usually one following monetary damage damage data and/or device concealed damage malware infected smartphone always aims spread one way another various malware exist world smartphones short description mobile ransomware type malware locks users mobile devices pay-to-unlock-your-device ploy grown leaps bounds threat category since 2014 specific mobile computing platforms users often less security-conscious particularly pertains scrutinizing applications web links trusting native protection capability mobile device operating system mobile ransomware poses significant threat businesses reliant instant access availability proprietary information contacts likelihood traveling businessman paying ransom unlock device significantly higher since disadvantage given inconveniences timeliness less likely direct access staff recent ransomware attack caused stir world attack caused many internet connected devices work companies spent large amount recover attacks diagram loads different behaviors smartphone malware terms effects smartphones see graph least 50 malware varieties exhibit negative behavior except ability spread multitude malware partly due variety operating systems smartphones however attackers also choose make malware target multiple platforms malware found attacks os able spread different systems begin malware use runtime environments like java virtual machine .net framework also use libraries present many operating systems malware carry several executable files order run multiple environments utilize propagation process practice type malware requires connection two operating systems use attack vector memory cards used purpose synchronization software used propagate virus security mechanisms place counter threats described presented section divided different categories act level range management security operating system behavioral education user threats prevented various measures depending case considering two cases mentioned first case one would protect system corruption application second case installation suspicious software would prevented first layer security smartphone operating system os beyond needing handle usual roles operating system e.g resource management scheduling processes device must also establish protocols introducing external applications data without introducing risk central paradigm mobile operating systems idea sandbox since smartphones currently designed accommodate many applications must mechanisms ensure applications safe phone applications data system user malicious program reaches mobile device vulnerable area presented system must small possible sandboxing extends idea compartmentalize different processes preventing interacting damaging based history operating systems sandboxing different implementations example ios focus limiting access public api applications app store default managed open allows restrict apps access types data android bases sandboxing legacy linux trustedbsd following points highlight mechanisms implemented operating systems especially android operating system security layer security software layer composed individual components strengthen various vulnerabilities prevent malware intrusions identification user human user authentication contains software components learned experience computer security however smartphones software must deal greater constraints see limitations mobile antivirus product would scan files compare database known mobile malware code signatures application passes various security barriers take actions designed actions triggered activity malicious application sometimes detected one monitors various resources used phone depending goals malware consequences infection always malicious applications intended harm devices deployed following sections describe different ways detect suspicious activity various points mentioned indications provide certainty legitimacy activity application however criteria help target suspicious applications especially several criteria combined network traffic exchanged phones monitored one place safeguards network routing points order detect abnormal behavior mobile use network protocols much constrained computer expected network data streams predicted e.g protocol sending sms permits detection anomalies mobile networks production distribution chain mobile devices responsibility manufacturers ensure devices delivered basic configuration without vulnerabilities users experts many aware existence security vulnerabilities device configuration provided manufacturers retained many users listed several points manufacturers consider much malicious behavior allowed carelessness user smartphone users found ignore security messages application installation especially application selection checking application reputation reviews security agreement messages simply leaving device without password precise control permissions granted applications added smartphone user large responsibility cycle security vector intrusion precaution especially important user employee company stores business data device detailed precautions user take manage security smartphone recent survey internet security experts bullguard showed lack insight rising number malicious threats affecting mobile phones 53 users claiming unaware security software smartphones 21 argued protection unnecessary 42 admitted n't crossed mind using apa 2011 statistics show consumers concerned security risks believe serious problem key always remember smartphones effectively handheld computers vulnerable latest android smartphones come inbuilt encryption setting securing information saved device makes difficult hacker extract decipher information case device compromised settings – security – encrypt phone encrypt sd card precautions measures leave easy solution intrusion people malicious applications smartphone users careful many attacks defeated especially phishing applications seeking obtain rights device one form mobile protection allows companies control delivery storage text messages hosting messages company server rather sender receiver phone certain conditions met expiration date messages deleted security mechanisms mentioned article large extent inherited knowledge experience computer security elements composing two device types similar common measures used antivirus software firewalls however implementation solutions necessarily possible least highly constrained within mobile device reason difference technical resources offered computers mobile devices even though computing power smartphones becoming faster limitations computing power furthermore common find updates exist developed deployed always done one example find user know newer version operating system compatible smartphone user may discover known vulnerabilities corrected end long development cycle allows time exploit loopholes expected four mobile environments make security framework | [
3072,
5636,
5637,
6,
9732,
10245,
10756,
11272,
9227,
11277,
9744,
9233,
9242,
9761,
2084,
9256,
3626,
9771,
3629,
7730,
10297,
1083,
3643,
7739,
9791,
1088,
1602,
4165,
11333,
10329,
3162,
10332,
107,
6763,
2678,
8313,
6779,
5245,
5246,
... | Test |
9,357 | 4 | Barbara_McNamara:barbara mcnamara barbara a. mcnamara born circa 1942 nsa deputy director october 1997 june 2000 succeeded william b black jr.. mcnamara joined nsa 1963 chinese linguist rose number analytic operational managerial positions leaving operational directorate 1983 mcnamara became first woman named deputy director operations 1994 1997 became second woman named agency deputy director june 2000 received us intelligence community highest award national intelligence distinguished service medal time one highest ranked women united states intelligence community served nsa senior u.s. liaison officer london england shortly retirement 2003 currently board member signalscape intec billing | [
289,
4898,
7137,
10305,
11302,
327,
266,
6668,
365,
4719,
7887,
2897,
1714,
10832,
4566,
2712,
6749
] | None |
9,358 | 7 | Style_Jukebox:style jukebox style jukebox hi-fi high-resolution audio cloud music streaming storage player windows ios android windows phone platforms web player also available mac windows linux style jukebox allows users upload personal music collection computer style jukebox servers listen another compatible device android ios windows mac windows phone streaming downloading songs offline playback basic accounts 10 gb storage pro accounts 2 tb music july 2016 style jukebox 250,000 registered users december 1st 2017 style jukebox discontinued service small post home page details released style jukebox consists cloud-based services user management music storage programmatic interfaces apis clients music streaming storage desktop mobile operating systems upload available desktop client style jukebox enables users drop music files folders music player automatically uploaded synced style jukebox cloud-based services made available user computers devices also style jukebox client installed style jukebox cloud-based services automatically transcodes formats match device supported formats example 320kbit/s wma transcoded 320kbit/s mp3 ios devices flac lossless transcoded wma lossless windows phone devices | [
10368,
5612,
6797,
11063,
4623,
3152,
753,
7983,
119,
823,
11037
] | Test |
9,359 | 2 | Nokia_E63:nokia e63 nokia e63 budget business smartphone announced 12 november 2008 released later year based symbian s60 platform although looks similar nokia e71 fascia made plastic aluminium e71 plastic chassis also keypad made different material laid slightly different e71 many specifications identical e71 except lack gps infrared lesser ram lack hsdpa lower-quality camera fixed-focus lens e63 come ability use camera flash light present e71 also standard 3.5 mm audio jack e71 uses 2.52 mm jack e63 retailed 199 euros taxes specifications current firmware version 510.21.010 released 28 march 2011 operating frequency | [
1537,
8577,
3205,
11655,
1424,
529,
2449,
8083,
10770,
5143,
2072,
7063,
5274,
5019,
5659,
669,
8472,
11545,
4003,
4132,
6310,
167,
40,
3626,
5290,
10410,
10802,
8627,
7220,
821,
5175,
7866,
1728,
7617,
4291,
7877,
10053,
199,
967,
9163,
... | Test |
9,360 | 1 | SQL_Anywhere:sql anywhere sap sql anywhere proprietary relational database management system rdbms product sap sql anywhere known sybase sql anywhere prior acquisition sybase sap sql anywhere run windows windows ce mac os x various unix platforms including linux aix hp-ux solaris database files independent operating system allowing copied supported platforms product provides several standard interfaces odbc jdbc ado.net number special interfaces php perl engine supports stored procedures user functions using watcom sql t-sql java c/c++ triggers referential integrity row-level locking replication high availability proxy tables events scheduled system events strong encryption supported database files client-server communication sql anywhere used several contexts including embedded database particularly application data store example used intuit quickbooks network management products backup products ability used minimal administration distinguishing feature role used database server work groups small medium-sized businesses also function mobile database includes scalable data synchronization technology provides change-based replication separate databases including large server-based rdbms systems sql anywhere server high performing embeddable relational database-management system rdbms scales thousands users server environments desktop mobile applications used widely deployed zero-administration environments ultralite ultralite database-management system designed small-footprint mobile devices pdas smart phones mobilink mobilink highly-scalable session-based synchronization technology exchanging data among relational databases non-relational data sources qanywhere qanywhere facilitates development robust secure store-and-forward mobile messaging applications sql remote sql remote technology based store forward architecture allows occasionally connected users synchronize data sql anywhere databases using file message transfer mechanism | [
6147,
8582,
6797,
270,
10511,
10389,
10518,
2456,
1304,
1049,
5403,
2208,
7080,
10921,
3629,
10286,
7983,
9263,
11189,
823,
5691,
1856,
321,
8644,
6993,
9177,
5210,
10459,
2780,
734,
7022,
7409,
8188,
2045
] | None |
9,361 | 2 | SHARE_Operating_System:share operating system share operating system sos created 1959 improvement general motors gm-naa i/o operating system first operating system share user group main target improve sharing programs gm-naa i/o share operating system provided new methods manage buffers input/output devices like gm-naa i/o allowed execution programs written assembly language initially worked ibm 709 computer transistorized compatible successor ibm 7090 series articles describing innovations system appears april 1959 journal association computing machinery 1962 ibm discontinued support sos announced entirely new incompatible operating system ibm 7090/94 ibsys | [
2179,
4996,
10883,
7053,
8077,
6675,
9468,
789,
5397,
11673,
9370,
6557,
3359,
421,
7848,
1323,
7983,
8879,
7217,
10803,
7477,
7733,
10040,
5562,
573,
1219,
8388,
6342,
7504,
1235,
7507,
477,
863,
868,
3429,
9829,
6248,
5484,
5492,
2168,
... | Validation |
9,362 | 2 | DataAdapter:dataadapter ado.net dataadapter functions bridge data source disconnected data class dataset simplest level specify sql commands provide elementary crud functionality advanced level offers functions required order create strongly typed datasets including datarelations data adapters integral part ado.net managed providers set objects used communicate data source dataset addition adapters managed providers include connection objects data reader objects command objects adapters used exchange data data source dataset many applications means reading data database dataset writing changed data dataset back database however data adapter move data source dataset example could adapter moves data microsoft exchange server dataset sometimes data work primarily read-only rarely need make changes underlying data source situations also call caching data memory minimize number database calls data change data adapter makes easy accomplish things helping manage data disconnected mode data adapter fills dataset object reading data writes single batch persisting changes back database data adapter contains reference connection object opens closes connection automatically reading writing database additionally data adapter contains command object references select insert update delete operations data data adapter defined table dataset take care communication database need tell data adapter load write database | [
736,
9348,
10413,
9263
] | Test |
9,363 | 3 | Influence_of_the_IBM_PC_on_the_personal_computer_market:influence ibm pc personal computer market following introduction ibm personal computer ibm pc many personal computer architectures became extinct within years ibm pc introduced personal computer market dominated systems using 6502 z80 8-bit microprocessors trs 80 commodore pet apple ii series used proprietary operating systems computers running cp/m ibm introduced ibm pc 1984 ibm pc clones became dominant computers 1983 byte forecast 1990 ibm would command 11 business computer sales commodore predicted hold slim lead highly competitive market 11.9 around 1978 several 16-bit cpus became available examples included data general mn601 fairchild 9440 ferranti f100-l general instrument cp1600 cp1610 national semiconductor ins8900 panafacom mn1610 texas instruments tms9900 notably intel 8086 new processors expensive incorporate personal computers used 16-bit data bus needed rare thus expensive 16-bit peripheral support chips 50 new business-oriented personal computer systems came market year ibm released ibm pc used 16- 32-bit microprocessor 8-bit systems generally believed vendors perfectly adequate intel 8086 expensive use main manufacturers selling 8-bit business systems period august 12 1981 ibm released ibm personal computer one far-reaching decisions made ibm pc use open architecture leading large market third party add-in boards applications finally also many competitors creating ibm-compatible machines ibm pc used then-new intel 8088 processor like 16-bit cpus could access 1 megabyte ram used 8-bit-wide data bus memory peripherals design allowed use large readily available relatively inexpensive family 8-bit-compatible support chips ibm decided use intel 8088 first considering motorola 68000 intel i8086 two considered powerful needs although already established rivals like apple radio shack many advantages company new microcomputers ibm reputation business computing allowed ibm pc architecture take substantial market share business applications many small companies sold ibm-compatible software hardware rapidly grew size importance including tecmar quadram ast research microsoft mid-1982 three mainframe minicomputer companies sold microcomputers unlike ibm hewlett-packard xerox control data corporation chose cp/m operating system many companies made business personal computers using proprietary designs still using 8-bit microprocessors ones used intel x86 processors often used generic non-ibm-compatible specific version ms-dos cp/m-86 8-bit systems intel 8080 compatible cpu normally used cp/m within year ibm pc introduction microsoft licensed ms-dos 70 companies one first computers achieve 100 pc compatibility compaq portable released november 1982 remained compatible clone 1984 pc yet dominate market however x86-based systems clones ibm pc design different internal designs like cp/m-based 8-bit systems preceded ibm pc difficult obtain several years introduction many makers ms-dos computers intentionally avoided full ibm compatibility expected market infoworld described ordinary pc clones would decline shortage real pcs ended feared fate companies sold computers plug-compatible ibm mainframes 1960s 1970s—many went bankrupt ibm changed specifications—and believed market existed personal computers similar selection software ibm pc better hardware even years ibm pc introduction manufacturers digital hp sanyo tandy texas instruments tulip computers nec wang laboratories xerox continued introduce personal computers barely compatible ibm pc even though used x86 processors ran ms-dos used ms-dos way microsoft originally envisioned way 8-bit systems used cp/m implemented standard rom bios routines achieve hardware independence 8080 z80 compatibles machine different bios long software made standard ms-dos calls would ensure compatibility microsoft used sophisticated installer dos programs like multiplan provided device drivers many non ibm pc-compatible computers software vendors columbia university discussed difficulty kermit support many different clones ms-dos computers peter norton earlier encouraged vendors write software ran many different computers early 1985 admitted—after experiencing difficulty rewriting norton utilities—that practical way software creators write generic software dealers found carrying multiple versions software clones varying levels compatibility difficult get best results 8088 modest performance many popular software applications written specifically ibm pc developers programs opted write directly computer video memory peripheral chips bypassing ms-dos bios example program might directly update video refresh memory instead using ms-dos calls device drivers alter appearance screen many notable software packages spreadsheet program lotus 1-2-3 microsoft microsoft flight simulator 1.0 directly accessed ibm pc hardware bypassing bios therefore work computers even trivially different ibm pc especially common among pc games result systems fully ibm pc-compatible could n't run software quickly became obsolete rendered obsolete cp/m-inherited concept oem versions ms-dos meant run bios calls non ibm-pc hardware 1984 phoenix technologies began licensing clone ibm pc bios phoenix bios competitors ami bios made possible anyone market pc compatible computer without develop compatible bios like compaq although based i8086 enabling creation relatively low-cost x86-based systems intel 80186 quickly lost appeal x86-based pc builders supporting circuitry inside intel 80186 chip incompatible used standard pc chipset implemented ibm rarely used personal computers 1982 february 1984 byte described personal computer market seems shadowed cloud compatibility drive compatible ibm personal computer family assumed near-fetish proportions stated inevitable light phenomenal market acceptance ibm pc magazine cited announcement north star fall 1983 first pc-compatible microcomputer founded 1976 north star long successful 8-bit s-100 bus products introduced proprietary 16-bit products company acknowledged ibm pc become standard one north star needed follow byte described announcement representative great impact ibm made industry magazine expressed concern ibm burgeoning influence pc community stifling innovation many companies mimicking big blue admitting dealers asked kaypro also introduced company first ibm compatible year tandy—which much 60 personal-computer market attempted keep technical information secret monopolize software peripheral sales—also began selling non-proprietary computers four years jon shirley predicted infoworld new ibm pc major market would ibm addicts magazine 1985 similarly called ibm compatibility tandy 1000 small concession big blue dominating stranglehold company struggling openly blood-soaked arena personal computers 1000 compatible pc compatible tandy 2000 ms-dos computer ibm mainframe rivals bunch introduced compatibles hewlett-packard introduced vectra infoworld stated company responding demands customers full ibm pc compatibility mitch kapor lotus development corporation said 1984 either pc-compatible special compatibility proven safe path microsoft executive jim harris stated 1985 infoworld wrote ibm competitors whipped conformity designs total failure every company tried improve ibm pc customers wanted run pc applications like 1-2-3 developers cared massive pc installed base non-compatible—no matter technical superiority—from company apple failed lack customers software compatibility became important dave winer joked year referring pc incomplete compatibility ibm pc company introduce machine n't pc compatible survive ibm 1985 shortage ibm pcs ended causing financial difficulties many vendors compatibles nonetheless harris said ones done worse compatibles noncompatibles pc standard similarly dominant europe honeywell bull olivetti ericsson selling compatibles software companies focusing pc products end year pc magazine stated even ibm could longer introduce rumored proprietary non-compatible operating system noting company unsuccessful pcjr cardinal sin n't pc compatible magazine wrote backward compatibility ibm pc single largest concern hardware software developers user community large demanding accept radical changes abandon solutions worked past within years introduction fully compatible pc clones almost rival business personal computer systems alternate x86 using architectures gone market despite inherent dangers industry based de facto standard thriving pc clone industry emerged non-ibm pc-compatible systems remained systems classified home computers apple ii series business systems offered features available ibm pc high level integration e.g. bundled accounting inventory fault-tolerance multitasking multi-user features compaq prices comparable ibm company emphasized pc compatibles features quality corporate customers mid-1985 compute described wave inexpensive clones american asian companies caused prices decline end 1986 equivalent 1600 real ibm pc 256k ram two disk drives cost little 600 lower price apple iic consumers began purchasing dos computers home large numbers tandy estimated half 1000 sales went homes new leading edge model comprised 1 us home-computer market year toy discount stores sold clone made hyundai like stereo without demonstrator model salesman tandy inexpensive clones succeeded consumers—who saw superior lower-end game machines—where ibm failed two years earlier pcjr inexpensive home computers years earlier comparable price commodore amiga atari st apple iigs unlike pcjr clones fast faster ibm pc highly compatible users could bring work home large dos software library reassured worried orphaned technology consumers used spreadsheets entertainment former ability justifying buying computer could also perform latter pcs compatibles also gained significant share educational market longtime leader apple lost share january 1987 consumer electronics show commodore atari announced clones 1987 pc industry growing quickly formerly business-only platform become largest important market computer game companies outselling games apple ii commodore 64 ega video card inexpensive clone better games computers 1989 80 readers compute owned dos computers magazine announced greater emphasis ms-dos home computing ibm influence industry decreased competition increased rivals introduced computers improved ibm designs maintaining compatibility 1986 compaq deskpro 386 first computer based intel 80386 1987 ibm unsuccessfully attempted regain leadership market personal system/2 line proprietary microchannel architecture 1990 computer gaming world told reader complaining many reviews pc games companies attempting get ms-dos products door first reported ms-dos comprised 65 computer-game market amiga 10 computers including macintosh 10 declining amiga others st various msx2 computers remained market pc compatibles gained sufficient multimedia capabilities compete home computers advent inexpensive versions vga video card sound blaster sound card clones remaining home computers driven market 1995 macintosh almost new consumer-oriented systems sold ibm pc clones macintosh originally used motorola 68000 family processors later migrating powerpc architecture throughout 1990s apple would steadily transition macintosh platform proprietary expansion interfaces use standards pc world ide pci usb 2006 apple converted macintosh intel x86 architecture modern macintosh computers essentially ibm pc compatibles capable booting microsoft windows running ibm pc-compatible software still retain unique design elements support apple mac os x operating system 2008 sid meier listed ibm pc one three important innovations history video games shortly ibm pc released obvious split appeared systems opted use x86-compatible processor chose another architecture almost x86 systems provided version ms-dos others used many different operating systems although z80-based systems typically offered version cp/m common usage ms-dos unified x86-based systems promoting growth x86/ms-dos ecosystem non-x86 architectures died x86 systems standardized fully ibm pc compatible clones market filled dozens different competing systems reduced near-monoculture x86-based ibm pc compatible ms-dos systems early launch ibm pc 1981 still dozens systems ibm pc-compatible use intel x86 chips used intel 8088 8086 80186 processors almost without exception offered oem version ms-dos opposed oem version customized ibm use however generally made attempt copy ibm pc architecture machines different i/o addresses different system bus different video controllers differences original ibm pc differences sometimes rather minor used improve upon ibm pc design result differences software directly manipulated hardware would run correctly cases x86-based systems n't use fully ibm pc compatible design n't sell well enough attract support software manufacturers though computer manufacturers arranged compatible versions popular applications developed sold specifically machines fully ibm pc-compatible clones appeared market shortly thereafter advantages cloning became impossible ignore notable systems x86-compatible real clones manufacturers immediately switched intel x86 microprocessor family ms-dos companies continued releasing systems based non-intel architectures systems used 32-bit microprocessor popular motorola 68000 others continued use 8-bit microprocessors many systems eventually forced market onslaught ibm pc clones although architectures may superior capabilities especially area multimedia pc architectures era often cga display sound system internal pc speaker three systems era extinct thriving legacies | [
5377,
4228,
9732,
5384,
7432,
9084,
6539,
9212,
6797,
1809,
4114,
6419,
2846,
4642,
8355,
3238,
9006,
8625,
1202,
4150,
11447,
4409,
11068,
9665,
10436,
10692,
7243,
9932,
9166,
3281,
1515,
9964,
8301,
10862,
2159,
4337,
6129,
499,
7281,
... | None |
9,364 | 4 | Heuristic_analysis:heuristic analysis heuristic analysis method employed many computer antivirus programs designed detect previously unknown computer viruses well new variants viruses already wild heuristic analysis expert based analysis determines susceptibility system towards particular threat/risk using various decision rules weighing methods multicriteria analysis mca one means weighing method differs statistical analysis bases available data/statistics antivirus programs utilize heuristic analysis perform function executing programming commands questionable program script within specialized virtual machine thereby allowing anti-virus program internally simulate would happen suspicious file executed keeping suspicious code isolated real-world machine analyzes commands performed monitoring common viral activities replication file overwrites attempts hide existence suspicious file one virus-like actions detected suspicious file flagged potential virus user alerted another common method heuristic analysis anti-virus program decompile suspicious program analyze machine code contained within source code suspicious file compared source code known viruses virus-like activities certain percentage source code matches code known viruses virus-like activities file flagged user alerted heuristic analysis capable detecting many previously unknown viruses new variants current viruses however heuristic analysis operates basis experience comparing suspicious file code functions known viruses means likely miss new viruses contain previously unknown methods operation found known viruses hence effectiveness fairly low regarding accuracy number false positives new viruses discovered human researchers information added heuristic analysis engine thereby providing engine means detect new viruses heuristic analysis method detecting viruses examining code suspicious properties traditional methods virus detection involve identifying malware comparing code program code known virus types already encountered analyzed recorded database – known signature detection useful still use signature detection method also become limited due development new threats exploded around turn century continuing emerge time counter problem heuristic model specifically designed spot suspicious characteristics found unknown new viruses modified versions existing threats well known malware samples cybercriminals constantly developing new threats heuristic analysis one methods used deal huge volume new threats seen daily heuristic analysis also one methods capable combating polymorphic viruses — term malicious code constantly changes adapts heuristic analysis incorporated advanced security solutions offered companies like kaspersky labs detect new threats cause harm without need specific signature heuristic analysis employ number different techniques one heuristic method known static heuristic analysis involves de-compiling suspect program examining source code code compared viruses already known heuristic database particular percentage source code matches anything heuristic database code flagged possible threat another method known dynamic heuristics scientists want analyze something suspicious without endangering people contain substance controlled environment like secure lab conduct tests process similar heuristic analysis — virtual world isolates suspicious program piece code inside specialized virtual machine — sandbox — gives antivirus program chance test code simulate would happen suspicious file allowed run examines command activated looks suspicious behaviors self-replication overwriting files actions common viruses potential issues reported user heuristic analysis ideal identifying new threats effective heuristics must carefully tuned provide best possible detection new threats without generating false positives perfectly innocent code reason heuristic tools often typically one weapon sophisticated antivirus arsenal typically deployed along methods virus detection signature analysis proactive technologies | [
2213,
3944,
2601,
7739,
7515,
6430
] | Validation |
9,365 | 5 | MQTT:mqtt mqtt message queuing telemetry transport iso standard iso/iec prf 20922 publish-subscribe-based messaging protocol works top tcp/ip protocol suite designed connections remote locations small code footprint required network bandwidth limited publish-subscribe messaging pattern requires message broker andy stanford-clark ibm arlen nipper cirrus link authored first version protocol 1999 2013 ibm submitted mqtt v3.1 oasis specification body charter ensured minor changes specification could accepted mqtt-sn variation main protocol aimed embedded devices non-tcp/ip networks zigbee historically mq mqtt came ibm mq 'mqseries message queuing product line however queuing required supported standard feature situations alternative message-oriented middleware includes advanced message queuing protocol amqp streaming text oriented messaging protocol stomp ietf constrained application protocol xmpp dds opc ua web application messaging protocol wamp mqtt system consists clients communicating server often called broker client may either publisher information subscriber client connect broker information organized hierarchy topics publisher new item data distribute sends control message data connected broker broker distributes information clients subscribed topic publisher need data number locations subscribers subscribers turn configured data publishers broker receives topic current subscribers discard topic unless publisher indicates topic retained allows new subscribers topic receive current value rather waiting next update publisher publishing client first connects broker set default message sent subscribers broker detects publishing client unexpectedly disconnected broker clients interact broker system may contain several broker servers exchange data based current subscribers topics minimal mqtt control message little two bytes data control message carry nearly 256 megabytes data needed fourteen defined message types used connect disconnect client broker publish data acknowledge receipt data supervise connection client server mqtt relies tcp protocol data transmission variant mqtt-sn used transports udp bluetooth mqtt sends connection credentials plain text format include measures security authentication provided underlying tcp transport using measures protect integrity transferred information interception duplication waits connection established server creates link nodes waits mqtt client finish work must tcp/ip session disconnect returns immediately application thread passing request mqtt client connection broker specify quality service measure classified increasing order overhead field affect handling underlying tcp data transmissions used mqtt senders receivers several projects implement mqtt examples | [
10242,
11267,
1030,
6153,
9225,
8211,
6681,
6682,
10271,
6689,
9251,
2085,
7208,
7722,
7214,
8238,
562,
1586,
9269,
11321,
3133,
5181,
6723,
5700,
8265,
4687,
7248,
10341,
10344,
3695,
4723,
2679,
4729,
5251,
649,
9868,
3218,
11413,
152,
... | Validation |
9,366 | 2 | Real-time_operating_system:real-time operating system real-time operating system rtos operating system os intended serve real-time applications process data comes typically without buffer delays processing time requirements including os delay measured tenths seconds shorter increments time real-time system time bound system well defined fixed time constraints processing must done within defined constraints system fail either event driven time sharing event driven systems switch tasks based priorities time sharing systems switch task based clock interrupts rtoss use pre-emptive scheduling algorithm key characteristic rtos level consistency concerning amount time takes accept complete application task variability 'jitter 'hard real-time operating system less jitter 'soft real-time operating system chief design goal high throughput rather guarantee soft hard performance category rtos usually generally meet deadline soft real-time os meet deadline deterministically hard real-time os rtos advanced algorithm scheduling scheduler flexibility enables wider computer-system orchestration process priorities real-time os frequently dedicated narrow set applications key factors real-time os minimal interrupt latency minimal thread switching latency real-time os valued quickly predictably respond amount work perform given period time see comparison real-time operating systems comprehensive list also see list operating systems types operating systems common designs time sharing designs switch tasks often strictly needed give smoother multitasking giving illusion process user sole use machine early cpu designs needed many cycles switch tasks cpu could nothing else useful example 20 mhz 68000 processor typical late 1980s task switch times roughly 20 microseconds contrast 100 mhz arm cpu 2008 switches less 3 microseconds early oses tried minimize wasting cpu time avoiding unnecessary task switching typical designs task three states tasks blocked ready time generally one task run time per cpu number items ready queue vary greatly depending number tasks system needs perform type scheduler system uses simpler non-preemptive still multitasking systems task give time cpu tasks cause ready queue greater number overall tasks ready executed state resource starvation usually data structure ready list scheduler designed minimize worst-case length time spent scheduler critical section preemption inhibited cases interrupts disabled choice data structure depends also maximum number tasks ready list never tasks ready list doubly linked list ready tasks likely optimal ready list usually contains tasks occasionally contains list sorted priority way finding highest priority task run require iterating entire list inserting task requires walking ready list reaching either end list task lower priority task inserted care must taken inhibit preemption search longer critical sections divided small pieces interrupt occurs makes high priority task ready insertion low priority task high priority task inserted run immediately low priority task inserted critical response time sometimes called flyback time time takes queue new ready task restore state highest priority task running well-designed rtos readying new task take 3 20 instructions per ready-queue entry restoration highest-priority ready task take 5 30 instructions advanced systems real-time tasks share computing resources many non-real-time tasks ready list arbitrarily long systems scheduler ready list implemented linked list would inadequate commonly used rtos scheduling algorithms multitasking operating system like unix poor real-time tasks scheduler gives highest priority jobs lowest demand computer way ensure time-critical job access enough resources multitasking systems must manage sharing data hardware resources among multiple tasks usually unsafe two tasks access specific data hardware resource simultaneously three common approaches resolve problem general-purpose operating systems usually allow user programs mask disable interrupts user program could control cpu long wishes modern cpus allow user mode code disable interrupts control considered key operating system resource many embedded systems rtoss however allow application run kernel mode greater system call efficiency also permit application greater control operating environment without requiring os intervention single-processor systems application running kernel mode masking interrupts lowest overhead method prevent simultaneous access shared resource interrupts masked current task make blocking os call current task exclusive use cpu since task interrupt take control critical section protected task exits critical section must unmask interrupts pending interrupts execute temporarily masking interrupts done longest path critical section shorter desired maximum interrupt latency typically method protection used critical section instructions contains loops method ideal protecting hardware bit-mapped registers bits controlled different tasks shared resource must reserved without blocking tasks waiting flash memory written better use mechanisms also available general-purpose operating systems mutex os-supervised interprocess messaging mechanisms involve system calls usually invoke os dispatcher code exit typically take hundreds cpu instructions execute masking interrupts may take one instruction processors non-recursive mutex either locked unlocked task locked mutex tasks must wait mutex unlocked owner original thread task may set timeout wait mutex several well-known problems mutex based designs priority inversion deadlocks priority inversion high priority task waits low priority task mutex lower priority task given cpu time finish work typical solution task owns mutex 'inherit priority highest waiting task simple approach gets complex multiple levels waiting task waits mutex locked task b waits mutex locked task c handling multiple levels inheritance causes code run high priority context thus cause starvation medium-priority threads deadlock two tasks lock mutex without timeouts wait forever task mutex creating cyclic dependency simplest deadlock scenario occurs two tasks alternately lock two mutex opposite order deadlock prevented careful design approach resource sharing tasks send messages organized message passing scheme paradigm resource managed directly one task another task wants interrogate manipulate resource sends message managing task although real-time behavior less crisp semaphore systems simple message-based systems avoid protocol deadlock hazards generally better-behaved semaphore systems however problems like semaphores possible priority inversion occur task working low-priority message ignores higher-priority message message originating indirectly high priority task incoming message queue protocol deadlocks occur two tasks wait send response messages since interrupt handler blocks highest priority task running since real-time operating systems designed keep thread latency minimum interrupt handlers typically kept short possible interrupt handler defers interaction hardware possible typically necessary acknowledge disable interrupt wo n't occur interrupt handler returns notify task work needs done done unblocking driver task releasing semaphore setting flag sending message scheduler often provides ability unblock task interrupt handler context os maintains catalogues objects manages threads mutexes memory updates catalogue must strictly controlled reason problematic interrupt handler calls os function application act also os function called interrupt handler could find object database inconsistent state application update two major approaches deal problem unified architecture segmented architecture rtoss implementing unified architecture solve problem simply disabling interrupts internal catalogue updated downside interrupt latency increases potentially losing interrupts segmented architecture make direct os calls delegates os related work separate handler handler runs higher priority thread lower interrupt handlers advantage architecture adds cycles interrupt latency result oses implement segmented architecture predictable deal higher interrupt rates compared unified architecture similarly system management mode x86 compatible hardware take much time returns control operating system generally wrong write real-time software x86 hardware memory allocation critical real-time operating system operating systems first stability memory leaks memory allocated freed use device work indefinitely without ever needing reboot reason dynamic memory allocation frowned upon whenever possible required memory allocation specified statically compile time another reason avoid dynamic memory allocation memory fragmentation frequent allocation releasing small chunks memory situation may occur available memory divided several sections rtos incapable allocating large enough continuous block memory although enough free memory secondly speed allocation important standard memory allocation scheme scans linked list indeterminate length find suitable free memory block unacceptable rtos since memory allocation occur within certain amount time mechanical disks much longer unpredictable response times swapping disk files used reasons ram allocation discussed simple fixed-size-blocks algorithm works quite well simple embedded systems low overhead | [
2560,
7170,
9218,
516,
5638,
6155,
8720,
7187,
10776,
25,
8732,
4637,
9759,
9762,
4643,
6180,
5671,
2605,
5680,
7217,
10803,
3124,
10809,
1594,
1083,
11325,
2623,
576,
2625,
6207,
3652,
8262,
6221,
3160,
2137,
10333,
7774,
97,
10851,
5220... | None |
9,367 | 5 | Wireless_Datagram_Protocol:wireless datagram protocol wireless datagram protocol wdp defines movement information receiver sender resembles user datagram protocol internet protocol suite wireless datagram protocol wdp protocol wap architecture covers transport layer protocols internet model general transport service wdp offers upper layers invisible interface independent underlying network technology used consequence interface common transport protocols upper layer protocols wap architecture operate independently underlying wireless network letting transport layer deal physical network-dependent issues global interoperability acquired using mediating gateways | [
1285,
1160,
5875,
11413,
5531
] | Test |
9,368 | 3 | Tensilica:tensilica tensilica company based silicon valley semiconductor intellectual property core business part cadence design systems tensilica known customizable xtensa configurable processor microprocessor core products include hifi audio/voice dsps software library 225 codecs cadence 100 software partners vision dsps handle complex algorithms imaging video computer vision neural networks connx family baseband dsps ranging dual-mac connx d2 64-mac connx bbe64ep tensilica founded 1997 chris rowen one founders mips technologies employed earl killian contributed mips architecture director architecture march 11 2013 cadence design systems announced intent buy tensilica approximately 380 million cash cadence completed acquisition april 2013 cash outlay closing approximately 326 million cadence tensilica develops sip blocks included chip ic designs products licensees system chip embedded systems tensilica processors delivered synthesizable rtl easy integration chip designs xtensa processors range small low-power cache-less microcontroller high-performance 16-way simd processors 3-issue vliw dsp cores 1 tmac/sec neural network processors cadence standard dsps based xtensa architecture xtensa architecture offers user-customizable instruction set automated customization tools extend xtensa base instruction set including simd instructions new register files xtensa instruction set 32-bit architecture compact 16- 24-bit instruction set base instruction set 80 risc instructions includes 32-bit alu 64 general-purpose 32-bit registers six special-purpose registers amd trueaudio found e.g playstation 4 kaveri desktop apus amd graphics cards based cadence tensilica hifi ep audio dsp microsoft hololens uses special custom-designed tsmc-fabricated 28nm coprocessor 24 tensilica dsp cores around 65 million logic gates 8 mb sram additional layer 1 gb low-power ddr3 ram espressif esp8266 esp32 wi-fi iot socs spreadtrum licensed hifi dsp smartphones via technologies uses hifi dsp soc set top box tablets mobile devices realtek standardized hifi audio dsp mobile pc products brand name tensilica combination word tensile meaning capable extended word silica silicon element integrated circuits primarily made | [
8481,
6818,
7234,
3911,
9911,
9391,
2224,
4465,
10675,
6391,
5464,
11549,
6207
] | None |
9,369 | 3 | F16C:f16c f16c previously/informally known cvt16 instruction set x86 instruction set architecture extension provides support converting half-precision standard ieee single-precision floating-point formats cvt16 instruction set announced amd may 1 2009 extension 128-bit sse core instructions x86 amd64 instruction set cvt16 revision part sse5 instruction set proposal announced august 30 2007 supplemented xop fma4 instruction sets revision makes binary coding proposed new instructions compatible intel avx instruction extensions functionality instructions unchanged recent documents name f16c formally used intel amd x86-64 architecture specifications variants convert four floating-point values xmm register 8 floating-point values ymm register instructions abbreviations vector convert packed half packed single vice versa 8-bit immediate argument codice_5 selects rounding mode values 0–4 select nearest truncate mode set codice_6 support instructions indicated bit 29 ecx cpuid eax=1 | [
9092,
2821,
1798,
4491,
6924,
4237,
5645,
7313,
4886,
6038,
7963,
9500,
2719,
2088,
2094,
9391,
8120,
8506,
2237,
1085,
8125,
8126,
833,
6978,
7234,
9541,
3142,
11080,
2764,
5326,
977,
2514,
3537,
2516,
5844,
9428,
4603,
7387,
4444,
8795,... | Test |
9,370 | 2 | University_of_Michigan_Executive_System:university michigan executive system university michigan executive system umes batch operating system developed university michigan 1958 widely used many universities based general motors executive system ibm 701 umes revised work mainframe computers use university michigan time ibm 704 709 7090 work better small student jobs expected primary work load university umes use university michigan 1967 mts phased take advantage newer virtual memory time-sharing technology became available ibm system/360 model 67 | [
6675,
7187,
10776,
25,
4637,
9762,
5158,
7217,
10803,
7733,
9784,
10809,
573,
576,
8262,
10333,
97,
9829,
6248,
8298,
7285,
9335,
2168,
1147,
2172,
3197,
1150,
2179,
10883,
6797,
9361,
9366,
6296,
7325,
9887,
7848,
8879,
3248,
6837,
1219,... | None |
9,371 | 3 | ARC_(processor):arc processor arc argonaut risc core embedded processors family 32-bit central processing units cpus originally designed arc international arc processors optimized wide range uses widely used system chip soc devices storage home mobile automotive internet things iot applications licensed 200 organizations shipped 1.5 billion products per year arc processors use reduced instruction set computing risc employ 16-/32-bit arcompact instruction set architecture isa provides good performance code density embedded host soc applications arc concept developed initially within argonaut games series 3d pipeline development projects starting super fx chip super nintendo entertainment system 1995 argonaut split argonaut technologies limited atl variety technology projects argonaut software limited asl start 1996 general manager argonaut john edelson started reducing atl projects brender motion capture investing development arc concept september 1996 rick clucas decided value arc processor people using rather argonaut projects using asked bob terwilliger join ceo rick clucas took role cto 1997 following investment apax partners atl became arc international totally independent argonaut games prior initial public offering london stock exchange underwritten goldman sachs five investment banks three related technology companies acquired metaware santa cruz california development modeling software vautomation nashua new hampshire peripheral semiconductor ip precise software nepean ontario rtos arc international acquired synopsys 2010 arc processors part synopsys designware series designers differentiate products using patented configuration technology tailor arc processor instance meet specific performance power area requirements configuration arc processors occurs design time using architect processor configurator core designed extensible allowing designers add custom instructions significantly increase performance reduce power consumption unlike embedded microprocessors extra instructions registers functionality added modular fashion customers analyse task break operations choose appropriate extensions develop create custom microprocessor might optimise speed energy efficiency code density extensions include example memory management unit mmu fast multiplier–accumulator usb host viterbi path decoder user proprietary rtl functions processors synthesizable implemented foundry process supported complete suite development tools | [
5378,
7170,
8450,
6925,
1170,
1298,
7445,
8861,
3493,
4773,
6311,
9638,
682,
4269,
3886,
9391,
2224,
4144,
2226,
3762,
11314,
1462,
823,
6716,
8508,
6207,
10945,
7234,
7235,
6084,
11333,
3014,
3142,
3911,
9928,
6607,
2517,
9685,
3159,
456... | None |
9,372 | 5 | TCP_half-open:tcp half-open term half-open refers tcp connections whose state synchronization two communicating hosts possibly due crash one side connection process established also known embryonic connection lack synchronization could due malicious intent according rfc 793 tcp connection referred half-open host one end tcp connection crashed otherwise removed socket without notifying end remaining end idle connection may remain half-open state unbounded periods time nowadays however term half-open connection often used describe embryonic connection i.e tcp connection process established tcp three state system opening connection first originating endpoint sends syn packet destination b embryonic state specifically syn_sent awaiting response b updates kernel information indicate incoming connection sends request open channel back syn/ack packet point b also embryonic state specifically syn_rcvd note b put state another machine outside b control normal circumstances see denial-of-service attack deliberate failure cases receive syn/ack b update tables enough information send receive send final ack back b b receives final ack also sufficient information two-way communication connection fully open endpoints established state | [
2409,
2299,
10924,
6697
] | None |
9,373 | 4 | Project_25:project 25 project 25 p25 apco-25 suite standards digital mobile radio communications designed use public safety organizations north america p25 radios direct replacement analog uhf example fm radios add ability transfer data well voice allowing natural implementation encryption messaging p25 radios commonly implemented dispatch organizations police fire ambulance emergency rescue service using vehicle-mounted radios combined walkie-talkie handheld use starting around 2012 products became available newer phase 2 modulation protocol older protocol known p25 became p25 phase 1 p25 phase 2 products use advanced ambe2+ vocoder allows audio pass compressed bitstream provides two tdma voice channels rf bandwidth 12.5 khz phase 1 provide one voice channel two protocols compatible however p25 phase 2 infrastructure provide dynamic transcoder feature translates phase 1 phase 2 needed addition phase 2 radios backwards compatible phase 1 modulation analog fm modulation per standard hand eu area created standard terrestrial trunked radio similar project 25 p25 fills similar role tetra dmr protocols public safety radios upgraded analog fm digital since 1990s increased use data radio systems features gps location trunking text messaging metering encryption various user protocols different public safety radio spectrum made difficult public safety agencies achieve interoperability widespread acceptance however lessons learned disasters united states faced past decades forced agencies assess requirements disaster basic infrastructure failed meet growing demands public safety digital radio communication united states federal communications commission fcc direction united states congress initiated 1988 inquiry recommendations users manufacturers improve existing communication systems based recommendations find solutions best serve needs public safety management october 1989 apco project 25 came existence coalition steering committee consisting representatives above-mentioned agencies along fpic department homeland security federal partnership interoperable communication coast guard department commerce national institute standards technology nist office law enforcement standards established decide priorities scope technical development p25 interoperable emergency communication integral initial response public health community safety national security economic stability problems experienced disaster events one serious poor communication due lack appropriate efficient means collect process transmit important information timely fashion cases radio communication systems incompatible inoperable within jurisdiction within departments agencies community non-operability occurs due use outdated equipment limited availability radio frequencies isolated independent planning lack coordination cooperation agencies community priorities competing resources funding ownership control communications systems recognizing understanding need project 25 p25 initiated collaboratively public safety agencies manufacturers address issue emergency communication systems p25 collaborative project ensure two-way radios interoperable goal p25 enable public safety responders communicate thus achieve enhanced coordination timely response efficient effective use communications equipment p25 established address need common digital public safety radio communications standards first-responders homeland security/emergency response professionals telecommunications industry association tr-8 engineering committee facilitates work role ansi-accredited standards development organization sdo published p25 suite standards tia-102 series documents include 49 separate parts land mobile radio tdma implementations technology public safety p25-compliant systems increasingly adopted deployed radios communicate analog mode legacy radios either digital analog mode p25 radios additionally deployment p25-compliant systems allow high degree equipment interoperability compatibility p25 standards use proprietary improved multi-band excitation imbe advanced multi-band excitation ambe+2 voice codecs designed digital voice systems inc. encode/decode analog audio signals rumored licensing cost voice-codecs used p25 standard devices main reason cost p25 compatible devices high p25 may used talk around mode without intervening equipment two radios conventional mode two radios communicate repeater base station without trunking trunked mode traffic automatically assigned one voice channels repeater base station protocol supports use data encryption standard des encryption 56 bit 2-key triple-des encryption three-key triple-des encryption advanced encryption standard aes encryption 256 bits keylength rc4 40 bits sold motorola advanced digital privacy encryption protocol also supports accordion 1.3 baton firefly mayfly saville type 1 ciphers p25 suite standards specify eight open interfaces various components land mobile radio system interfaces p25-compliant technology deployed two main phases future phases yet finalized phase 1 radio systems operate 12.5 khz digital mode using fdma access method phase 1 radios use continuous 4 level fm c4fm modulation—a special type 4fsk modulation—for digital transmissions 4,800 baud 2 bits per symbol yielding 9,600 bits per second total channel throughput 9,600 4,400 voice data generated imbe codec 2,800 forward error correction 2,400 signalling control functions receivers designed c4fm standard also demodulate compatible quadrature phase shift keying cqpsk standard parameters cqpsk signal chosen yield signal deviation symbol time c4fm phase 1 uses imbe voice codec systems involve standardized service facility specifications ensuring manufacturers compliant subscriber radio access services described specifications abilities include backward compatibility interoperability systems across system boundaries regardless system infrastructure addition p25 suite standards provides open interface radio frequency rf subsystem facilitate interlinking different vendors systems improve spectrum use p25 phase 2 developed trunking systems using 2-slot tdma scheme required new trunking systems 700 mhz band phase 2 uses ambe+2 voice codec reduce needed bitrate one voice channel require 6,000 bits per second including error correction signalling phase 2 backwards compatible phase 1 due tdma vs fdma operation although tdma radios systems capable operating phase 1 fdma required subscriber radio use tdma transmissions without time source therefore direct radio radio communications talkaround resorts fdma subscriber radios also resort narrow-band fm least common denominator almost two way radio could make analog narrow-band fm de facto interoperability mode time originally implementation phase 2 planned use 6.25 khz bandwidth per frequency allocation fdma however proved advantageous use existing 12.5 khz frequency allocations tdma mode number reasons first eliminated huge administrative process reallocating frequency assignments fcc existing phase 1 users second reduced amount base station transmitters one transmitter needed broadcast two voice slots third allowed subscriber radios save battery life transmitting half time also yields ability subscriber radio listen respond system requests transmissions phase 2 known 6.25 khz bandwidth equivalent satisfies fcc requirement voice transmissions occupy less bandwidth voice traffic phase 2 system transmits full 12.5 khz per frequency allocation phase 1 system however faster data rate 12 kbit/s allowing two simultaneous voice transmissions subscriber radios also transmit full 12.5 khz on/off repeating fashion resulting half transmission thus equivalent 6.25 khz per radio accomplished using ambe voice coder uses half rate phase 1 imbe voice coders 2000 2009 european telecommunications standards institute etsi tia working collaboratively public safety partnership project project mesa mobility emergency safety applications sought define unified set requirements next-generation aeronautical terrestrial digital wideband/broadband radio standard could used transmit receive voice video high-speed data wide-area multiple-agency networks deployed public safety agencies final functional technical requirements released etsi expected shape next phases american project 25 european dmr dpmr tetra interest industry followed since requirements could met available commercial off-the-shelf technology project closed 2010 united states 2008 wireless spectrum auction fcc allocated 20 mhz 700 mhz uhf radio band spectrum freed digital tv transition public safety networks fcc expects providers employ lte high-speed data video applications p25 systems resort using band signaling continuous tone-coded squelch system ctcss tone digital-coded squelch dcs codes access control instead use called network access code nac included outside digital voice frame 12 bit code prefixes every packet data sent including carrying voice transmissions nac feature similar ctcss dcs analog radios radios programmed pass audio receiving correct nac nacs programmed three-hexadecimal-digit code transmitted along digital signal transmitted since nac three-hexadecimal-digit number 12 bits 4,096 possible nacs programming far analog methods combined three possible nacs special functions adoption standards slowed budget problems us however funding communications upgrades department homeland security usually requires migrating project 25 also used countries worldwide including australia new zealand brazil canada india russia mid-2004 660 networks p25 deployed 54 countries time 2005 european terrestrial trunked radio tetra deployed sixty countries preferred choice europe china countries largely based tetra systems many times cheaper p25 systems 900 vs 6,000 radio time however p25 radio prices rapidly approaching parity tetra radio prices increased competition p25 market majority p25 networks based northern america advantage p25 system coverage frequency bandwidth earlier analog systems use channels easily upgraded one one p25 networks also allow intelligent migration analog radios digital radios operating within network p25 tetra offer varying degrees functionality depending available radio spectrum terrain project budget interoperability major goal p25 many p25 features present interoperability challenges theory p25 compliant equipment interoperable practice interoperable communications n't achievable without effective governance standardized operating procedures effective training exercises inter-jurisdictional coordination difficulties inherent developing p25 networks using features digital voice encryption trunking sometimes result feature-backlash organizational retreat minimal feature-free p25 implementations fulfill letter project 25 migration requirement without realizing benefits thereof additionally technical issue per se frictions often result unwieldy bureaucratic inter-agency processes tend develop order coordinate interoperability decisions securecomm 2011 conference london security researcher steve glass presented paper written co-author matt ames explained des-ofb motorola proprietary adp rc4 based ciphers vulnerable brute force key recovery research result op25 project uses gnu radio ettus universal software radio peripheral usrp implement open source p25 packet sniffer analyzer op25 project founded steve glass early 2008 performing research wireless networks part phd thesis paper available download nicta website 2011 wall street journal published article describing research security flaws system including user interface makes difficult users recognize transceivers operating secure mode according article r esearchers university pennsylvania overheard conversations included descriptions undercover agents confidential informants plans forthcoming arrests information technology used surveillance operations researchers found messages sent radios sent segments blocking portion segments result entire message jammed research also shows radios effectively jammed single radio short range using highly modified pink electronic child ’ toy standard used radios 'provides convenient means attacker continuously track location radio ’ user systems jammers expend lot power block communications p25 radios allow jamming relatively low power enabling researchers prevent reception using 30 toy pager designed pre-teens report presented 20th usenix security symposium san francisco august 2011 report noted number security flaws project 25 system specific way implemented inherent security design report find breaks p25 encryption however observed large amounts sensitive traffic sent clear due implementations problems found switch markings secure clear modes difficult distinguish ∅ vs. exacerbated fact p25 radios set secure mode continue operate without issuing warning another party switches clear mode addition report authors said many p25 systems change keys often increasing risk individual radio net may properly keyed forcing users net transmit clear maintain communications radio one design choice use lower levels error correction portions encoded voice data deemed less critical intelligibility result bit errors may expected typical transmissions harmless voice communication presence errors force use stream ciphers tolerate bit errors prevents use standard technique message authentication codes macs protect message integrity stream cipher attacks varying levels error correction implemented breaking p25 message frames subframes allows attacker jam entire messages transmitting certain short subframes critical reception entire frame result attacker effectively jam project 25 signals average power levels much lower power levels used communication attacks targeted encrypted transmissions forcing users transmit clear project 25 radios designed work existing two-way radio frequency channels use spread spectrum modulation inherently jam-resistant optimal spread spectrum system require effective jammer use 1,000 times much power 30 db individual communicators according report p25 jammer could effectively operate 1/25th power 14 db less communicating radios authors developed proof-of-concept jammer using texas instruments cc1110 single chip radio found inexpensive toy certain metadata fields project 25 protocol encrypted allowing attacker perform traffic analysis identify users project 25 radios respond bad data packets addressed retransmission request attacker deliberately send bad packets forcing specific radio transmit even user attempting maintain radio silence tracking authorized users considered feature p25 referred presence report authors concluded saying reasonable wonder protocol developed many years used sensitive critical applications difficult use vulnerable attack authors separately issued set recommendations p25 users mitigate problems found include disabling secure/clear switch using network access codes segregate clear encrypted traffic compensating unreliability p25 over-the-air rekeying extending key life p25 tetra used fifty-three countries worldwide public safety private sector radio networks differences features capacities | [
2948,
3140,
262,
7652,
776,
2920,
7400,
3115,
3629,
11181,
7887,
1501
] | Test |
9,374 | 3 | Kernel_debugger:kernel debugger kernel debugger debugger present operating system kernels ease debugging kernel development kernel developers kernel debugger might stub implementing low-level operations full-blown debugger gdb running another machine sending commands stub serial line network connection might provide command line used directly machine debugged operating systems operating system kernels contain kernel debugger | [
9218,
9190,
7561,
8266,
2255,
6352,
8976,
1374
] | Test |
9,375 | 4 | WannaCry_ransomware_attack:wannacry ransomware attack wannacry ransomware attack may 2017 worldwide cyberattack wannacry ransomware cryptoworm targeted computers running microsoft windows operating system encrypting data demanding ransom payments bitcoin cryptocurrency propagated eternalblue exploit developed united states national security agency nsa older windows systems eternalblue stolen leaked group called shadow brokers months prior attack microsoft released patches previously close exploit much wannacry spread organizations applied using older windows systems past end-of-life wannacry also took advantage installing backdoors onto infected systems attack stopped within days discovery due emergency patches released microsoft discovery kill switch prevented infected computers spreading wannacry attack estimated affected 200,000 computers across 150 countries total damages ranging hundreds millions billions dollars security experts believed preliminary evaluation worm attack originated north korea agencies working country december 2017 united states united kingdom australia formally asserted north korea behind attack new variant wannacry ransomware forced taiwan semiconductor manufacturing company tsmc temporarily shut several chip-fabrication factories august 2018 virus spread 10,000 machines tsmc advanced facilities wannacry ransomware cryptoworm targeted computers running microsoft windows operating system encrypting data demanding ransom payments bitcoin cryptocurrency worm also known wannacrypt wana decrypt0r 2.0 wanacrypt0r 2.0 wan na decryptor considered network worm also includes transport mechanism automatically spread transport code scans vulnerable systems uses eternalblue exploit gain access doublepulsar tool install execute copy wannacry versions 0 1 2 created using microsoft visual c++ 6.0 eternalblue exploit windows server message block smb protocol released shadow brokers much attention comment around event occasioned fact u.s. national security agency nsa exploit likely stolen already discovered vulnerability used create exploit offensive work rather report microsoft microsoft eventually discovered vulnerability tuesday 14 march 2017 issued security bulletin ms17-010 detailed flaw announced patches released windows versions currently supported time windows vista windows 7 windows 8.1 windows 10 windows server 2008 windows server 2008 r2 windows server 2012 windows server 2016 doublepulsar backdoor tool also released shadow brokers 14 april 2017 starting 21 april 2017 security researchers reported tens thousands computers doublepulsar backdoor installed 25 april reports estimated number infected computers could several hundred thousand numbers increasing every day wannacry code take advantage existing doublepulsar infection installs executed wannacry malware first checks kill switch domain name found ransomware encrypts computer data attempts exploit smb vulnerability spread random computers internet laterally computers network modern ransomware payload displays message informing user files encrypted demands payment around us 300 bitcoin within three days us 600 within seven days three hardcoded bitcoin addresses wallets used receive payments victims wallets transactions balances publicly accessible even though cryptocurrency wallet owners remain unknown several organizations released detailed technical writeups malware including microsoft cisco malwarebytes symantec mcafee attack began friday 12 may 2017 evidence pointing initial infection asia 07:44 utc initial infection likely exposed vulnerable smb port rather email phishing initially assumed within day code reported infected 230,000 computers 150 countries organizations installed microsoft security update april 2017 affected attack still running unsupported versions microsoft windows windows xp windows server 2003 particularly high risk security patches released since april 2014 exception one emergency patch released may 2014 kaspersky lab study reported however less 0.1 percent affected computers running windows xp 98 percent affected computers running windows 7 controlled testing environment cybersecurity firm kryptos logic found unable infect windows xp system wannacry using exploits payload failed load caused operating system crash rather actually execute encrypt files however executed manually wannacry could still operate windows xp experts quickly advised affected users paying ransom due reports people getting data back payment high revenues would encourage campaigns 14 june 2017 attack subsided total 327 payments totaling us 130,634.77 51.62396539 xbt transferred day initial attack may microsoft released out-of-band security updates end life products windows xp windows server 2003 windows 8 patches created february year following tip vulnerability january year organizations advised patch windows plug vulnerability order protect cyber attack head microsoft cyber defense operations center adrienne hall said “ due elevated risk destructive cyber-attacks time made decision take action applying updates provides protection potential attacks characteristics similar wannacrypt alternative name wannacry ” researcher marcus hutchins accidentally discovered kill switch domain hardcoded malware registering domain name dns sinkhole stopped attack spreading worm ransomware encrypted computer files unable connect domain computers infected wannacry website registration unable help already infected systems severely slowed spread initial infection gave time defensive measures deployed worldwide particularly north america asia attacked extent elsewhere 14 may first variant wannacry appeared new second kill-switch registered matt suiche day followed second variant third last kill-switch 15 may registered check point threat intelligence analysts days later new version wannacry detected lacked kill switch altogether 19 may reported hackers trying use mirai botnet variant effect distributed attack wannacry kill-switch domain intention knocking offline 22 may hutchins protected domain switching cached version site capable dealing much higher traffic loads live site separately researchers university college london boston university reported paybreak system could defeat wannacry several families ransomware recovering keys used encrypt user data discovered windows encryption apis used wannacry may completely clear prime numbers used generate payload private keys memory making potentially possible retrieve required key yet overwritten cleared resident memory key kept memory wannacry process killed computer rebooted infected behaviour used french researcher develop tool known wannakey automates process windows xp systems approach iterated upon second tool known wanakiwi tested work windows 7 server 2008 r2 well within four days initial outbreak new infections slowed trickle due responses linguistic analysis ransom notes indicated authors likely fluent chinese proficient english versions notes languages probably human-written rest seemed machine-translated according analysis fbi cyber behavioral analysis center computer created ransomware language files hangul language fonts installed evidenced presence \fcharset129 rich text format tag metadata language files also indicated computers created ransomware set used korea google security researcher initially posted tweet referencing code similarities wannacry previous malware cybersecurity companies kaspersky lab symantec said code similarities previously used lazarus group believed carried cyberattack sony pictures 2014 bangladesh bank heist 2016—and linked north korea could also either simple re-use code another group attempt shift blame—as cyber false flag operation leaked internal nsa memo alleged also linked creation worm north korea brad smith president microsoft said believed north korea originator wannacry attack uk national cyber security centre reached conclusion 18 december 2017 united states government formally announced publicly considers north korea main culprit behind wannacry attack president trump homeland security advisor tom bossert wrote op-ed wall street journal charge saying make allegation lightly based evidence press conference following day bossert said evidence indicates kim jong-un given order launch malware attack bossert said canada new zealand japan agree united states assessment evidence links attack north korea united kingdom foreign commonwealth office says also stands behind united states assertion north korea however denied responsible cyberattack 6 september 2018 us department justice doj announced formal charges park jin-hyok involvement sony pictures hack 2014 doj contended park north korean hacker working part team experts north korean reconnaissance general bureau department justice asserted team also involved wannacry attack among activities ransomware campaign unprecedented scale according europol estimates around 200,000 computers infected across 150 countries according kaspersky lab four affected countries russia ukraine india taiwan one largest agencies struck attack national health service hospitals england scotland 70,000 devices – including computers mri scanners blood-storage refrigerators theatre equipment – may affected 12 may nhs services turn away non-critical emergencies ambulances diverted 2016 thousands computers 42 separate nhs trusts england reported still running windows xp 2018 report members parliament concluded 200 nhs hospitals organizations checked wake wannacry attack still failed cyber security checks nhs hospitals wales northern ireland unaffected attack nissan motor manufacturing uk tyne wear england halted production ransomware infected systems renault also stopped production several sites attempt stop spread ransomware spain telefónica fedex deutsche bahn hit along many countries companies worldwide attack impact said relatively low compared potential attacks type could much worse marcus hutchins discovered kill-switch built creators specifically targeted highly critical infrastructure like nuclear power plants dams railway systems according cyber-risk-modeling firm cyence economic losses cyber attack could reach us 4 billion groups estimating losses hundreds millions following alphabetical list organisations confirmed affected number experts highlighted nsa non-disclosure underlying vulnerability loss control eternalblue attack tool exploited edward snowden said nsa privately disclosed flaw used attack hospitals found lost attack may happened british cybersecurity expert graham cluley also sees culpability part u.s. intelligence services according others could done something ages ago get problem fixed n't also said despite obvious uses tools spy people interest duty protect countries citizens others also commented attack shows practice intelligence agencies stockpile exploits offensive purposes rather disclosing defensive purposes may problematic microsoft president chief legal officer brad smith wrote repeatedly exploits hands governments leaked public domain caused widespread damage equivalent scenario conventional weapons would u.s. military tomahawk missiles stolen russian president vladimir putin placed responsibility attack u.s. intelligence services created eternalblue 17 may 2017 united states bipartisan lawmakers introduced patch act aims exploits reviewed independent board balance need disclose vulnerabilities national security interests increasing transparency accountability maintain public trust process 15 june 2017 united states congress hold hearing attack two subpanels house science committee hear testimonies various individuals working government non-governmental sector us improve protection mechanisms systems similar attacks future cybersecurity researcher working loose collaboration uk national cyber security centre researched malware discovered kill switch later globally dispersed security researchers collaborated online develop open source tools allow decryption without payment circumstances snowden states nsa-enabled ransomware eats internet help comes researchers spy agencies asks case experts also used publicity around attack chance reiterate value importance good regular secure backups good cybersecurity including isolating critical systems using appropriate software latest security patches installed adam segal director digital cyberspace policy program council foreign relations stated patching updating systems broken basically private sector government agencies addition segal said governments apparent inability secure vulnerabilities opens lot questions backdoors access encryption government argues needs private sector security arne schönbohm president germany federal office information security bsi stated current attacks show vulnerable digital society wake-up call companies finally take security seriously effects attack also political implications united kingdom impact national health service quickly became political claims effects exacerbated government underfunding nhs particular nhs ceased paid custom support arrangement continue receiving support unsupported microsoft software used within organization including windows xp home secretary amber rudd refused say whether patient data backed shadow health secretary jon ashworth accused health secretary jeremy hunt refusing act critical note microsoft national cyber security centre ncsc national crime agency received two months previously others argued hardware software vendors often fail account future security flaws selling systems − due technical design market incentives − eventually wo n't able properly receive apply patches nhs denied still using xp claiming 4.7 devices within organization ran windows xp cost attack nhs estimated £92 million disruption services upgrades attack nhs digital refused finance estimated £1 billion meet cyber essentials plus standard information security certification organized uk ncsc saying would constitute value money invested £60 million planned spend £150 million next two years address key cyber security weaknesses suggested future attack magnitude may defined terrorism act parliament adds provision stating malicious use computer matter world located degrades seriously harms healthcare power life support critical infrastructure form terrorism may elicit proportional response possibly could added revision policing crime act 2017 late june hundreds computer users reported sent email someone multiple people claiming developers wannacry email threatened destroy victims data unless sent 0.1 btc bitcoin address hackers | [
1024,
1540,
5636,
4117,
8726,
535,
9761,
3619,
4644,
4133,
6707,
5173,
5693,
1087,
10823,
1608,
3657,
8779,
4689,
1622,
4703,
8288,
8292,
7786,
107,
8299,
3704,
10875,
3711,
8320,
7809,
5764,
2187,
6797,
4240,
1688,
2717,
7855,
9904,
6834... | Test |
9,376 | 9 | Modelica:modelica modelica object-oriented declarative multi-domain modeling language component-oriented modeling complex systems e.g. systems containing mechanical electrical electronic hydraulic thermal control electric power process-oriented subcomponents free modelica language developed non-profit modelica association modelica association also develops free modelica standard library contains 1360 generic model components 1280 functions various domains version 3.2.1 modelica resembles object-oriented programming languages c++ java differs two important respects first modelica modeling language rather conventional programming language modelica classes compiled usual sense translated objects exercised simulation engine simulation engine specified language although certain required capabilities outlined second although classes may contain algorithmic components similar statements blocks programming languages primary content set equations contrast typical assignment statement left-hand side statement assigned value calculated expression right-hand side equation may expressions right- left-hand sides example equations describe assignment equality modelica terms equations pre-defined causality simulation engine may usually must manipulate equations symbolically determine order execution components equation inputs outputs modelica design effort initiated september 1996 hilding elmqvist goal develop object-oriented language modeling technical systems order reuse exchange dynamic system models standardized format modelica 1.0 based phd thesis hilding elmqvist experience modeling languages allan dymola nmf objectmath omola sidops+ smile hilding elmqvist key architect modelica many people contributed well see appendix e september 1997 version 1.0 modelica specification released basis prototype implementation within commercial dymola software system year 2000 non-profit modelica association formed manage continually evolving modelica language development free modelica standard library year usage modelica industrial applications started table presents timeline modelica specification history commercial front-ends modelica include amesim french company imagine sa part siemens plm software dymola swedish company dynasim ab part dassault systemes cymodelica american company cydesign labs esi group wolfram systemmodeler formerly mathmodelica swedish company wolfram mathcore ab part wolfram research simulationx german company esi iti gmbh maplesim canadian company maplesoft catia systems jmodelica.org extensible modelica-based open source platform optimization simulation analysis complex dynamic systems main objective project create industrially viable open source platform simulation optimization modelica models offering flexible platform serving virtual lab algorithm development research openmodelica open-source modelica-based modeling simulation environment intended industrial academic usage long-term development supported non-profit organization – open source modelica consortium osmc goal openmodelica effort create comprehensive open source modelica modeling compilation simulation environment based free software distributed binary source code form research teaching industrial usage free simulation environment scicos uses subset modelica component modeling support larger part modelica language currently development nevertheless still incompatibility diverging interpretation different tools concerning modelica language following code fragment shows simple example first order system formula_1 model firstorder equation end firstorder interesting things note example 'parameter qualifier indicates given variable time-invariant 'der operator represents symbolically time derivative variable also worth noting documentation strings associated declarations equations main application area modelica modeling physical systems basic structuring concepts shown hand simple examples electrical domain modelica four built-in types real integer boolean string typically user-defined types derived associate physical quantity unit nominal values attributes type voltage real quantity= electricalpotential unit= v type current real quantity= electricalcurrent unit= interaction component components defined physical ports called connectors e.g. electrical pin defined connector pin electrical pin end pin drawing connection lines ports meaning corresponding connector variables without flow prefix identical v corresponding connector variables flow prefix defined zero-sum equation sum corresponding flow variables zero motivation automatically fulfill relevant balance equations infinitesimally small connection point basic model component defined model contains equations describe relationship connector variables declarative form i.e. without specifying calculation order model capacitor equation end capacitor goal connected set model components leads set differential algebraic discrete equations number unknowns number equations identical modelica achieved requiring called balanced models full rules defining balanced models rather complex read however cases simple rule issued counts variables equations way simulation tools given variables equations must counted according following rule note standard input connectors realinput integerinput contribute count variables since new variables defined inside reason rule understood thinking capacitor defined pins contain flow variable i.e current check connected nothing corresponds set equation pin.i=0 pin must add equation flow variable obviously example extended cases kinds flow variables involved e.g forces torques etc. capacitor connected another balanced model one pins connection equation generated substitute two i=0 equations pins connected since connection equation corresponds two scalar equations connection operation leave balanced larger model constituted capacitor model connected capacitor model balanced since verification using openmodelica model gives fact another example containing input connectors physical connectors following component modelica standard library model signalvoltage equation end signalvoltage component signalvoltage balanced since checking openmodelica gives hierarchical model built-up basic models instantiating basic models providing suitable values model parameters connecting model connectors typical example following electrical circuit model circuit equation end circuit via language element annotation ... definitions added model influence simulation annotations used define graphical layout documentation version information basic set graphical annotations standardized ensure graphical appearance layout models different modelica tools freely available book modelica example contains many examples like along detailed explanations nearly language features modelica version 3.3 modelica designed domain neutral result used wide variety applications fluid systems example steam power generation hydraulics etc automotive applications especially powertrain mechanical systems example multi-body systems mechatronics etc. automotive sector many major automotive oems using modelica include ford general motors toyota bmw daimler modelica also increasingly used simulation thermo-fluid energy systems characteristics modelica acausal object-oriented domain neutral make well suited system-level simulation domain modelica well established | [
9345,
10764,
8079,
7326,
1443,
7593,
5677,
7983,
8113,
6450,
9915,
68,
5830,
11207,
587,
9431,
8162,
4454,
11625,
5612,
3567,
10102,
1917
] | Test |
9,377 | 2 | Windows_To_Go:windows go windows go feature windows 8 enterprise windows 8.1 enterprise windows 10 education windows 10 enterprise windows 10 pro limited education enterprise image allows boot run certain usb mass storage devices usb flash drives external hard disk drives certified microsoft compatible fully manageable corporate windows environment intended allow enterprise administrators provide users imaged version windows reflects corporate desktop creation windows go drives officially supported non-enterprise education windows 8.1 editions however enterprise education versions windows 10 supported information published describing various ways install windows go using version windows 8.x 10 bootable usb device windows 8 embedded versions windows windows embedded standard 7 supported booting usb storage devices april 2011 leak windows 8 build 7850 users noticed builds included program called portable workspace creator indicating intended create bootable usb drives windows 8 september 2011 microsoft officially announced windows go build conference distributed bootable 32 gb usb flash drives windows go pre-installed windows go several significant differences compared standard installation windows 8 non-removable storage hard disk drives solid-state drives windows go works usb 2.0 faster usb connections legacy bios uefi firmware usb drives used environment microsoft set specific requirements usb drive must meet order supported device june 2017 12 usb devices listed supported microsoft windows go using pc host hardware certified use either windows 7 windows 8 work well windows go although microsoft provide support feature windows rt macintosh computers possible boot windows go mac new companion device license microsoft software assurance employees use windows go software assurance licensed computer well home pc simon bisson writing zdnet called windows go one interesting features windows 8 noting even though using usb 2.0 port performance good noticeable lag calling useful way running windows 8 michael s. lasky writing laptopmag.com wrote departments want ensure employees safely access corporate network windows go usb drives incredibly convenient ability instantly remake windows pc secure personal computer worthwhile productive time-saver release windows 10 may 2019 update version 1903 microsoft announced windows go longer developed feature support os major feature updates therefore enable user stay current specific certified type performant usb media needed feature provide good user experience also longer produced oems | [
11270,
5643,
4624,
537,
540,
4637,
3102,
9762,
8227,
8740,
1577,
10281,
2101,
10812,
3648,
10306,
582,
10310,
1098,
7754,
10828,
4173,
4174,
9806,
9808,
4178,
10839,
603,
9819,
3170,
622,
9839,
4210,
7796,
1656,
6265,
7290,
4731,
1150,
10... | Test |
9,378 | 7 | TOA_Technologies:toa technologies toa technologies provides software service-based field service management software customer appointment scheduling solutions services enterprises worldwide headquartered beachwood ohio company develops markets sells etadirect web-based applications solution provides advanced tools companies small medium large mobile workforces automate optimize planning scheduling appointment booking well routing job allocation real-time management type field service event etadirect include applications forecasting capacity management routing real-time field management/dispatch advanced html 5-based mobility app field employees also includes apps collaboration location-based information customer communications etadirect powered patented algorithm continuously learns mobile employees ’ work patterns analyzes statistically uses pattern recognition accurately predict employee time arrival customer location length job/appointment take thereby providing enhanced accuracy planning customer experience management etadirect typically narrows wait window less 60 minutes using time-based predictions etadirect communicate consumers exact time field service employee arrive via voice/ivr email text/sms twitter communications channels reducing customer frustration wasted time inquiry calls service provider call centers software delivered businesses internet using software service/esaas model etadirect currently used seven top ten cable television companies north america including cox communications major broadband operators europe virgin media ono spain global communications companies telefonica global utility companies like e.on toa technologies founded yuval brisker irad carmi 2003 company privately held employs 550 employees worldwide headquartered beachwood ohio additional offices london united kingdom sao paulo brazil principal venture shareholders technology crossover ventures draper triangle ventures dfj network affiliate intel capital sutter hill ventures toa stands time arrival concept time central etadirect software solution set central algorithm measures time predicts performance based resource specific pattern recognition predictive analytics yields accurate time arrival estimates alternative managing service appointments according averages human resource capabilities availability december 2013 toa 85,000 users oracle corporation announced acquiring toa technologies july 31 2014 april 6 2010 toa issued u.s. patent 7,693,735 entitled dynamic schedule mediation predictive performance-pattern based mobile workforce management system proactive customer communications methodology october 2012 gartner recognized toa technologies leader magic quadrant field service management first time toa technologies named leader gartner magic quadrant field service management 2013 report gartner stated toa best-of-breed field service optimization vendor based solely cloud toa named one america promising companies 2013 forbes magazine july 2013 toa closed major round funding technology crossover ventures raising 66 million transform global field service management july 31 2014 oracle corporation announced buying toa technologies transaction closed mid-september 2014 | [
467
] | Validation |
9,379 | 0 | International_Committee_on_Computational_Linguistics:international committee computational linguistics international committee computational linguistics iccl founded dr. david hays rand corporation 1965 promote biennial international conference computational linguistics since third conference stockholm known acronym coling swedish fictional character kolingen albert engström current president iccl professor jun-ichi tsujii university tokyo membership committee permanent | [
1890,
4131,
3668,
2126
] | Test |
9,380 | 5 | Real_Time_Streaming_Protocol:real time streaming protocol real time streaming protocol rtsp network control protocol designed use entertainment communications systems control streaming media servers protocol used establishing controlling media sessions end points clients media servers issue vhs-style commands play record pause facilitate real-time control media streaming server client video demand client server voice recording transmission streaming data task rtsp rtsp servers use real-time transport protocol rtp conjunction real-time control protocol rtcp media stream delivery however vendors implement proprietary transport protocols rtsp server software realnetworks example also used realnetworks proprietary real data transport rdt rtsp developed realnetworks netscape columbia university first draft submitted ietf 1996 standardized multiparty multimedia session control working group mmusic wg internet engineering task force ietf published rfc 2326 1998 rtsp 2.0 published rfc 7826 2016 replacement rtsp 1.0 rtsp 2.0 based rtsp 1.0 backwards compatible basic version negotiation mechanism similar ways http rtsp defines control sequences useful controlling multimedia playback http stateless rtsp state identifier used needed track concurrent sessions like http rtsp uses tcp maintain end-to-end connection rtsp control messages sent client server commands travel direction i.e server client presented basic rtsp requests typical http requests like options request also available default transport layer port number 554 tcp udp latter rarely used control requests rtsp using rtp rtcp allows implementation rate adaptation many cctv security cameras often called ip cameras support rtsp streaming especially onvif profiles g | [
10242,
1030,
8211,
6681,
6682,
10270,
10271,
3105,
6689,
9251,
2085,
7208,
7214,
8238,
562,
1586,
9269,
11321,
3133,
5181,
6723,
8265,
4687,
10341,
10344,
3695,
4723,
2679,
4729,
4219,
5251,
649,
9868,
3218,
9365,
11413,
152,
3742,
9381,
... | Test |
9,381 | 5 | Real-time_Transport_Protocol:real-time transport protocol real-time transport protocol rtp network protocol delivering audio video ip networks rtp used communication entertainment systems involve streaming media telephony video teleconference applications including webrtc television services web-based push-to-talk features rtp typically runs user datagram protocol udp rtp used conjunction rtp control protocol rtcp rtp carries media streams e.g. audio video rtcp used monitor transmission statistics quality service qos aids synchronization multiple streams rtp one technical foundations voice ip context often used conjunction signaling protocol session initiation protocol sip establishes connections across network rtp developed audio-video transport working group internet engineering task force ietf first published 1996 superseded 2003 rtp designed end-to-end real-time transfer streaming media protocol provides facilities jitter compensation detection packet loss out-of-order delivery common especially udp transmissions ip network rtp allows data transfer multiple destinations ip multicast rtp regarded primary standard audio/video transport ip networks used associated profile payload format design rtp based architectural principle known application-layer framing protocol functions implemented application opposed operating system protocol stack real-time multimedia streaming applications require timely delivery information often tolerate packet loss achieve goal example loss packet audio application may result loss fraction second audio data made unnoticeable suitable error concealment algorithms transmission control protocol tcp although standardized rtp use normally used rtp applications tcp favors reliability timeliness instead majority rtp implementations built user datagram protocol udp transport protocols specifically designed multimedia sessions sctp dccp although widespread use rtp developed audio/video transport working group ietf standards organization rtp used conjunction protocols h.323 rtsp rtp specification describes two protocols rtp rtcp rtp used transfer multimedia data rtcp used periodically send control information qos parameters data transfer protocol rtp carries real-time data information provided protocol include timestamps synchronization sequence numbers packet loss reordering detection payload format indicates encoded format data control protocol rtcp used quality service qos feedback synchronization media streams bandwidth rtcp traffic compared rtp small typically around 5 rtp sessions typically initiated communicating peers using signaling protocol h.323 session initiation protocol sip rtsp jingle xmpp protocols may use session description protocol specify parameters sessions rtp session established multimedia stream audio video streams may use separate rtp sessions enabling receiver selectively receive components particular stream session consists destination ip address pair ports rtp rtcp specification recommends rtp port numbers chosen even associated rtcp port next higher odd number however single port chosen rtp rtcp applications multiplex protocols rtp rtcp typically use unprivileged udp ports 1024 65535 may also use transport protocols notably sctp dccp protocol design transport independent one design considerations rtp carry range multimedia formats allow new formats without revising rtp standard end information required specific application protocol included generic rtp header instead provided separate rtp profiles associated payload formats class application e.g. audio video rtp defines profile one associated payload formats complete specification rtp particular application usage requires profile payload format specifications profile defines codecs used encode payload data mapping payload format codes payload type pt field rtp header profile accompanied several payload format specifications describes transport particular encoded data audio payload formats include g.711 g.723 g.726 g.729 gsm qcelp mp3 dtmf video payload formats include h.261 h.263 h.264 h.265 mpeg-1/mpeg-2 mapping mpeg-4 audio/video streams rtp packets specified h.263 video payloads described examples rtp profiles include rtp packets created application layer handed transport layer delivery unit rtp media data created application begins rtp packet header rtp header minimum size 12 bytes header optional header extensions may present followed rtp payload format determined particular class application fields header follows functional network-based system includes protocols standards conjunction rtp protocols sip jingle rtsp h.225 h.245 used session initiation control termination standards h.264 mpeg h.263 used encode payload data specified applicable rtp profile rtp sender captures multimedia data encodes frames transmits rtp packets appropriate timestamps increasing timestamps sequence numbers sender sets payload type field accordance connection negotiation rtp profile use rtp receiver detects missing packets may reorder packets decodes media data packets according payload type presents stream user | [
10242,
1030,
9734,
1036,
8211,
6681,
6682,
10270,
10271,
6177,
6689,
9251,
10274,
2085,
7208,
7214,
8238,
562,
1586,
9269,
11321,
3133,
5181,
6723,
11332,
6216,
8265,
4687,
1631,
10341,
614,
10344,
3695,
4723,
2679,
4729,
4219,
5251,
9860,
... | None |
9,382 | 2 | Authorized_Program_Analysis_Report:authorized program analysis report apar authorized program analysis report pronounced a-par rhymes far ibm designation document intended identify situations could result potential problems also serves request correction defect current releases ibm-supplied programs occasionally ibm software bug ascertained situation caused problems third-party hardware software user configuration errors ibm support staff suspect defect current release ibm program cause file formal report confirming existence issue addition confirming existence issue apars include information known workarounds information whether formal fix scheduled included future releases whether program temporary fix ptf planned ibm program facilitate documenting problem least 2 levels fix ptf permanent correction respect vrm version release modification level product applicable temporary fix sense problem correction temporarily available permanent fix later incorporated product base code thereby longer fix although associated ptf and/or apar numbers rule included source documentation associated ensuing base code update sidr xerox acronym covering apar ptf acronym referred system improvement difficulty report sir system improvement request terminology digital equipment corporation used much xerox used sidr | [
2172
] | Test |
9,383 | 5 | Internet_Security_Association_and_Key_Management_Protocol:internet security association key management protocol isakmp internet security association key management protocol protocol defined rfc 2408 establishing security associations sa cryptographic keys internet environment isakmp provides framework authentication key exchange designed key exchange independent protocols internet key exchange kerberized internet negotiation keys provide authenticated keying material use isakmp example ike describes protocol using part oakley part skeme conjunction isakmp obtain authenticated keying material use isakmp security associations ah esp ietf ipsec doi isakmp defines procedures authenticating communicating peer creation management security associations key generation techniques threat mitigation e.g denial service replay attacks framework isakmp typically utilizes ike key exchange although methods implemented kerberized internet negotiation keys preliminary sa formed using protocol later fresh keying done isakmp defines procedures packet formats establish negotiate modify delete security associations sas contain information required execution various network security services ip layer services header authentication payload encapsulation transport application layer services self-protection negotiation traffic isakmp defines payloads exchanging key generation authentication data formats provide consistent framework transferring key authentication data independent key generation technique encryption algorithm authentication mechanism isakmp distinct key exchange protocols order cleanly separate details security association management key management details key exchange may many different key exchange protocols different security properties however common framework required agreeing format sa attributes negotiating modifying deleting sas isakmp serves common framework isakmp implemented transport protocol implementations must include send receive capability isakmp using udp port 500 openbsd first implemented isakmp 1998 via isakmpd 8 software ipsec services service microsoft windows handles functionality kame project implements isakmp linux open source bsds modern cisco routers implement isakmp vpn negotiation leaked nsa presentations released der spiegel indicate isakmp exploited unknown manner decrypt ipsec traffic ike researchers discovered logjam attack state breaking 1024-bit diffie–hellman group would break 66 vpn servers 18 top million https domains 26 ssh servers consistent researchers claim consistent leaks | [
10908,
1634,
4874,
6797,
1616,
6993,
11569,
11413,
732,
3742,
9151
] | Train |
9,384 | 4 | Melvin_Currie:melvin currie melvin mel robert currie american mathematician cryptographer former chief cryptographic research design division national security agency recognitions include 2007 crypto-mathematics institute leadership award director distinguished service medal author 2018 popular mathematics book mathematics rhyme reason published jointly american mathematical society mathematical sciences research institute currie african-american born pittsburgh pennsylvania 1948 parents separated six currie spent rest childhood living mother younger brother maternal grandparents currie received ba yale university majored mathematics economics went graduate school university pittsburgh received phd 1983 advisor william fleissner title dissertation metric characterization irrationals via group operation | [
1783
] | Test |
9,385 | 9 | Expression-oriented_programming_language:expression-oriented programming language expression-oriented programming language programming language every nearly every construction expression thus yields value typical exceptions macro definitions preprocessor commands declarations expression-oriented languages often treat statements rather expressions expression-oriented languages introduce void return type yielded expressions merely cause side-effects algol 68 lisp examples expression-oriented languages pascal expression-oriented language functional programming languages expression-oriented critics including language designers blame expression-orientation entire class programming mistakes wherein programmer introduces assignment expression meant test equality example designers ada java worried type mistake restricted control expressions evaluate strictly boolean data type designers python similar worries took alternative strategy implementing assignment statement rather expression thus prohibiting assignment nesting inside statement expression | [
7169,
9345,
8582,
5896,
9224,
6160,
1051,
9245,
3876,
11688,
7851,
428,
5677,
1591,
10042,
7612,
8385,
8262,
9926,
1611,
7627,
10571,
7889,
5081,
6502,
8554,
9454,
2680,
3705
] | None |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.