node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
5,786 | 3 | ARM_Cortex-A:arm cortex-a arm cortex-a group 32-bit 64-bit risc arm processor cores licensed arm holdings cores intended application use group consists 32-bit cores arm cortex-a5 arm cortex-a7 arm cortex-a8 arm cortex-a9 arm cortex-a12 arm cortex-a15 arm cortex-a17 mpcore arm cortex-a32 64-bit cores arm cortex-a35 arm cortex-a53 arm cortex-a55 arm cortex-a57 arm cortex-a72 arm cortex-a73 arm cortex-a75 arm cortex-a76 32-bit arm cortex-a cores except cortex-a32 implement armv7-a profile armv7 architecture main distinguishing feature armv7-a profile compared two profiles armv7-r profile implemented arm cortex-r cores armv7-m profile implemented arm cortex-m cores armv7-a profile includes memory management unit mmu many modern operating systems require mmu run 64-bit arm cortex-a cores well 32-bit arm cortex-a32 implement armv8-a profile armv8 architecture arm holdings neither manufactures sells cpu devices based designs rather licenses processor architecture interested parties arm offers variety licensing terms varying cost deliverables licensees arm provides integratable hardware description arm core well complete software development toolset right sell manufactured silicon containing arm cpu integrated device manufacturers idm receive arm processor ip synthesizable rtl written verilog form ability perform architectural level optimizations extensions allows manufacturer achieve custom design goals higher clock speed low power consumption instruction set extensions optimizations size debug support etc determine components included arm ic chip consult manufacturer datasheet related documentation cortex-a5 a7 a8 a9 a12 a15 a17 cores implement armv7-a architecture cortex-a32 a35 a53 a57 a72 a73 a75 a76 cores implement armv8-a architecture amount documentation arm chips daunting especially newcomers documentation microcontrollers past decades would easily inclusive single document chips evolved documentation grown total documentation especially hard grasp arm chips since consists documents ic manufacturer documents cpu core vendor arm holdings typical top-down documentation tree ic manufacturers usually additional documents including evaluation board user manuals application notes getting started development software software library documents errata | [
7170,
8720,
11282,
9235,
11289,
1057,
38,
4139,
8237,
3630,
9774,
2097,
8250,
8253,
6207,
7745,
7235,
7747,
2635,
99,
8812,
11374,
10361,
638,
644,
8842,
146,
659,
1170,
7833,
666,
4258,
4773,
9391,
9913,
8383,
10945,
9928,
4821,
2788,
... | Test |
5,787 | 1 | Rodovid:rodovid rodovid free online collaborative family tree portal originally ukrainian project 2012 active communities 25 languages provides web service built using mediawiki rodovid engine software help store visualize family relationships rodovid founded september 2005 group developers genealogy enthusiasts kiev ukraine name comes ukrainian word rodovid meaning lineage genealogy 2015 rodovid 1,001,000 total records individuals across languages including 290,000 ukrainian russian making second largest free genealogy service online largest language english 2016 rodovid ranked 82 top 100 genealogy websites 2016 genealogyintime magazine experimented supporting imports gedcom files engine software proprietary discussions releasing openly supports layouts family trees optimised browsing printing claims generate trees thousands people seconds rodovid project data descriptions stored servers kiev available creative commons attribution license already public domain data periodically archived wikiteam project internet archive | [
467,
10020,
8845,
735
] | None |
5,788 | 5 | GetSimple_CMS:getsimple cms getsimple cms free web content management system primary goal simple easy use based programming language php uses xml files store content flat file content management system contrast cms software tend use databases mysql getsimple cms created 2009 resident pittsburgh pa us web developer chris cagle still presides project senior developer claims created getsimple cms need cms powerful wordpress use easier since developers joined getsimple team active community contributes plug-ins translations themes getsimple cms primarily developed creation smaller websites however also suitable medium large websites thanks extendability platform via plug-ins themes target groups cms organizations companies individuals need small medium-sized websites according statistics w3tech getsimple cms used less 0.1 sites internet simple installation process copying files web server start installation routine allows immediate use software web hosts offer cms already pre-installed installed software expanded numerous plug-ins themes getsimple cms downloaded 120,000 times march 2013 magazine t3n assigns getsimple micro minimal-cms one praises simplicity yet possible extensibility plug-ins author article states theming concept getsimple belong intuitive ever seen british magazine computer active raises backup function simplicity cleanliness work surface well supplied templates produced content manager magazine dedicated cms detailed presentation took 2012 next typo3 wordpress comparison 15 open source cms hot scripts counted cms may 2010 ten easiest lightest weight scripts web design shack counts among 50 wordpress alternatives ranks eighth demo specialized installations page opensourcecms.com counted getsimple 30 common best-rated systems stand 2013 german-speaking community dedicated language english separate area official forum | [
225,
8644,
5612,
7022,
7983,
479
] | Test |
5,789 | 8 | WS-Coordination:ws-coordination ws-coordination web services specification developed bea systems ibm microsoft accepted oasis web services transaction tc 1.2 version describes extensible framework providing protocols coordinate actions distributed applications coordination protocols used support number applications including need reach consistent agreement outcome distributed transactions framework defined specification enables application service create context needed propagate activity services register coordination protocols framework enables existing transaction processing workflow systems coordination hide proprietary protocols operate heterogeneous environment additionally ws-coordination describes definition structure context requirements propagating context cooperating services however specification n't enough coordinate transactions among web services provides coordination framework specifications like ws-atomic transaction ws-businessactivity needed purpose | [
10020,
7878,
489,
4107,
3323,
5782,
119,
1851
] | Test |
5,790 | 9 | Not_eXactly_C:exactly c exactly c nxc high-level programming language lego mindstorms nxt designed john hansen 2006 nxc short exactly c based next byte codes assembly language nxc syntax like c. ide nxc bricx command center nxc compiler available mozilla public license sample code shown | [
477,
6802,
10964,
9748,
2045
] | Train |
5,791 | 7 | Cloudike:cloudike cloudike brandable file storage platform operated cloudike inc. headquartered san jose california platform provides cloud storage file synchronization contact synchronization personal cloud client software company data storage approach similar dropbox google drive apple icloud store user data provide access files smartphones laptops tablets etc main difference apart functionality end-users cloudike personal cloudike offers customization businesses cloudike enterprise brands widely known white-label cloudike started 2013 saas-platform grew multi-tier cloud solution used build white-label enterprise data storages oems mobile internet service providers platform modules enterprise data administration storage api integration billing systems cloudike enables building large-scale file storages based openstack swift amazon s3 storage systems compatible amazon s3 apis synchronize user files server cloudike provides desktop clients windows macos android ios devices cloudike offers mobile clients files contact lists accessed via web browser data updates synchronized computers mobile devices associated user accounts cloudike based set programmatic interfaces apis written python uses python frameworks django tornado create rest api message broker software rabbitmq mongodb build contact synchronization mechanism cloudike utilizes sabredav framework web-frontend part single page application based angularjs end-user features enterprise modules several cloud platforms provide white-label services similar cloudike list contains cloud storage platforms might directly indirectly compete cloudike | [
11201,
4194,
9762,
7364,
3462,
2695,
4490,
8554,
1295,
4623,
7409,
7983,
467,
8691,
10168,
1083,
8446
] | Test |
5,792 | 1 | Boyce–Codd_normal_form:boyce–codd normal form boyce–codd normal form bcnf 3.5nf normal form used database normalization slightly stronger version third normal form 3nf bcnf developed 1975 raymond f. boyce edgar f. codd address certain types anomalies dealt 3nf originally defined relational schema bcnf redundancy based functional dependency removed although types redundancy may still exist relational schema r boyce–codd normal form every one dependencies x → least one following conditions hold rare cases 3nf table meet requirements bcnf 3nf table multiple overlapping candidate keys guaranteed bcnf depending functional dependencies 3nf table two overlapping candidate keys may may bcnf example 3nf table meet bcnf table superkeys note even though table start time end time attributes duplicate values still admit days two different bookings court 1 court 2 could start time end time reason start time end time considered table superkeys however candidate keys minimal superkeys relation e.g ⊂ candidate key recall 2nf prohibits partial functional dependencies non-prime attributes i.e. attribute occur candidate key see candidate keys 3nf prohibits transitive functional dependencies non-prime attributes candidate keys today court bookings table non-prime attributes attributes belong candidate key therefore table adheres 2nf 3nf table adhere bcnf dependency rate type → court determining attribute rate type court depends 1 neither candidate key superset candidate key 2 court subset rate type dependency rate type → court respected since rate type ever apply single court design amended meets bcnf candidate keys rate types table rate type court member flag candidate keys today bookings table court start time court end time tables bcnf rate type key rate types table one rate type associated two different courts impossible using rate type key rate types table anomaly affecting original table eliminated cases non-bcnf table decomposed tables satisfy bcnf preserve dependencies held original table beeri bernstein showed 1979 example set functional dependencies ab → c c → b represented bcnf schema consider following non-bcnf table whose functional dependencies follow ab → c c → b pattern person shop type combination table tells us shop type geographically nearest person home assume simplicity single shop one type candidate keys table three attributes prime attributes i.e belong candidate keys table 3nf table bcnf however shop type attribute functionally dependent non-superkey nearest shop violation bcnf means table subject anomalies example eagle eye might shop type changed optometrist fuller record retaining shop type optician davidson record would imply contradictory answers question eagle eye shop type holding shop shop type would seem preferable would prevent anomalies occurring revised design shop near person table candidate key person shop shop table candidate key shop unfortunately although design adheres bcnf unacceptable different grounds allows us record multiple shops type person words candidate keys guarantee functional dependency person shop type → shop respected design eliminates anomalies conform bcnf possible design introduces new normal form known elementary key normal form design consists original nearest shops table supplemented shop table described table structure generated bernstein schema generation algorithm actually eknf although enhancement 3nf recognized time algorithm designed referential integrity constraint defined effect shop type nearest shop first table must refer shop type shop second table data anomalies described previously prevented np-complete given database schema third normal form determine whether violates boyce-codd normal form chris date pointed definition know bcnf appeared paper ian heath 1971 date writes since definition predated boyce codd definition three years seems bcnf ought rights called heath normal form n't edgar f. codd released original paper relational model data large shared databanks june 1970 first time notion relational database published work including boyce-codd normal form method based relational model | [
10560,
5794,
5795,
2022,
6983,
2024,
2025,
2026,
7080,
946,
4281,
3004,
6782
] | Test |
5,793 | 3 | Cellular_architecture:cellular architecture cellular architecture type computer architecture prominent parallel computing cellular architectures relatively new ibm cell microprocessor first one reach market cellular architecture takes multi-core architecture design logical conclusion giving programmer ability run large numbers concurrent threads within single processor 'cell compute node containing thread units memory communication speed-up achieved exploiting thread-level parallelism inherent many applications cell cellular architecture containing 9 cores processor used playstation 3 another prominent cellular architecture cyclops64 massively parallel architecture currently development ibm cellular architectures follow low-level programming paradigm exposes programmer much underlying hardware allows programmer greatly optimize code platform time makes difficult develop software | [
7173,
9739,
2066,
7699,
5655,
10779,
10781,
6181,
8231,
3630,
6705,
7218,
2623,
2113,
7234,
3142,
2638,
1122,
3175,
8815,
9331,
630,
8822,
6268,
3197,
7313,
6815,
8352,
6818,
6821,
7852,
9391,
2224,
2226,
7858,
9911,
8890,
4286,
2241,
224... | Test |
5,794 | 1 | Sixth_normal_form:sixth normal form sixth normal form 6nf term relational database theory used two different ways christopher j date others defined sixth normal form normal form based extension relational algebra relational operators join generalized support natural treatment interval data sequences dates moments time instance temporal databases sixth normal form based generalized join follows relvar r table sixth normal form abbreviated 6nf satisfies nontrivial join dependencies — join dependency trivial least one projections possibly u_projections involved taken set attributes relvar table concerned date et al also given following definition relvar r sixth normal form 6nf every jd join dependency r trivial — jd trivial one components equal pertinent heading entirety relation 6nf also 5nf sixth normal form intended decompose relation variables irreducible components though may relatively unimportant non-temporal relation variables important dealing temporal variables interval data instance relation comprises supplier name status city may also want add temporal data time values valid e.g. historical data three values may vary independently different rates may instance wish trace history changes status review production costs may reveal change caused supplier changing city hence charged delivery discussion temporal aggregation sql see also zimanyi different approach see tsql2 authors used term sixth normal form differently synonym domain/key normal form dknf usage predates date et al work sixth normal form currently used data warehouses benefits outweigh drawbacks example using anchor modeling although using 6nf leads explosion tables modern databases prune tables select queries using process called 'table elimination required thus speed queries access several attributes order table 6nf comply 5nf first requires table satisfies trivial join dependencies let ’ take simple example table already 5nf users table every attribute non null primary key username users_table table 5nf join dependency implied unique candidate key table username specifically possible join dependencies username status username department 6nf version would look like users users_dept one table 5nf 6nf produces two tables following another example table 1 join dependencies table medic name occupation medic name practice years practice years type hence could see table 2nf due appearance transitive dependency following tables try bring 6nf table 2.1 table 2.2 table 2.3 | [
5151,
5792,
5795,
9893,
4281,
3001,
3004,
2369,
9286,
6983,
5320,
2512,
2901,
7767,
2022,
2024,
2025,
2026,
6782
] | Test |
5,795 | 1 | Fifth_normal_form:fifth normal form fifth normal form 5nf also known project-join normal form pj/nf level database normalization designed reduce redundancy relational databases recording multi-valued facts isolating semantically related multiple relationships table said 5nf every non-trivial join dependency table implied candidate keys join dependency b … z r implied candidate key r b … z superkey r. fifth normal form first described ronald fagin 1979 conference paper normal forms relational database operators consider following example table predicate products type designated product type made brand designated brand available traveling salesman designated traveling salesman primary key composite three columns also note table 4nf since multivalued dependencies 2-part join dependencies table column candidate key superkey determinant two columns absence rules restricting valid possible combinations traveling salesman brand product type three-attribute table necessary order model situation correctly suppose however following rule applies traveling salesman certain brands certain product types repertoire brand b1 brand b2 repertoire product type p repertoire assuming brand b1 brand b2 make product type p traveling salesman must offer products product type p made brand b1 made brand b2 case possible split table three case impossible louis ferguson refuse offer vacuum cleaners made acme assuming acme makes vacuum cleaners sells anything else made acme lava lamp also sells vacuum cleaners made brand robusto note setup helps remove redundancy suppose jack schneider starts selling robusto products breadboxes vacuum cleaners previous setup would add two new entries one product type jack schneider robusto breadboxes jack schneider robusto vacuum cleaners new setup need add single entry jack schneider robusto brands traveling salesman rare situations 4nf table conform 5nf situations complex real-world constraint governing valid combinations attribute values 4nf table implicit structure table table normalized 5nf burden maintaining logical consistency data within table must carried partly application responsible insertions deletions updates heightened risk data within table become inconsistent contrast 5nf design excludes possibility inconsistencies table fifth normal form 5nf project-join normal form pjnf lossless decomposition number smaller tables case smaller tables decomposition candidate key table excluded | [
5792,
5794,
2022,
6983,
2024,
2025,
2026,
10737,
244,
4281,
3004,
6782
] | None |
5,796 | 9 | Dependent_type:dependent type computer science logic dependent type type whose definition depends value overlapping feature type theory type systems intuitionistic type theory dependent types used encode logic quantifiers like exists functional programming languages like agda ats coq f* epigram idris dependent types may help reduce bugs enabling programmer assign types restrain set possible implementations two common examples dependent types dependent functions dependent pairs return type dependent function may depend value type one arguments instance function takes positive integer formula_1 may return array length formula_1 array length part type array note different polymorphism generic programming include type argument dependent pair may second value type depends first value sticking array example dependent pair may used pair array length type-safe way dependent types add complexity type system deciding equality dependent types program may require computations arbitrary values allowed dependent types deciding type equality may involve deciding whether two arbitrary programs produce result hence type checking may become undecidable dependent types created deepen connection programming logic 1934 haskell curry noticed types used typed lambda calculus combinatory logic counterpart followed pattern axioms propositional logic going every proof logic matching function term programming language one curry examples correspondence simply typed lambda calculus intuitionistic logic predicate logic extension propositional logic adding quantifiers howard de bruijn extended lambda calculus match powerful logic creating types dependent functions correspond dependent pairs correspond exists loosely speaking dependent types similar type indexed family sets formally given type formula_4 universe types formula_5 one may family types formula_6 assigns term formula_7 type formula_8 say type b varies function whose type return value varies argument i.e fixed codomain dependent function type function called dependent product type pi-type dependent function type example dependent function type typically written formula_9 formula_10 formula_6 constant function corresponding dependent product type equivalent ordinary function type formula_12 judgmentally equal formula_13 b depend x name 'pi-type comes idea may viewed cartesian product types pi-types also understood models universal quantifiers example write formula_14 n -tuples real numbers formula_15 would type function given natural number n returns tuple real numbers size n usual function space arises special case range type actually depend input e.g formula_16 type functions natural numbers real numbers written formula_17 typed lambda calculus dual dependent product type dependent pair type dependent sum type sigma-type confusingly dependent product type sigma-types also understood existential quantifiers continuing example universe types formula_5 type formula_4 family types formula_6 dependent pair type formula_22 dependent pair type captures idea ordered pair type second term dependent value first formula_23 formula_7 formula_25 b constant function dependent pair type becomes judgementally equal product type ordinary cartesian product formula_26 let formula_4 type let formula_6 curry–howard correspondence b interpreted logical predicate terms given formula_7 whether type b inhabited indicates whether satisfies predicate correspondence extended existential quantification dependent pairs proposition formula_30 true type formula_31 inhabited example formula_32 less equal formula_33 exists another natural number formula_34 k n logic statement codified existential quantification formula_35 proposition corresponds dependent pair type formula_36 proof statement less n pair contains positive number k difference n proof equality k n henk barendregt developed lambda cube means classifying type systems along three axes eight corners resulting cube-shaped diagram correspond type system simply typed lambda calculus least expressive corner calculus constructions expressive three axes cube correspond three different augmentations simply typed lambda calculus addition dependent types addition polymorphism addition higher kinded type constructors functions types types example lambda cube generalized pure type systems system formula_37 pure first order dependent types corresponding logical framework lf obtained generalising function space type simply typed lambda calculus dependent product type system formula_38 second order dependent types obtained formula_37 allowing quantification type constructors theory dependent product operator subsumes formula_40 operator simply typed lambda calculus formula_41 binder system f. higher order system formula_42 extends formula_38 four forms abstraction lambda cube functions terms terms types types terms types types terms system corresponds calculus constructions whose derivative calculus inductive constructions underlying system coq proof assistant curry–howard correspondence implies types constructed express arbitrarily complex mathematical properties user supply constructive proof type inhabited i.e. value type exists compiler check proof convert executable computer code computes value carrying construction proof checking feature makes dependently typed languages closely related proof assistants code-generation aspect provides powerful approach formal program verification proof-carrying code since code derived directly mechanically verified mathematical proof | [
4101,
1931,
6414,
5521,
5783,
3736,
10649,
11674,
5920,
10145,
3876,
5885,
428,
6188,
5806,
9008,
3765,
6070,
4791,
7479,
11574,
8251,
10684,
8511,
963,
6087,
5961,
10953,
11641,
11212,
8397,
11219,
5588,
3926,
7894,
4057,
10586,
4955,
4572... | None |
5,797 | 7 | Bitcasa:bitcasa bitcasa inc. american cloud storage company founded 2011 st. louis missouri company later based mountain view california shut 2017 bitcasa provided client software microsoft windows os x android web browsers ios client pending apple approval former product infinite drive provided centralized storage included unlimited capacity client-side encryption media streaming file versioning backups multi-platform mobile access 2013 bitcasa moved tiered storage model offering 1tb 99/year infinite 999/year october 2014 bitcasa announced discontinuation infinite drive 999/year users would get 10tb storage infinite drive users would required migrate one new pricing plans delete account may 2016 bitcasa discontinued offering cloud storage consumers alleging focusing business products company started idea finalist techcrunch disrupt conference september 2011 2012 tony lee recruited vice president engineering frank meehan joined company board directors june 2012 bitcasa closed 9 million investment investors included crunchfund pelion venture partners horizons ventures andreessen horowitz samsung ventures first round capital ceo brian taptich announced jan 2017 bitcasa acquired intel intel spokesperson later clarified intel acquired bitcasa bitcasa provided client software web browsers os x microsoft windows linux mobile app android windows versions include xp vista windows 7 windows 8 bitcasa products provide centralized streaming storage devices simultaneous real-time access files files uploaded one device instantly available devices bitcasa require file syncing devices centralized storage eliminates need duplicate files across devices wait files become synchronized company patent pending infinite storage algorithm designed reduce actual storage space identifying duplicate content providing encryption stored data according popular mechanics magazine bitcasa uses convergent encryption method whereby client data assigned anonymous identifier uploaded data already exists bitcasa servers popular song uploaded instead earmarked available download client protocol said reduce upload time bitcasa encryption method reportedly cloaks data still client computer blocks data sent enterprise-grade aes-256 encryption method data cloud storage according extremetech service gives users access ownership rights data review gizmodo australia bitcasa cloud service described winner pricier competitors supported mac pc android platforms users could access infinite drive mobile apps android windows rt browsers support offline viewing files app collects displays individual media types photos video music documents independently folder hierarchy stored video files streamed auto-transcoded based device bandwidth items may uploaded downloaded shared directly social media sites files size shared web link distributed via email text im initial server migration apps android ios browsers updated effectively rendering devices unusable service september 2011 article published extreme tech said bitcasa convergent encryption based system mostly safe risks associated november 19 2013 company announced infinite storage offering would increase price move sparked intense reaction users company forum even though existing users grandfathered original pricing plan reactions bloggers particularly critical announcement pricing plans change bitcasa blog commented heavily users post ensuing comments removed internet bitcasa bitcasa introduced interface developers october 23 2014 bitcasa announced would removing grandfathered 'infinite plans although company assured customers plans would continued long cancelled service company removed official blog post though still available wayback machine bitcasa backtracked due 'lack demand 'abuse company instead offered previous clients packages regular users pay 10/month 1tb 99 annually 99/month 10tb 999 annually company gave users 23 days migrate download data would deleted move criticized many users physically possible download rates provided bitcasa result system migration users data loss replaceable angry customers gave company bad feedback community forum became less active company offered yearly subscribers right cancel get prorated refund however disabled ability cancel accounts refused delete accounts support system november 13 2014 northern californian district judge william alsup granted temporary restraining order enjoining bitcasa deleting disabling access infinite plan subscribers data bitcasa filed response 18 november challenging legality tro apparent result restraining order bitcasa announced 5-day extension deadline email users november 16 email mention restraining order hearing set 10.00 19 november bitcasa 'won lawsuit february 2015 community forum shut april 7 2016 company switched free 5gb plan free trial tier users account prior april 7 would automatically start trial 60-day trial user changed paid plan account data deleted server april 21 2016 bitcasa announced would discontinue cloud storage service focus business products users may 20 2016 download data user data could deleted bitcasa shut consumer cloud storage end may 20 2016 offering products developers four months refund customers website bitcasa inaccessible | [
11201,
6797,
7983,
5552,
823,
8446
] | None |
5,798 | 3 | Gustafson's_law:gustafson law computer architecture gustafson law gustafson–barsis law gives theoretical speedup latency execution task fixed execution time expected system whose resources improved named computer scientist john l. gustafson colleague edwin h. barsis presented article reevaluating amdahl law 1988 gustafson estimated speedup gained using n processors instead one task serial fraction benefit parallelism follows using different variables gustafson law formulated following way gustafson law addresses shortcomings amdahl law based assumption fixed problem size execution workload change respect improvement resources gustafson law instead proposes programmers tend set size problems fully exploit computing power becomes available resources improve therefore faster equipment available larger problems solved within time impact gustafson law shift research goals select reformulate problems solving larger problem amount time would possible way law redefines efficiency due possibility limitations imposed sequential part program may countered increasing total amount computation task executed system whose resources improved compared initial similar system split two parts example — computer program processes files disk part program may scan directory disk create list files internally memory another part program passes file separate thread processing part scans directory creates file list sped parallel computer part processes files execution workload whole task improvement resources system denoted formula_3 includes execution workload part benefit improvement resources execution workload one benefits fraction execution workload would benefit improvement resources denoted formula_4 fraction concerning part would benefit therefore execution part benefits improvement resources sped factor formula_6 improvement resources consequently execution workload part benefit remains theoretical execution workload formula_7 whole task improvement resources gustafson law gives theoretical speedup latency execution whole task fixed time formula_9 yields amdahl law presupposes computing requirements stay given increased processing power words analysis data take less time given computing power gustafson hand argues computing power cause data carefully fully analyzed pixel pixel unit unit rather larger scale would possible practical simulate impact nuclear detonation every building car contents including furniture structure strength etc calculation would taken time available provide answer increase computing power prompt researchers add data fully simulate variables giving accurate result amdahl law reveals limitation example ability multiple cores reduce time takes computer boot operating system ready use assuming boot process mostly parallel quadrupling computing power system took one minute load might reduce boot time fifteen seconds greater greater parallelization would eventually fail make bootup go faster part boot process inherently sequential gustafson law argues fourfold increase computing power would instead lead similar increase expectations system capable one-minute load time acceptable users starting point increase features functions system time taken boot operating system i.e one minute new system would include graphical user-friendly features problems fundamentally larger datasets example processing one data point per world citizen gets larger percent per year principal point gustafson law problems likely fruitful applications parallelism algorithms nonlinear runtimes may find hard take advantage parallelism exposed gustafson law snyder points n algorithm means double concurrency gives 26 increase problem size thus may possible occupy vast concurrency may bring little advantage original less concurrent solution—however practice still considerable improvements hill marty emphasize also methods speeding sequential execution still needed even multicore machines point locally inefficient methods globally efficient reduce sequential phase furthermore woo lee studied implication energy power future many-core processors based amdahl law showing asymmetric many-core processor achieve best possible energy efficiency activating optimal number cores given amount parallelism known prior execution | [
6656,
9224,
785,
6801,
7313,
7699,
153,
7963,
6815,
2210,
9126,
6184,
2345,
5802,
4909,
8367,
7218,
10675,
8501,
5948,
4286,
2113,
8514,
5956,
4423,
1480,
6909,
330,
1866,
7497,
8523,
78,
9932,
4308,
2008,
344,
2394,
731,
2140,
2396,
22... | Test |
5,799 | 4 | Enhanced_Mitigation_Experience_Toolkit:enhanced mitigation experience toolkit enhanced mitigation experience toolkit emet freeware security toolkit microsoft windows developed microsoft provides unified interface enable fine-tune windows security features used extra layer defense malware attacks firewall antivirus software emet targeted mostly system administrators newest version supported windows user running windows 7 later windows server 2008 r2 later .net framework 4.5 installed older versions used windows xp features available version 4.1 last version support windows xp microsoft announced emet reach end life july 31 2018 successors emet processmitigations module —aka process mitigation management tool —and windows defender exploit guard available windows 10 windows server 2016 | [
2309,
1417,
2443,
6797,
9488,
537,
3482,
2213,
8998,
5673,
7983,
7473,
5176,
5057,
10828,
1745,
5082,
9695,
3935,
11248
] | None |
5,800 | 3 | Univention_Corporate_Server:univention corporate server univention corporate server ucs server operating system derived debian gnu/linux integrated management system central cross-platform administration servers services clients desktops users well virtualized computers operated ucs addition operation local virtual instances ucs also operated openstack-based microsoft azure-based amazon ec2-based cloud environments via integration open source software samba 4 univention also supports functions provided many companies microsoft active directory administration computers operated microsoft windows ucs-based components ucs-certified established third party products installed integrated via univention app center ucs provides app center applications runtime environment services operation including central consistent management apps docker containers also run ucs systems several apps available app center docker-based univention member open source business alliance supports creation open source business alliance open source software stacks impulse development ucs began 2002 lack standardised linux server operating system offering companies organisations alternative microsoft ’ domain concept proprietary directory service active directory comparable linux solutions e.g. suse red hat offer integrated cross-system user computer management system result corresponding solutions configured maintained individually important early driving forces development ucs initially oldenburgische landesbank department bremen senator education science product ready market launch end 2004 since addition new versions number software solutions based main product ucs also launched ucs predominantly employed german-speaking world companies public organisations wide range sectors fields among others regional government authority federal state brandenburg 2005 univention began market ucs also german-speaking countries today ucs used many european countries also outside europe example australia nigeria usa univention established subsidiary 2013 ucs open-source software proprietary developments univention gmbh included ucs published gnu gpl version 2.3 launch version 2.4 company switched gnu agpl also range software appliances based ucs e.g. groupware desktop service management fields since april 21 2015 ucs freely available companies form ucs core edition replaced previous „ free personal use license core edition fully featured version differs fee-based edition terms product liability support univention corporate server based linux distribution debian gnu/linux numerous open source applications integrated ucs example samba authentication service kerberos virtualization software kvm nagios monitoring servers core important unique selling point ucs central administration tool univention management console allows cross-system cross-location management infrastructures ucs uses directory service openldap save data identity system management administration tools operated via web-based applications command-line interfaces thanks integrated administration service ucs virtual machine manager uvmm administration tools also allow central administration virtualized servers clients hard drives cdrom dvd images well physical systems operated manufacturer goes great lengths guarantee possibilities integration ucs existing environments via use open standards supplied connectors way integrated tool active directory connection allows bidirectional synchronisation microsoft directory service active directory directory service used ucs openldap addition ucs offers various interfaces manufacturers application software enabling integrate applications ucs management system since ucs 3.1 ucs provides univention app center graphic management component installation deinstallation ucs components ucs-certified third-party appliances univention app center includes beside univention solutions example open source groupware solutions kopano open-xchange document management system agorum core slack alternative rocket.chat dropbox alternatives owncloud nextcloud collaboration solutions onlyoffice collabora | [
929,
1761,
2179,
6622,
8262,
4841,
362,
5067,
1935,
3791,
7248,
6098,
8439,
9455,
823,
1211,
2910
] | Test |
5,801 | 8 | Wingify:wingify wingify software company based new delhi india products include vwo a/b testing conversion optimization platform pushcrew push notification service web mobile wingify founded 2010 paras chopra sparsh gupta office new delhi company bootstrapped 2017 annual revenue 18 million success products wingify bootstrap champ category economic times startup awards 2017 india owing success company forbes featured wingify founder paras chopra 30 30 list influential people india 2014 february 2018 wingify announced sparsh gupta company chief operating officer appointed new ceo paras chopra remaining chairman | [] | None |
5,802 | 3 | Moore's_second_law:moore second law rock law moore second law named arthur rock gordon moore says cost semiconductor chip fabrication plant doubles every four years 2015 price already reached 14 billion us dollars rock law seen economic flip side moores first law – number transistors dense integrated circuit doubles every two years latter direct consequence ongoing growth capital-intensive semiconductor industry— innovative popular products mean profits meaning capital available invest ever higher levels large-scale integration turn leads creation even innovative products semiconductor industry always extremely capital-intensive ever-dropping manufacturing unit costs thus ultimate limits growth industry constrain maximum amount capital invested new products point rock law collide moore law suggested fabrication plant costs increased quickly predicted rock law – indeed plateauing late 1990s – also fabrication plant cost per transistor shown pronounced downward trend may relevant constraint moore law | [
6656,
2273,
5798,
78,
8367,
785,
1778,
6801,
153,
7006
] | Train |
5,803 | 9 | Portable_Standard_Lisp:portable standard lisp portable standard lisp psl programming language dialect language lisp psl inspired predecessor standard lisp portable lisp compiler tail-recursive late binding dynamically bound developed researchers university utah 1980 released psl 3.1 development handed developers hewlett-packard 1982 released psl 3.3 portable standard lisp available kit containing screen editor compiler interpreter several hardware operating system computing platforms including motorola 68000 series decsystem-20s cray-1s vax many others today psl mainly developed available konrad-zuse-zentrum für informationstechnik berlin zib main modern use underlying language implementations reduce like older lisps first step psl compiles lisp code lap code another cross-platform language however older lisps mostly compiled lap directly assembly language architecture dependent intermediate psl compiles lap c code would run virtual machine language programs written portable c principle portable compiler written psl primitive dialect named system lisp syslisp ... experiment writing production-quality lisp lisp much possible minor amounts code written hand assembly language systems languages whole ensemble could bootstrap improvements compiler improved compiler later releases compatibility package common lisp sustained modern versions portable standard lisp fewer features lisps common lisp people found unpleasant use richard p. gabriel wrote popular essay lisp good news bad news win big third standard lisp portable standard lisp ran many machines people wanted use | [
10752,
11269,
2056,
2062,
9231,
7184,
2577,
9749,
8728,
4633,
4122,
8226,
3119,
2105,
3132,
6717,
8258,
8771,
8262,
1613,
9299,
10841,
3675,
11361,
7267,
2660,
8293,
9320,
2666,
5751,
7805,
9345,
1159,
9865,
9877,
2225,
11447,
6840,
7867,
... | None |
5,804 | 3 | University_of_Tampere:university tampere university tampere uta public university tampere finland merged tampere university technology create new tampere university 1 january 2019 university offered undergraduate postgraduate doctoral programmes 20,178 degree students 1,981 employees 2016 founded 1925 helsinki civic college 1930 onwards known school social sciences institution relocated tampere 1960 renamed university tampere 1966 2016 budget €184.6 million 59 government funding institution established 1925 civic college helsinki teaching public administration organisation management journalism inaugural intake 72 students 1930 total 195 students enrolled college name amended school social sciences similarly institution vocationally oriented bachelor degrees expanded municipal administration public law child protection civic education well master degree social sciences first faculty faculty social sciences established 1949 number students steadily increased 227 1940 661 1950 programmes offered school grew degrees social youth work librarianship economics well prison officer diploma first doctoral degree completed 1955 1956 city tampere school social sciences agreed relocating school tampere 1960 number students increased 933 school social sciences moved new päätalo main building designed toivo korhonen kalevantie 4 tampere faculty humanities faculty economics business administration established 1964 1965 respectively school social sciences renamed university tampere 1966 programme called tampere3 merge university tampere university technology tampere university applied sciences started spring 2014 merger approved parliament december 2017 came effect 1 january 2019 new foundation-based interdisciplinary higher education institution named tampere university proposed name tampere new university faced criticism total 14,712 degree students studied university tampere 2016 including 11,810 students bachelor master degree programmes 1,646 doctoral students likewise 2016 university received 17,482 applications 1,418 enrolled admission rate 8.1 hosted four centres excellence research mitochondrial disease russian studies 2016 2017 tuition fee approximately 10,000 euros charged general non-european union/european economic area citizens studying english-taught master degree programmes 50 100 cover scholarships available students exchange doctoral students exempt fees university ranked 201–250 times higher education world university rankings 2018 likewise ranked 551-600 qs world university rankings 2018 101-150 communication media studies category 2016 total budget university 184.6 million euros 108.8 million core funding government finland 67.49 million external endowments addition independent units finnish social science data archive fsd laboratory services language centre library university organized six faculties 1 january 2017 reorganization following people served rectors university tampere university tampere two campuses tampere main campus centre near tampere railway station kauppi campus next tampere university hospital main campus hosted faculties comprised päätalo pinni linna virta buildings faculty medicine life sciences laboratory services located arvo building kauppi campus päätalo building completed 1960 served university first premises tampere pinni complex completed gradually 1990s 2000s linna virta buildings ready use 2006 2009 respectively medicine-focused arvo building built two separate phases reached 2009 2016 floor area university facilities totaled 130,134 2016 instead dormitories campuses tampere student housing foundation rented apartments students around tampere | [
415
] | None |
5,805 | 4 | Sysjail:sysjail sysjail defunct user-land virtualiser systems supporting systrace library version 1.0 limited openbsd netbsd miros original design inspired freebsd jail similar utility although part kernel freebsd sysjail developed released 2006 kristaps dzonsons aka johnson research assistant game theory stockholm school economics maikls deksters sysjail re-written scratch 2007 support emulated processes jails limited initially linux emulation project officially discontinued 3 march 2009 due flaws inherent syscall wrapper-based security architectures restrictions sysjail could evaded exploiting race conditions wrapper security checks kernel execution syscalls | [
6438,
6184,
5492,
2164,
823
] | Validation |
5,806 | 1 | Comparison_of_database_access:comparison database access orms manage database class represents row table named table | [
9729,
1931,
6414,
10510,
6160,
5521,
3736,
155,
5796,
9008,
3765,
7479,
10043,
10684,
963,
8644,
5961,
1610,
1611,
9804,
8397,
11212,
11219,
5588,
2901,
7894,
4057,
10586,
8539,
4069,
7274,
8554,
7022,
6640,
1016,
3577,
9467
] | Test |
5,807 | 0 | RWTH_ASR:rwth asr rwth asr short rasr proprietary speech recognition toolkit toolkit includes newly developed speech recognition technology development automatic speech recognition systems developed human language technology pattern recognition group rwth aachen university rwth asr includes tools development acoustic models decoders well components speaker adaptation speaker adaptive training unsupervised training discriminative training word lattice processing software runs linux mac os x project homepage offers ready-to-use models research purposes tutorials comprehensive documentation toolkit published license called rwth asr license derived qpl license grants free usage including re-distribution modification non-commercial use unlike qpl permit commercial use | [
10557,
823
] | None |
5,808 | 1 | Halloween_Problem:halloween problem computing halloween problem refers phenomenon databases update operation causes change physical location row potentially allowing row visited operation could even cause infinite loop cases updates continually place updated record ahead scan performing update operation potential database error first discovered chamberlin pat selinger morton astrahan 1976 halloween day working query supposed give ten percent raise every employee earned less 25,000 query would run successfully errors finished employees database earned least 25,000 kept giving raise reached level expectation query would iterate employee records salary less 25,000 precisely fact even updated records visible query execution engine continued match query criteria salary records matching multiple times time given 10 raise greater 25,000 name descriptive nature problem rather given due day discovered recounted chamberlin pat morton discovered problem halloween ... remember came office said ‘ chamberlin look make sure optimizer making plan processing update ’ use index based field updated going ’ happened friday said ‘ listen going able solve problem afternoon let ’ give name ’ call halloween problem ’ work next week. ’ turns called ever since | [
2688,
9481,
10505,
10258,
10518,
4376,
9112,
7968,
290,
1314,
7461,
8742,
5550,
10418,
9527,
3768,
3004,
9661,
9663,
4416,
2369,
5441,
11457,
8518,
72,
853,
2901,
9942,
9177,
987,
860,
9183,
11362,
10471,
8808,
6383,
9079,
2681,
9467
] | Test |
5,809 | 5 | Digital_subscriber_line_access_multiplexer:digital subscriber line access multiplexer digital subscriber line access multiplexer dslam often pronounced dee-slam network device often located telephone exchanges connects multiple customer digital subscriber line dsl interfaces high-speed digital communications channel using multiplexing techniques dslam equipment collects data many modem ports aggregates voice data traffic one complex composite signal via multiplexing depending device architecture setup dslam aggregates dsl lines asynchronous transfer mode atm frame relay and/or internet protocol network i.e. ip-dslam using packet transfer mode transmission convergence ptm-tc protocol stack aggregated traffic directed telco backbone switch via access network also called network service provider nsp 10 gbit/s data rates dslam acts like network switch since functionality layer 2 osi model therefore re-route traffic multiple ip networks isp devices end-user connection points dslam traffic switched broadband remote access server end-user traffic routed across isp network internet customer-premises equipment interfaces well dslam connected may take advantage enhanced telephone voice data line signaling features bandwidth monitoring compensation capabilities supports dslam may may located telephone exchange may also serve multiple data voice customers within neighborhood serving area interface sometimes conjunction digital loop carrier dslams also used hotels lodges residential neighborhoods businesses operating private telephone exchange addition data switch multiplexer dslam also large collection modems modem aggregation card communicates single subscriber dsl modem modem functionality integrated dslam instead done via external device like 20th-century voiceband modem like traditional voice-band modems dslam integrated dsl modems usually able probe line adjust electronically digitally compensate forward echoes bandwidth-limiting factors order move data maximum possible connection rate compensation capability also takes advantage better performance balanced line dsl connections providing capabilities lan segments longer physically similar unshielded twisted pair utp ethernet connections since balanced line type generally required hardware function correctly due nominal line impedance measured ohms comprising resistance inductance balanced lines somewhat lower utp thus supporting 'weaker signals however solid-state electronics required construct digital interfaces costly balanced pair cable higher attenuation higher frequencies therefore longer wire dslam subscriber slower maximum possible data rate due lower frequencies used limit total attenuation due higher number errors higher frequencies effectively lowering overall frequency/data rate following rough guide relation wire distance based 0.40 mm copper adsl2+ technology maximum data rate local conditions may vary especially beyond 2 km often necessitating closer dslam bring acceptable bandwidths customers connect dslam adsl modems dsl routers connected pstn network via typical unshielded twisted pair telephone lines dslam multiple aggregation cards card multiple ports customers lines connected typically single dslam aggregation card 24 ports number vary manufacturer common dslams housed telco-grade chassis supplied nominal 48 volts dc hence typical dslam setup may contain power converters dslam chassis aggregation cards cabling upstream links upstream trunk isp side many early dslams used atm—and approach standardized dsl forum—with gigabit ethernet support appearing sometime later today common upstream links dslams use gigabit ethernet multi-gigabit fiber optic links ip-dslam stands internet protocol digital subscriber line access multiplexer user traffic mostly ip based traditional 20th century dslams used asynchronous transfer mode atm technology connect upstream atm routers/switches devices extract ip traffic pass ip router ip network division work thought sensible dsl based atm could theoretically carry data ip atm stream contrast ip-dslam extracts ip traffic dslam passes ip router advantages ip-dslam traditional atm dslam merged equipment less expensive make operate offer richer set features | [
5472,
1121,
361,
1967,
2994,
7865,
7065
] | None |
5,810 | 9 | Location_API_for_Java_ME:location api java location api java compact generic java 2 api produces information device present physical location java applications api optionally supported mobile phone pda manufacturers minimum java platform required api cldc v1.1 location api developed java community process jsr 179 released september 2003 updated version 1.0.1 march 2006 nokia main author maintainer jsr openlapi lgpl implementation use emulator environments nokia reference implementation exist devices access gps device bluetooth location api designed work many different positioning methods generic interfaces lets application developers implement systems retrieve location data multiple sources based availability device advantages single means tracking including fail-over indoor/outdoor transparency choice speed accuracy trade-offs gps cellular positioning methods api supports location api support previously location service implementations provider specific aim api provide common api retrieving location information variety devices openlapi supports several back-ends along device specific wrappers since many providers choose implement optional jsr goal universality still happened developers often required create custom builds different devices location api available java applications blackberry windows mobile devices recent motorola sony ericsson devices nokia series 60 3rd edition devices | [
2208,
4960,
3561,
7246,
8882,
9011
] | Validation |
5,811 | 5 | GTunnel:gtunnel gtunnel windows application developed garden networks sets local http socks proxy server tunnels traffic server farm reaches intended destination gtunnel protects internet users privacy freedom speech ways gtunnel version 1.1 provides standard mode main working mode provides best data transfer performance connecting back-end servers directly skype mode tor mode go computers p2p network gtunnel also improved user interface features real-time traffic graphs gtunnel replaces earlier garden g2 client software becomes main client software garden networks gtunnel works linux wine support | [
5405,
4725,
5887
] | None |
5,812 | 4 | Model-driven_security:model-driven security model-driven security mds means applying model-driven approaches especially concepts behind model-driven software development security general concept model-driven security earliest forms around since late 1990s mostly university research first commercialized around 2002 also body later scientific research area continues day specific definition model-driven security specifically applies model-driven approaches automatically generate technical security implementations security requirements models particular model driven security mds tool supported process modelling security requirements high level abstraction using information sources available system produced stakeholders inputs expressed domain specific languages dsl transformed enforceable security rules little human intervention possible mds explicitly also includes run-time security management e.g entitlements/authorisations i.e run-time enforcement policy protected systems dynamic policy updates monitoring policy violations model-driven security also well-suited automated auditing reporting documenting analysis e.g compliance accreditation relationships models technical security implementations traceably defined model-transformations several industry analyst sources state mds significant impact information security infrastructure required become increasingly real-time automated adaptive changes organisation environment many information technology architectures today built support adaptive changes e.g service oriented architectures soa so-called platform-as-a-service mashups cloud computing information security infrastructure need support adaptivity agility term devopssec see devops used analysts equivalent model-driven security mds automates generation re-generation technical security enforcement generic models apart academic proof-of-concept developments commercially available full implementations model-driven security authorization management policy automation include objectsecurity openpmf earned listing gartner cool vendor report 2008 advocated number organizations e.g u.s. navy means make authorization policy management easier automated | [
7368,
4107,
210,
10580,
2013
] | None |
5,813 | 4 | Peerio:peerio peerio cross-platform end-to-end encrypted application provides secure messaging file sharing cloud file storage peerio available application ios android macos windows linux peerio legacy originally released 14 january 2015 replaced peerio 2 15 june 2017 messages user files stored peerio cloud protected end-to-end encryption meaning data encrypted way read third parties peerio service providers security provided single permanent key-password peerio called account key company peerio technologies inc. founded 2014 vincent drouin intent behind peerio provide security program easier use current pgp standard peerio allows users share encrypted messages files direct messages groups peerio calls rooms peerio rooms offered team-oriented group chat allowing administrative functionality add remove users group chat peerio allows users store encrypted files online offering limited cloud storage free optional paid upgrades peerio messages files persist logins hardware differing ephemeral encrypted messaging apps retain message file history logins different devices peerio supports application based multi-factor authentication peerio allows users share animated gifs peerio utilizes end-to-end encryption applied default message file data end-to-end encryption intended encrypt data way sender intended recipients able decrypt thus read data taken peerio privacy policy peerio utilizes nacl pronounced salt cryptographic framework uses following cryptographic primitives additionally peerio uses scrypt memory-hard key derivation blake2s used various hashing operations in-transit encryption peerio services use transport layer security tls best-practice cipher suite configuration including support perfect forward secrecy pfs view detailed up-to-date independent review peerio ’ tls configuration ssl labs prior peerio initial release software audited german security firm cure53 found non-security related bugs fixed prior applications release according peerio website application also audited march 2017 cure53 peerio partly open source publishes code publicly github peerio offers bug bounty offering cash rewards anyone reports security vulnerabilities first iteration peerio peerio legacy developed nadim kobeissi florencia herra-vega released 14 january 2015 closed 8 january 2018 peerio legacy free application available android ios windows macos linux google chrome extension offered end-to-end encryption enabled default encryption used minilock open-source security standard also developed kobeissi 15 june 2017 peerio 2 launched successor peerio legacy according company blog peerio 2 purported radical overhaul original application core technology claimed benefits comparison peerio legacy include increased speed support larger file transfers 7000gb re-designed user interface peerio also stated added focus towards businesses looking encrypted team collaboration software | [
711,
11211,
5612,
6797,
11244,
7983,
11221,
823,
8283,
6814
] | Test |
5,814 | 9 | AlphaBasic:alphabasic alphabasic computer programming language created alpha microsystems 1976 language written alpha microsystems employees paul edelstein dick wilcox bob courier alphabasic shares much common basic languages offer fairly unusual features multi-user orientation ability control memory layout variables map statement calling external assembly language subroutines xcall statement language designed developers vertical market software packages compiler runtime system written motorola 68000 assembly language thus able run alpha microsystems hardware compiler emits interpreter code | [
1952,
7269,
477
] | Validation |
5,815 | 3 | Select_(Unix):select unix select system call application programming interface api unix-like posix-compliant operating systems examining status file descriptors open input/output channels select system call similar poll facility introduced unix system v later operating systems however c10k problem select poll superseded likes kqueue epoll /dev/poll i/o completion ports c programming language select system call declared header file sys/select.h unistd.h following syntax codice_1 arguments may manipulated four utility macros fd_set fd_clr fd_zero fd_isset select returns total number bits set readfds writefds errorfds zero timeout expired -1 error sets file descriptor used select finite size depending operating system newer system call poll provides flexible solution | [
4616,
3082,
10785,
6180,
8242,
4161,
8772,
6213,
8268,
589,
593,
8275,
6244,
5222,
10856,
4207,
5244,
4734,
11391,
7821,
4238,
10382,
2711,
6808,
9882,
6813,
1694,
2723,
3237,
8364,
10933,
5822,
5824,
1736,
2762,
6352,
4831,
8928,
2278,
2... | None |
5,816 | 6 | ISO_13490:iso 13490 iso/iec 13490 also known ecma-168 successor iso 9660 level 3 intended describe file system cd-rom cd-r. iso 13490 several improvements predecessor fully addresses filename posix attribute multibyte character issues handled iso 9660 also efficient format permits incremental recording permits iso 9660 format iso/iec 13490 format co-exist media also specifies use multisession properly derived frankfurt group formed 1990 many cd-rom cd-wo hardware media manufacturers cd-rom data publishers users cd-roms major computer companies proposal fully supports orange book media iso 13490 define rule operating systems read multiple-session iso 9660 volume cd-r instead looking volume descriptor offset 32,768 sector number 16 cd start disc would default behavior iso 9660 programs accessing disc start reading 16th sector first track latest session sector numbers form contiguous sequence starting first session continue added sessions gaps hence cd mastering program wants add single file cd-r iso 9660 volume append session containing least updated copy entire directory tree plus new file duplicated directory entries still reference data files previous session similar way file data updated even removed removal however virtual removed content appear directory shown user still physically present disc therefore recovered takes space cd become full even though appearing still unused space though originally intended multisession support apply mode 2 form 1 formatted discs cd writing software supported multisession writing mode 1 format discs since early disc drives supported multisession mode 1 discs many cases second following sessions would become unreachable drives older cd writing software nero burning rom would import previous session data inserted disc could thus write subsequent session disc computer written previous sessions previous session data saved writing software closed | [
5120,
10752,
2564,
6669,
3598,
10257,
9236,
6677,
5142,
8214,
3611,
5149,
9245,
9249,
9762,
5158,
7720,
3126,
1079,
7225,
11323,
8772,
1610,
9290,
1109,
4708,
9836,
7789,
5231,
9333,
6263,
9335,
9343,
7818,
654,
2193,
2194,
2197,
8854,
21... | None |
5,817 | 5 | TCP-Illinois:tcp-illinois tcp-illinois variant tcp congestion control protocol developed university illinois urbana–champaign especially targeted high-speed long-distance networks sender side modification standard tcp congestion control algorithm achieves higher average throughput standard tcp allocates network resource fairly standard tcp compatible standard tcp provides incentives tcp users switch tcp-illinois loss-delay based algorithm uses packet loss primary congestion signal determine direction window size change uses queuing delay secondary congestion signal adjust pace window size change similarly standard tcp tcp-illinois increases window size w formula_1 acknowledgment decreases formula_2 formula_3 loss event unlike standard tcp formula_4 formula_5 constants instead functions average queuing delay formula_6 formula_7 formula_8 decreasing formula_9 increasing numerous choices formula_8 formula_9 one class formula_12 formula_13 let formula_8 formula_9 continuous functions thus formula_16 formula_17 formula_18 suppose formula_19 maximum average queuing delay denote formula_20 also formula_21 conditions formula_22 specific choice demonstrated figure 1 tcp-illinois increases throughput much quickly tcp congestion far increases throughput slowly congestion imminent result window curve concave average throughput achieved much larger standard tcp see figure 2 also many desirable features like fairness compatibility standard tcp providing incentive tcp users switch robust inaccurate delay measurement | [
7017,
10124,
10924,
2934,
9021,
10653,
2079
] | Test |
5,818 | 4 | Delphish:delphish delphish software product protects user data free anti-phishing extension microsoft outlook outlook express integrated toolbar delphish enables user check suspicious e-mails author country origin detects hidden links informs user origin operator linked web sites analyzes entire e-mail delphish created developed team made better-known safersurf another piece computer security software nutzwerk internet technologies software company headquartered leipzig delphish provides various features delphish released 2007 positive reviews ghacks said use delphish first layer defense phishing make sure able analyze mails well computerwoche wrote although delphish all-inclusive package anti-phishing protection turns useful informative tool seccity commented user estimate danger link since obtains detailed information link actual target type popularity age domain owners etc online pc said delphish provides advantages automatic recognition raises user awareness safe responsible use e-mails | [
7012,
8204,
6797,
7983,
3643
] | None |
5,819 | 2 | FreeBSD_Ports:freebsd ports freebsd ports collection package management system freebsd operating system providing easy consistent way installing software packages april 2018 31,679 ports available collection also adopted netbsd basis pkgsrc system ports collection uses makefiles arranged directory hierarchy software built installed uninstalled make command installing application little user intervention required issuing beginning command make install make install clean ports directory desired application cases software automatically downloaded internet patched configured necessary compiled installed registered package database new port needed dependencies applications libraries installed beforehand automatically ports already configured default options deemed generally appropriate users however configuration options called knobs sometimes changed installation using make config command brings text-based interface allows user select desired options historically port software package maintained individual port maintainer responsible ensuring currency port providing general support today many ports maintained special task forces sub-projects dedicated mailing list e.g kde freebsd.org java freebsd.org etc unmaintained ports assigned generic group ports freebsd.org general anyone may become port maintainer contributing favorite software collection one may also choose maintain existing port active maintainer precompiled binary ports called packages package created corresponding port make package command prebuilt packages also available download freebsd-hosted package repositories user install package passing package name pkg install command downloads appropriate package installed freebsd release version installs application including software dependencies may default packages downloaded main freebsd package repository pkg.freebsd.org freebsd maintains build farm called pointyhat cluster packages supported architectures major releases built build logs known errors ports built packages pointyhat cluster available database weekly builds logs also available mailing list archives precompiled packages separated categories architectures available packages separated several release directories one current production release built ports collection shipped release production release directories never updated also stable current directories several major release branches updated less weekly cases package created older version freebsd installed used newer system without difficulty since binary backward compatibility across major releases enabled default packaging system binary packages called codice_1 replaced package management system freebsd 10 jordan hubbard committed port make macros freebsd cvs repository august 21 1994 package install suite makefile committed year earlier august 26 1993 core ports framework first maintained hubbard along satoshi asami several years ports management team later formed handle task netbsd pkgsrc openbsd ports collection trace roots freebsd since release 3.6 dragonfly bsd project uses freebsd ports base dports ports collection john marino dragonfly bsd project created deltaports repository – collection patches files overlay modify freebsd ports order generate dports | [
10760,
10761,
8213,
6680,
4636,
9245,
5155,
5670,
7722,
5677,
1071,
9784,
5177,
10817,
8266,
8778,
5710,
7249,
3667,
6227,
9306,
607,
9324,
8816,
1138,
9844,
2168,
7293,
9343,
129,
2180,
6797,
10900,
10394,
2212,
4775,
684,
6828,
3248,
78... | Validation |
5,820 | 3 | Knight_Lore:knight lore knight lore 1984 action-adventure game known popularising isometric graphics video games game developed published ultimate play game written company founders chris tim stamper knight lore player character sabreman forty days collect objects throughout castle brew cure werewolf curse castle room depicted monochrome screen consists blocks climb obstacles avoid puzzles solve ultimate released knight lore third sabreman series despite completed first stamper brothers withheld release year position company advantageously anticipation game effect market knight lore novel image masking technique filmation let images appear pass atop behind without contents colliding created illusion depth priority computer natively support delaying knight lore release ultimate protected sales then-upcoming sabre wulf created another filmation game developers could copy style ultimate released original sabreman trilogy quick succession 1984 zx spectrum knight lore came last november ports followed bbc micro amstrad cpc msx family computer disk system 2008 unofficially ported atari 8-bit computers based bbc micro version game later included compilations including rare 2015 xbox one retrospective compilation rare replay knight lore regarded seminal work british gaming history included multiple lists top spectrum games critics considered technical solutions isometric 3d style harbinger future game design praised game controls atmosphere mystery noted difficult gameplay criticised sound occasional graphical slowdown knight lore best-selling game january 1985 named 1984 game year golden joystick awards popular computing weekly readers though first isometric 3d video game knight lore popularised format isometric flip-screen style fell fashion knight lore influence persisted computer role-playing games retrospective reviewers remember game first offer exploratory world rather flat surface consider controls outdated frustrating thirty years since release player sabreman bitten sabre wulf transforms werewolf nightfall 40 days collect items throughout melkhior wizard castle brew cure curse onscreen timer shows progression day night sabreman metamorphoses werewolf returning human form sunrise castle monsters attack sabreman werewolf game ends player completes potion finish task forty days game directions given poem included game cassette tape castle consists series 128 rooms displayed single non-scrolling screen sabreman must navigate 3d maze stone blocks room usually retrieve collectible object whilst avoiding spikes enemies kill contact player starts five lives loses one death running lives ends game stone blocks serve platforms player jump fall player weight move accord pushed enemies sabreman sabreman jumps higher werewolf form helps specific puzzles player often needs move blocks reach distant objects used platforms reach areas puzzles complete game player must return 14 sequential objects throughout castle wizard cauldron room end game player receives final score based remaining time amount quest completed ultimate play game represented co-founding brothers tim chris stamper uncommonly taciturn matters press marketing though provided details knight lore development crash magazine knight lore released third game sabreman series stamper brothers finished first withheld game year market reasons thought knight lore advancements—copyrighted filmation engine—would hurt sales then-upcoming sabre wulf used extra time prepare another filmation game alien 8 preempt sales would lost publishers would try copy technique sit everyone else far behind tim stamper recalled sabre wulf released commercial critical success 1984 alien 8 next two sabreman titles— underwurlde knight lore —followed close succession end year filmation knight lore graphical novelty lay images could render without overlapping filmation introduced masked sprites whereas earlier games used planar sprites overlapped without regard depth order chris stamper solution use image masking mask version image defines background subject matter different colours combining mask on-screen composite image mask background data ignored hole shape desired image sprite added background filled sprite details thus rooms knight lore drawn one sprite time masking method recent times contemporary images render layer priority set individual pixel level knight lore depicted monochrome changes rooms avoid attribute clash computing limitation wherein object colour interfered others close proximity ultimate released knight lore zx spectrum november 1984 press release announced game beginning new class adventure games pinnacle software development 48k spectrum standard cryptic company ultimate circulate screenshots game press materials cover art knight lore subsequently released bbc micro amstrad cpc msx later 1985 amstrad version upgraded monochromatic colouring two-colour foreground setup jaleco released versions knight lore msx later famicom disk system latter 1986 release barely resembled namesake ultimate asked shahid ahmad developed knight lore -inspired chimera 1985 develop knight lore port commodore 64 come fruition knight lore later appeared spectrum version 1986 compilation sold million ii 2015 xbox one compilation 30 ultimate rare titles rare replay computer game magazines lauded knight lore writing graphics first kind marked sea change contemporaries computer video games cvg wrote never seen graphics calibre lived ultimate hype peter sweasey home computing weekly left speechless predicted knight lore would change market crash said unlikely surpassed spectrum best game crash selected knight lore crash smash recommendation january 1985 issue knight lore best selling game united kingdom month popular computing weekly readers named knight lore 1984 arcade game overall game year knight lore also named cvg game year 1985 golden joystick awards event ultimate named developer programmer year knight lore atmosphere sinclair user described crepuscular world claustrophobic menace inspired many curious questions part adventurer contemporaneous 1985 reviews crash appreciated imaginative mystery game attempted answer sabreman turns werewolf preferred play collectible objects throughout castle sabreman werewolf transformation sequence particular annoyed cvg traumatised players according well played book academic close readings video games players empathised suffering sabreman game design gave impression castle far grander scale reality crash wrote game novel eight-way direction scheme suited 3d space crash compared knight lore stylistically 1984 avalon suggested former bolder visuals magazine preferred knight lore predecessor underwurlde one critic even considered former ultimate best game crash noted knight lore masking technique addressed issues flicker attribute clash sinclair user appreciated sabreman disappeared view passing behind blocks criticism reviewers considered knight lore sound weakest component though spectrum clash also identified sometimes cruel difficulty gameplay later rooms castle require pixel-perfect precision compounded anxiety running timer game animations would slow proportional degree onscreen action reviews amstrad release amtix noted colour additions monochromatic original wrote knight lore among amstrad best adventures one complaint graphical slowdown many elements moving onscreen amstrad action shared complaint nevertheless named knight lore among amstrad best three games—an improvement spectrum release par quality commodore 64 titles knight lore widely regarded seminal work british gaming history according kieron gillen rock paper shotgun knight lore second elite 1984 icon 1980s british computer game industry british magazine retro gamer described players first impressions knight lore unforgettable par experience playing space harrier 1985 wolfenstein 3d 1992 super mario 64 1996 first time retro gamer recalled knight lore striking isometric 3d visuals bold advance game graphics foretelling future british magazine edge described game graphics engine single greatest advance history video games retro gamer compared engine impact introduction sound film knight lore first use isometric graphics—earlier examples include zaxxon 1982 q*bert 1982 ant attack 1983 —but graphic style large in-game world popularised technique put ultimate filmation epicentre several video game clones inspired knight lore edge games struggled approximate isometric style internally visiting developer bo jangeborg devised solution result fairlight 1985 regarded another classic platform edge version filmation received branding worldmaker shahid ahmad said firebird chimera 1985 even closer knight lore ahmad shock admiration playing knight lore reportedly changed life convinced continue making games released chimera amstrad cpc atari 8-bit commodore 64 zx spectrum customising port processing limitations hardware 1986 many british video game publishers produced knight lore -style isometric games examples include sweevo world movie quazatron get dexter glider rider molecule man spindizzy bobby bearing many titles suffered slowdown issues knight lore due much on-screen activity ultimate released four filmation games alien 8 1985 rushed release developers opportunity react knight lore though retro gamer said rush noticeable alien 8 larger game world knight lore even puzzles alien 8 knight lore similar gameplay former set outer space updated filmation ii engine nightshade 1985 added colour scrolling graphics place flip-screen room changes however retro gamer regarded gameplay comparatively dull gunfright 1986 reported stampers last game also used filmation ii robust predecessor pentagram 1986 returned flip-screen rooms action-based gameplay included shooting enemies sold poorly last sabreman game meanwhile stamper brothers sought enter burgeoning console industry sold ultimate u.s. gold mid-1980s established rare develop nintendo console games ultimate last two isometric games lesser quality consumer interest genre endured isometric flip-screen trend continued britain several years apart fairlight sweevo world get dexter isometric flip-screen games included jon ritman knight lore -inspired batman 1986 head heels 1987 last ninja 1987 la abadía del crimen 1987 cadaver 1990 console games solstice 1990 landstalker 1992 players grew tired genre similar reiterations ritman games particular brought new ideas sandy white developed pre- knight lore isometric game ant attack impressed ultimate in-game balance gutsy design decisions developer great escape another isometric game considered knight lore rival title inspiration still spurred spend nine months making time stood still retro gamer wrote knight lore influence persisted 30 years later titles populous 1989 syndicate 1993 1994 civilization ii 1996 style also spread computer role-playing games like baldur gate diablo fallout though gamesradar matt cundy reported 2009 isometric perspective longer prominent topic game design 2014 chris scullion vice traced knight lore isometric influence sims 4 2014 diablo iii 2012 knight lore included multiple lists top spectrum games even top games platform inspired two fangames 1999 sequel 2010 3d remake development four years though isometric games existed previously retrospective review gillen rock paper shotgun recalled knight lore first game offer world physical depth exploration opposed simple mechanics arcade games jeremy signor usgamer agreed knight lore felt like world painting added game innovative use successive single-screen rooms flip-screen pre-dated legend zelda years gillen said game punishing style unforgiving gameplay high difficulty awkward controls become obsolete 30 years since release criticised knight lore enormously innovative incredibly atmospheric totally unplayable suggesting similar head heels 1987 aged much better peter parrish eurogamer found game frustrating though well-made dan whitehead publication appreciated 2015 rare replay compilation version knight lore emulated original choppy animations zx spectrum processor struggled render onscreen objects | [
3074,
4102,
4758,
9254,
9006,
10931,
4278,
320,
4418,
1226,
3029,
983,
5340,
9191,
2792,
3307,
8300,
7283,
6390,
2173,
8830
] | Test |
5,821 | 3 | Compaq_Presario_1200:compaq presario 1200 compaq presario 1200 series line notebook computers produced 1998 2000 compaq originally noted amd processors light weight 12-inch lcd screens later models included shift intel processors changed features label compaq presario 1200 includes vast set model numbers revisions many totally compatible even though machines share general presario model number many original models presario 1200 series ran amd k6-2 processors quite adventurous move time amd much second place dominant market leader intel chips notable inclusion 3d-now technology enabling marked performance increases original k6 chips came variety speeds ranging 333 mhz 550 mhz however performance varied slightly models number presario 1200 series notebooks exist celeron pentium iii processors well primarily found later designs later models often noted silver display lid instead original black lid range came toshiba hdds optical media drives available 24x cd-roms 4x dvd-roms hard drives ranged 3.01 gb 10.0 gb ran slow 3300 rpm across range could due noise limitations series noted low noise output screens available 12.1 13.0 inch lcds yet screen housing varied model model 1245 1246 different screen housing 1200 1200xl came 13 inch screen 1200 also silver housing whereas models came black screens series notable banding white edges appear evident machine ages backlight sides clearly visible memory expansion available bottom units allowing 128mb additional sodimm memory added models came equipped floppy disk drive vga output pc card slot standard also came on-board jbl stereo speakers synaptics touchpads systems preinstalled windows 98 windows windows 2000 professional supplied quick restore disc returned system factory condition event change ownership wish reinstall os system failure priced £1200 1200 contained 500 mhz amd k6-2 processor lithium ion battery originally priced 1,699 1200-xl125 designated model number 12xl125 1200-xl300 designated model number 12xl325 one newer models 1200 series features 1246 generally mirrored 1200-xl325 notable differences change intel processor architecture physical differences include silver lid different display hinge configuration slightly rearranged motherboard layout changes render generation presario 1200 distinctly incompatible component level predecessors major differences hardware 1200-xl325 1200-xl405a designated model number 12xl405a another model using intel processor similar layout xl325 motherboard equipped socket-370 zif cpu socket uses via ple133 chipset comprising vt8601 north bridge vt82c686a south bridge graphics provided via trident cyberblade-i1 controller integrated vt8601 circuitry although similar hardware xl405a xl502a model number 12xl502a upgraded model based brother notorious inclusion minipci slot bottom presence slightly faster processor color case silver lid maintained rest case all-black firsts units model originally came ni-mh battery pack later ones came dependable li-ion one types available purchase obviously fitted 1200-series one interesting thing specific model support pentium iii processors 1ghz coppermine cores expense massive heat battery power draw increase 1200-xl302 model number 12xl302 equipped similar xl502a difference celeron processor 600 mhz askey modem minipci slot compaq presario 1230 manufactured 1998 mmx intel processor known 3d sound speakers priced rrp £1000 1245 came equipped next model 1245 1246 offered new processor bigger hdd cf card slot fold-down feet desktop operation aesthetically 1246 almost identical 1245 screens cases highly similar many components interchangeable 1245 lcd inverters processors housing addition aforementioned 1245 spec 1246 offered almost technically identical 1245 1260 borrowed 333 mhz amd k6-2 processor 64mb ram ati rage ii graphics chip compaq presario 1200 laptops often found damaged power jacks power jacks appear blown half due sort short others rip copper traces motherboard due stress placed power jack presario 1200 laptops typically four tiny copper rings embedded motherboard behind power jack used reattach slightly damaged power jack repair failing unit lcd power inverter cable runs hinge base screen susceptible damage given strain bending closing lid cable 6-strand ribbon variety therefore soldering impossible | [
6765,
6151
] | None |
5,822 | 2 | Lguest:lguest lguest linux kernel x86 virtualization hypervisor introduced kernel version 2.6.23 released 9 october 2007 removed kernel version 4.14 november 2017 hypervisor operating-system-level virtualization system capable running unmodified 32-bit x86 linux kernels guest machines installation easy running modprobe lg followed tools/lguest/lguest create new guest lguest still installed kernel 4.14 later out-of-tree patches lguest maintained rusty russell | [
4616,
3082,
5139,
10780,
10785,
6180,
8242,
9266,
4161,
8772,
6213,
8268,
589,
593,
4695,
10851,
6244,
5222,
10856,
4207,
5244,
4734,
11391,
7812,
7821,
4238,
10382,
2195,
2711,
6808,
9882,
1694,
2723,
8364,
10933,
5815,
5824,
1736,
2762,
... | None |
5,823 | 3 | Interrupt_handler:interrupt handler computer systems programming interrupt handler also known interrupt service routine isr special block code associated specific interrupt condition interrupt handlers initiated hardware interrupts software interrupt instructions software exceptions used implementing device drivers transitions protected modes operation system calls traditional form interrupt handler hardware interrupt handler hardware interrupts arise electrical conditions low-level protocols implemented digital logic usually dispatched via hard-coded table interrupt vectors asynchronously normal execution stream interrupt masking levels permit often using separate stack automatically entering different execution context privilege level duration interrupt handler execution general hardware interrupts handlers used handle high-priority conditions require interruption current code processor executing later found convenient software able trigger mechanism means software interrupt form synchronous interrupt rather using hard-coded interrupt dispatch table hardware level software interrupts often implemented operating system level form callback function interrupt handlers multitude functions vary based triggered interrupt speed interrupt handler completes task example pressing key computer keyboard moving mouse triggers interrupts call interrupt handlers read key mouse position copy associated information computer memory interrupt handler low-level counterpart event handlers however interrupt handlers unusual execution context many harsh constraints time space intrinsically asynchronous nature makes notoriously difficult debug standard practice reproducible test cases generally n't exist thus demanding specialized skillset—an important subset system programming—of software engineers engage hardware interrupt layer unlike event handlers interrupt handlers expected set interrupt flags appropriate values part core functionality even cpu supports nested interrupts handler often reached interrupts globally masked cpu hardware operation architecture interrupt handler would normally save smallest amount context necessary reset global interrupt disable flag first opportunity permit higher priority interrupts interrupt current handler also important interrupt handler quell current interrupt source method often toggling flag bit kind peripheral register current interrupt n't immediately repeated handler exit resulting infinite loop exiting interrupt handler interrupt system exactly right state every eventuality sometimes arduous exacting task mishandling source many serious bugs kind halt system completely bugs sometimes intermittent mishandled edge case occurring weeks months continuous operation formal validation interrupt handlers tremendously difficult testing typically identifies frequent failure modes thus subtle intermittent bugs interrupt handlers often ship end customers modern operating system upon entry execution context hardware interrupt handler subtle reasons performance handler typically initiated memory execution context running process special connection interrupt essentially usurping running context—process time accounting often accrue time spent handling interrupts interrupted process however unlike interrupted process interrupt usually elevated hard-coded cpu mechanism privilege level high enough access hardware resources directly low-level microcontroller chip might lack protection modes memory management unit mmu chips execution context interrupt handler essentially interrupted program typically runs small stack fixed size memory resources traditionally extremely scant low end nested interrupts often provided exacerbates stack usage primary constraint interrupt handler programming endeavour exceed available stack worst-case condition requiring programmer reason globally stack space requirement every implemented interrupt handler application task allocated stack space exceeded condition known stack overflow normally detected hardware chips class stack exceeded another writable memory area handler typically work expected application fail later sometimes much later due handler side effect memory corruption stack exceeded non-writable protected memory area failure usually occur inside handler generally easier case later debug writable case one implement sentinel stack guard—a fixed value right beyond end legal stack whose value overwritten never system operates correctly common regularly observe corruption stack guard kind watch dog mechanism catch majority stack overflow conditions point time close offending operation multitasking system thread execution typically stack special system stack provided interrupts interrupts consume stack space whatever thread execution interrupted designs usually contain mmu user stacks usually configured stack overflow trapped mmu either system error debugging remap memory extend space available memory resources level microcontroller typically far less constrained stacks allocated generous safety margin systems supporting high thread counts better hardware interrupt mechanism switches stack special system stack none thread stacks need account worst-case nested interrupt usage tiny cpus far back 8-bit motorola 6809 1978 provided separate system user stack pointers many reasons highly desired interrupt handler execute briefly possible highly discouraged forbidden hardware interrupt invoke potentially blocking system calls system multiple execution cores considerations reentrancy also paramount system provides hardware dma concurrency issues arise even single cpu core uncommon mid-tier microcontroller lack protection levels mmu still provide dma engine many channels scenario many interrupts typically triggered dma engine associated interrupt handler expected tread carefully modern practice evolved divide hardware interrupt handlers front-half back-half elements front-half first level receives initial interrupt context running process minimal work restore hardware less urgent condition emptying full receive buffer marks back-half second level execution near future appropriate scheduling priority invoked back-half operates process context fewer restrictions completes handler logical operation conveying newly received data operating system data queue several operating systemslinux unix macos microsoft windows z/os desqview operating systems used pastinterrupt handlers divided two parts first-level interrupt handler flih second-level interrupt handlers slih flihs also known hard interrupt handlers fast interrupt handlers slihs also known slow/soft interrupt handlers deferred procedure calls windows flih implements minimum platform-specific interrupt handling similar interrupt routines response interrupt context switch code interrupt loaded executed job flih quickly service interrupt record platform-specific critical information available time interrupt schedule execution slih long-lived interrupt handling flihs cause jitter process execution flihs also mask interrupts reducing jitter important real-time operating systems since must maintain guarantee execution specific code complete within agreed amount time reduce jitter reduce potential losing data masked interrupts programmers attempt minimize execution time flih moving much possible slih speed modern computers flihs may implement device platform-dependent handling use slih platform-independent long-lived handling flihs service hardware typically mask associated interrupt keep masked case may complete execution unusual flih unmasks associated interrupt completes called reentrant interrupt handler reentrant interrupt handlers might cause stack overflow multiple preemptions interrupt vector usually avoided priority interrupt system flih also briefly masks interrupts equal lesser priority slih completes long interrupt processing tasks similarly process slihs either dedicated kernel thread handler executed pool kernel worker threads threads sit run queue operating system processor time available perform processing interrupt slihs may long-lived execution time thus typically scheduled similarly threads processes linux flihs called upper half slihs called lower half bottom half different naming used unix-like systems part bottom half | [
6675,
7187,
10776,
25,
4637,
1058,
9762,
5158,
3630,
7217,
9784,
10809,
576,
7235,
3157,
602,
10333,
97,
8298,
7281,
7285,
9335,
2168,
1147,
1660,
3197,
1150,
2179,
10883,
6797,
1170,
659,
6806,
9366,
1176,
6296,
7325,
9887,
4773,
3248,
... | Test |
5,824 | 2 | Access_Linux_Platform:access linux platform access linux platform alp discontinued open-source software based operating system referred next-generation version palm os mobile devices developed marketed access co. tokyo japan platform included execution environments java classic palm os gtk+-based native linux applications alp demonstrated devices variety conferences including 3gsm linuxworld guadec open source mobile alp first announced february 2006 initial versions platform software development kits officially released february 2007 coordinated effort access esteemo nec ntt docomo panasonic use platform basis shared platform implementing revised version i.mode mobile oriented applications platform moap l application programming interfaces apis conforming specifications limo foundation first smartphone use alp edelweiss emblaze mobile scheduled mid-2009 however shelved release first else renamed monolith smartphone developed sharp corporation cooperation emblaze mobile seven partners scheduled 2009 never released officially cancelled june 2010 result platform never launched independently devices longer referenced access website user interface designed similar general goals earlier palm os releases aim preserving zen palm design philosophy centered making applications simple possible aspects interface included task-based orientation rather file/document orientation commonly found desktop systems appearance platform intended highly customizable provide differentiation specific devices contexts last releases went much modern look gesture support longer close palm os similarly maemo nokia internet tablet framework alp based components drawn gnome project including gtk+ gstreamer frameworks variety core components drawn mainstream open source projects including bluez matchbox cramfs others components licensed gnu general public license gpl gnu lesser general public license lgpl open source licenses meaning alp free open environment software level several components alp released mozilla public license hiker project components addressed issues application life-cycle intertask communication exchange use structured data security time event-based notifications areas common development applications mobile devices alp presented standard apis common operations defined standards portable operating system interface posix linux standard base lsb however neither standard addresses telephony device customizing messaging several topics several frameworks apis defined access applications alp could developed linux-native code c c++ legacy palm os applications run garnet vm emulation environment java execution environments supported via development launchpad used application manager part hiker framework alp sdk used eclipse-based integrated development environment ide added plug-ins predecessor palm os development environment compilers used embedded application binary interface eabi enabled arm versions standard gnu compiler collection gcc tool chain alp used combination user-space policy-based security framework kernel-space linux security module implement fine-grained access controls components alp security implementation released part hiker framework controls based signatures certificates unsigned applications allowed access predefined set safe apis | [
11271,
3082,
5139,
10780,
10785,
6180,
3626,
5677,
7727,
8242,
9266,
6213,
8268,
7246,
7253,
3162,
607,
5222,
10856,
6763,
8315,
8316,
8829,
4734,
11391,
2179,
7812,
4238,
10382,
2195,
2711,
9882,
6301,
1694,
2723,
8355,
3248,
7857,
10933,
... | None |
5,825 | 3 | SpaceWire:spacewire spacewire spacecraft communication network based part ieee 1355 standard communications coordinated european space agency esa collaboration international space agencies including nasa jaxa rka within spacewire network nodes connected low-cost low-latency full-duplex point-to-point serial links packet switching wormhole routing routers spacewire covers two physical data-link seven layers osi model communications spacewire modulation data formats generally follow data strobe encoding differential ended signaling ds-de part ieee std 1355-1995 spacewire utilizes asynchronous communication allows speeds 2 mbit/s 400 mbit/s initial signalling rate 10mbit/s ds-de well-favored describes modulation bit formats routing flow control error detection hardware little need software spacewire also low error rates deterministic system behavior relatively simple digital electronics spacewire replaced old pecl differential drivers physical layer ieee 1355 ds-de low-voltage differential signaling lvds spacewire also proposes use space-qualified 9-pin connectors spacewire ieee 1355 ds-de allows wider set speeds data transmission new features automatic failover fail-over features let data find alternate routes spacecraft multiple data buses made fault-tolerant spacewire also allows propagation time interrupts spacewire links eliminating need separate time discretes transferred character starts parity bit data-control flag bit data-control flag 0-bit 8-bit lsb character follows otherwise one control codes including end packet eop network data frames look follows one address bytes used routing addresses either physical ones 0-32 logical ones difference physical addresses deleted frame header routing used hop-based routing based path specified frame logical addresses may deleted well depending router configuration hardware devices may connected either directly via spacewire router former case usually pairs devices used guarantee fail-safe operation however handled software spacewire router usually crossbar switch-type device operating wormhole switching mode also may limit speed communication lowest common speed routing decisions based programmed routing table initial incoming frame contents spacewire used worldwide use began primarily esa projects currently used nasa jaxa rka many organizations companies nasa projects using include james webb space telescope swift burst alert telescope lunar reconnaissance orbiter lcross geostationary operational environmental satellite goes-r scan testbed previously known communications navigation networking reconfigurable testbed connect also selected united states department defense operationally responsive space spacewire initiatives coordinated several space agencies frame ccsds order extend communication model network transport layers osi model spacewire supports highly fault-tolerant networks systems one reason popularity esa draft specification place protocol id following protocol id assigned ecss-e-st-50-11 commercial providers spacewire equipment spacewire ip cores articles | [
6659,
10214,
2503,
10833,
4918,
7865,
3450
] | Test |
5,826 | 9 | DIANA_(intermediate_language):diana intermediate language diana descriptive intermediate attributed notation ada intermediate language used represent semantics ada program originally designed interface front end syntactic analysis middle semantic analysis compiler one hand back end code generation optimization also used internal representation language tools diana also used pl/sql based ada diana abstract data type concrete implementations defined using idl specification language diana descends tcol aida earlier representations ada programs ada-0 subset ada karlsruhe 1980 first using aida later aida got replaced diana full karlsruhe ada compilation system used diana well idl external representation marshalling middle-end code generating back-end | [
428,
8262,
10703
] | Test |
5,827 | 1 | Adminer:adminer adminer formerly known phpminadmin tool managing content mysql databases since version 2 also postgresql ms sql sqlite oracle databases adminer distributed apache license gpl v2 form single php file around 470 kib size author jakub vrána started develop tool light-weight alternative phpmyadmin july 2007 adminer got attention 2008 made cca finals sourceforge also first webhosting providers started include adminer mysql managing tool portfolio services 2012 adminer got coverage linux.com second time project priorities according author order safety user-friendliness performance functionality size small single file result compilation minification source codes | [
11457,
899,
8644,
10340,
3462,
4198,
5546,
10413,
5198,
7022,
8539,
2901,
87,
9177,
5403,
2780
] | Test |
5,828 | 3 | Knight_Tyme:knight tyme knight tyme computer game released zx spectrum amstrad cpc commodore 64 msx compatibles 1986 published mastertronic part mastertronic added dimension label two versions zx spectrum release published full version 128k spectrum published first cut-down version 48k spectrum removed music graphics locations published later programmed david jones third game magic knight series in-game music written david whittaker c64 version rob hubbard spectrum amstrad versions graphics ray owen rescued friend gimbal self-inflicted white-out spell magic knight finds transported far future aboard starship uss pisces magic knight must find way back time help tyme guardians apprehended paradox police board u.s.s pisces magic knight first recognized crew ship must create id card receives template derby iv ship main computer getting id completed takes command ship first arriving starbase 1 refuel ship refueling magic knight collects pieces golden sundial monopole retreat outpost returning ship pieces sundial discovers time machine appeared inside uss pisces take back time gameplay similar knight tyme predecessor spellbound game wide range commands carried-out using windimation system whereby text commands carried-out choosing options command windows importance watching magic knight energy level keeping harm rather different time around whilst spellbound required player vigilant health needed player occasionally avoid flying objects could sap strength knight tyme much focused puzzle-solving aspect although still death rooms spellbound reason regarded true graphic adventure gameworld features large number characters hero interact time around however responsible welfare help quest belong time magic knight found displaced person time around knight tyme also involves space travel magic knight commandeering uss pisces using journey various planets star systems planets communicated beamed-down via uss pisces transporter system magic knight also needs keep note ship fuel runs starship stranded means end game refuelling take place many planets uss pisces visits one magic knight game stormbringer released 1987 | [
11518,
10931,
9006,
8823
] | Test |
5,829 | 3 | NuMachine:numachine numachine nu machine early microprocessor-based computer workstation designed interface local area networks developed late 1970s mit laboratory computer science lcs professor steve ward research group concert western digital project included development trix unix operating system variant numachine first developed commercially western digital bought texas instruments 1983 texas instruments dropped numachine development 1985 favor ti explorer main legacy bus architecture called nubus later adopted apple computer macintosh ii next influenced design pci bus trix operating system used gnu project first attempt operating system kernel | [
4741,
5141,
9686,
377,
7806
] | Test |
5,830 | 9 | Wolfram_Mathematica:wolfram mathematica wolfram mathematica usually termed mathematica modern technical computing system spanning areas technical computing including neural networks machine learning image processing geometry data science visualizations others system used many technical scientific engineering mathematical computing fields conceived stephen wolfram developed wolfram research champaign illinois wolfram language programming language used mathematica features wolfram mathematica include wolfram mathematica split two parts kernel front end kernel interprets expressions wolfram language code returns result expressions front end designed theodore gray 1988 provides gui allows creation editing notebook documents containing program code prettyprinting formatted text together results including typeset mathematics graphics gui components tables sounds content formatting generated algorithmically edited interactively standard word processing capabilities supported including real-time multi-lingual spell-checking documents structured using hierarchy cells allow outlining sectioning document support automatic numbering index creation documents presented slideshow environment presentations notebooks contents represented mathematica expressions created modified analyzed mathematica programs converted formats front end includes development tools debugger input completion automatic syntax highlighting among alternative front ends wolfram workbench eclipse based integrated development environment ide introduced 2006 provides project-based code development tools mathematica including revision management debugging profiling testing plugin intellij idea based ides work wolfram language code addition syntax highlighting analyse auto-complete local variables defined functions mathematica kernel also includes command line front end interfaces include jmath based gnu readline wolframscript ref | [
0,
5129,
15,
1039,
4623,
5148,
9248,
5677,
1591,
6718,
1087,
10819,
5703,
2652,
10848,
100,
2666,
5741,
2181,
7301,
6797,
11406,
7326,
9376,
7341,
10413,
9915,
4797,
2242,
5319,
4808,
5833,
8397,
9944,
219,
1765,
4840,
2282,
7924,
8440,
... | Test |
5,831 | 3 | Run_queue:run queue modern computers many processes run active processes placed array called run queue runqueue run queue may contain priority values process used scheduler determine process run next ensure program fair share resources one run time period quantum paused placed back run queue program stopped let another run program highest priority run queue allowed execute processes also removed run queue ask sleep waiting resource become available terminated linux operating system prior kernel 2.6.23 cpu system given run queue maintains active expired array processes array contains 140 one priority level pointers doubly linked lists turn reference processes given priority scheduler selects next process active array highest priority process quantum expires placed expired array priority active array contains processes scheduler swaps active expired arrays hence name 1 scheduler unix linux sar command used check run queue vmstat unix linux command also used determine number processes queued run waiting run appear r column two models run queues one assigns run queue physical processor one run queue system | [
8036,
7460,
4423,
823,
5823
] | Validation |
5,832 | 7 | HP_Converged_Systems:hp converged systems hp convergedsystem portfolio system-based products hewlett-packard hp integrates preconfigured components systems virtualization cloud computing big data collaboration converged management client virtualization composed servers storage networking integrated software services systems designed address cost complexity data center operations maintenance pulling components together single resource pool easier manage faster deploy previously would take three six months time order get system running reportedly takes 20 days hp convergedsystem hp convergedsystem uses common converged infrastructure architecture common foundation used hp server storage networking products hp converged infrastructure pools resources shared across different applications managed standardized management platform security software convergence server storage networking help user organizations save investment equipment maintenance management hp converged systems includes hp convergedsystem virtualization developing managing virtualized environments hp cloudsystem building managing cloud computing services across private public hybrid clouds hp convergedsystem big data loading analyzing managing vast quantities data hp convergedsystem collaboration configuration deployment microsoft unified communications software hp oneview converged infrastructure management hp convergedsystem client virtualization running virtual desktop infrastructure hp cloudsystem integrated cloud infrastructure delivering private public hybrid cloud services integrates hp cloud software hp servers storage networking technologies single system hp oneview converged infrastructure management product provides unified interface lets users automate formerly labor-intensive manual data center management maintenance tasks part software-defined data center hp convergedsystem virtualization consists series integrated server storage networking infrastructures offer scalability modular virtualization systems support 50 1,000 virtual machines hp convergedsystem 300 designed support 50 300 virtual machines comes configured hp proliant servers hp convergedsystem 700 designed larger enterprise installations 100 1,000 virtual machines comes configured hp bladesystem servers models customers choose vmware microsoft virtualization environments customers 700 model also install virtualization software models managed single console reported hp convergedsystem virtualization performs twice fast costs 25 percent less competing systems hp cloudsystem used enterprises service providers build manage private public hybrid cloud services system includes consumer-style user interface streamlined management tools based hp converged infrastructure hp cloudsystem modular infrastructure hp cloud service automation software cloudsystem integrates servers storage networking security management automate application infrastructure lifecycle service delivery via private hybrid clouds hp cloudsystem component hp converged cloud combines software cloud services unified set packages single unified architecture hp cloudsystem built hp cloud os features openstack technology enables users choose multiple hypervisors operating systems including microsoft vmware hp cloudsystem automatically shift workloads external clouds busy periods based pre-defined business policies supported public clouds include arsys sfr well amazon web services microsoft windows azure function commonly known cloud bursting hp cloudsystem lifecycle management tools automate process application provisioning customization configuration patch management retirement hp cloudsystem foundation features core components additional management capabilities simplified installation included hp cloudsystem enterprise hp convergedsystem big data provides workload-specific single-purpose systems support tasks performance critical data analytics data warehousing business applications software applications pre-integrated designed integrated hardware networking storage components hp convergedsystem 300 vertica designed businesses run hp vertica data analytics solution system works cloudera hortonworks mapr versions apache hadoop reported system operate 50 1,000 times faster competitors ’ data warehouse offerings hp convergedsystem 300 microsoft analytics platform system aps includes sql server parallel data warehouse pdw configured hdinsight hadoop nodes possible run polybase queries sql server pdw cloudera apache hortonworks hdp nodes hp convergedsystem 500 sap hana operates sap hana in-memory data management platform data analytics data warehousing reported system process data analytics twice fast competing systems sap hana hp convergedsystem 500 sap hana includes convergedsystem 500 hardware hp serviceguard sap hana data management tool protects unscheduled downtime providing capability automatic failover hp convergedsystem 500 sap hana enables users run data analytics enterprise resource planning erp workload-based system reported data analytics processes used take days weeks run accessed real-time hp convergedsystem 900 sap hana designed manage analyze large varied data sets reported hp convergedsystem 900 sap hana capable supplying 12 terabytes data one memory pool hp convergedsystem collaboration integrates hardware software services provide unified communications specific platforms pre-supplied workload configurations include hp collaboration solutions microsoft sharepoint server include hp sharepoint business decision business intelligence combines hp proliant gen8 servers sharepoint 2013 sql server ’ power view reported system takes less hour install launch hp convergedsystems solutions microsoft exchange server designed users deploy business email system modular simplified manner hp converged systems solutions microsoft lync server streamlines deployment microsoft lync communications voice instant messaging video includes reference architecture small medium enterprises hp oneview converged infrastructure management enables data center administrators perform automated lifecycle management hp servers part software-defined data center unlike legacy converged infrastructure management software focuses managing devices hp oneview designed help administrators enable tasks administrators view resources relationships visual map use representational state transfer rest application programming interface api automate system management tasks hp oneview interface modeled consumer applications efficiently manage hp bladesystem hp proliant generation 7 8 servers support hp moonshot arm servers planned reported hp oneview ’ deep knowledge servers hp virtual connect virtualization technology administrators deploy 16-node computer cluster 12 times faster could using manual operations administrators also use hp oneview provision maintain firmware across hp bladesystem enclosures servers virtual connect modules well manage virtual lan vlan network edge hp oneview plug-in vmware vcenter virtualization console enables administrators work directly vcenter console operations vmware vsphere hosts clusters managed automated reducing number steps takes carry tasks like setting new cluster hp convergedsystem 100 hosted desktops works software-defined hp moonshot m700 microserver systems includes software hardware services provide users environment running virtual desktops user gets dedicated cpu gpu removes need hypervisor according published reports moonshot server consumes 63 percent less power competing systems lower total cost ownership 44 percent compared standard desktop computer systems built joint effort amd citrix system reported provide graphics six times faster competing products client virtualization also provides way users securely access business applications data mobile devices | [
4194,
6153,
6703,
11030,
7802,
4604,
1663
] | Test |
5,833 | 9 | R_(programming_language):r programming language r programming language free software environment statistical computing graphics supported r foundation statistical computing r language widely used among statisticians data miners developing statistical software data analysis polls data mining surveys studies scholarly literature databases show substantial increases popularity r ranks 20th tiobe index measure popularity programming languages gnu package source code r software environment written primarily c fortran r freely available gnu general public license pre-compiled binary versions provided various operating systems although r command line interface several graphical user interfaces rstudio integrated development environment r implementation programming language combined lexical scoping semantics inspired scheme created john chambers 1976 bell labs important differences much code written runs unaltered r created ross ihaka robert gentleman university auckland new zealand currently developed r development core team chambers member r named partly first names first two r authors partly play name s. project conceived 1992 initial version released 1995 stable beta version 2000 r libraries implement wide variety statistical graphical techniques including linear nonlinear modelling classical statistical tests time-series analysis classification clustering others r easily extensible functions extensions r community noted active contributions terms packages many r standard functions written r makes easy users follow algorithmic choices made computationally intensive tasks c c++ fortran code linked called run time advanced users write c c++ java .net python code manipulate r objects directly r highly extensible use user-submitted packages specific functions specific areas study due heritage r stronger object-oriented programming facilities statistical computing languages extending r also eased lexical scoping rules another strength r static graphics produce publication-quality graphs including mathematical symbols dynamic interactive graphics available additional packages r rd latex-like documentation format used supply comprehensive documentation online number formats hard copy r interpreted language users typically access command-line interpreter user types codice_1 r command prompt presses enter computer replies 4 shown calculation interpreted sum two single-element vectors resulting single-element vector prefix codice_2 indicates list elements following line starts first element vector feature useful output extends multiple lines like similar languages apl matlab r supports matrix arithmetic r data structures include vectors matrices arrays data frames similar tables relational database lists arrays stored column-major order r extensible object system includes objects among others regression models time-series geo-spatial coordinates scalar data type never data structure r. instead scalar represented vector length one many features r derive scheme r uses s-expressions represent data code functions first-class manipulated way data objects facilitating meta-programming allow multiple dispatch variables r lexically scoped dynamically typed function arguments passed value lazy -- say evaluated used function called r supports procedural programming functions functions object-oriented programming generic functions generic function acts differently depending classes arguments passed words generic function dispatches function method specific class object example r generic codice_3 function print almost every class object r simple codice_4 syntax although used mainly statisticians practitioners requiring environment statistical computation software development r also operate general matrix calculation toolbox – performance benchmarks comparable gnu octave matlab capabilities r extended user-created packages allow specialised statistical techniques graphical devices import/export capabilities reporting tools rmarkdown knitr sweave etc packages developed primarily r sometimes java c c++ fortran r packaging system also used researchers create compendia organise research data code report files systematic way sharing public archiving core set packages included installation r 15,000 additional packages available comprehensive r archive network cran bioconductor omegahat github repositories task views page subject list cran website lists wide range tasks fields finance genetics high performance computing machine learning medical imaging social sciences spatial statistics r applied packages available r also identified fda suitable interpreting data clinical research r package resources include crantastic community site rating reviewing cran packages r-forge central platform collaborative development r packages r-related software projects r-forge also hosts many unpublished beta packages development versions cran packages bioconductor project provides r packages analysis genomic data includes object-oriented data-handling analysis tools data affymetrix cdna microarray next-generation high-throughput sequencing methods list changes r releases maintained various news files cran highlights listed several major releases specialized integrated development environment ide r rstudio similar development interface r tools visual studio generic ides like eclipse also offer features work r. graphical user interfaces point-and-click approach include rattle gui r commander rkward common editors varying levels support r include emacs emacs speaks statistics vim nvim-r plugin neovim nvim-r plugin kate lyx notepad++ visual studio code winedt tinn-r. r functionality accessible several scripting languages python perl ruby f julia interfaces high-level programming languages like java .net c available well main r implementation written r c fortran several implementations aimed improving speed increasing extensibility closely related implementation pqr pretty quick r radford m. neal improved memory management support automatic multithreading renjin fastr java implementations r use java virtual machine cxxr rho riposte implementations r c++ renjin riposte pqr attempt improve performance using multiple processor cores form deferred evaluation alternative implementations experimental incomplete relatively users compared main implementation maintained r development core team tibco built runtime engine called terr part spotfire microsoft r open fully compatible r distribution modifications multi-threaded computations r vibrant active local communities worldwide users network share ideas learn growing number r events bringing users together conferences e.g user whyr conectar satrdays meetups well r-ladies groups promote gender diversity official annual gathering r users called user first event user 2004 may 2004 vienna austria skipping 2005 user conference held annually usually alternating locations europe north america subsequent conferences included future conferences planned follows r journal open access refereed journal r project statistical computing features short medium length articles use development r including packages programming tips cran news foundation news r comparable popular commercial statistical packages sas spss stata r available users charge free software license january 2009 new york times ran article charting growth r reasons popularity among data scientists threat poses commercial statistical packages sas june 2017 data scientist robert muenchen published in-depth comparison r software packages popularity data science software although r open-source project supported community developing companies strive provide commercial support and/or extensions customers section gives examples companies 2007 richard schultz martin schultz steve weston kirk mettler founded revolution analytics provide commercial support revolution r distribution r also includes components developed company major additional components include parallelr r productivity environment ide revoscaler big data analysis revodeployr web services framework ability reading writing data sas file format revolution analytics also offer distribution r designed comply established iq/oq/pq criteria enables clients pharmaceutical sector validate installation revolution r. 2015 microsoft corporation completed acquisition revolution analytics since integrated r programming language sql server 2016 sql server 2017 power bi azure sql database azure cortana intelligence microsoft r server visual studio 2017 october 2011 oracle announced big data appliance integrates r apache hadoop oracle linux nosql database exadata hardware oracle r enterprise became one two components oracle advanced analytics option alongside oracle data mining ibm offers support in-hadoop execution r provides programming model massively parallel in-database analytics r. tibco offers runtime-version r part spotfire mango offers validation package r validr make compliant drug approval agencies like fda agencies allow use statistical software submissions software validated either vendor sponsor following examples illustrate basic syntax language use command-line interface r generally preferred assignment operator arrow made two characters codice_5 although codice_6 usually used instead one r ’ strengths ease creating new functions objects function body remain local function data type may returned example user-created function short r code calculating mandelbrot set first 20 iterations equation z z c plotted different complex constants c example demonstrates | [
2050,
1028,
6664,
5129,
5130,
6154,
2062,
15,
6160,
4628,
5148,
9245,
3618,
5677,
2045,
5684,
1591,
2556,
6718,
576,
8258,
10819,
8262,
5703,
9286,
10822,
6228,
1112,
3674,
2652,
10848,
10340,
1130,
7274,
8810,
5741,
623,
8304,
6769,
3705... | Test |
5,834 | 4 | Automated_Certificate_Management_Environment:automated certificate management environment automatic certificate management environment acme protocol communications protocol automating interactions certificate authorities users web servers allowing automated deployment public key infrastructure low cost designed internet security research group isrg let encrypt service protocol based passing json-formatted messages https published internet standard rfc 8555 chartered ietf working group isrg provides free open-source reference implementations acme certbot python-based implementation server certificate management software using acme protocol boulder certificate authority implementation written go december 2015 web server caddy gained native support automatic certificate issuance renewal using acme protocol since spun go library called certmagic october 2017 let encrypt announced similar built-in functionality module apache httpd since large number client options appeared api v1 released april 12 2016 supports issuing certificates single domains example.com cluster.example.com let encrypt suggests users migrate v2 soon possible support v1 planned deprecated many acme clients already support v2 ahead release api v2 released march 13 2018 pushed back several times acme v2 backwards compatible v1 version 2 supports wildcard domains *.example.com allowing many subdomains trusted ssl e.g nowiki https //cluster01.example.com /nowiki nowiki https //cluster02.example.com /nowiki nowiki https //example.com /nowiki private networks single domain using single shared wildcard certificate major new requirement v2 requests wildcard certificates require modification domain name service txt record verifying control domain changes acme v2 protocol since v1 include | [
513,
517,
1157,
11653,
1288,
9744,
1683,
1688,
1435,
3742,
419,
2083,
8358,
8615,
1836,
11693,
7985,
9394,
11569,
7736,
9281,
10622,
9412,
3657,
10831,
11345,
2003,
11221,
5590,
474,
3805,
7264,
8674,
7139,
10341,
8554,
2034,
5107,
501,
1... | Test |
5,835 | 4 | DefenderMX:defendermx defendermx commercial linux based email security solution company founded 2002 company headquarters located washington dc usa company develops gateway hosted solutions built linux defendermx originally developed 2001 bains digital technologies fsl bains digital merged defendermx product merged barricademx plus line products fsl revived defendermx name next generation products based open source haraka project fsl major contributor defendermx uses following open source projects technologies | [
8224,
1409,
4294,
9222,
914,
2098,
7347,
9909,
10906,
6458,
8539
] | Test |
5,836 | 1 | Block_contention:block contention database management systems block contention data contention refers multiple processes instances competing access index data block time general caused frequent index table scans frequent updates concurrent statement executions two instances may also lead contention subsequently busy waiting process without lock situations goal spread queries greater number blocks avoid concentrating single one | [] | Test |
5,837 | 9 | Matthias_Felleisen:matthias felleisen matthias felleisen german-american computer science professor author grew germany immigrated us 21 years old felleisen currently trustee professor khoury college computer sciences northeastern university boston massachusetts past taught rice university receiving phd indiana university direction daniel p. friedman felleisen interests include programming languages including software tools program design design recipe software contracts many 1990s felleisen launched plt teachscheme programbydesign eventually giving rise bootstrap project goal teaching program-design principles beginners explore use scheme produce large systems part effort authored design programs mit press 2001 findler flatt krishnamurthi dissertation felleisen developed small-step operational semantics higher-order functional imperative extensions state control part semantics engineering plt redex derived dissertation well-known application proof type safety worked phd student andrew wright control delimiters basis delimited continuations introduced felleisen 1988 since used large number domains particularly defining new control operators see queinnec survey a-normal form anf intermediate representation programs functional compilers introduced sabry felleisen 1992 simpler alternative continuation-passing style cps felleisen gave keynote addresses 2011 technical symposium computer science education 2010 international conference functional programming 2004 european conference object-oriented programming 2001 symposium principles programming languages several conferences workshops computer science 2006 inducted fellow association computing machinery 2009 received karl v. karlstrom outstanding educator award acm 2010 received sigcse award outstanding contribution computer science education acm 2012 received acm sigplan programming languages achievement award significant lasting contribution field programming languages including small-step operational semantics control state mixin classes mixin modules fully abstract semantics sequential pcf web programming techniques higher-order contracts blame static typing dynamic languages felleisen co-author | [
4992,
10752,
4867,
11269,
3334,
6919,
7562,
2062,
9231,
1301,
9749,
9877,
8728,
4633,
10395,
6556,
3869,
10012,
2335,
6047,
8226,
4516,
5031,
9128,
5803,
2225,
10547,
11255,
7734,
311,
2105,
7867,
6717,
4799,
5569,
6594,
8771,
10435,
4550,
... | Test |
5,838 | 7 | Appian_Corporation:appian corporation appian corporation cloud computing company currently headquartered tysons corner virginia part dulles technology corridor appian sells platform service building enterprise software applications competes low-code development business process management case management markets appian named 2018 washington d.c. area top workplace washington post appian founded 1999 matthew calkins co-founders michael beckley marc wilson robert kramer 2001 appian developed army knowledge online time regarded “ world largest intranet 2004 appian released appian enterprise first business process management suite bpms software platform 2014 appian received 37.5 million secondary investments new enterprise associates 2016 appian ’ software platform evolved include broader aspects application development focus low-code development may 25 2017 appian became publicly-traded company trading symbol appn nasdaq global exchange 2018 appian announced move headquarters tysons virginia | [
4042,
4194
] | None |
5,839 | 3 | Dynamite_Bowl:dynamite bowl general concept five players play 30 bowling lanes available simulating concept bowling league players change lane positioning determine strong throw even make ball go various curves even straight ball pins player character either male female options bowling ball weights ranging | [
10931,
9006
] | Validation |
5,840 | 2 | Paging:paging computer operating systems paging memory management scheme computer stores retrieves data secondary storage use main memory scheme operating system retrieves data secondary storage same-size blocks called pages paging important part virtual memory implementations modern operating systems using secondary storage let programs exceed size available physical memory simplicity main memory called ram acronym random-access memory secondary storage called disk shorthand hard disk drive concepts depend whether terms apply literally specific computer system ferranti introduced paging atlas first mass market memory pages concepts computer architecture regardless whether page moved ram disk example pdp-8 7 instruction bits comprised memory address selected one 128 2 words zone memory called page use term rare 1960s swapping early virtual memory technique entire program would swapped rolled ram disk another one would swapped rolled swapped-out program would current execution would suspended ram use another program program might include multiple overlays occupy memory different times overlays method paging ram disk merely minimizing program use ram subsequent architectures used memory segmentation individual program segments became units exchanged disk ram segment program entire code segment data segment sometimes large data structures segments contiguous resident ram requiring additional computation movement remedy fragmentation invention page table let processor operate arbitrary pages anywhere ram seemingly contiguous logical address space pages became units exchanged disk ram process tries reference page currently present ram processor treats invalid memory reference page fault transfers control program operating system operating system must page frames use operating system must select page frame reuse page program needs evicted page frame dynamically allocated program hold data program modified since read ram words become dirty must written disk freed program later references evicted page another page fault occurs page must read back ram method operating system uses select page frame reuse page replacement algorithm important efficiency operating system predicts page frame least likely needed soon often least recently used lru algorithm algorithm based program working set increase responsiveness paging systems may predict pages needed soon preemptively loading ram program references completing initialization programs operate small number code data pages compared total memory program requires pages frequently accessed called working set working set small percentage system total number pages virtual memory systems work efficiently insignificant amount computing spent resolving page faults working set grows resolving page faults remains manageable growth reaches critical point faults go dramatically time spent resolving overwhelms time spent computing program written condition referred thrashing thrashing occurs program works huge data structures large working set causes continual page faults drastically slow system satisfying page faults may require freeing pages soon re-read disk thrashing also used contexts virtual memory systems example describe cache issues computing silly window syndrome networking worst case might occur vax processors single movl crossing page boundary could source operand using displacement deferred addressing mode longword containing operand address crosses page boundary destination operand using displacement deferred addressing mode longword containing operand address crosses page boundary source destination could cross page boundaries single instruction references ten pages ram cause page fault fault occurs operating system needs go extensive memory management routines perhaps causing multiple i/os might including writing process pages disk reading pages active process disk operating system could allocate ten pages program remedying page fault would discard another page instruction needs restart instruction would fault decrease excessive paging resolve thrashing problems user increase number pages available per program either running fewer programs concurrently increasing amount ram computer multi-programming multi-user environment many users may execute program written code data separate pages minimize use ram users share single copy program process page table set pages address code point single shared copy pages address data point different physical pages process different programs might also use libraries save space one copy shared library loaded physical memory programs use library virtual addresses map pages contain library code data programs want modify library code use copy-on-write memory allocated needed shared memory efficient way communication programs programs share pages memory write read exchange data first computer support paging supercomputer atlas jointly developed ferranti university manchester plessey 1963 machine associative content-addressable memory one entry 512 word page supervisor handled non-equivalence interruptions managed transfer pages core drum order provide one-level store programs paging feature microsoft windows since windows 3.0 1990 windows 3.x creates hidden file named 386spart.par win386.swp use swap file generally found root directory may appear elsewhere typically windows directory size depends much swap space system setting selected user control panel → enhanced virtual memory user moves deletes file blue screen appear next time windows started error message permanent swap file corrupt user prompted choose whether delete file whether exists windows 95 windows 98 windows use similar file settings located control panel → system → performance tab → virtual memory windows automatically sets size page file start 1.5× size physical memory expand 3× physical memory necessary user runs memory-intensive applications system low physical memory preferable manually set sizes value higher default file used paging windows nt family pagefile.sys default location page file root directory partition windows installed windows configured use free space available drives pagefiles required however boot partition i.e drive containing windows directory pagefile system configured write either kernel full memory dumps blue screen death windows uses paging file temporary storage memory dump system rebooted windows copies memory dump pagefile separate file frees space used pagefile default configuration windows pagefile allowed expand beyond initial allocation necessary happens gradually become heavily fragmented potentially cause performance problems common advice given avoid set single locked pagefile size windows expand however pagefile expands filled default configuration 150 total amount physical memory thus total demand pagefile-backed virtual memory must exceed 250 computer physical memory pagefile expand fragmentation pagefile occurs expands temporary soon expanded regions longer use next reboot sooner additional disk space allocations freed pagefile back original state locking pagefile size problematic windows application requests memory total size physical memory pagefile leading failed requests allocate memory may cause applications system processes fail also pagefile rarely read written sequential order performance advantage completely sequential page file minimal however large pagefile generally allows use memory-heavy applications penalties beside using disk space fragmented pagefile may issue fragmentation variable size page file time create number fragmented blocks drive causing files become fragmented reason fixed-size contiguous pagefile better providing size allocated large enough accommodate needs applications required disk space may easily allocated systems recent specifications i.e system 3 gb memory 6 gb fixed-size pagefile 750 gb disk drive system 6 gb memory 16 gb fixed-size pagefile 2 tb disk space examples system using 0.8 disk space pagefile pre-extended maximum defragmenting page file also occasionally recommended improve performance windows system chronically using much memory total physical memory view ignores fact aside temporary results expansion pagefile become fragmented time general performance concerns related pagefile access much effectively dealt adding physical memory unix systems unix-like operating systems use term swap describe act moving memory pages ram disk region disk pages stored systems common dedicate entire partition hard disk swapping partitions called swap partitions many systems entire hard drive dedicated swapping separate data drive containing swap partition hard drive dedicated swapping called swap drive scratch drive scratch disk systems support swapping swap partition others also support swapping files linux kernel supports virtually unlimited number swap backends devices files also supports assignment backend priorities kernel needs swap pages physical memory uses highest-priority backend available free space multiple swap backends assigned priority used round-robin fashion somewhat similar raid 0 storage layouts providing improved performance long underlying devices efficiently accessed parallel end-user perspective swap files versions 2.6.x later linux kernel virtually fast swap partitions limitation swap files contiguously allocated underlying file systems increase performance swap files kernel keeps map placed underlying devices accesses directly thus bypassing cache avoiding filesystem overhead regardless red hat recommends swap partitions used residing hdds rotational magnetic media devices one benefit using swap partitions ability place contiguous hdd areas provide higher data throughput faster seek time however administrative flexibility swap files outweigh certain advantages swap partitions example swap file placed mounted file system set desired size added changed needed swap partitions flexible enlarged without using partitioning volume management tools introduce various complexities potential downtimes swappiness linux kernel parameter controls relative weight given swapping runtime memory opposed dropping pages system page cache whenever memory allocation request met free memory swappiness set values 0 100 inclusive low value causes kernel prefer evict pages page cache higher value causes kernel prefer swap cold memory pages default value codice_1 setting higher increase overall throughput particularly disk io risk occasional high latency cold pages need swapped back setting lower even 0 may provide consistently low latency certainly default values work well workloads desktops interactive systems adequate ram expected task may want lower setting batch processing less interactive systems may want increase system memory highly insufficient current tasks large portion memory activity goes slow swap system become practically unable execute task even cpu idle every process waiting swap system considered swap death swap death happen due incorrectly configured memory overcommitment original description swapping death problem relates x server code data used x server respond keystroke main memory user enters keystroke server take one page faults requiring pages read swap keystroke processed slowing response pages n't remain memory faulted handle next keystroke making system practically unresponsive even actually executing tasks normally macos uses multiple swap files default apple-recommended installation places root partition though possible place instead separate partition device amigaos 4.0 introduced new system allocating ram defragmenting physical memory still uses flat shared address space defragmented based slab allocation method paging memory allows swapping paging implemented amigaos 4.1 may lock system physical memory used swap memory could activated deactivated moment allowing user choose use physical ram backing store virtual memory operating system typically many orders magnitude slower ram additionally using mechanical storage devices introduces delay several milliseconds hard disk therefore desirable reduce eliminate swapping practical operating systems offer settings influence kernel decisions many unix-like operating systems example aix linux solaris allow using multiple storage devices swap space parallel increase performance older virtual memory operating systems space swap backing store reserved programs allocate memory runtime data operating system vendors typically issue guidelines much swap space allocated paging one way allowing size addresses used process process virtual address space logical address space different amount main memory actually installed particular computer physical address space systems size process virtual address space much larger available main memory example computer true n -bit addressing may 2 addressable units ram installed example 32-bit x86 processor 4 gb without physical address extension pae case processor able address ram installed however even case paging used create virtual memory 4 gb instance many programs may running concurrently together may require 4 gb ram paging system makes efficient decisions memory relegate secondary storage leading best use installed ram although processor example address ram beyond 4 gb operating system may provide services programs envision larger memory files grow beyond limit installed ram operating system lets program manipulate data file arbitrarily using paging bring parts file ram necessary computers main memory larger virtual address space process magic-1 pdp-11 machines systems using 32-bit x86 processors physical address extension nullifies significant advantage virtual memory since single process use main memory amount virtual address space systems often use paging techniques obtain secondary benefits size cumulative total virtual address spaces still limited amount secondary storage available | [
2560,
1025,
3586,
5120,
2571,
6155,
3603,
6675,
7187,
10776,
25,
5146,
8732,
541,
4637,
3615,
9762,
4643,
6180,
5158,
7728,
7217,
10803,
4151,
9784,
10809,
576,
2625,
6730,
6221,
4178,
9300,
86,
10839,
3160,
6233,
10333,
7776,
97,
11363,
... | None |
5,841 | 1 | MySQLi:mysqli mysqli extension mysql improved relational database driver used php scripting language provide interface mysql databases three main api options considering connecting mysql database server php code consists core optional extensions core functionality php mysql-related extensions mysqli extension mysql extension implemented using php extension framework extension typically exposes api php developer allow facilities used programmatically however extensions use php extension framework expose api php developer pdo mysql driver extension example expose api php developer provides interface pdo layer mysqli improved version older php mysql driver offering various benefits authors php scripting language recommend using mysqli dealing mysql server versions 4.1.3 newer takes advantage new functionality mysqli extension provides various benefits respect predecessor prominent according php website mysqli extension features dual interface supports procedural object-oriented programming paradigms users migrating old mysql extension may prefer procedural interface procedural interface similar old mysql extension many cases function names differ prefix mysqli functions take connection handle first argument whereas matching functions old mysql interface took optional last argument example easy migration old mysql extension mysql server supports use different transport layers connections connections use tcp/ip unix domain sockets windows named pipes hostname codice_1 special meaning bound use unix domain sockets possible open tcp/ip connection using hostname codice_1 must use codice_3 instead example special meaning localhost output hr statements executed mysqli_query mysqli_real_query mysqli_multi_query functions mysqli_query function common combines executing statement buffered fetch result set one call calling mysqli_query identical calling mysqli_real_query followed mysqli_store_result example connecting mysql buffered result sets statement execution results retrieved buffered client read row row client-side result set buffering allows server free resources associated statement results early possible generally speaking clients slow consuming result sets therefore recommended use buffered result sets mysqli_query combines statement execution result set buffering php applications navigate freely buffered results navigation fast result sets held client memory please keep mind often easier scale client scale server example navigation buffered results example output unbuffered result sets client memory short resource freeing server resources early possible keep server load low needed unbuffered results used scrolling unbuffered results possible rows read example navigation unbuffered results result set values data types mysqli_query mysqli_real_query mysqli_multi_query functions used execute non-prepared statements level mysql client server protocol command com_query text protocol used statement execution text protocol mysql server converts data result sets strings sending conversion done regardless sql result set column data type mysql client libraries receive column values strings client-side casting done convert columns back native types instead values provided php strings example text protocol returns strings default example output possible convert integer float columns back php numbers setting mysqli_opt_int_and_float_native connection option using mysqlnd library set mysqlnd library check result set meta data column types convert numeric sql columns php numbers php data type value range allows way example sql int columns returned integers example native data types mysqlnd connection option example output mysql database supports prepared statements prepared statement parameterized statement used execute statement repeatedly high efficiency basic workflow prepared statement execution consists two stages prepare execute prepare stage statement template sent database server server performs syntax check initializes server internal resources later use mysql server supports using anonymous positional placeholder see example mysql database supports stored procedures stored procedure subroutine stored database catalog applications call execute stored procedure call sql statement used execute stored procedure parameter stored procedures inout parameters depending mysql version mysqli interface special notion different kinds parameters parameter input parameters provided call statement please make sure values escaped correctly see examples mysql optionally allows multiple statements one statement string sending multiple statements reduces client-server round trips requires special handling multiple statements multi queries must executed mysqli_multi_query individual statements statement string separated semicolon result sets returned executed statements must fetched mysql server allows statements return result sets statements return result sets one multiple statement see examples mysql server supports transactions depending storage engine used since mysql 5.5 default storage engine innodb innodb full acid transaction support transactions either controlled using sql api calls recommended use api calls enabling disabling auto commit mode committing rolling back transactions examples mysql result set contains metadata metadata describes columns found result set metadata sent mysql accessible mysqli interface extension performs negligible changes information receives differences mysql server versions aligned meta data access mysqli_result interface view persistent connection support introduced php 5.3 mysqli extension support already present pdo mysql ext/mysql idea behind persistent connections connection client process database reused client process rather created destroyed multiple times reduces overhead creating fresh connections every time one required unused connections cached ready reused unlike mysql extension mysqli provide separate function opening persistent connections open persistent connection must prepend p hostname connecting problem persistent connections left unpredictable states clients example table lock might activated client terminates unexpectedly new client process reusing persistent connection get connection cleanup would need done new client process could make good use persistent connection increasing burden programmer persistent connection mysqli extension however provides built-in cleanup handling code cleanup carried mysqli includes ensures persistent connections clean state return connection pool client process uses mysqli extension cleanup automatically calling c-api function mysql_change_user automatic cleanup feature advantages disadvantages though advantage developer longer needs worry adding cleanup code called automatically however disadvantage code could potentially little slower code perform cleanup needs run time connection returned connection pool possible switch automatic cleanup code compiling php mysqli_no_change_user_on_pconnect defined | [
8644,
9286,
7022,
9780,
2901
] | Validation |
5,842 | 7 | Engineered_Software_Inc.:engineered software inc engineered software inc. software publisher engineering products company based lacey washington founded 1982 company develops hydraulic analysis software specialized piping system design based mainly darcy-weisbach equation centrifugal pump selection using pump affinity rules industries served segments includes aerospace defense chemical processing engineering design consulting food beverage oil petrochemical mining metals pharmaceutical power generation pulp paper wastewater collection treatment education business segments software including saas industrial training publications technical support company one leading manufacturers windows web-based pump selection software products division split 2002 operates brand pump-flo solutions company best known consumer public manufacturer pipe-flo software pipe-flo program proprietary file extension .pipe opened programs including viewer type program uses .psv extension 2008 engineered software inc. expanded engineering products include training courses publications sold brand name fluid fundamentals training 2006 engineered software inc. entered four-year agreement crane valve north america known crane company publish technical paper number 410 tp410 crane agreed allow engineered software provide flow fluids premium software crane manual crane fluid handling later partnered engineered software rewrite crane tp410 2009 company still holds contract crane fluid handling market sell produce guide crane co. flow fluids brand 2007 company became member educational non-profit pump systems matter™ engineered software ceo ray hardee p.e. recognized 2008 hydraulic institute hi contributions hydraulic institute/pump systems matter committee led publication optimizing pumping systems guidebook ops company ceo also member committee wrote standard asme ea-2-2009 energy assessment pumping systems author piping system fundamentals complete guide gaining clear picture piping system | [
467
] | None |
5,843 | 5 | Media_Gateway_Control_Protocol:media gateway control protocol media gateway control protocol mgcp signaling call control communications protocol used voice ip voip telecommunication systems implements media gateway control protocol architecture controlling media gateways internet protocol ip networks connected public switched telephone network pstn protocol successor simple gateway control protocol sgcp developed bellcore cisco internet protocol device control ipdc methodology mgcp reflects structure pstn power network residing call control center softswitch analogous central office telephone network endpoints low-intelligence devices mostly executing control commands call agent media gateway controller softswitch providing result indications response protocol represents decomposition voip models h.323 session initiation protocol sip endpoint devices call higher levels signaling intelligence mgcp text-based protocol consisting commands responses uses session description protocol sdp specifying negotiating media streams transmitted call session real-time transport protocol rtp framing media streams media gateway control protocol architecture methodologies programming interfaces described rfc 2805 mgcp master-slave protocol media gateways mgs controlled call control agent softswitch controller called media gateway controller mgc call agent ca network protocol control specific port media gateway facilitates centralized gateway administration provides scalable ip telephony solutions distributed system composed least one call agent one usually multiple media gateways performs conversion media signals circuit-switched packet-switched networks least one signaling gateway sg connected pstn mgcp presents call control architecture limited intelligence edge endpoints media gateways intelligence core controllers mgcp model assumes call agents synchronize send coherent commands responses gateways control call agent uses mgcp request event notifications reports status configuration data media gateway well specify connection parameters activation signals toward pstn telephony interface softswitch typically used conjunction signaling gateways access signalling system 7 ss7 functionality example call agent use mgcp control signaling gateway rather sigtran protocols used backhaul signaling signaling gateway call agents typically media gateway may configured list call agents may accept control commands principle event notifications may sent different call agents endpoint gateway according instructions received call agents setting notifiedentity parameter practice however usually desirable endpoints gateway controlled call agent call agents available provide redundancy event primary call agent fails loses contact media gateway event failure backup call agent responsibility reconfigure media gateway reports backup call agent gateway may audited determine controlling call agent query may used resolve conflicts case multiple call agents mgcp assumes maintain knowledge device state among failover features take account planned unplanned outages mgcp recognizes three essential elements communication media gateway controller call agent media gateway endpoint connections entities media gateway may host multiple endpoints endpoint able engage multiple connections multiple connections endpoints support calling features call waiting three-way calling mgcp text-based protocol using command response model commands responses encoded messages structured formatted whitespace characters space horizontal tab carriage return linefeed colon full stop messages transmitted using user datagram protocol udp media gateways use port number 2427 call agents use 2727 default message sequence command request response known transaction identified numerical transaction identifier exchanged transaction protocol specification defines nine standard commands distinguished four-letter command verb auep aucx crcx dlcx epcf mdcx ntfy rqnt rsip responses begin three-digit numerical response code identifies outcome result transaction two verbs used call agent query state endpoint associated connections three verbs used call agent manage connection media gateway endpoint one verb used call agent request notification events occurring endpoint apply signals connected pstn network link connected telephony endpoint e.g. telephone one verb used endpoint indicate call agent detected event call agent previously requested notification rqnt command one verb used call agent modify coding characteristics expected line side endpoint one verb used endpoint indicate call agent process restarting another implementation media gateway control protocol architecture h.248/megaco protocol collaboration internet engineering task force rfc 3525 international telecommunication union recommendation h.248.1 protocols follow guidelines overlying media gateway control protocol architecture described rfc 2805 however protocols incompatible due differences protocol syntax underlying connection model | [
7681,
10242,
1030,
8211,
6681,
6682,
10271,
6177,
6689,
9251,
2085,
7208,
7214,
8238,
562,
1586,
9269,
11321,
3133,
5181,
6723,
8265,
4687,
10341,
614,
10344,
3695,
4723,
2679,
4729,
5251,
649,
9868,
3218,
9365,
11413,
152,
3742,
9380,
93... | None |
5,844 | 3 | SSE2:sse2 sse2 streaming simd extensions 2 one intel simd single instruction multiple data processor supplementary instruction sets first introduced intel initial version pentium 4 2000 extends earlier sse instruction set intended fully replace mmx intel extended sse2 create sse3 2004 sse2 added 144 new instructions sse 70 instructions competing chip-maker amd added support sse2 introduction opteron athlon 64 ranges amd64 64-bit cpus 2003 sse2 instructions implement integer vector operations also found mmx instead mmx registers use xmm registers wider allow significant performance improvements specialized applications another advantage replacing mmx sse2 avoiding mode switching penalty issuing x87 instructions present mmx sharing register space x87 fpu sse2 also complements floating-point vector operations sse instruction set adding support double precision data type sse2 extensions include set cache control instructions intended primarily minimize cache pollution processing infinite streams information sophisticated complement numeric format conversion instructions amd implementation sse2 amd64 x86-64 platform includes additional eight registers doubling total number 16 xmm0 xmm15 additional registers visible running 64-bit mode intel adopted additional registers part support x86-64 architecture intel parlance intel 64 2004 fpu x87 instructions provide higher precision calculating intermediate results 80 bits precision default minimise roundoff error numerically unstable algorithms see ieee 754 design rationale references therein however x87 fpu scalar unit whereas sse2 process small vector operands parallel codes designed x87 ported lower precision double precision sse2 floating point certain combinations math operations input datasets result measurable numerical deviation issue reproducible scientific computations e.g calculation results must compared results generated different machine architecture related issue historically language standards compilers inconsistent handling x87 80-bit registers implementing double extended precision variables compared double single precision formats implemented sse2 rounding extended precision intermediate values double precision variables fully defined dependent implementation details registers spilled memory sse2 extends mmx instructions operate xmm registers therefore possible convert existing mmx code sse2 equivalent since sse2 register twice long mmx register loop counters memory access may need changed accommodate however 8 byte loads stores xmm available strictly required although one sse2 instruction operate twice much data mmx instruction performance might increase significantly two major reasons accessing sse2 data memory aligned 16-byte boundary incur significant penalty throughput sse2 instructions older x86 implementations half mmx instructions intel addressed first problem adding instruction sse3 reduce overhead accessing unaligned data improving overall performance misaligned loads last problem widening execution engine core microarchitecture core 2 duo later products since mmx x87 register files alias one another using mmx prevent x87 instructions working desired mmx used programmer must use emms instruction c _mm_empty restore operation x87 register file operating systems x87 used much may still used critical areas like pow extra precision needed cases corrupt floating-point state caused failure emit emms may go undetected millions instructions ultimately causing floating-point routine fail returning nan since problem locally apparent mmx code finding correcting bug time consuming sse2 problem usually provides much better throughput provides registers 64-bit code preferred nearly vectorization work first introduced 2000 sse2 supported software development tools example use sse2 microsoft visual studio project programmer either manually write inline-assembly import object-code external source later visual c++ processor pack added sse2 support visual c++ masm intel c++ compiler automatically generate sse4 ssse3 sse3 sse2 sse code without use hand-coded assembly since gcc 3 gcc automatically generate sse/sse2 scalar code target supports instructions automatic vectorization sse/sse2 added since gcc 4 sun studio compiler suite also generate sse2 instructions compiler flag -xvector=simd used since microsoft visual c++ 2012 compiler option generate sse2 instructions turned default sse2 extension ia-32 architecture based x86 instruction set therefore x86 processors include sse2 amd64 architecture supports ia-32 compatibility mode includes sse2 specification also doubles number xmm registers allowing better performance sse2 also requirement installing windows 8 later microsoft office 2013 later enhance reliability third-party apps drivers running windows 8 following ia-32 cpus support sse2 following ia-32 cpus released sse2 developed implement | [
4108,
5649,
2088,
1085,
7234,
3142,
8795,
5725,
2655,
1119,
1122,
7783,
4204,
1137,
9337,
4217,
1664,
10375,
4237,
6804,
8853,
8855,
9369,
9391,
2237,
5309,
6339,
5326,
9428,
725,
10985,
5356,
9964,
5358,
8944,
3317,
9976,
5883,
5380,
282... | Test |
5,845 | 9 | First-generation_programming_language:first-generation programming language first generation programming language 1gl grouping programming languages machine level languages used program first-generation computers originally translator used compile assemble first-generation language first-generation programming instructions entered front panel switches computer system instructions 1gl made binary numbers represented 1s 0s makes language suitable understanding machine far difficult interpret learn human programmer main advantage programming 1gl code run fast efficiently precisely instructions executed directly central processing unit cpu one main disadvantages programming low level language error occurs code easy fix first generation languages much adapted specific computer cpu code portability therefore significantly reduced comparison higher level languages modern day programmers still occasionally use machine level code especially programming lower level functions system drivers interfaces firmware hardware devices modern tools native-code compilers used produce machine level higher-level language 1 nwankwogu s.e 2016 programming languages history | [
9345,
2691,
9224,
5651,
5527,
9626,
3613,
1952,
4770,
5680,
305,
9780,
1591,
4410,
191,
10819,
8262,
9926,
4042,
477,
7395,
4838,
1776,
9330,
9331,
2556,
7421
] | Test |
5,846 | 9 | Comparison_of_JavaScript_charting_libraries:comparison javascript charting libraries different javascript charting libraries available comparison features available | [
8384,
803,
3462,
7871
] | Test |
5,847 | 4 | OpenStego:openstego openstego open source steganography tools developed samir vaidya released gnu general public license version 2 gplv2 tools detect data hidden openstego | [
7983,
823
] | Test |
5,848 | 7 | Multicloud:multicloud multicloud use multiple cloud computing storage services single heterogeneous architecture also known polynimbus cloud strategy also refers distribution cloud assets software applications etc across several cloud-hosting environments typical multicloud architecture utilizing two public clouds well multiple private clouds multicloud environment aims eliminate reliance single cloud provider differs hybrid cloud refers multiple cloud services rather multiple deployment modes public private legacy also multicloud environment synchronization different vendors essential complete computation process unlike parallel computing distributed computing environments example enterprise may concurrently use separate cloud providers infrastructure iaas software saas services use multiple infrastructure iaas providers latter case may use different infrastructure providers different workloads deploy single workload load balanced across multiple providers active-active deploy single workload one provider backup another active-passive number reasons deploying multicloud architecture including reducing reliance single vendor cost-efficiencies increasing flexibility choice adherence local policies require certain data physically present within area/country geographical distribution processing requests physically closer cloud unit turn reduces latency mitigating disasters similar use best-of-breed applications multiple developers personal computer rather defaults offered operating system vendor recognition fact one provider everything everyone various issues also present multicloud environment security governance complicated moving parts may create resiliency issues selection right cloud products services also present challenge users may suffer paradox choice | [
4194,
3366,
5770,
4429,
467,
8986,
8446
] | Test |
5,849 | 8 | Mod_wsgi:mod wsgi mod_wsgi apache http server module graham dumpleton provides wsgi compliant interface hosting python based web applications apache version 4.5.3 mod_wsgi supports python 2 3 starting 2.6 3.2 alternative mod_python cgi fastcgi solutions python-web integration first available 2007 later versions mod_wsgi may installed one two ways original way apache module commonly used many languages v4 'mod_wsgi express method also supported installed python module using setup.py pip without needing manual intervention apache configuration method simplifies installation python developers familiar python apache also advantages virtualization creates local environment without affecting system settings requiring root access install | [
1802,
10506,
9229,
11154,
1556,
10020,
10026,
7212,
10284,
4658,
2485,
1468,
4797,
8644,
11466,
3920,
5593,
6366,
865,
7784,
8554,
9834,
8689,
9841,
124,
9726
] | Validation |
5,850 | 1 | Event_condition_action:event condition action event condition action eca short-cut referring structure active rules event driven architecture active database systems rule traditionally consisted three parts structure used early research active databases started use term eca current state art eca rule engines use many variations rule structure also features considered early research introduced strategies event selection event part memory-based rule engine condition could tests local data actions could updates object attributes database system condition could simply query database result set null passed action part changes database either case actions could also calls external programs remote procedures note database usage updates database regarded internal events consequence execution action part active rule match event part another active rule thus triggering equivalent memory-based rule engine would invoke external method caused external event trigger another eca rule eca rules also used rule engines use variants rete algorithm rule processing | [
6959
] | Validation |
5,851 | 3 | Aleste:aleste story aleste concerns manmade supercomputer dia 51 infected hybrid virus spreading like wildfire eventually leading dia 51 eliminate human race yuri ray girlfriend gets injured dia assault raymond waizen reason world get rid dia 51 aleste fighter game originally released master system february 1988 version released outside japan power strike us release mail-only limited edition european release normal retail package msx2 version released july year featuring two new stages lowered difficulty series cutscenes version game released phones square enix presumably based msx2 version msx2 version rereleased nintendo wii virtual console service japan along aleste 2 also rereleased now-defunct woomb service aleste followed several sequels also number similar games various aleste entries based example gunhed would inspire super aleste finally known around 1993 various employees left compile joined raizing made similar games | [
6793,
11564,
5677,
9006,
10931
] | Validation |
5,852 | 9 | Robert_Bruce_Findler:robert bruce findler robert bruce findler colloquially known robby american computer scientist currently professor electrical engineering computer science northwestern university also member plt group responsible creation maintenance drracket addition drracket findler contributed numerous components racket supervises web-based software library called planet findler also leading team member programbydesign project findler received phd rice university direction matthias felleisen dissertation linguistics software contracts popularly known design contract work software contracts provides careful accounting blame thereby helping programmers quickly home faulty part software system addition drracket software contracts findler focuses design implementation workbench semantics engineers workbench called redex tool specifying executing reduction semantics programming language used programming language researchers us europe recently sun fortress research team used redex specify explore key parts language findler served semantics editor revised^6 report scheme programming language phd student jacob matthews developed redex model core semantics included appendix report appendix plays role standard ml formal specification milner tofte harper macqueen executable thus visualize individual examples | [
4992,
10752,
11269,
3334,
5751,
6919,
7562,
2062,
9231,
1301,
9749,
9877,
8728,
4633,
6556,
3869,
10012,
2335,
6047,
8226,
4516,
5031,
9128,
5803,
2225,
10547,
11255,
311,
2105,
7867,
6717,
4799,
5569,
6594,
8771,
4550,
8262,
7880,
8908,
... | Test |
5,853 | 3 | Flex_machine:flex machine flex computer system developed michael foster ian currie royal signals radar establishment rsre malvern england late 1970s 1980s used tagged storage scheme implement capability architecture designed safe efficient implementation strongly typed procedures hardware custom microprogrammable operating system modular compiler editor garbage collector filing system written algol 68rs least two incarnations flex implemented using hardware writable microcode first supplied logica rsre design second used icl perq microcode alone responsible storage allocation deallocation garbage collection immediately precluded whole class errors arising misuse deliberate accidental pointers notable feature flex tagged write-once filestore allowed arbitrary code data structures written retrieved transparently without recourse external encodings data could thus passed safely program program similar way remote capabilities allowed data procedures machines accessed network connection without application program involved external encodings data parameters result values whole scheme allowed abstract data types safely implemented data items procedures permitted access could bound together resulting capability passed freely around capability would grant access procedures could used way obtain access data another notable feature flex notion shaky pointers recently often called weak references points blocks memory could freed next garbage collection used example cached disc blocks list spare procedure work-spaces comflex packet switching network capable transmitting data magnetic-disc speed developed alongside flex made feasible use remote file-stores remote capabilities remote procedure calls | [
2304,
9441,
9762,
2179,
5220,
7173,
2951,
1611,
9643,
6675,
7480,
2395,
541
] | None |
5,854 | 3 | Super_Cobra:super cobra super cobra horizontally scrolling shooter developed konami originally released coin-operated arcade game 1981 published konami japan march 1981 manufactured distributed stern north america june 22 1981 sequel 1981 scramble arcade game game commercial success selling 12,337 arcade cabinets united states four months october 2 1981 becoming stern third best-selling arcade classic berzerk scramble scramble sold 15,136 cabinets u.s. five months earlier year adding 27,473 u.s. cabinet sales super cobra widely ported parker brothers adventure vision standalone versions entex player controls helicopter tight caverns slightest misstep result loss life however unlike scramble game continued player left adding credits machine may usually offer option others n't player loses points upon continuing joystick accelerates decelerates moves moves helicopter uses laser bomb destroy defenders tanks ufos infiltrating 10 super cobra defense systems ship limited fuel supply depleted time fuel acquired destroying fuel tanks game game divided ten sections plus finale different style terrain different obstacles players navigate ten levels base must safely make level remove booty levels described follows intermission section game simply scrolls new terrain player destroys booty final level must start back beginning level booty safely carried away player starts back beginning first level cycle repeats second time levels tanks fire much aggressively fuel consumed much faster third subsequent times levels fuel consumed still faster faster rate fuel consumption second subsequent cycles may make difficult complete cycles without losing least one chopper due running fuel although compensated somewhat awarding extra chopper time cycle completed booty carried away game ported atari 2600 atari 5200 colecovision intellivision odyssey² atari 8-bit family parker brothers released also sord m5 msx entex adventure vision entex also made standalone tabletop version game arcade express november 1982 gave adventure vision port score 9 10 concluded takes real skill master represents state-of-the-art scrolling shoot-outs atari 2600 version awarded certificate merit category best action videogame 5th annual arkie awards 1983 compared vanguard said provides brand relentless multi-scenario action super cobra appeared alongside scramble retro compilation konami arcade classics released sony playstation 1999 made available microsoft defunct game room service march 24 2010 | [
1776,
10931,
9006
] | Test |
5,855 | 7 | Andrew_Project:andrew project andrew project distributed computing environment developed carnegie mellon university cmu beginning 1982 ambitious project time resulted unprecedentedly vast accessible university computing infrastructure information technology center partnership carnegie mellon ibm began work andrew project 1982 initial phase project involved software hardware including wiring campus data developing workstations distributed students faculty cmu elsewhere proposed 3m computer workstations included million pixel display megabyte memory running million instructions per second unfortunately cost order us 10,000 made computers beyond reach students budgets initial hardware deployment 1985 established number university-owned clusters public workstations various academic buildings dormitories campus fully wired ready eventual availability inexpensive personal computers early development within information technology center originally called vice vast integrated computing environment virtue virtue reached unix emacs focused centralized tools file server workstation tools including window manager editor email file system client code initially system prototyped sun microsystems machines ibm rt pc series computers running special ibm academic operating system people involved project included james h. morris nathaniel borenstein james gosling david s. h. rosenthal project extended several times 1985 order complete software renamed andrew andrew carnegie andrew mellon founders institutions eventually became carnegie mellon university mostly rewritten result experience early deployments andrew four major software components afs moved information technology center transarc 1988 ams fully decommissioned replaced cyrus imap server 2002 ibm funding ended andrew continued open source project named andrew user interface system auis set tools allows users create distribute documents containing variety formatted embedded objects open-source project run department computer science cmu andrew consortium governs maintains development distribution andrew user interface system andrew user interface system encompasses three primary components andrew user environment aue contains main editor help system user interface tools rendering multimedia embedded objects andrew toolkit atk contains formattable embeddable objects allows method developers design objects atk allows multi-level object embedding objects embedded one another example raster image object embedded spreadsheet object andrew message system ams provides mail bulletin board access allows user send receive organize mail well post read message boards version 6.3 following components auis wireless andrew first campus-wide wireless internet network built 1993 predating wi-fi branding wireless andrew 2-megabit-per-second wireless local area network connected access points wired andrew network high-speed ethernet backbone linking buildings across cmu campus wireless andrew consists 100 access points covering six buildings campus university tested current setup 40 mobile units allowing general use researchers students february 1997 | [
9665,
7337,
7561,
3826,
8179,
7188,
10680,
3323,
4092
] | Validation |
5,856 | 2 | DESQview:desqview desqview dv text mode multitasking operating environment developed quarterdeck office systems enjoyed modest popularity late 1980s early 1990s running top dos allowed users run multiple programs concurrently multiple windows quarterdeck predecessor desqview task switching product called desq shipped late april may 1984 allowed users switch running programs quarterdeck revamped package bringing multitasking adding topview compatibility desqview released july 1985 four months microsoft released first version windows widely thought first program bring multitasking windowing capabilities dos fact predecessor ibm topview shipped march 1985 desqview inherited pop-up menu desqview well-behaved dos programs could run concurrently resizable overlapping windows something first version ms windows could simple hideable menu allowed cutting pasting programs desqview provided support simple editable macros well quarterdeck also developed set optional utilities desqview including notepad dialer later versions allowed graphics mode programs loaded well run full screen mode desqview gui graphical user interface operating system rather non-graphical windowed shell ran real mode top dos although could run intel 8086- intel 80286-based pc could also use expanded memory add-ons work around 640 kb ram limit conventional memory early pcs desqview really came intel 80386 machines better utilizing memory dos limit however either case ran real mode rather protected mode meaning misbehaving program could still crash system make maximum use extended memory intel 80386 processors transforming expanded memory upper memory blocks umbs accessible desqview real-mode programs quarterdeck developed sophisticated memory manager owing foresight marketing manager quarterdeck marketed separate product qemm-386 quarterdeck expanded memory manager 386 became popular desqview sold steadily many years generating us 150 million sales 1987 1994 release intel pentium processor 386 qemm dropped combination package desqview qemm-386 called desqview 386 dv386 introduction 80386 memory management features enhanced allow system shifted protected mode also allowing addresses configured virtual 8086 mode extended memory could mapped addressing frames accessible real-mode programs dos allowed 386 implement lim lotus intel microsoft ems expanded memory specification memory manager easily controlled user dos program qemm.com desqview able use qemm features far beyond lim ems api mapping conventional address space 640 kb multiple extended memory blocks could execute transparently context main copy dos device networking drivers loaded desqview resulting space largest single program could run desqview qemm could run many instances programs ems would allow 8 mb system could generally dozen full-sized dos programs running concurrently 16 mb system could run twenty desqview noteworthy supported common dos-compatible programs achieved degree performance stability remarkable given constraints host operating system also clever interface generally unobtrusive quickly available easy learn normal pcs include keyboard three shift modifier keys control alt normal shift keys keys normally held combination keys desqview default monitored alt key isolated presses combination pressing alt key would bring desqview menu allowing access program features start new tasks switch among mark text screen paste text input current task resize move text windows configure new menu items etc addition shift+alt combination would cause desqview learn set keys macro allowed desqview run programs without interfering keybindings might using desqview critically acclaimed many fans never met mass appeal despite quarterdeck sustained efforts win people one area however desqview lasting success many multiuser bulletin board systems based thanks modest hardware requirements robust multitasking superlative handling multiple communication ports free inexpensive bbs software time ran single-node single-tasking dos program normally one copy bbs software could run limiting host pc running one node desqview allowed multiple copies single-task programs run computer allowing anyone even unimpressive hardware run large powerful multiuser bbs home desqview provide graphical user interface gui quarterdeck provide suites programming libraries utilities support development software use features never became widely popular desqview ability run software modification cost run-time licenses combined costs development suites made unreasonable combination commercial shrink-wrapped software publishers vendors microsoft released ms windows version 3.0 memory management multitasking features desqview far faster smaller stable expensive n't include support graphical features ms windows decline qemm started bundling memory manager digital research dr dos 5.0 released 1990 catch microsoft included emm386 ms-dos 5.0 previously memory management functionality available windows qemm could still used instead notably windows 3.1x provided incremental benefits sales qemm declined august 1994 three quarters losses company laid 25 employees ceo president founder terry myers resigned users moved desqview platforms notably windows 3.x os/2 third party utility authors wrote utility programs emulated desqview api functions allow suitably equipped dos programs co-operate os notable tame windows os/2speed os/2 quarterdeck eventually also released product named desqview/x dvx x window system server running dos desqview thus provided gui x software mostly unix could ported desqview/x three window managers launched x/motif open look twm default package contained twm others costly optional extras ability interact tcp/ip networks mosaic ported dvx dvx could serve dos programs 16-bit windows environment across network x programs made useful wished run dos windows programs unix workstations functionality available ncd wincenter internetworking company novell developed product called netware access server nas incorporating features desqview 386 pcanywhere desqview multitasking support used create environment 16 pc macintosh clients could login remotely access netware services run dos applications desqview development continued parallel desqview/x ceasing development desqview/x another version desqview released qemm still developed discontinuation desqview version compatible windows 98 released mid-1990s quarterdeck tried recast internet company releasing version mosaic web browser eventually company acquired symantec byte 1984 stated desq application compatibility highest five window managers tested magazine 1989 listed version 3.0 among distinction winners byte awards stating unlike os/2 desqview lets run programs 've already paid … many users find desqview need | [
2179,
10757,
6797,
8851,
2201,
2345,
7983,
8241,
178,
2355,
9525,
5823,
6730,
2380,
5080,
4441,
1247,
9569,
8301,
5492,
3323
] | Validation |
5,857 | 0 | Optical_character_recognition:optical character recognition optical character recognition optical character reader ocr mechanical electronic conversion images typed handwritten printed text machine-encoded text whether scanned document photo document scene-photo example text signs billboards landscape photo subtitle text superimposed image example television broadcast widely used form information entry printed paper data records – whether passport documents invoices bank statements computerized receipts business cards mail printouts static-data suitable documentation – common method digitizing printed texts electronically edited searched stored compactly displayed on-line used machine processes cognitive computing machine translation extracted text-to-speech key data text mining ocr field research pattern recognition artificial intelligence computer vision early versions needed trained images character worked one font time advanced systems capable producing high degree recognition accuracy fonts common support variety digital image file format inputs systems capable reproducing formatted output closely approximates original page including images columns non-textual components early optical character recognition may traced technologies involving telegraphy creating reading devices blind 1914 emanuel goldberg developed machine read characters converted standard telegraph code concurrently edmund fournier d'albe developed optophone handheld scanner moved across printed page produced tones corresponded specific letters characters late 1920s 1930s emanuel goldberg developed called statistical machine searching microfilm archives using optical code recognition system 1931 granted usa patent number 1,838,389 invention patent acquired ibm advent smart-phones smartglasses ocr used internet connected mobile device applications extract text captured using device camera devices ocr functionality built operating system typically use ocr api extract text image file captured provided device ocr api returns extracted text along information location detected text original image back device app processing text-to-speech display 1974 ray kurzweil started company kurzweil computer products inc. continued development omni-font ocr could recognize text printed virtually font kurzweil often credited inventing omni-font ocr use companies including compuscan late 1960s 1970s kurzweil decided best application technology would create reading machine blind would allow blind people computer read text loud device required invention two enabling technologiesthe ccd flatbed scanner text-to-speech synthesizer january 13 1976 successful finished product unveiled widely reported news conference headed kurzweil leaders national federation blind 1978 kurzweil computer products began selling commercial version optical character recognition computer program lexisnexis one first customers bought program upload legal paper news documents onto nascent online databases two years later kurzweil sold company xerox interest commercializing paper-to-computer text conversion xerox eventually spun scansoft merged nuance communications research group headed a. g. ramakrishnan medical intelligence language engineering lab indian institute science developed printtobraille tool open source gui front end used ocr convert scanned images printed books braille books 2000s ocr made available online service webocr cloud computing environment mobile applications like real-time translation foreign-language signs smartphone various commercial open source ocr systems available common writing systems including latin cyrillic arabic hebrew indic bengali bangla devanagari tamil chinese japanese korean characters ocr engines developed many kinds domain-specific ocr applications receipt ocr invoice ocr check ocr legal billing document ocr used ocr generally offline process analyses static document handwriting movement analysis used input handwriting recognition instead merely using shapes glyphs words technique able capture motions order segments drawn direction pattern putting pen lifting additional information make end-to-end process accurate technology also known on-line character recognition dynamic character recognition real-time character recognition intelligent character recognition ocr software often pre-processes images improve chances successful recognition techniques include segmentation fixed-pitch fonts accomplished relatively simply aligning image uniform grid based vertical grid lines least often intersect black areas proportional fonts sophisticated techniques needed whitespace letters sometimes greater words vertical lines intersect one character two basic types core ocr algorithm may produce ranked list candidate characters matrix matching involves comparing image stored glyph pixel-by-pixel basis also known pattern matching pattern recognition image correlation relies input glyph correctly isolated rest image stored glyph similar font scale technique works best typewritten text work well new fonts encountered technique early physical photocell-based ocr implemented rather directly feature extraction decomposes glyphs features like lines closed loops line direction line intersections extraction features reduces dimensionality representation makes recognition process computationally efficient features compared abstract vector-like representation character might reduce one glyph prototypes general techniques feature detection computer vision applicable type ocr commonly seen intelligent handwriting recognition indeed modern ocr software nearest neighbour classifiers k-nearest neighbors algorithm used compare image features stored glyph features choose nearest match software cuneiform tesseract use two-pass approach character recognition second pass known adaptive recognition uses letter shapes recognized high confidence first pass recognize better remaining letters second pass advantageous unusual fonts low-quality scans font distorted e.g blurred faded ocr result stored standardized alto format dedicated xml schema maintained united states library congress list optical character recognition software see comparison optical character recognition software ocr accuracy increased output constrained lexicona list words allowed occur document might example words english language technical lexicon specific field technique problematic document contains words lexicon like proper nouns tesseract uses dictionary influence character segmentation step improved accuracy output stream may plain text stream file characters sophisticated ocr systems preserve original layout page produce example annotated pdf includes original image page searchable textual representation near-neighbor analysis make use co-occurrence frequencies correct errors noting certain words often seen together example washington d.c. generally far common english washington doc knowledge grammar language scanned also help determine word likely verb noun example allowing greater accuracy levenshtein distance algorithm also used ocr post-processing optimize results ocr api recent years major ocr technology providers began tweak ocr systems deal efficiently specific types input beyond application-specific lexicon better performance may taking account business rules standard expression rich information contained color images strategy called application-oriented ocr customized ocr applied ocr license plates invoices screenshots id cards driver licenses automobile manufacturing new york times adapted ocr technology proprietary tool entitle document helper enables interactive news team accelerate processing documents need reviewed note enables process amounts many 5,400 pages per hour preparation reporters review contents several techniques solving problem character recognition means improved ocr algorithms special fonts like ocr-a ocr-b micr fonts precisely specified sizing spacing distinctive character shapes allow higher accuracy rate transcription bank check processing ironically however several prominent ocr engines designed capture text popular fonts arial times new roman incapable capturing text fonts specialized much different popularly used fonts google tesseract trained recognize new fonts recognize ocr-a ocr-b micr fonts comb fields pre-printed boxes encourage humans write legiblyone glyph per box often printed dropout color easily removed ocr system palm os used special set glyphs known graffiti similar printed english characters simplified modified easier recognition platform computationally limited hardware users would need learn write special glyphs zone-based ocr restricts image specific part document often referred template ocr crowdsourcing humans perform character recognition quickly process images like computer-driven ocr higher accuracy recognizing images obtained computers practical systems include amazon mechanical turk recaptcha national library finland developed online interface users correct ocred texts standardized alto format crowd sourcing also used perform character recognition directly invite software developers develop image processing algorithms example use rank-order tournaments commissioned u.s. department energy doe information science research institute isri mission foster improvement automated technologies understanding machine printed documents conducted authoritative annual test ocr accuracy 1992 1996 recognition latin-script typewritten text still 100 accurate even clear imaging available one study based recognition 19th- early 20th-century newspaper pages concluded character-by-character ocr accuracy commercial ocr software varied 81 99 total accuracy achieved human review data dictionary authentication areas—including recognition hand printing cursive handwriting printed text scripts especially east asian language characters many strokes single character —are still subject active research mnist database commonly used testing systems ability recognise handwritten digits accuracy rates measured several ways measured greatly affect reported accuracy rate example word context basically lexicon words used correct software finding non-existent words character error rate 1 99 accuracy may result error rate 5 95 accuracy worse measurement based whether whole word recognized incorrect letters example difficulties inherent digitizing old text inability ocr differentiate long f characters web-based ocr systems recognizing hand-printed text fly become well known commercial products recent years see tablet pc history accuracy rates 80 90 neat clean hand-printed characters achieved pen computing software accuracy rate still translates dozens errors per page making technology useful limited applications recognition cursive text active area research recognition rates even lower hand-printed text higher rates recognition general cursive script likely possible without use contextual grammatical information example recognizing entire words dictionary easier trying parse individual characters script reading amount line cheque always written-out number example using smaller dictionary increase recognition rates greatly shapes individual cursive characters simply contain enough information accurately greater 98 recognize handwritten cursive script programs allow users set confidence rates means software achieve desired level accuracy user notified manual review characters support ocr added unicode standard june 1993 release version 1.1 characters mapped fonts specific micr ocr-a ocr-b | [
5122,
519,
2440,
651,
2059,
10508,
6798,
11538,
1044,
10645,
5399,
4632,
538,
7834,
10650,
7069,
10794,
8747,
5550,
7599,
7857,
4531,
8627,
3126,
3127,
2488,
4662,
1083,
4541,
10557,
6975,
6208,
9539,
8389,
5450,
3533,
5197,
6223,
10319,
... | Test |
5,858 | 6 | WinZip:winzip winzip trialware file archiver compressor windows macos ios android developed winzip computing formerly nico mak computing create archives zip file format unpack archive file formats winzip 1.0 released april 1991 graphical user interface gui front-end pkzip earlier january 1991 nico mak computing released gui front-end os/2 presentation manager called pmzip used os/2 versions pkware inc. pkzip pkunzip programs originally released compuserve availability winzip expanded across major online services including genie prodigy online services 1993 winzip announced launch official support customers windows utility forum serving 100,000 members providing updates related information freely downloadable winzip soon found included best-selling windows computing titles part companion disks including all-time best-selling windows 3.0 book windows secrets brian livingston 1994 winzip become official required compression tool used system operators compuserve forum file libraries starting version 5.0 1993 creators winzip incorporated compression code info-zip project thus eliminating need pkzip executable present version 6.0 version 9.0 registered users could download newest versions software enter original registration information install top existing registered version thereby obtain free upgrade upgrade scheme discontinued version 10.0 winzip available standard professional versions however shell windows later versions microsoft windows ability open create .zip files titled compressed folders reduces need extra compression software may 2 2006 corel corporation best known wordperfect coreldraw product lines announced completed acquisition winzip computing vector capital winzip 1.0 mac os x released november 2010 version compatible mac os x 10.6 snow leopard intel-based v10.5 leopard macs winzip mac edition 2 includes support os x 10.8 mountain lion zip file archive format zip originally invented ms-dos 1989 phil katz seeing need archive application graphical user interface nico mak employed mansfield software group inc developed winzip application microsoft windows winzip 1.0 initial version windows winzip 2.0 added support arc files support self-extracting zip files zip2exe optional interface virus scan software dialog box specify paths filenames external programs winzip 3.0 added full support lzh files including self-extracting lzh files configurable support virus scanners simplified options add extract files subdirectory tree winzip 3.1 added support windows 3.1 drag drop interface enhanced extract dialog box common dialog directory drive list test action zip lzh files added file types zip lzh arc new open dialog boxes winzip 3.2 added built-in zip extraction pkunzip needed zip extract operations winzip always uses pkzip.exe modify zip files winzip 4.0 added support pkzip 2.0 including built-in zip extraction support arj file format new toolbar descriptive pictorial buttons added 3-d look dialog boxes winzip 5.0 added pkzip-compatible built-in zipping pkzip needed basic archive management note two advanced features disk-spanning encryption still require pkzip added support windows-based virus scanners added built-in actions/test operation zip files built-in unzipping used running dos virus scanners added support international characters archive names files archives winzip 5.5 added ability install try uninstall software packed zip files winzip 5.6 added compression support popular internet file formats tar gzip unix winzip 6.0 added many windows 95-specific features including tight integration windows 95 shell explorer-style dialog boxes enhancements included improved interface file viewers express setup option better support virus scanners winzip 6.0a features improved windows 95 drag drop support winzip 7.0 introduced microsoft cab cabinet format internet explorer 4.0-style one click open interface zip comments registry-based configuration arj 2.60 long file name support explorer-style fonts winzip self-extractor personal edition creates zip files span multiple removable disks winzip 8.0 wizard interface extended allow users create update zip files wizard ability extract install mime encoded files automatic installation desktop themes screensavers addition explorer context menu opening files within archives inclusion subfolders adding updating archives explorer-style toolbar buttons displaying tooltip zip file selected windows explorer winzip context menus displays small icons correspond toolbar buttons windows 98 windows 2000 ability install desktop themes screensavers contained zip files new 'zip e-mail context menu commands automatic display zip comments context menu help winzip dialogs viewing multiple files one action windows extensions 32-bit explorer shell extensions winzip self-extractor personal edition longer supports creation 16-bit self-extracted archive winzip 8.1 last major release officially support windows 95 included ability extract multiple zip archives explorer configurable explorer context menus creation split zip archives new 'quick pick system tray icon resizable dialog boxes windows 98 higher extraction files split spanned zip archives wizard interface windows xp theme support opening skin files microsoft media player 7 .wmz yahoo player .yfs winamp .wsz displaying file comments 64,000 characters support filenames containing multi-byte character set mbcs characters increasing number entries created 'checkout feature programs menu 500 winzip 9.0 added support aes encryption zip archives bzip2-compressed zip archives extraction also removed previous limitations 65,535 files per zip file maximum file size 4 gigabytes version released 2004 winzip 10 added support creating extracting ppmd-compressed zip archives last major release officially support windows 98/me winzip pro added release added automation task scheduling features version released 2005 winzip 11 added support creating extracting wavpack-compressed zip archives installer still installed windows 98/me operating systems longer officially supported winzip pro added passive ftp support ftp transfers e-mail notification option job wizard custom jobs selection full-size image viewer opening archive version released 2006 winzip 11.1 certified windows vista vista theme support 64-bit windows support winzip 11.2 could create lha archives without external utility unicode file name support zip archives also added support external archivers arc arj removed winzip 12.0 2008 added support creating zip archives lossless jpeg lzma compression methods .iso .img 7-zip archive extractions added encryption policies integrated image thumbnail viewer jpeg compression compresses metadata lzma compression image compressed binary arithmetic coding winzip 12.1 2009 introduces new default .zipx file extension creating zip archives using methods newer deflate64 added automatic resizing images sent using zip e-mail functions winzip 13 skipped winzip 14 2009 added windows 7 support library grouping taskbar icon jump lists explorer preview multi-touch two finger gestures winzip 14 backup edition added supports automatic backup feature aes new instructions used supported speed aes encryption winzip 14.5 april 2010 added microsoft office 2010-style ribbon interface support windows 7 libraries jump lists multi-touch gestures interface functionality improvements winzip 15 november 2010 december 1 2010 implemented new performance architecture high-speed zipping interface improvements refined menu designs intuitive icons new desktop zip/unzip gadget drag-and-drop functionality new extensive email/webmail support backup function pro version due bug first release version creating backup jobs *.wjf job file selection needs reset/set working properly winzip 15.5 april 2011 new compression algorithms designed multi-processor systems zip files twice fast new winzip desktop gadget option called 'folder choose allows create select target folder zipping/unzipping files case-by-case basis dynamic context-sensitive icons automatically change reflect winzip tasks available specific situation streamlined processes remove unnecessary dialogs cut extra steps ability show/hide address bar ability instantly jump instances winzip currently open ability customize look feel winzip interface interchangeable themes improved destination folder management open/alter zipped file contents directly email attachment winzip prompt save work new location computer rather email temp folder streamlined 'unzip try processes remove extra steps making temporary viewing even quicker easier extended enterprise support provides control addition/alteration e-mail services winzip 16.0 released october 25 2011 implemented new 64-bit zip engine added 64-bit version winzip added ability zip write files blu-ray discs added integration zipsend zipshare services improved capabilities file conversion supported formats zip enhanced preview tools browsing editing contents compressed file types added system scanner diagnostic tool scans possible performance issues zipsend zipsend pro send message 50mb 2gb zipped data per message zipshare post files 20 mb data directly facebook free 100mb total data per account winzip 16.5 supports opencl acceleration file compression engine amd fusion processors amd radeon users streamlined interface winzip 17.0 released october 16 2012 introduced online sharing storage social media sites image resizing converting files pdf watermark addition context-sensitive toolbars winzip 17.5 released may 9 2013 new features include sharing features permission controls updated modernized user interface watermark timestamping four times faster .zip archive extraction maximum 23gb free cloud storage via box dropbox google drive skydrive cloudme new winzip 18.0 released october 31 2013 new features include support xz lzma2 compression additional features winzip express cloud backup winzip 18.5 released may 12 2014 includes support zipshare send zip files instant messaging facebook google talk/google+ hangouts yahoo messenger jabber cloud sharing includes mediafire integration winzip 19 released october 28 2014 includes unified local network cloud file management modern ui touch support adds enterprise edition corporate government use added fips 140-2 encryption enterprise edition also open extract vhd files winzip 19.5 released may 7 2015 adds smartshare share via clipboard cloud links view thumbnails auto-hide scroll bars slide-in action pane enterprise adds vmware file support vhd files ntfs compression winzip 20.0 released october 20 2015 new features include extract vhd vmdk virtual disks expanded sharing youtube instant message support scan share snap share improved file management winzip 21.0 released october 25 2016 new features include 16 accounts per cloud service domain access enhanced mp3 compression preview pane image information combined address book dis-aggregation individual zip file creation send inline conversion winzip 1.0 mac os x november 16 2010 initial release compatible intel macs run v10.5 'leopard winzip mac edition 2 released june 26 2012 new features include os x 10.8 mountain lion support finder integration in-place editing ios version first released february 17 2012 free english app designed ios 4.2 iphone ipad ipod touch available apple app store version 1.1.1 may 4 2012 includes following winzip android first released june 19 2012 free english app designed android operating system versions 2.1 eclair 2.2 froyo 2.3 gingerbread 3.x honeycomb 4.x ice cream sandwich higher initially available google play new version 1.1.0 winzip e-mail companion version 2.0 supports microsoft outlook 2002 2003 2007 windows mail 6.0 outlook express 6.0 optionally supports microsoft word microsoft powerpoint microsoft excel versions 2007 2003 2002 unlisted support outlook 2010 works 32-bit versions outlook 2010 winzip system utilities released february 14 2011 includes winzip driver updater 1.0 winzip registry optimizer 2.0 | [
3586,
6022,
10121,
1420,
1299,
1940,
3222,
9880,
3114,
10027,
3629,
7983,
950,
6713,
2755,
11076,
9541,
1352,
4296,
10317,
9166,
10575,
4561,
722,
10839,
8413,
5726,
1631,
3296,
9953,
11614,
6759,
9063,
5225,
7529,
4331,
4459,
237,
1646,
... | None |
5,859 | 3 | Socket_FM1:socket fm1 socket fm1 cpu socket desktop computers used llano processors llano-derived athlon ii processors released july 2011 direct successors socket fm2 september 2012 socket fm2+ january 2014 socket am1 january 2014 targeting low-power socs available chipsets consult fusion controller hubs fch apu using socket fm1 amd platform please consult list amd accelerated processing units concrete product denominations | [
3586,
9475,
3588,
8452,
9092,
10375,
3464,
4872,
5645,
398,
7058,
10260,
4246,
2719,
2463,
4767,
2850,
7712,
9122,
1322,
2094,
11183,
1329,
6705,
3892,
8629,
9400,
6978,
11331,
9157,
3783,
11080,
2764,
7247,
9551,
7122,
9427,
10715,
7132,
... | Test |
5,860 | 4 | Novell_BorderManager:novell bordermanager bordermanager multi purpose network security application developed novell inc. bordermanager designed proxy server firewall vpn access point novell announced migration superlumin 4.0 proxy cache novell preferred firewall proxy solution netware customers upgrading novell open enterprise server linux bordermanager designed run top netware kernel takes advantage fast file services netware kernel delivers aside easily copied firewall vpn access point services novell designed proxy services retrieve web data server server connection rather client server connection prior proxy servers market done retrieval method along netware fast file io proprietary code made bordermanager proxy engine one fastest existence 2003 novell announced successor product netware open enterprise server oes first released march 2005 oes completes separation services traditionally associated netware i.e file print makes possible customer choose netware linux kernel services run time novell announced end development netware kernel numerous public private statements 64-bit future netware linux path 64-bit computing oes follow migration path novell began porting applications linux company began looking alternate ways deliver services firewall vpn access point services equivalent functionality readily available free/open-source community also basic proxy services well i.e squid desire deliver functional equivalent could done full software code port much cache engine sold part volera excelerator novell holds great desire use create open-source software basic services novell entered agreement astaro relabel astaro security gateway license novell security manager product removed novell price list 15 february 2007 late summer 2006 novell announced would bordermanager 3.9 release novell brainshare conference 2010 novell announced superlumin 4.0 proxy cache path forward bordermanager customers also announced extended bordermanager general support two years march 7 2012 give customers adequate time make move november 2011 novell support lifecycle page states border manager 3.9 general support extended september 30 2013 make easy customers plan execute upgrade novell open enterprise server upgrade path border manager remains superlumin nemesis third-party filtering solutions available novell bordermanager following companies | [
1792,
2049,
4480,
2563,
6797,
1172,
9496,
3482,
1436,
4511,
6431,
10531,
5924,
550,
8998,
10790,
939,
1708,
3243,
3885,
8753,
10804,
823,
569,
5178,
11577,
9279,
5057,
1858,
10433,
11073,
11513,
2118,
4814,
3791,
9423,
7121,
10574,
10451,
... | Test |
5,861 | 3 | Xputer:xputer xputer design reconfigurable computer proposed computer scientist reiner hartenstein hartenstein uses various terms describe various innovations design including config-ware flow-ware morph-ware anti-machine xputer represents move away traditional von neumann computer architecture coarse-grained soft arithmetic logic unit alu architecture parallelism achieved configurable elements known reconfigurable datapath arrays rdpa organized two-dimensional array alu similar kressarray xputer architecture data-stream-based counterpart instruction-based von neumann computer architecture xputer architecture one first coarse-grained reconfigurable architectures consists reconfigurable datapath array rdpa organized two-dimensional array alus rdpu bus-width alu 32-bit first version xputer alus also known rdpus used computing single mathematical operation addition subtraction multiplication also used purely routing alus mesh-connected via three types connections data-flow along connections managed address generation unit programs xputer written c language compiled usage xputer using codex compiler written author codex compiler maps suitable portions c program onto xputer rdpa fabric remainder program executed host system personal computer reconfigurable datapath array rdpa semiconductor device containing reconfigurable data path units programmable interconnects first proposed rainer kress 1993 university kaiserslautern instead fpgas field-programmable gate arrays single bit configurable logic blocks clbs rdpas multiple bits wide instance 32 bit path width reconfigurable datapath units rdpus rdpu configured perform individual function rdpus interconnects programmed manufacturing process customer/designer hence term reconfigurable rdpa perform whatever complex computation needed rdpus multiple bits wide instance 32 bits talk coarse-grained reconfigurability contrast fpgas single-bit wide configurable logic blocks called fine-gained reconfigurable rdpas structurally programmed config-ware source code compiled pipe-networks mapped onto rdpa rdpas instruction-stream-driven instruction fetch run time rdpus program counter | [
4773,
6950,
11333,
5355,
3886,
2224,
4465,
3762,
11125,
8508,
3159,
9371,
6716,
2045,
11487
] | Train |
5,862 | 3 | WDC_65C02:wdc 65c02 western design center wdc 65c02 microprocessor enhanced cmos version popular nmos-based 8-bit mos technology 6502 65c02 fixed several problems original 6502 added small number new commands however main feature greatly lowered power usage order 10 times less 6502 running speed made useful portable computer roles microcontroller systems industrial settings used home computers well embedded applications including medical-grade implanted devices development began 1981 known 65802 first sample versions released early 1983 wdc licenced design synertek ncr gte rockwell semiconductor rockwell primary interest embedded market asked several new commands added aid role later copied back baseline version point wdc added two new commands create w65c02 sanyo later licenced design well seiko epson produced modified version huc6280 early versions used 40-pin dip packaging available 1 2 4 mhz versions later versions produced plcc qfp increasing speed well latest version wdc w65c02s-14 runs speeds 14 mhz 65c02 low cost general-purpose 8-bit microprocessor 8-bit registers data bus 16-bit program counter address bus register set small single 8-bit accumulator two 8-bit index registers x 8-bit status register p 16-bit program counter pc addition single accumulator first 256 bytes ram zero page 0000 00ff allow faster access dedicated addressing mode requires single byte address instead two stack lies next 256 bytes page one 0100 01ff moved extended stack grows downwards stack pointer starting 01ff decrementing stack grows variable-length instruction set varying one three bytes per instruction basic architecture 65c02 identical original 6502 considered low-power implementation design 1 mhz popular speed original 6502 65c02 requires 20 mw original uses 450 mw reduction twenty times manually optimized core low power use intended make 65c02 well suited low power system-on-chip soc designs verilog hardware description model available designing w65c02s core application-specific integrated circuit asic field-programmable gate array fpga common semiconductor industry wdc offers development system includes developer board in-circuit emulator ice software development system w65c02s–14 production version available pdip plcc qfp packages maximum officially supported ϕ2 primary clock speed 14 mhz indicated –14 part number suffix designation indicates part fully static core feature allows ϕ2 slowed fully stopped either high low state loss data typical microprocessors implemented cmos dynamic cores lose internal register contents thus crash continuously clocked rate minimum maximum specified values w65c02s may operated convenient supply voltage v 1.8 5 volts ±5 data sheet ac characteristics table lists operational characteristics 5 v 14 mhz 3.3 v 3 v 8 mhz 2.5 v 4 mhz 1.8 v 2 mhz information may artifact earlier data sheet graph indicates typical devices capable operation higher speeds suggested ac characteristics table reliable operation 20 mhz readily attainable v 5 volts assuming supporting hardware allow w65c02s may also operated non-integral clock rates 13.5 mhz digital sdtv luma sampling rate 14.31818 mhz ntsc colour carrier frequency × 4 14.75 mhz pal square pixels 14.7456 baud rate crystal etc. long v sufficient support frequency designer bill mensch pointed f affected off-chip factors capacitive load microprocessor pins minimizing load using short signal tracks fewest devices helps raise f. plcc qfp packages less pin-to-pin capacitance pdip package economical use printed circuit board space wdc reported fpga realizations w65c02s successfully operated 200 mhz although 65c02 mostly thought low-power 6502 also fixes several bugs found original adds new opcodes help increase code density estimated average 6502 assembly program made 10 15 smaller 65c02 see similar improvement performance avoided memory accesses original 6502 56 instructions combined different addressing modes produced total 151 opcodes possible 256 8-bit patterns remaining 105 unused opcodes undefined set codes low-order 4-bits 3 7 b f left entirely unused 2 single opcode 6502 famous way leftover codes actually performed actions due way 6502 instruction decoder worked simply setting certain bits opcode would cause parts instruction processing take place opcodes would immediately crash processor performed useful functions even given unofficial assembler mnemonics users 65c02 added number new opcodes used number previously undocumented instruction slots instance ff used new codice_5 instruction see remained truly unused set perform codice_6s programs took advantage codes work 65c02 codes always documented non-operational used original 6502 several bugs initially launched among notorious codice_7 rotate right broken due problem chip mos addressed documenting instruction bug fixed early production run generally issue vast majority machines using processor contrast another bug remained design lifetime involved commonly-used jump command codice_8 using indirect addressing mode address jmp looked another memory location instance codice_9 would fetch value bytes 1234 1235 use 16 bits actual memory location jump however initial address ended ff boundary memory page jmp took significant byte 16-bit address 00 original page rather 00 new page instance codice_10 would get first byte 12ff second incorrectly 1200 rather 1300 fixed 65c02 another bug original 6502 concerned behaviour ecimal flag status register left undefined reset interrupt meant programmers forced set flag known value one finds codice_11 instruction clear decimal following initial codice_12 almost interrupt handlers 65c02 automatically set reset flag correctly pushing status register onto stack related problem occurred operating decimal mode n egative v erflow z ero flags updated properly ways address code cost additional instructions 65c02 addresses problem sets flags correctly cost single clock cycle 6502 included variation indirect addressing mode based x index registers instruction used mode processor took initial zero page address added x register returned value resulting location unfortunately way load data zero page one wanted access single byte known location page code first codice_13 codice_14 65c02 added new mode codice_15 removing need ldy 6502 also included mode known preindexing offset address value x register fetched data address pointed 16-bit data instance x register holds value 4 codice_16 would add value x absolute addresses 12 pick two bytes 16 17 value two bytes 1234 fetches 8-bit value memory location 1234 basic idea allow set series unrelated locations memory access changing x register useful could used zero page data intermediate address 65c02 extended new postindexed version officially known indexed absolute indirect available register mode fetched address zero page added value retrieving 16-bits zero page instance codice_17 would first look address 12/ 13 retrieve instance 1230 add loading accumulator value 1234 new mode extremely useful implementing jump tables set subroutines previously locations would zero page list could placed anywhere main memory starting location list placed zero page program codice_18 call routine number 10 sort access pattern extremely common notably widely used basic programming language found many 6502 systems sort access possible original preindexing version cost entire table zero page limited resource new mode particularly useful routines rom addition new addressing modes base model 65c02 also added set new instructions initial design 65c02 modified rockwell interested 6502 basis embedded processors roles common device drivers communicate cpu encoding status bits single byte fashion similar cpu status register makes various bit manipulation instructions common embedded applications normally one tests bits codice_44ing desired pattern memory location holding data branching based status register z ero flag instance address 1234 status register device bit 3 held ready status one could implement continue ready codice_45 hex 08 third bit bit set equal branch routine 2345 sort test common original 6502 included special-purpose codice_46 instruction automating bit change accumulator unlike anding tested bits 6 7 time placing results n egative v erflow flags long device drivers used bits 6 7 commonly tested flags using bit could reduce number tests needed 65c02 improved bit command adding new addressing modes including ability test constant accumulator instead pattern initially stored memory however rockwell changes went far beyond changes bit adding host commands directly setting testing bit combining test clear branch single opcode new instructions available start rockwell r65c00 family part original 65c02 specification found versions made wdc licensees later copied back baseline design available later wdc versions denoted leading w w65c02 new instructions include addition new commands wdc also added codice_4 codice_3 instructions supporting low-power modes stp stop processor halted processing hardware reset issued could used put system sleep rapidly wake reset however required external system maintain memory widely used wait similar effect entering low-power mode time woke reception interrupt embedded uses meant device driver poll changes instead simply issued wai jumped interrupt processing started added advantage always entering low-power mode instructions completed handler always started one cycle instead wait currently processing instructions complete first 65sc02 variant wdc 65c02 without bit instructions | [
11395,
1029,
3722,
8715,
9739,
10767,
664,
5529,
7323,
8352,
4385,
10784,
10786,
6821,
7589,
3630,
3886,
5040,
11054,
9911,
2874,
5823,
8767,
3010,
5457,
3157,
6485,
10969,
10351,
1776,
4465,
5617,
7281,
372,
7282,
7284,
11125
] | None |
5,863 | 5 | Token_bus_network:token bus network token bus network implementing token ring protocol virtual ring coaxial cable token passed around network nodes node possessing token may transmit node n't anything send token passed next node virtual ring node must know address neighbour ring special protocol needed notify nodes connections disconnections ring due difficulties handling device failures adding new stations network token ring gained reputation unreliable difficult upgrade bus networks ethernet flexible reliable physical architecture ethernet access protocol could absolutely guarantee maximum time station would wait access network thought unsuitable manufacturing automation applications token bus protocol created combine benefits physical bus network deterministic access protocol token ring network token bus standardized ieee standard 802.4 mainly used industrial applications token bus used general motors manufacturing automation protocol map standardization effort application concepts used token ring networks main difference endpoints bus meet form physical ring order guarantee packet delay transmission token bus protocol modified token bus proposed manufacturing automation systems flexible manufacturing system fms means carrying internet protocol ieee 802 networks including token bus networks developed ieee 802.4 working group disbanded standard withdrawn ieee | [
10112,
2306,
388,
7045,
8708,
3847,
7049,
5270,
11288,
2458,
5020,
5671,
1192,
11560,
6187,
4396,
7723,
11181,
434,
3762,
11321,
5439,
7490,
3780,
9284,
5321,
7498,
2904,
10332,
2911,
5472,
2785,
5092,
4581,
2802,
11125,
6904,
8828,
3838
] | Test |
5,864 | 2 | Open_Transport:open transport open transport name given apple inc. implementation unix-originated system v streams networking stack based code licensed mentat portable streams product open transport built provide classic mac os modern tcp/ip implementation replacing mactcp apple also added implementation appletalk stack support legacy networks prior release open transport classic mac os used variety stand-alone inits provide networking functionality one widely used throughout os appletalk system among protocol stacks supported mactcp becoming increasingly important internet boom started gain momentum mactcp emulated berkeley sockets system widely used among unix-like operating systems mactcp previous generation appletalk library slow powerpc-based macintoshes written previous generation 680x0-based macintoshes therefore ran emulation powerpc-based machines mactcp also lacking features however major upgrade clearly needed apple keep hand internet market late 1980s several major efforts re-combine many unix derivatives single system underway significant among t-led system v. system v included entirely new networking stack streams replacing existing berkeley sockets system streams number advantages sockets including ability support multiple networking stacks time ability plug modules middle existing stacks provide simple mechanisms filtering similar duties offering single application programming interface user programs time appeared streams would become de facto standard change market led apple move support streams well also presented two practical advantages company streams multiprotocol support would allow support tcp/ip appletalk single interface portable cross-platform version streams available purchase commercially one included high-quality tcp implementation using streams also appeared offer way one microsoft whose tcp/ip networking system winsock based apparently soon-to-be-obsolete sockets open transport introduced may 1995 power mac 9500 included system 7.5.2 release new pci based power macs became available older hardware later mactcp supported pci-based macs older systems could switch mactcp open transport using control panel called network software selector unlike mactcp open transport allowed users save switch configuration sets developer opinion open transport divided felt offered enormous speed improvements mactcp developers also liked flexible way allowed protocols stacked apply filters duties however system also large complex flexibility open transport architecture one could plug desired protocol felt thoroughly overcomplicated additionally unix code still used sockets streams mactcp offered real advantages terms porting software mac vaunted flexibility open transport architecture undermined ultimately made obsolete rapid rise tcp/ip networking mid-90s true wider unix market system v undermined rapid rise free unix-like systems notably linux systems grew popularity vast majority programmers ignored closed streams favour bsd-licensed sockets open transport abandoned move os x derived bsd networking stack based entirely sockets open transport received deprecation status starting mac os x 10.4 sdks open transport support removed entirely os x starting version 10.9 mavericks | [
576,
5601,
6377,
4333,
942,
2995,
5492,
5397,
823,
5976,
4345,
3167
] | Test |
5,865 | 4 | National_Information_Assurance_Partnership:national information assurance partnership national information assurance partnership niap united states government initiative meet security testing needs information technology consumers producers operated national security agency nsa originally joint effort nsa national institute standards technology nist long-term goal niap help increase level trust consumers information systems networks use cost-effective security testing evaluation validation programs meeting goal niap seeks principal objective niap validation body ensure provision competent security evaluation validation services government industry validation body ultimate responsibility operation ccevs accordance policies procedures appropriate interpret amend policies procedures nsa responsible providing sufficient resources validation body may carry responsibilities validation body led director deputy director selected nsa management director validation body reports niap director administrative budgetary matters nsa certificate-issuing authorities ccevs related operational matters general director deputy director serve two-year term service term service may extended discretion nsa management also significant number technical administrative support personnel required provide full range validation services sponsors evaluations common criteria testing laboratories cctl personnel include validators technical experts various technology cells senior members technical staff security community oversight board validation body ensures appropriate mechanisms place protect interests parties within ccevs participating process security evaluation dispute brought forth participating party i.e. sponsor evaluation product protection profile developer cctl concerning operation ccevs associated activities shall referred validation body resolution disputes involving validation body nsa management attempt resolve dispute procedures agreed upon two organizations | [
6593,
8904,
2761,
7887,
4253,
4798
] | Test |
5,866 | 4 | DB_Networks:db networks db networks privately held information security company founded united states company provides enterprise database security equipment software service company ’ headquarters san diego california regional offices located palo alto california seattle washington db networks founded united states 2009 provide database security including database infrastructure assessment compromised credential identification sql injection defense predominantly financial services industry federal government company initially financed angel investors 2012 company raised 4.5m venture capital khosla ventures 2014 company closed 17 million round funding led khosla ventures grotech ventures company first product adf-4200 launched february 2013 also february 2013 company announced partnership alamo city engineering services aces offer products us military civilian federal agencies october 2013 company announced ids-6300 later renamed dbn-6300 originally sql injection defense database infrastructure security product 2013 db networks invited join cync cybersecurity technology program direction northrop grumman university maryland baltimore county research park corporation cync program identifies innovative technologies combat cybersecurity threats 2014 amp tech solutions announced channel partner offer db network products nasa solutions enterprise-wide procurement sewp iv contract united states federal agencies 2015 db networks awarded two united states patents database security technologies db networks began licensing database security software technologies original equipment manufacturers oems february 2016 coinciding launch layer 7 database sensor partnerships announced fireeye cyphort security on-demand db networks database security technology based machine learning behavioral analysis opposed traditional information security approach requiring human generated blacklists whitelists machine learning behavioral analysis platform learns applications proper sql transaction behavior compromised credentials rogue sql statements sql injection attack deviate established model raise alarm database attack machine learning behavioral analysis technologies ability prevent advanced zero-day database attacks without prior threat intelligence need establish maintain signature files known attack strings db networks dbn-6300 announced october 2013 originally referred ids-6300 dbn-6300 2u purpose-built database security appliance uses machine learning behavioral analysis identify database attacks real-time virtual appliance version dbn-6300 launched february 2014 referred dbn-6300v layer 7 database sensor launched february 2016 layer 7 database sensor enables information security product manufactures integrate db networks database security technology products march 2016 insider threat protection capabilities added dbn-6300 layer 7 database sensor products 2016 2015 2014 2013 | [
1314,
899,
9286,
3944,
10413,
9688,
5563,
5373,
5407
] | None |
5,867 | 5 | X_video_extension:x video extension x video extension often abbreviated xvideo xv video output mechanism x window system protocol designed david carver specification version 2 protocol written july 1991 mainly used today resize video content video controller hardware order enlarge given video watch full screen mode without xvideo x would scaling main cpu requires considerable amount processing power could slow degrade video stream video controllers specifically designed kind computation much cheaply similarly x video extension video controller perform color space conversions change contrast brightness hue displayed video stream order work three things come together modern video controllers provide functions required xvideo feature known hardware scaling yuv acceleration sometimes 2d hardware acceleration xfree86 x display server implemented xvideo since version 4.0.2 check whether given x display server supports xvideo one use utility xdpyinfo check whether video controller provides required functions whether x device driver implements xvideo one use xvinfo program video playback programs run x window system mplayer mythtv xine typically option enable xvideo output advisable switch option system gpu video-hardware device drivers supports xvideo modern rendering systems opengl vdpau unavailable – speedup noticeable even fast cpu protocol features reading writing video streams video adapters practice today functions xvputimage xvshmputimage used client program repeatedly prepares images passes graphics hardware scaled converted displayed video scaled prepared display video card must displayed possible ways display accelerated video stage since full acceleration means video controller responsible scaling converting drawing video technique used depends entirely video drawn onto x video finally drawn depends largely x window manager use properly installed drivers gpu hardware supported intel ati nvidia chip sets window managers called compositing window managers allow windows separately processed rendered composited involves windows rendered separate output buffers memory first later combined form complete graphical interface video memory individual windows transformed separately accelerated video may added stage using texture filter window composited drawn xvideo also used accelerate video playback drawing windows using opengl framebuffer object pbuffer metacity x window manager uses compositing way compositing also make use 3d pipelines accelerations glx_ext_texture_from_pixmap among things process allows many video outputs share screen without interfering compositing window managers compiz also use compositing however system limited opengl acceleration function specifically lack opengl framebuffer object pbuffer use opengl environment like xgl makes xv hardware accelerations impossible event window manager n't directly support compositing difficult isolate video stream rendered time accelerated output already turned single image way usually employ post processed hardware overlay using chroma keying windows already drawn pieces information available size position video window canvas third piece information required indicate parts video window canvas obscured windows therefore video player draws canvas using solid color 'll say green color becomes makeshift third dimension windows drawn windows covering video player block green color video stream added output graphics card simply scan co-ordinates canvas encounters green knows found visible portion video window draws portions video process also available option render hardware accelerated video microsoft windows xp earlier since window management features deeply embedded operating system accelerating would impossible window manager n't support compositing post processed hardware overlays using chroma keying described previous paragraph make impossible produce proper screenshots xvideo applications also make impossible view kind playback secondary display one overlay allowed hardware level | [
10658,
9223,
8682,
1644,
429,
7309,
1776,
3764,
2581,
8438,
11485,
9567
] | Test |
5,868 | 4 | Proof_of_Age_Standards_Scheme:proof age standards scheme pass proof age standards scheme government-backed scheme uk gives young people valid accepted form proof age identification scheme supported home office chartered trading standards institute ctsi national police chiefs ’ council npcc acts umbrella system issue identification cards various proof age card schemes operate pass umbrella issue cards bear pass hologram proof authenticity validity set 2001 develop recognisable way endorsing proof age card schemes due united kingdom issuing government identification card individuals ‘ drive difficulty providing proof age purchasing age-restricted products cigarettes alcohol june 2014 18+ card designs standardised apart young scot card scotland real variation appearance logo issuing organisation corner citing feedback police retailers effort increase acceptance venues especially night-time economy november 2016 pass reorganised become community interest company ownership british retail consortium ended january 2018 national police chiefs ’ council npcc logo replaced association chief police officers acpo logo lower left corner standardised 18+ card design two types card suppliers national regional regional cards often requirements residency area issued national cards obtained anyone provide required information currently three councils offer regional cards bracknell forest council e+ card milton keynes council 1 card london borough southwark pal national suppliers citizencard id card oneid4u validateuk young scot card available eligible individuals resident scotland proof age standards scheme goal become preferred standard proving age britons 5 million cards issued since 2001 200,000 2017 2018 several trade bodies currently support pass association convenience stores british beer pub association british institute innkeeping uk hospitality wine spirits trade association addition home office chartered trading standards institute national police chiefs council security industry authority also support organisation responsibility sellers supply alcohol tobacco age restricted products people legal age checking proof age card protects inadvertently selling under-age people look older places requiring proof age accept cards despite pass hologram retailers licensees right refuse sell product deny entry individual even possess pass endorsed card 2011 500,000 holders pass endorsed card refused entry pubs clubs result 2014 police security industry authority licences doorstaff agreed permit logos displayed pass cards displaying standardised design 2017 passport office urged passport-holders leave passports home use pass card nights 2019 pass agreed develop standards presentation digital proof age purpose enabling home office amend mandatory licensing conditions approved forms digital physical proof age could accepted licensees purpose demonstrating due diligence | [
8270,
9199
] | None |
5,869 | 9 | Prince_(software):prince software prince formerly prince xml proprietary software program converts xml html documents pdf files applying cascading style sheets css technology electronic publishing dynamic data-driven pdf generation enables replacing xsl-fo frameworks css3 ones developed yeslogic small company based melbourne australia marketed professional xml+css3 pdf solution received positive reviews considered unique product 2000s april 2003 prince 1.0 released basic support xhtml cascading style sheets css scalable vector graphics svg arbitrary xml first version command-line program supported microsoft windows linux graphical user interface windows yet subsequent releases css support steadily extended comparable web browsers opera mozilla firefox also expanded support additional platforms—the latest offering include packages apple mac freebsd solaris platforms december 2005 prince 5.1 passed acid2 test web standards project third user agent pass test safari konqueror prince developed using mercury functional logic programming language main driving force behind prince standard css3-paged integrates paged media including pdf layout specification w3c technologies html4 html5 xhtml free xml working javascript sources | [
3462,
8584,
1083,
4855,
6539,
6797,
7983,
5907,
3828,
8627,
823,
2139,
8413,
8923,
479
] | Test |
5,870 | 4 | ITHC:ithc ithc health check security assessment required part accreditation process many government computer systems uk ithc generally performed external service provider although ncsc personnel may perform ithcs especially sensitive systems touch applications infrastructure involves element penetration testing check scheme ithc providers run ncsc | [
11172,
4595,
7228
] | None |
5,871 | 3 | List_of_Intel_CPU_microarchitectures:list intel cpu microarchitectures following partial list intel cpu microarchitectures list incomplete additional details found intel tick-tock model process-architecture-optimization model | [
3459,
5380,
3973,
8325,
9095,
5386,
9611,
4108,
9741,
398,
6926,
5649,
7313,
5523,
6804,
8851,
4886,
9111,
3352,
1820,
9500,
6815,
2088,
10669,
9391,
10675,
4276,
1461,
8501,
10548,
2237,
5309,
6339,
5444,
9541,
1998,
2638,
5073,
7134,
11... | Validation |
5,872 | 9 | Java_virtual_machine:java virtual machine java virtual machine jvm virtual machine enables computer run java programs well programs written languages also compiled java bytecode jvm detailed specification formally describes required jvm implementation specification ensures interoperability java programs across different implementations program authors using java development kit jdk need worry idiosyncrasies underlying hardware platform jvm reference implementation developed openjdk project open source code includes jit compiler called hotspot commercially supported java releases available oracle corporation based openjdk runtime eclipse openj9 another open source jvm openjdk java virtual machine abstract virtual computer defined specification garbage-collection algorithm used internal optimization java virtual machine instructions translation machine code specified main reason omission unnecessarily constrain implementers java application run inside concrete implementation abstract specification java virtual machine starting java platform standard edition j2se 5.0 changes jvm specification developed java community process jsr 924. changes specification support changes proposed class file format jsr 202 done maintenance release jsr 924 specification jvm published blue book preface states one oracle jvms named hotspot inherited bea systems jrockit clean-room java implementations include kaffe openj9 skelmir cee-j oracle owns java trademark may allow use certify implementation suites fully compatible oracle specification one organizational units jvm byte code class class loader implementation must able recognize load anything conforms java class file format implementation free recognize binary forms besides class files must recognize class files class loader performs three basic activities strict order general two types class loader bootstrap class loader user defined class loader every java virtual machine implementation must bootstrap class loader capable loading trusted classes java virtual machine specification n't specify class loader locate classes jvm operates primitive values integers floating-point numbers references jvm fundamentally 32-bit machine codice_1 codice_2 types 64-bits supported natively consume two units storage frame local variables operand stack since unit 32 bits codice_3 codice_4 codice_5 codice_6 types sign-extended except codice_6 zero-extended operated 32-bit integers codice_8 types smaller types type-specific instructions loading storing type conversion codice_3 operated 8-bit codice_4 values 0 representing codice_11 1 representing codice_12 although codice_3 treated type since java virtual machine specification second edition clarified issue compiled executed code little difference codice_3 codice_4 except name mangling method signatures type boolean arrays codice_3s method signatures mangled codice_17 codice_4s mangled codice_19 boolean arrays carry type codice_20 use 8 bits per element jvm built-in capability pack booleans bit array except type perform behave codice_4 arrays uses codice_3 type effectively unknown jvm instructions operate booleans also used operate codice_4s jvm garbage-collected heap storing objects arrays code constants class data stored method area method area logically part heap implementations may treat method area separately heap example might garbage collect jvm thread also call stack called java virtual machine stack clarity stores frames new frame created time method called frame destroyed method exits frame provides operand stack array local variables operand stack used operands computations receiving return value called method local variables serve purpose registers also used pass method arguments thus jvm stack machine register machine jvm instructions following groups tasks aim binary compatibility particular host operating system needs implementation jvm runtime jvms interpret bytecode semantically way actual implementation may different complex emulating bytecode compatibly efficiently implementing java core api must mapped host operating system instructions operate set common rather native data types specific instruction set architecture jvm language language functionality expressed terms valid class file hosted java virtual machine class file contains java virtual machine instructions java byte code symbol table well ancillary information class file format hardware- operating system-independent binary format used represent compiled classes interfaces several jvm languages old languages ported jvm completely new languages jruby jython perhaps well-known ports existing languages i.e ruby python respectively new languages created scratch compile java bytecode clojure apache groovy scala kotlin may popular ones notable feature jvm languages compatible example scala libraries used java programs vice versa java 7 jvm implements jsr 292 supporting dynamically typed languages java platform new feature supports dynamically typed languages jvm feature developed within da vinci machine project whose mission extend jvm supports languages java basic philosophy java inherently safe standpoint user program crash host machine otherwise interfere inappropriately operations host machine possible protect certain methods data structures belonging trusted code access corruption untrusted code executing within jvm furthermore common programmer errors often led data corruption unpredictable behavior accessing end array using uninitialized pointer allowed occur several features java combine provide safety including class model garbage-collected heap verifier jvm verifies bytecode executed verification consists primarily three types checks first two checks take place primarily verification step occurs class loaded made eligible use third primarily performed dynamically data items methods class first accessed another class verifier permits bytecode sequences valid programs e.g jump branch instruction target instruction within method furthermore verifier ensures given instruction operates fixed stack location allowing jit compiler transform stack accesses fixed register accesses jvm stack architecture imply speed penalty emulation register-based architectures using jit compiler face code-verified jvm architecture makes difference jit compiler whether gets named imaginary registers imaginary stack positions must allocated target architecture registers fact code verification makes jvm different classic stack architecture efficient emulation jit compiler complicated typically carried slower interpreter original specification bytecode verifier used natural language incomplete incorrect respects number attempts made specify jvm formal system security current jvm implementations thoroughly analyzed potential security exploits prevented also possible optimize jvm skipping unnecessary safety checks application run proven safe virtual machine architecture allows fine-grained control actions code within machine permitted take assumes code semantically correct successfully passed formal bytecode verifier process materialized tool possibly off-board virtual machine designed allow safe execution untrusted code remote sources model used java applets secure code downloads bytecode-verified downloaded code runs restricted sandbox designed protect user misbehaving malicious code addition bytecode verification process publishers purchase certificate digitally sign applets safe giving permission ask user break sandbox access local file system clipboard execute external pieces software network formal proof bytecode verifiers done javacard industry formal development embedded verifier java card byte code hardware architecture different java bytecode interpreter needed computer java bytecode interpreter run java bytecode program program run computer interpreter java bytecode executed interpreter execution always slower execution program compiled native machine language problem mitigated just-in-time jit compilers executing java bytecode jit compiler may translate java bytecode native machine language executing program translated parts program executed much quickly could interpreted technique gets applied parts program frequently executed way jit compiler significantly speed overall execution time necessary connection java programming language java bytecode program written java compiled directly machine language real computer programs written languages java compiled java bytecode java bytecode intended platform-independent secure jvm implementations include interpreter consist just-in-time compiler start java platform lifetime jvm marketed web technology creating rich internet applications web browsers operating systems bundling web browsers ship java plug-in permit side-loading non-flash plug-in java browser plugin deprecated jdk 9 npapi java browser plug-in designed allow jvm execute so-called java applets embedded html pages browsers plug-in installed applet allowed draw rectangular region page assigned plug-in includes jvm java applets restricted java programming language language targeting jvm may run plug-in restricted set apis allow applets access user microphone 3d acceleration although applets able modify page outside rectangular region adobe flash player main competing technology works way respect may 2016 javapoly allows users import unmodified java libraries invoke directly javascript javapoly allows websites use unmodified java libraries even user java installed computer continuing improvements javascript execution speed combined increased use mobile devices whose web browsers implement support plugins efforts target users compilation javascript possible either compile source code jvm bytecode javascript compiling jvm bytecode universal across jvm languages allows building upon language existing compiler bytecode main jvm bytecode javascript compilers teavm compiler contained dragome web sdk bck2brwsr j2js-compiler leading compilers jvm languages javascript include java-to-javascript compiler contained google web toolkit clojurescript clojure grooscript apache groovy scala.js scala others java runtime environment jre released oracle freely available software distribution containing stand-alone jvm hotspot java standard library java class library configuration tool and—until discontinuation jdk 9—a browser plug-in common java environment installed personal computers laptop desktop form factor mobile phones including feature phones early smartphones ship jvm likely include jvm meant run applications targeting micro edition java platform meanwhile modern smartphones tablet computers handheld pcs run java apps likely support android operating system includes open source virtual machine incompatible jvm specification instead google android development tools take java programs input output dalvik bytecode native input format virtual machine android devices jvm specification gives lot leeway implementors regarding implementation details since java 1.3 jre oracle contains jvm called hotspot designed high-performance jvm speed-up code execution hotspot relies just-in-time compilation speed-up object allocation garbage collection hotspot uses generational heap java virtual machine heap area memory used jvm dynamic memory allocation hotspot heap divided generations permanent generation permgen used class definitions associated metadata prior java 8 permanent generation part heap permanent generation removed java 8 originally permanent generation objects classes stored together area class unloading occurs much rarely objects collected moving class structures specific area allowed significant performance improvements oracle jre installed large number computers end users out-of-date version jre therefore vulnerable many known attacks led widely shared belief java inherently insecure since java 1.7 oracle jre windows includes automatic update functionality discontinuation java browser plug-in web page might potentially run java applet provided easily accessible attack surface malicious web sites 2013 kaspersky labs reported java plug-in method choice computer criminals java exploits included many exploit packs hackers deploy onto hacked web sites java applet removed java 11 launched september 25th 2018 | [
9731,
7176,
4112,
6161,
10776,
3613,
9245,
5663,
5154,
10789,
10796,
5677,
10808,
1083,
572,
2619,
7750,
9291,
597,
7777,
2658,
11363,
9831,
1130,
4205,
9330,
9333,
5751,
8312,
3705,
8825,
9343,
3712,
4235,
9356,
2710,
7326,
1707,
3247,
2... | None |
5,873 | 3 | DECstation:decstation decstation brand computers used dec refers three distinct lines computer systems—the first released 1978 word processing system latter widely known two released 1989 comprised range computer workstations based mips architecture range pc compatibles mips-based workstations ran ultrix dec-proprietary version unix early releases osf/1 first line computer systems given decstation name word processing systems based pdp-8 systems built vt52 terminal also known vt78 second completely unrelated line decstations began decstation 3100 released 11 january 1989 decstation 3100 first commercially available risc-based machine built dec line decstations fruit advanced development skunkworks project carried dec palo alto hamilton ave facility known pmax project focus produce computer systems family economics performance compete likes sun microsystems risc-based unix platforms day brainchild james billmaier mario pagliaro armando stettner joseph dinucci systems family also employ truly risc-based architecture compared heavier cisc vax still development prism architectures time dec mostly known cisc systems including successful pdp vax lines several architectures considered intel motorola others group quickly selected mips line microprocessors early mips microprocessors supported big- little-endian modes configured hardware reset little-endian mode chosen match byte ordering vax-based systems growing number intel-based pcs computers contrast vax later dec alpha architectures decstation 3100 family specifically designed built run unix system ultrix version vms operating system ever released decstations one issues debated project inception whether dec could sustain grow compete architecture invent manage core advocates later left company mips-based line computers shut favor alpha-based computers dec invented owned architecture descended prism development work first generation commercially marketed dec alpha systems dec 3000 axp series similar respects contemporaneous mips-based decstations sold alongside alpha systems decstation line gradually phased used turbochannel expansion bus video network cards well sold turbochannel option modules mice monitors keyboards later decstations planned based ecl-based r6000 canceled 14 august 1990 bipolar integrated technology failed deliver sufficient volumes microprocessor difficult fabricate yields r6000 reduced dec required little-endian mode used beginning continue available mips-based decstations used first target system development platform mach microkernel well early development windows nt operating system shortly prior release dec alpha systems port osf/1 decstation completed commercially released recently various free operating systems netbsd linux/mips ported mips-based decstations extending useful life providing modern operating system gxemul project emulates several decstation models original mips-based decstation 3100 followed cost reduced 2100 decstation 3100 claimed world fastest unix workstation time introduced three times fast vaxstation 3100 introduced time server configurations decstation models distributed without framebuffer graphics accelerator turbochannel q-bus based called decsystem confused pdp-10 machines name early models decstation heavily integrated systems little expansion capability even possess expansion buses decstation 5000 systems introduced later improved lack expansion capabilities providing turbochannel interconnect decstation 5000 systems also arc advanced risc computing compatible last decstation models focused increased component integration using custom asics reduce number discrete components begun decstation 5000 model 240 replaced discrete components lsi asics ended last model decstation 5000 model 260 used single vlsi asic much control logic packaged decstation 5000 systems sometimes suffixed two three letters letters refer graphics option system decstation 3100 2100 uses r2000 processor r2010 floating point coprocessor four r2020 write buffers r2000 uses external 64 kb direct-mapped instruction cache 64 kb direct-mapped write-through data cache cache line size four bytes four r2020 implement four-stage write buffer improve performance permitting r2000 write write-through data cache without stalling r2000 microprocessor could configured run either big-endian little-endian mode decstation family decision made run little-endian maintain compatibility vax family growing population intel-based pc decstation 3100 2100 memory system contains dram-based system memory vram-based framebuffers amount system memory supported 4 24 mb organized six physical memory banks systems 12 simm slots use 2 mb simms simm containing 1,048,576 word × 18-bit drams simms installed pairs increments 4 mb memory system byte-parity protected monochrome framebuffer implemented 256 kb vfb01 simm color framebuffer 1 mb vbf02 simm one framebuffer simms present framebuffer used simm slots rated 25 removal insertion cycles five recommended limit graphics capability provided two frame buffer modules monochrome color frame buffer monochrome frame buffer supports 1-bit color resolution 1024 × 864 pixels color frame buffer supports 8-bit color resolution monochrome frame buffer frame buffers use brooktree bt478 ramdac three 256-entry 8-bit color maps hardware cursor generated dc503 pcc programmable cursor chip provide 16 × 16 pixel 2-bit color cursor color frame buffer 8-bit write mask used select pixel updated none framebuffers use memory provided frame buffer module color frame buffer vram organized 2048 × 1024 pixels monochrome frame buffer 1024 × 1024 leftmost pixels displayed color frame buffer topmost pixels monochrome frame buffer unused areas vram may used store graphical structures fonts frame buffers parity-protected unlike rest system memory db15 male connector used video connector uses rs343a/rs170 compatible signals decstations onboard 10 mbit/s ethernet provided amd 7990 lance local area network controller ethernet amd 7992 sia serial interface adapter implements interface bnc thinwire ethernet connector 32 768 word × 16-bit 64 kb network buffer constructed srams provided improve performance 32 word 8-bit ethernet station address rom esar provides mac address mounted dip socket removable 5 mb/s single-ended scsi interface provided dc7061 sii gate array 64 k 16-bit 128 kb scsi buffer used improve performance decstations provide internal storage scsi interface connected external port honda68 male connector connected drive expansion boxes systems four asynchronous serial lines provided dc7085 gate array four serial lines third line required modem control signals support modem 4-pin mmj connector provided keyboard line 7-pin din connector mouse line two 6-pin mmj connectors printer modem lines real time clock motorola mc146818 also 50 bytes ram storing console configuration information 256 kb rom storing boot-strap self-test software provided two 128 kb roms dip sockets enclosure used decstation 3100 2100 identical enclosure used vaxstation 3100 systems use mechanically identical system module enclosure accommodate two 3.5-inch drives mounted trays system module system module located left enclosure power supply takes fourth space inside enclosure located left personal decstation 5000 series entry-level workstations code named maxine personal decstation uses low-profile desktop case contained power supply left two mounts two fixed drives one fixed drive one diskette drive front system logic contained two printed circuit boards base system module contained majority logic cpu module contained processor three models cpu module contains cpu subsystem first model contains chipset consisting 20 25 33 mhz r3000a cpu r3010 fpu accompanied 64 kb instruction cache 64 kb data cache caches direct-mapped 4-byte cache line data cache write components cpu module operate clock frequency r300a cpuctl asic also present purpose provide interfacing buffering faster cpu module slower 12.5 mhz system module cpuctl asic also implements 12.5 mhz turbochannel serves system interconnect second model revised version first module 20 25 mhz r3000a r3010 used plastic packaging whereas previous model used ceramic packaging third model contains r4000 microprocessor internal instruction data caches complemented 1 mb secondary cache systems 8 mb onboard memory four simm slots used expand amount memory 32 mb total 40 mb memory simm slots accept 2 8 mb simms pairs simms system must size memory bus 40 bits wide 32 bits used data four bits used byte-parity memory control asic controls memory communicates cpu subsystem via turbochannel bus expansion provided two turbochannel slots 64 mb physical address space personal decstation features integrated 8-bit color frame buffer capable resolution 1024 × 768 refresh rate 72 hz frame buffer consists 1 mb vram organized 262,144 32-bit words 32-bit word containing four 8-bit pixels frame buffer uses inmos ims g332 ramdac 256-entry 24-bit color look table selects 256 colors display palette 16,777,216 frame buffer treated part memory subsystem i/o subsystem provides system 8-bit single-ended scsi bus 10 mbit/s ethernet serial line serial desktop bus analog audio scsi provided ncr 53c94 asc advanced scsi controller ethernet provided amd am7990 lance local area network controller ethernet amd am7992 sia serial interface adapter implements aui interface single serial port capable 50 19,200 baud full modem control capability provided zilog z85c30 scc serial communications controller analog audio isdn support provided amd 79c30a dsc digital subscriber controller devices connected ioctl asic via two 8-bit buses one 16-bit bus asic interfaces subsystem turbochannel interconnect decstation 5000 model 100 series code named 3min mid-range workstations early models used chipset consisting r3000a cpu r3010 cpu 3- 5-inch daughter card plugs connector system module model 150 replaces r3000a r3010 single r4000 integrated fpu model 120 125 two external caches 64 kb instruction cache 64 kb data cache model 133 128 kb instruction cache systems support 16 128 mb memory 16 simm slots accept 2 8 mb simms one type simm may used 2 8 mb simms mixed system 2 mb simm identical simm used decstation 2100 3100 allowing upgrades older systems model 100 series reuse old memory three turbochannel option slots provided model 100 series introduces i/o controller asic later known ioctl asic interfaces two 8-bit i/o buses 12.5 mhz turbochannel decstation 200 series high-end workstations server configurations decstation 500 model 200 240 260 known decsystem 5000 model 200 240 260 respectively systems contain cpu module system module power supply located left side enclosure internal storage capability drives intended installed external single- multiple-drive enclosures enclosures connected system via scsi connector located rear system alternatively storage provided file server accessed network member model 200 series unique cpu subsystem model 200 cpu subsystem located kn02 system module contains chipset composed r3000 cpu r3010 fpu r3220 mb six-stage write/memory buffer also part subsystem processor external 64 kb instruction cache 64 kb write-through data cache contrast model 240 cpu subsystem located daughter card cpu module use processor chipset featuring single 40 mhz r3400 instead r3400 integrates r3000a cpu r3010 fpu single die package processor external 64 kb instruction cache 64 kb data cache connected r3400 40 mhz bus also serves datapath mb asic model 260 cpu subsystem also located cpu module daughter card features 120 mhz 60 mhz external r4000 internal instruction data caches external secondary cache model 260 cpu subsystem unique model 200 series contains boot rom firmware unlike members boot rom located system module difference due r4000 requiring different firmware could replaced upgrading model 240 model 260 model 200 series 15 simm slots located system module hold 8 480 mb memory proprietary 128-pin memory array modules simms capacities 8 mb 39 1 mbit dram chips 32 mb 39 4 mbit dram chips used simms installed system must size 8 mb simms used system may contain 8 120 mb memory 32 mb simms used system may contain 32 480 mb memory memory subsystem operates 25 mhz 32 bits wide match native word length r3000 memory subsystem protected ecc scheme seven bits check every 32-bit transaction simms two-way interleaved using low-order method even odd memory addresses treated separate banks memory interleaving memory subsystem doubles bandwidth non-interleaved memory subsystem using drams allowing model 200 series achieve effective maximum bandwidth 100 mb/s optional 1 mb nvram module provides disk cache improve performance installed one simm slots slot 14 simm slot closest front edge system module module uses battery prevent data lost case power failure module useful optional software installed model 200 uses discrete components implement memory subsystem logic model 240 discrete components replaced three asics mb asic mt asic ms asic mb memory buffer asic serves interface 40 mhz cpu module domain 25 mhz system module domain connected mt asic serves memory controller mt asic provides memory control refresh handles memory dma transactions ecc checking ms memory strobe asic provides 15 sets memory control lines routes memory control signals mt asic destination simm ms asic replaces 16 discrete components used model 200 also generates 25 mhz system clock signal replacing three discrete components used model 200 model 200 series uses turbochannel interconnect expansion models three turbochannel option slots model 200 provides 4 mb physical address space turbochannel option model 240 260 provides 8 mb turbochannel model 240 260 clocked 25 mhz model 240 260 mt asic implements turbochannel serves controller model 200 i/o subsystem significantly different model 240 260 i/o subsystem model 200 ethernet scsi capabilities provided two integrated turbochannel option modules pmad-aa ethernet pmaz-aa scsi pmad-aa uses amd 7990 lance local area network controller ethernet provides 10base-t ethernet interface implemented amd 7992 sia serial interface adapter bnc thinwire connector 8-bit single-ended scsi bus provided ncr 53c94 asc advanced scsi controller integrated option modules 128 kb sram serving buffer improve performance four serial lines also provided keyboard mouse communications port printer lines implemented two dc7085s dallas semiconductor ds1287 real time clock 50 bytes nvram also featured 256 kb system boot-strap diagnostic rom socket contrast model 240 260 i/o subsystem based around i/o controller asic serves bridge turbochannel two i/o buses implements i/o devices two zilog z85c30 sccs serial communications controller ncr 53c94 asc amd 7990 lance dallas semiconductor ds1287 real time clock system rom connected i/o buses i/o controller asic introduced model 240 first featured model 100 series asic used model 240 differs clocked twice high 25 mhz instead 12.5 mhz model 240 i/o subsystem would later used dec 3000 axp modified form decstation systems turbochannel slots could use turbochannel-based framebuffers 2d graphics accelerators 3d graphics accelerators options pxg variants capable either 8-bit 24-bit color resolution 1280 × 1024 refresh rate either 66 72 hz pxg also 8-bit 24-bit z-buffer double buffered color depth depth z-buffer extended installing additional vsimms z-buffer modules module pxg turbo variants capable 24-bit color resolution 1280 × 1024 refresh rate either 66 72 hz differ featuring 24-bit buffer storing off-screen pixmaps addition 24-bit z-buffer double buffer 3d graphics accelerators implemented digital proprietary pixelstamp architecture derived two research projects pixel planes university north carolina 8 8 display carnegie-mellon university pixelstamp architecture geometry pipeline consists dma engine geometry engine pixelstamp dma engine interfaces pipeline system via turbochannel receiving packets cpu sending geometry engine geometry engine consists amount sram intel i860 packets dma engine stored sram processed i860 writes results fifo pixelstamp consists stic stamp interface chip asic one two stamp asics stic fetches results fifo passes stamp asic performs scan conversion graphical functions data processed stamp asics final result consists rgb data written framebuffer built vsimms simm vrams located graphics accelerator option module displayed graphics accelerators grouped two distinct categories double-width options triple-width options pxg pxg+ double-width turbochannel option modules pxg turbo pxg turbo+ triple-width turbochannel option modules models suffixed higher performance models base model 44 mhz i860 instead 40 mhz i860 stic stamp asics operate clock frequencies 33 higher models suffixed turbo differ featuring 256 kb sram two stamp asics instead 128 kb sram one stamp asic models known lo 3d graphics accelerator lo 3d plus graphics accelerator upgraded mid 3d graphics accelerator mid 3d plus graphics accelerator installing vsimms z-buffer modules depending model decstation systems capable performing video conferencing high-quality audio output video input achieved use turbochannel option modules external peripherals video input achieved using decvideo also known pip picture-in-picture live-video-in option daughterboard plugs tx framebuffer provide ntsc pal secam input option used conjunction video camera microphone required software decstation used video conferencing audio capabilities provided decaudio turbochannel option module contained two amd 79c30a dsc digital subscriber controller devices motorola 56001 dsp two amd 79c30a dscs used voice-quality audio input output motorola 56001 used high-quality audio dsp initially used due firmware incomplete although capability provided later update confusingly simultaneous launch decstation workstation line digital also announced range decstation-branded pc compatibles intel x86 processors ran ms-dos identified three-digit model numbers decstation 2xx 3xx 4xx series using intel 80286 80386 80486 processors respectively computers built digital tandy corporation united states olivetti europe time introduction digital offered trade-in program owners earlier x86 pc incompatible computer rainbow 100 systems based 80286 systems based 80386 systems based 80486 | [
11013,
9742,
783,
8976,
7954,
7187,
2452,
7188,
408,
8474,
8732,
6942,
7215,
7983,
5686,
823,
6846,
9665,
7234,
3142,
6854,
8390,
9166,
11604,
3945,
6250,
6252,
9452,
10220,
11501,
8048,
5873,
6129,
499,
5492,
757,
1398,
7411,
9723
] | Validation |
5,874 | 4 | Aanval:aanval aanval commercial siem product designed specifically use snort suricata syslog data aanval active development since 2003 remains one longest running snort capable siem products industry aanval dutch attack aanval created loyal moses 2003 publicly made available march 2004 released private commercial license c1-ra1008 throughout lifecycle software also referred openaanval comaanval addition current registered trademark name aanval aanval original success providing ajax style security event monitoring reporting web-browser since aanval creation become intrusion detection correlation threat management console specific focus normalizing snort suricata syslog data 2010 aanval first intrusion detection vendor provide integrated ios app allowed users view security events remotely iphone ipad ipod touch several information security related books published include details references aanval including linux server security second edition o'reilly media security log management o'reilly media snort ids ips toolkit o'reilly media 2010 unix linux system administration handbook fourth edition o'reilly media | [
6273,
1346,
3714,
8644,
7813,
8582,
9732,
6539,
7983,
5492,
823,
5245,
3486
] | Validation |
5,875 | 5 | Wireless_Application_Protocol:wireless application protocol wireless application protocol wap technical standard accessing information mobile wireless network wap browser web browser mobile devices mobile phones uses protocol introduced much hype 1999 wap achieved popularity early 2000s 2010s largely superseded modern standards modern handset internet browsers fully support html need use wap markup web page compatibility therefore longer able render display pages written wml wap markup language introduction wap mobile service providers limited opportunities offer interactive data services needed interactivity support internet web applications email stock prices news sports headlines japanese i-mode system offered another major competing wireless data protocol wap standard described protocol suite stack allowing interoperability wap equipment software different network technologies gsm is-95 also known cdma bottom-most protocol suite wireless datagram protocol wdp functions adaptation layer makes every data network look bit like udp upper layers providing unreliable transport data two 16-bit port numbers origin destination upper layers view wdp one protocol several technical realizations top data bearers sms ussd etc native ip bearers gprs umts packet-radio service ppp top circuit-switched data connection wdp fact exactly udp wtls optional layer provides public-key cryptography-based security mechanism similar tls wtp provides transaction support reliable request/response adapted wireless world wtp supports effectively tcp problem packet loss occurs commonly 2g wireless technologies radio conditions misinterpreted tcp network congestion finally one think wsp initially compressed version http protocol suite allows terminal transmit requests http https equivalent wap gateway gateway translates requests plain http wireless application environment wae space defines application-specific markup languages wap version 1.x primary language wae wireless markup language wml wap 2.0 primary markup language xhtml mobile profile wap push incorporated specification allow wap content pushed mobile handset minimal user intervention wap push basically specially encoded message includes link wap address wap push specified top wireless datagram protocol wdp delivered wdp-supported bearer gprs sms gsm networks wide range modified processors gprs activation network generally supported wap push messages delivered top sms bearer receiving wap push wap 1.2 later -enabled handset automatically give user option access wap content also known wap push si service indication variant known wap push sl service loading directly opens browser display wap content without user interaction since behaviour raises security concerns handsets handle wap push sl messages way si providing user interaction network entity processes wap pushes delivers ip sms bearer known push proxy gateway ppg re-engineered 2.0 version released 2002 uses cut-down version xhtml end-to-end http dropping gateway custom protocol suite used communicate wap gateway used conjunction wap 2.0 however scenario used standard proxy server wap gateway role would shift one translation adding additional information request would configured operator could include telephone numbers location billing information handset information mobile devices process xhtml mobile profile xhtml mp markup language defined wap 2.0 subset xhtml superset xhtml basic version cascading style sheets css called wap css supported xhtml mp multimedia messaging service mms combination wap sms allowing sending picture messages wap forum founded 1998 ericsson motorola nokia unwired planet aimed primarily bring together various wireless technologies standardised protocol 2002 wap forum consolidated along many forums industry open mobile alliance oma first company launch wap site dutch mobile phone operator telfort bv october 1999 site developed side project christopher bee euan mcleod launched debut nokia 7110 marketers hyped wap time introduction leading users expect wap performance fixed non-mobile internet access bt cellnet one uk telecoms ran advertising campaign depicting cartoon wap user surfing neuromancer -like information space terms speed ease use appearance interoperability reality fell far short expectations first handsets became available 1999 led wide usage sardonic phrases worthless application protocol wait pay waplash 2003 2004 wap made stronger resurgence introduction wireless services vodafone live t-mobile t-zones easily accessible services operator revenues generated transfer gprs umts data different business model used traditional web sites isps according mobile data association wap traffic uk doubled 2003 2004 year 2013 wap use largely disappeared major companies websites since retired use wap mainstream technology web mobile number years modern handset internet browsers support full html css javascript need use kind wap markup webpage compatibility list handsets supporting html extensive includes android handsets versions iphone handset blackberry devices devices running windows phone many nokia handsets wap saw major success japan largest operator ntt docomo use wap favor in-house system i-mode rival operators kddi au softbank mobile previously vodafone japan successfully deployed wap technology particular j-phone sha-mail picture mail java jscl services well au chakuuta/chakumovie ringtone song/ringtone movie services based wap like europe wap i-mode usage declined 2010s html-capable smartphones became popular japan adoption wap us suffered many cell phone providers required separate activation additional fees data support also telecommunications companies sought limit data access approved data providers operating license signal carrier recognition problem u.s. federal communications commission fcc issued order 31 july 2007 mandated licensees 22-megahertz wide upper 700 mhz c block spectrum would implement wireless platform allows customers device manufacturers third-party application developers others use device application choice operating particular licensed network band commentators criticized several aspects wireless markup language wml wap technical criticisms include criticisms address wireless carriers particular implementations wap original wap model provided simple platform access web-like wml services e-mail using mobile phones europe se asian regions 2009 continued considerable user base later versions wap primarily targeting united states market designed different requirement enable full web xhtml access using mobile devices higher specification cost higher degree software complexity considerable discussion addressed question whether wap protocol design appropriate suggested bandwidth-sparing simple interface gopher would better match mobile phones personal digital assistants pdas initial design wap specifically aimed protocol independence across range different protocols sms ip ppp circuit switched bearer ip gprs etc. led protocol considerably complex approach directly ip might caused controversial especially many ip side design wap ip wap transmission layer protocol wtp uses retransmission mechanisms udp attempt solve problem inadequacy tcp high-packet-loss networks | [
4609,
9732,
5637,
6,
1030,
3086,
8211,
5143,
6681,
10271,
10274,
3626,
562,
1083,
3133,
1602,
11332,
8265,
5201,
9809,
4691,
7765,
3162,
7771,
4704,
10344,
6763,
6271,
11391,
9860,
1160,
9356,
3218,
11413,
5270,
9367,
10393,
6301,
2206,
1... | Test |
5,876 | 5 | People_Finder_Interchange_Format:people finder interchange format people finder interchange format pfif widely used open data standard information missing displaced people pfif designed enable information sharing among governments relief organizations survivor registries help people find contact family friends disaster pfif extended xml consists person records contain identifying information person note records contain comments updates status location person note attached one person pfif defines set fields records xml-based format store transfer pfif xml records embedded atom feeds rss feeds pfif allows different repositories missing person data exchange aggregate records every record unique identifier indicates domain name original repository record created unique record identifier preserved record copied one repository another example repository receives copy given person publish note attached person even note person copied repositories remain traceable respective original sources within three days 2001 september 11 attacks people using 25 different online forums survivor registries report check family friends one first largest survivor registry safe.millennium.berkeley.edu created graduate students ka-ping yee miriam walker hosted millennium computer cluster uc berkeley reduce confusion caused proliferation different websites berkeley survivor registry began collecting data several major sites one searchable database information formatted differently site site site required manual effort custom programming download incorporate data hurricane katrina displaced hundreds thousands people 2005 online survivor registries appeared many different websites large volunteer effort called katrina peoplefinder project worked gather manually re-enter information one searchable database provided salesforce.com organizer project david geilhufe put call technical help create data standard would enable survivor registries aggregate share information via automated means working katrina volunteers kieran lal jonathan plax civicrm team yee drafted first specification people finder interchange format released september 4 2005 pfif 1.0 pfif 1.1 small corrections released september 5 salesforce.com database added support pfif yahoo google also launched searchable databases katrina survivors exchanged information using pfif next major use pfif occurred 2010 haiti earthquake google launched google person finder used data model based pfif exchanged data cnn new york times national library medicine survivor registries using pfif however pfif 1.1 made us-specific assumptions applicable haiti released january 26 2010 pfif 1.2 added fields person home country international postal code fields sex age date birth status links duplicate records person pfif 1.3 released march 2011 addressed privacy personal information adding field specify expiry date person record setting requirements data deletion pfif 1.3 also moved away us-specific assumption first last name adding one field person full name pfif 1.4 released may 2012 renamed name fields given_name last_name added field alternate names added field linking personal profiles websites added support multiple photos per person following websites software projects implement pfif | [
10090,
8735,
479
] | Validation |
5,877 | 2 | Uhuru_Mobile:uhuru mobile uhuru mobile secure android-based operating system operating system principal program allowing smartphones tablets pcs run central tool connects coordinates components kernel computers programs software device drivers letting users managing devices uhuru mobile solution composed application encryption market modified android-based os virtual private network sms encryption solution purpose uhuru mobile prevent physical attacks name uhuru comes swahili language means freedom independence uhuru mobile result research development project initiated 2012 promote digital sovereignty android-based operating system uhuru mobile focuses security privacy end-users individuals businesses mobile devices operating system currently developed software editor company called teclib ’ ensure os protection security using applications dedicated market installed replacing google play store uhuru mobile ’ applications market provides apps approved certified team security experts companies also customize uhuru marketplace providing in-house applications uhuru mobile provided deception system sending fake gps location coordinates applications decoy geolocation tool allows users fool applications using geolocation administrators define redirecting coordinates example demo version nsa headquarters coordinates sent deception system mobile device management tool administration mobile devices provided without additional setup administrators access web-console order manage uhuru mobile fleet linked applications remote apps installation/suppression set user accounts | [
5636,
3629,
9646,
7887,
7983,
7515,
5363,
5749,
1083
] | Test |
5,878 | 1 | CrocBITE:crocbite crocbite online database crocodile attacks reported humans non-profit online research tool helps scientifically analyze crocodile behavior via complex models users encouraged feed information crowdsourcing manner uploaded information needs verifiable database provides key insights crocodile attack patterns draws inferences save human lives online database established dr adam britton researcher charles darwin university student brandon sideleau erin britton compilation government records individual reports registered contributors historical data dr simon pooley junior research fellow imperial college london joined hands studies collaboration culminated dr pooley met dr britton iucn crocodile specialist group louisiana 2014 brandon instrumental designing database work infrastructure program received funds economic social research council united kingdom tune unspecified resourced plus amount big gecko crocodilian research crocodillian.com charles darwin university research already yielded pertinent observations provide inside crocodile attacks observed attacks humans occur bites saltwater crocodile popular understanding nile crocodiles taking top spot broad category nile crocodile attacks segmented west african crocodile crocodylus niloticus nile crocodile species get clear understanding respective attack zones objective information used communities conservation managers help inform educate people keep safe information vital australia africa attacks likely parts world database kind comprehensive collection information made available online | [
2901
] | None |
5,879 | 1 | TiDB:tidb tidb open-source newsql database supports hybrid transactional analytical processing htap workloads mysql compatible provide horizontal scalability strong consistency high availability developed supported primarily pingcap inc. licensed apache 2.0 tidb drew initial design inspiration google ’ spanner f1 papers tidb recognized infoworld 2018 bossie award one best open source software data storage analytics pingcap inc. software company founded april 2015 began developing tidb founding company primary developer maintainer driver tidb associated open-source communities pingcap venture-backed company announced 50 million usd series c round financing september 2018 tidb expand sql processing storage capacity adding new nodes makes infrastructure capacity scaling easier flexible compare traditional relational database scale vertically tidb acts like mysql 5.7 server applications user continue use existing mysql client libraries tidb ’ sql processing layer built scratch mysql fork compatibility 100 known behavior differences mysql tidb tidb internally shards table small range-based chunks referred regions region defaults approximately 100mib size tidb uses two-phase commit internally ensure regions maintained transactionally consistent way tidb designed work cloud make deployment provisioning operations maintenance flexible storage layer tidb called tikv became cloud native computing foundation member project august 2018 sandbox level project architecture tidb platform also allows sql processing storage scaled independently tidb support online transaction processing oltp online analytical processing olap workloads means user may traditionally transacted mysql extracted transformed loaded etl data column store analytical processing step longer required tidb uses raft consensus algorithm ensure data highly available safely replicated throughout storage raft groups event failure raft group automatically elect new leader failed member self-heal tidb cluster without required manual intervention failure self-healing operations transparent applications tidb deployed kubernetes-enabled cloud environment using tidb operator operator method packaging deploying managing kubernetes application designed running stateful workloads first introduced coreos 2016.tidb operator originally developed pingcap open-sourced august 2018 tidb operator used deploy tidb laptop google cloud platform ’ google kubernetes engine amazon web services ’ elastic container service kubernetes tidb deployed using ansible using tidb-ansible playbook docker used deploy tidb containerized environment multiple nodes multiple machines docker compose used deploy tidb single command testing purposes tidb series open-source tools built around help data replication migration existing mysql mariadb users syncer tool supports full data migration incremental data replication mysql mariadb instances tidb cluster data migration dm second-generation iteration syncer suited replicating data already sharded mysql mariadb tables tidb common use case syncer/dm connect mysql mariadb tables tidb treating tidb almost slave directly run analytical workloads tidb cluster near real-time lightning tool supports high speed full-import large mysql dump new tidb cluster providing faster import experience executing sql statement tool used populate initially empty tidb cluster lots data quickly order speed testing production migration import speed improvement achieved parsing sql statements key-value pairs directly generate sorted string table sst files rocksdb tidb-binlog tool used collect logical changes made tidb cluster used provide incremental backup replication either two tidb clusters tidb cluster another downstream platform similar functionality mysql master-slave replication main difference since tidb distributed database binlog generated tidb instance needs merged sorted according time transaction commit consumed downstream | [
9286,
11017,
4011,
8683,
7022,
10286,
7248,
7889,
10389,
1435,
2910
] | Test |
5,880 | 9 | Expressive_power_(computer_science):expressive power computer science computer science expressive power also called expressiveness expressivity language breadth ideas represented communicated language expressive language greater variety quantity ideas used represent example web ontology language expression language profile owl2 el lacks ideas negation expressed owl2 rl rule language owl2 el may therefore said less expressive power owl2 rl restrictions allow efficient polynomial time reasoning owl2 el owl2 rl owl2 el trades expressive power efficient reasoning processing knowledge representation language term expressive power may used range meaning may mean measure ideas expressible language first sense dominates areas mathematics logic deal formal description languages meaning formal language theory mathematical logic process algebra informal discussions term often refers second sense often case discussing programming languages efforts made formalize informal uses term notion expressive power always relative particular kind thing language question describe term normally used comparing languages describe kind things least comparable kinds things design languages formalisms involves trade-off expressive power analyzability formalism express harder becomes understand instances formalism say decision problems become harder answer completely undecidable formal language theory mostly studies formalisms describe sets strings context-free grammars regular expressions instance formalism e.g grammar regular expression describes particular set strings context expressive power formalism set sets strings instances describe comparing expressive power matter comparing sets important yardstick describing relative expressive power formalisms area chomsky hierarchy says instance regular expressions nondeterministic finite automatons regular grammars equal expressive power context-free grammars greater means sets sets strings described first three formalisms equal proper subset set sets strings described context-free grammars area cost expressive power central topic study known instance deciding whether two arbitrary regular expressions describe set strings hard arbitrary context-free grammars completely impossible however still efficiently decided whether given string set expressive formalisms problem harder even undecidable turing complete formalism arbitrary formal grammars problem every nontrivial property regarding set strings describe undecidable fact known rice theorem results conciseness well instance nondeterministic state machines regular grammars concise regular expressions sense latter translated former without blowup size i.e 1 reverse possible similar considerations apply formalisms describe sets strings sets trees e.g xml schema languages graphs structures database theory concerned among things database queries e.g formulas given contents database extract certain information predominant relational database paradigm contents database described finite set finite mathematical relations boolean queries always yield true false formulated first-order logic turns first-order logic lacking expressive power express certain types boolean queries e.g queries involving transitive closure however adding expressive power must done care must still remain possible evaluate queries reasonable efficiency case e.g. second-order logic consequently literature sprang many query languages language constructs compared expressive power efficiency e.g various versions datalog similar considerations apply query languages types data e.g xml query languages xquery | [
9345,
9224,
1801,
2316,
5774,
5245,
4376,
10649,
5404,
10909,
6047,
1697,
10658,
6437,
6775,
939,
5165,
7983,
9397,
1462,
8122,
9411,
10435,
8262,
9286,
9926,
8396,
9932,
5585,
11474,
11219,
2901,
9688,
987,
731,
11487,
10083,
7780,
9714,
... | Test |
5,881 | 9 | SPICE:spice spice simulation program integrated circuit emphasis general-purpose open-source analog electronic circuit simulator program used integrated circuit board-level design check integrity circuit designs predict circuit behavior unlike board-level designs composed discrete parts practical breadboard integrated circuits manufacture high costs photolithographic masks manufacturing prerequisites make essential design circuit close perfect possible integrated circuit first built simulating circuit spice industry-standard way verify circuit operation transistor level committing manufacturing integrated circuit board-level circuit designs often breadboarded testing even breadboard circuit properties may accurate compared final printed wiring board parasitic resistances capacitances parasitic components often estimated accurately using spice simulation also designers may want information circuit available single mock-up instance circuit performance affected component manufacturing tolerances cases common use spice perform monte carlo simulations effect component variations performance task impractical using calculations hand circuit appreciable complexity circuit simulation programs spice derivatives prominent take text netlist describing circuit elements transistors resistors capacitors etc connections translate description equations solved general equations produced nonlinear differential algebraic equations solved using implicit integration methods newton method sparse matrix techniques spice developed electronics research laboratory university california berkeley laurence nagel direction research advisor prof. donald pederson spice1 largely derivative cancer program nagel worked prof. ronald rohrer cancer acronym computer analysis nonlinear circuits excluding radiation hint berkeley liberalism 1960s times many circuit simulators developed united states department defense contracts required capability evaluate radiation hardness circuit nagel original advisor prof. rohrer left berkeley prof. pederson became advisor pederson insisted cancer proprietary program rewritten enough restrictions could removed program could put public domain spice1 first presented conference 1973 spice1 coded fortran used nodal analysis construct circuit equations nodal analysis limitations representing inductors floating voltage sources various forms controlled sources spice1 relatively circuit elements available used fixed-timestep transient analysis real popularity spice started spice2 1975 spice2 also coded fortran much-improved program circuit elements variable timestep transient analysis using either trapezoidal second order adams-moulton method gear integration method also known bdf equation formulation via modified nodal analysis avoiding limitations nodal analysis innovative fortran-based memory allocation system developed another graduate student ellis cohen last fortran version spice 2g.6 1983 spice3 developed thomas quarles a. richard newton advisor 1989 written c uses netlist syntax added x window system plotting early public domain software program source code available spice widely distributed used ubiquity became spice circuit remains synonymous circuit simulation spice source code beginning distributed uc berkeley nominal charge cover cost magnetic tape license originally included distribution restrictions countries considered friendly us source code currently covered bsd license birth spice named ieee milestone 2011 entry mentions spice evolved become worldwide standard integrated circuit simulator nagel awarded 2019 ieee donald o. pederson award solid-state circuits development spice newer versions berkeley spice released version 3f.5 1993 since open-source academic continuations spice include xspice developed georgia tech added mixed analog/digital code models behavioral simulation cider previously codecs developed uc berkeley oregon state univ. added semiconductor device simulation spice opus developed maintained university ljubljana based spice 3f.4 xspice ngspice based spice 3f.5 xspice cider berkeley spice inspired served basis many circuit simulation programs academia industry commercial products first commercial version spice ispice interactive version timeshare service national css prominent commercial versions spice include hspice originally commercialized ashawna kim hailey meta software owned synopsys pspice owned cadence design systems integrated circuit industry adopted spice quickly commercial versions became well developed many ic design houses proprietary versions spice today ic manufacturers typically larger companies groups continuing develop spice-based circuit simulation programs among adice analog devices ltspice linear technology available public freeware mica freescale semiconductor tina texas instruments similarly linear technology texas instruments makes available freeware windows version tina software called tina-ti also includes version spice comes preloaded models company integrated circuits analog devices offers similar free tool called adisimpe based simetrix/simplis implementation spice companies maintain internal circuit simulators directly based upon spice among powerspice ibm titan infineon technologies lynx intel corporation pstar nxp semiconductor spice became popular contained analyses models needed design integrated circuits time robust enough fast enough practical use precursors spice often single purpose bias program example simulation bipolar transistor circuit operating points slic program small-signal analyses spice combined operating point solutions transient analysis various small-signal analyses circuit elements device models needed successfully simulate many circuits spice2 included analyses since spice generally used model nonlinear circuits small signal analyses necessarily preceded quiescent point calculation circuit linearized spice2 also contained code small-signal analyses sensitivity analysis pole-zero analysis small-signal distortion analysis analysis various temperatures done automatically updating semiconductor model parameters temperature allowing circuit simulated temperature extremes circuit simulators since added many analyses beyond spice2 address changing industry requirements parametric sweeps added analyze circuit performance changing manufacturing tolerances operating conditions loop gain stability calculations added analog circuits harmonic balance time-domain steady state analyses added rf switched-capacitor circuit design however public-domain circuit simulator containing modern analyses features needed become successor popularity spice yet emerged important use appropriate analyses carefully chosen parameters example application linear analysis nonlinear circuits justified separately also application transient analysis default simulation parameters lead qualitatively wrong conclusions circuit dynamics spice2 included many semiconductor device compact models three levels mosfet model combined ebers–moll gummel–poon bipolar model jfet model model junction diode addition many elements resistors capacitors inductors including coupling independent voltage current sources ideal transmission lines active components voltage current controlled sources spice3 added sophisticated mosfet models required due advances semiconductor technology particular bsim family models added also developed uc berkeley commercial industrial spice simulators added many device models technology advanced earlier models became inadequate attempt standardization models set model parameters may used different simulators industry working group formed compact model council choose maintain promote use standard models standard models today include bsim3 bsim4 bsimsoi psp hicum mextram traditional photonic device simulators apply direct methods solve maxwell equations complete structure whereas photonic circuit simulators based segmentation building blocks bbs represented logic level phothonic device coupled bbs guided modes optical waveguides circuit-level modeling photonic integrated circuit pic contain electrical wires optical signals respectively described voltage/current complex-valued envelope forward- backward-propagating modes building block netlist photonic electronic circuits including net port connections expressed spice format schematic editors like ones used electronic design automation reproduce complete photonic signal information without losing eventual optical phenomena needed real-time waveform electric magnetic field every mode polarization waveguide spice works 10 time steps timescale datacommunications ≈10–100 10 common make amount information tractable modulation increases complexity encode amplitude phase way similar simulation rf circuits however photonic integrated circuit simulators need test multiple communication channels match different carrier frequencies equivalently amplitudes single channel type sophisticated signal unsupported spice program features structure described 2019 spice ca n't used simulate photonics electronics together photonic circuit simulator thus n't yet considered test simulator photonic integrated circuits spice2 took text netlist input produced line-printer listings output fit computing environment 1975 listings either columns numbers corresponding calculated outputs typically voltages currents line-printer character plots spice3 retained netlist circuit description allowed analyses controlled command-line interface similar c shell spice3 also added basic x plotting unix engineering workstations became common vendors various free software projects added schematic capture front-ends spice allowing schematic diagram circuit drawn netlist automatically generated also graphical user interfaces added selecting simulations done manipulating voltage current output vectors addition capable graphing utilities added see waveforms graphs parametric dependencies several free versions extended programs available introductory limited packages without restrictions since transient analysis dependent time uses different analysis algorithms control options different convergence-related issues different initialization parameters dc analysis however since transient analysis first performs dc operating point analysis unless uic option specified .tran statement dc analysis algorithms control options initialization convergence issues apply transient analysis circuits oscillators circuits feedback stable operating point solutions circuits either feedback loop must broken dc operating point calculated initial conditions must provided simulation input dc operating point analysis bypassed uic parameter included .tran statement uic included .tran statement transient analysis started using node voltages specified .ic statement node set 5 v .ic statement value node first time point time 0 5 v. use .op statement store estimate dc operating point transient analysis codice_1 .tran statement uic parameter example bypasses initial dc operating point analysis .op statement calculates transient operating point 20 ns transient analysis although transient analysis might provide convergent dc solution transient analysis still fail converge transient analysis error message internal timestep small indicates circuit failed converge convergence failure might due stated initial conditions close enough actual dc operating point values | [
11333,
7367,
7819,
3756,
7820,
4792,
4243,
5301,
3960,
3323,
2045,
8606
] | Test |
5,882 | 3 | Chack'n_Pop:chack n pop arcade rom-set also contains unused graphics mechanical wind-up zen-chan later appeared bubble bobble home ports released sg-1000 msx famicom nec pc-6001 nec pc-8801 arcade emulation included taito legends power-up psp taito legends 2 xbox playstation 2 pc chack n small yellow creature later recolored green extendable legs must traverse series single-screen mazes capable walking floors ceilings walls climb steps traverse high walls extending legs tall enough pass onto next step capable throwing hand grenades left right short period explode cloud smoke separate fire buttons control rolling left right chack n killed caught explosion cloud screen played time limit marked mighta pushing boulder along top screen mighta reappears bubble bobble recurring enemy chack n aim reach top screen time limit expires delayed process series solid walls order get past walls must free hearts cages using hand grenades obstruction comes form monstas creatures appear bubble bobble hatching eggs hand grenades also used destroy creatures eggs producing however player get bonus points completing level destroying enemies later levels include moving platforms reminiscent bubble bobble water bottles blown flood level water water destroy anything way inhibit movement enemies allows chack n swim otherwise unreachable platforms levels completed chack n able marry girlfriend miss chack n sega sg-1000 version extended introduction ending sequences small additional training stage first chack n content chack n pop appeared bubble bobble fairyland story parasol stars puzzle bobble bubble symphony bubble memories pop n pop arkanoid ds huge silver robotic chack n also mid-boss stage 5 taito arcade shooter megablast | [
10316,
9006,
5263,
10931,
1693
] | Validation |
5,883 | 3 | Coffee_Lake:coffee lake coffee lake intel codename second 14 nm process node refinement following broadwell skylake kaby lake integrated graphics coffee lake chips allow support dp 1.2 hdmi 2.0 hdcp 2.2 connectivity coffee lake natively supports ddr4-2666 mhz memory dual channel mode used xeon core i5 i7 i9 cpus ddr4-2400 mhz memory dual channel mode used celeron pentium core i3 cpus lpddr3-2133 mhz memory used mobile cpus desktop coffee lake cpus introduces major changes intel core cpus nomenclature i5 i7 cpus feature six cores along hyper-threading case latter core i3 cpus four cores dropping hyper-threading first time received change well 9th generation release october 2018 changed nomenclature core i7 moving 8 cores dropping hyper-threading first time new mainstream desktop core i9 processors released featuring 8 cores hyper-threading chips released october 5 2017 coffee lake used conjunction 300-series chipset officially work 100- 200-series chipset motherboards although desktop coffee lake processors use physical lga 1151 socket skylake kaby lake pinout electrically incompatible older processors motherboards april 2 2018 intel released additional desktop core i3 i5 i7 pentium gold celeron cpus first six-core core i7 i9 mobile cpus hyper-threaded four-core core i5 mobile cpus first coffee lake ultra-power cpus intel iris plus graphics october 8 2018 intel launched 9th generation coffee lake refresh cpus eight cores avoid running thermal problems high clockspeeds intel soldered integrated heat spreader ihs cpu die instead using thermal paste core i7 i9 however core i5 still use thermal paste cpu die ihs development led intel israel processor design team haifa israel optimization kaby lake intel first launched 8th generation intel core family processors august 2017 release new 8th gen intel core i9 processor 2018 intel said would highest-performance laptop processor intel ever built coffee lake cpus built using second refinement intel 14 nm process 14 nm++ features increased transistor gate pitch lower current density higher leakage transistors allows higher peak power higher frequency expense die area idle power coffee lake marks shift number cores intel mainstream desktop processors first update previous ten-year history intel core cpus 8th generation mainstream desktop i7 cpus feature six cores 12 threads i5 cpus feature six single-threaded cores i3 cpus feature four single-threaded cores 9th generation intel core i9 branding made debut mainstream desktop describing cpus 8 cores 16 threads 9th generation i7s feature 8 single-threaded cores marking first time desktop core i7s featured intel hyper-threading technology 9th generation i5 cpus feature six single-threaded cores like 8th generation predecessors ninth generation core series includes hardware fixes meltdown v3 l1 terminal fault 300 series chipsets using physically identical lga 1151 socket 100 200 series chipsets officially compatible coffee lake cpus meaning older motherboards officially support coffee lake processors 300 series motherboards officially support skylake kaby lake processors enthusiast z370 rebranded z270 launched alongside first coffee lake cpus october 2017 officially supported chipset mainstream cpus full lineup cpus revealed april 2018 accompanied lower-end h310 b360 h370 q370 chipsets home business users z390 chipset launched alongside release 9th generation cpus supporting 8th 9th generation mainstream desktop parts b365 chipset added later 9th generation xeons need motherboards chipset c246 coffee lake features largely cpu core performance per mhz skylake/kaby lake features specific coffee lake include august 8 2017 intel announced new eighth generation processors would revealed following august 21 intel previous changes product generations coincided new microarchitectures unclear generally expected eighth core generation products would based new coffee lake microarchitecture however officially announced august 21 2017 intel stated eighth generation would based multiple microarchitectures including kaby lake coffee lake cannon lake additional core resources mid-range eighth-generation coffee lake desktop chips offer significant gains performance versus previous seventh-generation intel cpus multi-threaded workloads however architecture delivers noipc difference skylake kaby lake processors mark first time intel released mainstream consumer cpus support 128gb ram nowiki /nowiki various reviews show core i7-8700k cpu may consume 110w load first 9th generation coffee lake cpus released fourth quarter 2018 include hardware mitigations certain meltdown/spectre vulnerabilities main differences 8th generation besides increased frequency even though f suffix cpus lack integrated gpu intel set price cpus featureful counterparts nowiki /nowiki various reviews show core i9-9900k cpu may consume 140w load | [
3459,
5380,
3973,
8325,
9095,
5386,
9611,
4108,
9741,
5649,
6033,
5523,
6804,
7313,
4886,
8851,
3352,
9111,
9500,
10658,
10019,
2088,
10669,
9391,
10675,
4276,
1461,
10548,
2237,
5309,
8125,
8126,
833,
6339,
5444,
9541,
1998,
2638,
977,
2... | Train |
5,884 | 4 | HTTP_POST_flood:http post flood http post flood simply post flood denial service attack uses post requests part hypertext transfer protocol http one kind http flood attack late 2013 post floods increasingly launched mobile devices | [
4498,
4797
] | Test |
5,885 | 9 | Generalized_algebraic_data_type:generalized algebraic data type functional programming generalized algebraic data type gadt also first-class phantom type guarded recursive datatype equality-qualified type generalization parametric algebraic data types gadt product constructors called data constructors haskell provide explicit instantiation adt type instantiation return value allows defining functions advanced type behaviour data constructor haskell 2010 return value type instantiation implied instantiation adt parameters constructor application -- parametric adt gadt data list nil cons list integers cons 12 cons 107 nil -- type integers list int strings cons boat cons dock nil -- type strings list string -- gadt data expr eval expr eval e case e expr1 eequal eint 2 eint 3 -- type expr1 expr bool ret eval expr1 -- ret false currently implemented ghc compiler non-standard extension used among others pugs darcs ocaml supports gadt natively since version 4.00 ghc implementation provides support existentially quantified type parameters local constraints early version generalized algebraic data types described based pattern matching alf generalized algebraic data types introduced independently prior extensions ml haskell algebraic data types essentially equivalent similar inductive families data types inductive datatypes found coq calculus inductive constructions dependently typed languages modulo dependent types except latter additional positivity restriction enforced gadts type inference absence programmer supplied type annotations undecidable functions defined gadts admit principal types general type reconstruction requires several design trade-offs area active research applications gadts include generic programming modelling programming languages higher-order abstract syntax maintaining invariants data structures expressing constraints embedded domain-specific languages modelling objects important application gadts embed higher-order abstract syntax type safe fashion embedding simply typed lambda calculus arbitrary collection base types tuples fixed point combinator type safe evaluation function factorial function written would run problems using regular algebraic data types dropping type parameter would made lifted base types existentially quantified making impossible write evaluator type parameter would still restricted single base type furthermore ill-formed expressions codice_1 would possible construct type incorrect using gadt well-formed analogue codice_2 type codice_3 codice_4 inferred type codice_5 data constructor | [
4101,
5783,
11674,
4769,
10145,
3876,
5796,
4134,
4392,
11574,
8251,
6332,
6087,
3926,
7386,
8924,
5213,
6239,
3702,
10102,
11641,
9466,
2556
] | None |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.