node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
1,486 | 1 | Resistance_Database_Initiative:resistance database initiative hiv resistance response database initiative rdi not-for-profit organisation established 2002 following mission improve clinical management hiv infection developing large clinical database bioinformatic techniques predict accurately individual response combination hiv drugs rdi following specific goals rdi consists small executive group based uk international advisory group leading hiv/aids scientists clinicians extensive global network collaborators data contributors human immunodeficiency virus hiv virus causes acquired immunodeficiency syndrome aids condition immune system begins fail leading life-threatening opportunistic infections approximately 25 hiv ‘ antiretroviral ’ drugs approved treatment hiv infection six different classes based point hiv life-cycle act used combination typically 3 drugs 2 different classes form therapy known highly active antiretroviral therapy haart aim therapy suppression virus low ideally undetectable levels blood prevents virus depleting immune cells preferentially attacks cd4 cells prevents delays illness death despite expanding availability drugs impact use treatments continue fail often involving development resistance drug therapy low-level virus replication still occurs particularly patient misses dose hiv makes errors copying genetic material mutation makes virus resistant one drugs may begin replicate successfully presence drug undermine effect treatment happens treatment needs changed re-establish control virus well-resourced healthcare settings treatment fails resistance test may run predict drugs patient virus resistant type test common use genotype test detects mutations viral genetic code information typically interpreted using rules equating individual mutations resistance individual drugs however many different interpretation systems available always agree systems provide categorical results resistant sensitive intermediate necessarily relate well patient respond combination drugs clinic rdi established 2002 pioneer new approach develop computational models using wide range laboratory clinical data collected thousands patients treated haart world use models predict individual patient respond different combinations drugs key success approach collection large amounts data train models use data wide heterogeneous range sources possible maximise generalisability models ’ predictions order achieve rdi set involve many clinics worldwide possible single repository data required attempt avoid unnecessary duplication effort competition january 2019 rdi collected data approximately 250,000 patients dozens clinics 30 countries probably largest database kind world data includes demographic information patient multiple determinations amount virus patient bloodstream cd4 cells counts white blood cell critical function immune system hiv targets destroys genetic code patients virus details drugs used treat patient rdi used data conduct extensive research order develop accurate system possible prediction treatment response research involved development comparison different computational modelling methods including artificial neural networks support vector machines random forests logistical regression predictions rdi models historically correlated well actual changes virus load patients clinic typically achieving correlation co-efficient 0.7 recent models predicted whether combination treatment reduce level virus patient bloodstream undetectable levels accuracy approximately 80 significantly better using genotype rules-based interpretation october 2010 following clinical testing two multinational studies rdi made experimental hiv treatment response prediction system hiv-treps available internet january 2011 two clinical studies published indicating use hiv-treps system could lead clinical economic benefits studies conducted expert hiv physicians us canada italy showed use system associated changes treatment decision combinations involving fewer drugs overall predicted result better virological responses suggesting use system could potentially improve patient outcomes reduce overall number cost drugs used clinics resource-limited settings often unable afford genotyping rdi developed models predict treatment response without need genotype small loss accuracy july 2011 rdi made models available part hiv-treps system version aimed particularly resource-limited settings genotyping often routinely available recent models trained largest dataset far achieved 80 accuracy comparable models use genotype predictions significantly accurate genotyping rules-based interpretation hiv-treps use approximately 90 countries tool predict virological response therapy avoid treatment failure system expanded enable physicians include local drug costs modelling recent study data indian cohort demonstrated system able identify combinations three locally available drugs higher probability success regimen prescribed clinic including cases treatment used clinic failed moreover cases alternatives less costly regimen used clinic suggesting system could help avoid treatment failure also reduce costs cohorts peter reiss ard van sighem athena netherlands julio montaner richard harrigan bc center excellence hiv aids canada tobias rinke de wit raph hamers kim sigaloff paser-m cohort netherlands brian agan vincent marconi scott wegner us department defense wataru sugiura national institute health japan maurizio zazzi master italy rolf kaiser eugen schuelter arevir cohort köln germany adrian streinu-cercel national institute infectious diseases prof.dr matei balş bucharest romania gerardo alvarez-uria vfhcs india maria-jesus perez-elias coris spain tulio de oliveira saturn south africa clinics jose gatell elisa lazzari university hospital barcelona spain brian gazzard mark nelson anton pozniak sundhiya mandalia chelsea westminster hospital london uk colette smith royal free hospital london uk lidia ruiz bonaventura clotet fundacion irsi caixa badelona spain schlomo staszewski hospital johann wolfgang goethe-university frankfurt germany carlo torti university brescia italy h clifford lane julia metcalf catherine rehm national institutes health clinic rockville usa maria-jesus perez-elias instituto ramón cajal de investigación sanitaria madrid spain stefano vella gabrielle dettorre sapienza university rome italy andrew carr richard norris karl hesse immunology b ambulatory care service st. vincent hospital sydney nsw australia dr emanuel vlahakis taylor square private clinic darlinghurst nsw australia hugo tempelman roos barth ndlovu care group elandsdoorn south africa robin wood carl morrow dolphina cogill desmond tutu hiv centre university cape town south africa chris hoffmann aurum institute johannesburg south africa johns hopkins university boston usa luminita ene “ dr victor babes ” hospital infectious tropical diseases bucharest romania gordana dragovic university belgrade belgrade serbia ricardo diaz cecilia sucupira federal university são paulo são paulo brazil omar sued carina cesar fundación huésped buenos aires argentina juan sierra madero instituto nacional de ciencias medicas nutricion salvador zubiran mexico city mexico pachamuthu balakrishnan shanmugam saravanan yrg care chennai india clinical trials sean emery david cooper crest carlo torti genpherex john baxter gart mdr laura monno carlo torti phengen jose gatell bonventura clotet havana gaston picchio marie-pierre debethune duet 1 2 power 3 maria-jesus perez-elias realvirfen sean emery paul khabo lotty ledwaba phidisa | [] | None |
1,487 | 2 | Dotum:dotum dotum korean truetype sans-serif font latin shape similar helvetica version 5.00 font provided part windows vista windows 7 windows 8 windows server 2008 | [
2593,
4130,
9539,
7973,
8422,
4138,
4141,
6797,
3538,
4146,
4148,
8374,
9654,
4127
] | Test |
1,488 | 9 | Smn_theorem:smn theorem computability theory theorem also called translation lemma parameter theorem parameterization theorem basic result programming languages generally gödel numberings computable functions soare 1987 rogers 1967 first proved stephen cole kleene 1943 name comes occurrence subscript n superscript original formulation theorem see practical terms theorem says given programming language positive integers n exists particular algorithm accepts input source code program n free variables together values algorithm generates source code effectively substitutes values first free variables leaving rest variables free basic form theorem applies functions two arguments nies 2009 p. 6 given gödel numbering formula_1 recursive functions primitive recursive function two arguments following property every gödel number p partial computable function f two arguments expressions formula_2 formula_3 defined combinations natural numbers x values equal combination words following extensional equality functions holds every x generally n 0 exists primitive recursive function formula_5 1 arguments behaves follows every gödel number p partial computable function n arguments values x … x function described taken formula_7 given arities formula_8 formula_9 every turing machine formula_10 arity formula_11 possible values inputs formula_12 exists turing machine formula_13 arity formula_9 furthermore turing machine formula_16 allows formula_17 calculated formula_18 formula_19 denoted formula_20 informally formula_16 finds turing machine formula_13 result hardcoding values formula_19 formula_10 result generalizes turing complete computing model following lisp code implements lisp example evaluates | [
10616,
10953,
8262,
11014
] | Test |
1,489 | 3 | EVEX_prefix:evex prefix evex prefix enhanced vector extension corresponding coding scheme extension 32-bit x86 ia-32 64-bit x86-64 amd64 instruction set architecture evex based confused mvex prefix used knights corner processor evex scheme 4-byte extension vex scheme supports avx-512 instruction set allows addressing new 512-bit zmm registers new 64-bit operand mask registers evex coding address 8 operand mask registers 16 general-purpose registers 32 vector registers 64-bit mode otherwise 8 general-purpose 8 vector support 4 operands like vex coding scheme evex prefix unifies existing opcode prefixes escape codes memory addressing operand length modifiers x86 instruction set following features carried vex scheme evex also extends vex additional capabilities example evex encoding scheme allows conditional vector addition form k1 modifier next destination operand encodes use opmask register k1 conditional processing updates destination z modifier encoded evex.z provides two types masking merging zeroing merging default modifier attached evex coding scheme uses code prefix consisting 4 bytes first byte always 62h derives unused opcode 32-bit bound instruction supported 64-bit mode modr/m byte specifies addressing source register mod r/m fields encode either 8 registers 24 addressing modes destination register encoded reg field base-plus-index scale-plus-index addressing require sib byte encodes 2-bit scale factor well 3-bit index 3-bit base registers certain sib encodings disp32 contains displacements need added base address evex prefix retains fields introduced vex prefix new functions existing fields several new bit fields encoding evex prefix follows following table lists allowed register addressing combinations bit 4 always zero encoding 16 general purpose registers | [
833,
2821,
9095,
5356,
5358,
10383,
499
] | Test |
1,490 | 0 | Probabilistic_context-free_grammar:probabilistic context-free grammar grammar theory model symbol strings originated work computational linguistics aiming understand structure natural languages probabilistic context free grammars pcfgs applied probabilistic modeling rna structures almost 40 years introduced computational linguistics pcfgs extend context-free grammars similar hidden markov models extend regular grammars production assigned probability probability derivation parse product probabilities productions used derivation probabilities viewed parameters model large problems convenient learn parameters via machine learning probabilistic grammar validity constrained context training dataset pcfgs application areas diverse natural language processing study structure rna molecules design programming languages designing efficient pcfgs weigh factors scalability generality issues grammar ambiguity must resolved grammar design affects results accuracy grammar parsing algorithms various time memory requirements derivation process recursive generation strings grammar parsing finding valid derivation using automaton parse tree alignment grammar sequence example parser pcfg grammars pushdown automaton algorithm parses grammar nonterminals left right stack-like manner brute-force approach efficient rna secondary structure prediction variants cocke–younger–kasami cyk algorithm provide efficient alternatives grammar parsing pushdown automata another example pcfg parser stanford statistical parser trained using treebank similar cfg probabilistic context-free grammar defined quintuple pcfgs models extend context-free grammars way hidden markov models extend regular grammars inside-outside algorithm analogue forward-backward algorithm computes total probability derivations consistent given sequence based pcfg equivalent probability pcfg generating sequence intuitively measure consistent sequence given grammar inside-outside algorithm used model parametrization estimate prior frequencies observed training sequences case rnas dynamic programming variants cyk algorithm find viterbi parse rna sequence pcfg model parse likely derivation sequence given pcfg context-free grammars represented set rules inspired attempts model natural languages rules absolute typical syntax representation known backus–naur form production rules consist terminal formula_2 non-terminal symbols blank formula_3 may also used end point production rules cfg pcfg left side one nonterminal whereas right side string terminal nonterminals pcfg nulls excluded example grammar grammar shortened using '| 'or character terminals grammar words grammar rules non-terminal symbol transformed string either terminals and/or non-terminals grammar read beginning non-terminal emission generate either formula_3 derivation ambiguous grammar may result ambiguous parsing applied homographs since word sequence one interpretation pun sentences newspaper headline iraqi head seeks arms example ambiguous parses one strategy dealing ambiguous parses originating grammarians early pāṇini add yet rules prioritize one rule takes precedence others however drawback proliferating rules often point become difficult manage another difficulty overgeneration unlicensed structures also generated probabilistic grammars circumvent problems ranking various productions frequency weights resulting likely winner-take-all interpretation usage patterns altered diachronic shifts probabilistic rules re-learned thus updating grammar assigning probability production rules makes pcfg probabilities informed observing distributions training set similar composition language modeled samples broad language probabilistic grammars probabilities estimated data typically outperform hand-crafted grammars cfgs contrasted pcfgs applicable rna structure prediction incorporate sequence-structure relationship lack scoring metrics reveal sequence structural potential weighted context-free grammar wcfg general category context-free grammar production numeric weight associated weight specific parse tree wcfg product sum rule weights tree rule weight included often rule used tree special case wcfgs pcfgs weights logarithms probabilities extended version cyk algorithm used find lightest least-weight derivation string given wcfg tree weight product rule weights wcfgs pcfgs express set probability distributions energy minimization pcfg provide ways predicting rna secondary structure comparable performance however structure prediction pcfgs scored probabilistically rather minimum free energy calculation pcfg model parameters directly derived frequencies different features observed databases rna structures rather experimental determination case energy minimization methods types various structure modeled pcfg include long range interactions pairwise structure nested structures however pseudoknots modeled pcfgs extend cfg assigning probabilities production rule maximum probability parse tree grammar implies maximum probability structure since rnas preserve structures primary sequence rna structure prediction guided combining evolutionary information comparative sequence analysis biophysical knowledge structure plausibility based probabilities also search results structural homologs using pcfg rules scored according pcfg derivations probabilities therefore building grammar model behavior base-pairs single-stranded regions starts exploring features structural multiple sequence alignment related rnas grammar generates string outside-in fashion basepair furthest extremes terminal derived first string formula_9 derived first generating distal sides moving inwards pcfg model extendibility allows constraining structure prediction incorporating expectations different features rna expectation may reflect example propensity assuming certain structure rna however incorporation much information may increase pcfg space memory complexity desirable pcfg-based model simple possible every possible string grammar generates assigned probability weight formula_11 given pcfg model formula_12 follows sum probabilities possible grammar productions formula_13 scores paired unpaired residue explain likelihood secondary structure formations production rules also allow scoring loop lengths well order base pair stacking hence possible explore range possible generations including suboptimal structures grammar accept reject structures based score thresholds rna secondary structure implementations based pcfg approaches utilized different implementation approaches exist example pfold used secondary structure prediction group related rna sequences covariance models used searching databases homologous sequences rna annotation classification rnapromo cmfinder teiser used finding stable structural motifs rnas pcfg design impacts secondary structure prediction accuracy useful structure prediction probabilistic model based pcfg maintain simplicity without much compromise prediction accuracy complex model excellent performance single sequence may scale grammar based model able resulting multiple parse trees per grammar denotes grammar ambiguity may useful revealing possible base-pair structures grammar however optimal structure one one one correspondence parse tree secondary structure two types ambiguities distinguished parse tree ambiguity structural ambiguity structural ambiguity affect thermodynamic approaches optimal structure selection always basis lowest free energy scores parse tree ambiguity concerns existence multiple parse trees per sequence ambiguity reveal possible base-paired structures sequence generating possible parse trees finding optimal one case structural ambiguity multiple parse trees describe secondary structure obscures cyk algorithm decision finding optimal structure correspondence parse tree structure unique grammar ambiguity checked conditional-inside algorithm probabilistic context free grammar consists terminal nonterminal variables feature modeled production rule assigned probability estimated training set rna structures production rules recursively applied terminal residues left starting non-terminal formula_14 produces loops rest grammar proceeds parameter formula_15 decide whether loop start stem single stranded region parameter formula_16 produces paired bases formalism simple pcfg looks like application pcfgs predicting structures multi-step process addition pcfg incorporated probabilistic models consider rna evolutionary history search homologous sequences databases evolutionary history context inclusion prior distributions rna structures structural alignment production rules pcfg facilitates good prediction accuracy summary general steps utilizing pcfgs various scenarios several algorithms dealing aspects pcfg based probabilistic models rna structure prediction exist instance inside-outside algorithm cyk algorithm inside-outside algorithm recursive dynamic programming scoring algorithm follow expectation-maximization paradigms computes total probability derivations consistent given sequence based pcfg inside part scores subtrees parse tree therefore subsequences probabilities given pcfg outside part scores probability complete parse tree full sequence cyk modifies inside-outside scoring note term 'cyk algorithm describes cyk variant inside algorithm finds optimal parse tree sequence using pcfg extends actual cyk algorithm used non-probabilistic cfgs inside algorithm calculates formula_20 probabilities formula_21 parse subtree rooted formula_22 subsequence formula_23 outside algorithm calculates formula_24 probabilities complete parse tree sequence root excluding calculation formula_23 variables refine estimation probability parameters pcfg possible reestimate pcfg algorithm finding expected number times state used derivation summing products divided probability sequence given model formula_11 also possible find expected number times production rule used expectation-maximization utilizes values cyk algorithm calculates formula_27 find probable parse tree formula_28 yields formula_29 memory time complexity general pcfg algorithms rna structure predictions formula_30 formula_31 respectively restricting pcfg may alter requirement case database searches methods covariance models cms special type pcfgs applications database searches homologs annotation rna classification cms possible build pcfg-based rna profiles related rnas represented consensus secondary structure rna analysis package infernal uses profiles inference rna alignments rfam database also uses cms classifying rnas families based structure sequence information cms designed consensus rna structure cm allows indels unlimited length alignment terminals constitute states cm transition probabilities states 1 indels considered grammars cm follows model 6 possible states state grammar includes different types secondary structure probabilities non-terminals states connected transitions ideally current node states connect insert states subsequent node states connect non-insert states order allow insertion one base insert states connect order score cm model inside-outside algorithms used cms use slightly different implementation cyk log-odds emission scores optimum parse tree formula_38 calculated emitting states formula_39 since scores function sequence length discriminative measure recover optimum parse tree probability score- formula_40 reached limiting maximum length sequence aligned calculating log-odds relative null computation time step linear database size algorithm memory complexity formula_41 kh-99 algorithm knudsen hein lays basis pfold approach predicting rna secondary structure approach parameterization requires evolutionary history information derived alignment tree addition probabilities columns mutations grammar probabilities observed training dataset structural alignment probabilities unpaired bases columns paired bases columns independent columns counting bases single base positions paired positions one obtains frequencies bases loops stems basepair occurrence formula_42 also counted occurrence formula_43 identical basepairs formula_44 counted twice pairing sequences possible ways overall mutation rates estimated order recover plausible mutations sequence identity threshold used comparison similar sequences approach uses 85 identity threshold pairing sequences first single base positions differences -except gapped columns- sequence pairs counted position two sequences different bases count difference incremented sequence unpaired bases 4 x 4 mutation rate matrix used satisfies mutation flow x reversible basepairs 16 x 16 rate distribution matrix similarly generated pcfg used predict prior probability distribution structure whereas posterior probabilities estimated inside-outside algorithm likely structure found cyk algorithm calculating column prior probabilities alignment probability estimated summing possible secondary structures column secondary structure formula_48 sequence length formula_49 scored respect alignment tree mutational model prior distribution given pcfg formula_50 phylogenetic tree calculated model maximum likelihood estimation note gaps treated unknown bases summation done dynamic programming structure grammar assigned production probabilities devised structures training dataset prior probabilities give weight predictions accuracy number times rule used depends observations training dataset particular grammar feature probabilities written parenthesis grammar formalism rule total 100 instance given prior alignment frequencies data likely structure ensemble predicted grammar computed maximizing formula_58 cyk algorithm structure highest predicted number correct predictions reported consensus structure pcfg based approaches desired scalable general enough compromising speed accuracy needs minimal possible pfold addresses limitations kh-99 algorithm respect scalability gaps speed accuracy whereas pcfgs proved powerful tools predicting rna secondary structure usage field protein sequence analysis limited indeed size amino acid alphabet variety interactions seen proteins make grammar inference much challenging consequence applications formal language theory protein analysis mainly restricted production grammars lower expressive power model simple functional patterns based local interactions since protein structures commonly display higher-order dependencies including nested crossing relationships clearly exceed capabilities cfg still development pcfgs allows expressing dependencies providing ability model wider range protein patterns one main obstacles inferring protein grammar size alphabet encode 20 different amino acids proposed address using physico-chemical properties amino acids reduce significantly number possible combinations right side symbols production rules 3 levels quantitative property utilised instead 20 amino acid types e.g small medium large van der waals volume based scheme pcfgs produced generate binding site helix-helix contact site descriptors significant feature grammars analysis rules parse trees provide biologically meaningful information | [
10560,
1890,
7780,
8262,
3947,
2316,
5399,
3608,
4350
] | Test |
1,491 | 4 | Hydra_(software):hydra software hydra parallized network logon cracker hydra supports many common login protocols like forms websites ftp smb pop3 imap mysql vnc ssh many others sample output debian environment | [
6916,
7364,
10341,
5612,
7022,
7983,
5492,
4373,
2045
] | None |
1,492 | 7 | BioBIKE:biobike biobike nee biolingua cloud-based through-the-web programmable paas symbolic biocomputing bioinformatics platform aims make computational biology especially intelligent biocomputing application artificial intelligence computational biology accessible research scientists expert programmers biobike integrated symbolic biocomputing bioinformatics platform built start entirely called cloud-based architecture computing done remote servers user access accomplished web browsers biobike built-in frame system objects data knowledge represented enables code written either native lisp visual programming language systems rules expressed snark theorem prover access whole biological knowledge integrated manner time released 2002 unique permitting users create fully functional biocomputing programs run back-end servers entirely web browser ui modern terms one first paas platform service systems predating even salesforce capability initially programming carried raw lisp jeff elhai team vcu nsf funding created entirely graphical programming environment top biobike based upon boxer-style programming environments multi-headed multi-threaded multi-user multi-tenancy cloud-based system biobike users able directly work together web browsers remotely sharing listener memory space permitted unique sort collaboration discussed shrager 2007 specialized offshoot biobike called biodeducta includes sri snark theorem prover offering unique deductive biocomputing capabilities biobike open-source software implemented using lisp programming language continuing development takes place biobike team centered virginia commonwealth university biobike originally called biolingua developed jeff shrager carnegie inst washington dept plant biology jp massar funding nasa astrobiology division shrager massar wanted create web-based multi-user lisp machine specialized bioinformatics early contributors project included mike travers jeff elhai vcu elhai obtained continuing funding national science foundation project renamed biobike elhai colleagues added biobike unique visual programming language shrager meanwhile collaborated richard waldinger sri build sri snark theorem prover biobike creating deductive biocomputing system called biodeducta used number biobike verticals different biological domains including viral pathogens cyanobacteria bacteria arabidopsis thaliana several others described references | [
4194,
2691,
6502,
7983,
5397
] | Test |
1,493 | 4 | CCNA:ccna ccna cisco certified network associate information technology certification cisco systems ccna certification associate-level cisco career certification cisco exams changed several times response changing trends 2013 cisco announced update certification program aligns certification training curricula evolving industry job roles several different types cisco-certified network associate ccna routing switching closest original ccna focus types ccna focus security cloud collaboration security operations design data center technologies industrial plants service providers wireless content exams proprietary cisco learning partners offer variety different training methods including books published cisco press online classroom courses available title interconnecting cisco network devices achieve ccna routing switching certification one must earn passing score cisco exam 200-125 combined passing scores interconnecting cisco network devices 1 icnd1 100-105 interconnecting cisco network devices 2 icnd2 200-105 exams passing icnd1 exam grants candidate cisco certified entry networking technician ccent certification completion exam candidates receive score report along score breakout exam section passing score given exam 200-125 ccna composite exam associated cisco certified network associate routing switching certification exam tests candidate knowledge skills required install operate troubleshoot small medium size enterprise branch network topics include connecting wan implementing network security network types network media routing switching fundamentals tcp/ip osi models ip addressing wan technologies operating configuring ios devices extending switched networks vlans determining ip routes managing ip traffic access lists establishing point-to-point connections receive ccna certification one must pass either prerequisites take ccna routing switching certification exam also starting points networking licenses ccent cct ten tracks associate certifications cisco career certifications feb/2020 would updated eleven tracks including cisco certified devnet associate ccda ccna cloud ccna collaboration ccna cyber ops ccna data center ccna industrial ccna routing switching ccna security ccna service provider ccna wireless ccna routing switching validity ccna certification 3 years renewal requires certification holders register pass higher level cisco recertification exam every 3 years | [
10307,
357,
8613,
9607,
7336,
8462,
6834,
5010,
6105,
316,
10717
] | Test |
1,494 | 4 | Reflected_DOM_Injection:reflected dom injection reflected dom injection rdi evasive xss technique uses third party website construct execute attack technique implemented websites use user-provided url part service e.g translation services caching services etc order implement technique using technique exploit triggered user followed expected flow accessed website using third party service code however would execute browsing directly attacker ’ website figure 1 describes direct access website uses rdi technique exploit user ’ browser accessing website directly exploit remained encrypted content sent client machine remains benign figure 2 describes attack scenario user accesses website uses rdi technique using third party service service creates new connection attacker ’ website receives content manipulates order provide service delivers new modified content user manipulation done service turns attacker ’ page malicious one helping generate key required decrypt malicious code rdi technique actually uses third party service create malicious content rdi technique provides following benefits rdi technique first presented defcon 21 daniel chechik anat davidi full scenario technique described paper published following conference trustwave spiderlabs blog ... site reliable | [
3473,
3629,
4198
] | Test |
1,495 | 4 | Distributed_Checksum_Clearinghouse:distributed checksum clearinghouse distributed checksum clearinghouse also referred dcc hash sharing method spam email detection basic logic dcc spam mails sent many recipients message body appearing many times therefore bulk email dcc identifies bulk email taking checksum sending checksum clearinghouse server server responds number times received checksum individual email create score 1 time processed bulk mail identified response number high content examined dcc works udp protocol uses little bandwidth dcc resistant hashbusters main dcc checksums fuzzy ignore aspects messages fuzzy checksums changed spam evolves dcc likely identify mailing lists bulk email unless white listed likewise repeatedly sending email server increases number server therefore likelihood treated spam others according official dcc website dcc based idea paul vixie fuzzy body matching reject spam corporate firewall operated vernon schryver starting 1997 dcc designed written rhyolite software starting 2000 used production since winter 2000/2001 | [
1667,
8202,
7949,
914,
5012,
11413,
10263,
8093,
8224,
10275,
8747,
8373,
4294,
3145,
3032,
9053,
6762,
1899,
4725
] | Test |
1,496 | 4 | Electronic_signature:electronic signature electronic signature e-signature refers data electronic form logically associated data electronic form used signatory sign type signature provides legal standing handwritten signature long adheres requirements specific regulation created e.g. eidas european union nist-dss usa zertes switzerland electronic signatures legal concept distinct digital signatures cryptographic mechanism often used implement electronic signatures electronic signature simple name entered electronic document digital signatures increasingly used e-commerce regulatory filings implement electronic signatures cryptographically protected way standardization agencies like nist etsi provide standards implementation e.g. nist-dss xades pades concept new common law jurisdictions recognized telegraph signatures far back mid-19th century faxed signatures since 1980s electronic signature intended provide secure accurate identification method signatory provide seamless transaction definitions electronic signatures vary depending applicable jurisdiction common denominator countries level advanced electronic signature requiring electronic signatures may created increasing levels security set requirements means creation various levels prove validity signature provide even stronger probative value described advanced electronic signature countries like european union switzerland introduced qualified electronic signature difficult challenge authorship statement signed qualified electronic signature statement non-repudiable technically qualified electronic signature implemented advanced electronic signature utilizes digital certificate encrypted security signature-creating device authenticated qualified trust service provider since well american civil war began 1861 morse code used send messages electrically telegraphy messages agreements terms intended enforceable contracts early acceptance enforceability telegraphic messages electronic signatures came new hampshire supreme court 1869 1980s many companies even individuals began using fax machines high-priority time-sensitive delivery documents although original signature original document paper image signature transmission electronic courts various jurisdictions decided enforceable electronic signatures include agreements made email entering personal identification number pin bank atm signing credit debit slip digital pen pad device application graphics tablet technology point sale installing software clickwrap software license agreement package signing electronic documents online first agreement signed electronically two sovereign nations joint communiqué recognizing growing importance promotion electronic commerce signed united states ireland 1998 1996 united nations published uncitral model law electronic commerce article 7 uncitral model law electronic commerce highly influential development electronic signature laws around world including us 2001 uncitral concluded work dedicated text uncitral model law electronic signatures adopted 30 jurisdictions latest uncitral text dealing electronic signatures article 9 paragraph 3 united nations convention use electronic communications international contracts 2005 establishes mechanism functional equivalence electronic handwritten signatures international level well cross-border recognition canadian law pipeda attempts clarify situation first defining generic electronic signature signature consists one letters characters numbers symbols digital form incorporated attached associated electronic document defining secure electronic signature electronic signature specific properties pipeda secure electronic signature regulations refine definition digital signature applied verified specific manner european union eu regulation 910/2014 electronic identification trust services electronic transactions european internal market eidas sets legal frame electronic signatures repeals directive 1999/93/ec current applicable version eidas published european parliament european council july 23 2014 following article 25 1 eidas regulation advanced electronic signature shall “ denied legal effect admissibility evidence legal proceedings however reach higher probative value enhanced level qualified electronic signature requiring use qualified electronic signature creation device based certificate issued qualified trust service provider upgraded advanced signature carries according article 25 2 eidas regulation legal value handwritten signature however regulated european union similarly zertes switzerland qualified electronic signature defined united states u.s. code defines electronic signature purpose us law electronic sound symbol process attached logically associated contract record executed adopted person intent sign record may electronic transmission document contains signature case facsimile transmissions may encoded message telegraphy using morse code united states definition qualifies electronic signature wide set uniform electronic transactions act ueta released national conference commissioners uniform state laws nccusl 1999 influenced aba committee white papers uniform law promulgated nccusl ueta term means electronic sound symbol process attached logically associated record executed adopted person intent sign record definition many core concepts ueta echoed u.s. esign act 2000 47 us states district columbia us virgin islands enacted ueta new york washington state illinois enacted ueta states adopted electronic signatures statute various laws passed internationally facilitate commerce use electronic records signatures interstate foreign commerce intent ensure validity legal effect contracts entered electronically instance digital signatures cryptographic implementations electronic signatures used proof authenticity data integrity non-repudiation communications conducted internet implemented compliance digital signature standards digital signing offer end-to-end privacy signing process user-friendly secure digital signatures generated verified standardized frameworks digital signature algorithm dsa nist compliance xades pades cades standards specified etsi typically three algorithms involved digital signature process process digital signing requires signature generated fixed message private key authenticated accompanied public key using cryptographic algorithms user ’ signature replicated without access private key secure channel typically required applying asymmetric cryptography methods digital signature process prevents several common attacks attacker attempts gain access following attack methods relevant standards digital signatures respect size domestic markets digital signature standard dss national institute standards technology nist eidas regulation enacted european parliament openpgp non-proprietary protocol email encryption public key cryptography supported pgp gnupg s/mime ietf standards evolved popular email encryption standard world electronic signature may also refer electronic forms processing verifying identity use biometric signatures biologically identifying qualities individual signatures use approach attaching biometric measurement hash said measurement document evidence instance fingerprints hand geometry finger lengths palm size iris patterns even retinal patterns collected using electronic sensors kind since physical characteristics claims uniqueness among humans extent useful signature biometric measurements type useless passwords ca n't changed compromised however might serviceable electronic signatures kind except date easily spoofable carry little assurance person purportedly signed document actually person unfortunately easily spoofable replay electronic signal produced submitted computer system responsible 'affixing signature document wiretapping techniques often suffice particular case fingerprints japanese professor graduate students managed spoof commercially available fingerprint readers available ordinary kitchen chemistry gummy bear candy gel little ingenuity actual fingers needed successfully spoof every reading device another example researchers vietnam successfully demonstrated late 2017 specially crafted mask could beat apple face id program iphone x | [
2050,
517,
10378,
9744,
1297,
8859,
3231,
7075,
5674,
4015,
5433,
8634,
3264,
6222,
5200,
8018,
8283,
8674,
3944,
9576,
3574,
9334,
510
] | Test |
1,497 | 3 | PDOS:pdos pdos discontinued multiuser multitasking operating system written assembly language developed early 1980s eyring research institute texas instruments tms9900 processor later ported motorola 68000 processor time speed accuracy power made ideal process control used system development education industrial uses eyring also sold application programs e.g statistics package operating system | [
7269,
477,
7983
] | Test |
1,498 | 2 | Active_Directory_Rights_Management_Services:active directory rights management services active directory rights management services ad rms known rights management services rms windows server 2008 server software information rights management shipped windows server uses encryption form selective functionality denial limiting access documents corporate e-mails microsoft word documents web pages operations authorized users perform companies use technology encrypt information stored document formats policies embedded documents prevent protected content decrypted except specified people groups certain environments certain conditions certain periods time specific operations like printing copying editing forwarding deleting allowed disallowed content authors individual pieces content rms administrators deploy rms templates group rights together predefined rights applied en masse rms debuted windows server 2003 client api libraries made available windows 2000 later rights management client included windows vista later available windows xp windows 2000 windows server 2003 addition implementation ad rms office mac use rights protection os x third-party products available use rights protection android blackberry os ios windows rt april 2016 alleged attack rms implementations including azure rms published reported microsoft published code allows authorized user granted right view rms protected document remove protection preserve file formatting sort manipulation requires user granted rights decrypt content able view rights management services makes certain security assertions regarding inability unauthorized users access protected content differentiation different usage rights authorized users considered part policy enforcement capabilities microsoft claims implemented best effort considered microsoft security issue policy enforcement limitation previously rms sdk enforced signing code using rms capabilities order provide level control applications interacted rms capability later removed due limited ability restrict behaviors given possibility write applications use web services directly obtain licenses decrypt content addition using technique user granted rights view protected document manipulate content document without leaving traces manipulation since azure rms non-repudiation solution unlike document signing solutions claim provide anti-tampering capabilities since changes made users granted rights document microsoft consider later issue actual attack claimed capabilities rms researchers provide proof concept tool allow evaluation results via github rms natively supported following products third-party solutions secure islands acquired microsoft gigatrust liquid machines acquired check point add rms support following | [
11270,
5643,
4624,
537,
540,
3102,
9762,
8227,
8740,
1577,
10281,
2101,
10812,
3648,
10310,
1098,
7754,
10828,
4173,
4174,
9808,
4178,
10839,
603,
9819,
3170,
622,
9839,
4210,
7796,
1656,
6265,
7290,
4731,
10879,
8841,
653,
6797,
2193,
98... | None |
1,499 | 3 | Application-specific_instruction_set_processor:application-specific instruction set processor application-specific instruction set processor asip component used system-on-a-chip design instruction set asip tailored benefit specific application specialization core provides tradeoff flexibility general purpose cpu performance asic asips configurable instruction set usually cores divided two parts static logic defines minimum isa instruction-set architecture configurable logic used design new instructions configurable logic programmed either field similar fashion field-programmable gate array fpga chip synthesis asips used alternative hardware accelerators baseband signal processing video coding traditional hardware accelerators applications suffer inflexibility difficult reuse hardware datapath handwritten finite-state machines fsm retargetable compilers asips help designer update program reuse datapath typically asip design less dependent tool flow designing processor scratch complicated commercial tools design asips example processor designer synopsys open source tool well tta-based co-design environment tce | [
7173,
9739,
2066,
7699,
5655,
10779,
10781,
6181,
8231,
3630,
6705,
7218,
2623,
2113,
7234,
3142,
2638,
1122,
3175,
8815,
630,
8822,
6268,
3197,
7313,
6815,
8352,
5793,
6818,
6821,
7852,
9391,
2224,
2226,
7858,
9911,
8890,
4286,
2241,
224... | Test |
1,500 | 4 | Demanufacturing:demanufacturing demanufacture process product extensive usage disassembled components components classified functionality components suitable reuse returned product reuse demanufacturing proposed used industries means reduce environmental footprint preserving economic viability processes involved term first coined professor walter w. olson professor john w. sutherland 1993 case waste electronics demanufacture involves dismantling components case material demanufacture may chemical process treatment waste plastics breaking long polymers smaller polymers | [
1477,
11534,
2867,
403,
7579
] | Test |
1,501 | 3 | Backward_compatibility:backward compatibility backward compatibility property system product technology allows interoperability older legacy system input designed system especially telecommunications computing backward compatibility sometimes also called downward compatibility modifying system way allow backward compatibility sometimes called breaking backward compatibility complementary concept forward compatibility design forward-compatible usually roadmap compatibility future standards products programming jargon concept sometimes referred hysterical reasons homophone historical reasons associated benefits backward compatibility appeal existing user base inexpensive upgrade path well network effect particularly important increases value goods services proportionally size user base one example sony playstation 2 ps2 backward compatible games predecessor playstation ps1 selection ps2 games available launch small sales console nonetheless strong 2000-2001 thanks large library games preceding ps1 bought time ps2 grow large installed base developers release quality ps2 games crucial 2001 holiday season associated costs backward compatibility higher bill materials hardware required support legacy systems increased complexity product may lead longer time market technological hindrances slowing innovation increased expectations users terms compatibility notable example sony playstation 3 first ps3 iteration expensive manufacture part due including emotion engine preceding ps2 order run ps2 games since ps3 architecture completely different ps2 subsequent ps3 hardware revisions eliminated emotion engine saved production costs removing ability run ps2 titles sony found backward compatibility major selling point ps3 contrast ps2 ps3 chief competitor microsoft xbox 360 took different approach backward compatibility using software emulation order run games first xbox rather including legacy hardware original xbox quite different xbox 360 however microsoft stopped releasing emulation profiles 2007 simple example backward forward compatibility introduction fm radio stereo fm radio initially mono one audio channel represented one signal introduction two-channel stereo fm radio large number listeners mono fm receivers forward compatibility mono receivers stereo signals achieved sending sum left right audio channels one signal difference another signal allows mono fm receivers receive decode sum signal ignoring difference signal necessary separating audio channels stereo fm receivers receive mono signal decode without need second signal separate sum signal left right channels sum difference signals received without requirement backward compatibility simpler method could chosen full backward compatibility particularly important computer instruction set architectures one successful x86 family microprocessors full backward compatibility spans back 16-bit intel 8086/8088 processors introduced 1978 8086/8088 turn designed easy machine-translatability programs written predecessor mind although instruction-set compatible 8-bit intel 8080 processor 1974 zilog z80 however fully backwards compatible intel 8080 fully backwards compatible processors process binary executable software instructions predecessors allowing use newer processor without acquire new applications operating systems similarly success wi-fi digital communication standard attributed broad forward backward compatibility became popular standards backward compatible compiler backward compatibility may refer ability compiler newer version language accept programs data worked previous version data format said backward compatible predecessor every message file valid old format still valid retaining meaning new format | [
4098,
3588,
7173,
2573,
7188,
10279,
1067,
7212,
7217,
6203,
3137,
4682,
7243,
10316,
83,
8280,
1113,
1632,
2149,
7269,
10341,
4712,
10344,
2168,
5754,
6781,
7293,
639,
8829,
11390,
4228,
139,
6799,
2193,
2199,
4763,
4252,
7836,
9373,
476... | None |
1,502 | 3 | Orthogonal_instruction_set:orthogonal instruction set computer engineering orthogonal instruction set instruction set architecture instruction types use addressing modes orthogonal sense instruction type addressing mode vary independently orthogonal instruction set impose limitation requires certain instruction use specific register little overlapping instruction functionality orthogonality considered major goal processor designers 1970s vax-11 often used benchmark concept however introduction risc design philosophies 1980s significantly reversed trend towards orthogonality modern cpus often simulate orthogonality pre-processing step performing actual tasks risc-like core core general purpose computers work underlying fashion data stored main memory read central processing unit cpu acted written back memory memory consists collection data values encoded numbers referred address also numerical value means operations applied data applied addresses worked data temporarily held processor registers scratchpad values accessed quickly registers used example adding strings numbers total early computers instruction set architecture isa often used single register case known accumulator instructions included address operand instance codice_1 instruction would cause cpu retrieve number memory found address add value already accumulator simple example isa one-address format instruction includes address data one-address machines disadvantage even simple actions like addition require multiple instructions takes scarce memory requires time read consider simple task adding two numbers 5 4 case program would load value 5 accumulator codice_2 instruction use codice_1 instruction pointing address 4 finally codice_4 store result 9 back another memory location improvements found providing address operands single instruction instance codice_5 two-address format isas common one extend concept three-address format codice_6 also folded expanded codice_7 often case basic computer word much larger needed hold instruction address systems leftover bits used hold constant instead address instructions improved allow one operands replaced constant instance codice_8 eliminates one memory cycle codice_9 another complexity arises one considers common patterns memory accessed one common pattern single operation may applied across large amount similar data instance one might want add 1,000 numbers simple two-address format way change address 1,000 additions written machine language isas fix problem concept indirect addressing address next point data constant held memory means programmer change address performing addition memory location isas also often include ability offset address initial location adding value held one registers cases special index register others carry addition automatically part instructions use variety addressing modes leads profusion slightly different instructions considering one-address isa even single instruction codice_10 many possible addressing modes immediate constant codice_11 adds constant value result accumulator direct address codice_12 add value stored address 1 memory indirect codice_13 read value address 1 use value another address add value many isas also registers used addressing well math tasks used one-address format single address register used case number new modes become available register direct codice_14 add value stored address held register one displacement codice_15 add constant address register add value found memory resulting location index codice_16 add value register 1 address register make new address adds value location accumulator autoindex codice_17 index case automatically increments address orthogonality principle every instruction able use supported addressing mode example direct addressing version codice_10 available others well reason design aesthetic goal reduce total size program object code providing variety addressing modes isa allows programmer chose one precisely matches need program point thereby reduce need use multiple instructions achieve end means total number instructions reduced saving memory improving performance orthogonality often described highly bit efficient ultimate end orthogonal design simply allow instruction use type address implementing orthogonality often simply case adding wiring parts processor however also adds complexity instruction decoder circuitry reads instruction memory location pointed program counter decides process example isa outlined codice_19 instruction using direct encoding already data needs run instruction processing needed decoder simply sends value arithmetic logic unit alu however codice_20 instruction used address read value memory location read alu continue series events take much longer complete requires internal steps result time needed complete different variations instruction vary widely adds complexity overall cpu design therefore orthogonality represents tradeoff design computer designer choose offer addressing modes programmer improve code density cost making cpu complex memory small expensive especially era drum memory core memory orthogonality highly desirable however complexity often beyond could achieved using current technology reason machines 1960s offered partial orthogonality much designers could afford 1970s introduction large scale integration significantly reduced complexity computer designs fully orthogonal designs began emerge 1980s designs could implemented single-chip cpu late 1970s first high-powered fully orthogonal designs emerging goal widened become high-level language computer architecture hllca short orthogonality desired improve bit density machine language hllca goal improve bit density high-level languages like algol 68 languages generally used activation record type complex stack stored temporary values isas generally directly support implemented using many individual instructions underlying isa adding support structures would allow program translated directly isa exception floating point instructions pdp-11 strongly orthogonal every integer instruction could operate either 1-byte 2-byte integers could access data stored registers stored part instruction stored memory stored memory pointed addresses registers even pc stack pointer could affected ordinary instructions using ordinary data modes mmediate mode hardcoded numbers within instruction add 4 r1 r1 r1 4 implemented mode register indirect autoincrement specifying program counter r7 register use reference indirection autoincrement since pdp-11 octal-oriented 3-bit sub-byte machine addressing modes 0–7 registers r0–r7 electronically 8 addressing modes use stack pointer r6 program counter r7 referenceable registers 10 conceptual addressing modes available vax-11 extended pdp-11 orthogonality data types including floating point numbers instructions 'add divided data-size dependent variants addb addw addl addp addf add byte word longword packed bcd single-precision floating point respectively like pdp-11 stack pointer program counter general register file r14 r15 general form vax-11 instruction would component one byte opcode value range 0–255 operand consisting two nibbles upper 4 bits specifying addressing mode lower 4 bits usually specifying register number r0–r15 unlike octal-oriented pdp-11 vax-11 hexadecimal-oriented machine 4-bit sub-byte resulted 16 logical addressing modes 0–15 however addressing modes 0–3 short immediate immediate data 6 bits less 2 low-order bits addressing mode 2 high-order bits immediate data prepended remaining 4 bits data-addressing byte since addressing modes 0-3 identical made 13 electronic addressing modes pdp-11 use stack pointer r14 program counter r15 created total 15 conceptual addressing modes assembler program translating source code actual stack-pointer program-counter based addressing mode needed motorola designers attempted make assembly language orthogonal underlying machine language somewhat less unlike pdp-11 mc68000 68k used separate registers store data addresses data memory isa orthogonal extent addresses could used registers restriction registers could used different instructions likewise data registers also orthogonal across instructions contrast ns320xx series originally designed single-chip implementations vax-11 isa although change due legal issues resulting system retained much vax-11 overall design philosophy remained completely orthogonal included elimination separate data address registers found 68k 8-bit intel 8080 well 8085 8051 microprocessor basically slightly extended accumulator-based design therefore orthogonal assembly-language programmer compiler writer mindful operations possible register 8-bit operations could performed 8-bit accumulator a-register 16-bit operations could performed 16-bit pointer/accumulator hl-register pair whereas simple operations increment possible seven 8-bit registers largely due desire keep opcodes one byte long binary-compatible z80 later added prefix-codes escape 1-byte limit allow powerful instruction set basic idea employed intel 8086 although allow radical extensions binary -compatibility 8080 attempted maintained degree non-orthogonality sake high code density time 32-bit extension architecture introduced 80386 somewhat orthogonal despite keeping 8086 instructions extended counterparts however encoding-strategy used still shows many traces 8008 8080 z80 instance single-byte encodings remain certain frequent operations push pop registers constants primary accumulator eax register employs shorter encodings registers certain types operations observations like sometimes exploited code optimization compilers hand written code number studies 1970s demonstrated flexibility offered orthogonal modes rarely never used actual problems particular effort ibm studied traces code running system/370 demonstrated fraction available modes used actual programs similar studies often vax demonstrated pattern cases shown complexity instructions meant took longer perform sequence smaller instructions canonical example vax codice_21 instruction period semiconductor memories rapidly increasing size decreasing cost however improving speed rate meant time needed access data memory growing relative terms comparison speed cpus argued inclusion registers giving cpu temporary values work larger number registers meant bits computer word would needed encode register number suggested instructions reduced number free room finally paper andrew tanenbaum demonstrated 97 constants program 0 10 0 representing 20 30 total additionally 30 40 values program constants simple variables opposed arrays another 35 40 processor uses larger instruction word like 32-bits two constants register number encoded single instruction long instruction use many bits observations led abandonment orthogonal design primary goal processor design rise risc philosophy 1980s risc processors generally two addressing modes direct constant register modes found older processors handled explicitly using load store instructions moving data registers addressing modes may available modes may vary depending whether instruction refers data involves transfer control | [
1029,
7173,
9739,
2066,
7699,
5655,
10779,
10781,
6181,
8231,
10796,
3630,
6705,
7218,
2623,
2113,
7234,
1611,
2638,
7269,
3175,
8815,
6268,
3197,
7313,
6815,
5793,
6818,
6821,
682,
7852,
9391,
2224,
2226,
7858,
9911,
11447,
8890,
4286,
9... | Validation |
1,503 | 3 | K_computer:k computer k computer named japanese word/numeral meaning 10 quadrillion 10 supercomputer manufactured fujitsu currently installed riken advanced institute computational science campus kobe hyōgo prefecture japan k computer based distributed memory architecture 80,000 compute nodes used variety applications including climate research disaster prevention medical research k computer operating system based linux kernel additional drivers designed make use computer hardware june 2011 top500 ranked k world fastest supercomputer computation speed 8 petaflops november 2011 k became first computer top 10 petaflops originally slated completion june 2012 june 2012 k superseded world fastest supercomputer american ibm sequoia k world 20th-fastest computer ibm summit sierra fastest supercomputers k computer holds third place hpcg benchmark held first place june 2018 superseded summit sierra 20 june 2011 top500 project committee announced k set linpack record performance 8.162 petaflops making fastest supercomputer world time achieved performance computing efficiency ratio 93.0 previous record holder chinese national university defense technology tianhe-1a performed 2.507 petaflops top500 list revised semiannually rankings change frequently indicating speed computing power increasing november 2011 riken reported k become first supercomputer exceed 10 petaflops achieving linpack performance 10.51 quadrillion computations per second computing efficiency ratio 93.2 k received top ranking four performance benchmarks 2011 hpc challenge awards 18 june 2012 top500 project committee announced california-based ibm sequoia supercomputer replaced k world fastest supercomputer linpack performance 16.325 petaflops sequoia 55 faster k using 123 cpu processors also 150 energy efficient top500 list became first june 2011 falling time lower positions eighteenth november 2018 k computer holds third place hpcg benchmark test proposed jack dongarra 0.6027 hpcg pflops november 2018 k computer comprises 88,128 2.0 ghz eight-core sparc64 viiifx processors contained 864 cabinets total 705,024 cores manufactured fujitsu 45 nm cmos technology cabinet contains 96 computing nodes addition six i/o nodes computing node contains single processor 16 gb memory computer water cooling system designed minimize failure rate power consumption nodes interconnected fujitsu proprietary torus fusion tofu interconnect tofu six-dimensional mesh/torus topology scalability 100,000 nodes full-duplex links peak bandwidth 10 gb/s 5 gb/s per direction node connected interconnect controller icc chip contains four tofu interfaces one node three connecting icc chips router tofu six-dimensional mesh/torus topology abstracted software appear three-dimensional torus supported tofu-optimized version open-source open mpi message passing interface library users create application programs adapted either one- two- three-dimensional torus network system adopts two-level local/global file system parallel/distributed functions provides users automatic staging function moving files global local file systems fujitsu developed optimized parallel file system based lustre called fujitsu exabyte file system fefs scalable several hundred petabytes although k computer reported highest total power consumption 2011 top500 supercomputer 9.89 mw equivalent almost 10,000 suburban homes relatively efficient achieving 824.6 gflop/kw 29.8 efficient china nudt th mpp ranked 2 2011 225.8 efficient oak ridge jaguar-cray xt5-he ranked 3 2011 however k power efficiency still falls far short 2097.2 gflops/kwatt supercomputer record set ibm nnsa/sc blue gene/q prototype 2 comparison average power consumption top 10 system 2011 4.3 mw average efficiency 463.7 gflop/kw according top500 compiler jack dongarra professor electrical engineering computer science university tennessee k computer performance equals one million linked desktop computers computer annual running costs estimated us 10 million 1 july 2011 kobe port island line rapid transit system renamed one stations port island minami k computer mae meaning front k computer denoting vicinity | [
3328,
9762,
36,
10021,
9766,
1707,
7983,
10288,
9137,
6834,
10675,
823,
9920,
1480,
1866,
10837,
2394,
3431,
1776,
1399,
10108
] | Test |
1,504 | 4 | Careto_(malware):careto malware careto spanish mask sometimes called mask piece espionage malware discovered kaspersky lab 2014 high level sophistication professionalism target list included diplomatic offices embassies careto believed work nation state kaspersky believes creators malware spanish-speaking focus spanish-speaking victims heavy targeting morocco targeting gibraltar bruce schneier speculates careto operated spain careto normally installs second complex backdoor program called sgh sgh easily modifiable also wider arsenal including ability intercept system events file operations performing wider range surveillance features information gathered sgh careto include encryption keys virtual private network configurations ssh keys communication channels careto hard discover remove use stealth capabilities addition samples digitally signed signatures issued bulgarian company tecsystem ltd. authenticity company unknown one issued certificates valid june 28 2011 june 28 2013 another valid april 18 2013 july 18 2016 revoked verisign careto discovered made attempts circumvent kaspersky security products upon discovery careto trying exploit software kaspersky started investigate part collecting statistics multiple sinkholes placed command control servers currently up-to-date antivirus software discover successfully remove malware investigation command control servers discoveries showed 380 victims infected information uncovered victims infected malware clicking spear phishing link redirected websites software careto could exploit adobe flash player player since patched longer exploitable careto websites contained exploitable software names similar popular newspapers washington post independent malware said multiple backdoors linux mac os x windows evidence possible fourth type backdoor android ios discovered c c servers samples found estimated careto compiled far back 2007 known attacks ceased january 2014 | [
1024,
5636,
9744,
4117,
8726,
535,
9761,
4644,
4133,
3629,
7739,
1608,
3657,
8779,
4703,
8288,
8292,
10341,
107,
5749,
10875,
3711,
8320,
7809,
5764,
2187,
4240,
1688,
2717,
9375,
8865,
2213,
9904,
9395,
8886,
3789,
4304,
4314,
9435,
4830... | Train |
1,505 | 4 | Predictable_serial_number_attack:predictable serial number attack predictable serial number attack form security exploit algorithm generating serial numbers particular purpose guessed discovered reverse engineered new serial number predicted using algorithm newly generated serial number used fraudulent purpose either obtain undeserved benefit deny service legitimate holder serial number suppose phone card available sale offers telephone service entering serial number printed card alice legitimately purchases phone card order call bob card serial number 0003 attacker mallory also purchases two phone cards notices serial numbers printed phone cards 0001 0002 consuming value cards 0001 0002 mallory guesses algorithm used generating serial numbers simple sequence predicts 0003 valid serial number enters 0003 prompted gets additional phone service alice tries use card discovers value stolen worthless common approach prevent predictable serial number attacks use cryptographic hash function sha-2 generate actual serial numbers internally issuing organization creates pseudo- random nonce salt generating serial numbers keeps secret issuer increments internal serial number appends salt computed message digest used create actual serial number issuer take care prevent collisions existing values wrongly issue two identical serial numbers | [
928,
10173
] | None |
1,506 | 2 | Linux_Network_Administrator's_Guide:linux network administrator guide linux network administrator guide nag book setting running unix networks first second editions freely available electronic form gfdl originally produced olaf kirch others part linux documentation project help o'reilly second edition terry dawson released march 2000 third edition guide written tony bautts assistance gregor n. purdy february 2005 freely available like previous two versions includes following sections | [
7938,
7812,
8326,
4360,
4493,
3218,
2195,
11155,
1813,
10780,
1694,
3618,
4011,
9646,
823,
9660,
10817,
5067,
8147,
1761,
4841,
8432,
5492
] | Test |
1,507 | 7 | Cycle_Computing:cycle computing cycle computing company provides software orchestrating computing storage resources cloud environments flagship product cyclecloud supports amazon web services google compute engine microsoft azure internal infrastructure cyclecloud orchestration suite manages provisioning cloud infrastructure orchestration workflow execution job queue management automated efficient data placement full process monitoring logging within secure process flow cycle computing founded 2005 original offerings based around htcondor scheduler focused maximizing effectiveness internal resources cycle computing offered support htcondor well cycleserver provided metascheduling reporting management tools htcondor resources early customers spanned number industries including insurance pharmaceutical manufacturing academia advent large public cloud offerings cycle computing expanded tools allow customers make use dynamically provisioned cloud environments key technologies developed include ability validate resources correctly added cloud patent awarded 2015 ability easily manage data placement consistency ability support multiple cloud providers within single workflow technologies august 15 2017 microsoft announced acquisition cycle computing april 2011 cycle computing announced “ tanuki ” 10,000 core amazon web services cluster used genentech september 2011 cycle computing hpc cluster called nekomata japanese monster cat renting 1279/hour offering 30,472 processor cores 27tb memory 2pb storage unnamed pharmaceutical company used cluster 7 hours paying 9000 molecular modeling task april 2012 cycle computing announced working collaboration scientific software-writing company schrödinger screened 21 million compounds less three hours using 50,000-core cluster november 2013 cycle computing announced working collaboration scientific software-writing company schrödinger helped mark thompson professor chemistry university southern california sort 205,000 compounds search right compound build new generation inexpensive highly efficient solar panels job took less day cost 33,000 total computing cluster used 156,000 cores spread across 8 regions peak capacity 1.21 petaflops november 2014 cycle computing worked researcher hgst run hard drive simulation workload computation would taken month internal resources completed 7 hours running 70,000 cores amazon web services cost less 6,000 september 2015 cycle computing broad institute announced 50,000 core cluster run google compute engine cycle computing covered gigaom ars technica extremetech cnet phys.org cycle computing also mentioned amazon cto werner vogels 2013 day 2 keynote aws invent | [
4194,
1935,
7248,
4149,
2651
] | Test |
1,508 | 2 | Unix/NS:unix/ns unix/ns ncr 3700 operating system based unix svr4 contains significant extensions massively parallel systems particular distributed memory dbmss extensions include concepts virtual processor virtual disk message global synchronization system segment system globally distributed objects compared parallel unix operating systems like mach chorus unix/ns powerful communication message addressing paradigm richer process-group management global synchronization mechanism | [
6787,
7561,
6412,
5397,
1304,
3487,
3241,
7983,
3248,
2995,
9141,
823,
9784,
7483,
9151,
10436,
6369,
5363,
5492,
2424,
633
] | Validation |
1,509 | 6 | File_system_permissions:file system permissions file systems methods assign permissions access rights specific users groups users permissions control ability users view change navigate execute contents file system two types permissions widely used traditional unix permissions date back many decades earliest days unix universally available unix linux derived platforms access control lists acls recent origin universally used microsoft windows based file systems file system supports user permissions mainly ntfs refs also commonly used widely available common unix linux based systems although necessarily generally capable far detailed fine-tuning permissions traditional unix permissions permit system access control traditional acls provide unix linux based systems standard type acl defined posix standard posix acls variants exist nfs v3 v4 acls work slightly differently nfsv3 acls nfsv4 acls multiple systems available within operating system usually way specify used given file system system handle attempts access modify permissions controlled one using commands designed another usual solution ensure least degree awareness inter-operability different commands methods unix-like otherwise posix-compliant systems including linux-based systems macos versions simple system managing individual file permissions article called traditional unix permissions systems also support kind access control lists acls either proprietary old hp-ux acls example posix.1e acls based early posix draft withdrawn 1997 nfsv4 acls part nfsv4 standard microsoft ibm dos variants including ms-dos pc dos windows 95 windows 98 windows 98 se windows permissions file attributes read-only attribute r set unset file user program therefore prevent anyone changing/deleting file permission systems would prevent user reading file ms-dos/pc dos-compatible operating systems dr dos 3.31 higher palmdos novell dos opendos flexos 4680 os 4690 os concurrent dos multiuser dos datapac system manager ims real/32 support read/write/execute/delete file/directory access permissions fat volumes exception flexos 4680 os 4690 os operating systems also support individual file/directory passwords operating systems except dr dos palmdos novell dos opendos also support three independent file/directory ownership classes world/group/owner whereas single-user operating systems dr dos 6.0 higher palmdos novell dos opendos support optional multi-user security module security.bin loaded openvms a.k.a vms well microsoft windows nt derivatives including windows 2000 windows xp use acls administer complex varied set permissions openvms also uses permission scheme similar unix complex four categories system owner group world four types access permissions read write execute delete categories mutually disjoint world includes group turn includes owner system category independently includes system users similar superusers unix classic mac os operating systems hfs support permissions file attributes hidden show directory listings locked read-only name locked renamed stationery copy-on-write amigaos filesystem amigados supports relatively advanced permissions system single-user os amigaos 1.x files archive read write execute delete collectively known arwed permissions/flags amigaos 2.x higher additional hold script pure permissions/flags added mac os x versions 10.3 panther prior use posix-compliant permissions mac os x beginning version 10.4 tiger also support use nfsv4 acls still support traditional unix permissions used previous versions mac os x apple mac os x server version 10.4+ file services administration manual recommends using traditional unix permissions possible also still supports mac os classic protected attribute solaris acl support depends filesystem used older ufs filesystem supports posix.1e acls zfs supports nfsv4 acls linux supports posix.1e acls experimental support nfsv4 acls ext3 filesystem ext4 filesystem freebsd supports posix.1e acls ufs nfsv4 acls ufs zfs ibm z/os implements file security via racf resource access control facility permissions unix-like systems managed three distinct scopes classes scopes known user group others file created unix-like system permissions restricted umask process created files directories owned user owner determines file user class distinct permissions apply owner files directories assigned group define file group class distinct permissions apply members file group owner may member file group users owner member group comprise file others class distinct permissions apply others effective permissions determined based first class user falls within order user group others example user owner file permissions given user class regardless permissions assigned group class others class unix-like systems implement three specific permissions apply class effect setting permissions directory rather file one frequently misunderstood file permission issues permission set corresponding rights denied unlike acl-based systems permissions unix-like systems inherited files created within directory necessarily permissions directory unix-like systems typically employ three additional modes actually attributes referred permissions modes special modes file directory overall class though symbolic notation see setuid bit set triad user setgid bit set triad group sticky bit set triad others additional modes also referred setuid bit setgid bit sticky bit due fact occupy one bit unix permissions represented either symbolic notation octal notation common form used command codice_1 symbolic notation first character codice_2 display indicates file type related permissions remaining nine characters three sets representing class permissions three characters first set represents user class second set represents group class third set represents others class three characters represent read write execute permissions following examples symbolic notation permission systems additional symbols codice_1 display represent additional permission features represent setuid setgid sticky text attributes executable character x '- modified though attributes affect overall file users one class setuid attribute modifies executable character triad user setgid attribute modifies executable character triad group sticky text attribute modifies executable character triad others setuid setgid attributes first second triad x becomes '- becomes sticky text attribute third triad x becomes 't '- becomes 't example another method representing unix permissions octal base-8 notation shown codice_14 notation consists least three digits three rightmost digits represents different component permissions owner group others fourth digit present leftmost high-order digit addresses three additional attributes setuid bit setgid bit sticky bit digits sum component bits binary numeral system result specific bits add sum represented numeral values never produce ambiguous combinations sum represents specific set permissions technically octal representation bit field – bit references separate permission grouping 3 bits time octal corresponds grouping permissions user group others examples symbolic notation section given octal notation systems diverge traditional posix-model users groups creating new group – user private group – user assuming user member user private group scheme allows umask 002 used without allowing users write newly created files normal directories files assigned creating user private group however sharing files desirable administrator create group containing desired users create group-writable directory assigned new group importantly make directory setgid making setgid cause files created assigned group directory 002 umask enabled using user private groups ensure members group able write files | [
5120,
2051,
2564,
5636,
6669,
3598,
10257,
9236,
6677,
5142,
8214,
3611,
545,
6690,
9249,
9762,
5158,
52,
7225,
5179,
7739,
11323,
576,
8772,
1109,
612,
4708,
5220,
8298,
9836,
7789,
8302,
9840,
9333,
6263,
2168,
9335,
7804,
9343,
5256,
... | Test |
1,510 | 3 | CodeXL:codexl codexl formerly amd codexl open-source software development tool suite includes gpu debugger gpu profiler cpu profiler graphics frame analyzer static shader/kernel analyzer codexl mainly developed amd version 2.0 codexl made part gpuopen free open-source software subject requirements mit license longer branded amd product cpu profiler power profiler included codexl version 2.5 profilers released part amd uprof tool codexl gpu debugger allows engineers debug opengl opencl api calls runtime objects debug opencl kernels set breakpoints step source code real-time view variables across different gpu cores kernel execution identify logic memory errors reduce memory transaction overhead visualize opencl/opengl buffers images opengl textures pictures spreadsheet data way improve general software quality optimize performance codexl gpu profiler collects visualizes hardware performance counters data application trace kernel occupancy offers hotspot analysis amd gpus apus profiler gathers data opencl runtime gpu/apu execution kernels used discover performance bottlenecks optimize kernel execution codexl cpu profiling suite used identify investigate improve performance applications drivers system software amd cpus codexl cpu profiler uses statistical sampling based approach various profiling techniques measures time-based profiling tbp event-based profiling ebp instruction-based sampling ibs cpu hardware performance monitors codexl cpu profiler replaces amd codeanalyst codexl static kernel analyzer allows engineers compile analyze disassemble code directx opengl vulkan shaders opencl kernels tool provides performance estimation shader/kernel different kinds amd chips without actually executing code way tool assists fine-tuning achieve best performance amd gpus q1 2017 amd codexl analyzer replaced radeon gpu analyzer rga maintaining backward compatibility radeon gpu analyzer cli offline compiler performance analysis tool directx shaders opengl shaders vulkan shaders opencl kernels version 2.0 codexl hsa profiler hsail kernel debugger support boltzmann initiative driver gcn 1.2 hardware i.e radeon r9 fury fury x fury nano carrizo apus frame analyzer collect display frame timeline applications use microsoft directx 12 vulkan analyzer view lists api call made cpu side corresponding command executed gpu side inter-linked unified timeline view well aggregated statistics user-selected specific time fragment – cumulative time type api number calls 20 longest calls codexl officially supports linux microsoft windows operating systems windows codexl available standalone application fully integrated microsoft visual studio extension codexl successfully used debug bullet latest version codexl freely available download codexl github releases page gpu perfstudio amd performance debugging tool graphics applications initially developed support direct3d opengl microsoft windows ported linux 2013 available linux since end q1 2014 suite tools considered useful developing games steam linux especially useful optimizing games amd gpus gpu perfstudio integrated frame profiles frame debugger api trace cpu timing information gpu perfstudio supports direct3d 10 direct3d 10.1 direct3d 11 opengl 4.2 described lightweight installer change game drag drop suite gpu tools run usb drive need visual studio integration runs game executables require special driver new compilation gpu perfstudio 3.6 supports direct3d 12 windows 10 vulkan windows linux gpu perfstudio available linux microsoft windows amd developer summit apu november 2013 gordon selley presented gpu perfstudio 2 steamdevdays february 2014 tony hosier gordon selley presented gpu perfstudio 2 43 minutes video gpuperfapi amd library accessing gpu performance counters amd radeon graphics cards apus used gpu perfstudio codexl also available third party developers wish incorporate within applications gpuperfapi supports directx11 opengl opencl applications gpuperfapi available linux microsoft windows | [
2850,
3586,
3204,
1480,
11080,
876,
6797,
2935,
7983,
6705,
823,
11485,
11130,
2045,
2943
] | Test |
1,511 | 4 | Logical_security:logical security logical security consists software safeguards organization ’ systems including user identification password access authenticating access rights authority levels measures ensure authorized users able perform actions access information network workstation subset computer security elements logical security token authentication comprises small devices authorized users computer systems networks carry assist identifying logging computer network system actually authorized also store cryptographic keys biometric data popular type security token rsa securid displays number changes every minute users authenticated entering personal identification number number token token contains time day clock unique seed value number displayed cryptographic hash seed value time day computer accessed also contains algorithm able match number matching user ’ seed time day clock error taken account values minutes sometimes accepted another similar type token cryptogram produce value time button pressed security tokens connect directly computer usb smart card bluetooth ports special purpose interfaces cell phones pda also used security tokens proper programming password authentication uses secret data control access particular resource usually user attempting access network computer computer program queried whether know password granted denied access accordingly passwords either created user assigned similar usernames however assigned password user usually given option change password something his/her choice depending restrictions system network user may change his/her password alphanumeric sequence usually limitations password creation include length restrictions requirement number uppercase letter special character able use past four five changed passwords associated username addition system may force user change his/her password given amount time two-way authentication involves user system network convincing know shared password without transmitting password communication channel done using password encryption key transmit randomly generated piece information “ challenge. ” side must return similarly encrypted value predetermined function originally offered information his/her “ response ” proves he/she able decrypt challenge kerberos computer network authentication protocol good example sends encrypted integer n response must encrypted integer n 1 access rights authority levels rights power granted users create change delete view data files within system network rights vary user user range anonymous login guest privileges superuser root privileges guest superuser accounts two extremes individual access rights denied granted user usually system administrator a.k.a superuser ability grant deny rights guest accounts anonymous logins set multiple users log account time without password users sometimes asked type username account limited access often allowed access special public files usually anonymous accounts read access rights security purposes superuser authority level assigned system administrators computer operating systems unix related operating systems level also called root access rights system including changing ownership files pre-windows xp nt systems dos windows 9x users effectively superusers users access rights windows nt related systems windows 2000 xp superuser known administrator account however administrator account may may exist depending whether separation | [
11175,
2737,
6098,
9745,
5433,
700,
2558,
10207
] | Validation |
1,512 | 4 | Packet_drop_attack:packet drop attack computer networking packet drop attack blackhole attack type denial-of-service attack router supposed relay packets instead discards usually occurs router becoming compromised number different causes one cause mentioned research denial-of-service attack router using known ddos tool packets routinely dropped lossy network packet drop attack hard detect prevent malicious router also accomplish attack selectively e.g dropping packets particular network destination certain time day packet every n packets every seconds randomly selected portion packets rather called greyhound attack malicious router attempts drop packets come attack actually discovered fairly quickly common networking tools traceroute also routers notice compromised router dropping traffic generally begin remove router forwarding tables eventually traffic flow attack however malicious router begins dropping packets specific time period every n packets often harder detect traffic still flows across network packet drop attack frequently deployed attack wireless ad hoc networks wireless networks much different architecture typical wired network host broadcast shortest path towards destination traffic directed host compromised host able drop packets also mobile ad hoc network hosts specifically vulnerable collaborative attacks multiple hosts become compromised deceive hosts network | [
2409,
11461
] | None |
1,513 | 3 | Cooperative_Linux:cooperative linux cooperative linux abbreviated colinux software allows microsoft windows linux kernel run simultaneously parallel machine cooperative linux utilizes concept cooperative virtual machine cvm contrast traditional virtual machines cvm shares resources already exist host os traditional vm hosts resources virtualized every guest os cvm gives oss complete control host machine traditional vm sets every guest os unprivileged state access real machine term cooperative used describe two entities working parallel effect cooperative linux turns two different operating system kernels two big coroutines kernel complete cpu context address space kernel decides give control back partner however kernels theoretically full access real hardware modern pc hardware designed controlled two different operating systems time therefore host kernel left control real hardware guest kernel contains special drivers communicate host provide various important devices guest os host os kernel exports basic primitives allow cooperative linux portable driver run cpl0 mode ring 0 allocate memory dan aloni originally started development cooperative linux based similar work user-mode linux announced development 25 jan 2004 july 2004 presented paper linux symposium source released gnu general public license developers since contributed various patches additions software cooperative linux significantly different full x86 virtualization generally works running guest os less privileged mode host kernel resources delegated host kernel contrast cooperative linux runs specially modified linux kernel cooperative takes responsibility sharing resources nt kernel instigating race conditions changes cooperative linux patch i386 tree—the supported architecture cooperative time writing changes mostly additions virtual drivers cobd block device conet network cocon console changes i386 tree involve initialization setup code goal cooperative linux kernel design remain close possible standalone i386 kernel changes localized minimized much possible colinux package installs port linux kernel virtual network device run simultaneously version windows operating system windows 2000 windows xp use virtual machine vmware debian ubuntu fedora gentoo especially popular colinux users due rather unusual structure virtual hardware installing linux distributions colinux generally difficult therefore users cases use either existing linux installation real partition ready made filesystem image distributed project filesystem images made variety methods including taking images normal linux system finding ways make installers run strange hardware building installs hand using package manager simply upgrading existing images using tools like yum apt easier way get up-to-date filesystem image use qemu install linux convert image stripping first 63 512-byte blocks described colinux wiki since colinux access native graphics hardware x window x servers run colinux directly one install x server windows cygwin/x xming use kde gnome almost linux application distribution issues fixed using colinux based distributions andlinux based ubuntu topologilinux based slackware | [
6150,
4616,
6153,
2058,
3082,
5139,
10780,
10785,
6180,
8242,
9266,
7733,
3649,
4161,
5697,
8772,
6213,
5702,
8268,
589,
7248,
593,
4695,
10851,
6244,
5222,
10856,
4207,
9839,
5244,
4734,
11391,
7812,
6797,
4238,
7821,
10382,
2195,
2711,
... | Test |
1,514 | 8 | Google_Tag_Manager:google tag manager google tag manager tag management system created google manage javascript html tags used tracking analytics websites variants e-marketing tags sometimes referred tracking pixels web beacons google announced google tag manager october 2012 version 1 tag manager launched following default tag templates version 2 launched october 2014 making product cleaner simpler use google also announced tag manager api release version 2 | [
10450,
3462
] | Train |
1,515 | 2 | BIOS:bios bios acronym basic input/output system also known system bios rom bios pc bios non-volatile firmware used perform hardware initialization booting process power-on startup provide runtime services operating systems programs bios firmware comes pre-installed personal computer system board first software run powered name originates basic input/output system used cp/m operating system 1975 bios originally proprietary ibm pc reverse engineered companies looking create compatible systems interface original system serves de facto standard bios modern pcs initializes tests system hardware components loads boot loader mass memory device initializes operating system era dos bios provided hardware abstraction layer keyboard display input/output i/o devices standardized interface application programs operating system recent operating systems use bios loading instead accessing hardware components directly bios implementations specifically designed work particular computer motherboard model interfacing various devices make complementary system chipset originally bios firmware stored rom chip pc motherboard modern computer systems bios contents stored flash memory rewritten without removing chip motherboard allows easy end-user updates bios firmware new features added bugs fixed also creates possibility computer become infected bios rootkits furthermore bios upgrade fails brick motherboard permanently unless system includes form backup case unified extensible firmware interface uefi successor legacy pc bios aiming address technical shortcomings term bios basic input/output system created gary kildall first appeared cp/m operating system 1975 describing machine-specific part cp/m loaded boot time interfaces directly hardware cp/m machine usually simple boot loader rom versions ms-dos pc dos dr-dos contain file called variously io.sys ibmbio.com ibmbio.sys drbios.sys file known dos bios also known dos i/o system contains lower-level hardware-specific part operating system together underlying hardware-specific operating system-independent system bios resides rom represents analogue cp/m bios introduction ps/2 machines ibm divided system bios real- protected-mode portions real-mode portion meant provide backward compatibility existing operating systems dos therefore named cbios compatibility bios whereas abios advanced bios provided new interfaces specifically suited multitasking operating systems os/2 bios original ibm pc xt interactive user interface error codes messages displayed screen coded series sounds generated signal errors power-on self-test post proceeded point successfully initializing video display adapter options ibm pc xt set switches jumpers main board expansion cards starting around mid-1990s became typical bios rom include bios configuration utility bcu bios setup utility accessed system power-up particular key sequence program allowed user set system configuration options type formerly set using dip switches interactive menu system controlled keyboard interim period ibm-compatible pcsincluding ibm atheld configuration settings battery-backed ram used bootable configuration program disk rom set configuration options contained memory disk supplied computer lost system settings could changed applied general computers eisa bus configuration program called eisa configuration utility ecu modern wintel-compatible computer provides setup routine essentially unchanged nature rom-resident bios setup utilities late 1990s user configure hardware options using keyboard video display also errors occur boot time modern bios usually displays user-friendly error messages often presented pop-up boxes tui style offers enter bios setup utility ignore error proceed possible instead battery-backed ram modern wintel machine may store bios configuration settings flash rom perhaps flash rom holds bios early intel processors started physical address 000ffff0h systems later processors provide logic start running bios system rom system powered reset button pressed cold boot full power-on self-test post run ctrl+alt+delete pressed warm boot special flag value stored nonvolatile bios memory cmos tested bios allows bypass lengthy post memory detection post identifies initializes system devices cpu ram interrupt dma controllers parts chipset video display card keyboard hard disk drive optical disc drive basic hardware early ibm pcs routine post would download program ram keyboard port run feature intended factory test diagnostic purposes option rom scan completed detected rom modules valid checksums called immediately post bios version scan option roms bios calls int 19h start boot processing post-boot programs loaded also call int 19h reboot system must careful disable interrupts asynchronous hardware processes may interfere bios rebooting process else system may hang crash rebooting int 19h called bios attempts locate boot loader software boot device hard disk floppy disk cd dvd loads executes first boot software finds giving control pc bios uses boot devices set eeprom cmos ram earliest pcs dip switches bios checks device order see bootable attempting load first sector boot sector sector read bios proceeds next device sector read successfully bioses also check boot sector signature 0x55 0xaa last two bytes sector 512 bytes long accepting boot sector considering device bootable bootable device found bios transfers control loaded sector bios interpret contents boot sector possibly check boot sector signature last two bytes interpretation data structures like partition tables bios parameter blocks done boot program boot sector programs loaded boot process non-disk device network adapter attempts booting procedure defined option rom equivalent integrated motherboard bios rom option roms may also influence supplant boot process defined motherboard bios rom user select boot priority implemented bios example computers hard disk bootable usually removable-media drive higher boot priority user cause removable disk booted modern bioses boot priority order configured user older bioses limited boot priority options selectable earliest bioses fixed priority scheme implemented floppy disk drives first fixed disks i.e hard disks second typically boot devices supported subject modification rules installed option roms bios early pc also usually would boot first floppy disk drive first hard disk drive even two drives installed el torito optical media boot standard optical drive actually emulates 3.5 high-density floppy disk bios boot purposes reading first sector cd-rom dvd-rom simply defined operation like floppy disk hard disk furthermore complexity medium makes difficult write useful boot program one sector bootable virtual floppy disk contain software provides access optical medium native format original ibm pc xt bootable disk found rom basic started calling int 18h since programs used basic rom clone pc makers left computer failed boot disk would display rom basic halt response int 18h later computers would display message like bootable disk found would prompt disk inserted key pressed retry boot process modern bios may display nothing may automatically enter bios configuration utility boot process fails environment boot program simple cpu real mode general-purpose segment registers undefined except cs ss sp dl cs always zero ip initially codice_1 boot programs always loaded fixed address need boot program relocatable dl may contain drive number used int 13h boot device ss sp points valid stack presumably large enough support hardware interrupts otherwise ss sp undefined stack must already set order interrupts serviced interrupts must enabled order system timer-tick interrupt bios always uses least maintain time-of-day count initializes post active keyboard work keyboard works even bios keyboard service called keystrokes received placed 15-character type-ahead buffer maintained bios boot program must set stack size stack set bios unknown location likewise variable although boot program investigate default stack examining ss sp easier shorter unconditionally set new stack boot time bios services available memory address codice_2 contains interrupt vector table bios post initialized system timers interrupt controller dma controller motherboard/chipset hardware necessary bring bios services ready status dram refresh system dram conventional memory extended memory necessarily expanded memory set running interrupt vectors corresponding bios interrupts set point appropriate entry points bios hardware interrupt vectors devices initialized bios set point bios-provided isrs interrupts including ones bios generates programs hook set default dummy isr immediately returns bios maintains reserved block system ram addresses codice_3 various parameters initialized post memory address codice_4 used boot program may even overwrite peripheral cards hard disk drive controllers video display adapters bios extension option roms provide additional functionality bios code extensions runs bios boots system mass storage roms typically test initialize hardware add new bios services augment replace existing bios services versions services example scsi controller usually bios extension rom adds support hard drives connected controller video cards extension roms replace video services motherboard bios video services bios extension roms gain total control machine fact anything may never return control bios invoked extension rom could principle contain entire operating system application program could implement entirely different boot process booting network operation ibm-compatible computer system completely changed removing inserting adapter card rom chip contains bios extension rom motherboard bios typically contains code access hardware components necessary bootstrapping system keyboard display storage addition plug-in adapter cards scsi raid network interface cards video boards often include bios e.g video bios complementing replacing system bios code given component even devices built motherboard behave way option roms stored separate code main bios flash chip upgraded either tandem separately main bios add-in card requires option rom card supported main bios card needs initialized made accessible bios services operating system loaded usually means required bootstrapping process even required option rom allow adapter card used without loading driver software storage device booting begins option rom time taken load driver driver take space ram hard disk driver software rom always stays device two accidentally separated also rom card peripheral hardware driver software provided rom installed together extra effort install software additional advantage rom early pc systems notably including ibm pcjr rom faster main system ram modern systems case much reverse bios rom code usually copied shadowed ram run faster many methods utilities examining contents various motherboard bios expansion roms microsoft debug unix dd expansion rom wishes change way system boots network device scsi adapter bios driver code cooperative way use bios boot specification bbs api register ability expansion roms registered using bbs apis user select among available boot options within bios user interface bbs compliant pc bios implementations allow user enter bios user interface expansion roms finished executing registering bbs api specification downloaded acpica website official title bios boot specification version 1.01 11 january 1996 also expansion rom wishes change way system boots unilaterally simply hook int 19h interrupts normally called interrupt 19h int 13h bios disk service intercept bios boot process replace bios boot process one merely modify boot sequence inserting boot actions preventing bios detecting certain devices bootable bios boot specification promulgated way expansion roms implement boot capability devices supported booting native bios motherboard motherboard bios completes post bios versions search option rom modules also called bios extension roms execute motherboard bios scans extension roms portion upper memory area part x86 real-mode address space address 0xa0000 runs rom found order discover memory-mapped isa option roms bios implementation scans real-mode address space codice_5 codice_6 2 kib boundaries looking two-byte rom signature 0x55 followed 0xaa valid expansion rom signature followed single byte indicating number 512-byte blocks expansion rom occupies real memory next byte option rom entry point also known entry offset checksum specified number 512-byte blocks calculated rom valid checksum bios transfers control entry address normal bios extension rom beginning extension initialization routine point extension rom code takes typically testing initializing hardware controls registering interrupt vectors use post-boot applications may use bios services including provided previously initialized option roms provide user configuration interface display diagnostic information anything else requires possible option rom return bios pre-empting bios boot sequence altogether option rom normally return bios completing initialization process option rom returns bios continues searching option roms calling found entire option rom area memory space scanned option roms normally reside adapter cards however original pc perhaps also pc xt spare rom socket motherboard system board ibm terms option rom inserted four roms contain basic interpreter also removed replaced custom roms option roms ibm pcjr unique among pcs two rom cartridge slots front cartridges slots map region upper memory area used option roms cartridges contain option rom modules bios would recognize cartridges also contain types rom modules basic programs handled differently one pcjr cartridge contain several rom modules different types possibly stored together one rom chip bios rom customized particular manufacturer hardware allowing low-level services reading keystroke writing sector data diskette provided standardized way programs including operating systems example ibm pc might either monochrome color display adapter using different display memory addresses hardware single standard bios system call may invoked display character specified position screen text mode graphics mode bios provides small library basic input/output functions operate peripherals keyboard rudimentary text graphics display functions forth using ms-dos bios services could accessed application program ms-dos executing int 13h interrupt instruction access disk functions executing one number documented bios interrupt calls access video display keyboard cassette device functions operating systems executive software designed supersede basic firmware functionality provide replacement software interfaces application software applications also provide services began even 1980s ms-dos programmers observed using bios video services graphics display slow increase speed screen output many programs bypassed bios programmed video display hardware directly graphics programmers particularly exclusively demoscene observed technical capabilities pc display adapters supported ibm bios could taken advantage without circumventing since at-compatible bios ran intel real mode operating systems ran protected mode 286 later processors required hardware device drivers compatible protected mode operation replace bios services modern personal computers running modern operating systems bios used booting initial loading system software operating system first graphical screen displayed input output typically handled bios boot menu textual menu windows allows users choose operating system boot boot safe mode use last known good configuration displayed bios receives keyboard input bios modern pcs still boot run legacy operating systems ms-dos dr-dos rely heavily bios console disk i/o providing system bios bios-compatible firmware necessarily case uefi-based pcs intel processors reprogrammable microcode since p6 microarchitecture bios may contain patches processor microcode fix errors initial processor microcode reprogramming persistent thus loading microcode updates performed time system powered without reprogrammable microcode expensive processor swap would required example pentium fdiv bug became expensive fiasco intel required product recall original pentium processor defective microcode could reprogrammed bioses contain software licensing description table slic digital signature placed inside bios original equipment manufacturer oem example dell slic inserted acpi table contains active code computer manufacturers distribute oem versions microsoft windows microsoft application software use slic authenticate licensing oem windows installation disk system recovery disc containing windows software systems slic preactivated oem product key verify xml formatted oem certificate slic bios means self-activating see system locked preinstallation slp user performs fresh install windows need possession oem key either slp coa digital certificate slic order bypass activation achieved user performs restore using pre-customised image provided oem power users copy necessary certificate files oem image decode slp product key perform slp activation manually cracks non-genuine windows distributions usually edit slic emulate order bypass windows activation bios implementations allow overclocking action cpu adjusted higher clock rate manufacturer rating guaranteed capability overclocking may however seriously compromise system reliability insufficiently cooled computers generally shorten component lifespan overclocking incorrectly performed may also cause components overheat quickly mechanically destroy operating systems example ms-dos rely bios carry input/output tasks within pc bios still runs 16-bit real mode calling bios services directly inefficient protected-mode operating systems bios services used modern multitasking operating systems initially load importance primary part bios greatly reduced initially later bios implementations took complex functions including interfaces advanced configuration power interface acpi functions include power management hot swapping thermal management time since 2010 bios technology transitional process toward uefi historically bios ibm pc xt built-in user interface bios versions earlier pcs xt-class software configurable instead users set options via dip switches motherboard later computers including ibm-compatibles 80286 cpus battery-backed nonvolatile bios memory cmos ram chip held bios settings settings video-adapter type memory size hard-disk parameters could configured running configuration program disk built rom special reference diskette inserted ibm configure settings memory size early bios versions passwords boot-device selection options bios hard-coded boot first floppy drive failed first hard disk access control early at-class machines physical keylock switch hard defeat computer case could opened anyone could switch computer could boot later 386-class computers started integrating bios setup utility rom alongside bios code computers usually boot bios setup utility certain key key combination pressed otherwise bios post boot process executed modern bios setup utility menu-based user interface ui accessed pressing certain key keyboard pc starts usually key advertised short time early startup example press f1 enter cmos setup actual key depends specific hardware features present bios setup utility typically include modern bios setup screen often features pc health status hardware monitoring tab directly interfaces hardware monitor chip mainboard makes possible monitor cpu chassis temperature voltage provided power supply unit well monitor control speed fans connected motherboard system booted hardware monitoring computer fan control normally done directly hardware monitor chip separate chip interfaced i²c smbus come part super i/o solution interfaced low pin count lpc operating systems like netbsd envsys openbsd sysctl hw.sensors feature integrated interfacing hardware monitors normally done without interaction bios however certain circumstances bios vendor also provides underlying information hardware monitoring acpi case operating system may using acpi perform hardware monitoring done example asustek motherboards ai booster feature modern pcs bios stored rewritable memory allowing contents replaced modified rewriting contents sometimes termed flashing based common use kind eeprom known technically flash eeprom colloquially flash memory done special program usually provided system manufacturer post bios image hard drive usb flash drive file containing contents sometimes termed bios image bios might reflashed order upgrade newer version fix bugs provide improved performance support newer hardware reflashing operation might needed fix damaged bios original ibm pc bios cassette basic stored mask-programmed read-only memory rom chips sockets motherboard roms could replaced altered users allow updates many compatible computers used re-programmable memory devices eprom later flash memory devices according robert braver president bios manufacturer micro firmware flash bios chips became common around 1995 electrically erasable prom eeprom chips cheaper easier program standard ultraviolet erasable prom eprom chips flash chips programmed re-programmed in-circuit eprom chips need removed motherboard re-programming bios versions upgraded take advantage newer versions hardware correct bugs previous revisions bioses beginning ibm pcs supported hardware clock settable bios century bit allowed manually changing century year 2000 happened bios revisions created 1995 nearly bios revisions 1997 supported year 2000 setting century bit automatically clock rolled past midnight december 31 1999 first flash chips attached isa bus starting 1997 bios flash moved lpc bus functional replacement isa following new standard implementation known firmware hub fwh 2006 first systems supporting serial peripheral interface spi appeared bios flash memory moved size bios capacity rom eeprom media may stored increased time new features added code bios versions exist sizes 16 megabytes contrast original ibm pc bios contained 8 kib mask rom modern motherboards including even bigger nand flash memory ics board capable storing whole compact operating systems linux distributions example asus motherboards included splashtop os embedded nand flash memory ics however idea including operating system along bios rom pc new 1980s microsoft offered rom option ms-dos included roms pc clones tandy 1000 hx another type firmware chip found ibm pc early compatibles keyboard interface controlled microcontroller programmable memory ibm 40-pin socketed device manufacturers used eprom version chip resembled eprom controller also assigned a20 gate function manage memory one-megabyte range occasionally upgrade keyboard bios necessary take advantage software could use upper memory bios may contain components memory reference code mrc responsible handling memory timings related hardware settings ibm published entire listings bios original pc pc xt pc contemporary pc models appendix ibm pc technical reference manual machine type effect publication bios listings anyone see exactly definitive bios may 1984 phoenix software associates released first rom-bios enabled oems build essentially 100 -compatible clones without reverse-engineer ibm pc bios compaq done portable helping fuel growth pc compatibles industry sales non-ibm versions dos first american megatrends ami bios released 1986 new standards grafted onto bios usually without complete public documentation bios listings result easy learn intimate details many non-ibm additions bios core bios services pc motherboard suppliers license bios core toolkit commercial third-party known independent bios vendor ibv motherboard manufacturer customizes bios suit hardware reason updated bioses normally obtained directly motherboard manufacturer major bios vendors include american megatrends ami insyde software phoenix technologies byosoft former vendors include award software microid research acquired phoenix technologies 1998 phoenix later phased award brand name general software also acquired phoenix 2007 sold bios intel processor based embedded systems open source community increased effort develop replacement proprietary bioses future incarnations open sourced counterpart libreboot coreboot openbios/open firmware projects amd provided product specifications chipsets google sponsoring project motherboard manufacturer tyan offers coreboot next standard bios opteron line motherboards msi gigabyte technology followed suit msi k9nd ms-9282 msi k9sd ms-9185 resp m57sli-s4 models eeprom chips advantageous easily updated user customary hardware manufacturers issue bios updates upgrade products improve compatibility remove bugs however advantage risk improperly executed aborted bios update could render computer device unusable avoid situations recent bioses use boot block portion bios runs first must updated separately code verifies rest bios intact using hash checksums methods transferring control boot block detects corruption main bios typically warn user recovery process must initiated booting removable media floppy cd usb flash drive user try flashing bios motherboards backup bios sometimes referred dualbios boards recover bios corruptions least four known bios attack viruses two demonstration purposes first one found wild mebromi targeting chinese users first bios virus cih also known chernobyl virus able erase flash rom bios content compatible chipsets cih appeared mid-1998 became active april 1999 often infected computers could longer boot people remove flash rom ic motherboard reprogram cih targeted then-widespread intel i430tx motherboard chipset took advantage fact windows 9x operating systems also widespread time allowed direct hardware access programs modern systems vulnerable cih variety chipsets used incompatible intel i430tx chipset also flash rom ic types also extra protection accidental bios rewrites form boot blocks protected accidental overwrite dual quad bios equipped systems may event crash use backup bios also modern operating systems freebsd linux macos windows nt-based windows os like windows 2000 windows xp newer allow user-mode programs direct hardware access result 2008 cih become essentially harmless worst causing annoyance infecting executable files triggering antivirus software bios viruses remain possible however since windows home users without windows vista/7 uac run applications administrative privileges modern cih-like virus could principle still gain access hardware without first using exploit operating system openbsd prevents users access grsecurity patch linux kernel also prevents direct hardware access default difference attacker requiring much difficult kernel level exploit reboot machine second bios virus technique presented john heasman principal security consultant uk-based next-generation security software 2006 black hat security conference showed elevate privileges read physical memory using malicious procedures replaced normal acpi functions stored flash memory third bios virus technique called persistent bios infection appeared 2009 cansecwest security conference vancouver syscan security conference singapore researchers anibal sacco alfredo ortega core security technologies demonstrated insert malicious code decompression routines bios allowing nearly full control pc start-up even operating system booted proof-of-concept exploit flaw bios implementation involves normal bios flashing procedures thus requires physical access machine user root despite requirements ortega underlined profound implications sacco discovery patch driver drop fully working rootkit even little code remove disable antivirus mebromi trojan targets computers awardbios microsoft windows antivirus software two chinese companies rising antivirus jiangmin kv antivirus mebromi installs rootkit infects master boot record december 2013 interview 60 minutes deborah plunkett information assurance director us national security agency claimed nsa uncovered thwarted possible bios attack foreign nation state targeting us financial system program cited anonymous sources alleging chinese plot however follow-up articles guardian atlantic wired register refuted nsa claims bios replaced complex extensible firmware interface efi many new machines efi specification replaces runtime interface legacy bios initially written intel itanium architecture efi available x86 x86-64 platforms specification development driven unified efi forum industry special interest group efi booting supported microsoft windows versions supporting gpt linux kernel 2.6.1 later macos intel-based macs new pc hardware predominantly ships uefi firmware architecture rootkit safeguard also prevent system running user software changes makes uefi controversial bios replacement open hardware community alternatives functionality legacy bios x86 world include coreboot libreboot servers workstations use platform-independent open firmware ieee-1275 based forth programming language included sun sparc computers ibm rs/6000 line powerpc systems chrp motherboards along x86-based olpc xo-1 least 2015 apple removed legacy bios support macbook pro computers bless utility longer supports -- legacy switch prints legacy mode supported system macs also boot cd-rom usb flash drives | [
6148,
7173,
6150,
8197,
1032,
10756,
532,
533,
28,
3101,
4637,
6173,
1058,
4642,
3109,
1071,
4150,
4666,
2111,
576,
9791,
3140,
585,
4695,
91,
9307,
1637,
10856,
8301,
2159,
5744,
1137,
9337,
1660,
4221,
5756,
640,
8834,
4228,
647,
6797... | Test |
1,516 | 2 | Google_Play_Services:google play services google play services proprietary background service api package android devices google first introduced 2012 provided simple access google+ apis oauth 2.0 since expanded cover large variety google services allowing applications easily communicate services common means april 2018 installed five billion times android devices google play game services used application developers allow competitive social experience use leaderboards public friends achievements multiplayer sessions saved games api available quickly sync game saves google cloud infrastructure well location apis provide specifications location technologies providing geofencing apis scheduling specific actions upon user entering leaving specific geographic boundaries fused location provider acquiring location information reduced power usage activity recognition allowing applications adapt current action user e.g cycling walking etc. google+ platform provides single sign-on allowing user automatically authenticated inside applications providing personalized experience sharing options using google+ google maps android api allows applications include google maps street view without need open separate application allowing full control camera providing means adding custom markers overlays map google drive android api allows google drive used storage structure providing easy lookup syncing documents along various tools manipulating files google cast android api adds casting functionality allow android applications display content tvs using google cast additionally providing various helpers common audio video image types google mobile ads integrate advertisements applications allowing simple monetization million google advertisers sophisticated ad targeting based factors user location google wallet instant buy allows purchases services goods done google wallet providing streamlined flow taps minimized data entry done user google play services provides apis google fit api google account authentication methods google analytics apis google play services used almost google apps system-level powers provide multiple internal features major android services controlled google play services without apps may work properly google play protect unification android security systems operated google two years launch company announced software scanning 50 million apps per day announcement made google i/o 2019 part company focus privacy security tuesday keynote presentations google play services automatically updated google play devices application installed running android 4.1 newer means google fast silent rollouts updates providing new functionality older devices without manufacturers update android firmware working around fragmentation platform become infamous android open source project aosp announced 2007 functioned baseline system oems firmware modifications cyanogenmod lineageos various apps aosp abandoned instead released google play closed-source model many apps function google play services available many google apps like gmail youtube google maps party interested distributing google play services part google apps package must acquire license google often results contractual agreement locking manufacturer android additionally enthusiasts able interested signing agreement interested modifying android system required either opt-out google play services obtain google apps package either device pre-installed unofficial source google play services page google developers | [
5637,
11273,
8719,
3600,
7700,
3100,
9244,
11294,
1578,
5677,
1083,
6212,
69,
8262,
4685,
3664,
8280,
8285,
6750,
2658,
11391,
1670,
5262,
10393,
7835,
673,
8870,
1191,
196,
8907,
2259,
8413,
9949,
1255,
8940,
8446,
5892,
7428,
2828,
280,... | Test |
1,517 | 6 | Gfarm_file_system:gfarm file system gfarm file system open-source distributed file system generally used large-scale cluster computing wide-area data sharing provides features manage replica location explicitly name derived grid data farm architecture implements grid datafarm petascale data-intensive computing project initiated japan project collaboration among high energy accelerator research organization kek national institute advanced industrial science technology aist high performance computing infrastructure project university tokyo tokyo institute technology university tsukuba challenge involves construction peta- exascale parallel filesystem exploiting local storage pcs spread worldwide grid | [
1801,
2314,
7983,
823,
2395,
3582
] | Test |
1,518 | 4 | *82:*82 vertical service code *82 enables calling line identification regardless subscriber preference dialed unblock withheld numbers private callers u.s. per-call basis caller id subscribed enabled line receiving call unblocked phone number registered name displayed – unable determine caller subscribes outgoing callerid blocking *82 dialed temporarily override subscription *82 dialed u.s. land-line house phones business lines well cell phones mobile devices mobile devices may alternatively offer require menu selection override caller id blocking per call correctly unblock number listen dial tone dial *82 listen momentary flashing dial tone confirms override establish connection usual dialing 1 area code phone number complete call anonymous call rejection *77 offered subscribers situations necessary dial *82 order ring complete call lines subscribe enable anonymous call rejection notice given anonymous callers intervening recorded message phone company rejected anonymous call may completed caller id enabled valid star 82 review literary journal published since 2012 named *82 function star 82 code needed unblock one phone number tell us someone answer | [
11170,
5163
] | Validation |
1,519 | 4 | The_Hacker's_Handbook:hacker handbook hacker handbook non-fiction book four editions reprinted numerous times 1985 1990 explaining phone computer systems period could 'hacked contains candid personal comments book british author hugo cornwall pseudonym peter sommer research fellow information systems security london school economics frequently appears united kingdom courts expert digital evidence computer forensics well media pundit author information security topics one popular aspect book salacious printouts actual hacking attempts although confidential details passwords blacked first edition version easily available download published 1985 last four editions edited steve gold appeared 1989 reprints running 1990 1990 uk parliament passed computer misuse act publication additional editions might construed incitement commit offence act | [
4435,
4956,
10110,
9319
] | Test |
1,520 | 5 | Dooble:dooble dooble free open-source web browser created improve privacy currently dooble available freebsd linux os x os/2 windows dooble uses qt user interface abstraction operating system processor architecture result dooble portable system supports openssl posix threads qt sqlite libraries dooble designed implemented order improve privacy usability dooble includes simple bookmarking system users may modify bookmarks via bookmarks browser popup accessible location widget along standard cookie management options dooble also provides mechanism automatically removes cookies permitted dooble occasionally remove undesired http cookies dooble web browser provides according news portal hongkiat easy use download manager dooble partially integrates distributed search engine yacy data dooble retains stored using authenticated encryption dooble encode file associations user settings dooble also provides session-based model using temporary keys passphrase may modified without loss data included non-javascript file manager ftp browser version 1.53 introduced gopher protocol support security passphrase created browser password set safe area browser settings need create master password otherwise everything wiped exit program points pcadvisor version 1.26 dooble introduced support addons torbrowser add-on based vidalia added version 1.40 vidalia plugin removed version 1.49 add-on name interface expands browser social network functions like messenger group chat friend list e-mail client chess game forum function like bulletin board interface based qt integrated plugin based clone retroshare messenger plugin considered deprecated configurable proxy settings provide reasonable flexibility dooble supports session restoration authenticated sessions dooble exits prematurely user may restore previous tabs windows next authenticated session web sites employ iframes order distribute content one third-party web sites since technology may raise privacy issues users dooble provides means blocking external content first version 0.1 released september 2008 current version 2.1.6 released january 25 2018 dooble also available nokia n900 dooble rated ninth ten top linux browsers jack wallen dooble announced one top five best *secure* browsers pcworld reviews dooble feature side rendering quickly even image-heavy sites. guardian newspaper recommends dooble alternative browser surveillance try privacy-focused browser dooble. add-on links | [
513,
6657,
9736,
2579,
6171,
9757,
7713,
3110,
10791,
9770,
559,
4661,
3639,
10808,
3643,
9275,
64,
5707,
10834,
6231,
8281,
6747,
1642,
9834,
9841,
115,
9843,
4725,
3191,
4728,
637,
1664,
2182,
6797,
10910,
8351,
7340,
9394,
9908,
185,
... | Validation |
1,521 | 3 | Business_process_interoperability:business process interoperability business process interoperability bpi property referring ability diverse business processes work together called inter-operate state exists business process meet specific objective automatically utilizing essential human labor typically bpi present process conforms standards enable achieve objective regardless ownership location make version design computer systems used main attraction bpi business process start finish point worldwide regardless types hardware software required automate capacity offload human mind labor bpi considered many final stage evolution business computing bpi twin criteria specific objective essential human labor subjective objectives bpi vary tend fall following categories business process interoperability limited enterprise software systems functions designed work together payroll module general ledger module part program suite controlled software environments use edi interoperability also present incompatible systems middleware applied cases however processes seldom meet test bpi constrained information silos systems inability freely communicate among term business process interoperability bpi coined late 1990s mostly connection value chain electronic commerce bpi utilized promotional materials various companies appears subject research organizations concerned computer science ontologies despite attention received business process interoperability applied outside limited information system environments possible reason bpi requires universal conformance standards business process start finish point worldwide standards fairly straightforward—organizations use finite set shared processes manage operations bringing enterprises together create adopt standards another matter entirely world management systems characterized information silos moving away silos requires organizations deal cultural issues ownership sharing processes data competitive forces security mention effect automation work forces timetable adoption bpi predicted remains subject interest organizations think tanks alike test bpi organization analyzes business process determine meet specific objective utilizing essential human labor specific objective must clearly defined start finish start finish highly subjective however one organization process may start customer orders product finish product delivered customer another organization process may preceded product manufacture distribution may followed management after-sale warranty repairs essential human labor includes qualify bpi every process task must taken account start finish including labor falls cracks created incompatible software applications gathering data one system re-inputting another preparing reports include data disparate systems process must flow uninterrupted regardless underlying computerized systems used non-essential human labor exists point process fails test bpi assure business processes meet specific objectives automatically utilizing essential human labor bpi takes “ service-oriented architecture “ soa approach focuses processes rather technologies required automate widely used soa effective way address problems caused disparate system heart information silo soa makes practical sense organizations expected replace modify current enterprise software achieve bpi regardless benefits involved many workers jobs built around applications use organizations sizable investments current information infrastructures complex even smallest modification costly time-consuming disruptive even software makers unite conform products single set standards problem would solved besides software well-known manufacturers organizations use great many legacy software systems custom applications manual procedures paper forms without soa streamlining huge number disparate internal processes interoperate across entire global enterprise spectrum simply question create soa widespread use bpi relies centralized database repository containing shared data procedures common applications every industry geographical area essence repository serves top application layer enabling organizations export data distributed database obtain programs need simply logging via portal assure security commercial neutrality repository conforms standards promulgated community bpi stakeholders organizations interest groups wish achieve business process interoperability begin establishing one bpi initiatives | [
4107,
8122,
467,
2948
] | None |
1,522 | 2 | ZYpp:zypp zypp libzypp package manager engine powers linux applications like yast zypper implementation packagekit opensuse suse linux enterprise unlike basic package managers provides satisfiability solver compute package dependencies free open-source software project sponsored novell licensed terms gnu general public license v2 later zypp implemented mostly programming language c++ zypper native command-line interface zypp package manager install remove update query software packages local remote networked media graphical equivalent yast package manager module used opensuse since version 10.2 beta1 opensuse 11.1 zypper reached version 1.0 june 2 2009 ark linux announced completed review dependency solvers chosen zypp tools replace aging apt-rpm first distribution zypper also part mobile linux distributions meego sailfish os tizen following consecutive acquisitions ximian suse gmbh 2003 novell decided merge package management systems yast package manager red carpet best breed approach two solutions far used novell looking extant open source tools maturity available back 2005 none fulfilled requirements able work smoothly extant linux management infrastructure software developed ximian suse decided get best ideas extant pieces work new implementation libzypp resulting library planned software management engine suse distributions linux management component novell zenworks management suite libzypp solver port red carpet solver written update packages installed systems using full installing process brought limits adding extensions support weak dependencies patches made fragile unpredictable although first version zypp solver worked satisfactorily company enterprise products coupled zmd daemon led opensuse 10.1 release came may 2006 system package working expected december 2006 opensuse 10.2 release corrected defects prior release using revisited zypp v2 zmd subsequently removed 10.3 release reserved company enterprise products zypp v3 provided opensuse relatively good package manager equivalent existing package managers suffered flaws implementation greatly limited speed performance area libzypp needed improvement speed dependency solver libsolv written released revised bsd license projects like optimal package install/uninstall manager opium mancoosi trying fix dependency solving issues sat solver traditional solvers like advanced packaging tool apt sometimes show unacceptable deficiencies decided integrate sat algorithms zypp stack solver algorithms used based popular minisat solver sat solver implementation appears opensuse 11.0 based two major independent blocks several months work benchmark results fourth zypp version integrated sat solver encouraging moving yast zypper ahead rpm-based package managers speed size | [
11525,
2310,
10760,
2955,
7435,
7181,
7947,
9487,
2448,
788,
1813,
8213,
10900,
6680,
8476,
5670,
4775,
7847,
6828,
6446,
7983,
1842,
823,
2872,
6583,
3131,
5819,
10172,
190,
3649,
10817,
11513,
9671,
5067,
3918,
463,
3791,
3667,
6227,
49... | None |
1,523 | 9 | Supercombinator:supercombinator supercombinator mathematical expression fully bound self-contained may either constant combinator subexpressions supercombinators supercombinators used implementation functional languages mathematical terms lambda expression supercombinator arity n free variables form λx.λx ... λx e n ≥ 0 lambdas required e lambda abstraction lambda abstraction e supercombinator | [
1124,
727
] | Test |
1,524 | 2 | Qt_Extended:qt extended qt extended named qtopia september 30 2008 application platform embedded linux-based mobile computing devices personal digital assistants video projectors mobile phones developed qt software subsidiary nokia cancelled qt extended project free software community created fork qt extended improved project continued building qtmoko debian-based distribution natural successor projects continued efforts openmoko community qt extended features qt extended dual licensed gnu general public license gpl proprietary licenses 2006 qtopia running several million devices including 11 mobile phone models 30 handheld devices models included sharp corporation zaurus line linux handhelds sony mylo archos portable media assistant pma430 multimedia device gamepark holdings gp2x greenphone open phone initiative pocket pc fic openmoko phones neo 1973 freerunner unofficial hack allows use archos wifi series portable media players pmp 604 605 705 also several motorola phones e2 z6 a1200 u980 zte last phone running native applications could developed compiled using c++ managed applications could developed java march 3 2009 qt software announced discontinuation qt extended standalone product features integrated qt framework openmoko community forked final stable release qt extended improved later renamed qtmoko like predecessor application platform embedded linux-based mobile computing devices personal digital assistants video projectors mobile phones dual licensed gnu general public license gpl proprietary licenses qt extended improved run several mobile devices notably openmoko phones neo 1973 freerunner | [
4225,
7938,
2179,
7812,
5637,
6,
8326,
4360,
9732,
11271,
4364,
4493,
9356,
2195,
10259,
1813,
11155,
7579,
10780,
6301,
1694,
4383,
3618,
3626,
4011,
5677,
9646,
7727,
3248,
7857,
823,
1083,
7483,
9660,
5824,
10817,
1602,
7492,
5067,
724... | None |
1,525 | 4 | BlueHat:bluehat bluehat blue hat blue-hat term used refer outside computer security consulting firms employed bug test system prior launch looking exploits closed particular microsoft uses term refer computer security professionals invited find vulnerability products windows blue hat microsoft hacker conference invitation-only conference created window snyder intended open communication microsoft engineers hackers event led mutual understanding well occasional confrontation microsoft developers visibly uncomfortable metasploit demonstrated | [
1540,
1573,
8135,
3473,
7605,
7449,
4956,
2558
] | None |
1,526 | 4 | Domain-validated_certificate:domain-validated certificate domain validated certificate dv x.509 digital certificate typically used transport layer security tls domain name applicant validated proving control dns domain sole criterion domain validated certificate proof control whois records dns records file email web hosting account domain typically control domain determined using one following domain validated certificate distinct extended validation certificate requirement issuing certificate particular domain validated certificates assure particular legal entity connected certificate even domain name may imply particular legal entity controls domain web browsers may show lock often grey rather green lock typically used extended validation certificate dns domain name legal entity never displayed domain validated certificates include legal entity subject low assurance requirements allow domain validated certificates issued quickly without requiring human intervention domain validated certificates number unique characteristics | [
513,
517,
1157,
1288,
8204,
9744,
1683,
1688,
3742,
2083,
8358,
11693,
11569,
9394,
7736,
9281,
9412,
3657,
5834,
10831,
11345,
2003,
5078,
5590,
474,
3805,
7264,
8674,
7139,
10341,
4326,
5107,
501,
2169,
3707,
510,
4863
] | Test |
1,527 | 3 | Jet_Set_Willy:jet set willy jet set willy platform video game originally written matthew smith zx spectrum home computer published 1984 software projects ported home computers time game sequel manic miner published 1983 second game miner willy series significant development platform game genre home computer tired miner willy tidy items left around house huge party done housekeeper maria let go bed willy mansion bought wealth obtained adventures manic miner much remains unexplored appears full strange creatures possibly result previous missing owner experiments willy must explore enormous mansion grounds including beach yacht fully tidy house get much-needed sleep jet set willy flip-screen platform game player moves protagonist willy room room mansion collecting objects unlike screen-by-screen style prequel player explore mansion willy controlled using left right jump climb stairs walking jumping avoid climb swinging ropes pushing left right depending direction rope swinging play area consists 60 playable screens making mansion grounds contains hazards static killer objects guardians killer monsters move along predetermined paths various platforms collectable objects collectable items glow distinguish objects room willy loses life touches hazard guardian falls far returned point entered room may lead game-ending situation willy repeatedly falls height unavoidably collides guardian losing lives succession one bizarrely named rooms game must perform quirkafleeg pre-release name screen gaping pit reference comic strip fat freddy cat spin-off fabulous furry freak brothers original comic quirkafleeg obscure ritual foreign country required performed upon sight dead furry animals music spectrum version beethoven moonlight sonata menu rich man game early release versions played grieg hall mountain king in-game music music c64 version beethoven moonlight sonata loading j.s bach inventions 1 gameplay upon release game could completed due several bugs although four completely unrelated issues became known collectively attic bug entering attic screen various rooms would undergo corruption subsequent playthroughs including monsters disappearing chapel level screens triggering game caused error path arrow attic resulting sprite traveling past end spectrum video memory overwriting crucial game data instead initially software projects attempted pass bug intentional feature make game difficult claiming rooms question filled poison gas however later rescinded claim issued set pokes correct flaws despite bugs ross holman cameron else competition software projects set completion jet set willy provided software projects set bug fixes software projects hired cameron else port manic miner jet set willy msx reviewing jet set willy spectrum magazine june 1984 sue denham wrote game every bit good refreshing original game number one uk spectrum sales chart several months replaced sabre wulf final issue sinclair zx spectrum version ranked number 32 sinclair official top 100 games time voted number 33 sinclair readers top 100 games time 2004 zx spectrum version voted 6th best game time retro gamer readers article originally intended special issue sinclair bundled retro gamer game included 1985 compilation sold million along beach-head daley thompson decathlon sabre wulf jet set willy came form copy protection card 180 coloured codes bundled cassette upon loading one codes card entered game would start although cassette could duplicated copy card also needed time home colour reproduction difficult making jet set willy harder copy spectrum games however means circumventing card quickly found one method published uk computer magazine original releases jet set willy bbc micro commodore 64 also contained bugs made impossible complete game—though different bugs spectrum version commodore 64 version impossible reach items wine cellar two versions original jet set willy msx software projects version sold uk dated 1984 programmed cameron else co-winner jet set willy competition version published hudson soft 1985 bee card japan port jet set willy atari 8-bit family computers released tynesoft 1986 received generally poor reviews criticised inferior graphics animation however rob hubbard theme music unique version considered highlight like spectrum version impossible complete different reasons legitimate items needed caused player lose life e.g bottles licence ports software projects amiga atari st cancelled release jet set willy final frontier expanded version amstrad cpc later converted back zx spectrum released jet set willy ii original game jet set willy ii released bbc micro acorn electron msx commodore 16 commodore 64 differently expanded version jet set willy released dragon 32/64 extra rooms version could also completed impossible traverse drive right-to-left direction necessary return bed collecting items game could however completed using built-in cheat accessed holding keys x simultaneously allowing start willy position screen using arrow keys spacebar dragon port converted run acorn archimedes computers better collision detection meant drive could completed right-to-left unlike dragon original spectrum version rooms stored straightforward format compression making relatively easy create customised versions game review jsw issue 4 spectrum included section entitled jsw — hacker guide remarks section imply author successfully deduced least data structures since able remove sections wall master bedroom following year issue 13 contained program added extra room april showers game issue 15 described data formats detail several third-party editing tools published 1984 1986 allowing players design rooms sprites following platform games mould miner willy series purpose game collect objects complete scenes game | [
1220,
7719,
9322,
4109,
4973,
9006,
10862,
10931,
599,
9310,
8415
] | None |
1,528 | 4 | Jason_Healey:jason healey jason healey senior research scholar faculty international public affairs adjunct professor international public affairs school international public affairs columbia university also senior fellow cyber statecraft initiative atlantic council program founding director published several academic articles essays books topic cyber security advised security measures corporate government military institutions identified first historian cyber conflict healy born raised rhode island 17 joined united states air force initially training fighter pilot healey transitioned signals intelligence 1998 began working pentagon implement computer network defense system air force career jason awarded two meritorious service medals based contributions cyber security service pentagon healey later received master degree information security james madison university healey worked numerous settings regard cyber policy implementation addressing responses security threats hong kong served vice president goldman sachs developed crisis-response system built address incidents across asian continent also worked white house director cyber infrastructure protection currently board member cyber conflict studies association military cyber professionals association extent work led one magazine refer healey first historian cyber conflict frequently healey publicly commented written articles high-profile malware threats cyber policy instance healey discussed potential advantages disadvantages united states launching cyber-based attacks regards offensive syria stated longer drop physical bombs kill people targeted non-lethal microforce surmised due past leaks united states involvement stuxnet relevant government agencies may decided healey also commented heartbleed bug noting failure nsa live stated priority defense exposing bug found said organization would shredded computer security community failure 2013 healey also took critical stance current state mass surveillance united states predicted u.s. interests abroad would suffer deep long term damage given administration could implement alternatives spying conducted national security agency 2012 healey published fierce domain cyber conflict 1986 2012 explores idea confrontations taken place within cyberspace established new kind conflict development explored historically starting 1986 hacking initiative planned kgb steal military plans u.s. referred cuckoo egg case book received positive reception referred definitive historical record cyber conflict march 2014 forbes magazine identified healey one twenty cyber policy experts follow twitter | [
3843,
7887
] | None |
1,529 | 4 | ISheriff:isheriff isheriff formerly internet sheriff internet security software vendor specializes cloud-based security compliance specialties e-mail filtering web filters endpoint security company privately held based redwood city california founded brisbane australia 1999 isheriff products focused content filtering email web filtering software appliances 2009 company moved products cloud computing service model isheriff services include e-mail filtering web filtering email archiving e-mail encryption security reporting company holds patent data modeling engine based bayesian spam filtering principals 2006 isheriff provided internet filtering software tasmanian government first statewide trial anti-pornography filters children july 2012 total defense inc. provider cybercrime-fighting technology announced acquired isheriff april 21 2014 total defense announced conjunction sale consumer business unit untangle re-branded isheriff isheriff founded oscar marquez ceo /cto email security archiving – cloud-based anti-spam email security email archiving removing incoming email spam providing clean email connection secures viruses unwanted content data leakage well cloud-based archiving web security cloud-based content malware filtering providing secure internet browsing enforcement acceptable use policies data leak protection endpoint security cloud-based platform multi-layer anti-malware approach protects malware secures controls applications used end users protects threats removable media isheriff sells products partners distributors | [
4194,
11046,
8747,
4945,
569,
7515,
9053
] | None |
1,530 | 3 | Hatari_(emulator):hatari emulator hatari open-source emulator atari st 16/32-bit computer system family emulates atari st atari ste atari tt atari falcon computer series corresponding peripheral hardware like joysticks mouse midi printer serial floppy hard disks supports graphics modes st require original tos image supports emutos latest version reported issues st/ste/tt applications emulation compatibility also st/ste games demos work without issues hatari uses source code several emulators winston atari st peripherals uae motorola 680x0 cpu winuae accurate motorola 68030 cpu mmu stonx blitter aranym motorola 56001 dsp videl nvram hatari uses sdl library graphics developed linux ported many oses amigaos 4 aros bsd beos risc os morphos macos amigaos windows | [
7299,
6797,
7983,
5264,
3793,
10480,
6100,
5397,
823,
6104,
8761,
2045,
9151
] | Test |
1,531 | 2 | Auxiliary_storage_pool:auxiliary storage pool ibm operating system disk drives may grouped auxiliary storage pool asp order organize data limit impact storage-device failures reduce recovery time disk failure occurs data pool containing failed unit needs recovered asps may also used improve performance isolating objects similar performance characteristics example journal receivers pool default disk drives assigned pool 1 additional pools created rarely done anymore concept ibm pools similar unix/linux concept volume groups however ibm typical disk drives assigned single asp | [
1801,
3323,
5492,
823
] | Validation |
1,532 | 4 | Howard_Barlow:howard barlow howard c. barlow 1918 – 2003 american cryptographer telecommunications expert high-ranking civilian employee national security agency nsa united states barlow graduate carnegie institute technology b.s electrical engineering served european theatre world war ii one major assignments communications planning officer invasion normandy 1944 overseas designed various types specialized communications equipment war barlow stayed cryptologic profession joined civilian armed forces security agency later became nsa worked research development division one first communications security comsec engineers 1954 risen level division chief 1955-1956 barlow attended harvard university middle management program graduating master degree business administration returning nsa took tour operations named deputy director research development 1958 held position 1962 made assistant director comsec adc position held 1973 insights management skills created world-class analytic engineering organization able meet communications needs vietnam war cold war political skills enabled nsa forge significant comsec relationships u.s allies become leader comsec nato long illustrious career howard barlow received many awards including nsa exceptional civilian service award 1967 1973 department defense distinguished civilian service award highest award granted civilian dod barlow died 2003 | [
7887
] | Test |
1,533 | 2 | Nokia_N70:nokia n70 nokia n70 3g smartphone nokia created jake henderson announced part nokia new line multimedia smartphones nseries april 27 2005 started shipping september 2005 runs s60 2nd edition feature pack 3 symbian v8.1 operating system succeeded nokia n73 n70 popular sold well nokia n70 model n70-1 one handsets nokia nseries lineup smart phones equipped 2-megapixel camera built-in flash front vga camera allow video calling fm radio bluetooth digital music player functionality support 3d symbian java games s60 2nd edition software time launch n70 built-in memory alongside system memory penultimate related n72 symbian os 8.x device released nokia since introduction new os9 platform released 2003 offers flexibility original made 1998 upgraded 2006 nokia released n70 music edition phone n70-5 variant n70 without 3g front camera shipped china mexico east europe markets provides lower-cost option users want need 3g services 2006 nokia released music edition series n70 n73 n91 black housing new sales boxes packages special extra storage capacity compared standard models music edition n70-1 model featured 1 gb memory card 3.5 mm audio adapter remote control ad-41 headphones hs-28 dedicated music button place multimedia key button music edition also features new themes colored green red speakers music interface phone improved http //www.sistemyolu.org/forum/nokia-eseries-s60-3-2-phones-nokia-e55-and-nokia-e75-f96.html | [
1537,
8577,
3205,
11655,
9359,
1424,
529,
2449,
8083,
10770,
5143,
2072,
7063,
5274,
5019,
5659,
669,
8472,
11545,
4003,
4132,
6310,
167,
40,
3626,
5290,
10410,
5677,
7983,
690,
10802,
7220,
821,
5175,
7866,
1083,
1728,
7617,
4291,
7877,
... | None |
1,534 | 3 | PowerBook_180:powerbook 180 powerbook 180 portable computer released apple computer inc. along powerbook 160 october 1992 time constituted new top-of-the-range model replacing previous powerbook 170 case design features 170 shipped powerful 33 mhz motorola 68030 cpu motorola 68882 fpu along 160 introduced new power saving feature allowed processor run slower 16 mhz rate speed original 140 powerbook 180 came diagonal active matrix lcd screen capable displaying 4-bit grayscale trackball mounted beneath keyboard 1.44 mb floppy disk drive 80 mb 2.5-inch hard drive also standard apple powerbook also gave option possible expansion 120 mb hard drive equipped keyboard stands slant keyboard like macintosh portable addition external color video port missing 170 180 became full-featured no-compromises desktop replacement equivalent performance macintosh lc iii+ sold may 1994 june 1993 apple released identical color version model powerbook 180c pictured diagonal active matrix color lcd capable displaying 256 colors first powerbook natively display 640x480 previous powerbooks 640x400 resolution result thicker color display exterior case lid redesigned closely resembling used powerbook duo series modification used powerbook 165c accommodate thicker color display well | [
7697,
4114,
6165,
11289,
7706,
8222,
1057,
6183,
1576,
4139,
7211,
8253,
1090,
4180,
10838,
10840,
9312,
8806,
6258,
10357,
4220,
10365,
10878,
6783,
7299,
4741,
8842,
6283,
7824,
147,
7830,
6807,
4258,
7842,
7844,
7869,
8893,
8896,
4807,
... | Validation |
1,535 | 9 | IBM_BASIC:ibm basic ibm personal computer basic commonly shortened ibm basic programming language first released ibm ibm personal computer model 5150 ibm pc 1981 ibm released four different versions microsoft basic interpreter licensed microsoft pc pcjr known cassette basic disk basic advanced basic basica cartridge basic versions disk basic advanced basic included ibm pc dos pc dos 4 addition features ansi standard basic ibm versions offered support graphics sound hardware ibm pc line source code could typed full-screen editor limited facilities provided rudimentary program debugging ibm also released version microsoft basic compiler pc concurrently release pc dos 1.10 1982 ibm licensed microsoft basic ibm personal computer despite already version basic company mainframes estridge said microsoft basic hundreds thousands users around world going argue ibm cassette basic came 32 kilobytes kb read-only memory rom separate 8 kb bios rom original ibm pc require operating system run cassette basic provided default user interface invoked bios int 18h floppy disk drive installed boot code find bootable floppy disk power name cassette basic came use cassette tapes rather floppy disks store programs data cassette basic built roms original pc xt early models ps/2 line supported loading saving programs ibm cassette tape interface unavailable models original model 5150 entry-level version 5150 came 16 kb random-access memory ram sufficient run cassette basic however cassette basic rarely used pcs sold without disk drive sold pc dos sufficient ram least run disk basic—many could run advanced basic well three versions cassette basic c1.00 found early ibm pcs 16k-64k motherboards c1.10 found later ibm pcs xts ats ps/2s c1.20 found pcjr ibm disk basic basic.com included original ibm pc dos uses 32 kb cassette basic rom basic.com run even highly compatible pc clones compaq portable name disk basic came use floppy disks well cassette tapes store programs data disk-based code corrected errata rom-resident code added floppy disk serial port support disk basic could identified use letter preceding version number added disk support features lacking cassette basic include extended sound/graphics functions basica primary purpose disk basic light version ibm pcs 48 kb memory basic.com would 23 kb free user code whereas basica would 17 kb 1986 new pcs shipped least 256k dos versions 3.00 reduced disk basic small stub called basica.com compatibility batch files even excess ram basic would still allocate manage 61 kb user programs whether cassette basic basic.com basica ibm advanced basic basica.com also included original ibm pc dos required rom-resident code cassette basic added functions diskette file access storing programs disk monophonic sound using pc built-in speaker graphics functions set clear pixels draw lines circles set colors event handling communications joystick presses basica would run non-ibm computers even so-called 100 compatible machines later ibm models since lack needed rom basic basica versions respective dos beginning v1.00 ending v3.30 early versions basica support subdirectories graphics commands functioned slightly differently example line statement used draw lines trailed off-screen basic would merely intersect nearest adjacent line basic 2.x went screen intersect paint command basic 1.x begins filling coordinate specified expands outward alternating directions basic 2.x fills everything starting coordinate finishing everything basic 1.x paint command also makes use system stack storage filling complex areas possible produce overflow error remedy clear statement used expand basic stack 128 bytes default size basic 2.x use stack painting thus free problem compaq basic 1.13 first standalone basic pc require cassette basic run well version basic besides ibm basica 1.00 1.10 use fcbs include original line statement intersecting lines paint statement compaq basic 1.13 worked like later versions basica/gw-basic using new fill algorithm stack early versions pc dos included several sample basic programs demonstrating capabilities pc including basica game donkey.bas gw-basic identical basica exception including cassette basic code program thus allowing run non-ibm computers later ibm models lack cassette basic rom rom cartridge version basic available ibm pcjr shipped 1984 supported additional graphics modes sound capabilities possible machine superset advanced basic cartridge basic operate within first 128 kb memory pcjr work expansion ram i.e def seg function used point memory segments h1ff0 cartridge basic activated typing basica dos prompt conversely ibm basica versions 2.1 refuse run detects pcjr patched work around cassette basic loads pc pcjr booted without bootable disk cartridge disk basic advanced basic load command name basic basica respectively typed dos command prompt except pcjr activates cartridge basic instead optional parameters control allocation memory loaded sign-on identification message displays program version number full-screen text editor starts see images right function keys assigned common commands display bottom screen commands may typed load save programs expressions typed executed direct immediate mode line input starts number language system stores following line text part program source allowing programmer enter entire program line line entering line numbers statement listed screen lines displayed order increasing line number changes made displayed line program source code moving cursor line cursor keys typing on-screen text program source stored internally tokenized form reserved words replaced single byte token save space execution time programs may saved compact tokenized form optionally saved dos ascii text files viewed edited programs like dos applications ibm basic text-mode program features windows icons mouse support cut-and-paste editing gw-basic launched 1983 disk-based microsoft product distributed non-ibm ms-dos computers supports graphics modes features basica computers ibm cassette basic successor basica ms-dos pc dos versions discontinued qbasic launched 1991 stripped-down version microsoft quickbasic compiler qbasic interpreter compile source files quickbasic compile save programs .exe executable file format | [
11008,
5635,
6148,
3718,
7691,
1805,
9997,
786,
11412,
22,
3736,
3481,
9881,
797,
1952,
3233,
11683,
5925,
8101,
4136,
10666,
8494,
303,
7343,
7983,
11315,
2874,
315,
7355,
7486,
7870,
4160,
5312,
4674,
4548,
8262,
10750,
712,
9166,
847,
... | Test |
1,536 | 0 | Speech-generating_device:speech-generating device speech-generating devices sgds also known voice output communication aids electronic augmentative alternative communication aac systems used supplement replace speech writing individuals severe speech impairments enabling verbally communicate sgds important people limited means interacting verbally allow individuals become active participants communication interactions particularly helpful patients suffering amyotrophic lateral sclerosis als recently used children predicted speech deficiencies several input display methods users varying abilities make use sgds sgds multiple pages symbols accommodate large number utterances thus portion symbols available visible one time communicator navigating various pages speech-generating devices produce electronic voice output using digitized recordings natural speech speech synthesis—which may carry less emotional information permit user speak novel messages content organization updating vocabulary sgd influenced number factors user needs contexts device used development techniques improve available vocabulary rate speech production active research area vocabulary items high interest user frequently applicable range meanings pragmatic functionality multiple methods accessing messages devices directly indirectly using specialized access devices—although specific access method depend skills abilities user sgd output typically much slower speech although rate enhancement strategies increase user rate output resulting enhanced efficiency communication first known sgd prototyped mid-1970s rapid progress hardware software development meant sgd capabilities integrated devices like smartphones notable users sgds include stephen hawking roger ebert tony proudfoot pete frates founder als ice bucket challenge speech-generating systems may dedicated devices developed solely aac non-dedicated devices computers running additional software allow function aac devices sgds roots early electronic communication aids first aid sip-and-puff typewriter controller named patient-operated selector mechanism possum prototyped reg maling united kingdom 1960 possum scanned set symbols illuminated display researchers delft university netherlands created lightspot operated typewriter lot 1970 made use small movements head point small spot light matrix characters equipped photoelectric cell although commercially unsuccessful lot well received users 1966 barry romich freshman engineering student case western reserve university ed prentke engineer highland view hospital cleveland ohio formed partnership creating prentke romich company 1969 company produced first communication device typing system based discarded teletype machine 1970s early 1980s several companies began emerge since become prominent manufacturers sgds toby churchill founded toby churchill ltd 1973 losing speech following encephalitis us dynavox known sentient systems technology grew student project carnegie-mellon university created 1982 help young woman cerebral palsy communicate beginning 1980s improvements technology led greatly increased number variety performance commercially available communication devices reduction size price alternative methods access target scanning also known eye pointing calibrate movement user eyes direct sgd produce desired speech phase scanning alternatives presented user sequentially became available communication devices speech output possibilities included digitized synthesized speech rapid progress hardware software development continued including projects funded european community first commercially available dynamic screen speech generating devices developed 1990s software programs developed allowed computer-based production communication boards high-tech devices continued become smaller lighter increasing accessibility capability communication devices accessed using eye-tracking systems perform computer word-processing internet use environmental control device independent access equipment tv radio telephones stephen hawking came associated unique voice particular synthesis equipment hawking unable speak due combination severe disabilities caused als emergency tracheotomy past 20 years sgd gained popularity amongst young children speech deficiencies autism syndrome predicted brain damage due surgery starting early 2000s specialists saw benefit using sgds adults children well neuro-linguists found sgds effective helping children risk temporary language deficits undergoing brain surgery patients als particular digitized sgds used communication aids pediatric patients recovery process many methods accessing messages devices directly indirectly specialized access devices direct access methods involve physical contact system using keyboard touch screen users accessing sgds indirectly specialized devices must manipulate object order access system maneuvering joystick head mouse optical head pointer light pointer infrared pointer switch access scanner specific access method depend skills abilities user direct selection body part pointer adapted mouse joystick eye tracking could used whereas switch access scanning often used indirect selection unlike direct selection e.g. typing keyboard touching screen users target scanning make selections scanning indicator cursor electronic device desired choice unable point typically calibrate eyes use eye gaze way point blocking way select desired words phrases speed pattern scanning well way items selected individualized physical visual cognitive capabilities user augmentative alternative communication typically much slower speech users generally producing 8–10 words per minute rate enhancement strategies increase user rate output around 12–15 words per minute result enhance efficiency communication given sgd may large number vocal expressions facilitate efficient effective communication including greetings expressing desires asking questions sgds multiple pages symbols accommodate large number vocal expressions thus portion symbols available visible one time communicator navigating various pages speech-generating devices generally display set selections either using dynamically changing screen fixed display two main options increasing rate communication sgd encoding prediction encoding permits user produce word sentence phrase using one two activations sgd iconic encoding strategies semantic compaction combine sequences icons picture symbols produce words phrases numeric alpha-numeric letter encoding also known abbreviation-expansion words sentences coded sequences letters numbers example typing hh g1 greeting 1 may retrieve hello prediction rate enhancement strategy sgd attempts reduce number keystrokes used predicting word phrase written user user select correct prediction without needing write entire word word prediction software may determine choices offered based frequency language association words past choices user grammatical suitability however users shown produce words per minute using scanning interface static keyboard layout predictive grid layout suggesting cognitive overhead reviewing new arrangement cancels benefits predictive layout using scanning interface another approach rate-enhancement dasher uses language models arithmetic coding present alternative letter targets screen size relative likelihood given history rate words produced depend greatly conceptual level system talk system allows users choose large numbers sentence-level utterances demonstrated output rates excess 60 wpm fixed display devices refer symbols items fixed particular format sources refer static displays display devices simpler learning curve devices fixed display devices replicate typical arrangement low-tech aac devices low-tech defined devices need batteries electricity electronics like communication boards share disadvantages example typically restricted limited number symbols hence messages important note technological advances made twenty-first century fixed-display sgds commonly used anymore dynamic displays devices usually also touchscreen devices typically generate electronically produced visual symbols pressed change set selections displayed user change symbols available using page links navigate appropriate pages vocabulary messages home page dynamic display device may show symbols related many different contexts conversational topics pressing one symbols may open different screen messages related topic example watching volleyball game user may press sport symbol open page messages relating sport press symbol showing scoreboard utter phrase score advantages dynamic display devices include availability much larger vocabulary ability see sentence construction advantage dynamic display devices underlying operating system capable providing options multiple communication channels including cell phone text messaging e-mail work linköping university shown email writing practices allowed children sgd users develop new social skills increase social participation low cost systems also include keyboard audio speaker combination without dynamic display visual screen type keyboard sends typed text direct audio speaker permit phrase spoken without need visual screen always required one simple benefit talking keyboard used standard telephone speakerphone enable voice impaired individual 2 way conversation telephone output sgd may digitized and/or synthesized digitized systems play directly recorded words phrases synthesized speech uses text-to-speech software carry less emotional information permits user speak novel messages typing new words today individuals use combination recorded messages text-to-speech techniques sgds however devices limited one type output words phrases entire messages digitised stored onto device playback activated user process formally known voice banking advantages recorded speech include provides natural prosody speech naturalness listener e.g. person age gender aac user selected record messages b provides additional sounds may important user laughing whistling moreover digitized sgds provide degree normalcy patient families lose ability speak major disadvantage using recorded speech users unable produce novel messages limited messages pre-recorded device depending device may limit length recordings sgds use synthesized speech apply phonetic rules language translate user message voice output speech synthesis users freedom create novel words messages limited pre-recorded device others smartphones computers increased use synthesized speech devices creation apps allow user select list phrases messages spoken voice language user chosen apps speakit assistive express iphone provide cheap way use speech-generating device without visit doctor office learn use specialized machinery synthesized sgds may allow multiple methods message creation used individually combination messages created letters words phrases sentences pictures symbols synthesized speech virtually unlimited storage capacity messages demands memory space synthesized speech engines available many languages engine parameters speech rate pitch range gender stress patterns pauses pronunciation exceptions manipulated user selection set sgd set messages symbols codes available person using device content organisation updating selection set areas active research influenced number factors including user ability interests age selection set aac system may include words user know yet – included user grow content installed given sgd may include large number preset pages provided manufacturer number additional pages produced user user care team depending user needs contexts device used researchers beukelman mirenda list number possible sources family members friends teachers care staff selection initial content sgd range sources required general one individual would knowledge experience generate vocal expressions needed given environment example parents therapists might think add slang terms innit previous work analyzed vocabulary use typically developing speakers word use aac users generate content new aac devices processes work well generating core set utterances vocal expressions less effective situations particular vocabulary needed example terms related directly user interest horse riding term fringe vocabulary refers vocabulary specific unique individual personal interests needs typical technique develop fringe vocabulary device conduct interviews multiple informants siblings parents teachers co-workers involved persons researchers musselwhite st. louis suggest initial vocabulary items high interest user frequently applicable range meanings pragmatic functionality criteria widely used aac field ecological check sgd content beukelman mirenda emphasize vocabulary selection also involves ongoing vocabulary maintenance however difficulty aac users carers must program new utterances manually e.g names new friends personal stories existing commercial solutions automatically adding content number research approaches attempted overcome difficulty range inferred input generating content based log conversation user friends family data mined internet find language materials webcrawler project moreover making use lifelogging based approaches device content changed based events occur user day accessing user data high-quality messages generated risk exposing sensitive user data example making use global positioning systems device content changed based geographical location many recently developed sgds include performance measurement analysis tools help monitor content used individual raises concerns privacy argue device user involved decision monitor use way similar concerns raised regarding proposals devices automatic content generation privacy increasingly factor design sgds aac devices designed used areas user life sensitive legal social technical issues centred wide family personal data management problems found contexts aac use example sgds may designed support user right delete logs conversations content added automatically programming dynamic speech generating devices usually done augmentative communication specialists specialists required cater needs patients patients usually choose kinds words/ phrases want example patients use different phrases based age disability interests etc therefore content organization extremely time consuming additionally sgds rarely covered health insurance companies result resources limited regards funding staffing dr. john costello boston children hospital driving force soliciting donations keep program running well-staffed within hospital hospitals across country | [
3533
] | Test |
1,537 | 2 | Nokia_N800:nokia n800 nokia n800 internet tablet wireless internet appliance nokia originally announced las vegas ces 2007 summit january 2007 n800 allows user browse internet communicate using wi-fi networks mobile phone via bluetooth n800 developed successor nokia 770 includes fm internet radio rss news reader image viewer media player audio video files note usb port uses mini-b socket instead mini-ab specially grounded adaptor required make full use usb otg client/host auto-switching switching done software regular adaptors though usb otg provides 100 current versus full-size usb 500 devices larger current requirements need used powered usb hub n800 like nokia internet tablets runs maemo similar many handheld operating systems provides home screen—the central point applications settings accessed home screen divided areas launching applications menu bar large customisable area display information rss reader internet radio player google search box example maemo modified version debian n800 bundled several applications including mozilla-based microb browser macromedia flash gizmo skype n800 use maemo os comes number built-in applications additional applications installed number sources including various official community | [
3585,
529,
10770,
5143,
2072,
5659,
6178,
4132,
40,
3626,
9266,
10802,
7220,
5175,
10820,
6216,
11337,
9292,
7246,
1615,
5199,
5201,
7253,
5211,
6748,
1633,
109,
2179,
3205,
9359,
1682,
10393,
5274,
669,
6310,
167,
5290,
10410,
7866,
1728... | Test |
1,538 | 1 | Soterml:soterml soterml soil terrain markup language xml-based markup language storing exchanging soil terrain related data soterml development done within e-soter platform geoss plans global earth observation system within framework e-soter project addresses felt need global soil terrain database centre geospatial science currently nottingham gepospatial institute university nottingham initiated development since january 2009 development maintenance currently handled national soil resources institurte nsri cranfield university uk role cgs within development e-soter dissemination platform based inspire principles soterml development included 1 development data dictionary nomenclatures various data sources data metadata 2 development exchange format/procedures world reference base 2006 | [] | Test |
1,539 | 7 | NetSuite:netsuite netsuite founded 1998 evan goldberg original name netledger offered web-hosted accounting software oracle licensed software banner oracle small business suite short time cancellation netsuite widely seen first cloud computing software company company ’ 1999 founding pre-dating salesforce.com month goldberg chairman chief technology officer oracle acquisition july 2002 zach nelson appointed ceo prior joining netsuite nelson ran early provider business applications internet called mycio.com division mcafee corp experience led belief software would delivered internet left mcafee join netsuite led company 1 million revenue billion-dollar run-rate prior acquisition oracle corp. january 4 2007 netsuite named moneyball general manager billy beane major league baseball oakland board directors evan goldberg cited beane ability combine facts instinct important factor decision involve company netsuite became publicly traded company initial public offering ipo 6.2 million shares new york stock exchange december 2007 one quarter employees based philippine office netsuite additional offices denver las vegas austin chicago atlanta new york city boston toronto united kingdom spain czech republic hong kong singapore australia uruguay 1998 evan goldberg received approximately 125 million initial financial backing larry ellison founder chief executive officer oracle corporation ellison venture capital entity tako ventures initial investors starvest partners adp ubs painewebber netsuite software also relies database software licensed oracle ellison family members owned approximately 47.4 netsuite common stock december 31 2014 firm 10-q filing march 2 2015 stated mr. ellison able exercise control approval significant corporate transactions including change control liquidation july 28 2016 oracle announced offered purchase netsuite 9.3 billion deal faced intense scrutiny oracle founder larry ellison owned nearly 40 netsuite conflict interest led board companies establish independent committees review deal perspective independent shareholders major netsuite shareholders t. rowe notified oracle would tendering shares current terms proposed deal early october 2016 oracle extended deadline shareholders netsuite tender shares november 4 deal closed nov. 7 netsuite offers four main software solutions optional implementation support services | [
4236,
10509,
10893,
911,
1680,
1935,
4623,
8592,
2965,
2328,
4377,
8986,
8353,
8994,
6307,
9766,
5159,
8871,
7721,
1707,
6444,
5677,
8495,
3121,
9010,
9012,
7352,
10553,
1594,
2496,
4289,
6338,
7489,
9665,
6341,
1224,
6729,
8520,
1612,
44... | None |
1,540 | 4 | Matt_Suiche:matt suiche matthieu suiche born september 22 1988 also known matt handle msuiche french hacker entrepreneur widely known founder moonsols co-founder cloudvolumes acquired vmware 2014 march 2014 suiche highlighted one 100 key french developers report french minister fleur pellerin suiche best known work memory forensics computer security fields notable research contributions include windows hibernation file analysis mac os x physical memory analysis furthermore created livecloudkd utility analyze running microsoft hyper-v virtual machines microsoft technical fellow mark russinovich highlighted blog introducing similar feature one microsoft tools russinovich also said impressed invited matthieu speak live kernel debugging livecloudkd year ’ bluehat security briefings also known discovered multiple security flaws multiple microsoft windows kernel components suiche microsoft valuable professional enterprise security suiche started career independent security researcher presenting work microsoft windows hibernation file first time international conference pacsec held tokyo 2007 also invited europol speak internal high tech crime experts meeting 2008 2009 2010 worked researcher netherlands forensic institute hague starting moonsols specialized memory forensics incident response suiche also contributor samba project google summer code 2008 charge implementing new compression algorithms used networking protocols 2011 suiche founded cloudvolumes formerly snapvolumes california-based virtualization management product company served chief scientist suiche also frequent speaker various computer security conferences black hat briefings microsoft blue hat hacker conference shakacon hackito ergo sum europol high tech crime experts meeting cansecwest pacsec hack box syscan shakacon board program committee shakacon security conference one founders hackito ergo sum security conference paris 2012 suiche one security researchers along several well-known security researchers submitted bogus article entitled nmap internet considered harmful darpa inference checking kludge scanning hakin9 information security magazine article used social proof demonstrate lack relevance expertise certain media dedicated information security also criticize spamming techniques used media order generate quantity-oriented data rather quality-oriented information following year article resulted awarded 2013 pwnie awards attributed hakin9 epic fail category | [
161,
2275,
3109,
5363,
1525,
7605,
9655,
7449,
9051,
4956,
2558,
9375
] | None |
1,541 | 5 | Network_congestion:network congestion network congestion data networking queueing theory reduced quality service occurs network node link carrying data handle typical effects include queueing delay packet loss blocking new connections consequence congestion incremental increase offered load leads either small increase even decrease network throughput network protocols use aggressive retransmissions compensate packet loss due congestion increase congestion even initial load reduced level would normally induced network congestion networks exhibit two stable states level load stable state low throughput known congestive collapse networks use congestion control congestion avoidance techniques try avoid collapse include exponential backoff protocols csma/ca 802.11 similar csma/cd original ethernet window reduction tcp fair queueing devices routers network switches techniques address congestion include priority schemes transmit packets higher priority ahead others explicit allocation network resources specific flows use admission control network resources limited including router processing time link throughput resource contention may occur networks number common circumstances wireless lan easily filled single personal computer even fast computer networks backbone easily congested servers client pcs denial-of-service attacks botnets capable filling even largest internet backbone network links generating large-scale network congestion telephone networks mass call event overwhelm digital telephone circuits congestive collapse congestion collapse condition congestion prevents limits useful communication congestion collapse generally occurs choke points network incoming traffic exceeds outgoing bandwidth connection points local area network wide area network common choke points network condition settles stable state traffic demand high little useful throughput available packet delay loss occur quality service extremely poor congestive collapse identified possible problem 1984 first observed early internet october 1986 nsfnet phase-i backbone dropped three orders magnitude capacity 32 kbit/s 40 bit/s continued end nodes started implementing van jacobson congestion control 1987 1988 packets sent could handled intermediate routers intermediate routers discarded many packets expecting end points network retransmit information however early tcp implementations poor retransmission behavior packet loss occurred endpoints sent extra packets repeated information lost doubling incoming rate congestion control modulates traffic entry telecommunications network order avoid congestive collapse resulting oversubscription typically accomplished reducing rate packets whereas congestion control prevents senders overwhelming network flow control prevents sender overwhelming receiver theory congestion control pioneered frank kelly applied microeconomic theory convex optimization theory describe individuals controlling rates interact achieve optimal network-wide rate allocation examples optimal rate allocation max-min fair allocation kelly suggestion proportionally fair allocation although many others possible let formula_1 rate flow formula_2 formula_3 capacity link formula_4 formula_5 1 flow formula_2 uses link formula_4 0 otherwise let formula_8 formula_9 formula_10 corresponding vectors matrix let formula_11 increasing strictly concave function called utility measures much benefit user obtains transmitting rate formula_8 optimal rate allocation satisfies lagrange dual problem decouples flow sets rate based price signalled network link capacity imposes constraint gives rise lagrange multiplier formula_15 sum multipliers formula_16 price flow responds congestion control becomes distributed optimisation algorithm many current congestion control algorithms modelled framework formula_15 either loss probability queueing delay link formula_4 major weakness assigns price flows sliding window flow control causes burstiness causes different flows observe different loss delay given link among ways classify congestion control algorithms mechanisms invented prevent network congestion deal network collapse correct endpoint behavior usually repeat dropped information progressively slow repetition rate provided endpoints congestion lifts network resumes normal behavior strategies slow-start ensure new connections n't overwhelm router congestion detection initiates common router congestion avoidance mechanisms include fair queuing scheduling algorithms random early detection red packets randomly dropped congestion detected proactively triggers endpoints slow transmission congestion collapse occurs fair queuing useful routers choke points small number connections passing larger routers must rely red end-to-end protocols designed behave well congested conditions tcp well known example first tcp implementations handle congestion described 1984 van jacobson inclusion open source solution berkeley standard distribution unix bsd 1988 first provided good behavior udp control congestion protocols built atop udp must handle congestion independently protocols transmit fixed rate independent congestion problematic real-time streaming protocols including many voice ip protocols property thus special measures quality service must taken keep packets dropped presence congestion general congestion pure datagram networks must kept periphery network mechanisms handle congestion internet backbone problematic cheap fiber-optic lines reduced costs internet backbone allowing provisioned enough bandwidth keep congestion periphery connection-oriented protocols widely used tcp protocol generally watch packet errors losses delays see quality service adjust transmit speed various network congestion avoidance processes support different trade-offs tcp congestion avoidance algorithm primary basis congestion control internet problems occur concurrent tcp flows experience port queue buffer tail-drops defeating tcp automatic congestion avoidance flows experience port queue buffer tail-drop begin tcp retrain moment – called tcp global synchronization active queue management aqm reorder drop network packets inside transmit buffer associated network interface controller nic task performed network scheduler one solution use random early detection red network equipment port queue buffer network equipment ports one queue buffer weighted random early detection wred could used available red indirectly signals sender receiver deleting packets e.g average queue buffer lengths threshold e.g 50 deletes linearly cubically packets e.g 100 average queue buffer lengths computed 1 second intervals robust random early detection rred algorithm proposed improve tcp throughput denial-of-service dos attacks particularly low-rate denial-of-service ldos attacks experiments confirmed red-like algorithms vulnerable low-rate denial-of-service ldos attacks due oscillating tcp queue size caused attacks network equipment equipped ports follow measure flow flowbased-red/wred thereby able signal big bandwidth flow according quality service policy policy could divide bandwidth among flows criteria another approach use ip explicit congestion notification ecn ecn used two hosts signal want use method protocol bit used signal explicit congestion better indirect packet delete congestion notification performed red/wred algorithms requires explicit support hosts ecn coauthor sally floyd published detailed information ecn including version required cisco ios router receives packet marked ecn-capable anticipates using red congestion sets ecn flag notifying sender congestion sender respond decreasing transmission bandwidth e.g. decreasing tcp window size sending rate means cisco systems engine iv v capability classify flows aggressive bad adaptive good ensures flows fill port queues dbl utilize ip ecn instead packet-delete-signalling congestion avoidance achieved efficiently reducing traffic application requests large file graphic web page usually advertises window 32k 64k results server sending full window data assuming file larger window many applications simultaneously request downloads data creates congestion point upstream provider flooding queue using device reduce window advertisement remote servers send less data thus reducing congestion technique reduce network congestion factor 40 backward ecn becn another proposed congestion mechanism uses icmp source quench messages ip signalling mechanism implement basic ecn mechanism ip networks keeping congestion notifications ip level requiring negotiation network endpoints effective congestion notifications propagated transport layer protocols tcp udp appropriate adjustments protocols avoid congestive collapse often based idea data loss caused congestion true nearly cases errors transmission rare however causes wifi 3g networks radio layer poor throughput cases since wireless networks susceptible data loss due interference tcp connections running radio based physical layer see data loss tend erroneously believe congestion occurring slow-start protocol performs badly short connections older web browsers created many short-lived connections opened closed connection file kept connections slow start mode slowed response times avoid problem modern browsers either open multiple connections simultaneously reuse one connection files requested particular server initial performance poor many connections never get slow-start regime significantly increasing latency admission control requires devices receive permission establishing new network connections new connection risks creating congestion permission denied one example use contention-free transmission opportunities cftxops itu-t g.hn standard provides high-speed 1 gbit/s local area networking varying wires power lines phone lines coaxial cables | [
5,
3725,
4883,
11413,
5402,
5531,
10924,
3117,
6834,
2739,
4918,
5181,
835,
8391,
10055,
4691,
1748,
4692,
3286,
5469,
3551,
5472,
2785,
2659,
3813,
10344,
2409,
7017,
8170,
2799,
2294,
4095
] | Test |
1,542 | 2 | Appearance_Manager:appearance manager appearance manager component mac os 8 mac os 9 controls overall look macintosh graphical user interface widgets supports several themes originally developed apple failed copland project cancellation project system moved newer versions mac os appearance manager also available free part downloadable sdk system 7 appearance manager implemented abstraction layer control manager quickdraw previously controls made direct quickdraw calls draw user interface elements buttons scrollbars window title bars etc appearance manager elements abstracted series apis draw item distinct entity behalf client code thus relieving control manager task extra level indirection allows system support concept switchable themes since client code simply requests image interface element button scroll bar example draws appearance kaleidoscope 3rd party application first utilize functionality via scheme files followed updated appearance control panel mac os 8.5 acted similarly via theme files schemes themes similar concept internally compatible updated powerful version appearance manager used carbon applications mac os x even apple made transition aqua extras.rsrc file updated version appearance theme compatible newer appearance manager mac os x version 10.3 'layo data longer used even carbon applications continued existence appearance manager longer confirmed default look feel appearance manager mac os 8 9 platinum intended primary gui copland platinum retains many shapes positions elements system 7 earlier like window control widgets buttons charcoal default system font chicago available via menu option however various shades grey used extensively throughout interface opposed previous interfaces mostly monochrome black white apple platinum theme however actually embedded appearance manager appearance control panel ability attach theme appearance manager apple platinum file themes folder system folder acts stub functional theme elements embedded customizable palettes 'clut resources used progress bars scroll thumbs slider tabs menu selections apple platinum unique option available real themes appearance control panel uses type code 'pltn identify file act like palette modification stub apple platinum type code 'thme identify file act like appearance theme important distinction appearance control panel implements themes appearance manager kaleidoscope third party software implements schemes appearance manager kaleidoscope substitute appearance manager substitute appearance control panel apple widely demonstrated two appearance themes override apple platinum hi-tech gizmo hi-tech based shades-of-black color scheme made interface look like contemporary piece audio-visual equipment gizmo kids interface using lots bright colors wiggly interface elements changed every single element overall gui leaving trace apple platinum third theme later introduced drawing board developed apple japan theme uses elements make interface look like drawn pencil drafting-board including small pencil marks around windows barely visible graph paper grid desktop squarish elements low contrast although none themes included released version mac os themes present pre-release versions mac os 8.5 removed without explanation final release one retrospective review long-time mac user described themes mistake waste engineering resources saying 'hi-tech theme 'looked like typical dark over-decorated techno skin became popular linux desktops 'gizmo looked 'awful ... finder clown suit default font called charcoal used replace similar chicago typeface used earlier versions mac os number additional system fonts also provided including capitals gadget sand techno textile order system font glyphs specific mac operating system need provided command key symbol ⌘ normally system fonts displayed 12 points later versions appearance manager also apply anti-aliasing type displayed screen certain size default improves overall look text reducing perception rasterization artifacts anti-aliasing adjustable appearance control panel shareware products exist provided features appearance manager offered directly appearance control panel church windows décor provide desktop picture functionality windowshade purchased apple bundled system 7 provides collapse functionality windows collapse “ roll ” leaving title bar kaleidoscope written arlo rose greg landweber applied schemes gui apple released update appearance control panel mac os 8.5 provides similar functionality using themes whereas handful themes ever developed thousands kaleidoscope schemes developed theme support appearance control panel first announced team responsible demonstrated automatic tool specifically designed convert tens thousands existing kaleidoscope scheme files appearance manager-compatible theme files tool released public however similar tool developed kaleidoscope remained primary theme platform even appearance control panel offered theme capabilities mac os 8.5 steve jobs returned apple release mac os 8.5 decided officially drop support themes wanted preserve consistent user interface apple released little documentation theme format withheld beta-released themes even issued cease desist notice authors third-party theme editor grounds intended allow users create themes imitate aqua interface mac os x time format kaleidoscope schemes continued evolve result kaleidoscope schemes proliferated appearance themes never really took kaleidoscope rendered obsolete transition mac os x kaleidoscope compatible | [
2571,
3598,
5520,
11037,
6048,
11171,
8114,
823,
1592,
576,
713,
9035,
213,
3167,
9700,
6377,
2282,
4844,
5619,
8441,
7163,
3324,
4989
] | Validation |
1,543 | 3 | Rasterscan:rasterscan rasterscan computer game published 1987 mastertronic several 8-bit formats written binary design ltd based parsonage gardens manchester c64 version programmed phillip allsopp aka 'sarge rasterscan large damaged spacecraft drifting uncontrollably towards nearby star rasterscan still controlled piloted safety droid called msb unfortunately msb also damaged without help repair toasters player needs control msb hopefully use save unfortunate spacecraft player controls msb spherical droid float interior ship directions msb interact craft machinery instruments serve purpose also needs solve logic-puzzles order open doors different puzzles door allow access parts spacecraft | [
9006
] | Test |
1,544 | 4 | Canary_trap:canary trap canary trap method exposing information leak giving different versions sensitive document several suspects seeing version gets leaked could one false statement see sensitive information gets people well special attention paid quality prose unique language hopes suspect repeat verbatim leak thereby identifying version document term coined tom clancy novel patriot games although clancy invent technique actual method usually referred barium meal test espionage circles used intelligence agencies many years fictional character jack ryan describes technique devised identifying sources leaked classified documents summary paragraph six different versions mixture paragraphs unique numbered copy paper thousand possible permutations ninety-six numbered copies actual document reason summary paragraphs lurid entice reporter quote verbatim public media quotes something two three paragraphs know copy saw therefore leaked refinement technique uses thesaurus program shuffle synonyms thus making every copy document unique following troubled production late 1970s paramount pictures effectively replaced gene roddenberry producer movies franchise harve bennett roddenberry retained executive consultant due high regard series fans held little real authority still kept involved creative process fans often complained particular plot developments proposed films death spock roddenberry opposed drafts screenplay circulated bennett arranged individual copy subtle clues distinguishing others shortly roddenberry opposed destruction enterprise climax film fans began complain paramount bennett found leaked copy script one given roddenberry unable anything series leaks tesla motors 2008 ceo elon musk reportedly sent slightly different versions e-mail employee attempt reveal potential leakers e-mail disguised request employees sign new non-disclosure agreement plan backfired company general counsel forwarded unique version e-mail attached agreement result musk scheme realized employees safe copy leak according book spycatcher peter wright published 1987 technique standard practice used mi5 intelligence agencies many years name barium meal test barium meal test sophisticated canary trap flexible may take many different forms however basic premise reveal secret suspected enemy nobody else monitor whether evidence fake information utilised side example double agent could offered tempting bait e.g told important information stored dead drop site fake dead drop site could periodically checked signs disturbance site showed signs disturbed instance order copy microfilm stored would confirm suspected enemy really enemy i.e double agent technique embedding significant information hidden form medium used many ways usually classified according intent | [
7424,
2305,
5986,
9256,
9289,
150
] | Test |
1,545 | 7 | Jobvite:jobvite jobvite inc. san mateo california indianapolis indiana software recruiting corporation comprehensive recruiting platform accelerates recruiting easy-to-use ats social recruiting capabilities mobile-optimized branded career sites recruiting branding solution on-demand video screening advanced analytics on-boarding seamless integration hr systems software service saas social recruiting platforms enabling companies advertise jobs manage recruitment process much jobvite inc. established 2003 jesper schultz hans larsen name forumjobs inc company name changed jobvite 2006 december 2007 company raised 7.2 million venture funding cmea ventures july 2008 dan finnigan formerly yahoo hotjobs.com appointed ceo company finnigan hired two former colleagues yahoo engineering senior director adam hyder chief technology officer yahoo spot marketing head tim lambert chief revenue officer september 2010 jobvite formed partnership successfactors business execution bizx suite partnership added bizx suite 8 million plus users jobvite search platform october 2014 jobvite received 25 million investments new york city-based growth equity firm catalyst investors joined trident capital cmea capital ata ventures one firm ’ chief investors investment company amounted 55 million time august 2015 company launched operations london england 2019 company additional offices chicago boston bengaluru india february 2019 k1 investment management invested 200 million dollars jobvite part funds assisted jobvite ’ acquisition three companies talemetry rolepoint canvas acquisition resulted additional 2,000 customers jobvite including fortune 500 companies 2014 jobvite cited server 1600 global companies 46 million job seekers worldwide jobvite specializes provision software service saas recruiting platform web-based service enables clientele create job invitations known jobvites business associates employees social networking sites facebook linkedin making viable social recruiting provider companies post job openings manage recruitment process clientele include twitter linkedin schneider electric gamesys jobvite offers number features within recruiting platform include 2010 popular application “ work us ” roughly 5,000 active users every month time jobvite become known surveys social recruitment frequently cited source media outlets time inc. numerous authors books social human resource management | [
8735
] | Test |
1,546 | 8 | VlibTemplate:vlibtemplate vlibtemplate template engine written php programmers web developers may use web development vlibtemplate php class intended make splitting php html simple natural task using markup tags class allows users set values variables loops statements etc declared template vlibtemplate part vlib interface vlibdate vlibmimemail since vlibtemplate separates php html two files note file contains plain html one markup tag tmpl_var used display template variables assigned php script using vlibtemplatecache speed parsing process | [
6850,
8644,
7022,
8539,
2556
] | Test |
1,547 | 4 | Open_Bug_Bounty:open bug bounty open bug bounty non-profit bug bounty platform responsible disclosure platform allows independent security researchers report xss similar security vulnerabilities website discover using non-intrusive security testing techniques researchers may choose make details vulnerabilities public 90 days since vulnerability submission communicate website operators program expectation operators affected website reward researchers making reports unlike commercial bug bounty programs open bug bounty non-profit project require payment either researchers website operators bounty matter agreement researchers website operators heise.de identified potential website vehicle blackmailing website operators threat disclosing vulnerabilities bounty paid reported open bug bounty prohibits open bug bounty launched private security enthusiasts 2014 february 2017 recorded 100,000 vulnerabilities 35,000 fixed grew website xssposed archive cross-site scripting vulnerabilities february 2018 platform 100,000 fixed vulnerabilities using coordinated disclosure program based iso 29147 guidelines | [
3619,
4198,
711
] | Train |
1,548 | 3 | PowerPC_e500:powerpc e500 powerpc e500 32-bit microprocessor core freescale semiconductor core compatible older powerpc book e specification well power isa v.2.03 dual issue seven-stage pipeline fpus version 2 onwards 32/32 kib data instruction l1 caches 256 512 1024 kib l2 frontside cache speeds range 533 mhz 1.5 ghz core designed highly configurable meet specific needs embedded applications features like multi-core operation interface auxiliary application processing units apu e500 powers high-performance powerquicc iii system chip soc network processors share common naming scheme mpc85xx freescale new qoriq evolutionary step powerquicc iii also based e500 cores three versions e500 core namely original e500v1 e500v2 e500mc 64-bit evolution e500mc core called e5500 core introduced 2010 key improvements e500v2 e500v1 include freescale introduced e500mc qoriq family chips june 2008 e500mc following features powerquicc 85xx devices based e500v1 e500v2 cores e500v2 june 2008 freescale announced qoriq brand microprocessors based e500 family cores | [
6914,
7299,
3844,
4868,
1158,
3846,
4743,
6663,
5642,
3467,
7302,
1933,
7305,
6415,
3472,
4881,
2073,
7065,
1563,
1309,
3493,
6949,
6311,
8102,
1321,
9391,
10543,
4017,
5297,
11314,
1461,
11447,
8120,
8761,
6715,
9020,
1725,
1983,
1985,
1... | Test |
1,549 | 1 | FileMaker_Pro:filemaker pro filemaker pro cross-platform relational database application claris international. subsidiary apple inc integrates database engine graphical user interface gui security features allowing users modify database dragging new elements layouts screens forms filemaker pro evolved dos application developed primarily apple macintosh released april 1985 since 1992 available microsoft windows classic mac os macos used cross-platform environment filemaker server briefly ran linux linux support abandoned filemaker 7 thereafter running windows macos servers client version released ios devices july 2010 available desktop server ios web-delivery configurations 2016 filemaker cloud introduced including linux server centos offered exclusively amazon marketplace filemaker pro began ms-dos-based computer program named nutshell – developed nashoba systems concord massachusetts early 1980s nutshell distributed leading edge electronics marketer recently started selling ibm pc-compatible computers introduction macintosh nashoba combined basic data engine new forms-based graphical user interface gui leading edge interested newer versions preferring remain dos-only vendor kept nutshell name nashoba found another distributor forethought inc. introduced program macintosh platform filemaker apple introduced macintosh plus 1986 next version filemaker named filemaker plus reflect new model name forethought purchased microsoft introducing powerpoint product became part microsoft office microsoft introduced database application microsoft file shortly filemaker outsold filemaker therefore microsoft file discontinued microsoft negotiated nashoba right publish filemaker nashoba decided self-publish next version filemaker 4 shortly thereafter apple computer formed claris wholly owned subsidiary market software claris purchased nashoba round software suite leading edge nutshell faded marketplace competition dos- later windows-platform database products filemaker however continued succeed macintosh platform claris changed product name filemaker ii conform naming scheme products macwrite ii product changed little last nashoba version several minor versions followed succeeded filemaker pro 1.0 1990 september 1992 claris released cross-platform version mac windows except platform-specific functions program features user interface point filemaker real relational capabilities limited automatically looking importing values files ability save state—a filter sort layout data version 3.0 released around 1995 introduced new relational scripting features 1995 filemaker pro strong-selling product claris lineup 1998 apple moved development claris products in-house dropped rest changed claris name filemaker inc. concentrate product version 4.0 introduced 1997 added plug-in architecture much like adobe photoshop enabled third-party developers add features filemaker bundled plug-in web companion allowed database act web server plug-ins added features interface enabled filemaker serve ftp client perform external file operations send messages remote filemaker files internet intranet version 7 released 2004 introduced new file format file extension .fp7 supporting file sizes 8 terabytes increase 2 gigabytes allowed previous versions individual fields could hold 4 gigabytes binary data container fields 2 gigabytes 2-byte unicode text per record 64 kilobytes previous versions filemaker relational model enriched offering multiple tables per file graphical relationship editor displayed allowed manipulation related tables manner resembled entity-relationship diagram format accompanying foundational changes filemaker inc. also introduced developer certification program 2005 filemaker inc. announced filemaker 8 product family offered developer expanded feature set included tabbed interface script variables tooltips enhanced debugging custom menus ability copy paste entire tables field definitions scripts script steps within files version 8.5 released 2006 added integrated web viewer ability view things shipment tracking information fedex wikipedia entries named layout objects filemaker 9 released july 10 2007 introduced quick-start screen conditional formatting fluid layout auto-resizing hyperlinked pointers databases external sql links filemaker 10 released january 5 2009 year macworld conference expo offered scripts triggered user actions redesigned user interface similar mac os x leopard 10.5 applications filemaker 11 released march 9 2010 introduced charting streamlined filemaker 12 released april 4 2012 version also added themes database templates so-called starter solutions simplified creation ios databases filemaker go 11 july 20 2010 filemaker go 12 iphone ipad april 4 2012 allow creation modification deletion records handheld devices design schema changes must made within full filemaker pro application filemaker go 12 offers multitasking improved media integration export data multiple formats enhanced container fields filemaker 13 released launches ios 7 os x mavericks 10.9 first shipped december 2013 client server products enhanced support many mobile web methods data access filemaker go 13 parallel ipad–iphone product become single client devices server admin tool runs html5 longer requiring java app filemaker 14 platform released may 15 2015 included filemaker pro 14 filemaker pro 14 advanced filemaker server 14 filemaker go 14 followed version 15 may 2016 version 16 may 2017 including equivalent pro pro advanced server go versions late 2016 filemaker began annually publicizing software roadmap future features working well identifying features moving away may deprecate near future filemaker inc. always hard time describing filemaker software database includes user interface security rapid application development tools etc filemaker inc. initiated new marketing program annual developers conference august 2018 address poor description categories workplace innovation platform filemaker files compatible mac windows file type extensions self-running applications runtime kiosk mode platform-specific filemaker available worldwide english simplified chinese dutch french german italian japanese korean brazilian portuguese spanish swedish also specific versions filemaker users central european indian middle eastern languages versions offer spellchecking data entry sorting printing options languages respective region also contain localized templates localized instant web publishing central european version filemaker includes english russian polish czech turkish interfaces customized templates russian polish czech turkish addition russian greek estonian lithuanian latvian serbian bulgarian hungarian supported varying degrees version intended southeast asian languages english user interface supports indic-language data entry sorting indexing hindi marathi bengali panjabi gujarati tamil telugu kannada malayalam similarly middle eastern version english french user interfaces option change text direction right-to-left support arabic hebrew data entry filemaker pro filemaker pro advanced include scripting capabilities variety built-in functions automation common tasks complex calculations numerous steps available navigation conditional execution script steps editing records utilities filemaker pro advanced provides script debugger allows developer set break points monitor data values step script lines filemaker 13 introduced useful script deeply queries container field document metadata filemaker dynamic markup language fdml markup language used earlier versions filemaker introduced 1998 fdml also often referred claris dynamic markup language cdml named former company claris fdml extension html used special tags codice_1 display filemaker data web pages filemaker officially dropped support fdml 2004 filemaker since version 9 includes ability connect number sql databases without resorting using sql including mysql sql server oracle requires installation sql database odbc driver many cases third-party license per client driver connect sql database sql databases used data sources filemaker relationship graph thus allowing developer create new layouts based sql database create edit delete sql records via filemaker layouts functions reference sql fields filemaker calculations script steps cross-platform relational database application versions filemaker pro 5.5 onwards also odbc interface filemaker 12 introduced new function executesql allows user perform sql query filemaker database retrieve data allow data modification deletion schema changes one major flaw odbc support lack one-to-one field-type mapping filemaker external industry-standard databases issues caused fact filemaker strict data types filemaker field marked numeric return mapping odbc driver however filemaker allows non-numeric characters stored numeric field type unless field specifically marked strictly numeric filemaker 16 empowers integrations via curl json rest-based filemaker data api support tableau web data connector offered visualize filemaker data rest-based api license free trial expired september 27 2018 filemaker 17 offers permanent rest-based data api standard licensing include 2gb outbound data per user per month container data count towards limit inbound data api data transfer unlimited | [
10755,
9732,
4111,
7697,
11289,
6186,
6700,
5677,
10286,
1074,
8754,
9780,
9784,
8253,
576,
5696,
9286,
8783,
4180,
10838,
1623,
3167,
3681,
9826,
10340,
5733,
8806,
3691,
2676,
119,
6264,
7292,
2686,
6783,
7806,
10878,
8842,
6797,
5784,
... | None |
1,550 | 5 | Time-hopping:time-hopping time-hopping th communications signal technique used achieve anti-jamming aj low probability intercept lpi also refer pulse-position modulation simplest form employs 2 discrete pulses referring unique positions pulse within transmission window transmit k bit per pulse achieve lpi transmission time changed randomly varying period duty cycle pulse carrier using pseudo-random sequence transmitted signal intermittent start stop times although often used form hybrid spread-spectrum ss systems th strictly speaking non-ss technique spreading spectrum caused factors associated th using pulses low duty cycle wide frequency response example hybrid ss th-fhss hybrid tdma time division multiple access | [
3847,
9863,
2057,
10381,
2968,
2458,
5020,
5664,
11686,
7723,
11181,
1969,
2994,
5304,
7490,
3140,
7108,
11591,
5321,
7498,
3040,
1121,
3168,
8160,
2920,
7400,
2802
] | None |
1,551 | 7 | GDocsDrive:gdocsdrive gdocsdrive client app google docs enables users manage files stored google docs desktop main benefit gdocsdrive allows users modify cloud files using local applications enables use desktop software microsoft office adobe suite others manage online files gdocsdrive uses google ’ cloud storage store files online storage default 15 gb storage available free charge however users extend storage google annual fee gdocsdrive paid software price 29.99 usd offering 14-day free trial currently windows version available gdocsdrive listed google apps marketplace also available techcrunch crunchbase gdocsdrive software written c++ libraries like curl openssl used http communications coded based google document list api 3.0 process modifying google cloud files using local applications involves 3 steps 1. selected file modified downloaded local system temp folder 2 file opened modified proper local application 3 file uploaded back google docs new revision added original online file gdocsdrive employs oauth 2.0 authentication method users log therefore users present credentials gdocsdrive log google ’ account sign webpage gdocsdrive uses two tokens – access token refresh token- received google operations gmail users google apps users supported 2-step verification login also supported gdocsdrive designed google docs desktop client sync tool like dropbox sugarsync although drive name gdocsdrive drive letter mapping feature | [
3366,
6797,
4623,
7983,
10673,
3442,
6750,
8446
] | Test |
1,552 | 9 | Compiler-compiler:compiler-compiler computer science compiler-compiler compiler generator programming tool creates parser interpreter compiler form formal description programming language machine common type compiler-compiler precisely called parser generator handles syntactic analysis input grammar typically written bnf ebnf defines syntax programming language output source code parser programming language parser generators handle semantics programming language generation machine code target machine metacompiler software development tool used chiefly construction compilers translators interpreters programming languages input metacompiler computer program written specialized programming metalanguage designed chiefly purpose constructing compilers language compiler produced called object language minimal input producing compiler metaprogram specifying object language grammar semantic transformations object program typical parser generator associates executable code rules grammar executed rules applied parser pieces code sometimes referred semantic action routines since define semantics syntactic structure analyzed parser depending upon type parser generated routines may construct parse tree abstract syntax tree generate executable code directly one earliest 1964 surprisingly powerful versions compiler-compilers meta ii accepted analytical grammar output facilities produce stack machine code able compile languages experimental compiler-compilers take input formal description programming language semantics typically using denotational semantics approach often called 'semantics-based compiling pioneered peter mosses semantic implementation system sis 1978 however generated compiler code produced inefficient time space production compilers currently built way research continues production quality compiler-compiler project carnegie-mellon university formalize semantics semi-formal framework machine description compiler-compilers exist many flavors including bottom-up rewrite machine generators see jburg used tile syntax trees according rewrite grammar code generation attribute grammar parser generators e.g antlr used simultaneous type checking constant propagation parsing stage metacompilers reduce task writing compilers automating aspects regardless object language makes possible design domain-specific languages appropriate specification particular problem metacompiler reduces cost producing translators domain-specific object languages point becomes economically feasible include solution problem domain-specific language design metacompiler metalanguage powerful string symbol processing languages also useful generating wide range software engineering analysis tools besides useful domain-specific language development metacompiler prime example domain-specific language designed domain compiler writing metacompiler metaprogram usually written metalanguage existing computer programming language process metacompiler written metalanguage compiling equivalent self-hosting compiler common compilers written today self-hosting compilers self-hosting powerful tool many metacompilers allowing easy extension metaprogramming metalanguage feature separates metacompiler apart compiler compilers takes input specialized metaprogramming language describes aspects compilers operation metaprogram produced metacompiler complete program program written c++ basic general programming language metaprogramming metalanguage powerful attribute allowing ease development computer programming languages computer tools command line processors text string transforming analysis easily coded using metaprogramming metalanguages metacompilers full featured development package includes linker run-time support library usually machine oriented language required writing support library c c++ could used machine oriented language library consisting support functions required compilation process usually rounds full metacompiler package computer science prefix meta commonly used mean category metadata data data describing data language used describe languages metalanguage meta may also mean higher level abstraction metalanguage operates higher level abstraction order describe properties language backus–naur form bnf formal metalanguage originally used define algol 60 bnf weak metalanguage describes syntax says nothing semantics meaning metaprogramming writing computer programs ability treat programs data metacompiler takes input metaprogram written specialized metalanguages higher level abstraction specifically designed purpose metaprogramming output executable object program analogy drawn c++ compiler takes input c++ programming language program metacompiler takes input metaprogramming metalanguage program many forth advocates call process creating new implementation forth meta-compilation constitutes metacompiler forth definition metacompiler forth use metacompiler disputed mainstream computer science see forth programming language history compiler construction actual forth process compiling combination forth self-hosting extensible programming language sometimes cross compilation long established terminology computer science metacompilers general compiler writing system besides forth metacompiler concept indistinguishable self-hosting extensible language actual process acts lower level defining minimum subset forth words used define additional forth words full forth implementation defined base set sounds like bootstrap process problem almost every general purpose language compiler also fits forth metacompiler description replace x common language c c++ pascal cobol fortran ada modula-2 etc x would meta compiler according forth usage metacompiler metacompiler operates abstraction level compiler compiles operates self-hosting compiler level compiling one see problem definition metacompiler applied language however examining concept programming forth adding new words dictionary extending language way metaprogramming metaprogramming forth makes metacompiler programming forth adding new words language changing language way metaprogramming forth metacompiler forth language specifically designed metaprogramming programming forth extending forth adding words forth vocabulary creates new forth dialect forth specialized metacompiler forth language dialects first compiler-compiler use name written tony brooker 1960 used create compilers atlas computer university manchester including atlas autocode compiler early history metacompilers closely tied history sig/plan working group 1 syntax driven compilers group started primarily effort howard metcalfe los angeles area fall 1962 howard metcalfe designed two compiler-writing interpreters one used bottom-to-top analysis technique based method described ledley wilson used top-to-bottom approach based work glennie generate random english sentences context-free grammar time val schorre described two meta machines one generative one analytic generative machine implemented produced random algebraic expressions meta first metacompiler implemented schorre ibm 1401 ucla january 1963 original interpreters metamachines written directly pseudo-machine language meta ii however written higher-level metalanguage able describe compilation pseudo-machine language lee schmidt bolt beranek newman wrote metacompiler march 1963 utilized crt display time-sharing pdp-l compiler produced actual machine code rather interpretive code partially bootstrapped meta i. schorre bootstrapped meta ii meta spring 1963 paper refined metacompiler system presented 1964 philadelphia acm conference first paper metacompiler available general reference syntax implementation technique schorre system laid foundation systems followed system implemented small 1401 used implement small algol-like language many similar systems immediately followed roger rutman a. c. sparkplug developed implemented logik language logical design simulation ibm 7090 january 1964 compiler used algorithm produced efficient code boolean expressions another paper 1964 acm proceedings describes meta iii developed schneider johnson ucla ibm 7090 meta iii represents attempt produce efficient machine code large class languages meta iii implemented completely assembly language two compilers written meta iii codol compiler-writing demonstration compiler puregol dialect algol 60 pure gall call algol late 1964 lee schmidt bootstrapped metacompiler eqgen pdp-l beckman 420 eqgen logic equation generating language 1964 system development corporation began major effort development metacompilers effort includes powerful metacompilers bookl book2 written lisp extensive tree-searching backup capability outgrowth one q-32 systems sdc meta 5 meta 5 system incorporates backup input stream enough facilities parse context-sensitive language system successfully released wide number users many string-manipulation applications compiling many elaborate push-down stacks attribute setting testing facilities output mechanisms fact meta 5 successfully translates jovial programs pl/l programs clearly demonstrates power flexibility lot system developed 1966 stanford research institute modeled closely meta ii new special-purpose constructs allowing generate compiler would turn able compile subset pl/l system extensive statistic-gathering facilities used study characteristics top-down analysis simple specialized translator system designed aid writing pre-processors pl/i simple written pl/i composed three components executive syntax analyzer semantic constructor tree meta compiler developed stanford research institute menlo park california april 1968 early metacompiler history well documented tree meta manual tree meta paralleled sdc developments unlike earlier metacompilers separated semantics processing syntax processing syntax rules contained tree building operations combined recognized language elements tree nodes tree structure representation input processed simple form unparse rules unparse rules used node recognition attribute testing matched resulted associated action performed addition like tree element could also tested unparse rule unparse rules also recursive language able call unparse rules passing elements thee tree action unparse rule performed concept metarnachine originally put forth glennie simple three hardware versions designed one actually implemented latter washington university st. louis machine built macro-modular components instructions codes described schorre cwic compiler writing implementing compilers last known schorre metacompiler developed systems development corporation erwin book dewey val schorre steven j. sherman full power lisp 2 list processing language optimizing algorithms could operate syntax generated lists trees code generation cwic also symbol table built language resurgence domain-specific languages need parser generators easy use easy understand easy maintain metacompilers becoming valuable tool advanced software engineering projects examples parser generators yacc vein antlr coco/r cup gnu bison eli fsl sablecc sid syntax improving device javacc useful pure parser generators address parsing part problem building compiler tools broader scope pqcc coco/r dms software reengineering toolkit provide considerable support difficult post-parsing activities semantic analysis code optimization generation earliest schorre metacompilers meta meta ii developed d. val schorre ucla schorre based metacompilers followed adding improvements language analysis and/or code generation programming common use programming language name refer compiler programming language context distinguishing meaning c++ program compiled using c++ compiler also applies following example meta ii compiler language metalanguages schorre line metacompilers functional programming languages use top grammar analyzing syntax equations embedded output transformation constructs syntax equation compiled test function returning success failure name function name body form logical expression consisting tests may grouped alternates output productions test like bool languages success true failure false defining programming language analytically top natural example program could defined defining program sequence zero declaration schorre meta x languages driving rule program rule example driving rule program rule test function calls declaration test rule returns success failure loop operator repeatedly calling declaration failure returned operator always successful even zero declaration program would always return success cwic long fail bypass declaration long-fail part backtracking system cwic character sets early compilers limited character used alternant operator b written b. parentheses used grouping describes construct followed b c. boolean expression would sequence x implied x meaning grouping operator order evaluation always left right input character sequence specified ordering tests special operator words whose first character used clarity .empty used last alternate previous alternant need present indicates x optionally followed b specific characteristic metalanguages programming languages backtracking avoided compiler constructor systems may declared three possible sequences left parser figure characteristics metaprogramming metalanguages common schorre metacompilers derived meta hand compiled metacompiler used compile meta ii little else known meta except initial compilation meta ii produced nearly identical code hand coded meta compiler rule consists optionally tests operators output productions rule matches part input program source character stream returning success failure success input advanced matched characters failure input advanced output productions produced form assembly code directly syntax rule tree-meta introduced tree building operators node_name number moving output production transforms unparse rules tree building operators used grammar rules directly transforming input abstract syntax tree unparse rules also test functions matched tree patterns unparse rules called grammar rule abstract syntax tree transformed output code building abstract syntax tree unparse rules allowed local optimizations performed analyzing parse tree moving output productions unparse rules made clear separation grammar analysis code production made programming easier read understand 1968-1970 erwin book dewey val schorre steven j. sherman developed cwic compiler writing implementing compilers system development corporation charles babbage institute center history information technology box 12 folder 21 cwic compiler development system composed three special-purpose domain specific languages intended permit description certain aspects translation straight forward manner syntax language used describe recognition source text construction intermediate tree structure generator language used describe transformation tree appropriate object language syntax language follows dewey val schorre previous line metacompilers resembles treemeta tree building operators syntax language unparse rules treemeta extended work object based generator language based lisp 2 cwic includes three languages generators language semantics similar lisp parse tree thought recursive list general form generator language function code process given tree included features general purpose programming language plus form stuff would emit stuff onto output file generator call may used unparse_rule generator passed element unparse_rule pattern placed return values listed example parse tree looks like add something1 something2 expr_gen x would called something1 return x variable unparse rule local variable used production_code_generator expr_gen called something2 returns generator call unparse rule passed element position occupies hopefully x registers return last transforms intended load atomic register return register first production would used generate 360 ar add register instruction appropriate values general registers example part generator every generator expression evaluates value con processed last transform could well written case load returns first parameter register returned getreg functions load getreg cwic generators authors cwic metacompiler assists task compiler-building automating non creative aspects aspects regardless language produced compiler translate makes possible design languages appropriate specification particular problem reduces cost producing processors languages point becomes economically feasible begin solution problem language design | [
4998,
2831,
9871,
1685,
5399,
1952,
1956,
7462,
6840,
2751,
3904,
10560,
8262,
9926,
1610,
1360,
7634,
2647,
6753,
6242,
7777,
6502,
2537,
10474,
9714,
4980
] | None |
1,553 | 2 | Fedora_Legacy:fedora legacy fedora legacy community-supported open-source software project freely distribute patches critical software bugs vulnerabilities users older versions red hat linux fedora core linux distributions publisher red hat ceased support jesse keating david eisenstein two fedora legacy software maintainers announced discontinuation project 31 december 2006 fedora legacy later cited following reasons discontinuing project enough people contributing testing deploying patches enough funds waning interest project new discussion extending software release life cycle fedora core discontinuation fedora legacy providing updates red hat linux versions 7.3 9 fedora core 3 4 ceased support fedora core 1 2 red hat published fedora core 6 test 2 earlier 2006 fedora legacy announced intention provide updates red hat 7.3 9 end year focus fedora core 3 4 | [
4961,
3969,
5636,
5988,
5096,
9353,
9455,
10961,
8539,
2974,
11643,
4729,
5723,
10172,
3582
] | None |
1,554 | 4 | Blind_return_oriented_programming:blind return oriented programming blind return oriented programming brop exploit technique successfully create exploit even attacker possess target binary brop attacks shown bittau et al defeated address space layout randomization aslr stack canaries 64-bit systems current improvements os security hardware security features like linux pax project code injection impossible security researchers conceived new attack named return oriented programming defeat nx non-executable memory attack relies affecting program flow controlling stack especially return addresses gadgets fundamental units attack gadgets group instruction sequences ending return along certain state stack gadget perform operation like loading word memory register performing complex operation like conditional jump large enough target binary turing complete collection gadgets constructed enough get shellcode executed one assumption rop makes attacker possesses target binaries hence knows addresses gadgets beforehand three new scenarios brop relevant case closed binary services discover vulnerabilities techniques like fuzz penetration testing need used ii known vulnerability open-source library leveraged carry exploit even though proprietary binary uses closed source iii also used hack open-source server binary unknown.the attack assumes service server known stack vulnerability also service restart crash return instruction pointers usually protected stack canaries stack canary causes program crash value modified buffer overrun brop model attack buffer overrun carried byte byte try overrun results either program crash continued execution program crash implies stack value incorrectly guessed therefore 256 tries average case 128 tries stack value probably estimated 64 bit machines 4 stack reads would required leak canary canary leaked return instruction pointer perturbed way may however noted though estimation stack canary exact said return instruction address attacker would satisfied able leak address within text segment address space stage heart attack objective phase initiate write system call sending dump binary attacker write system call three params socket buffer length x86-64 calling conventions require parameters passed registers appropriate pop instructions rsi rdi rdx would needed set arguments write system call instruction sequences like pop rdi ret like would helpful regard simple rop version write system call would 1 pop rdi ret socket 2 pop rsi ret buffer 3 pop rdx ret length 4 pop rax ret write syscall number 5 syscall one problem methodology even useful gadgets found address space return address stack would lead non-executable stack high probability remedy brop proposers conceived stop gadgets stop gadget anything would cause program block like infinite loop blocking system call like sleep also workers processors affected attack stuck infinite loop hence allowing attacker carry attack mentioned bare-bones methodology attack reality optimizations carried help efficiently carrying attack primary among use procedure linker tables plts track writing system call instead passing system call number syscall function others include using strcmp populate rdx register pop rdx ret instruction sequences extremely rare writing found plt attacker dump contents target binary find gadgets attacker use conventional rop gadget search techniques gather enough create shellcode shellcode exploited system taken full control root access huge assumption brop attack server restarts crash restarting re-randomize address space enabling re-randomization address space startup provide almost complete protection brop another technique used netbsd linux sleep crash slows attack considerably allows system administrator look suspicious activity apart conventional protection rop style control flow hijacking attacks control flow integrity also provide provable prevention significant performance overhead another attack similar nature brop jit just-in-time -rop jit-rop also another attack based information disclosure able also defeat address space layout randomization brop jit-rop attempt locate gadgets binary order initiate rop attack goal exploit type data leak however unlike brop jit-rop attack interactive seeks adapt no-crash/crash situations rather attacker send script discover gadgets subsequently creates attack delivery also jit-rop must two different vulnerabilities heap stack known advance attack brop requires awareness stack vulnerability | [
4562,
1103
] | None |
1,555 | 2 | Software_Distributor:software distributor software distributor sd hewlett-packard company name hp-ux software package management system sd provides set tools creating packages install software system running hp-ux operating system packages grouped together software repository called depot server configured host multiple depots installation software packages even entire systems sd first available release 10.0 hp-ux 1995 since undergone several enhancements bug fixes provides reliable software installation tool uses client-server arrangement distribute software using background daemon called swagentd agent started boot time communicates using either tcp udp protocols rpc sd packages normally stored transmitted compressed form using either gzip compress programs tools performing sd operations normally accessed command line sd includes following commands commands include broad range command-line options allow relatively fine control task performed addition command-line programs several tools also launch gui versions x window system display gui version swinstall performs filtering software list match software packages system run commands log messages administrative area useful diagnosing installation issues tracking software loaded removed software packages built means specification file set install scripts actual software content install scripts executed software installation verification removal used prepare system software perform activation deactivation package specification file determines software package organized list locations various files loaded package restrict systems package installed determine security configuration package also provides various information package name version description software packages organized hierarchy containers highest level bundle product lowest filesets files hierarchy arranged follows actually product fileset levels needed many packages subproduct level sometimes used group together filesets bundle provides higher-level grouping related products one filesets product one products bundle fileset level used specifically loading files product installed without associated filesets c. filesets products linked together various requirement tags cause swinstall select appropriate dependencies automatically fileset multiple control scripts specific files load scripts executed following order installation corresponding set scripts executed reverse order swremove scripts include verify performing sanity check swverify command unpreinstall unpostinstall none scripts included package depending requirements installation useful performing cleanup previous packages creating links adding software directory various search environment variables forth | [
9441,
7847,
5384,
5067,
11184,
4309,
1813,
1304,
3163
] | Test |
1,556 | 8 | FastCGI:fastcgi fastcgi binary protocol interfacing interactive programs web server variation earlier common gateway interface cgi fastcgi main aim reduce overhead related interfacing web server cgi programs allowing server handle web page requests per unit time common gateway interface cgi protocol interfacing external applications web servers cgi applications run separate processes created start request torn end one new process per request model makes cgi programs simple implement limits efficiency scalability high loads operating system overhead process creation destruction becomes significant also cgi process model limits resource reuse methods reusing database connections in-memory caching etc address scalability shortcomings cgi open market developed fastcgi first introduced webserver product mid-1990s open market originally developed fastcgi part competitive response netscape proprietary in-process application programming interfaces apis netscape server application programming interface nsapi developing web applications developed first open market fastcgi implemented several webserver makers however approach competed methods speed simplify server-subprogram communication apache http server modules mod_perl mod_php appeared around time gained popularity quickly various methods including cgi remain common use instead creating new process request fastcgi uses persistent processes handle series requests processes owned fastcgi server web server service incoming request web server sends environment variable information page request fastcgi process either unix domain socket named pipe transmission control protocol tcp connection responses returned process web server connection web server delivers response end user connection may closed end response web server fastcgi service processes persist individual fastcgi process handle many requests lifetime thereby avoiding overhead per-request process creation termination processing multiple requests concurrently done several ways using one connection internal multiplexing i.e. multiple requests one connection using multiple connections mix methods multiple fastcgi servers configured increasing stability scalability web site administrators programmers find separating web applications web server fastcgi many advantages embedded interpreters mod_perl mod_php etc. separation allows server application processes restarted independently – important consideration busy web sites also enables implementation per-application hosting service security policies important requirement isps web hosting companies different types incoming requests distributed specific fastcgi servers equipped handle types requests efficiently fastcgi implemented language supports network sockets since fastcgi protocol implementation tightly bound one language application programming interfaces apis exist recent frameworks ruby rails catalyst django kepler plack allow use either embedded interpreters mod_ruby mod_perl mod_python mod_lua example fastcgi | [
4485,
7430,
8582,
8965,
1802,
10506,
9229,
2062,
1937,
11154,
1556,
1435,
10012,
9245,
8350,
5663,
10284,
8994,
11682,
2596,
3237,
3876,
7847,
9125,
4777,
10020,
9387,
428,
5165,
5677,
7212,
7983,
10026,
2994,
4658,
692,
2485,
10924,
11688,... | None |
1,557 | 4 | Security_question:security question security question form shared secret used authenticator commonly used banks cable companies wireless providers extra security layer financial institutions used questions authenticate customers since least early 20th century 1906 speech meeting section american bankers association baltimore banker william m. hayden described institution use security questions supplement customer signature records described signature cards used opening new accounts spaces customer birthplace residence mother maiden name occupation age hayden noted items often left blank residence information used primarily contact customer mother maiden name useful strong test identity although observed rare someone outside customer family try withdraw money customer account said mother maiden name useful verification rarely known outside family even people opening accounts often unprepared question similarly modern practice credit card provider could request customer mother maiden name issuing replacement lost card 2000s security questions came widespread use internet form self-service password reset security questions reduced information technology help desk costs allowing use security questions online rendered vulnerable keystroke logging attacks addition whereas human customer service representative may able cope inexact security answers appropriately computers less adept users must remember exact spelling sometimes even case answers provide poses threat answers written exposing physical theft due commonplace nature social-media many older traditional security questions longer useful secure important remember security question another password therefore security question shared anyone else include information readily available social media websites remaining simple memorable difficult guess constant time understanding every question work everyone rsa u.s. network security provider division emc corporation gives banks 150 questions choose many questioned usefulness security questions security specialist bruce schneier points since public facts person easier guess hackers passwords users know create fake answers questions forget answers thus defeating purpose creating inconvenience worth investment | [
6562,
1315,
9576,
8978,
2483,
5108,
5433,
7994,
11198
] | Test |
1,558 | 7 | EigenTrust:eigentrust eigentrust algorithm reputation management algorithm peer-to-peer networks developed sep kamvar mario schlosser hector garcia-molina algorithm provides peer network unique global trust value based peer history uploads thus aims reduce number inauthentic files p2p network cited approximately 3853 articles according google scholar peer-to-peer systems available today like gnutella open often anonymous lack accountability hence user malicious intent introduce peer-to-peer network resources may inauthentic corrupted malicious virus reflects poorly credibility current peer-to-peer systems research team stanford provides reputation management system peer system unique global trust value based peer history uploads peer requesting resources able access trust value peer avoid downloading files untrusted peers eigentrust algorithm based notion transitive trust peer trusts peer j would also trust peers trusted j peer calculates local trust value peers provided authentic fake downloads based satisfactory unsatisfactory transactions sat j refers number satisfactory responses peer received peer j unsat j refers number unsatisfactory responses peer received peer j local value normalized prevent malicious peers assigning arbitrarily high local trust values colluding malicious peers arbitrarily low local trust values good peers normalized local trust value c local trust values aggregated central location distributed manner create trust vector whole network based idea transitive trust peer would ask peers knows report trust value peer k weigh responses peers trust peer places assume user knew c values whole network form matrix c trust vector formula_4 defines trust value formula_5 given equation shown c assumed aperiodic strongly connected powers matrix c converge stable value point seems large value x trust vector formula_8 converge vector every peer network vector formula_8 known left principal eigenvector matrix c also note since formula_8 nodes network represents global trust value based results simple centralized trust value computing algorithm written note assume local trust values whole network available present matrix c also note equation shown converges replace initial vector formula_11 vector formula_12 m-vector representing uniform probability distribution peers basic eigentrust algorithm shown | [
8640,
4229
] | Test |
1,559 | 7 | Quorum_(software):quorum software quorum also known quorum analytics american multinational software technology company headquartered washington dc quorum produces online legislative data analysis aggregation platform provides quantitative insights qualitative policy questions quorum developed stakeholder engagement legislative tracking grassroots advocacy company operates internationally office brussels belgium serves cities counties capitols across 50 us states quorum compiles aggregates publicly available big data—in form bills amendments committee documents floor statements voting records social media posts press releases email newsletters census data—into single comprehensive database platform uses quantitative analytics identify key players specified legislation quorum used identify speaking specific issue measure effectiveness lawmakers identify connection representatives identify champions specific legislation review congressional records gauge congressional response specific issues quorum founded alex wirth jonathan marks 2014 undergraduates harvard university idea quorum born frustrating summer alex wirth spent capitol hill attempting build bipartisan support presidential youth council wirth saw first hand challenging advocates organizations influence legislative process wirth worked college roommate jonathan marks discover could use computer science make process influencing legislation easier effective initial goal see could “ use computers figure members congress know work together based previous patterns. ” beta version quorum platform built summer 2014 association harvard innovation lab financed grant harvard institute politics quorum earned funding 2014 i3 harvard college innovation challenge mckinley family grant social enterprise 2014 harvard ventures pitch competition 2015 george washington university business plan competition 2015 queen entrepreneurs competition quorum publicly launched january 26 2015 boston massachusetts may 2015 company moved headquarters washington dc closer client base quorum named number one dc startup-to-watch 2017 technical.ly may 2017 quorum opened office brussels belgium serve consultancy market europe regulatory capital quorum provides software service saas clients pay annual subscription provide public affairs government affairs team access quorum software data | [
467
] | Test |
1,560 | 4 | NetVault_Backup:netvault backup netvault set data protection software developed supported quest software netvault backup backup recovery software product used protect data software applications physical virtual environments one central management interface supports many servers application platforms protocols unix linux microsoft windows vmware microsoft hyper-v oracle sybase microsoft sql server ndmp oracle acsls ibm das/aci microsoft exchange server db2 teradata quest software offers data deduplication protection nas filers ndmp netvault backup based client-server architecture central netvault backup server provides job management media management device management client management reporting notifications logging functions netvault backup server maintains history backups netvault backup database enabling users identify object want restore netvault clients “ agents ” work netvault backup server back recover respective servers applications data client software installed machine protected netvault webui enables centralized administration netvault backup server browser netvault supports tape drives tape libraries backup devices attached central server protected machine located anywhere network enabling lan-free backups additionally devices controlled ndmp attached supported filer netvault backup server master backup server deployed microsoft windows linux netvault backup protect windows server linux solaris freebsd aix hp-ux hyper-v vmware also back variety applications nas devices ndmp using so-called plug-ins list includes microsoft sql server oracle microsoft exchange server lotus notes db2 sybase others three options within netvault suite enabling backup recovery disk tape bare metal recovery bmr data deduplication quest supports netapp products following technologies originally netvault backup intended back physical tapes tape drives however product soon extended support backup disk data deduplication netvault backup supports quest dr appliance netvault smartdisk dell dr appliance hardware-based inline deduplication storage product deduplication engine originally developed ocarina networks netvault ocarina engineering teams worked integrate two technologies netvault backup also used netvault smartdisk disk storage repository deduplication product netvault smartdisk perform post-process data deduplication represents contiguous storage pool disk without subdivided virtual tapes slots easier management allows byte-level variable block-based software deduplication netvault backup supports emc data domain via dd boost quantum dxi lan-free backups netvault backup write physical tape drive vtl shared multiple machines using fibre channel iscsi | [
9655,
2818,
1400,
3366,
6153,
1037,
1358,
3951,
6797,
7983,
5492,
11030,
823,
1304,
3323,
5599
] | Test |
1,561 | 2 | HeliOS:helios helios discontinued unix-like operating system parallel computers developed published perihelion software primary architecture transputer helios microkernel implemented distributed namespace messaging protocol services accessed posix compatibility library enabled use unix application software system provided usual unix utilities work helios began autumn 1986 success limited commercial failure transputer efforts move architectures met limited success perihelion ceased trading 1998 early 1980s tim king joined metacomco university bath bringing rights operating system called tripos metacomco secured contract commodore work amigaos amigados component derived tripos 1986 king left metacomco found perihelion software began development parallel operating system initially targeted inmos transputer series processors helios extended tripos use light-weight message passing architecture networked parallel machines helios 1.0 first commercial release summer 1988 followed version 1.1 autumn 1989 1.1a early 1990 1.2 december 1990 followed 1.2.1 1.2.2 updates version 1.3 significant upgrade numerous utility library server driver improvements last commercial release 1.3.1 later tim king nick garnett gave permission release sources gnu public license v3 helios designed network multiple nodes connected multiple high-bandwidth communications links nodes could dedicated processing nodes processors attached i/o devices small systems might consist host pc workstation connected set several processing nodes larger systems might hundreds processing nodes supported dedicated nodes storage graphics user terminals helios network requires least one i/o server node able provide file system server console server reset control processing nodes power helios nucleus bootstrapped i/o server network node booted using small first-stage loader downloads initialises nucleus proper running node communicates neighbours booting turn required helios nucleus composed kernel libraries loader service processor manager service helios kernel effectively micro-kernel providing minimal abstraction hardware services implemented non-privileged server processes provides memory allocation process management message passing synchronisation primitives helios nucleus contains three libraries system server utility libraries utility library provides basic library routines c programming shared libraries system library provides basic kernel interface converting c function calls messages sent kernel implements abstraction allows communication processes regardless location network server library provides name space support functions writing helios servers described remaining components nucleus loader processor manager servers kernel loaded processes bootstrapped integrate newly running node helios network key feature helios distributed name system helios network implements single unified name space virtual root node optional virtual network structuring nodes nodes processor sub-processor name spaces provided services names similar unix using forward slash separating character textual naming elements name space managed network server started i/o server nucleus booted first attached node network server uses provided network map allocate processor names initialise drivers hardware devices specific nodes network kernel includes name resolver manages local cache routes previously resolved names servers helios processes implement general server protocol typically support server library server protocol conceptually similar unix vfs api closely plan 9 9p requires servers represent resources files standardised open/read/write/close-style operations similar facilities /proc plan 9 unix-like operating systems resources files i/o devices users processes represented virtual files namespace served managing process key servers helios previously mentioned loader processor manager network server together session manager window server file server others include keyboard mouse rs232 centronics servers built host i/o server null server like unix /dev/null logger server like unix syslog user perspective helios quite similar unix usual utility programs provided extensions reflect availability multiple machines immediately apparent helios extends notion unix pipes language called component distribution language cdl cdl typical unix shell pipeline ls called task force transparently distributed task force manager server across available cpus cdl extended traditional unix syntax additional operators bi-directional pipes sequential parallel process farm operators load balancing resource management helios applications written using c c++ fortran modula-2 posix library assists porting existing unix software provides familiar environment programmers helios support programs written occam programming language helios predominantly operating system transputer systems supported products various manufacturers including inmos tram systems meiko cs parsytec multicluster supercluster telmat t.node atari transputer workstation perhaps highest profile helios hardware least outside academia helios ran t4xx t8xx 32-bit transputers t2xx 16-bit models offered device drivers various scsi ethernet graphics hardware inmos transtech others later versions helios ported ti tms320c40 dsp arm architecture used active book tablet device | [
6273,
2179,
6787,
6412,
6675,
7187,
5397,
1304,
6558,
3487,
9762,
3241,
7983,
3248,
8369,
2995,
8499,
9141,
823,
9784,
6075,
9151,
10436,
9932,
8410,
6369,
9964,
5363,
5492,
2424,
633,
2811,
2045
] | None |
1,562 | 1 | ModelRight:modelright modelright database design data modeling tool developed modelright inc used data modelers database developers database architects create visualize document databases entity relationship diagram erd modelright works | [
8808,
9177
] | Test |
1,563 | 3 | PWRficient:pwrficient pwrficient name series microprocessors designed p.a semi pa6t-1682m one became actual product pwrficient processors comply 64-bit power isa designed high performance extreme power efficiency processors highly modular combined multi-core system-on-a-chip designs combining cpu northbridge southbridge functionality single processor die pa6t first processor core p.a semi offered two distinct lines products 16xxm dual core processors 13xxm/e single core processors pa6t lines differed l2 cache size memory controllers communication functionality cryptography offloading features one time p.a semi plans offer parts 16 cores pa6t core first power isa core designed scratch outside aim alliance i.e designed ibm motorola/freescale apple inc. ten years since texas instruments one investors p.a semi suggested fabrication plants would used manufacture pwrficient processors pwrficient processors initially shipped select customers february 2007 released worldwide sale q4 2007 p.a semi bought apple inc. april 2008 closed development pwrficient architecture processors however continue manufacture sell support components foreseeable future due agreement us government processors used military applications pwrficient processors comprise three parts pa6t conexium envoi | [
3457,
6914,
4868,
10501,
3846,
4743,
6663,
5642,
1548,
1933,
398,
6926,
3472,
4881,
7065,
8090,
1309,
6815,
8355,
3493,
6949,
6311,
8102,
1321,
4139,
10924,
9391,
10543,
4017,
5297,
1461,
8120,
6715,
9020,
1725,
1983,
1985,
10180,
336,
66... | Test |
1,564 | 3 | Master_of_Monsters:master monsters master monsters turn-based strategy game developed systemsoft msx nec pc8801 later ported variety consoles pcs including pc engine nec pc9801 sega mega drive genesis sega saturn playstation never garnered success systemsoft stablemate daisenryaku game garnered loyal following success north american market sega genesis proved sufficient sequel sega saturn anime art-style enhanced playstation version titled disciples gaia japanese role-playing game feel gameplay engages players permitting summon move monsters around board effort capture towers eventually defeat opponents controlled either humans computer program moves based hexagonal board structure every tile board adjacent six tiles notable features large variety monsters upgrading leveling veteran units control master character killed end game player focus game strategic despite fantasy-type characters might imply rpg element existence master character magic game gameplay similar system soft hardcore modern warfare strategic wargame series daisenryaku exception versions master monsters master monsters – final series allow equippable items weapons armor later lords chaos julian gollop mythos games shares many elements summoning tactics along earlier title chaos 1985 david white creator open-source turn-based strategy game battle wesnoth cited master monsters inspiration master monsters also compared later games role-playing video game series pokémon also revolves around commanding monsters real-time strategy game starcraft system soft alpha returned game strategy-based roots two entries master monsters series originally popularized nec 9801 pc updated system soft alpha new graphics gameplay features two sequels made japanese windows hark back deep strategic gameplay nec pc9801 versions opposed casual genesis playstation versions available japanese language windows-based systems remakes include マスターオブモンスターズiii special edition マスターオブモンスターズ4 ～光と闇の争覇～ master monsters value edition original game updated expansion packs added 真・マスターオブモンスターズ final spin-off game targeted towards younger audience titled masumon kids mobile version game available japan | [
8355,
6797,
9006
] | None |
1,565 | 9 | Judoscript:judoscript judoscript one several general purpose programming languages designed primarily scripting java platform originator primary developer software engineer james jianbo huang judoscript one first general purpose scripting languages designed specifically use java platform james jianbo huang originated judoscript initially collection several separate packages libraries domain specific languages originated use java platform j2ee enterprise applications huang designed judoscript provide globally simple intuitive scripting framework capable leveraging full suite java packages third-party extensions java foundation design strategy provide infrastructure 1 flexibility command shell 2 full interoperability access facilities java 3 simplified syntax intuitive developers necessarily java programmers design principles judoscript huang stated generally suitable enterprise-scale application development intended replace traditional java syntax example unlike beanshell scripting language judoscript many simplifying syntax constructs i.e. syntactic sugar available within traditional java syntax means code written judoscript expected compile java compiler without changes advantage gained trade-off judoscript allows specialized constructs designed specifically use given problem-domain obviates need bottom programming designed scratch using basic data structures custom-made algorithms admittedly bottom-up programming already obviated large part extensive availability standard third-party libraries within java platform problem according huang libraries often assume higher level experience java programming feasible practical given development requirements scripting applications example simple html scraping routine written loop | [
1952,
9345,
10435,
8582,
8262,
8554,
5677,
9780,
9245
] | Test |
1,566 | 3 | Genghis_Khan_II:_Clan_of_the_Gray_Wolf:genghis khan ii clan gray wolf genghis khan ii clan gray wolf originally released 1992 video game developed koei part koei historical simulation series games sequel genghis khan though third game series genghis khan ii developed published msx2 nintendo entertainment system dos x68000 pc-9801 pc-8801 mega drive/genesis super nes sega cd pc engine later playstation super nes version also made available wii virtual console north america june 8 2009 japan may 11 2010 player given option conquer either country mongolia temujin man would one day become genghis khan one three rivals region take known world time one several rulers throughout europe mainland asia north africa conquests made balance economy population buying selling manufactured goods family relations promoting demoting generals developing military turn-based fashion actions happen within given number turn points actions given priority others overlooked game also includes turn-based battle sequence allowing specific control player delegated general first scenario year 1184 ad mongolia player option controlling four different characters job become ruler mongolian steppes basically control mongolia end scenario beat 1212 ad take rest world fourth scenario world conquest get lead fight ruler chose choice eight generals advisor playable factions players also given option leading various nations worldwide scenarios nations suffer lack relatives generals significantly weaker leaders also absent ability hire elite mongol units largely viewed powerful units game scenario enables player take world part world known time including europe north africa mainland asia player select lead one several countries varying strengths weaknesses example occupying japan draft samurai japan starting point kamakura shogun korean version game player able play goryeo kingdom korean dynasty mongol invasions playable factions third scenario point yuan dynasty 1274 ad kublai khan ruler mongolia china trying rule world playable factions fourth scenario world conquest unlocked year 1185 ad 've successfully completed conquest mongolia first scenario ruler chose first scenario attempts take world mongol hordes scenario genghis khan default leader mongol empire eight best generals best advisor scenarios playable factions play player expect random events including typhoons droughts epidemics sand storms blizzards also bountiful harvests countries autumn important aspect game raise family choose daughter going marry succeed ruler dies case scenario without successors game strong family-oriented empire less susceptible revolutions us version game removed harem subgame entirely raised affinity one wives much like dating simulation game appointing one son general governor marrying one daughter already appointed general governor guarantees governor province rebel declare independence player empire especially important controlling large numbers provinces multiple governors may decide declare independence time governor declares independence new country formed state troops resources state become disposal rebellious general battle control province governor already established however peasant uprising player-controlled province computer chooses general command units troops governor province appointed governor must fight pitched battle control province peasant rebellion wins province troops defend general charge victorious army forms new country province electronic games reviewed snes version 1993 scored 83 computer gaming world 1994 rated pc version four stars five approving combining tactical strategic play strong non-cheating ai easy-to-learn game play lack bugs game reviewed 1995 dragon 213 jay dee eye monitor column reviewers uncertain rate game jay giving game 2½ maybe 3 5 stars dee giving 2 3 | [
10552,
11477,
9166
] | Test |
1,567 | 4 | Information_assurance_vulnerability_alert:information assurance vulnerability alert information assurance vulnerability alert iava announcement computer application software operating system vulnerability notification form alerts bulletins technical advisories identified dod-cert division united states cyber command selected vulnerabilities mandated baseline minimum configuration hosts residing gig uscybercom analyzes vulnerability determines necessary beneficial department defense release iava implementation iava policy help ensure dod components take appropriate mitigating actions vulnerabilities avoid serious compromises dod computer system assets would potentially degrade mission performance combatant commands services agencies field activities required implement vulnerability notifications form alerts bulletins technical advisories uscybercom authority direct corrective actions may ultimately include disconnection enclave affected system enclave compliance iava program directives vulnerability response measures i.e communication tasking orders messages uscybercom coordinate affected organizations determine operational impact dod instituting disconnection february 15 1998 deputy secretary defense issued classified memorandum information assurance instructed disa assistance military departments develop alert system ensured positive control information assurance according memorandum alert system deputy secretary defense issued information assurance vulnerability alert iava policy memorandum december 30 1999 current events time demonstrated widely known vulnerabilities exist throughout dod networks potential severely degrade mission performance policy memorandum instructs disa develop maintain iava database system would ensure positive control mechanism system administrators receive acknowledge comply system vulnerability alert notifications iava policy requires component commands services agencies register report acknowledgement compliance iava database according policy memorandum compliance data reported include number assets affected number assets compliance number assets waivers | [
3552,
612,
5636,
7983,
4820,
2901,
635,
7388,
5373,
2558
] | None |
1,568 | 9 | Qalb_(programming_language):qalb programming language قلب transliterated qalb qlb alb functional programming language allowing programmer write programs completely arabic name means heart recursive acronym arabic meaning qlb programming language قلب لغة برمجة developed 2012 ramsey nasser computer scientist eyebeam art technology center new york city artistic endeavor response anglophone bias vast majority programming languages express fundamental concepts using english words syntax like lisp scheme consisting parenthesized lists keywords appropriate arabic terms program text laid right-to-left like arabic text language provides minimal set primitives defining functions conditionals looping list manipulation basic arithmetic expressions turing-complete fibonacci sequence conway game life implemented program text written arabic connecting strokes characters arabic script extended length possible align source code artistic patterns tradition arabic calligraphy javascript-based interpreter currently hosted herokuapp project forked github قول مرحبا يا عالم | [
9345,
10083,
8262,
6502,
7627,
8495,
11221
] | Train |
1,569 | 1 | DNA_Data_Bank_of_Japan:dna data bank japan dna data bank japan ddbj biological database collects dna sequences located national institute genetics nig shizuoka prefecture japan also member international nucleotide sequence database collaboration insdc exchanges data european molecular biology laboratory european bioinformatics institute genbank national center biotechnology information daily basis thus three databanks contain data given time ddbj began data bank activities 1986 nig remains nucleotide sequence data bank asia although ddbj mainly receives data japanese researchers accept data contributors country ddbj primarily funded japanese ministry education culture sports science technology mext ddbj international advisory committee consists nine members 3 members europe us japan committee advises ddbj maintenance management future plans year apart ddbj also international collaborative committee advises various technical issues related international collaboration consists working-level participants | [] | Test |
1,570 | 1 | Basic_Resident_Registry_Network:basic resident registry network national registry japanese citizens ruled constitutional supreme court japan march 6 2008 amidst strong opposition percentage popularization smartcard called juki-card low ratio view system end failure registry contains following information citizen initial phase network started august 5 2002 implemented literally three statutes online government local government executive procedure june 7 2003 full operation august 25 2003 among 1,700 local governments japan two kunitachi tokyo yamatsuri fukushima refused join network may 2009 registry opposed democratic party japan liberal party japanese communist party social democratic party | [] | Test |
1,571 | 3 | Raid_on_Bungeling_Bay:raid bungeling bay raid bungeling bay first video game designed wright published broderbund commodore 64 1984 ported msx 1985 nes 1987 commodore 64 version published uk ariolasoft nes version japan hudson soft game would inspire wright develop simcity raid bungeling bay 2d war zone shoot 'em player controls helicopter launched aircraft carrier bomb six factories scattered across islands small planetoid occupied bungeling empire frequent villains broderbund games fending escalating counterattacks gun turrets fighter jets guided missiles battleship also hidden island player reload failure means bungeling empire develops war machine take planet earth players attack infrastructure defending aircraft carrier served home base game offers insight design style wright would later go design simcity time factories grow develop new technologies use player also visible signs interdependency among islands supply boats moving order win game player must prevent escalation bombing factories quickly possible keeping advancing technology left alone long factories create enough new weaponry overwhelm player compute wrote 1985 raid possesses virtues needed appease demanding gamer amazingly detailed graphics computer gaming world 1988 approved nintendo version graphics calling high adventure realistic overtones involve dragons elves magazine named action-strategy game year nintendo writing raid rescued broderbund computer software vaults updated slightly sent challenge bright new nintendo games blew water ... delightful game experience 1996 computer gaming world declared raid bungeling bay 24th-best computer game ever released commodore 64 version sold 20,000 30,000 units us nes version sold million units japan large discrepancy attributed lack piracy nes due cartridge system along raid bungeling bay one first american games published japan sales game gave wright financial freedom create simcity wright continued develop editor game personal toy enjoyed much researched urban planning realised others might enjoy constructing building cities result advanced simulation eventually became simcity | [
5388,
9006,
1599
] | Test |
1,572 | 9 | Baby_Modula-3:baby modula-3 baby modula-3 functional programming sublanguage modula-3 safe subset programming language based ideals invented martín abadi object oriented language studying programming language design one part implicitly prototype-oriented programming language explicitly statically typed designed studying computer science type theories checked formal language metaprogramming systems comes scandinavian school object-oriented programming languages martín abadi tried give example pure object-oriented language would allow studying formal semantics objects baby modula-3 defined structured operational semantics set static type rules denotational semantics guarantees soundness definition object model shown well definiteness decidability mechanical proof n't known inventor baby modula-3 worked systems research center src digital equipment corporation dec palo alto california dec bought compaq compaq bought hewlett-packard src-report 95 made available public hp luca cardelli martín abadi wrote book theory objects 1997 laying formal calculi semantics object-oriented programming languages baby modula-3 influenced work according luca cardelli guided calculus type self types object type 'self opened way work modula-3 formal semantic checking systems object oriented type system programming languages used model formal semantics programming languages ada programming language c programming language | [
261,
8262,
5384,
428,
4341,
2045,
9535
] | Test |
1,573 | 4 | Window_Snyder:window snyder mwende window snyder born 1975 american computer security expert previously top security officer intel fastly apple mozilla corporation co-author threat modeling standard manual application security snyder daughter american father kenyan-born mother wayua muasa goes middle name window first name used family members graduated choate rosemary hall 1993 served board snyder director security architecture stake senior security strategist microsoft security engineering communications organization notably security lead signoff microsoft windows xp service pack 2 windows server 2003 also created blue hat microsoft hacker conference leaving microsoft 2005 worked principal founder cto matasano security joined mozilla september 2006 10 december 2008 snyder said would leaving mozilla corporation end year 1 march 2010 snyder began work apple inc 2015 snyder became chief security officer content distribution network fastly intel software services group senior vice president general manager doug fisher announced july 2018 snyder would become company platforms security division chief security officer vice president general manager since left intel may 2019 joined square inc may 2017 snyder spoke next generation threats held techworld idg stockholm sweden april 2017 snyder keynote speaker hitbsecconf held hack box amsterdam november 2017 snyder spoke o'reilly security conference april 2018 spoke rsa conference august 2018 snyder keynote speaker open source summit held linux foundation | [
5512,
4074,
4011,
1453,
1525,
7899,
5404,
2558
] | Test |
1,574 | 2 | AdJ:adj adj aprendiendo de jesús distribution openbsd spanish speakers source code available github learn install challenge p2pu version based corresponding version sources openbsd distribution cited number independent authors | [
7552,
10016,
9320,
5067,
5356,
5363,
788,
5397,
11221,
7483,
9151
] | Test |
1,575 | 2 | RNDIS:rndis remote network driver interface specification rndis microsoft proprietary protocol used mostly top usb provides virtual ethernet link versions windows linux freebsd operating systems partial rndis specification available microsoft windows implementations observed issue requests included specification undocumented constraints protocol tightly coupled microsoft programming interfaces models notably network driver interface specification ndis alien operating systems windows complicates implementing rndis non-microsoft operating systems linux freebsd netbsd openbsd implement rndis natively usb implementers forum usb-if defines least three non-proprietary usb communications device class usb cdc protocols comparable virtual ethernet functionality one cdc-ecm predates rndis widely used interoperability non-microsoft operating systems work windows versions android include rndis usb functionality recent versions nexus 6p september 2016 | [
8080,
6797,
10079,
823
] | Test |
1,576 | 3 | Macintosh_LC_family:macintosh lc family macintosh lc family personal computers designed manufactured sold apple computer inc. 1990 1997 introduced alongside macintosh iisi macintosh classic part new wave lower-priced macintosh computers lc offered overall performance macintosh ii half price part apple goal produce machine could sold school boards price apple ii original macintosh lc introduced october 1990 updates form lc ii lc iii 1992 early 1993 early models shared pizza box form factor joined macintosh lc 500 series all-in-one desktop machines mid-1993 total twelve different lc models produced company last power macintosh 5300 lc sale early 1997 apple co-founder steve jobs left apple 1985 product development handed jean-louis gassée formerly manager apple france gassée consistently pushed apple product line two directions towards openness terms expandability interoperability towards higher price gassée long argued apple market computers towards low end market profits thin instead concentrate high end higher profit margins illustrated concept using graph showing price/performance ratio computers low-power low-cost machines lower left high-power high-cost machines upper right high-right goal became mantra among upper management said fifty-five die referring gassée goal 55 percent profit margin policy led series ever expensive computers spite strenuous objections within company group claris started low-end mac project called drama gassée actively killed elsewhere company two engineers h.l cheung paul baker working secret pet project color macintosh prototype called spin idea produce low-cost system vein apple ii product cheung previously worked apple head design machine would effect significantly smaller macintosh ii built-in video nubus expansion matching rgb monitor similar one introduced apple iigs year prior project changed direction development executives dictating machine video capabilities processing power similar macintosh iici also development time early 1989 prototype shown apple executives liked project felt different enough existing models justify effort project shut around time apple ceo john sculley facing public scrutiny declining sales blamed large part company lack inexpensive macintosh computer amidst promises press investors new low-cost macintosh way revived spin project goal creating lowest-priced macintosh possible gassée pleaded team keep color feature project product known internally new code name elsie homonym lc i.e low-cost color name computer would later sold elsie prototypes point resembled apple iic keyboard integrated unit single 800 kb floppy drive hard drive team ended problem — machine cheap n't good computer especially 68000 cpu powerful enough display color graphics acceptable performance april 1989 decided split project three computers -- macintosh iisi would powerful 68030 cpu macintosh classic would use black white display lc would use 68020 cpu macintosh ii keep price apple cut corners performance features redesigned components less expensive example external floppy connector included iisi classic excluded lc would save couple dollars connector integrated keyboard also dropped point replaced newly designed keyboard called apple keyboard ii macintosh lc introduced market alongside macintosh classic repackaging older macintosh plus macintosh iisi new entry-level machine macintosh ii series due pent-up demand low-cost color macintosh lc strong seller 1992 original macintosh lc succeeded lc ii updated machine replaced lc motorola 68020 processor 68030 increased soldered memory 4 mb make suitable system 7 however retained original lc 16-bit system bus 10 mb ram limit 4 mb simms used extra 2 mb ram would inaccessible making performance roughly earlier model main benefit 030 processor lc ii ability use system 7 virtual memory feature spite new model sold even better lc computer gaming world 1990 criticized lc expensive stating consumers would prefer 2,000 ibm ps/1 vga graphics 3,000 lc color monitor although classic popular first may 1992 lc 560,000 sold outselling classic 1.2 million half lcs used homes schools apple claimed helped company regain educational market share lost inexpensive pc clones iie card used half schools lcs early 1993 apple introduced lc iii used 25 mhz version 68030 higher memory limit 36 mb instead 10 mb lc lc ii lc iii spawned whole series lc models later sold lc name education world consumers via traditional apple dealers performa consumer market via electronics stores department stores sears example lc 475 also known performa 475 last official lc power macintosh 5300/100 lc released august 1995 discontinued april 1996 lc 580 notable last desktop 680x0-based macintosh mid-1993 apple introduced macintosh lc 520 combined traditional all-in-one form factor popularized compact macintosh family technology platform lc iii became apple mainstream education-market macintosh featuring built-in 14 crt display cd-rom drive stereo speakers case similar recently-introduced macintosh color classic considerably larger heavier due larger screen bulging midsection house larger electronics four lc 500-series models released next two years 520 550 575 580 520 550 using different speeds motorola 68030 575 580 sharing 33mhz motorola 68lc040 processor differing rest hardware computers also sold consumer market department stores macintosh performa brand similar model numbers lc models particular became popular schools small footprint lack cable clutter durability apple also released macintosh tv variant lc/performa 520 branded lc uses black-coloured version lc 520 case logic board similar lc 550 tv tuner card compact color classic series shares many components able swap logic boards early 500 series machines power macintosh 5200 lc introduced april 1995 powerpc 603 cpu 75 mhz powerpc-based replacement lc 500 series august power macintosh 5300 lc released kept motherboard design included powerful powerpc 603e cpu well director edition similar design features macintosh tv unlike previous education models prepended model number lc 5200 5300 models use power macintosh designation apple main workstation line time lc appended end 5300 lc final model branded lc sale early 1997 replacement power macintosh 5500 continued practice building education-specific models without distinctive branding except uk-only power macintosh one/225 company produce another education model brand name emac 2002 | [
9732,
7697,
4114,
6165,
11289,
7706,
8222,
1057,
6183,
4139,
7211,
8253,
1090,
8783,
4180,
10838,
10840,
9312,
9826,
8806,
6258,
10357,
7286,
4220,
10365,
10878,
6783,
7299,
4741,
8842,
6283,
7824,
147,
7830,
6807,
4258,
7842,
7844,
2735,
... | Test |
1,577 | 2 | Windows_Vista_I/O_technologies:windows vista i/o technologies windows vista introduced number new i/o functions microsoft windows line operating systems intended shorten time taken boot system improve responsiveness system improve reliability data storage vista modifies behavior asynchronous i/o operations new asynchronous i/o apis thread different one issued i/o request notified operation completes single thread issue i/o requests switch different worker thread thread one handles data i/o request completes thread-switch causes performance hit may avoided windows vista also introduces synchronous i/o cancellation synchronous i/o request application blocked request serviced fails windows vista application may issue cancellation request applications cancel operation user feedback may prefer enable user feedback time issuing thread suspended usability windows vista also implements i/o scheduling prioritized i/o disk i/o requests windows vista assigned priorities higher priority request given preferential treatment request lower priority execution request windows vista defines five priority classes – low low normal high critical default i/o requests assigned normal priority windows vista also allows reservation bandwidth per-application basis disk access aims guarantee required throughput rate application accesses disk features used windows media player respect media playback disk defragmenter superfetch windows defender windows search applications run startup use prioritized i/o prior windows vista i/o requests capped 64 kb thus larger operations completed chunks windows vista limit size i/o requests means entire i/o operation completed issuing fewer requests turn may lead higher performance windows explorer command prompt copy command modified issue 1 mb requests readyboost makes pcs running windows vista responsive using flash memory usb drive usb 2.0 3.0 sd card compact flash form flash memory order boost system performance device plugged windows autoplay dialog offers additional option use speed system additional readyboost tab added drive properties dialog amount space used configured windows readyboost also available windows 7 windows 10 flash memory devices formatted fat32 format need changed one wants properly utilize larger flash device readyboost one activates readyboost using windows autoplay reformatting device become impossible readyboost device disabled readydrive codenamed piton feature windows vista enables windows vista computers equipped hybrid drive flash memory caches intel turbo memory boot faster resume hibernation less time preserve battery power hybrid hard drives type hard disk integrates non-volatile flash memory traditional hard drive drive-side functionality expected standardized ata-8 hybrid hard drive installed windows vista machine operating system display new nv cache property tab part drive device properties within device manager reported eweek technology utilized full extent due lack hybrid drive-specific drivers hybrid drives instead delegated job device manufacturers however microsoft rebuffed suggestion providing specialized drivers hybrid systems also june 2006 david morgenstern wrote article eweek suggesting readydrive might sacrifice data integrity speed battery savings documentation microsoft however claims copy data always maintained hard disk question data loss even flash cache fails superfetch technology pre-loads commonly used applications memory reduce load times based prefetcher function windows xp superfetch attempts load commonly used libraries application components memory required continually analyzing application behavior usage patterns e.g applications typically used morning logon cache memory marked low priority meaning another process needs memory given default necessary files loaded main memory using feature called readyboost windows vista windows 7 use alternative storage usb flash drives thereby freeing main memory although hard disks usually higher sequential data transfer rates flash drives faster small files non-sequential i/o short random seek times offline files feature windows introduced windows 2000 maintains client-side cache files shared network locally caches shared files marked offline access uses cached copy whenever network connection remote files interrupted windows vista business enterprise ultimate editions contain significant improvements offline files beginning windows vista whenever connection restored open file handles cached copy redirected remote version without waiting cached files synchronized transition online offline back transparent clients using file local copy automatically synchronized remote copy reflect changes made either copy file file caching sync algorithm also completely rewritten determine differences faster synchronizing changes cached copy remote version bitmap differential transfer protocol used changed blocks cached version transferred also improves support caching large files entire file still downloaded retrieving changes remote copy files synchronized per-share basis encrypted per-user basis users force windows work offline mode online mode work offline/online button explorer sync manually sync center sync center also report sync errors resolve sync conflicts property page file folder offline files tab provides status allows control offline status file folder moreover even single file unavailable files share shares available transition share level instead server level offline files configurable group policy provide better interoperability dfs also comprehensive offline files management api available via com objects scriptability wmi windows vista also supports ghosting online files folders users make files directory available offline windows vista creates ghosted entries remaining unavailable items preserve online context offline files also feature slow-link mode enabled group policy always reads writes local cache improve performance slow network connection also possible windows vista specify limit total size local cache another sub-limit space used automatically cached files manually cached files never removed local cache even cache limit reached windows xp offline files could enabled fast user switching enabled restriction applied offline files synchronized log fast user switching completely log users windows vista restriction longer applies offline files runs windows service performs synchronization user opportune times logon offline online transitions synchronization occur continuously background occur log transactional ntfs abbreviated txf brings concept atomic transactions ntfs file system allowing windows application developers write file output routines guaranteed either completely succeed completely fail transactional ntfs allows files directories created renamed deleted atomically using transaction ensures correctness operation series file operations done transaction operation committed operations succeed case failure entire operation roll back fail number microsoft windows components updated make use shadow copy backup restore center windows vista later performs block-based backups full system backups file backup feature also uses shadow copy stores files inside zip files beginning windows vista shadow copy also used system protection component creates maintains periodic copies system user data local volume similar shadow copies shared folders feature windows server allows locally accessed system restore system restore allows reverting entire previous set shadow copies called restore point prior windows vista system restore based file-based filter watched changes certain set file extensions copied files overwritten additionally property sheet shell extension called previous versions allows restoring individual files folders locally restore point existed time snapshot thus retrieving earlier version file recovering file deleted mistake shadow copy created every time file changed backup copies created automatically per day manually triggered backup utility installer applications create restore point previous versions feature available business enterprise ultimate editions windows vista windows vista introduces ability independently redirect 10 user profile sub-folders network location also management console snap-in windows vista allow users configure folder redirection clients running windows vista windows xp windows 2000 windows vista service pack 1 introduced support exfat file system | [
10243,
5643,
4624,
10769,
9234,
1043,
537,
540,
3102,
1055,
9762,
2083,
8227,
3109,
8740,
1577,
10281,
1581,
4143,
9263,
11316,
1077,
2101,
8246,
10812,
3648,
1098,
7754,
10828,
4173,
4174,
9808,
4178,
9813,
10839,
603,
9819,
8798,
2145,
... | None |
1,578 | 2 | RenderScript:renderscript renderscript component android operating system mobile devices offers api acceleration takes advantage heterogeneous hardware allows developers increase performance applications cost writing complex lower-level code provides developer three primary tools simple 3d rendering api compute api similar cuda c99-derived language renderscript added android 3.0 honeycomb android 4.1 renderscipt experimental 3d rendering api deprecated exists solely compute api android 4.2 added new capabilities script intrinsics blend blur well scriptgroups allow chain together related renderscript scripts execute one call recently google added filterscript subset renderscript allows developers write image processing operations filterscript using standard renderscript runtime api within stricter constraints ensure wider compatibility improved optimization across multi-core cpus gpus dsps filterscript less precise terms numeric datatype precision cross device compatible subset renderscript – mistaken renderscript replacement technology renderscript designed always run various android platforms regardless hardware type performance tuning done runtime renderscript portability depends upon device-specific drivers basic cpu-only driver provided every device exist specific chipset-provided renderscript drivers enable gpu usage e.g qualcomm specific drivers provided codice_1 android library renderscript designed tune tasks runtime efficiently split run concurrently underlying hardware android 4.2 renderscript expanded run gpu addition cpu supported systems | [
5637,
8719,
3600,
7700,
9244,
11294,
5677,
1083,
6212,
69,
8262,
4685,
3664,
8280,
8285,
2658,
6268,
11391,
1670,
5262,
10393,
7835,
673,
8870,
1191,
196,
8907,
8413,
9949,
1255,
8940,
1776,
5892,
7428,
2828,
5396,
280,
10009,
10525,
798,... | Test |
1,579 | 1 | H2_(DBMS):h2 dbms h2 relational database management system written java embedded java applications run client-server mode software available open source software mozilla public license 2.0 original eclipse public license subset sql structured query language standard supported main programming apis sql jdbc however database also supports using postgresql odbc driver acting like postgresql server possible create in-memory tables well disk-based tables tables persistent temporary index types hash table tree in-memory tables b-tree disk-based tables data manipulation operations transactional table level locking multiversion concurrency control implemented 2-phase commit protocol supported well standard api distributed transactions implemented security features database role based access rights encryption password using sha-256 data using aes tiny encryption algorithm xtea cryptographic features available functions inside database well ssl tls connections supported client-server mode well using console application two full text search implementations included native implementation one using lucene simple form high availability implemented used client-server mode database engine supports hot failover commonly known clustering however clustering mode must enabled manually failure database supports protection sql injection enforcing use parameterized statements h2 feature called 'disabling literals since version 1.1.111 h2 in-memory database run inside google app engine h2 documentation explains detail several ways problems underlying hardware particular power systems impact durability relational databases according h2 documentation problems related db engine design also storage caching mechanism storage devices use write cache order increase speed situation power failure data device cache lost administrators assess common trade speed data loss risks context business requirements must carefully consider design power supply ups critical servers possible cases force storage write cache frequently even immediately using fsync slows writing process one accept caching device buffer introduces risk data loss case power failure effectiveness using fsync limited fact many hdd write caching enabled factory default case nothing design settings database os level commands able completely eliminate chance lost inconsistent data event sudden power failure working os hardware settings disable caching write data real time significant impacts performance around 100 write operations per second would achievable using spinning disks h2 documentation makes effort describe detail potential problems durability part acid resulting potential data loss committed transactions case power failure considering hardware limitations regarding preservation data event sudden power loss ineffectiveness approaches commonly employed developers prevent sorts losses many database engines default call filedescriptor.sync filechannel.force fsync equivalents every commit significantly degrade system performance without significantly increasing durability hsqldb documentation references workarounds similar set issues documentation microsoft knowledge base describes impact issues power failures write caching etc performance durability knowledge base discusses trade offs performance vulnerability disk write caching well settings administrator use balance embedded web server browser based console application included well command line tools start stop server backup restore databases command line shell tool development h2 database engine started may 2004 first published december 2005 database engine written thomas mueller also developed java database engine hypersonic sql 2001 hypersonic sql project stopped hsqldb group formed continue work hypersonic sql code name h2 stands hypersonic 2 however h2 share code hypersonic sql hsqldb h2 built scratch | [
899,
3219,
10389,
1816,
10137,
10921,
4781,
5677,
7983,
10286,
2737,
10413,
3636,
5691,
10048,
3784,
6986,
6219,
6993,
10193,
9177,
8539,
225,
1383,
5612,
2413,
7022,
9471
] | Validation |
1,580 | 4 | Netsniff-ng:netsniff-ng netsniff-ng free linux network analyzer networking toolkit originally written daniel borkmann gain performance reached zero-copy mechanisms network packets rx_ring tx_ring linux kernel need copy packets kernel space user space via system calls recvmsg libpcap starting release 1.0.0 also supports zero-copy mechanism linux capturing rx_ring programs using libpcap also use mechanism linux netsniff-ng initially created network sniffer support linux kernel packet-mmap interface network packets later tools added make useful toolkit iproute2 suite instance kernel zero-copy interface efficient packet processing reached even commodity hardware instance gigabit ethernet wire-speed reached netsniff-ng trafgen netsniff-ng toolkit depend libpcap library moreover special operating system patches needed run toolkit netsniff-ng free software released terms gnu general public license version 2 toolkit currently consists network analyzer packet capturer replayer wire-rate traffic generator encrypted multiuser ip tunnel berkeley packet filter compiler networking statistic tools autonomous system trace route distribution specific packages available major operating system distributions debian fedora linux also added xplico network forensic toolkit grml linux securityonion network security toolkit netsniff-ng toolkit also used academia examples assumed eth0 used network interface programs netsniff-ng suite accept long options e.g. -- -i -- -o -- dev -d astraceroute -d eth0 -n -s -h host e.g. netsniff-ng.org ifpps -d eth0 -p trafgen -d eth0 -c trafgen.txf bpfc fubar.bpf flowtop netsniff-ng -i eth0 -o dump.pcap -s -b 0 netsniff-ng toolkit currently runs linux systems developers decline port microsoft windows | [
2569,
6797,
5139,
10016,
6177,
10788,
1064,
10924,
7983,
2228,
5045,
9142,
823,
6345,
842,
9939,
6997,
7895,
5472,
9440,
11249,
2292,
5749,
2045,
2558
] | None |
1,581 | 2 | Development_of_Windows_Vista:development windows vista development windows vista occurred span five half years starting earnest may 2001 prior release microsoft windows xp operating system continuing november 2006 microsoft originally expected ship new version sometime late 2003 minor step windows xp codenamed whistler windows 7 codenamed blackcomb vienna vista original codename longhorn allusion plan whistler blackcomb large ski resorts british columbia longhorn name bar two mountains whistler visitors pass reach blackcomb gradually windows longhorn assimilated many important new features technologies slated blackcomb resulting release date pushed back times many microsoft developers also re-tasked improving security windows xp faced ongoing delays concerns feature creep microsoft announced august 27 2004 making significant changes longhorn development started afresh building windows server 2003 codebase re-incorporating features would intended actual operating system release previously announced features winfs ngscb dropped postponed longhorn named windows vista mid-2005 unprecedented beta-test program started involved hundreds thousands volunteers companies september 2005 october 2006 microsoft released regular community technology previews ctp beta testers two release candidates general public development windows vista came conclusion november 8 2006 announcement completion co-president windows development jim allchin early development stages longhorn generally characterized incremental improvements updates windows xp period microsoft fairly quiet worked marketing public relations focus strongly focused windows xp windows server 2003 released april 2003 occasional builds longhorn leaked onto popular file sharing networks irc bittorrent edonkey various newsgroups known builds prior first sanctioned development release longhorn may 2003 derived builds builds longhorn vista identified label always displayed bottom-right corner desktop typical build label would look like longhorn build 3663.lab06_n.020728-1728 higher build numbers n't automatically mean latest features every development team microsoft included typically team working certain feature subsystem would generate working builds developers would test code deemed stable changes would incorporated back main development tree microsoft number build labs exist compilation entirety windows performed team lab given build originated shown part build label date time build follows builds beta 1 beta 2 display build label version information dialog winver icons windows xp installing milestone 2 builds oobe setup process windows xp different music build 3663 build date july 28 2002 first known build leaked screenshots first sighting plex style microsoft regarded place-holder theme development versions ready demonstrate aero build 3670 build date august 19 2002 screenshots build showed variation device manager implemented inside windows explorer feature later appeared windows 7 build 3683 build date september 23 2002 leaked october 20 2002 first longhorn build leaked internet build first several working title longhorn xp professional visually significantly different windows xp one notable changes windows logo white colored like versions windows also templates documents pictures notably different well open save dialog boxes also included template incorporating aesthetic changes new user interface options new sidebar also present contained many gadgets would much later seen windows sidebar analog clock slide show search capability option version sidebar also made possible move start button disable traditional taskbar entirely early revision winfs also included little way user interface included appeared early testers nothing service consumed large amounts memory processor time display properties control panel first significant departure built new avalon api build 3706 build date october 29 2002 leaked may 22 2006 one first builds include desktop composition engine dce later became desktop window manager dwm build appeared internet long builds time period included several changes first reported part later milestone builds including internet explorer 6.05 plex theme build 3718 build date november 19 2002 leaked april 30 2004 included dce early hardware-accelerated alpha transparency transition effects demonstration dce capabilities programs literally flipped taskbar twisted minimized several months relatively little news activity microsoft longhorn build 4008 build date february 19 2003 made appearance internet around february 28 2003 also privately handed select group software developers evolutionary release build 3683 contained number small improvements including modified blue plex theme new simplified windows image-based installer operates graphical mode outset completed install operating system approximately one third time windows xp hardware optional new taskbar introduced thinner previous build displayed time differently notable visual functional difference however came windows explorer incorporation plex theme made blue dominant color entire application windows xp-style task pane almost completely replaced large horizontal pane appeared toolbars new search interface allowed filtering results searching windows help natural-language queries would used integrate winfs animated search characters also removed view modes also replaced single slider would resize icons real-time list thumbnail details mode depending slider file metadata also made visible easily editable active encouragement fill missing pieces information also note conversion windows explorer .net application build 4015 build date march 28 2003 leaked internet april 28 2003 number features microsoft working rolled build range parental controls also moved enlarged windows logo left side start button lot additional configurability sidebar including able put start bar bottom screen notion libraries later known virtual folders files libraries collected content around hard drive user could filter content save folder microsoft originally intended replace special shell folders documents music etc virtual folders however change deemed drastic dropped beta 1 release mid-2005 libraries later included windows 7 build also notable debut boot screen progress bar seen final release though 4015 version blue green new download manager shell location suggested internet explorer would get mozilla-style download manager though functionality apparent significant memory leak problems windows explorer sidebar made build difficult use resulted third-party hacks mitigate problem back-end database outlook express changed completely became dependent winfs store email winfs still significant performance memory usage issues became common testers disable winfs entirely thus rendering outlook express inoperative windows hardware engineering conference winhec conference may 2003 microsoft gave first public demonstrations new desktop window manager aero demonstrations done revised build 4015 never released number sessions developers hardware engineers conference focused new features well next-generation secure computing base previously known palladium time microsoft proposed solution creating secure computing environment also conference microsoft reiterated roadmap delivering longhorn pointing early 2005 release date build 4028 build date july 1 2003 first known server build based windows server.net rc1 later became windows server 2003 traditional client bits visual style look present disabled default build 4029 build date june 19 2003 leaked september 23 2003 build contained technologies new build 4015 windows explorer went number changes larger image video previews displayed tooltip mouse hovered file column-level filtering results introduced overall performance explorer somewhat improved build 4015 though memory leak issues entirely resolved also new analog clock user interface batch image processing images also introduced making possible user rotate number images build 4029 name displayed onghornlay rofessionalpay ersionvay 2003 pig latin longhorn professional version 2003 various places around operating system presumed screenshots build fake seemingly obvious mistake microsoft later explained merely test new code locate reduce number places operating system code name defined build 4033 build date july 17 2003 similar 4029 contained ui improvements including updated plex theme build 4039 build date august 27 2003 leaked august 22 2007 build includes phodeo 3d view displaying photos full dwm glass last build contain plex visual style build 4042 build date september 9 2003 probably earliest build slate theme lab06 instead plex theme winmain seen previous builds however aero glass build 4039 still present word removed computer network places build 4050 build date september 28 2003 shown teched 2004 israel one many 4050-numbered builds used microsoft demos notably 2003 professional developers conference official pdc 2003 build build date october 1 2003 build number 4051 released general public leak october 20 2003 introduced slate theme debuted 4042.lab06 build also contained updated version internet explorer version number 6.05 new features noted reviewers included download manager pop-up blocker add-on manager tool clear browsing history exception download manager eventually discarded features appeared builds internet explorer included preview builds windows xp service pack 2 months later windows sidebar enabled word start removed start button development used later windows vista build 4053 build date october 22 2003 leaked march 2 2004 minor changes build 4066 build date february 26 2004 although build identified server build contained many features ever seen associated desktop builds updated version phodeo included well sidebar mini-windows media player associated sidebar tiles functioning build desktop window manager jade theme build also replaced many xp icons new longhorn icons greatly resemble icons final version vista build leaked december 20 2008 may 2004 microsoft changed plans include next-generation secure computing base technology longhorn technology better known original code-name palladium garnered much criticism analysts security specialists researchers often cited advocates non-microsoft operating systems reason migrate preferred platform ross anderson example published paper collating many concerns criticisms part larger analysis trusted computing light large amount negative response analysts enterprise customers software developers microsoft shelved many aspects ngscb project indefinite period time aspect ngscb included final release operating system bitlocker make use trusted platform module chip facilitate secure startup full-drive encryption build 4067 build date february 12 2004 private beta shown jim allchin keynote winhec 2004 build 4074 build date april 25 2004 official winhec 2004 preview build leaked may 2004 build introduced improved jade theme although slate theme retained default also font segoe ui introduced jade theme also familiar pre-reset build build 4083 build date may 16 2004 – leaked november 10 2004 sidebar winfs dropped release considered highly unstable including absence programs start menu driver installation issues build 4093 build date august 19 2004 – one last builds compiled development reset considered highly unstable contained sidebar winfs avalon-based windows movie maker preliminary version windows anytime upgrade microsoft anna speech synthesizer avalon-based display properties control panel applet hidden \windows\system32 folder similar one build 3683 2004 become obvious windows team microsoft losing sight needed done complete next version windows ship customers internally microsoft employees describing longhorn project another cairo cairo.net referring cairo development project company embarked first half 1990s never resulted shipping operating system though nearly technologies developed time end windows 95 windows nt microsoft shocked 2005 apple release mac os x tiger offered limited subset features planned longhorn particular fast file searching integrated graphics sound processing appeared impressive reliability performance compared contemporary longhorn builds longhorn builds major explorer.exe system leaks prevented os performing well added confusion development teams later builds code developed failed reach stability september 23 2005 front-page article wall street journal microsoft co-president jim allchin overall responsibility development delivery windows explained development longhorn crashing ground due large part haphazard methods features introduced integrated core operating system without clear focus end-product december 2003 allchin enlisted help two senior executives brian valentine amitabh srivastava former experienced shipping software microsoft notably windows server 2003 latter spent career microsoft researching developing methods producing high-quality testing systems srivastava employed team core architects visually map entirety windows operating system proactively work towards development process would enforce high levels code quality reduce interdependencies components general make things worse vista things conjunction fact many microsoft skilled developers engineers working windows server 2003 led decision reset development longhorn building code would become windows server 2003 service pack 1 instead older windows.net server release candidate 1 build 3663 change announced internally microsoft employees august 26 2004 began earnest september though would take several months new development process build methodology would used development teams number complaints came individual developers bill gates new development process going prohibitively difficult work within changes build labs also resulted period time several months builds longhorn leaked onto internet build 3790.1232 build date august 19 2004 notable first build longhorn based server 2003 code base windows xp interface successive internal builds several months gradually integrated lot fundamental work done previous three years much stricter rules code could brought main builds builds period time described variously longhorn d1 milestone 8 9 depending whether new old build tree worked evidence similar build marked build 5000 built september 8 2004 also found build 5001 build date september 12 2004 windows longhorn build also windows xp interface wallpaper windows xp bull long horns boot screen also windows xp lh replacing xp lh represents longhorn build 5048 built april 1 2005 official winhec 2005 preview build described longhorn developer preview made available winhec attendees april 24 2005 build time period made available microsoft officially distributed outside winhec build quickly appeared file sharing networks aero visual style made first appearance build desktop window manager present disabled hidden default keynote presentation bill gates also announced many winfx developer apis originally planned exclusively longhorn going backported windows xp server 2003 final user interface longhorn would seen longer features device-independent resolutions rasterized icons virtual folders registry virtualization discussed well build 5048 closer resemblance windows xp prior longhorn builds 2003 2004 surprised many leading well-known windows enthusiast paul thurrott write thoughts positive positive painful build deal year waiting step back ways hope microsoft surprises sleeves makings train wreck months later thurrott stated vista development process since recovered recent builds build 5060 build date april 17 2005 major difference build 5048 except new style logon screen desktop wallpaper changed microsoft considered several names new operating system end microsoft chose windows vista confirmed july 22 2005 believing wonderful intersection product really windows stands resonates customers needs group project manager greg sullivan told paul thurrott— want pc adapt help cut clutter focus ’ important windows vista bringing clarity world reference three marketing points vista—clear connected confident focus matters microsoft co-president jim allchin also liked name saying vista creates right imagery new product capabilities inspires imagination possibilities done windows—making people ’ passions come alive windows vista beta 1 build 5112 build date july 20 2005 released july 27 2005 first longhorn build called windows vista available microsoft developer network msdn technet subscribers well select group microsoft beta testers compared winhec build released earlier year vista beta 1 large advancement introducing new user interface features windows shell drastically changed yet introducing virtual folders new search interface number new high-resolution icons revamped windows explorer interface away menus toolbar buttons present previous versions beta 1 also introduced many underlying technologies slated vista including new networking audio stacks parental controls fairly complete working build .net framework 3.0 still referred winfx build 5219 build date august 30 2005 microsoft started releasing regular community technical previews ctp beta testers less stability work made actual betas build 5219 also known ctp1 september ctp distributed among 2005 pdc attendees september 13 2005 released microsoft beta testers msdn subscribers first public ultimate edition build included super fetch although enabled default refresh saw return windows sidebar removed part development reset introduction desktop gadgets part microsoft gadgets line mini-applications microsoft stated intended make additional gadgets available download web site time build also supported new version windows media center code-named diamond although microsoft stated winfs make debut windows vista users build 5219 noticed winfs fact included version several windows 'rumor sites newsgroups neowin paul thurrott supersite windows speculated winfs would fact ready time windows vista release build 5231 build date october 4 2005 also known ctp2 october 2005 ctp released msdn subscribers microsoft beta testers october 17 2005 ultimate build introduced windows media player version 11 updated volume control utility added control volume level every running program build 5259 built november 17 2005 released microsoft technology adoption program tap members november 22 2005 originally announced released november 18 november ctp microsoft cancelled november ctp due instability however released build tap members sidebar temporarily removed build new ui changes including ability change color clarity ui windows antispyware soon windows defender integrated outlook express renamed windows mail idw build therefore gone ctp testing process leaked internet december 7 2005 december ctp built december 14 2005 build number 5270 released testers msdn december 19 2005 close feature complete since feature complete build delayed late january 2006 build windows antispyware renamed windows defender ie7 new icon/logo minor ui changes december ctp also last build windows vista supported bypassing wddm driver model requirement hence allowing desktop window manager uxss time build run using software vertex emulation change post 5270 builds well known keys 'usemachinecheck 'enablemachinecheck allow running desktop window manager software emulation mode february ctp built february 17 2006 build number 5308 released february 22 2006 first feature-complete ctp build meant enterprises also first build upgrade compatibility build according microsoft one feature appear next ctp customers see final release however later builds brought improvements previously expected unstaged revision made build released february 28 2006 build 5308.60 built february 23 released result windows server longhorn many issues february ctp also incorporated numerous virtual folders including attachments favorite music fresh tracks important e-mail last 7 days e-mail last 30 days documents last 30 days pictures videos recently changed shared unread e-mail user files intel developer forum march 9 2006 microsoft announced change plans support efi windows vista uefi 2.0 specification replaces efi 1.10 completed early 2006 time microsoft announcement firmware manufacturers completed production implementation could used testing result decision made postpone introduction uefi support windows support uefi 64-bit platforms postponed vista service pack 1 windows server 2008 32-bit uefi supported microsoft expect many systems built market moves 64-bit processors february ctp refresh built march 21 2006 build number 5342 released march 24 2006 build shipped technical beta testers corporate customers microsoft used testing board extensive feedback got february ctp described release external developer workstation intent providing interim build ctps microsoft claimed still track deliver next ctp second quarter build last beta 2 fork build included minor ui changes notably improvements media center new aero aurora effects faster setup process new sidebar gadgets slight improvements overall performance stability paint also slightly improved new screenshot snapping/saving tool included slightly redesigned network center build meet ctp quality measurements available ultimate edition 32-bit x86 64-bit x64 systems april edw built april 19 2006 build number 5365 released april 21 2006 introduced changes visual user interface elements behavior user account control number new backgrounds also introduced two new screensavers added well sidebar enabled default automatic defragmentation hard drive hold'em game shipped previous ctps dropped due apparent political sensitivity issues microsoft offers separate web download windows vista ultimate users windows vista beta 2 preview built may 1 2006 build number 5381 leaked may 2 2006 officially released may 6 2006 microsoft technical beta testers featured mostly performance tweaks minor changes compared build 5365 build microsoft entered beta 2 escrow windows vista beta 2 built may 18 2006 build number 5384 released microsoft developer network subscribers first since 5308 microsoft connect testers may 23 2006 conjunction bill gates keynote presentation winhec 2006 conference june 6 microsoft extended availability beta 2 users making vista available free download several languages web site technology web sites described release largest download event software history june microsoft made two significant changes plans windows vista one issue inclusion xml paper specification support vista microsoft office 2007 become major point dispute adobe systems first introduced may 2005 xps known time metro characterized pdf-killer adobe representative stated threatened addition longhorn however year later adobe changed stance saw inclusion new document format anti-competitive attack portable document format microsoft refused remove xps altogether noting core vista print spooling system offered ability system builders oems remove user-visible aspects document format operating system days later announced pc-to-pc sync would ship windows vista june 14 2006 windows developer philip su posted blog entry decried development process windows vista stating code way complicated pace coding tremendously slowed overbearing process. post also described windows vista approximately 50 million lines code 2,000 developers working product build 5456 build date june 20 2006 released june 24 2006 new features included revamped aero subsystem completely overhauled significantly less obtrusive user account control interface list view windows explorer brought back removed beta 1 microsoft developer ben betz later explained blog entry felt removing list mode made sense based usability research inability support windows explorer new grouping feature feature restored based great deal feedback beta testers release notes build state time zone bug plagued almost previous builds windows vista patched quite issues regional settings ime also resolved new windows aero mouse pointer scheme introduced introduced anti-aliasing mouse pointer first time many remaining windows xp-style icons replaced new icons disk space used clean installation also significantly reduced build 5472 build date july 13 2006 released july 17 2006 aside incorporating number bug fixes localization improvements build also introduced revised basic theme replaces gray theme seen previous builds light blue theme network center significantly revised well collating status information one place reducing number steps get configuration options desktop backgrounds icons introduced flip3d saw layout tweaks new windows aero mouse cursor set default build huge performance improvement beta 2 comparable possibly even faster windows xp demonstration speech recognition feature new windows vista microsoft financial analyst meeting july 27 2006 software recognized phrase dear mom dear aunt several failed attempts correct error sentence eventually became dear aunt let set double killer delete select developer vista speech recognition team later explained bug build vista causing microphone gain level set high resulting audio received speech recognition software incredibly distorted august 8 2006 microsoft security response center provided critical security fixes windows vista beta 2 making first microsoft product get security updates still beta build 5536 build date august 21 2006 released august 24 2006 august 29 august 31 first 100,000 users downloaded microsoft site among notable changes featured new ties windows live online services new icons welcome center minor updates aero appearance slightly bluish tint glass effect big speed improvements including setup speed many bug fixes tweaked anti-aliasing flip 3d feature released publicly august 29 2006 release candidate 1 rc1 built august 29 2006 build number 5600.16384 released select group beta testers september 1 2006 september 6 rc1 released msdn technet subscribers well registered customer preview program cpp members beta 2 pid september 14 microsoft re-opened cpp new members cpp ended november 26 2006 public release release candidate 1 resulted number extensive reviews analyses various technology news web sites immediately release weeks following ars technica ken fisher wrote performance improved significantly beta 2 suggesting faster machines may perform better windows xp also criticised usefulness windows sidebar continued intrusiveness user account control crn review noted five specific categories improvements release candidate 1 installation speed device driver support performance improvements several components security multimedia capabilities criticism vista user interface arose well chris pirillo describing near-final state sloppy build 5700 build date august 10 2006 first build rtm branch shown student day presentation microsoft tech-ed 2006 australia appeared run faster previous pre-rc1 build 5472 ui improvements higher build number necessarily indicate newer build microsoft began work rtm branch time wrapping rc1 branch allowing mainstream rc1 developers easily flow new development stage parallel development helps explain build 5700 older even pre-rc1 builds build 5728 build date september 17 2006 released september 22 2006 technical beta participants following day microsoft released 32-bit version build public 64-bit version arriving september 25 october 1 microsoft reached goals program participation longer offered build public response significant amount feedback rc1 testers 5728 contained many improvements one inclusion check box sound properties allowed user disable windows vista startup sound welcome center also improved new icons eliminating use one icon several different items old icons user folder replaced build microsoft neared goal vista installing 15 minutes reviewers reporting 5728 took little 16 minutes clean install however performing upgrade installation windows xp still slow sometimes taking hour complete release candidate 2 rc2 built october 3 2006 build number 5744.16384 released cpp members tap testers msdn/technet subscribers technical beta testers friday october 6 2006 available download october 9 aggressive development schedule final build would officially released general public testing nevertheless pre-release product keys work final rtm build several testers reported rc2 faster stable build 5728 however rc2 regular interim build major milestone name suggests rigorously tested rc1 rc1 may stable certain situations build fixed many compatibility issues plagued previous builds vista gui continued improved contained minor tweaks one prominent new ability customize color transparency maximized windows previous builds windows became predominantly black maximized effect could altered users control panel icon windows sideshow also added release manufacturing rtm build final version code shipped retailers distributors purpose pre-rtm build eliminate last show-stopper bugs may prevent code responsibly shipped customers well anything else consumers may find annoying thus unlikely major new features introduced instead work focus vista fit-and-finish days developers managed drop vista bug count 2470 september 22 1400 time rc2 shipped early october however still way go vista ready rtm microsoft internal processes required vista bug count drop 500 fewer product could go escrow rtm builds 32-bit versions released build 5808 build date october 12 2006 released tap testers october 19 2006 build notable first build released testers since microsoft entered rtm escrow build 5800 explains build numbers jumped 57xx 58xx build 5824 build date october 17 2006 released wide number internal testers later day hope build would become final rtm however catastrophic show-stopper bug found destroyed system upgraded windows xp completely reinstalling windows would fix computer build 5840 build date october 18 2006 made available internal testers according paul thurrott build contain major bug build 5824 testing produced positive feedback build contained large number new final icons well new set final wallpapers including new default wallpaper based aurora swoosh seen prior builds also last build feature windows xp sound scheme release manufacturing rtm built november 1 2006 build number 6000.16386 version windows vista ships customers microsoft announced build finalized november 8 2006 five years development rtm build number jumped 6000 reflect vista internal version number nt 6.0 jumping rtm build numbers common practice among consumer-oriented windows versions like windows 98 build 1998 windows 98 se build 2222 windows b.3000 windows xp b.2600 compared business-oriented versions like windows 2000 b.2195 server 2003 b.3790 november 16 2006 microsoft made final build available msdn technet plus subscribers business-oriented enterprise edition made available volume license customers november 30 windows vista launched general customer availability january 30 2007 service pack 1 beta released microsoft connect selected testers september 24 2007 build offered optionally windows update registry key installed tester key later leaked net resulting deactivation microsoft release build number vista jumped 6001.16659.070916-1443 build also removed group policy management console gpmc client computers replaced downloadable version later date also removed search menu option right hand bar start menu including option re-add start menu customization list build broke hp touch smart family applications also caused bugs resuming sleep cases rendered 64-bit pcs trusted platform module tpm chips unable finish booting build also contained unspecified improvements speed responsiveness os service pack 1 release candidate preview released microsoft connect selected testers november 12 2007 release build number vista increased 6001.17042.071107.1618 changes build covered microsoft connect non-disclosure agreement nda service pack 1 release candidate first released microsoft connect testers december 4 2007 build released msdn technet several weeks later days build released public officially microsoft download center public preview sp1 release build number vista increased 6001.17052.071129.2315 build contained number notable changes enhancements service pack 1 release candidate refresh released microsoft connect selected testers january 9 2008 released public january 11 2008 release build number 6001.17128.080101.1935 service pack 1 release candidate refresh 2 released microsoft connect selected testers january 24 2008- windows update release build number 6001.18000 details build covered microsoft connect non-disclosure agreement nda service pack 1 released manufacturing monday february 4 2008 final build service pack 1 went live tuesday march 18 2008 microsoft download center windows update build confirmed sources microsoft exactly code rc refresh 2 also giving exactly build number full build string release refresh 2 6001.18000.longhorn_rtm.080118-1840 build 6001.18063 release date june 24 2008 microsoft released kb952709 reliability performance update windows vista build notable two reasons first first publicly released update increases vista build number beyond 6001.18000 final build service pack 1 second build replaces 6001 longhorn _rtm.080118-1840 build string sp1 6001. vistasp1 _gdr.080425-1930 longhorn build string present early development vista seen official release build update reintroduced sp1 beta left sp1 released build marks removal release version vista contain longhorn codename prominent manner microsoft started work service pack 2 soon service pack 1 released windows server 2008 uses codebase windows vista service pack 1 service pack 2 first service pack released windows server 2008 windows vista simultaneously sharing binary windows vista service pack 2 pre-beta build number 6002.16489.lh_sp2beta.080924-1740 version 105 released october 2008 windows vista service pack 2 beta build number 6002.16497.081017-1605 version 113 released december 4 2008 download became available microsoft download center windows vista service pack 2 rc escrow build number 6002.16659.090114-1728 version 275 released january 2009 windows vista service pack 2 release candidate build number 6002.16670.090130-1715 version 286 released february 2009 windows vista service pack 2 rtm escrow build connect beta testers build number 6002.17043.090312-1835 version released march 2009 available installed via windows update windows vista service pack 2 rtm escrow build number 6002.17506.090313-1730 version released march 2009 leak file sharing websites windows vista service pack 2 rtm build number 6002.18005.090410-1830 released 28 april 2009 officially released microsoft via windows update 26 may 2009 – find build revision number windows vista windows server 2008 installed | [
8576,
641,
5251,
3463,
651,
6797,
8080,
3857,
8976,
10896,
2196,
11283,
4505,
9505,
4130,
4515,
11301,
3496,
1577,
6441,
6697,
2221,
3250,
3890,
9983,
1077,
9910,
6972,
6462,
7615,
3648,
321,
7106,
1348,
582,
8391,
6088,
1098,
3916,
3533,... | Validation |
1,582 | 4 | Molecular_marker:molecular marker molecular marker molecule contained within sample taken organism biological markers matter used reveal certain characteristics respective source dna example molecular marker containing information genetic disorders genealogy evolutionary history life specific regions dna genetic markers used diagnosing autosomal recessive genetic disorder cystic fibrosis taxonomic affinity phylogenetics identity dna barcoding life forms known shed unique chemicals including dna environment evidence presence particular location biological markers like proteins used diagnostic tests complex neurodegenerative disorders alzheimer disease non-biological molecular markers also used example environmental studies genetics molecular marker identified genetic marker fragment dna associated certain location within genome molecular markers used molecular biology biotechnology identify particular sequence dna pool unknown dna many types genetic markers particular limitations strengths within genetic markers three different categories first generation markers second generation markers new generation markers types markers may also identify dominance co-dominance within genome identifying dominance co-dominance marker may help identify heterozygotes homozygotes within organism co-dominant markers beneficial identify one allele thus enabling someone follow particular trait mapping techniques markers allow amplification particular sequence within genome comparison analysis molecular markers effective identify abundance genetic linkage identifiable locations within chromosome able repeated verification identify small changes within mapping population enabling distinction mapping species allowing segregation traits identity identify particular locations chromosome allowing physical maps created lastly identify many alleles organism particular trait bi allelic poly allelic genomic markers mentioned particular strengths weakness consideration knowledge markers necessary use instance rapd marker dominant identifying one band distinction may sensitive reproducible results typically due conditions produced rapd used also assumption two samples share locus sample produced different markers may also require different amounts dna rapd may need 0.02ug dna rflp marker may require 10ug dna extracted produce identifiable results currently snp markers turned potential tool breeding programs several crops molecular mapping aids identifying location particular markers within genome two types maps may created analysis genetic material first physical map helps identify location chromosome well chromosome secondly linkage map identifies particular genes linked genes chromosome linkage map may identify distances genes using cm centimorgans unit measurement co-dominant markers used mapping identify particular locations within genome represent differences phenotype linkage markers help identify particular polymorphisms within genome polymorphisms indicate slight changes within genome may present nucleotide substitutions rearrangement sequence developing map beneficial identify several polymorphic distinctions two species well identify similar sequence two species using molecular markers study genetics particular crop must remembered markers restrictions first assessed genetic variability within organism studied analyze identifiable particular genomic sequence near candidate genes maps created determine distances genes differentiation species genetic markers aid development new novel traits put mass production novel traits identified using molecular markers maps particular traits color may controlled genes qualitative traits requires less 2 genes color identified using mas marker assisted selection desired marker found able followed within different filial generations identifiable marker may help follow particular traits interest crossing different genus species hopes transferring particular traits offspring one example using molecular markers identifying particular trait within plant fusarium head blight wheat fusarium head blight devastating disease cereal crops certain varieties offspring varieties may resistant disease resistance inferred particular gene followed using mas marker assisted selection qtl quantitative trait loci qtl identify particular variants within phenotypes traits typically identify goi gene interest located cross made sampling offspring may taken evaluated determine offspring inherited traits offspring type selection becoming beneficial breeders farmers reducing amount pesticides fungicides insecticides another way insert goi mechanical bacterial transmission difficult may save time money 5 applications fisheries aquaculture biochemical markers generally protein marker based change sequence amino acids protein molecule important protein marker alloenzyme alloenzymes variant forms enzyme coded different alleles locus alloenzymes differs species species detecting variation alloenzymes used markers type-i markers advantages disadvantages applications | [
7726
] | Test |
1,583 | 8 | Mod_gzip:mod gzip mod_gzip external extension module apache http server v1 v2 allows using gzip compression method significant reduction volume web page content served http protocol mod_gzip compiled apache either static dynamic module possible check server see sending compressed data compression compatibility browser example textual content compressed using mod_gzip maintain mime-type according recommended media type one earliest apache 1.3 versions introduced internal function regular expression evaluation function used mod_gzip evaluating filter rules therefore mod_gzip would work together apache 1.2.x earlier versions compatibility apache 1.3.x mod_gzip 1.3.y granted general apache 1.3 api n't change mod_gzip would even work together old apache 1.3 versions mod_deflate module similar mod_gzip usable apache v2 early versions mod_deflate provided lesser amount compression mod_gzip starting apache 2.0.45 compression level mod_deflate configurable using deflatecompressionlevel directive difference disappeared mod_gz module independently developed ian holsman module implements gzip compression filter apache 2.0 providing similar functionality mod_gzip one important difference two modules mod_gzip includes gzip implementation whereas mod_gz relies external zlib library php similar effect achievable output php scripts cherrypy offers gzip filter uses zlib module python standard library mod_gzip module licensed apache license module level content compression apache started mod_gzip written kevin kiley konstantin balashow autumn 2000 documented michael schröpl published remote communications inc. rci rci purchased hyperspace communications rci released code public domain developers apache 2.0.x servers included mod_deflate module codebase server perform similar gzip-encoding function mod_gzip remained external extension module | [
865,
8644,
234,
4561,
11668
] | Train |
1,584 | 3 | Native_POSIX_Thread_Library:native posix thread library native posix thread library nptl implementation posix threads specification linux operating system 2.6 version linux kernel processes schedulable entities special facilities threads however system call — clone — creates copy calling process copy shares address space caller linuxthreads project used system call provide kernel-level threads previous thread implementations linux worked entirely userland unfortunately partially complied posix particularly areas signal handling scheduling inter-process synchronization primitives improve upon linuxthreads clear kernel support new threading library would required two competing projects started address requirement ngpt next generation posix threads worked team included developers ibm nptl developers red hat ngpt team collaborated closely nptl team combined best features implementations nptl ngpt project subsequently abandoned mid-2003 merging best features nptl nptl first released red hat linux 9 old-style linux posix threading known trouble threads refuse yield system occasionally take opportunity preempt arises something windows known better time red hat claimed nptl fixed problem article java website java red hat linux 9 nptl part red hat enterprise linux since version 3 linux kernel since version 2.6 fully integrated part gnu c library exists tracing tool nptl called posix thread trace tool ptt open posix test suite opts written testing nptl library posix standard nptl uses similar approach linuxthreads primary abstraction known kernel still process new threads created clone system call called nptl library however nptl requires specialized kernel support implement example contended case synchronisation primitives might require threads sleep wake primitive used known futex nptl so-called 1×1 threads library threads created user via codice_1 library function 1-1 correspondence schedulable entities kernel tasks linux case simplest possible threading implementation alternative nptl 1×1 model | [
7938,
7812,
8326,
4360,
9353,
4493,
2195,
5267,
1813,
11155,
10780,
1694,
3618,
4011,
5677,
9646,
823,
9660,
10817,
5067,
8147,
8928,
1761,
4841,
9455,
2804,
3323,
11135
] | Test |
1,585 | 4 | Blacker_(security):blacker security blacker styled blacker u.s. department defense computer network security project designed achieve a1 class ratings trusted computer system evaluation criteria tcsec project implemented sdc burroughs first secure system trusted end-to-end encryption united states defense data network | [
10170,
939,
4067
] | None |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.