node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
1,385 | 3 | Compaq_Presario_M2000:compaq presario m2000 many models compaq presario m2000 ran intel celeron processor although also made amd turion 64 amd mobile sempron processors hard drive 40 gb 5400 rpm br display 15 glare type lcd br processor intel celeron 1.4 ghz amd turion ml-28 1.6ghz amd sempron br os provided windows xp home edition standard br memory expandable 1024mb ram br jacks inputs special buttons notifications connectivity security kensington lock slot | [
4736
] | Test |
1,386 | 3 | PowerPC_e5500:powerpc e5500 powerpc e5500 64-bit power isa-based microprocessor core freescale semiconductor core implements core power isa v.2.06 hypervisor support altivec four issue seven-stage out-of-order pipeline double precision fpu three integer units 32/32 kb data instruction l1 caches 512 kb private l2 cache per core 2 mb shared l3 cache speeds range 2.5 ghz core designed highly configurable via corenet fabric meet specific needs embedded applications features like multi-core operation interface auxiliary application processing units apu e5500 based e500mc core adds new instructions introduced power isa 2.06 specification namely byte- bit-level acceleration parity population count bit permute compare byte fpu taken straight powerpc e600 core classic fully pipelined dual precision ieee 754 unit running full core speed supports conversion 64-bit floats integers effectively twice fast fpu e500mc e5500 also introduces enhanced branch prediction unit 8-entry link stack e5500 core first 64-bit power isa core designed solely freescale introduced freescale technology forum june 2010 simulated models available july 2010 hard samples late 2010 full scale manufacturing second half 2011 freescale used e700 ng-64 monikers refer similarly speced core since 2004 product e5500 powers high-performance qoriq p5 system chip soc family share common naming scheme p50x0 bae systems built radiation hardened computer based e5500 core devices space | [
5097,
2719,
3348,
4661,
3936,
1075,
1346,
4847,
4479,
2458,
3440,
5100,
1454,
1083,
4408,
5652,
912,
5737,
7361,
2845,
3708,
7905,
7990,
5665,
6111,
4702,
1199,
1388,
7654,
7099,
2133,
234,
2501,
239,
6474,
2781,
8125,
4815,
2785,
7327,
... | Test |
1,387 | 3 | Fruity_Frank:fruity frank fruity frank 1984 computer game amstrad cpc msx home computers produced kuma software authored steve wallis graphics brother sean wallis gameplay similar mr though story involves frank protecting garden invading monsters player collect fruits lying around garden avoiding touching monsters apples pushed kill offer temporary respite monsters also killed throwing bouncing apple pip pieces fruit collected player proceeds next level level identifiable different colour background new jocular tune music game inspired traditional english songs rhymes fruity frank four types enemies every 1 000 points frank gains extra life maximum two 100 000 points reached counter set back 0 | [
7944
] | Test |
1,388 | 3 | Power_Processing_Element:power processing element power processing unit ppu 64-bit dual-threaded in-order powerpc 2.02 microprocessor core designed ibm use primarily game consoles playstation 3 xbox 360 also found applications high performance computing supercomputers record setting ibm roadrunner instances ppu joined 512 kb l2 cache form called power processing element ppe ppu used main cpu core three different processor designs ppu in-order processor unique traits allow achieve benefits out-of-order execution without expensive re-ordering hardware upon reaching l1 cache miss execute past cache miss stopping instruction actually dependent load send 8 load instructions l2 cache out-of-order instruction delay pipe side path allows execute instructions would normally cause pipeline stalls without holding rest pipeline instruction delay pipeline used out-of-order load/stores cache misses put moves ppe 23 stage general pipeline additional 11 stages possible microcode additional 4 stages possible branch prediction ppu runs two hardware threads simultaneously main registers code execution duplicated exception interrupt-handling registers several essential arrays queues generate exceptions simultaneously perform branch prediction individual branch histories execution engine caches duplicated though still single-core design 64-bit double precision floating-point unit 128-bit vmx unit using altivec instruction set perform theoretical 12 floating-point operations per cycle floating-point unit floating-point multiply-adds come smaller 64-bits gives 3.2 billion clock cycles 12 38.4 billion floating-point operations/second ppu enhanced powerxcell 8i processor able make single cycle double precision floating point operations tailored high performance computing supercomputers vmx unit xcpu xbox 360 enhanced 128 registers entirely compatible regular altivec | [
6597,
450,
7327,
2719,
3348,
3936,
1075,
1346,
4847,
2458,
1083,
7442,
4408,
5652,
912,
5737,
7361,
2845,
3708,
5042,
7453,
4242,
5665,
1199,
1386,
7099,
1023,
2139,
4718,
2501,
239,
6474,
602,
763,
515,
2601,
2873,
4815,
8125,
1131,
62... | Test |
1,389 | 9 | Dc_(computer_program):dc computer program dc desk calculator cross-platform reverse-polish calculator supports arbitrary-precision arithmetic one oldest unix utilities predating even invention c programming language like utilities vintage powerful set features terse syntax traditionally bc calculator program infix notation implemented top dc article provides examples attempt give general flavour language complete list commands syntax one consult man page one specific implementation dc oldest surviving unix language home bell labs received pdp-11 dc—written b—was first language run new computer even assembler multiply four five dc note whitespace optional also get result commands translates push four five onto stack multiplication operator pop two elements stack multiply push result back stack p command used examine print screen top element stack q command quits invoked instance dc note numbers must spaced even operators need arithmetic precision changed command k sets number fractional digits number digits following point used arithmetic operations since default precision zero sequence commands produces 0 result adjusting precision k arbitrary number decimal places produced command sequence outputs '.66666 evaluate formula_1 v computes square root top stack used input negative number swap top two elements stack use r command duplicate top element use 'd command read line stdin use command evaluate line dc command necessary syntactically correct potentially security problem since dc command allow arbitrary command execution mentioned p print top stack newline n pop top stack output without trailing newline f dump entire stack one entry per line dc also supports arbitrary input output radices command pop top stack use input base hex digits must upper case avoid collisions dc commands limited a-f input radix larger 16 command output base keep mind input base affect parsing every numeric value afterwards usually advisable set output base first read values k commands push current precision input radix output radix top stack example convert hex binary addition basic arithmetic stack operations dc includes support macros conditionals storing results later retrieval mechanism underlying macros conditionals register dc storage location single character name stored retrieved 'sc pops top stack stores register c 'lc pushes value register c onto stack example registers also treated secondary stacks values pushed popped main stack using l commands string values enclosed characters may pushed stack stored registers command convert low order byte numeric value ascii character top stack string replace first character string ways build strings perform string manipulation executing x command printing p command character begins comment end line macros implemented allowing registers stack entries strings well numbers string printed also executed i.e processed sequence dc commands instance store macro add one multiply 2 register using x command executes top stack use like finally use macro mechanism provide conditionals command '=r pop two values stack execute macro stored register r equal print string 'equal top stack equal 5 conditionals execute specified macro top two values stack greater less equal greater less greater equal less equals respectively looping possible defining macro conditionally reinvokes simple factorial top stack might implemented '1q command exit macro allowing early return q quit two levels macros dc less two levels call stack z push current stack depth z operation print prime numbers example relatively simple program dc command 1 line convert distances metres feet inches bulk concerned prompting input printing output suitable format looping round convert another number example implementation euclidean algorithm find greatest common divisor|gcd category cross-platform software category unix software category software calculators category free mathematics software category numerical programming languages category stack-oriented programming languages | [
361,
6789,
2817,
1537,
5480,
3106,
578,
923,
5138,
667,
5946,
2589,
5503,
6470,
4447,
3915,
3417,
6404,
4283,
1435,
4020
] | Train |
1,390 | 1 | Cdb_(software):cdb software cdb short constant database refers library data format created daniel j. bernstein cdb acts on-disk associative array mapping keys values allows multiple values stored single key constant database allows two operations creation reading operations designed fast highly reliable since database change use multiple processes access single database without locking additionally since modifications actually creation replacement database take advantage unix filesystem semantics provide guarantee reliability record positions key value lengths hash values 32-bit quantities stored 4 bytes thus cdb must fit 4 gigabytes cdb used djbdns fastforward mess822 qmail ucspi-tcp provide highly efficient reliable simple data access database contains entire data set e.g single associative array single computer file consists three parts fixed-size header data set hash tables lookups designed exact keys though types searches could performed scanning entire database lookups performed using following algorithm lookups keys multiple values additional values may found simply resuming search next slot numbers—offsets lengths hash values—are unsigned 32-bit integers stored little endian format keys data considered opaque byte strings special treatment fixed-size header beginning database describes 256 hash tables listing position within file length slots data stored series records storing key length data length key data alignment sorting rules records followed set 256 hash tables varying lengths since zero valid length may fewer 256 hash tables physically stored database nonetheless considered 256 tables hash tables contain series slots contains hash value record offset empty slots offset zero hashes unsigned 32 bit integers start value 5381 byte key current hash multiplied 33 xor'ed current byte key overflow bits discarded slots tables trivially computed hashes target table simply lowest eight bits hash i.e hash modulo 256 slot within table remaining bits hash modulo table length i.e hash divided 256 modulo table length official cdb library code public domain individual source files marked also available public domain djbdns package however rest cdb package used license-free software meaning must distributed verbatim unusual licensing simplicity format prompted others re-implement library release common terms michael tokarev tinycdb library available public domain 2009 cdb put public domain notably creator cdb intend cdb used shared library differs virtually similar databases berkeley db | [
1710,
1989,
2054,
1105,
3818
] | Test |
1,391 | 3 | Disk_mirroring:disk mirroring data storage disk mirroring replication logical disk volumes onto separate physical hard disks real time ensure continuous availability commonly used raid 1 mirrored volume complete logical representation separate volume copies disaster recovery context mirroring data long distance referred storage replication depending technologies used replication performed synchronously asynchronously semi-synchronously point-in-time replication enabled via microcode disk array controller via server software typically proprietary solution compatible various data storage device vendors mirroring typically synchronous synchronous writing typically achieves recovery point objective rpo zero lost data asynchronous replication achieve rpo seconds remaining methodologies provide rpo minutes perhaps several hours disk mirroring differs file shadowing operates file level disk snapshots data images never re-synced origins recognized disks inherently unreliable component computer systems mirroring technique allow system automatically maintain multiple copies dual backup meaning data redundant hard drives exist mirror data event disk hardware failure system continue process quickly recover data mirroring may done locally specifically cater disk unreliability may done remotely forms part sophisticated disaster recovery scheme may done locally remotely especially high availability systems normally data mirrored onto physically identical drives though process applied logical drives underlying physical format hidden mirroring process typically mirroring provided either hardware solutions disk arrays software within operating system linux mdadm device mapper additionally file systems like btrfs zfs provide integrated data mirroring additional benefits btrfs zfs maintain data metadata integrity checksums making capable detecting bad copies blocks using mirrored data pull data correct blocks several scenarios happens disk fails hot swap system event disk failure system typically diagnoses disk failure signals failure sophisticated systems may automatically activate hot standby disk use remaining active disk copy live data onto disk alternatively new disk installed data copied less sophisticated systems system operated remaining disk spare disk installed copying data one side mirror pair another called rebuilding less commonly resilvering mirroring performed site site either rapid data links example fibre optic links distances 500 maintain adequate performance support real-time mirroring longer distances slower links maintain mirrors using asynchronous copying system remote disaster recovery systems mirroring may done integrated systems simply additional applications master slave machines addition providing additional copy data purpose redundancy case hardware failure disk mirroring allow disk accessed separately reading purposes certain circumstances significantly improve performance system choose read disk seek quickly required data especially significant several tasks competing data disk thrashing switching tasks takes time task reduced important consideration hardware configurations frequently access data disk implementations mirrored disk split used data backup allowing first disk remain active however merging two disks may require synchronization period write i/o activity occurred mirrored disk mirroring schemes employ three disks two disks redundancy mirroring third split performing backups emc nomenclature third disks called business continuance volumes bcvs | [
980,
5012,
1254,
7242,
6892,
2390,
7822,
6117,
1394,
5760,
6748,
3134,
2776,
5447,
1315,
6586,
4554,
4199,
6860,
1703,
2442,
6505
] | Test |
1,392 | 8 | Apache_Karaf:apache karaf apache karaf modular open source osgi release 6 runtime environment project became top level project 2010 previously subproject apache servicemix apache karaf work top two used osgi frameworks apache felix equinox osgi providing additional features karaf container modern polymorphic container lightweight powerful enterprise ready container powered osgi polymorphic means karaf host kind applications osgi spring war much karaf use standalone container bootstrap way using karaf boot karaf cellar clustering solution karaf allows manage multiple instances synchronization instances latest release 4.1.3 february 25 2019 karaf cave implementation osgi repository specification used karaf features resolver provide resources dealing requirements capabilities artifacts latest release 4.1.2 january 19 2019 decanter provides ready use monitoring solution including alerting key feature bam business activities monitoring also completely extensible customizable latest release 2.2.0 march 22 2019 | [
5369,
4303,
5728,
1834,
7896,
26,
7544,
4701,
6821,
5054,
5408,
417,
5075,
6137,
1511,
4742,
7952,
7238,
5820,
2646,
2291,
6536,
7988,
840,
3031,
5863,
3408,
5874,
1602,
894,
5206,
5214,
6270,
2741,
917,
5571,
3463,
1286,
3479,
3135,
16... | Test |
1,393 | 4 | Riskware:riskware riskware portmanteau risk software word used describe software whose installation execution poses possible yet definite risk host computer relatively normal programs often fall category riskware applications modified another purpose used computer user owner | [
3859,
3042
] | Test |
1,394 | 2 | Bioctl:bioctl bio 4 pseudo-device driver bioctl 8 utility implement generic raid volume management interface openbsd netbsd idea behind software similar ifconfig single utility operating system used control raid controller using generic interface instead rely plentiful proprietary custom raid management utilities specific given hardware raid manufacturer features include monitoring health status arrays controlling identification blinking leds managing sound alarms specifying hot spare disks additionally codice_1 configuration openbsd delegated bioctl well whereas initial creation volumes configuration hardware raid left card bios non-essential operating system already booted interfacing kernel userland performed codice_2 system call codice_3 pseudo-device bio/bioctl subsystem deemed important part openbsd advocacy open hardware documentation 3.8 release title titular song dedicated topic — hackers lost raid development took place time controversy adaptec refused release appropriate hardware documentation necessary order make aac 4 driver work reliably followed openbsd disabling support driver commentary 3.8 release developers express irony hardware raid controllers supposed purpose providing reliability redundancy repair whereas reality many vendors expect system administrators install depend huge binary blobs order assess volume health service disk arrays specifically openbsd making reference modus operandi freebsd documentation aac 4 driver adaptec specifically suggests enabling linux compatibility layer order use management utilities documentation even fails explain exactly utilities must obtained versions would compatible evidently proprietary tools may expired likewise openbsd developers intentionally chose concentrate supporting basic features controller uniform across brands variations specifically fact initial configuration controller must still made card bios never kept secret bio/bioctl announcement contrasted approach taken freebsd example individual utilities exist several independent raid drivers interface utility independent one another specifically freebsd includes separate device-specific utilities called codice_4 codice_5 codice_6/codice_7 codice_8 provides many options least subtle differences interface configuration management controllers contributes code bloat mention additional drivers tool even exists open-source software openbsd 6.4 2018 dozen drivers register bio framework monitoring state logical drive also duplicated hardware monitoring frameworks corresponding utilities systems bioctl available — hw.sensors sensorsd openbsd sysmon envsys envstat powerd netbsd example openbsd since 4.2 release status drive sensors could automatically monitored simply starting sensorsd without specific configuration required drivers converted use bio sensors frameworks release openbsd scsi enclosure services ses saf-te supported since openbsd 3.8 2005 well feature led blinking bio bioctl implementing codice_10 ioctl helping system administrators identify devices within enclosures service additionally ses saf-te drivers openbsd feature support combination temperature fan sensors psu doorlock alarm indicators auxiliary sensor data exported hw.sensors framework openbsd monitored familiar tools like sysctl snmp sensorsd netbsd older ses/saf-te driver nasa 2000 still place integrated bio envsys device files unique ioctl interface featuring custom scsi-specific userland tooling older implementation also available openbsd 2000 2005 removed 2005 together userland tools new leaner bio- hw.sensors-based alternative drivers introduced ses saf-te kept two separate drivers openbsd n't require separate custom userland utilities anymore reducing code bloat number source lines code | [
885,
6414,
1254,
2001,
2453,
6972,
191,
5373,
7822,
732,
5571,
6630,
8194,
2219,
1572,
1391,
6743,
6211,
6748,
7752,
3134,
5447,
3572,
1315,
4990,
1133,
5518,
2883,
1052,
6242,
1697,
6149,
1793,
8037,
4199,
1703,
1245,
2442,
1435,
6505
] | Validation |
1,395 | 4 | VirusTotal:virustotal virustotal website created spanish security company hispasec sistemas launched june 2004 acquired google inc. september 2012 company ownership switched january 2018 chronicle subsidiary alphabet inc.. virustotal aggregates many antivirus products online scan engines check viruses user antivirus may missed verify false positives files 550 mb uploaded website sent via email anti-virus software vendors receive copies files flagged scans passed engine help improve software extension virustotal capability users also scan suspect urls search virustotal dataset virustotal dynamic analysis malware uses cuckoo sandbox virustotal selected pc world one best 100 products 2007 virustotal windows uploader application integrates explorer right-click contextual menu listed send virus total application also launches manually submitting url program currently running os virustotal stores name various hashes scanned file already scanned files identified known e.g. vt default sha256 hash without uploading complete files sha256 query url form codice_1 file uploads normally limited 128 mb 2017 virustotal discontinued support windows uploader several browser extensions available vtzilla mozilla firefox vtchromizer google chrome vtexplorer internet explorer allow user download files directly virustotal web application prior storing computer well scanning urls service also offers android app employs public api search installed application virustotal previously scanned ones show status application previously scanned submitted api key must provided restrictions public api usage may apply see public api virustotal provides free service public api allows automation online features upload scan files submit scan urls access finished scan reports make automatic comments urls samples restrictions apply requests made public api requiring individual api key freely obtained online signing low priority scan queue limited number requests per time frame etc antivirus engines used detection uploading files. ref name= files/url /ref antivirus scanning engines used url scanning utilities used provide additional info uploaded files files uploaded virustotal may shared freely anti-malware companies also retained store virustotal page states virustotal confidentiality files urls sent virustotal shared antivirus vendors security companies help improving services products believe eventually lead safer internet better end-user protection default file/url submitted virustotal detected least one scanner freely sent scanners detect resource additionally files urls enter private store may accessed premium mainly security/antimalware companies/organizations virustotal users improve security products services | [
2086,
5452,
91,
4115,
5807,
7425,
7617,
7522,
3357,
3096,
5914,
7809,
3859,
385,
910,
6006,
4235,
4689,
2842,
124,
3111,
5401,
496,
6644,
5144,
3123,
142,
935,
3561,
5949,
5066,
5601,
518,
6305,
1500,
3495,
5700,
6776,
6777,
2167,
88
] | Validation |
1,396 | 7 | Open_Source_Cluster_Application_Resources:open source cluster application resources open source cluster application resources oscar linux-based software installation high-performance cluster computing oscar allows users install beowulf type high performance computing cluster | [
2159
] | Validation |
1,397 | 4 | Code42:code42 code42 american software company develops markets crashplan backup software services suite code42 started project create facebook-like desktop application ended focusing online storage element released crashplan 2007 company raised 52.5 million 2012 consumers use crashplan small business plan requires monthly subscription backup cloud plans larger enterprises also available crashplan initially got positive reviews pricing feature-set user interface large initial backups reported slow august 2017 original home plans discontinued business-focused plans remaining options code42 founded consulting company 2001 matthew dornquast brian bispala mitch coopet company name honors douglas adams authored hitchhiker ’ guide galaxy died year book number 42 answer ultimate question life universe everything code42 first projects included redesign sun country airlines ’ website 2002 project retailer target corporation ticket booking engine midwest airlines income services business used fund product ideas six years 2006 company planned create facebook-like desktop application project became large impractical code42 focused online storage element application creating crashplan 2007 june 2011 code42 acquired minneapolis-based mobile development company recursive awesome llc support software mobile devices recursive ’ employees moved minneapolis headquarters later 10,000 square-foot expansion offices built 2012 code42 raised 52.5 million funding funding first distribution 100 million pool established 2011 accel partners fund big data companies mid 2015 former eloqua ceo joe payne succeeded co-founder matthew dornquast ceo company raised additional 85 million funding october 2015 august 22 2017 code42 announced shutting crashplan home october 2018 accepting new subscriptions would maintain existing subscriptions end existing subscription period point backups would purged old home plans replaced former pro plans business-focused although still possible use private purposes backups friends/family supported new product company explained shift business strategy focus exclusively enterprise small business segments two great options continue getting best backup solution. code42 ranked leader backup software recent g2 crowd backup survey summer 2017 april 2011 80 code42 software ’ revenue comes business customers remainder comes consumers small portion service provider partners code42 profitable year since founded grew 1.4 million revenue 2008 11.46 million 2010 18.5 million 2011 2012 company backed 100 petabytes data processed 100 billion files day code42 best known developing marketing crashplan data backup service crashplan backs data remote servers hard drives backup computers longer supported available mac windows linux also crashplan pro proe mobile apps accessing backed-up data ios android windows devices initial backups may take several hours via lan days internet depending amount data bandwidth available afterwards continuous incremental backups conducted without user intervention used paid option seed loading hard drive sent user faster local backup could performed drive could shipped back code42 initial backup however seeded backup service longer available around beginning 2016 neither corresponding restore-to-door service would allow hard drive containing extensive restore data backups shipped back user faster over-the-internet download data encrypted password-protected stored proprietary format also option secure private key corporate users crashplan proe back private servers instead code42 data centers four five cases software option create private on-site backup server code42 used develop market file sharing service called shareplan released october 2013 according star tribune competed dropbox shareplan used pin access files track users october 2014 revision software added features regulatory compliance like sarbanes-oxley options private public hybrid cloud deployment single login crashplan using feature called code42 edge platform improved december 2014 two-factor authentication features shareplan discontinued august 2015 22 august 2017 code42 stopped offering new subscriptions consumers focusing business plans code42 also stopped renewals existing customers comparative review published wall street journal geoffrey fowler observed crashplan favorite four services evaluated observed lacked fine print whereas services charged additional fees basic features n't really unlimited pc magazine gave crashplan 4.5 5 stars awarded editor choice review praised user interface local backup options security features said mobile explorer-based features limited product review macworld gave crashplan rating 4.5 5 gartner gave enterprise version crashplan proe excellent rating techworld praised crashplan operating system support configuration options ars technica said crashplan better features pricing options competitors | [
6289,
4759,
578
] | Test |
1,398 | 9 | Stan_(software):stan software stan probabilistic programming language statistical inference written c++ stan language used specify bayesian statistical model imperative program calculating log probability density function stan licensed new bsd license stan named honour stanislaw ulam pioneer monte carlo method stan created andrew gelman bob carpenter development team consisting 34 members stan accessed several interfaces stan implements gradient-based markov chain monte carlo mcmc algorithms bayesian inference stochastic gradient-based variational bayesian methods approximate bayesian inference gradient-based optimization penalized maximum likelihood estimation stan implements reverse-mode automatic differentiation calculate gradients model required hmc nuts l-bfgs bfgs variational inference automatic differentiation within stan used outside probabilistic programming language stan used fields including social science pharmaceutical statistics market research medical imaging | [
3606,
2820,
1626,
4759,
5548,
1731,
5288,
5117,
5571,
4872,
4705,
4067,
3981,
3388,
4070,
3807,
7848,
6934,
1879,
7579,
3410,
6489,
256,
3915
] | Test |
1,399 | 2 | CopperheadOS:copperheados copperheados source-available operating system smartphones tablet computers based android mobile platform adds privacy security features official releases android open source project google goal upstreaming back android linux openbsd august 2016 copperheados announced future versions operating system based android nougat 7.x would released no-commercial-usage license funding could acquired march 2017 support pixel pixel xl devices launched offer buy devices copperheados preinstalled june 11th 2018 daniel micay main developer copperheados then-chief technology officer 50 stakeholder company announced publicly cut company e-mail sent james donaldson order turn access subreddit micay twitter account mr. donaldson representing company let micay know micay would receive pay signed employment agreement twitter micay wrote mr. donaldson attempting seize micay personal gpg key also used secure key parts copperhead project micay reportedly deleted signing keys required release updates copperheados following list devices supported copperheados past following devices supported | [
3933,
5372,
6427,
1095,
2564,
5386,
5391,
740,
4340,
42,
3310,
5062,
2591,
5068,
5771,
2240,
5775,
424,
5794,
6158,
7956,
5473,
4400,
474,
6183,
822,
2300,
5486,
136,
6209,
3039,
1582,
6937,
5872,
6232,
4116,
5195,
2003,
3081,
195,
6978... | Test |
1,400 | 9 | LINC_4GL:linc 4gl linc logic information network compiler fourth-generation programming language used mostly unisys computer systems linc originally developed short-cut template two programmers reproduce automate production computer applications different companies similar requirements specifications requirements similar companies followed common generic business model businesses dealt commodities parts suppliers customers named components linc terminology manufactured assembled purchased sold actions termed events linc terminology components events interface specifications ispecs contained database definitions screen designs business rules application system lirc logic information report compiler part linc developed allow programmer produce reports e.g purchase orders invoices credit notes consignment notes bills sale information reports accessed using various user-defined views components events called profiles reports run separate task separate thread execution could also written run background process could put sleep period time woken perform processing put sleep part reason introduction new terminology make system easier programmers isolated lot underlying technology similarly different names intentionally used control structures do.when rather loop look.up determine rather read open close statements generated automatically allowed linc make programmers much efficient application systems produced easier read maintain differentiated simply yet another third generation high level language linc assumption use total reliance facilities available packaged burroughs computer written operating system job control language cobol programming language database management system network definition user terminal etc see also history version 11 character changed linc lirc specifications previously held source-code files held database designed developed using linc 4gl subject rigorous automatic validation new linc-based system specifications stored named linc interactive linc development environment lde extensive reliance terminal screen painting i.e mocking -up crt data-entry screen used assist system definition e.g define component database attributes name length alpha numeric validation rules etc. defining report layouts early 1990s new pc-based tool developing linc specifications released linc development assistant lda lda written mixture smalltalk c++ rather linc 4gl latter intended run personal computer version 17 intended development done lda linc known unisys enterprise application environment eae generate cobol code burroughs sperry mainframes microsoft windows various unix linux platforms also generate gui front-end clients addition compiling generated code deploying databases correspond specification databases supported include burroughs dmsii sperry rdms oracle database microsoft sql server recent update unisys replacing eae unisys agile business suite ab suite ldl language promoted ldl+ new object-oriented features development environment makes use microsoft visual studio ide model driven approach extended uml based class diagram integrated source code solution way round trip update achieved changes business rules result changes uml representation vice versa ab suite 4.0 makes use visual studio 2012 integrates team foundation server 2012 ab suite generates either .net environment clearpath mcp environment ab suite developer write less code traditional c java environment linc originally developed two new zealand computer programmers gil simpson peter hoskins working saudi arabia early 1980s first developed exclusively operation single model burroughs computer system comprising totally integrated system etc linc system created 3rd gl cobol application dmsii database definition ndlii network description wfl job control source code job control statements subsequently run compile elements create integrated system database applications user terminal network burroughs purchased rights sell product 1982 product development retained original inventors early requirement extend product use burroughs mid-range large scale computing platforms burroughs merged sperry corporation form unisys language extended used sperry univac 1100/2200 series machines also subsequently new zealand development centre set christchurch gil simpson develop product ownership later transferred unisys product mainframe computer centre resources transitioned unisys acus australian centre unisys software sydney australia gil simpsons christchurch team went create jade language/database could import run linc code commodity hardware linc supported following platforms development work acus unisys transitioned acus indian outsourcing operation early 2008 eventually product sold 4,000 clients worldwide principally linc fails compete myriad turnkey systems readily available many sources especially ibm cost purchasing customising existing product e.g hogan retail banking system perceived less expensive/risk using linc create scratch entire business system rules weaknesses arise mostly dependence basis burroughs dms cobol differ greatly computing platforms | [
4759,
7715,
6986,
1180,
1743,
7733,
578,
2866,
3990,
1785,
6497
] | Validation |
1,401 | 4 | Let's_Encrypt:let encrypt let encrypt non-profit certificate authority run internet security research group isrg provides x.509 certificates transport layer security tls encryption charge certificate valid 90 days renewal take place time offer accompanied automated process designed overcome manual creation validation signing installation renewal certificates secure websites launched april 12 2016 project claims goal make encrypted connections world wide web servers ubiquitous eliminating payment web server configuration validation email management certificate renewal tasks meant significantly lower complexity setting maintaining tls encryption linux web server execution two commands sufficient set https encryption acquire install certificates end software package included official debian ubuntu software repositories current initiatives major browser developers mozilla google deprecate unencrypted http counting availability let encrypt project acknowledged potential accomplish encrypted connections default case entire web service issues domain-validated certificates since fully automated organization validation extended validation certificates require human validation registrants therefore offered let encrypt transparent possible hope protect trustworthiness guard attacks manipulation attempts purpose regularly publish transparency reports publicly log acme transactions e.g using certificate transparency use open standards free software much possible support acme v2 wildcard certificates added march 2018 let encrypt service provided internet security research group isrg public benefit organization major sponsors electronic frontier foundation eff mozilla foundation ovh cisco systems facebook google chrome internet society partners include certificate authority identrust university michigan u-m stanford law school linux foundation well stephen kent raytheon/bbn technologies alex polvi coreos june 2015 let encrypt announced generation first rsa root certificate isrg root x1 root certificate used sign two intermediate certificates also cross-signed certificate authority identrust one intermediate certificates used sign issued certificates kept offline backup case problems first intermediate certificate identrust certificate preinstalled major web browsers let encrypt certificates normally validated accepted upon installation even browser vendors include isrg root certificate trust anchor let encrypt developers planned generate ecdsa root certificate well later 2015 pushed back early 2016 2019 challenge–response protocol used automate enrolling certificate authority called automated certificate management environment acme involves various requests web server domain covered certificate based whether resulting responses match expectations control enrollee domain assured domain validation order acme client software sets special tls server server system gets queried acme certificate authority server special requests using server name indication domain validation using server name indication dvsni validation processes run multiple times separate network paths checking dns entries provisioned done multiple geographically diverse locations make dns spoofing attacks harder acme interactions based exchanging json documents https connections draft specification available github version submitted internet engineering task force ietf proposal internet standard certificate authority consists piece software called boulder written go implements server side acme protocol published free software source code terms version 2 mozilla public license mpl provides restful api accessed tls-encrypted channel apache-licensed python certificate management program called certbot formerly letsencrypt gets installed client side web server enrollee used order certificate conduct domain validation process install certificate configure https encryption http server later regularly renew certificate installation agreeing user license executing single command enough get valid certificate installed additional options like ocsp stapling http strict transport security hsts also enabled automatic setup initially works apache nginx let encrypt issues certificates valid 90 days reason given certificates limit damage key compromise mis-issuance encourage automation official certbot client third-party clients allow automation certificate renewal several third-party client implementations several languages created community let encrypt project started 2012 two mozilla employees josh aas eric rescorla together peter eckersley electronic frontier foundation j. alex halderman university michigan internet security research group company behind let encrypt incorporated may 2013 let encrypt announced publicly november 18 2014 january 28 2015 acme protocol officially submitted ietf standardisation april 9 2015 isrg linux foundation declared collaboration root intermediate certificates generated beginning june june 16 2015 final launch schedule service announced first certificate expected issued sometime week july 27 2015 followed limited issuance period test security scalability general availability service originally planned begin sometime week september 14 2015 august 7 2015 launch schedule amended provide time ensuring system security stability first certificate issued week september 7 2015 followed general availability week november 16 2015 cross-signature identrust planned available let encrypt opens public september 14 2015 let encrypt issued first certificate domain day isrg submitted root program applications mozilla microsoft google apple october 19 2015 intermediate certificates became cross-signed identrust causing certificates issued let encrypt trusted major browsers november 12 2015 let encrypt announced general availability would pushed back first public beta would commence december 3 2015 public beta ran december 3 2015 april 12 2016 3.8 million unexpired unrevoked active certificates cover 7 million unique domains part due support large hosting companies | [
363,
794,
96,
6795,
993,
2291,
5824,
6006,
8189,
4783,
6540,
578,
3383,
2043,
4071,
7567,
7925,
7848,
5965,
1425,
1059,
84
] | Test |
1,402 | 7 | Azure_Stream_Analytics:azure stream analytics microsoft azure stream analytics serverless scalable complex event processing engine microsoft enables users develop run real-time analytics multiple streams data sources devices sensors web sites social media applications users set alerts detect anomalies predict trends trigger necessary workflows certain conditions observed make data available downstream applications services presentation archiving analysis users author real-time analytics using simple declarative sql-like language embedded support temporal logic callouts custom code javascript user defined functions extend streaming logic written sql callouts azure machine learning helps predictive scoring streaming data azure stream analytics serverless job service azure eliminates need infrastructure servers virtual machines managed clusters users processing used running jobs azure stream analytics integrates azure iot hub enable real-time analytics data iot devices applications users build real-time dashboards power bi live command control view real-time dashboards help transform live data actionable insightful visuals stream analytics supports three different types input sources azure event hubs azure iot hubs azure blob storage additionally stream analytics supports azure blob storage input reference data help augment fast moving event data streams static data stream analytics supports wide variety output targets support power bi allows real-time dashboarding event hub service bus topics queues help trigger downstream workflows support azure table storage azure sql databases azure sql data warehouse azure sql document db azure data lake store enable variety downstream analysis archiving capabilities | [
3958,
2451,
1870
] | Validation |
1,403 | 4 | Monitor_mode:monitor mode monitor mode rfmon radio frequency monitor mode allows computer wireless network interface controller wnic monitor traffic received wireless channel unlike promiscuous mode also used packet sniffing monitor mode allows packets captured without associate access point ad hoc network first monitor mode applies wireless networks promiscuous mode used wired wireless networks monitor mode one eight modes 802.11 wireless cards operate master acting access point managed client also known station ad hoc repeater mesh wi-fi direct tdls monitor mode uses monitor mode include geographical packet analysis observing widespread traffic acquiring knowledge wi-fi technology hands-on experience especially useful auditing unsecure channels protected wep monitor mode also used help design wi-fi networks given area channel number wi-fi devices currently used discovered helps create better wi-fi network reduces interference wi-fi devices choosing least used wi-fi channels software kismac kismet combination packet analyzers read pcap files provide user interface passive wireless network monitoring usually wireless adapter unable transmit monitor mode restricted single wireless channel though dependent wireless adapter driver firmware features chipset also monitor mode adapter check see cyclic redundancy check crc values correct packets captured captured packets may corrupted microsoft windows network driver interface specification ndis api supported extensions monitor mode since ndis version 6 first available windows vista ndis 6 supports exposing 802.11 frames upper protocol levels previous versions exposed fake ethernet frames translated 802.11 frames monitor mode support ndis 6 optional feature may may implemented client adapter driver implementation details compliance ndis specifications vary vendor vendor many cases monitor mode support properly implemented vendor example ralink drivers report incorrect dbm readings realtek drivers include trailing 4-byte crc values versions windows prior windows vista packet analyzer applications wildpackets omnipeek tamosoft commview wifi provide device drivers support monitor mode linux interfaces 802.11 drivers support monitor mode many drivers offer support sta drivers ralink broadcom every manufacturer ’ provided driver ’ support monitor mode freebsd netbsd openbsd dragonfly bsd also provide interface 802.11 drivers supports monitor mode many drivers operating systems support monitor mode well mac os x 10.4 later releases drivers airport extreme network adapters allow adapter put monitor mode libpcap 1.0.0 later provides api select monitor mode capturing operating systems | [
6574,
7207,
7534,
726,
588,
4759,
6211,
7220,
1284,
6220,
7029
] | Test |
1,404 | 4 | Mixter:mixter mixter computer security specialist mixter first made transition computer underground large-scale public awareness 2000 time newspapers magazines worldwide mentioned link massively destructive effective distributed denial service ddos attacks crippled shut major websites including yahoo buy.com ebay amazon e-trade msn.com dell zdnet cnn early reports stated fbi-led national infrastructure protection center nipc questioning mixter regarding tool called stacheldraht barbed wire although mixter suspect tool tribal flood network tfn update called tfn2k ultimately discovered ones used attacks causing estimated 1.7 billion usd damages 2002 mixter returned public eye author hacktivismo six/four system six/four system censorship resistant network proxy works using trusted peers relay network connections ssl encrypted links example distribution includes program act web proxy connections hidden reach far end trusted peer | [
7175,
1691,
1813,
1372,
3338,
3592,
972,
6411,
6092
] | Test |
1,405 | 7 | FinisTerrae:finisterrae finisterrae 100th supercomputer top500 ranking november 2007 running 12.97 teraflops would rank position 258 list june 2008 also third powerful supercomputer spain marenostrum magerit located galicia project promoted xunta de galicia regional government galicia spanish national research council csic founded 1993 serve platform foster scientific innovation invest research development estimated base project completed 2010 expected reach top10 powerful supercomputers world reaches full capacity supercomputer physically hosted cesga main finisterrae characteristics depicted following table one special characteristics supercomputer ratio cores ram one reason received denomination singular technical scientific installation spanish government denomination given installations value makes singular way installations include canary island grand telescope alba synchrotron even third fastest supercomputer spain projects require special amounts memory held first second supercomputer therefore must executed finisterrae finisterrae supercomputer located cesga integrated system shared-memory nodes smp numa architecture finisterrae composed 144 computational nodes hierarchic storing system main purpose aim supercomputer research supercomputer mainly used three universities located galicia universidade da coruña universidade de santiago de compostela universidade de vigo well research organizations like csic main projects held supercomputer divided four fields | [
3764,
553,
5371,
5559,
4049,
4318,
3458,
5042,
578,
4154,
1481,
5939,
4159,
1023,
1295,
5947,
3041,
240,
1586,
7930,
515,
8024,
2961,
3578,
4993,
2803,
5447,
357,
2266,
5890
] | Test |
1,406 | 2 | GNU_Guix:gnu guix gnu guix cross-platform package manager tool instantiate manage operating system unix-like operating systems based nix package manager guile scheme apis specializes providing exclusively free software differing traditional package managers guix like nix utilizes purely functional deployment model software installed unique directories generated cryptographic hashes dependencies software included within hash solving problem dependency hell approach package management promises generate reliable reproducible portable packages guix packages defined functional guile scheme apis specifically designed package management dependencies tracked directly language special values called derivations evaluated guix daemon lazily guix keeps track references automatically installed packages garbage collected package depends cost greater storage requirements upgrades guix guaranteed atomic efficiently rolled back also enables multiple users safely install software system without administrator privileges extra storage requirements translates greater bandwidth usage binary substitutes downloaded compared distributions debian user chooses build everything source even larger storage space bandwidth required development gnu guix intertwined guix system guix 1.0 guix system distribution short guixsd complete installable gnu system using linux-libre kernel gnu shepherd init system roll-back feature guix inherited design nix found popular linux distributions debian derivatives arch linux derivatives major distributions fedora centos opensuse project coordinated internet team volunteers incorporated french non-profit guix europe members community features related package management features guix see features guix system inherited design nix content package manager kept directory /gnu/store guix daemon write access achieved via specialised bind mounts store file system mounted read prohibiting interference even root user guix daemon remounts store read/writable private namespace guix talks daemon build things fetch substitutes kept store guix like nix built garbage collection facilities help prune dead store items keep live ones example package definition hello-package written using guile package recipes easily inspected running e.g guix edit hello changed guix making system transparent easily hackable inherited design nix manipulation store items independent directories store begin base32 encoded hash contents dependencies item guix package uses profiles generations collection symlinks specific store items together comprising user installed profile every time package installed removed new generation built e.g profile user installed gnu hello contains links store item holds version hello installed currently used guix e.g version c087a90e06d7b9451f802323e24deb1862a21e0f guix corresponds following item /gnu/store/md2plii4g5sk66wg9cgwc964l3xwhrm9-hello-2.10 built recipe addition symlinks profile guix builds also contains union info-manuals man-pages icons fonts etc user browse documentation access icons fonts installed default symlinks profile generations stored /var/guix filesystem user create number profiles invoking guix package -p profile-name command new directory profile-name well profile-generation-symlinks created current directory guix package enables instantaneous roll-back previous profile generation via changing symlink earlier profile generation profiles also stored store e.g item profile containing hello /gnu/store/b4wipjlsapvnijmbawl7sh76087vpl4n-profile built activated running guix install hello guix environment enables user easily enter environment necessary packages development software present without clogging users default profile dependencies multiple projects e.g running guix environment hello enters throw-away environment everything needed compile hello guix present gcc guile etc. want persistent gc-rooted environment garbage collected next run guix gc create root e.g running guix environment -- root=hello-root hello enters environment everything needed compile guix present gcc guile etc registered root current directory symlinking items store guix pack enables user bundle together store items output docker binary image relocatable tarball squashfs binary guix pack enables user view different graphs packages dependencies guix system distribution abbreviated guixsd linux distribution built around gnu guix package manager enables declarative operating system configuration allows reliable system upgrades easily rolled back uses linux-libre kernel support gnu hurd kernel development february 3 2015 distribution added free software foundation list free linux distributions following cpu architectures supported ia-32 x64 aarch32 aarch64 april 2019 work progress power9 support system services core feature guix system enables user declaratively compose configuration daemons background services easily specify relevant configurations enables user within single configuration file declare whole os e.g tor proxy sshd server webserver serving guix-web via nginx specific port bootup system services ricardo wurmus one maintainers explains extendability like services defined using guile scheme list services continue grow 1.0.0 list services includes following guixsd uses gnu daemon shepherd init system developed tandem guix written guile well previously known dmd stood daemon managing daemons daemons-managing daemon changed names avoid collision digital mars compiler shepherd supplies user-space functionality asynchronously services shepherd generic functions object data types exported use shepherd extend base operating system defined way contrast systemd userspace shepherd process runs user core shepherd model user space initialisation concept extension form composability services designed layered onto services augmenting elaborate specialised behaviours desired expresses instantiation-based dependency relationships found many modern init systems making system modular also allows services interact variadically services arbitrary ways shepherd also provides so-called virtual services allow dynamic dispatch class related service objects instantiate mail transfer agent mta system system governed via shepherd daemon represent user space directed acyclic graph system-service − responsible early phases boot init − root subsequently initialised services extensions system-service functionality either directly transitively services written configured guile scheme gnu shepherd intended highly programmable system administrator also used manage per-user profiles unprivileged daemons services services configuration stored uniformly object-oriented scheme code core set services provided basic guix system distribution arbitrary new services flexibly declared guile object system goops existing services redefined user discretion asking shepherd dynamically rewrite services specified ways instantiation gnu shepherd originally designed work gnu hurd later adopted guixsd guixsd date unstable development git repository shared guix enables users organizations set stable release channels via channel-feature packages guix generally up-to-date thanks lack package maintainer bottleneck anyone contribute update subject community approval process assisted tools guix refresh changes git repository peer-reviewed community members committed one 45 people commit access practice sometimes builds cause system breakages users typo similar error often solved within minutes way guix pull operates means users retain working system meantime system update leave users broken system users easily roll back individual packages well whole system state means stable channel common linux distributions longer needed users willing report bug wait minutes trying update via guix pull gnu project announced november 2012 first release gnu guix functional package manager based nix provides among things guile scheme apis project started june 2012 ludovic courtès one gnu guile hackers august 20 2015 announced guix ported gnu hurd project fixed release schedule released approximately every 6 months jesse smith distrowatch weekly reviewed guixsd 0.15.0 said guixsd package manager like criticized limited hardware support limited documentation | [
707,
5017,
5726,
4675,
6428,
2559,
5386,
2581,
5757,
7555,
7559,
3981,
2594,
761,
2599,
7587,
1893,
5787,
781,
7954,
5092,
4020,
1523,
2985,
6876,
4759,
7619,
7251,
474,
3366,
4778,
1941,
1563,
4059,
4070,
6209,
3036,
1582,
4441,
5515,
... | Test |
1,407 | 9 | Visitor_pattern:visitor pattern object-oriented programming software engineering visitor design pattern way separating algorithm object structure operates practical result separation ability add new operations existing object structures without modifying structures one way follow open/closed principle essence visitor allows adding new virtual functions family classes without modifying classes instead visitor class created implements appropriate specializations virtual function visitor takes instance reference input implements goal double dispatch visitor design pattern one twenty-three well-known gof design patterns describe solve recurring design problems design flexible reusable object-oriented software objects easier implement change test reuse problems visitor design pattern solve new operations needed frequently object structure consists many unrelated classes inflexible add new subclasses time new operation required .. distributing operations across various node classes leads system hard understand maintain change solution visitor design pattern describe makes possible create new operations independently classes object structure adding new visitor objects see also uml class sequence diagram gang four defines visitor nature visitor makes ideal pattern plug public apis thus allowing clients perform operations class using visiting class without modify source moving operations visitor classes beneficial drawback pattern however makes extensions class hierarchy difficult new classes typically require new codice_1 method added visitor consider design 2d computer-aided design cad system core several types represent basic geometric shapes like circles lines arcs entities ordered layers top type hierarchy drawing simply list layers plus added properties fundamental operation type hierarchy saving drawing system native file format first glance may seem acceptable add local save methods types hierarchy also useful able save drawings file formats adding ever methods saving many different file formats soon clutters relatively pure original geometric data structure naive way solve would maintain separate functions file format save function would take drawing input traverse encode specific file format done added different format duplication functions accumulates example saving circle shape raster format requires similar code matter specific raster form used different primitive shapes case primitive shapes like lines polygons similar thus code becomes large outer loop traversing objects large decision tree inside loop querying type object another problem approach easy miss shape one savers new primitive shape introduced save routine implemented one file type others leading code extension maintenance problems instead visitor pattern applied encodes logical operation whole hierarchy one class containing one method per type cad example save function would implemented separate visitor subclass would remove duplication type checks traversal steps would also make compiler complain shape omitted another motive reuse iteration code example iterating directory structure could implemented visitor pattern would allow creating file searches file backups directory removal etc. implementing visitor function reusing iteration code uml class diagram codice_2 class n't implement new operation directly instead codice_2 implements dispatching operation codice_4 dispatches delegates request accepted visitor object codice_5 codice_6 class implements operation codice_7 br codice_8 implements codice_4 dispatching codice_10 codice_6 class implements operation codice_12 uml sequence diagram shows run-time interactions codice_13 object traverses elements object structure codice_14 calls codice_4 element br first codice_13 calls codice_4 codice_2 calls codice_19 accepted codice_20 object element codice_21 passed codice_20 visit codice_2 call codice_24 br thereafter codice_13 calls codice_4 codice_8 calls codice_28 codice_20 visits codice_8 calls codice_31 visitor pattern requires programming language supports single dispatch common object-oriented languages c++ java smalltalk objective-c swift javascript python c condition consider two objects class type one termed element visitor visitor declares codice_1 method takes element argument class element concrete visitors derived visitor class implement codice_1 methods implements part algorithm operating object structure state algorithm maintained locally concrete visitor class element declares codice_34 method accept visitor taking visitor argument concrete elements derived element class implement codice_34 method simplest form call visitor ’ codice_1 method composite elements maintain list child objects typically iterate calling child ’ codice_34 method client creates object structure directly indirectly instantiates concrete visitors operation performed implemented using visitor pattern calls codice_34 method top-level element codice_34 method called program implementation chosen based dynamic type element static type visitor associated codice_1 method called implementation chosen based dynamic type visitor static type element known within implementation codice_34 method dynamic type element bonus visitor ca n't handle argument given element type compiler catch error thus implementation codice_1 method chosen based dynamic type element dynamic type visitor effectively implements double dispatch languages whose object systems support multiple dispatch single dispatch common lisp c via dynamic language runtime dlr implementation visitor pattern greatly simplified a.k.a dynamic visitor allowing use simple function overloading cover cases visited dynamic visitor provided operates public data conforms open/closed principle since modify extant structures single responsibility principle since implements visitor pattern separate component way one algorithm written traverse graph elements many different kinds operations performed traversal supplying different kinds visitors interact elements based dynamic types elements visitors example shows print tree representing numeric expression involving literals addition example presented using classic dynamic language runtime implementations classic visitor print operations type implemented one expressionprinter class number overloads visit method namespace wikipedia example declares separate codice_43 class takes care printing expression classes must expose members make possible namespace wikipedia case object responsibility know print stream visitor object stream syntax creating class classes created sending messages classes writestream subclass expressionprinter expressionprinter » write anobject object subclass expression expression subclass literal literal class » avalue literal » value avalue literal » puton astream expression subclass addition addition class » left right b addition » left anexpression addition » right anexpression addition » puton astream object subclass program program » main class abstractdispatcher // forward declare abstractdispatcher class file // parent class elements archivedfile splitfile // forward declare specific elements files dispatched class archivedfile class splitfile class extractedfile class abstractdispatcher // declares interface dispatcher class archivedfile public file // specific element class 1 class splitfile public file // specific element class 2 class extractedfile public file // specific element class 3 class dispatcher public abstractdispatcher // implements dispatching int main package visitor2 import fmt type visitor interface type element interface type wheel struct func self *wheel accept visitor visitor string func self *wheel getname string func self *engine accept visitor visitor string func self *body accept visitor visitor string type car struct func self *car accept visitor visitor string func self *visitcar visit element element string package visitor import func testvistor *testing.t visiting engine visiting body visiting front left wheel visiting front right wheel visiting back left wheel visiting back right wheel following example language java shows contents tree nodes case describing components car printed instead creating codice_44 methods node subclass codice_45 codice_46 codice_47 codice_48 one visitor class codice_49 performs required printing action different node subclasses require slightly different actions print properly codice_49 dispatches actions based class argument passed codice_1 method codice_52 analogous save operation different file format likewise import java.util.list interface carelement interface carelementvisitor class wheel implements carelement class body implements carelement class engine implements carelement class car implements carelement class carelementdovisitor implements carelementvisitor class carelementprintvisitor implements carelementvisitor public class visitordemo flexible approach pattern create wrapper class implementing interface defining accept method wrapper contains reference pointing codice_53 could initialized constructor approach avoids implement interface element see article java tip 98 article elements initarg elements defmethod do-something object other-object defmethod do-something object wheel other-object integer defmethod do-something object wheel other-object symbol let make-instance 'auto codice_54 parameter superfluous codice_55 reason possible use anonymous function calls desired target method lexically captured object defmethod traverse function auto other-object removed multiple dispatch occurs call issued body anonymous function codice_55 mapping function distributes function application elements object thus traces visitor pattern disappear except mapping function evidence two objects involved knowledge two objects dispatch types lambda function python support method overloading visit methods different model types need different names visitor pattern example abc import abcmeta abstractmethod not_implemented implement class carelement class body carelement class engine carelement class wheel carelement class car carelement class carelementvisitor class carelementdovisitor carelementvisitor class carelementprintvisitor carelementvisitor car car car.accept carelementprintvisitor car.accept carelementdovisitor visiting front left wheel visiting front right wheel visiting back left wheel visiting back right wheel visiting body visiting engine visiting car kicking front left wheel kicking front right wheel kicking back left wheel kicking back right wheel moving body starting engine starting car one using python 3 make general implementation accept method class visitable one could extend iterate class method resolution order would like fall back already-implemented classes could also use subclass hook feature define lookup advance | [
2176,
2451,
2986,
5014,
3686,
6415,
4031,
1445,
6886,
2638,
2827,
1730,
5650,
1554,
5751,
6025,
231,
7924,
5091,
235,
3396,
7391,
517,
6224,
2961,
5965,
1803
] | Validation |
1,408 | 3 | Self-stabilization:self-stabilization self-stabilization concept fault-tolerance distributed computing distributed system self-stabilizing end correct state matter state initialized correct state reached finite number execution steps first glance guarantee self stabilization may seem less promising traditional fault-tolerance algorithms aim guarantee system always remains correct state certain kinds state transitions however traditional fault tolerance always achieved example achieved system started incorrect state corrupted intruder moreover complexity hard debug analyze distributed systems hence hard prevent distributed system reaching incorrect state indeed forms self-stabilization incorporated many modern computer telecommunications networks since gives ability cope faults foreseen design algorithm many years seminal paper edsger dijkstra 1974 concept remains important presents important foundation self-managing computer systems fault-tolerant systems result dijkstra paper received 2002 acm podc influential-paper award one highest recognitions distributed computing community moreover dijkstra death award renamed called dijkstra award e.w dijkstra 1974 presented concept self-stabilization prompting research area demonstration involved presentation self-stabilizing mutual exclusion algorithms also showed first self-stabilizing algorithms rely strong assumptions system previous protocols used practice actually stabilize assuming existence clock global system assuming known upper bound duration system transition ten years later leslie lamport pointed importance dijkstra work 1983 conference called symposium principles distributed computing researchers directed attention elegant fault-tolerance concept talk lamport stated regard dijkstra brilliant work least brilliant published paper almost completely unknown regard milestone work fault tolerance ... regard self-stabilization important concept fault tolerance fertile field research.afterwards dijkstra work awarded acm-popdc influential paper award became acm association computing machinery dijkstra prize distributed computing given annual acm-popdc symposium distributed algorithm self-stabilizing starting arbitrary state guaranteed converge legitimate state remain legitimate set states thereafter state legitimate starting state algorithm satisfies specification property self-stabilization enables distributed algorithm recover transient fault regardless nature moreover self-stabilizing algorithm initialized eventually starts behave correctly regardless initial state dijkstra paper introduces concept self-stabilization presents example context token ring — network computers ordered circle computer processor see whole state one processor immediately precedes state may imply processor token token one requirements exactly one must hold token given time second requirement prescribes node passes token computer/processor succeeding token eventually circulates ring first self-stabilizing algorithms detect errors explicitly order subsequently repair instead constantly pushed system towards legitimate state since traditional methods detecting error often difficult time-consuming behavior considered desirable method described paper cited collects huge amount information whole network one place attempts determine whether collected global state correct even determination alone hard task recently researchers presented newer methods light-weight error detection self-stabilizing systems using local checking term local refers part computer network local detection used computer network required communicate entire network order detect error — error detected computer communicate nearest neighbors local detection methods simplified task designing self-stabilizing algorithms considerably error detection mechanism recovery mechanism designed separately newer algorithms based detection methods also turned much efficient moreover papers suggested rather efficient general transformers transform non self stabilizing algorithms become self stabilizing idea combination 4 parts self stabilizing initial self stabilizing protocols also presented papers efficient reset protocols presented later e.g additional efficiency introduced notion time-adaptive protocols idea behind small number errors occurs recovery time made short dijkstra original self-stabilization algorithms property useful property self-stabilizing algorithms composed layers layers exhibit circular dependencies stabilization time composition bounded sum individual stabilization times layer new approaches dijkstra work emerged later case krzysztof apt ehsan shoja proposition demonstrated self-stabilization naturally formulated using standard concepts strategic games particularly concept improvement path particular work sought demonstrate link self-stabilization game theory time complexity self-stabilizing algorithm measured asynchronous rounds cycles measure output stabilization time subset state variables defined externally visible output certain states outputs defined correct legitimate set outputs components system said stabilized time starts correct provided stays correct indefinitely unless additional faults occur output stabilization time time number asynchronous rounds output stabilizes system self-stabilizing system said randomized self-stabilizing self-stabilizing expected number rounds needed reach correct state bounded constant formula_1 design self-stabilization above-mentioned sense well known difficult job fact class distributed algorithms property local checking legitimacy network state evaluated single process obvious case dijkstra token-ring defined process detect whether network state legitimate case one token present non-neighboring processes suggests self-stabilization distributed system sort collective intelligence component taking local actions based local knowledge eventually guarantees global convergence end help overcome difficulty designing self-stabilization defined types stabilization devised instance weak stabilization property distributed system possibility reach legitimate behavior every possible state weak stabilization easier design guarantees possibility convergence runs distributed system rather convergence every run self-stabilizing algorithm silent converges global state values communication registers used algorithm remain fixed extension concept self-stabilization superstabilization intent cope dynamic distributed systems undergo topological changes classical self-stabilization theory arbitrary changes viewed errors guarantees given system stabilized superstabilizing systems passage predicate always satisfied system topology reconfigured | [
4469,
1114,
1600,
6748,
6466,
7863,
3895,
8137,
4812,
4651,
2667,
5424
] | Test |
1,409 | 4 | XACML:xacml xacml stands extensible access control markup language standard defines declarative fine-grained attribute-based access control policy language architecture processing model describing evaluate access requests according rules defined policies published standard specification one goals xacml promote common terminology interoperability access control implementations multiple vendors xacml primarily attribute-based access control system abac attributes bits data associated user action resource inputs decision whether given user may access given resource particular way role-based access control rbac also implemented xacml specialization abac xacml model supports encourages separation access decision point use access decisions baked client applications based local machine userids access control lists acls difficult update decision criteria governing policy changes client decoupled access decision authorization policies updated fly affect clients immediately version 1.0 ratified oasis standards organization 2003 version 2.0 ratified oasis standards organization february 1 2005 first committee specification xacml 3.0 released august 10 2010 latest version xacml 3.0 standardized january 2013 non-normative terminology following rfc 2904 except pap xacml structured 3 levels elements policy set contain number policy elements policy set elements policy contain number rule elements policies policy sets rules requests use subjects resources environments actions xacml provides target basically set simplified conditions subject resource action must met policy set policy rule apply given request policy policy set found apply given request rules evaluated determine access decision response addition way check applicability target information also provides way index policies useful need store many policies quickly sift find ones apply request access service arrives pdp know look policies might apply request policies indexed based target constraints note target may also specify applies request policy set policy rule contain target elements conditions exist rules conditions essentially advanced form target use broader range functions importantly used compare two attributes together e.g subject-id==doctor-id conditions possible implement segregation duty checks relationship-based access control within xacml concept called obligations used obligation directive policy decision point pdp policy enforcement point pep must carried access approved pep unable comply directive approved access may must realized augmentation obligations eliminates gap formal requirements policy enforcement example obligation could look like access control rule xacml obligation effective way meet formal requirements non-repudiation example hard implement access control rules furthermore formal requirements part access control policy obligations separate functions makes policies consistent centralization environment easier achieve happens xacml two rules policies contradict imagine instance first rule would say managers view documents second rule would say one work 9am request alice trying view document 8am rule wins combining algorithms tell us help resolve conflicts xacml defines number combining algorithms identified rulecombiningalgid policycombiningalgid attribute policy policyset elements respectively rule-combining algorithm defines procedure arriving access decision given individual results evaluation set rules similarly policy-combining algorithm defines procedure arriving access decision given individual results evaluation set policies list higher order functions listed formal definition refer xacml standard http //docs.oasis-open.org/xacml/3.0/xacml-core-v3-schema-wd-17.xsd xacml 3.0 introduces administrative delegation json profile xacml request/response rest profile xacml multiple decision profile xacml many implementation delegation new xacml 3.0 delegation mechanism used support decentralized administration access policies allows authority delegator delegate parts authority someone else authority another user delegate without need involve modification root policy delegation model delegation rights separated access rights instead referred administrative control policies access control administrative policies work together following scenario partnership companies many services protected access control system system implements following central rules protect resources allow delegation access control rules administration control rules consultant enters corporation delegation issued locally consultant supervisor authorizing consultant access systems directly delegator supervisor scenario may right delegate limited set access rights consultants new features xacml 3.0 listed http //www.webfarmr.eu/2010/07/enhancements-and-new-features-in-xacml-3-axiomatics/ xacml tc also publishing list changes http //wiki.oasis-open.org/xacml/differencesbetweenxacml2.0andxacml3.0 rule implements use-it-lose-it access control paradigm user log 30 days lose access pseudo-code deny currentdatetime lastlogin 30 days rule grants access current time greater 9am less 5pm following contains obligation block obligations statements returned along decision enrich decision flow example pep must log access granted 2013 2014 xacml technical committee focused designing new profiles facilitate developer integration include three profiles showcased cloud identity summit 2014 monterey california using profiles integrating fine-grained authorization applications becomes much easier json profile xacml simplifies integration pep pdp saml identity sso federation standard used authentication saml used common identity token format different applications saml xacml defined oasis saml xacml designed interoperate saml used carry identity information virtual identities xacml used drive access control logic policies oauth 2.0 considered authorization standard differs xacml though origin purpose applications oauth xacml handle user approval delegated access password management xacml simply provides xacml oauth combined together deliver comprehensive approach authorization | [
6507,
1998,
5111,
4770,
1935,
302,
1760,
3884,
5500,
5149,
751,
7565,
8137,
3498
] | Test |
1,410 | 4 | Isyvmon:isyvmon isyvmon computer system network monitoring software application system created it-cube systems designed monitor track status various applications network services servers network hardware isyvmon based open source software nagios centreon licensed gnu gpl v3 special features development isyvmon „ full discovery anh “ freeware enterprise edition auto discovery adi also available freeware edition introduced connection splunk www.splunk.com isyvmon isyvmon first world open public release isyvmon first official release idea isyvmon born introduced based 2007 created standardized toolkit evaluated relevant available monitoring tools nagios interface handling unhandy | [
3915,
5571
] | Test |
1,411 | 8 | Hypervideo:hypervideo hypervideo hyperlinked video displayed video stream contains embedded interactive anchors allowing navigation video hypermedia elements hypervideo thus analogous hypertext allows reader click word one document retrieve information another document another place document hypervideo combines video non-linear information structure allowing user make choices based content video user interests crucial difference hypervideo hypertext element time text normally static video necessarily dynamic content video changes time consequently hypervideo different technical aesthetics rhetorical requirements static hypertext page example hypervideo might involve creation link object video visible certain duration therefore necessary segment video appropriately add metadata required link frames—or even objects—in video pertinent information media forms kinoautomat 1967 world first interactive movie modern hypervideo systems implements core concepts movie non linear narrative interactivity video-to-video linking demonstrated interactive cinema group mit media lab elastic charles hypermedia journal developed 1988 1989 annotations called micons placed inside video indicating links content implementing interactive kon-tiki museum listol used order represent video footnotes video footnotes deliberate extension literary footnote applied annotating video thereby providing continuity traditional text early hypervideo 1993 hirata et al considered media based navigation hypermedia systems type media used query media retrieved example part image defined shape color example could link related image approach content video becomes basis forming links related content hotvideo implementation kind hypervideo developed ibm china research laboratory 1996 navigation associated resources accomplished clicking dynamic object video 1997 project mit media lab object-based media group called hypersoap developed concept short soap opera program viewer could click enhanced remote control objects video find information could purchased company watchpoint media formed order commercialize technology involved resulting product called storyteller oriented towards interactive television illustrating progression hypervideo hypertext storyspace hypertext writing environment employs spatial metaphor displaying links utilizes 'writing spaces generic containers content link writing spaces 1996 hypercafe popular experimental prototype hypervideo made use tool create narrative video spaces developed early model hypervideo system placing users virtual cafe user dynamically interacts video follow different conversations 1997 israeli software firm ephyx technologies released product called v-active one first commercial object based authoring system hypervideo technology success though ephyx changed name veon 1999 time shifted focus away hypervideo provision development tools web broadband content.. eline technologies founded 1999 developed hypervideo solutions called videoclix today videoclix used saas software service solution distribute monetize clickable video web mobile devices advantage videos play back popular video players quicktime flash well multiple online video platforms brightcove theplatform ooyala videoclix also offers technology integrated 3rd party players based quicktime flash mpeg-4 html5 first steps hypervideo taken late 1980s would appear hypervideo taking unexpectedly long realize potential many experiments hypercafe hypersoap extensively followed authoring tools moment available small number providers amount video content increases becomes available possibilities linking video increase even faster digital libraries constantly growing video important part news outlets amassed vast video archives could useful education historical research direct searching pictures videos much harder task indexing searching text could greatly facilitated hypervideo methods hypervideo challenging compared hyperlinked text due unique difficulty video presents node segmentation separating video algorithmically identifiable linkable content video basic time sequence images turn simply two dimensional arrays color information order segment video meaningful pieces objects images scenes within videos necessary provide context space time extract meaningful elements image sequence humans naturally able perform task desirable algorithmically developing method achieve however complex problem ntsc frame rate 30 frames per second even short video 30 seconds comprises 900 frames identification distinct video elements would tedious human intervention required every frame moderate amounts video material manual segmentation clearly unrealistic standpoint time smallest unit video single frame node segmentation could performed frame level—a straightforward task frame easily identifiable however single frame contain video information since videos necessarily dynamic analogously single word separated text convey meaning thus necessary consider scene next level temporal organization scene defined minimum sequential set frames conveys meaning important concept hypervideo one might wish hypervideo link active throughout one scene though next scene granularity therefore natural creation hypervideo consequently hypervideo requires algorithms capable detecting scene transitions one imagine coarser levels temporal organization scenes grouped together form narrative sequence turn grouped form video point view node segmentation however concepts critical even frame smallest time unit one still spatially segment video sub-frame level separating frame image constituent objects necessary performing node segmentation object level time introduces complexity case also even object differentiated one frame usually necessary follow object sequence frames process known object tracking essential creation links objects videos spatial segmentation object achieved example use intensity gradients detect edges color histograms match regions motion detection combination methods required nodes segmented combined associated linking information metadata must incorporated original video playback metadata placed conceptually layers tracks top video layered structure presented user viewing interaction thus display technology hypervideo player neglected creating hypervideo content example efficiency gained storing geometry areas associated tracked objects certain keyframes allowing player interpolate keyframes developed hotvideo furthermore creators videoclix emphasize fact content plays back standard players quicktime flash one considers flash player alone installed 98 internet-enabled desktops mature markets perhaps reason success product current arena user replies video content traditionally form text image links embedded playback sequence video allowed video hosting services viddler become embedded within imagery video within portions playback via selected time lengths inside progress slider element feature become known video comments audio comments perhaps significant consequence hypervideo result commercial advertising devising business model monetize video proven notoriously difficult application traditional advertising methods—for example introducing ads video—is likely rejected online community revenue selling advertising video sharing sites far promising hypervideo offers alternate way monetize video allowing possibility creating video clips objects link advertising e-commerce sites provide information particular products new model advertising less intrusive displaying advertising information user makes choice clicking object video since user requested product information type advertising better targeted likely effective | [
2086,
3935,
2528,
84,
1355,
5355,
3999,
3383,
5375
] | Validation |
1,412 | 4 | Trinoo:trinoo trinoo trin00 set computer programs conduct ddos attack believed trinoo networks set thousands systems internet compromised remote buffer overrun exploits first suspected trinoo attacks described cert incident note 99-04 trinoo network connected february 2000 distributed denial service attack yahoo website trinoo famous allowing attackers leave message folder called cry_baby file self replicating modified regular basis long port 80 active trinoo authored teenager new orleans went alias phifli attacker using compromised host compiles list machines compromised process done automatically compromised host host stores mount information including find hosts compromise soon list machines compromised compiled scripts run compromise convert trinoo masters daemons one master control multiple daemons daemons compromised hosts launch actual udp floods victim machine ddos attack launched attacker issues command master hosts masters instruct every daemon start dos attack ip address specified command many doss comprise ddos attack | [
6459,
1691,
5125,
1372,
5571,
6015,
578,
1435,
4966,
6092
] | Test |
1,413 | 4 | Exit_control_lock:exit control lock exit control lock also known exit control device exit lock simply exit control prevents deters unauthorized exit exit control locks often used retail establishments deter shoplifting also used airports controlled areas people held clear customs quarantine stations exit control locks also used libraries one well-staffed entrance exit number exits intended emergency use exit control devices often used hospitals interfaced wireless sensors worn newborn children exits lock baby stolen one hospital rooms often shops make exit emergency use deter shoplifting usually door locked emergency exit button next pushing emergency exit button unlock door set shop fire alarm deters shoplifting person unlocks door order take item building emergency may reported police cctv footage available many exit control locks based magnetic locks one type delayed egress magnetic locks allow door open immediately allows guard get door door opens also release fire alarm power failure otherwise locks hold exit doors shut units common alzheimer units exit control systems include request exit detector pushbutton opens exit exit requests enabled facilities entrances well exits require authentication swiping otherwise reading card card reader intruder slips entrance controls building able detained questioning | [
874
] | Train |
1,414 | 1 | Second_normal_form:second normal form second normal form 2nf normal form used database normalization 2nf originally defined e.f. codd 1971 relation second normal form fulfills following two requirements 2 non-prime attribute functionally dependent proper subset candidate key relation non-prime attribute relation attribute part candidate key relation put simply relation 2nf 1nf every non-prime attribute relation dependent whole every candidate key note put restriction non-prime non-prime attribute dependency addressed third normal form functional dependency part candidate key violation 2nf addition primary key relation may contain candidate keys necessary establish non-prime attributes part-key dependencies candidate keys following relation satisfy 2nf multiple manufacturer country dependent part candidate key even designer specified primary key model full name relation 2nf candidate keys manufacturer model also candidate key manufacturer country dependent proper subset manufacturer make design conform 2nf necessary two relations | [
4046,
4048,
4888,
1415,
1416,
1417,
2124
] | Test |
1,415 | 1 | Third_normal_form:third normal form third normal form 3nf normal form used normalizing database design reduce duplication data ensure referential integrity ensuring 1 entity second normal form 2 non-prime non-key attribute transitively dependent key i.e non-prime attribute depends non-prime attributes non-prime attributes must depend keys 3nf designed eliminate undesirable data anomalies reduce need restructuring time make data model informative make data model neutral different kinds query statistics codd later realized 3nf achieve first goals developed boyce-codd normal form address limitations 3nf third normal form 3nf normal form used database normalization 3nf originally defined e.f. codd 1971 codd definition states table 3nf following conditions hold non-prime attribute r attribute belong candidate key r. transitive dependency functional dependency x → z x determines z indirectly virtue x → → z case → x 3nf definition equivalent codd expressed differently given carlo zaniolo 1982 definition states table 3nf functional dependencies x → least one following conditions holds zaniolo definition gives clear sense difference 3nf stringent boyce–codd normal form bcnf bcnf simply eliminates third alternative every element a-x set difference x prime attribute approximation codd definition 3nf paralleling traditional pledge give true evidence court law given bill kent every non-key attribute must provide fact key whole key nothing key common variation supplements definition oath help codd requiring existence key ensures table 1nf requiring non-key attributes dependent whole key ensures 2nf requiring non-key attributes dependent nothing key ensures 3nf phrase useful mnemonic fact mentions single key means defines necessary sufficient conditions satisfy 2nd 3rd normal forms 2nf 3nf concerned equally candidate keys table one key chris date refers kent summary intuitively attractive characterization 3nf notes slight adaptation may serve definition slightly stronger boyce–codd normal form attribute must represent fact key whole key nothing key 3nf version definition weaker date bcnf variation former concerned ensuring non-key attributes dependent keys prime attributes keys parts keys must functionally dependent represent fact key sense providing part key rule applies functionally dependent attributes applying attributes would implicitly prohibit composite candidate keys since part key would violate whole key clause example 2nf table fails meet requirements 3nf row table needs tell us particular tournament particular year composite key tournament year minimal set attributes guaranteed uniquely identify row tournament year candidate key table breach 3nf occurs non-prime attribute winner date birth transitively dependent candidate key tournament year via non-prime attribute winner fact winner date birth functionally dependent winner makes table vulnerable logical inconsistencies nothing stop person shown different dates birth different records order express facts without violating 3nf necessary split table two update anomalies occur tables unlike winner primary key second table thus allowing one value date birth winner relation always decomposed third normal form relation r rewritten projections r ... r whose join equal original relation decomposition lose functional dependency sense every functional dependency r derived functional dependencies hold projections r ... r. decomposition computed polynomial time definition 3nf offered carlo zaniolo 1982 given proven following way let x → nontrivial fd i.e one x contain let non-key attribute also let key r. → x 3nf tables free update insertion deletion anomalies certain types 3nf tables rarely met practice affected anomalies tables either fall short boyce–codd normal form bcnf meet bcnf fall short higher normal forms 4nf 5nf 3nf ideal machine processing segmented nature data model difficult consume human user analytics via query reporting dashboards often facilitated different type data model provided pre-calculated analysis trend lines period-to-date calculations month-to-date quarter-to-date year-to-date cumulative calculations basic statistics average standard deviation moving averages previous period comparisons year ago month ago week ago e.g dimensional modeling beyond dimensional modeling flattening stars via hadoop data science | [
4046,
4048,
5778,
1414,
4888,
4950,
1416,
1417,
655,
2054,
7205,
2124
] | Test |
1,416 | 1 | Fourth_normal_form:fourth normal form fourth normal form 4nf normal form used database normalization introduced ronald fagin 1977 4nf next level normalization boyce–codd normal form bcnf whereas second third boyce–codd normal forms concerned functional dependencies 4nf concerned general type dependency known multivalued dependency table 4nf every one non-trivial multivalued dependencies x formula_1 x superkey—that x either candidate key superset thereof column headings relational database table divided three disjoint groupings x z context particular row refer data beneath group headings x z respectively multivalued dependency x formula_1 signifies choose x actually occurring table call choice x compile list xyz combinations occur table find x associated entries regardless z essentially presence z provides useful information constrain possible values trivial multivalued dependency x formula_1 one either subset x x together form whole set attributes relation functional dependency special case multivalued dependency functional dependency x → every x determines exactly one never one consider following example row indicates given restaurant deliver given variety pizza given area table non-key attributes key restaurant pizza variety delivery area therefore meets normal forms bcnf assume however pizza varieties offered restaurant affected delivery area i.e restaurant offers pizza varieties makes areas supplies meet 4nf problem table features two non-trivial multivalued dependencies restaurant attribute superkey dependencies non-trivial multivalued dependencies non-superkey reflect fact varieties pizza restaurant offers independent areas restaurant delivers state affairs leads redundancy table example told three times a1 pizza offers stuffed crust a1 pizza starts producing cheese crust pizzas need add multiple rows one a1 pizza delivery areas moreover nothing prevent us incorrectly might add cheese crust rows one a1 pizza delivery areas thereby failing respect multivalued dependency restaurant formula_1 pizza variety eliminate possibility anomalies must place facts varieties offered different table facts delivery areas yielding two tables 4nf contrast pizza varieties offered restaurant sometimes legitimately vary one delivery area another original three-column table would satisfy 4nf ronald fagin demonstrated always possible achieve 4nf rissanen theorem also applicable multivalued dependencies 1992 paper margaret s. wu notes teaching database normalization typically stops short 4nf perhaps belief tables violating 4nf meeting lower normal forms rarely encountered business applications belief may accurate however wu reports study forty organizational databases 20 contained one tables violated 4nf meeting lower normal forms rare situations 4nf table conform higher normal form 5nf situations complex real-world constraint governing valid combinations attribute values 4nf table implicit structure table | [
4046,
4048,
1414,
4888,
1415,
1417,
2124
] | Test |
1,417 | 1 | First_normal_form:first normal form first normal form 1nf property relation relational database relation first normal form domain attribute contains atomic indivisible values value attribute contains single value domain first definition term 1971 conference paper edgar codd defined relation first normal form none domains sets elements first normal form essential property relation relational database database normalization process representing database terms relations standard normal forms first normal minimal requirement first normal form enforces criteria following scenarios first illustrate database design might violate first normal form followed examples comply table stores names telephone numbers customers one requirement though retain telephone numbers customers simplest way satisfying requirement allow telephone number column given row contain one value note telephone number column simply contains text numbers different formats importantly one number two customers duplicating related information column would satisfied arbitrary text would fine arbitrary text obviously intended column contain telephone number seen telephone numbers text atomic subdivided well seen telephone numbers text contains one number two rows representation telephone numbers first normal form columns contain non-atomic values contain one apparent solution introduce columns technically table violate requirement values atomic however informally two telephone number columns still form repeating group repeat conceptually attribute namely telephone number arbitrary hence meaningless ordering introduced 555-861-2025 put telephone number1 column rather telephone number2 column reason customers could two telephone numbers many telephone number n columns possible search telephone number without searching arbitrary number columns adding extra telephone number may require table reorganized addition new column rather new row tuple added null value telephone number2 customer 789 also issue bring model first normal form split strings used hold telephone number information atomic i.e indivisible entities single phone numbers ensure row contains one phone number note id longer unique solution duplicated customers uniquely identify row need use combination id telephone number value combination unique although column separately contains repeated values able uniquely identify row tuple requirement 1nf alternative design uses two tables columns contain one telephone number design instead customer-to-telephone number link appears row using customer id key one-to-many relationship exists name number tables row parent table customer name associated many telephone number rows child table customer telephone number telephone number belongs one one customer worth noting design meets additional requirements second third normal form edgar f. codd definition 1nf makes reference concept 'atomicity codd states values domains relation defined required atomic respect dbms codd defines atomic value one decomposed smaller pieces dbms excluding certain special functions meaning column divided parts one kind data one part means dbms depends another part column hugh darwen chris date suggested codd concept atomic value ambiguous ambiguity led widespread confusion 1nf understood particular notion value decomposed problematic would seem imply data types atomic date suggests notion atomicity absolute meaning value may considered atomic purposes may considered assemblage basic elements purposes position accepted 1nf defined reference atomicity columns conceivable data type string types numeric types array types table types acceptable 1nf table—although perhaps always desirable example would desirable separate customer name column two separate columns first name surname according date definition table first normal form isomorphic relation means specifically satisfies following five conditions violation conditions would mean table strictly relational therefore first normal form examples tables views would meet definition first normal form first normal form defined chris date permits relation-valued attributes tables within tables date argues relation-valued attributes means column within table contain table useful rare cases | [
4046,
4048,
1414,
4888,
1415,
1416,
6462,
6543,
7205,
2124
] | Test |
1,418 | 2 | Security_and_safety_features_new_to_Windows_Vista:security safety features new windows vista number security safety features new windows vista available prior microsoft windows operating system release beginning early 2002 microsoft announcement trustworthy computing initiative great deal work gone making windows vista secure operating system predecessors internally microsoft adopted security development lifecycle underlying ethos secure design secure default secure deployment new code windows vista developed sdl methodology existing code reviewed refactored improve security specific areas windows vista introduces new security safety mechanisms include user account control parental controls network access protection built-in anti-malware tool new digital content protection mechanisms user account control new infrastructure requires user consent allowing action requires administrative privileges feature users including users administrative privileges run standard user mode default since applications require higher privileges action attempted needs administrative privileges installing new software changing system settings windows prompt user whether allow action user chooses allow process initiating action elevated higher privilege context continue standard users need enter username password administrative account get process elevated over-the-shoulder credentials administrator choose prompted consent ask credentials uac asks credentials secure desktop mode entire screen faded temporarily disabled present elevation ui prevent spoofing ui mouse application requesting elevation application requesting elevation focus switch secure desktop occurs taskbar icon blinks focussed elevation ui presented however possible prevent malicious application silently obtaining focus since secure desktop allows highest privilege system applications run user mode application present dialog boxes desktop prompt elevation consent safely assumed genuine additionally also help protect shatter attacks intercept windows inter-process messages run malicious code spoof user interface preventing unauthorized processes sending messages high privilege processes process wants send message high privilege process must get elevated higher privilege context via uac applications written assumption user running administrator privileges experienced problems earlier versions windows run limited user accounts often attempted write machine-wide system directories program files registry keys notably hklm uac attempts alleviate using file registry virtualization redirects writes subsequent reads per-user location within user ’ profile example application attempts write “ c \program files\appname\settings.ini ” user ’ permissions write directory write get redirected “ c \users\username\appdata\local\virtualstore\program files\appname\. ” bitlocker formerly known secure startup feature offers full disk encryption system volume using command-line utility possible encrypt additional volumes bitlocker utilizes usb key trusted platform module tpm version 1.2 tcg specifications store encryption key ensures computer running windows vista starts known-good state also protects data unauthorized access data volume encrypted full volume encryption key fvek encrypted volume master key vmk stored disk windows vista first microsoft windows operating system offer native support tpm 1.2 providing set apis commands classes services use management tpm new system service referred tpm base services enables access sharing tpm resources developers wish build applications support device encrypting file system efs windows vista used encrypt system page file per-user offline files cache efs also tightly integrated enterprise public key infrastructure pki supports using pki-based key recovery data recovery efs recovery certificates combination two also new group policies require smart cards efs enforce page file encryption stipulate minimum key lengths efs enforce encryption user ’ documents folder prohibit self-signed certificates efs encryption key cache cleared user locks workstation certain time limit efs rekeying wizard allows user choose certificate efs select migrate existing files use newly chosen certificate certificate manager also allows users export efs recovery certificates private keys users reminded back efs keys upon first use balloon notification rekeying wizard also used migrate users existing installations software certificates smart cards wizard also used administrator users recovery situations method efficient decrypting reencrypting files windows vista significantly improves firewall address number concerns around flexibility windows firewall corporate environment windows vista includes windows defender microsoft anti-spyware utility according microsoft renamed 'microsoft antispyware features scanning system spyware similar free products market also includes real time security agents monitor several common areas windows changes may caused spyware areas include internet explorer configuration downloads auto-start applications system configuration settings add-ons windows windows shell extensions windows defender also includes ability remove activex applications installed block startup programs also incorporates spynet network allows users communicate microsoft send consider spyware check applications acceptable windows vista allow administrators enforce hardware restrictions via group policy prevent users installing devices restrict device installation predefined white list restrict access removable media classes devices windows vista includes range parental controls non-domain user accounts parental controls allows administrators set restrictions monitor computer activity parental controls relies user account control much functionality features include features extensible replaced parental control applications using parental controls application programming interfaces apis windows vista uses address space layout randomization aslr load system files random addresses memory default system files loaded randomly possible 256 locations executables specifically set bit header portable executable pe file file format windows executables use aslr executables stack heap allocated randomly decided loading system files random addresses becomes harder malicious code know privileged system functions located thereby making unlikely predictably use helps prevent remote execution attacks preventing return-to-libc buffer overflow attacks portable executable format updated support embedding exception handler address header whenever exception thrown address handler verified one stored executable header match exception handled otherwise indicates run-time stack compromised hence process terminated function pointers obfuscated xor-ing random number actual address pointed hard retrieve would manually change pointer obfuscation key used pointer would hard retrieve thus made hard unauthorized user function pointer able actually use also metadata heap blocks xor-ed random numbers addition check-sums heap blocks maintained used detect unauthorized changes heap corruption whenever heap corruption detected application killed prevent successful completion exploit windows vista binaries include intrinsic support detection stack-overflow stack overflow windows vista binaries detected process killed used carry exploit also windows vista binaries place buffers higher memory non buffers like pointers supplied parameters lower memory area actually exploit buffer underrun needed gain access locations however buffer underruns much less common buffer overruns windows vista offers full support nx no-execute feature modern processors dep introduced windows xp service pack 2 windows server 2003 service pack 1 feature present nx evp amd amd64 processors xd edb intel processors flag certain parts memory containing data instead executable code prevents overflow errors resulting arbitrary code execution processor supports nx-bit windows vista automatically enforces hardware-based data execution prevention processes mark memory pages non-executable data segments like heap stack subsequently data prevented interpreted executed code prevents exploit code injected data executed dep enabled applications users gain additional resistance zero-day exploits applications dep-compliant generate dep exceptions therefore dep enforced applications default 32-bit versions windows turned critical system components however windows vista introduces additional nx policy controls allow software developers enable nx hardware protection code independent system-wide compatibility enforcement settings developers mark applications nx-compliant built allows protection enforced application installed runs enables higher percentage nx-protected code software ecosystem 32-bit platforms default system compatibility policy nx configured protect operating system components x86-64 applications backward compatibility issue therefore dep enforced default 64-bit programs also processor-enforced dep used x86-64 versions windows vista greater security new digital rights management content-protection features introduced windows vista help digital content providers corporations protect data copied inclusion new digital rights management features source criticism windows vista windows vista introduces mandatory integrity control set integrity levels processes low integrity process access resources higher integrity process feature used enforce application isolation applications medium integrity level applications running standard user context hook system level processes run high integrity level administrator mode applications hook onto lower integrity processes like windows internet explorer 7 8 lower privilege process perform window handle validation higher process privilege sendmessage postmessage higher privilege application windows use thread hooks attach higher privilege process use journal hooks monitor higher privilege process perform dll–injection higher privilege process windows service hardening compartmentalizes services one service compromised easily attack services system prevents windows services operations file systems registry networks supposed thereby reducing overall attack surface system preventing entry malware exploiting system services services assigned per-service security identifier sid allows controlling access service per access specified security identifier per-service sid may assigned service installation via changeserviceconfig2 api using sc.exe command sidtype verb services also use access control lists acl prevent external access resources private services windows vista also run less privileged account local service network service instead system account previous versions windows ran system services login session locally logged-in user session 0 windows vista session 0 reserved services interactive logins done sessions intended help mitigate class exploits windows message-passing system known shatter attacks process hosting service privileges specified requiredprivileges registry value hklm\system\currentcontrolset\services services also need explicit write permissions write resources per-service basis using write-restricted access token resources modified service given write access trying modify resource fails services also pre-configured firewall policy gives much privilege needed function properly independent software vendors also use windows service hardening harden services windows vista also hardens named pipes used rpc servers prevent processes able hijack graphical identification authentication gina used secure authentication interactive logon replaced credential providers combined supporting hardware credential providers extend operating system enable users log biometric devices fingerprint retinal voice recognition passwords pins smart card certificates custom authentication package schema third party developers wish create smart card authentication flexible certificate requirements relaxed enterprises may develop deploy optionally enforce custom authentication mechanisms domain users credential providers may designed support single sign-on sso authenticating users secure network access point leveraging radius technologies well machine logon credential providers also designed support application-specific credential gathering may used authentication network resources joining machines domain provide administrator consent user account control authentication also supported using ipv6 web services new security service provider credssp available security support provider interface enables application delegate user ’ credentials client using client-side ssp target server server-side ssp credssp also used terminal services provide single sign-on windows vista authenticate user accounts using smart cards combination passwords smart cards two-factor authentication windows vista also use smart cards store efs keys makes sure encrypted files accessible long smart card physically available smart cards used logon efs operates single sign-on mode uses logon smart card file encryption without prompting pin fast user switching limited workgroup computers windows xp also enabled computers joined domain starting windows vista windows vista also includes authentication support read-only domain controllers introduced windows server 2008 windows vista features update crypto api known cryptography api next generation cng cng api user mode kernel mode api includes support elliptic curve cryptography ecc number newer algorithms part national security agency nsa suite b extensible featuring support plugging custom cryptographic apis cng runtime also integrates smart card subsystem including base csp module implements standard backend cryptographic functions developers smart card manufacturers need write complex csps microsoft certificate authority issue ecc certificates certificate client enroll validate ecc sha-2 based certificates revocation improvements include native support online certificate status protocol ocsp providing real-time certificate validity checking crl prefetching capi2 diagnostics certificate enrollment wizard-based allows users input data enrollment provides clear information failed enrollments expired certificates certenroll new com-based enrollment api replaces xenroll library flexible programmability credential roaming capabilities replicate active directory key pairs certificates credentials stored stored user names passwords within network windows vista introduces network access protection nap ensures computers connecting communicating network conform required level system health set administrator network depending policy set administrator computers meet requirements either warned granted access allowed access limited network resources denied access completely nap also optionally provide software updates non-compliant computer upgrade level required access network using remediation server conforming client given health certificate uses access protected resources network network policy server running windows server 2008 acts health policy server clients need use windows xp sp3 later vpn server radius server dhcp server also act health policy server number specific security reliability changes made | [
4022,
363,
4759,
2380,
2999,
2644,
644,
5378,
1460,
6618,
6986,
6991,
1097,
5571,
7451,
5747,
3293,
3794,
1382,
5401,
6823,
1019,
5850,
7564,
7567,
4261,
2326,
8118,
7209,
7120,
6575,
522,
2791,
432,
5607,
435,
5880,
7688,
5440,
4836,
6... | Test |
1,419 | 2 | Citrus_Project:citrus project citrus comprehensive i18n framework towards respectable unix systems project aims implement complete multilingual programming environment bsd-based operating systems goals include creation following things freebsd netbsd openbsd bsd/os dragonfly bsd aim reach level functionality solaris 7 | [
3838,
5571,
3756,
1435,
6367
] | Validation |
1,420 | 9 | Class_variable:class variable object-oriented programming classes class variable variable declared codice_1 modifier single copy exists regardless many instances class exist note java terms field variable used interchangeably class variable instance variable special type class attribute class property field data member dichotomy instance class members applies methods member functions well class may instance methods class methods languages class variables class methods either statically resolved via dynamic dispatch memory statically allocated compile time entire class static variables dynamically allocated run time every instantiation object cases however either dynamic example classes dynamically defined run time class variables classes allocated dynamically class defined languages class methods also dispatched dynamically thus languages static member variable static member function used synonymously place class variable class function synonymous across languages terms commonly used java c c++ class variables class methods declared codice_1 keyword referred static member variables static member functions c++ example class variable codice_3 incremented call constructor codice_3 always holds number requests constructed new request object given codice_5 sequential order since codice_6 class variable one object codice_3 contrast request object contains distinct codice_5 field also note variable codice_3 initialized | [
1437,
1378,
5510,
1803,
6428,
4425
] | Test |
1,421 | 4 | IEC_60870-6:iec 60870-6 iec 60870 part 6 one iec 60870 set standards define systems used telecontrol supervisory control data acquisition electrical engineering power system automation applications iec technical committee 57 working group 03 developed part 6 provide communication profile sending basic telecontrol messages two systems compatible iso standards itu-t recommendations standards include typical national power grid includes hierarchy control centres manage generation transmission distribution power throughout grid prior development electronics telecommunications networks co-ordination control centres carried telephone however development scada supervisory control data acquisition systems allowed remote control monitoring electrical plant centralised control centres initially individual scada manufacturers developed proprietary closed protocols communicating control centre electrical equipment field followed development open industry-standard protocols dnp3 iec 61850 however none communication protocols suited requirements communicating control centres meet special requirements communication co-ordination control centres iec developed iec 60870 set standards inter-control center communications protocol iccp iec 60870-6/tase.2 specified utility organizations throughout world provide data exchange wide area networks wans utility control centers utilities power pools regional control centers non-utility generators iccp also international standard international electrotechnical commission iec telecontrol application service element 2 tase.2 inter-utility real time data exchange become critical operation interconnected systems parts world example development electricity markets seen management electricity networks functional hierarchy split across boundaries commercial entities top level typically system operator coordination responsibilities dispatch overall system security regional transmission companies tie together distribution companies generating companies continental power systems considerable interconnection across international borders iccp allows exchange real time historical power system information including status control data measured values scheduling data energy accounting data operator messages historically reliance custom proprietary links protocols exchange real time data systems iccp began effort develop international standard real-time data exchange within electric power utility industry working group formed 1991 develop protocol standard develop prototype test specification submit specification iec standardisation carry interoperability testing developing vendors initial driver meet european common market requirements 1992 official designation first protocol tase.1 telecontrol application service element-1 second protocol tase.2 making use manufacturing message specification mms appears version become popular us iccp networks widely used tie together groups utility companies typically regional system operator transmission utilities distribution utilities generators regional operators may also connected together co-ordinate import export power regions across major inter-ties basic iccp functionality specified “ conformance blocks ” listed objects used convey data defined various parts iec 60870-6 block description data examples iccp based client server principles data transfers result request control centre client another control centre server control centres may clients servers iccp operates physical interfaces transport network services fit model supported tcp/ip ethernet 802.3 seems common iccp may operate single point-to-point link two control centres however general case many control centres routed wide area network logical connections “ associations ” control centres completely general client may establish associations one server client may establish one association server multiple associations server established different levels quality service high priority real time data delayed lower priority non real time data transfers iccp provide authentication encryption services normally provided lower protocol layers iccp uses “ bilateral tables ” control access bilateral table represents agreement two control centres connected iccp link agreement identifies data elements objects accessed via link level access permitted iccp link established contents bilateral tables server client provide complete control accessible party must matching entries server client tables provide access data objects wide acceptance iccp utility industry resulted several iccp products market although interoperability regarded high risk area standard implementation support conformance blocks order claim compliance standard minimal implementation requires block 1 blocks necessary achieve required functionality need implemented also necessary support objects defined standard particular block extensive interoperability testing products major vendors feature iccp protocol development independent reports available doubt reports vendors iccp purchaser must define functionality required terms conformance blocks required objects within blocks application profiles iccp client server conformances must match link operate successfully iccp real time data exchange protocol providing features data transfer monitoring control complete iccp link need facilities manage configure link monitor performance iccp standard specify interface requirements features necessary nevertheless affect interoperability similarly failover redundancy schemes way scada responds iccp requests protocol issue specified non protocol specific features referred standard “ local implementation issues ” iccp implementers free handle issues way wish local implementation means developers differentiate product market added value additional money spent product well-developed maintenance diagnostic tools may well saved many times life product use iccp connection expected grow change commercial iccp products generally available one three configurations embedded protocol iccp management tools interfaces part complete suite tools scada configuration offers maximum performance direct access scada database without requiring intervening buffering approach may available addition legacy system iccp application may restricted accessing scada environment embedded networked server making use industry standard communications networking scada host may provide performance approaching embedded iccp application application interface side iccp restricted scada environment open systems separate data historian databases security may easier manage iccp server segregated operational real time systems gateway processor approach similar networked server except intended legacy systems minimal communications networking capability lowest performance minimal situation iccp gateway may communicate scada host via serial port similar manner scada rtus | [
2877,
1774,
7876,
1484,
3078,
6208,
2566,
6172,
3794,
38
] | Validation |
1,422 | 1 | Digital_Scriptorium:digital scriptorium digital scriptorium ds non-profit tax-exempt consortium american libraries collections pre-modern manuscripts manuscripts made tradition books printing ds database represents manuscript collections web-based union catalog teaching scholarly research medieval renaissance studies provides access illuminated textual manuscripts online cataloging records supported high resolution digital images retrievable various topic searches ds database open access resource enables users study rare valuable materials academic research public libraries makes available collections often restricted public access includes famous masterpieces book illumination also understudied manuscripts previously overlooked publication study funded grants andrew w. mellon foundation national endowment humanities gladys krieble delmas foundation ds inception 1997 joint project bancroft library university california berkeley prof. charles faulhaber rare book manuscript library columbia university dr. consuelo w. dutschke plan digitize make available world wide web catalog records selected images two universities medieval early renaissance manuscript collections decision favor sample images rather complete imaging manuscripts originally practical today ds includes records sample complete imaging records sample images offer various pathways entrance growing corpus medieval renaissance manuscripts available online patterns collecting 19th early 20th century moreover many manuscripts american collections comprise partial texts detached single leaves cataloging many fragmentary works possible increases chance manuscripts could reconstituted virtually thus philosophical principle ds includes large small collections complete bound books single leaves 1999 2002 additional holdings huntington library university texas austin new york public library incorporated along number smaller collections database continued grow represents collections thirty member institutions including substantial repositories harvard university houghton library yale university beinecke library university pennsylvania also libraries rare works providence public library owns unusual 15th century bible wetmore ms 1 rebus format september 2015 ds counts catalog records 8,390 manuscripts 47,624 digitized images digital scriptorium database enables public viewing non-circulating materials normally available specialists restricted access visual catalog ds allows scholars verify cataloguing information places dates origin scripts artists quality special emphasis placed touchstone materials manuscripts signed dated scribes thus beginning american contribution goal established 1953 comité international de paléographie latine international committee latin paleography document photographically proportionately small number codices certain origin serve stylistically localize date vast quantities unsigned manuscripts ds publishes manuscripts firm attribution also ones need attention scholarship traditionally would unlikely candidates reproduction web-based also allows updates corrections matter form individual records ds acknowledge contributions outside scholars ds consortium consists academic public rare book libraries encourages broad audience benefits reciprocally beneficial body knowledge attending needs community specialists medievalists classicists musicologists paleographers diplomatists literary scholars art historians ds also recognizes public user community values rare unique works historical literary artistic significance working together ds consortium expanded resources libraries manage collections rare materials providing digital cataloging standard pre-modern manuscripts ds record includes extensive granular descriptive metadata supported high resolution digital images medieval renaissance manuscripts best served format-specific cataloging sensitive complexity hand-made books historical artifacts differ modern manuscripts letters personal records although unique objects usually unique texts may written bound decorated hand pre-modern manuscripts books text fourteenth-century missal example identified using early twentieth-century printed version text several collections may one manuscript st. augustine ’ de civitate dei city god ds search title fact retrieves fourteen copies work unique manuscripts dating 12th 15th centuries owned eight different libraries potential relationships among manuscripts means item-level bibliographic cataloging rather collection-based archival cataloging best identifies describes content medieval renaissance manuscripts works also historical artifactual significance catalog records medieval renaissance manuscripts need describe contents also complete provenance chain ownership binding may later period rest book marks ownership coats-of-arms physical condition material support usually parchment foliation construction book layout text attribution script date often estimated style localization decoration painted illustration names authors craftsmen scribes artists owners scholars medieval renaissance manuscripts less interested text manuscript aspect production field art history offers striking example scholar studying art illuminator mariano del buono care equally harvard manuscript copy plato manuscript held new york public library copy livy ds records factor interests allow searching physical features whether artist name example place date origin italy 1450-1499 would produce result digitization records medieval renaissance manuscripts excluded library public access catalogs instead published printed books written scholar-specialists similarly trained audience compared ds records similar library cataloging records simplified standardized concise specialists may notice ds record omits information collation available scholarly catalogs order avoid descriptions would take much time discourage library catalogers attempting task agreement green meisner goal product less process spanish proverb goes lo mejor es enemigo de lo bueno ds record thus intended serve ideal thorough description manuscript rather practical surrogate still provides better representation typical content-based opac online public access catalog record compared marc marc standards bibliographic standards used american libraries ds better designed describe content also historical context physical characteristics using sample images support descriptions sample images contain inherently descriptive information ds records include digital images although exceptions although ds records adapted marc formats ds better captures complexity medieval renaissance manuscripts marc example ds nests sections descriptive metadata order catalog manuscript multiple texts multiple origins one binding marc provides flat file deal coterminous text physical unit ds also indexes specific information pertinent format separate field artist example rather one personal names ds also creates focused records compared archival cataloging based ead encoded archival description latter collections-based designed descriptive searched item level thus ds cataloging method become unofficial library standard online cataloging medieval renaissance manuscripts united states university california berkeley provided first home ds database terms managing project devising initial technology interim period time 2003–2011 ds hosted columbia university returned original home berkeley technical innovations produced teams originating universities created digital product based progressive standards-based digitization policy originally using microsoft access serve cross-institutional data collection tool ds database used sgml later xml aggregate query combined information present platform managed u.c berkeley depends upon software known webgendb webgendb non-proprietary web-based interface underlying control database gendb gendb houses descriptive structural administrative metadata materials digitized web presentation outputs metadata using metadata encoding transmission standard mets format mets provides xml schema-based specification encoding hub documents materials whose content digital hub document draws together potentially dispersed related files data mets uses xml provide flexible vocabulary syntax identifying digital components together comprise digital object specifying location components expressing structural relationships digital components comprising digital object could include content files descriptive metadata administrative metadata mets used transfer dissemination and/or archiving digital objects compliance oais open archival information system reference model developed oclc ds reliance oais iso 14721 2003 promises secure digital preservation policy supported california digital library digital curation services cdl merritt digital archive | [
5252
] | Test |
1,423 | 3 | Survivor_(1987_video_game):survivor 1987 video game survivor action game released 1987 spanish software house topo soft later re-released uk u.s. gold published several 8-bit formats including amstrad cpc msx zx spectrum player takes control alien bears striking resemblance race aliens alien series films aboard huge spacecraft filled many extraterrestrial creatures player must perpetuate alien race finding ten pods ship introducing incubators ship split 142 areas divided four zones zones joined doors air-vents player crawl zones also consist different levels connected lifts pods found large rooms different corridors vents make much spacecraft closely resemble sort room found 1980s platform games creatures ship dangerous player spit paralysing acid player limited amount energy sapped hostile creatures ship defence systems energy replenished managing place pod incubator eating one technicians found wandering around ship | [] | Test |
1,424 | 4 | Computer_Underground_Digest:computer underground digest computer underground digest cud weekly online newsletter early internet cultural social legal issues published gordon meyer jim thomas march 1990 march 2000 meyer thomas criminal justice professors northern illinois university intended newsletter cover topical social legal issues generated rise telecommunications internet existed primarily email mailing list usenet though archives later provided website newsletter came prominence published legal commentary updates concerning hacker crackdowns federal indictments leonard rose craig neidorf phrack cud published commentary membership subjects including legal social implications growing internet later web book reviews topical publications many off-topic postings readership overtaken growth online forums web ceased publication march 2000 | [
3486,
84
] | Test |
1,425 | 4 | Internet_Security_Research_Group:internet security research group internet security research group isrg californian public-benefit corporation focuses internet security let encrypt—its first major initiative—aims make transport layer security tls certificates available free automated fashion josh aas serves group executive director board chair board also contains individuals akamai cisco university michigan mozilla aclu coreos electronic frontier foundation | [
2789,
363,
4071,
4783,
1401
] | Test |
1,426 | 2 | UNIX/32V:unix/32v unix/32v early version unix operating system bell laboratories released june 1979 32v direct port seventh edition unix dec vax architecture 32v unix primarily run dec pdp-11 computers bell labs group developed operating system dissatisfied dec members refused dec offer buy vax machine announced 1977 already begun unix port interdata 8/32 instead dec approached different bell labs group holmdel new jersey accepted offer started work become 32v performed tom london john f. reiser porting unix made possible due work done sixth seventh editions operating system decouple native pdp-11 environment 32v team first ported c compiler johnson pcc adapting assembler loader written interdata 8/32 version unix vax ported april 15 1978 version unix finding process bourne shell ... required far largest conversion effort supposedly portable program simple reason portable unix/32v released without paging virtual memory retaining swapping architecture seventh edition virtual memory system added berkeley bill joy özalp babaoğlu order support franz lisp released unix licensees third berkeley software distribution 3bsd 1979 thanks popularity two systems successors 4bsd unix system v unix/32v antecedent nearly modern unix systems | [
361,
4751,
4478,
4670,
8066,
1824,
900,
2467,
6267,
908,
5216,
2294,
5571,
2300,
2118,
6360,
578,
6367,
6470,
1493,
8117,
4447,
6577,
6583,
5348,
443,
1435
] | Test |
1,427 | 3 | Linux_kernel_mailing_list:linux kernel mailing list linux kernel mailing list lkml main electronic mailing list linux kernel development majority announcements discussions debates flame wars kernel take place many mailing lists exist discuss different subsystems ports linux kernel lkml principal communication channel among linux kernel developers high-volume list usually receiving 1,000 messages day kernel code patches linux utilizes workflow governed lkml bazaar kernel development takes place book linux kernel development robert love notes lkml functions central place linux developers around world share patches argue implementation details discuss issues official releases linux kernel indicated email lkml new features discussed code posted list action taken also official place reporting bugs linux kernel case one find maintainer bug reported author michelle delio suggests lkml tux official linux mascot suggested refined although accuracy reporting stories disputed many companies associated linux kernel make announcements proposals lkml example novell intel vmware ibm etc list subscribers include linux kernel maintainers well known figures linux circles jeff v. merkey eric s. raymond etc. 2000 study found 14,535 people least 30 different countries sent least one email lkml 1995 2000 participate discussion linux development authors books linux kernel development model open source knowledge creation motivation software developers open source projects recovering device drivers made use lkml research studies surveys lwn.net website frequently cover discussion lkml newsletter kernel traffic covered activities linux-kernel mailing list november 2005 many internet websites include archives mailing list lore.kernel.org/lkml lkml.org mail-archive.com marc.info linus torvalds known angrily disagreeing developers lkml calling really unpleasant person later explained 'd like nice person curse less encourage people grow rather telling idiots 'm sorryi tried attitude torvalds considers necessary making point clear drawn opposition intel programmer sage sharp systemd developer lennart poettering among others 2018 torvalds took break kernel development work improving behavior instituted code conduct | [
3256,
4295,
2182,
3613,
7528,
7532,
2559,
5744,
6443,
2942,
7555,
6117,
4341,
5762,
412,
415,
3666,
5783,
2970,
7956,
5453,
5803,
4387,
5460,
7242,
1535,
1924,
6892,
1176,
1933,
5829,
1208,
6211,
4435,
5865,
7669,
3404,
1227,
1596,
165,
... | Test |
1,428 | 3 | Compaq_Presario_2700:compaq presario 2700 presario 2700 series series laptop models released compaq computer corporation specific models series include presario 2700us 2701us 2710us presario 2700us released september 2001 featured intel pentium iii 256mb ram default upgradeable 1024mb 2700us also featured maximum screen resolution 1600 1200 pixels released january 2002 presario 2710us shipped 1.13ghz pentium 3 processor ati mobility radeon m6 graphics card 8mb video memory | [
4736
] | Test |
1,429 | 9 | Java_Platform_Module_System:java platform module system java platform module system specifies distribution format collections java code associated resources also specifies repository storing collections modules identifies discovered loaded checked integrity includes features namespaces aim fixing shortcomings existing jar format especially jar hell lead issues classpath class loading problems java module system initially developed java community process jsr 277 scheduled released java 7 jsr 277 later put hold project jigsaw created modularize jdk jsr superseded jsr 376 java platform module system project jigsaw originally intended java 7 2011 deferred java 8 2014 part plan b deferred java 9 release 2017.. java 9 including java module system released september 21 2017 java module system implemented java 9 include following jeps jsr java specification request additionally several jdk 9 features added ease transition module system modules new way grouping code data contrary jar files modules explicitly declare modules depend packages export example following module declaration declares module com.foo.bar depends another com.foo.baz module exports following packages com.foo.bar.alpha com.foo.bar.beta contrary jar file format module describe dependencies module declaration placed file named module-info.java root module ’ source-file hierarchy jdk able check compile-time runtime jdk modularized java 9 java module system intend support functionalities osgi platform currently supports example life-cycle model services registry however java module system support functions supported osgi modularity compile-time built-in support native libraries couple articles exploring java module system osgi could interoperate published 2016 found infoq also osgi alliance blog | [
5655
] | Test |
1,430 | 3 | XCore_Architecture:xcore architecture xcore architecture 32-bit risc microprocessor architecture designed xmos architecture designed used multi-core processors embedded systems xcore executes eight concurrent threads thread register set architecture directly supports inter-thread inter-core communication various forms thread scheduling two versions xcore architecture exist xs1 architecture xs2 architecture processors xs1 architecture include xcore xs1-g4 xcore xs1-l1 processors xs2 architecture include xcore-200 architecture encodes instructions compactly using 16 bits frequently used instructions three operands 32 bits less frequently used instructions 6 operands almost instructions execute single cycle architecture event-driven order decouple timings program needs make execution speed program program normally perform computations wait event e.g message time external i/o event continuing two versions xcore architecture xs1 xs2 xs2 extending xs1 architecture xs1 architecture first xcore architecture defined 2007 implemented xcore xs1-g4 xcore xs1-l1 xcore xs1-su xcore xs1-ana former four-core processing node latter three single dual core processing nodes xs2 architecture defined 2015 implemented xcore-voice processors xcore-200 series processors latter marketed xl2 series general purpose xu2 series usb xe2 series rgmii versions embedded flash xs2 extends xs1 architecture limited form dual issue execution processor core comprises two lanes resource lane execute io operations general arithmetic memory lane execute memory operations branches general arithmetic short resource arithmetic instructions executed resource lane short memory branch arithmetic operations executed memory lane long instructions span lanes dual issue mode pairs instructions aligned 32-bit boundary instructions added aid high bandwidth processing dual-word load/store dual-word zip unzip bit byte strings dual word arithmetic saturation shift architecture comprises central execution unit operates set 25 registers surrounded number resources perform operations interact environment thread set hardware registers enabling threads execute concurrently instruction set comprises less standard sequential programming model instructions implement multi-threading multi-core i/o operations instructions access 12 general-purpose registers r0–r11 general completely interchangeable except instructions use r11 implicitly also 4 base registers usable instructions registers 16 24 accessible specialized instructions except first two r16 pc program counter r17 sr status register dedicated exception interrupt handling status register contains various mode bits processor standard alu result flags like carry zero negative overflow add subtract carry instructions exist specify five operand registers two inputs input carry one output output carry instructions 16-bit 32-bit encoding instructions use zero six operands common arithmetic operations add sub mult three-operand instructions based set 12 general purpose registers last four forms share opcode range number operands determined bits 5 10 last three forms use bit 4 additional opcode bit last form uses bits 1 0 well second form instructions loads stores use four bits encode register number allowing access r12–r15 instructions conditional branches allow register numbers 11 instead allowing third form share opcode range constants always unsigned many instructions come add/subtract pairs e.g jump forward backward form instruction determined four most-significant bits encoding three-operand register opcodes quite unusual since 12 registers power 2 encoding used fits zero three operands number operands 11 bits thus 5-bit opcode assigned four times three-operand instruction two-operand etc cases low 2 bits register number placed 2-bit field reducing problem encoding high bits range 0 2 three-operand form places low register numbers low 6 instruction bits high 2 bits register number combined base-3 number 0 26 using 9× +3× b c stored remaining 5 bits two-operand form uses unused 5 combinations 27–31 5-bit field operand used 2-bit field low bits reassigned one bit used additional opcode bit used additional combination register specifier doubling number available combinations 10 allowing 9 combinations 3× b c represented done manner similar bi-quinary coded decimal combination modulo 5 stored 5-bit field 3× b c mod 5 27 1-bit quotient ⌊ 3× b c /5⌋ stored instruction bit 5 marked asterisk table one-operand instructions use tenth combination value 6 bits set place register number 4 available bits operand c specified high bits stored b field finally one-operand encoding register number 12 b field contains binary 11 also used encode zero-operand instructions two low-order bits c field available additional opcode bits bringing total 8 instructions use register c field value 0–11 small immediate constant use select one 12 convenient bit-shift constants 0–8 16 24 32 less frequently used instructions encoded 32 bits 32-bit instructions allow 16- 20-bit immediate operands far branches six register operands example long multiply four source two destination operands additional opcode space rarely used instructions one 10-bit immediate opcode pfix opcode 111100 used add additional 10 bits 6- 10-bit immediate following instruction one three-operand opcode eopr opcode 11111 reserved additional operands prefix 3 operands used along following instruction word produce additional 32-bit instructions six operands also used rarely used three- two-operand instructions cases eopr specifies three two operands following instruction word zero-operand instruction two-operand case extra opcode bit leading eopr used thread access 12 general purpose registers r0 ... r11 addition 4 special purpose registers sp lr link register stores return address cp constant pool points part memory stores constants dp data pool points global variables addition 16 another 9 registers store pc kernel pc exception type exception data saved copies case exception interrupt instruction set load-store instruction set almost instructions execute single cycle instruction need data memory example arithmetic operations instruction prefetch word instructions instructions encoded 16-bits instructions loads stores typical number 20 loads stores 80 instructions prefetch mechanism stay ahead instructions stream acts like small instruction cache behaviour predicted compile time making timing behaviour predictable functional behaviour instructions access memory use base register sp dp cp pc general purpose register single 16-bit instruction thread access larger sections memory accessed means extended instructions extend ranges 64 kbytes scheme designed order densely encode common cases found many programming patterns access small stack frames small set globals constants structures arrays access bit fields odd length facilitated means sign zero extend instructions common arithmetic instructions provided including divide remainder instructions single cycle comparison instructions compute truth value 0 1 register avoiding use flags many instructions immediate version allows single operand value 0 11 inclusive encoding many common cases 1 case bit operations shift immediate value encodes common cases extra instructions provided reversing bits bytes count leading zeros digital signal processing long integer arithmetic branch instructions include conditional unconditional relative branches branch using address register provided relative branch adds scaled register operand program counter provided support jump tables branches instructions distance encoded single word procedure calling instructions include relative calls calls via constant pool indexed calls via dedicated register calls via register calls within single program module encoded single instruction inter-module calling requires two instructions callee save link-register leaf-function single instruction extends stack saves link register dual issue mode available xs2 enables one short load store branch instruction paired one short resource instruction short arithmetic instructions paired instruction enables inner-loops example transfer data memory io halved length issuing load instruction together add instruction change counter together branch instruction xs1 instruction set designed support multi threading multi-core computations extent supports channel communication support distributed memory computations barriers locks support shared memory computations thread initiates execution one newly allocated threads setting initial register values communication threads performed using channels provide full-duplex data transfer channel-ends enables amongst others implementation csp based languages languages based pi calculus instruction set agnostic channel connected whether inside core outside core channels carry messages constructed data control tokens two channel ends control tokens used encode communication protocols channel ends buffer able hold sufficient tokens allow least one word buffered output instruction executed channel full take data thread executed instruction paused restarted enough room channel instruction successfully complete likewise input instruction executed enough data available thread paused restarted enough data becomes available thread single instruction synchronise group threads using barrier synchronisation alternatively thread synchronise using lock providing mutual exclusion order communicate data using barriers locks threads either write data registers another thread access memory another thread provided threads execute core shared memory used compiler programmer must ensure race conditions xs2 architecture 'priority mode enables threads run high priority low priority threads guaranteed progress high priority threads guaranteed thread cycle ready execute xs1 architecture event-driven instruction dispatch external events addition traditional interrupts program chooses use events underlying processor expect event wait specific place handled synchronously desired i/o handled asynchronously using interrupts events interrupts used resource implementation supports common resources supported ports external input output timers allow timing reference clock channels allow communication synchronization threads within core threads different cores locks allow controlled access shared memory synchronizers implement barrier synchronizations threads | [
5893,
895,
6177,
6982,
3531,
4408,
7541,
3014,
1556,
2929,
7453,
5055,
4251,
2130,
2226,
6922,
1772,
5614,
6236,
7412,
534,
971,
2443
] | Validation |
1,431 | 7 | Meta-scheduling:meta-scheduling meta-scheduling super scheduling computer software technique optimizing computational workloads combining organization multiple distributed resource managers single aggregated view allowing batch jobs directed best location execution meta-scheduling technique solution scheduling set depended independent faults different scenarios mapping modeling event-tree used dynamic static scheduling method work use static scheduling adaptive tt mpsoc systems meta-scheduling described technique optimize computational workload combining organizing multiple distributed resources integrated view words extended data-flow model quasi-static scheduling dynamic behaviour changes scenario-based multi-mode approaches essential techniques embedded-systems e.g. design space exploration mpsocs reconfigurable systems optimization techniques generation schedule graphs supporting sbmes approach developed implemented sbmes promise better performance reducing dynamic scheduling overhead recovering faults following partial list noteworthy open source commercial meta-schedulers currently available | [
72,
2651,
5604,
1256
] | Test |
1,432 | 3 | Processor_Control_Region:processor control region processor control region pcr windows kernel mode data structure contains information current processor accessed via fs segment register x86 versions gs segment register x64 versions respectively windows pcr known kpcr contains information current processor pcr contains substructure called processor control block kprcb contains information cpu step pointer thread object current thread | [
1237,
4759,
1248
] | Test |
1,433 | 9 | SystemBuilder/SB+:systembuilder/sb+ systembuilder 4gl development runtime environment originally written pick family computer databases/environments part rocket u2 software suite systembuilder environment comprises sb+ server often running rocket u2 database sbclient runs microsoft windows desktop application product run either developer runtime mode development environment enables rapid prototyping development deployment applications includes rudimentary gui application environment system builder started garden shed south africa first cousins neill derek miller 1982 popularity pick database system combined lack good development framework led develop tool build standard menus screens system builder software company incorporated isle man cousins moved sydney australia early 1980s product successful expanding international markets versions began re-develop product ground become sb+ released early 1990 traditionally time pick systems accessed using dumb green-screen terminals rise pc new paradigm presented around end 1991 product enhanced addition specialised terminal emulation client called termulator able tightly integrate server pc allow facilities like downloads direct server lotus 1-2-3 new kid block microsoft excel shortly client program renamed sbclient ability render server 'green-screens client gui screens added clever set driver interpreters bought unidata corporation 1996 following unidata merger vmark software form ardent software 1998 systembuilder product set came ownership informix 2000 following purchase ardent software datastage product subsequently 2001 informix bought ibm u2 systembuilder products eventually found way become part ibm data management portfolio development systembuilder redback products continued sydney 2005 merged u2 development team located denver united states recently 1 october 2009 rocket software announced purchase entire u2 suite includes systembuilder ibm system builder/sb+ server environment based around set key tools utilities leverage provide powerful comprehensive development environment built mainly tools sb+ includes application menuing system screen generator 3gl programming language expression language gui components report writer tool recent iteration system builder sb/xa v6.5.2 released oct 2017 sb/xa includes many major enhancements including new gui system based xaml | [
4798,
2866,
4759,
5810
] | Test |
1,434 | 2 | Dnotify:dnotify dnotify file system event monitor linux kernel one subfeatures fcntl call introduced 2.4 kernel series obsoleted inotify retained compatibility reasons function essentially extension filesystems notice changes filesystem report changes applications instead application checking changes filesystem application register notified kernel changes filesystem occur application select directories monitor types changes notified one major use desktop search utilities like beagle functionality permits reindexing changed files without scanning filesystem changes every minutes would inefficient told file changed directly kernel rather actively looking beagle utilities achieve change-to-reindexing times second small performance hits dnotify therefore enables use programs sensible manner daemons generally accepted distributors drain system performance noticeably provide userland functionality | [
3256,
2182,
3613,
7528,
7532,
5744,
6443,
2942,
6117,
4341,
5762,
412,
415,
3666,
2970,
7956,
5453,
5460,
7242,
6883,
1535,
1924,
6892,
1176,
1933,
5829,
1208,
6211,
4435,
5865,
7669,
3404,
1227,
1596,
165,
7312,
1607,
5884,
1991,
890,
... | Test |
1,435 | 9 | C_(programming_language):c programming language c letter c general-purpose procedural computer programming language supporting structured programming lexical variable scope recursion static type system prevents unintended operations design c provides constructs map efficiently typical machine instructions found lasting use applications previously coded assembly language applications include operating systems well various application software computers ranging supercomputers embedded systems c originally developed bell labs dennis ritchie 1972 1973 make utilities running unix later applied re-implementing kernel unix operating system 1980s c gradually gained popularity nowadays one widely used programming languages c compilers various vendors available majority existing computer architectures operating systems c standardized ansi since 1989 see ansi c subsequently international organization standardization c imperative procedural language designed compiled using relatively straightforward compiler provide low-level access memory provide language constructs map efficiently machine instructions require minimal runtime support despite low-level capabilities language designed encourage cross-platform programming standards-compliant c program written portability mind compiled wide variety computer platforms operating systems changes source code language become available various platforms embedded microcontrollers supercomputers like procedural languages algol tradition c facilities structured programming allows lexical variable scope recursion static type system prevents unintended operations c executable code contained within subroutines also called functions though strictly sense functional programming function parameters always passed value pass-by-reference simulated c explicitly passing pointer values c program source text free-format using semicolon statement terminator curly braces grouping blocks statements c language also exhibits following characteristics c include certain features found languages object orientation garbage collection implemented emulated often use external libraries e.g. glib object system boehm garbage collector many later languages borrowed directly indirectly c including c++ c unix c shell go java javascript limbo lpc objective-c perl php python rust swift verilog systemverilog hardware description languages languages drawn many control structures basic features c. python dramatic exception also express highly similar syntax c tend combine recognizable expression statement syntax c underlying type systems data models semantics radically different origin c closely tied development unix operating system originally implemented assembly language pdp-7 dennis ritchie ken thompson incorporating several ideas colleagues eventually decided port operating system pdp-11 original pdp-11 version unix developed assembly language thompson needed programming language make utilities first tried make fortran compiler soon gave idea made new language b thompson simplified version bcpl however utilities written b b slow b could take advantage pdp-11 features byte addressability 1972 ritchie started improve b resulted creating new language c. c compiler utilities made included version 2 unix version 4 unix released nov. 1973 unix kernel extensively re-implemented c. time c language acquired powerful features codice_12 types unix one first operating system kernels implemented language assembly earlier instances include multics system written pl/i master control program mcp burroughs b5000 written algol 1961 around 1977 ritchie stephen c. johnson made changes language facilitate portability unix operating system johnson portable c compiler served basis several implementations c new platforms 1978 brian kernighan dennis ritchie published first edition c programming language book known c programmers k r served many years informal specification language version c describes commonly referred k r c second edition book covers later ansi c standard described k r introduced several language features even publication 1989 ansi standard many years k r c still considered lowest common denominator c programmers restricted maximum portability desired since many older compilers still use carefully written k r c code legal standard c well early versions c functions return types codice_30 must declared used function definition functions used without prior declaration presumed return type codice_30 example codice_30 type specifiers commented could omitted k r c required later standards since k r function declarations include information function arguments function parameter type checks performed although compilers would issue warning message local function called wrong number arguments multiple calls external function used different numbers types arguments separate tools unix lint utility developed among things could check consistency function use across multiple source files years following publication k r c several features added language supported compilers particular pcc vendors included large number extensions lack agreement standard library together language popularity fact even unix compilers precisely implemented k r specification led necessity standardization late 1970s 1980s versions c implemented wide variety mainframe computers minicomputers microcomputers including ibm pc popularity began increase significantly 1983 american national standards institute ansi formed committee x3j11 establish standard specification c. x3j11 based c standard unix implementation however non-portable portion unix c library handed ieee working group 1003 become basis 1988 posix standard 1989 c standard ratified ansi x3.159-1989 programming language c version language often referred ansi c standard c sometimes c89 1990 ansi c standard formatting changes adopted international organization standardization iso iso/iec 9899:1990 sometimes called c90 therefore terms c89 c90 refer programming language ansi like national standards bodies longer develops c standard independently defers international c standard maintained working group iso/iec jtc1/sc22/wg14 national adoption update international standard typically occurs within year iso publication one aims c standardization process produce superset k r c incorporating many subsequently introduced unofficial features standards committee also included several additional features function prototypes borrowed c++ codice_15 pointers support international character sets locales preprocessor enhancements although syntax parameter declarations augmented include style used c++ k r interface continued permitted compatibility existing source code c89 supported current c compilers c code written today based program written standard c without hardware-dependent assumptions run correctly platform conforming c implementation within resource limits without precautions programs may compile certain platform particular compiler due example use non-standard libraries gui libraries reliance compiler- platform-specific attributes exact size data types byte endianness cases code must compilable either standard-conforming k r c-based compilers codice_38 macro used split code standard k r sections prevent use k r c-based compiler features available standard c. ansi/iso standardization process c language specification remained relatively static several years 1995 normative amendment 1 1990 c standard iso/iec 9899/amd1:1995 known informally c95 published correct details add extensive support international character sets c standard revised late 1990s leading publication iso/iec 9899:1999 1999 commonly referred c99 since amended three times technical corrigenda c99 introduced several new features including inline functions several new data types including codice_39 codice_40 type represent complex numbers variable-length arrays flexible array members improved support ieee 754 floating point support variadic macros macros variable arity support one-line comments beginning codice_41 bcpl c++ many already implemented extensions several c compilers c99 part backward compatible c90 stricter ways particular declaration lacks type specifier longer codice_30 implicitly assumed standard macro codice_43 defined value codice_44 indicate c99 support available gcc solaris studio c compilers support many new features c99 c compiler microsoft visual c++ however implements c89 standard parts c99 required compatibility c++11 2007 work began another revision c standard informally called c1x official publication 2011-12-08 c standards committee adopted guidelines limit adoption new features tested existing implementations c11 standard adds numerous new features c library including type generic macros anonymous structures improved unicode support atomic operations multi-threading bounds-checked functions also makes portions existing c99 library optional improves compatibility c++ standard macro codice_43 defined codice_46 indicate c11 support available published june 2018 c18 current standard c programming language introduces new language features technical corrections clarifications defects c11 standard macro codice_43 defined codice_48 historically embedded c programming requires nonstandard extensions c language order support exotic features fixed-point arithmetic multiple distinct memory banks basic i/o operations 2008 c standards committee published technical report extending c language address issues providing common standard implementations adhere includes number features available normal c fixed-point arithmetic named address spaces basic i/o hardware addressing c formal grammar specified c standard line endings generally significant c however line boundaries significance preprocessing phase comments may appear either delimiters codice_49 codice_50 since c99 following codice_41 end line comments delimited codice_49 codice_50 nest sequences characters interpreted comment delimiters appear inside string character literals c source files contain declarations function definitions function definitions turn contain declarations statements declarations either define new types using keywords codice_12 codice_35 codice_14 assign types perhaps reserve storage new variables usually writing type followed variable name keywords codice_57 codice_30 specify built-in types sections code enclosed braces codice_59 codice_60 sometimes called curly brackets limit scope declarations act single statement control structures imperative language c uses statements specify actions common statement expression statement consisting expression evaluated followed semicolon side effect evaluation functions may called variables may assigned new values modify normal sequential execution statements c provides several control-flow statements identified reserved keywords structured programming supported codice_61 -codice_62 conditional execution codice_63-codice_4 codice_4 codice_2 iterative execution looping codice_2 statement separate initialization testing reinitialization expressions omitted codice_68 codice_69 used leave innermost enclosing loop statement skip reinitialization also non-structured codice_70 statement branches directly designated label within function codice_5 selects codice_72 executed based value integer expression expressions use variety built-in operators may contain function calls order arguments functions operands operators evaluated unspecified evaluations may even interleaved however side effects including storage variables occur next sequence point sequence points include end expression statement entry return function call sequence points also occur evaluation expressions containing certain operators codice_73 codice_10 codice_75 comma operator permits high degree object code optimization compiler requires c programmers take care obtain reliable results needed programming languages kernighan ritchie say introduction c programming language c like language blemishes operators wrong precedence parts syntax could better c standard attempt correct many blemishes impact changes already existing software basic c source character set includes following characters newline indicates end text line need correspond actual single character although convenience c treats one additional multi-byte encoded characters may used string literals entirely portable latest c standard c11 allows multi-national unicode characters embedded portably within c source text using codice_83 codice_84 encoding codice_85 denotes hexadecimal character although feature yet widely implemented basic c execution character set contains characters along representations alert backspace carriage return run-time support extended character sets increased revision c standard c89 32 reserved words also known keywords words used purposes predefined c99 reserved five words c11 reserved seven words recently reserved words begin underscore followed capital letter identifiers form previously reserved c standard use implementations since existing program source code using identifiers would affected c implementations started supporting extensions programming language standard headers define convenient synonyms underscored identifiers language previously included reserved word called codice_130 seldom implemented removed reserved word c supports rich set operators symbols used within expression specify manipulations performed evaluating expression c operators c uses operator codice_136 used mathematics express equality indicate assignment following precedent fortran pl/i unlike algol derivatives c uses operator codice_156 test equality similarity two operators assignment equality may result accidental use one place many cases mistake produce error message although compilers produce warnings example conditional expression codice_176 might mistakenly written codice_177 evaluated true codice_76 zero assignment c operator precedence always intuitive example operator codice_156 binds tightly executed prior operators codice_9 bitwise codice_149 bitwise expressions codice_182 must written codice_183 coder intent hello world example appeared first edition k r become model introductory program programming textbooks regardless programming language program prints hello world standard output usually terminal screen display original version main standard-conforming hello world program int main void first line program contains preprocessing directive indicated codice_184 causes compiler replace line entire text codice_185 standard header contains declarations standard input output functions codice_186 codice_187 angle brackets surrounding codice_185 indicate codice_185 located using search strategy prefers headers provided compiler headers name opposed double quotes typically include local project-specific header files next line indicates function named codice_190 defined codice_190 function serves special purpose c programs run-time environment calls codice_190 function begin program execution type specifier codice_30 indicates value returned invoker case run-time environment result evaluating codice_190 function integer keyword codice_15 parameter list indicates function takes arguments opening curly brace indicates beginning definition codice_190 function next line calls diverts execution function named codice_186 case supplied system library call codice_186 function passed provided single argument address first character string literal codice_199 string literal unnamed array elements type codice_57 set automatically compiler final 0-valued character mark end array codice_186 needs know codice_202 escape sequence c translates newline character output signifies end current line return value codice_186 function type codice_30 silently discarded since used careful program might test return value determine whether codice_186 function succeeded semicolon codice_206 terminates statement closing curly brace indicates end code codice_190 function according c99 specification newer codice_190 function unlike function implicitly return value codice_80 upon reaching codice_60 terminates function formerly explicit codice_211 statement required interpreted run-time system exit code indicating successful execution type system c static weakly typed makes similar type system algol descendants pascal built-in types integers various sizes signed unsigned floating-point numbers enumerated types codice_14 integer type codice_57 often used single-byte characters c99 added boolean datatype also derived types including arrays pointers records codice_12 unions codice_35 c often used low-level systems programming escapes type system may necessary compiler attempts ensure type correctness expressions programmer override checks various ways either using type cast explicitly convert value one type another using pointers unions reinterpret underlying bits data object way find c declaration syntax unintuitive particularly function pointers ritchie idea declare identifiers contexts resembling use declaration reflects use c usual arithmetic conversions allow efficient code generated sometimes produce unexpected results example comparison signed unsigned integers equal width requires conversion signed value unsigned generate unexpected results signed value negative c supports use pointers type reference records address location object function memory pointers dereferenced access data stored address pointed invoke pointed-to function pointers manipulated using assignment pointer arithmetic run-time representation pointer value typically raw memory address perhaps augmented offset-within-word field since pointer type includes type thing pointed expressions including pointers type-checked compile time pointer arithmetic automatically scaled size pointed-to data type pointers used many purposes c. text strings commonly manipulated using pointers arrays characters dynamic memory allocation performed using pointers many data types trees commonly implemented dynamically allocated codice_12 objects linked together using pointers pointers functions useful passing functions arguments higher-order functions qsort bsearch callbacks invoked event handlers null pointer value explicitly points valid location dereferencing null pointer value undefined often resulting segmentation fault null pointer values useful indicating special cases next pointer final node linked list error indication functions returning pointers appropriate contexts source code assigning pointer variable null pointer constant written codice_80 without explicit casting pointer type codice_218 macro defined several standard headers conditional contexts null pointer values evaluate false pointer values evaluate true void pointers codice_219 point objects unspecified type therefore used generic data pointers since size type pointed-to object known void pointers dereferenced pointer arithmetic allowed although easily many contexts implicitly converted object pointer type careless use pointers potentially dangerous typically unchecked pointer variable made point arbitrary location cause undesirable effects although properly used pointers point safe places made point unsafe places using invalid pointer arithmetic objects point may continue used deallocation dangling pointers may used without initialized wild pointers may directly assigned unsafe value using cast union another corrupt pointer general c permissive allowing manipulation conversion pointer types although compilers typically provide options various levels checking programming languages address problems using restrictive reference types array types c traditionally fixed static size specified compile time recent c99 standard also allows form variable-length arrays however also possible allocate block memory arbitrary size run-time using standard library codice_220 function treat array c unification arrays pointers means declared arrays dynamically allocated simulated arrays virtually interchangeable since arrays always accessed effect via pointers array accesses typically checked underlying array size although compilers may provide bounds checking option array bounds violations therefore possible rather common carelessly written code lead various repercussions including illegal memory accesses corruption data buffer overruns run-time exceptions bounds checking desired must done manually c special provision declaring multi-dimensional arrays rather relies recursion within type system declare arrays arrays effectively accomplishes thing index values resulting multi-dimensional array thought increasing row-major order multi-dimensional arrays commonly used numerical algorithms mainly applied linear algebra store matrices structure c array well suited particular task however since arrays passed merely pointers bounds array must known fixed values else explicitly passed subroutine requires dynamically sized arrays arrays accessed using double indexing workaround allocate array additional row vector pointers columns c99 introduced variable-length arrays address issues ordinary c arrays subscript notation codice_221 codice_222 designates pointer syntactic sugar codice_223 taking advantage compiler knowledge pointer type address codice_224 points base address pointed codice_222 incremented codice_27 bytes rather defined base address incremented codice_27 multiplied size element codice_222 points thus codice_221 designates codice_230th element array furthermore expression contexts notable exception operand codice_108 name array automatically converted pointer array first element implies array never copied whole named argument function rather address first element passed therefore although function calls c use pass-by-value semantics arrays effect passed reference size element determined applying operator codice_108 dereferenced element codice_222 codice_234 codice_235 number elements declared array codice_78 determined codice_237 latter applies array names variables declared subscripts codice_238 due semantics c possible determine entire size arrays pointers arrays created dynamic allocation codice_220 code codice_240 codice_241 designates pointer work since compiler assumes size pointer requested since array name arguments codice_108 converted pointers exhibit ambiguity however arrays created dynamic allocation accessed pointers rather true array variables suffer codice_108 issues array pointers thus despite apparent equivalence array pointer variables still distinction made even though name array expression contexts converted pointer first element pointer occupy storage array name l-value address constant unlike pointer variable consequently array points changed impossible assign new address array name array contents may copied however using codice_244 function accessing individual elements one important functions programming language provide facilities managing memory objects stored memory c provides three distinct ways allocate memory objects three approaches appropriate different situations various trade-offs example static memory allocation little allocation overhead automatic allocation may involve slightly overhead dynamic memory allocation potentially great deal overhead allocation deallocation persistent nature static objects useful maintaining state information across function calls automatic allocation easy use stack space typically much limited transient either static memory heap space dynamic memory allocation allows convenient allocation objects whose size known run-time c programs make extensive use three possible automatic static allocation usually simplest storage managed compiler freeing programmer potentially error-prone chore manually allocating releasing storage however many data structures change size runtime since static allocations automatic allocations c99 must fixed size compile-time many situations dynamic allocation necessary prior c99 standard variable-sized arrays common example see article codice_220 example dynamically allocated arrays unlike automatic allocation fail run time uncontrolled consequences dynamic allocation functions return indication form null pointer value required storage allocated static allocation large usually detected linker loader program even begin execution unless otherwise specified static objects contain zero null pointer values upon program startup automatically dynamically allocated objects initialized initial value explicitly specified otherwise initially indeterminate values typically whatever bit pattern happens present storage might even represent valid value type program attempts access uninitialized value results undefined many modern compilers try detect warn problem false positives false negatives occur another issue heap memory allocation synchronized actual usage program order reused much possible example pointer heap memory allocation goes scope value overwritten codice_249 called memory recovered later reuse essentially lost program phenomenon known memory leak conversely possible memory freed continue referenced leading unpredictable results typically symptoms appear portion program far removed actual error making difficult track problem issues ameliorated languages automatic garbage collection c programming language uses libraries primary method extension c library set functions contained within single archive file library typically header file contains prototypes functions contained within library may used program declarations special data types macro symbols used functions order program use library must include library header file library must linked program many cases requires compiler flags e.g. codice_250 shorthand link math library common c library c standard library specified iso ansi c standards comes every c implementation implementations target limited environments embedded systems may provide subset standard library library supports stream input output memory allocation mathematics character strings time values several separate standard headers example codice_185 specify interfaces standard library facilities another common set c library functions used applications specifically targeted unix unix-like systems especially functions provide interface kernel functions detailed various standards posix single unix specification since many programs written c wide variety libraries available libraries often written c c compilers generate efficient object code programmers create interfaces library routines used higher-level languages like java perl python file input output i/o part c language instead handled libraries c standard library associated header files e.g codice_185 file handling generally implemented high-level i/o works streams stream perspective data flow independent devices file concrete device high level i/o done association stream file c standard library buffer memory area queue temporarily used store data sent final destination reduces time spent waiting slower devices example hard drive solid state drive low-level i/o functions part standard c library generally part bare metal programming programming independent operating system embedded programming exceptions implementations include low-level i/o number tools developed help c programmers find fix statements undefined behavior possibly erroneous expressions greater rigor provided compiler tool lint first leading many others automated source code checking auditing beneficial language c many tools exist lint common practice use lint detect questionable code program first written program passes lint compiled using c compiler also many compilers optionally warn syntactically valid constructs likely actually errors misra c proprietary set guidelines avoid questionable code developed embedded systems also compilers libraries operating system level mechanisms performing actions standard part c bounds checking arrays detection buffer overflow serialization dynamic memory tracking automatic garbage collection tools purify valgrind linking libraries containing special versions memory allocation functions help uncover runtime errors memory usage c widely used systems programming implementing operating systems embedded system applications c code written portability used purposes yet needed system-specific code used access specific hardware addresses perform type punning match externally imposed interface requirements low run-time demand system resources c also used website programming using cgi gateway information web application server browser c often chosen interpreted languages speed stability near-universal availability one consequence c wide availability efficiency compilers libraries interpreters programming languages often implemented c. reference implementations python perl php example written c. layer abstraction thin overhead low c enables programmers create efficient implementations algorithms data structures useful computationally intense programs example gnu multiple precision arithmetic library gnu scientific library mathematica matlab completely partially written c. c sometimes used intermediate language implementations languages approach may used portability convenience using c intermediate language additional machine-specific code generators necessary c features line-number preprocessor directives optional superfluous commas end initializer lists support compilation generated code however c shortcomings prompted development c-based languages specifically designed use intermediate languages c -- c also widely used implement end-user applications however applications also written newer higher-level languages c directly indirectly influenced many later languages c go java javascript limbo lpc perl php python unix c shell pervasive influence syntactical languages mentioned combine statement less recognizably expression syntax c type systems data models and/or large-scale program structures differ c sometimes radically several c near-c interpreters exist including ch cint also used scripting object-oriented languages became popular c++ objective-c two different extensions c provided object-oriented capabilities languages originally implemented source-to-source compilers source code translated c compiled c compiler c++ programming language devised bjarne stroustrup approach providing object-oriented functionality c-like syntax c++ adds greater typing strength scoping tools useful object-oriented programming permits generic programming via templates nearly superset c c++ supports c exceptions objective-c originally thin layer top c remains strict superset c permits object-oriented programming using hybrid dynamic/static typing paradigm objective-c derives syntax c smalltalk syntax involves preprocessing expressions function declarations function calls inherited c syntax object-oriented features originally taken smalltalk addition c++ objective-c ch cilk unified parallel c nearly supersets c | [
4291,
5,
4296,
1445,
4302,
1447,
5731,
4315,
4316,
7171,
7172,
1474,
7182,
1477,
2934,
1478,
4332,
2942,
5757,
4340,
42,
1484,
7199,
7201,
53,
1493,
5771,
5775,
4361,
7213,
4366,
5782,
74,
7218,
2969,
5784,
5786,
5787,
80,
7223,
1512,
... | Test |
1,436 | 2 | U-Prove:u-prove u-prove microsoft technology user-centric identity management underlying cryptographic protocols designed dr. stefan brands developed credentica subsequently microsoft u-prove enables application developers reconcile seemingly conflicting security privacy objectives including anonymity allows digital identity claims efficiently tied use tamper-resistant devices smart cards application areas particular interest include cross-domain enterprise identity access management e-government sso data sharing electronic health records anonymous electronic voting policy-based digital rights management social networking data portability electronic payments 2008 microsoft committed opening u-prove technology first step march 2010 company released cryptographic specification open-source api implementation code part u-prove technology community technology preview microsoft open specification promise since several extensions released terms technology tested real-life applications | [
2489,
6489,
1805
] | Test |
1,437 | 9 | Member_variable:member variable object-oriented programming member variable sometimes called member field variable associated specific object accessible methods member functions class-based languages distinguished two types one copy variable shared instances class called class variable static member variable instance class copy variable variable called instance variable class foo int main public class program public class foo class foo f foo f.bar 100 print f.bar | [
790,
6029,
8106,
5608,
1420,
1378,
5510,
7460,
1803
] | Test |
1,438 | 3 | Snapshot_(computer_storage):snapshot computer storage computer systems snapshot state system particular point time term coined analogy photography refer actual copy state system capability provided certain systems full backup large data set may take long time complete multi-tasking multi-user systems may writes data backed prevents backup atomic introduces version skew may result data corruption example user moves file directory already backed file would completely missing backup media since backup operation already taken place addition file version skew may also cause corruption files change size contents underfoot read one approach safely backing live data temporarily disable write access data backup either stopping accessing applications using locking api provided operating system enforce exclusive read access tolerable low-availability systems desktop computers small workgroup servers regular downtime acceptable high-availability 24/7 systems however bear service stoppages avoid downtime high-availability systems may instead perform backup snapshot —a read-only copy data set frozen point time—and allow applications continue writing data snapshot implementations efficient create snapshots 1 words time i/o needed create snapshot increase size data set contrast time i/o required direct backup proportional size data set systems initial snapshot taken data set subsequent snapshots copy changed data use system pointers reference initial snapshot method pointer-based snapshots consumes less disk capacity data set repeatedly cloned unix systems snapshot-capable logical volume managers implement copy-on-write entire block devices copying changed blocksjust overwritten within parent volumesto storage thus preserving self-consistent past image block device filesystems snapshot images later mounted read-only media volume managers also allow creation writable snapshots extending copy-on-write approach disassociating blocks modified within snapshot parent blocks original volume scheme could also described performing additional copy-on-write operations triggered writes snapshots linux logical volume manager lvm allows creation read-only read-write snapshots writable snapshots introduced lvm version 2 lvm2 file systems wafl fossil plan 9 bell labs ods-5 internally track old versions files make snapshots available special namespace others like ufs2 provide operating system api accessing file histories ntfs access snapshots provided volume shadow-copying service vss windows xp windows server 2003 shadow copy windows vista melio fs provides snapshots via vss interface shared storage snapshots also available nss novell storage services file system netware since version 4.11 recently linux platforms open enterprise server product emc isilon onefs clustered storage platform implements single scalable file system supports read-only snapshots file directory level file directory within file system snapshotted system implement copy-on-write point-in-time snapshot dynamically based method determined optimal system linux btrfs ocfs2 file systems support creating snapshots cloning individual files additionally btrfs also supports creation snapshots subvolumes aix jfs2 also support snapshots sun microsystems zfs hybrid implementation tracks read-write snapshots block level makes branched file sets nameable user applications clones time machine included apple mac os x v10.5 operating system snapshotting scheme system-level incremental backup service merely watches mounted volumes changes copies changed files periodically specially-designated volume using hard links ancient hfs plus file system n't snapshotting feature apple new apfs file system introduces feature | [
3599,
5894,
1254,
890,
1534,
5809,
3519,
5022,
6892,
6505,
2390,
5571,
831,
1281,
578,
7738,
7743,
6117,
7379,
3134,
1680,
517,
3144,
1132,
1047,
7581,
2885,
869,
6860,
8146,
5890
] | Test |
1,439 | 7 | Beeline_(software_company):beeline software company beeline software-as-a-service company dealing solutions sourcing managing extended workforce company ranks among largest vendor management system vms providers terms total temp/contract spend outsourced spend staffing industry analysts 2017 vms markets development summary report beeline founded 1999 workforce solutions business unit mps group inc. jacksonville florida company among first offer vms solutions december 2016 chicago-based private equity firm gtcr acquired beeline merged company iqnavigator previously competitor workforce management solutions marketplace merged company operates beeline brand name march 2017 beeline named leader “ contingent workers consulting services ” forrester wave services procurement q1 2017 report forrester research inc. gartner inc. ranked beeline first statement work procurement critical capabilities services procurement solutions report july 2018 beeline announced acquired new mountain capital new york city-based private equity firm undisclosed amount beeline collaborates number partner organizations including talent providers enterprise software solution providers managed services providers msps strategic msp partners include allegis global solutions hayes talent solutions kellyocg pontoon | [
330
] | Test |
1,440 | 4 | MD5CRK:md5crk cryptography md5crk distributed effort similar distributed.net launched jean-luc cooke company certainkey cryptosystems demonstrate md5 message digest algorithm insecure finding collision — two messages produce md5 hash project went live march 1 2004 project ended august 24 2004 researchers independently demonstrated technique generating collisions md5 using analytical methods xiaoyun wang feng xuejia lai yu certainkey awarded 10,000 canadian dollar prize wang feng lai yu discovery technique called floyd cycle-finding algorithm used try find collision md5 algorithm described analogy random walk using principle function finite number possible outputs placed feedback loop cycle one use relatively small amount memory store outputs particular structures use markers better detect marker passed markers called distinguished points point two inputs produce output called collision point md5crk considered point whose first 32 bits zeroes distinguished point expected time find collision equal formula_1 formula_2 number bits digest output fact formula_3 formula_4 number function outputs collected project probability success formula_4 md5 computations approximated formula_6 expected number computations required produce collision 128-bit md5 message digest function thus formula_7 give perspective using virginia tech system x maximum performance 12.25 teraflops would take approximately formula_8 seconds 3 weeks commodity processors 2 gigaflops would take 6,000 machines approximately amount time | [
2325
] | Test |
1,441 | 0 | Index_Translationum:index translationum index translationum unesco database book translations books translated thousands years central record fact league nations established record translations 1932 1946 united nations superseded league unesco assigned index 1979 records computerised since index counts translations individual books authors many books translations rank higher authors books translations example bible single translated book world rank top ten index index counts walt disney company employing many writers single writer authors similar names sometimes included one entry example ranking hergé applies author adventures tintin hergé also b.r hergehahn elisabeth herget douglas hergert hence top authors index presents database query whose results require interpretation according index agatha christie remains most-translated individual author source unesco | [
5008,
2054
] | Test |
1,442 | 2 | Tim_Paterson:tim paterson tim paterson born 1956 american computer programmer best known creating 86-dos operating system intel 8086 system emulated application programming interface api cp/m created gary kildall 86-dos later formed basis ms-dos widely used personal computer operating system 1980s paterson educated seattle public schools graduating ingraham high school 1974 attended university washington working repair technician retail computer store green lake area seattle washington graduated magna cum laude degree computer science june 1978 went work seattle computer products designer engineer designed hardware microsoft z-80 softcard z80 cpu ran cp/m operating system apple ii month later intel released 8086 cpu paterson went work designing s-100 8086 board went market november 1979 commercial software existed board microsoft standalone disk basic-86 standard cp/m operating system time available cpu without true operating system sales slow paterson began work qdos quick dirty operating system april 1980 fill void copying apis cp/m sources including published cp/m manual would highly compatible qdos soon renamed 86-dos version 0.10 complete july 1980 version 1.14 86-dos grown 4,000 lines assembly code december 1980 microsoft secured rights market 86-dos hardware manufacturers acknowledging made 86-dos compatible cp/m paterson maintained 86-dos program original work denied allegations referred cp/m code writing book appeared 2004 claiming 86-dos unoriginal rip-off cp/m paterson sued authors publishers defamation judge found paterson failed provide evidence regarding serious doubts accuracy gary kildall chapter instead careful review lefer notes ... provides research picture tellingly close substance final chapter case dismissed basis book claims constitutionally protected opinions provably false paterson left scp april 1981 worked microsoft may 1981 april 1982 brief second stint scp paterson started company falcon technology a.k.a falcon systems 1983 microsoft contracted paterson port ms-dos msx computers standard developing ascii paterson accepted contract help fund company completed work msx-dos operating system 1984 falcon technology bought microsoft 1986 reclaim royalty-free licenses ms-dos eventually becoming part phoenix technologies paterson worked second stint microsoft 1986 1988 third stint 1990 1998 time worked visual basic leaving microsoft third time paterson founded another software development company paterson technology also made several appearances comedy central television program battlebots paterson also raced rally cars scca pro rally series even engineered trip computer integrated axle four-wheel drive porsche 911 | [
4023,
3210,
4291,
3137,
5784,
5571,
2798,
5661,
6380,
5108,
6907,
1992
] | Test |
1,443 | 5 | Polarization-division_multiplexing:polarization-division multiplexing polarization-division multiplexing pdm physical layer method multiplexing signals carried electromagnetic waves allowing two channels information transmitted carrier frequency using waves two orthogonal polarization states used microwave links satellite television downlinks double bandwidth using two orthogonally polarized feed antennas satellite dishes also used fiber optic communication transmitting separate left right circularly polarized light beams optical fiber polarization techniques long used radio transmission reduce interference channels particularly vhf frequencies beyond circumstances data rate radio link doubled transmitting two separate channels radio waves frequency using orthogonal polarization example point point terrestrial microwave links transmitting antenna two feed antennas vertical feed antenna transmits microwaves electric field vertical vertical polarization horizontal feed antenna transmits microwaves frequency electric field horizontal horizontal polarization two separate channels received vertical horizontal feed antennas receiving station satellite communications orthogonal circular polarization often used instead i.e right- left-handed sense circular polarization changed relative orientation antenna space dual polarization system comprises usually two independent transmitters connected means waveguide tem lines coaxial cables stripline quasi-tem microstrip single-polarization antenna standard operation although two separate single-polarization antennas used pdm two adjacent feeds reflector antenna radiating two independent polarization states often easily achieved means single dual-polarization antenna transmitter waveguide interface typically rectangular order single-mode region operating frequency dual-polarized antenna circular square waveguide port radiating element chosen modern communication systems circular square waveguide port needed least two degenerate modes supported ad-hoc component must therefore introduced situations merge two separate single-polarized signals one dual-polarized physical interface namely ortho-mode transducer omt case transmitter tem quasi-tem output connections instead dual-polarization antenna often presents separate connections i.e printed square patch antenna two feed points embeds function omt means intrinsically transferring two excitation signals orthogonal polarization states dual-polarized signal thus carries two independent data streams receiving antenna single-polarized one receiving one two streams time dual-polarized model relaying received signal two single-polarization output connectors via omt waveguide ideal dual-polarization system lies foundation onto perfect orthogonality two polarization states single-polarized interfaces receiver would theoretically contain signal meant transmitted desired polarization thus introducing interference allowing two data streams multiplexed demultiplexed transparently without degradation due coexistence companies working commercial pdm technology include siae microelettronica huawei alcatel-lucent types outdoor microwave radios integrated orthomode transducers operate polarities single radio unit performing cross-polarization interference cancellation xpic within radio unit alternatively orthomode transducer may built antenna allow connection separate radios separate ports radio antenna practical systems however suffer non-ideal behaviors mix signals polarization states together consequence signal one received single-polarization terminals actually contains dominant quantity desired signal meant transmitted onto one polarization minor amount undesired signal meant transported polarization represents interference former consequence received signal must cleared interference level order reach required signal-to-noise-and-interference ratio snir needed receiving stages may order 30 db high-level m-qam schemes operation carried cross-polarization-interference cancellation xpic typically implemented baseband digital stage compared spatial multiplexing received signals pmd system much favourable carrier-to-interference ratio amount leakage often much smaller useful signal whereas spatial multiplexing operates amount interference equal amount useful signal observation valid good pmd design allows adaptive xpic designed simpler manner general mimo cancelling scheme since starting point without cancellation typically already sufficient establishing low-capacity link means reduced modulation xpic typically acts one received signals c containing desired signal dominant term uses received x signal containing interfering signal dominant term xpic algorithm multiplies x complex coefficient adds received c complex recombination coefficient adjusted adaptively maximize mmse measured recombination mmse improved required level two terminals switch high-order modulations novel method polarized antenna transmission utilizing differential technique .. polarization-division multiplexing typically used together phase modulation optical qam allowing transmission speeds 100 gbit/s single wavelength sets pdm wavelength signals carried wavelength-division multiplexing infrastructure potentially substantially expanding capacity multiple polarization signals combined form new states polarization known parallel polarization state generation major problem practical use pdm fiber-optic transmission systems drifts polarization state occur continuously time due physical changes fibre environment long-distance system drifts accumulate progressively without limit resulting rapid erratic rotation polarized light jones vector entire poincaré sphere polarization mode dispersion polarization-dependent loss cross-polarization modulation phenomena cause problems pdm systems reason pdm generally used conjunction advanced channel coding techniques allowing use digital signal processing decode signal way resilient polarization-related signal artifacts modulations used include pdm-qpsk pdm-dqpsk companies working commercial pdm technology include alcatel-lucent ciena cisco systems huawei infinera | [
3956,
5387,
7824,
1375,
2117,
4783,
740,
7189,
320,
4970,
8108,
3724,
6468,
84,
768,
2880,
5175,
1142,
1988
] | Test |
1,444 | 0 | Named-entity_recognition:named-entity recognition named-entity recognition ner also known entity identification entity chunking entity extraction subtask information extraction seeks locate classify named entity mentions unstructured text pre-defined categories person names organizations locations medical codes time expressions quantities monetary values percentages etc research ner systems structured taking unannotated block text one producing annotated block text highlights names entities example person name consisting one token two-token company name temporal expression detected classified state-of-the-art ner systems english produce near-human performance example best system entering muc-7 scored 93.39 f-measure human annotators scored 97.60 96.95 notable ner platforms include expression named entity word named restricts task entities one many strings words phrases stands fairly consistently referent closely related rigid designators defined kripke although practice ner deals many names referents philosophically rigid instance automotive company created henry ford 1903 referred ford ford motor company although ford refer many entities well see ford rigid designators include proper names well terms certain biological species substances exclude pronouns see coreference resolution descriptions pick referent properties see also de dicto de names kinds things opposed individuals example bank full named-entity recognition often broken conceptually possibly also implementations two distinct problems detection names classification names type entity refer e.g person organization location first phase typically simplified segmentation problem names defined contiguous spans tokens nesting bank america single name disregarding fact inside name substring america name segmentation problem formally similar chunking second phase requires choosing ontology organize categories things temporal expressions numerical expressions i.e. money percentages etc may also considered named entities context ner task instances types good examples rigid designators e.g. year 2001 also many invalid ones e.g. take vacations “ june ” first case year 2001 refers 2001st year gregorian calendar second case month june may refer month undefined year past june next june every june etc. arguable definition named entity loosened cases practical reasons definition term named entity therefore strict often explained context used certain hierarchies named entity types proposed literature bbn categories proposed 2002 used question answering consists 29 types 64 subtypes sekine extended hierarchy proposed 2002 made 200 subtypes recently 2011 ritter used hierarchy based common freebase entity types ground-breaking experiments ner social media text evaluate quality ner system output several measures defined usual measures called precision recall f1 score however several issues remain calculate values statistical measures work reasonably well obvious cases finding missing real entity exactly finding non-entity however ner fail many ways many arguably partially correct counted compete success failures example identifying real entity one overly simple method measuring accuracy merely count fraction tokens text correctly incorrectly identified part entity references entities correct type suffers least two problems first vast majority tokens real-world text part entity names baseline accuracy always predict entity extravagantly high typically 90 second mispredicting full span entity name properly penalized finding person first name last name follows might scored ½ accuracy academic conferences conll variant f1 score defined follows follows definition prediction misses single token includes spurious token wrong class hard error contribute positively either precision recall thus measure may said pessimistic case many errors close correct might adequate given purpose example one system might always omit titles ms. ph.d. compared system ground-truth data expects titles included cases every name treated error issues important actually examine kinds errors decide important given one goals requirements evaluation models based token-by-token matching proposed models may given partial credit overlapping matches using intersection union criterion allow finer grained evaluation comparison extraction systems ner systems created use linguistic grammar-based techniques well statistical models machine learning hand-crafted grammar-based systems typically obtain better precision cost lower recall months work experienced computational linguists statistical ner systems typically require large amount manually annotated training data semisupervised approaches suggested avoid part annotation effort many different classifier types used perform machine-learned ner conditional random fields typical choice research indicates even state-of-the-art ner systems brittle meaning ner systems developed one domain typically perform well domains considerable effort involved tuning ner systems perform well new domain true rule-based trainable statistical systems early work ner systems 1990s aimed primarily extraction journalistic articles attention turned processing military dispatches reports later stages automatic content extraction ace evaluation also included several types informal text styles weblogs text transcripts conversational telephone speech conversations since 1998 great deal interest entity identification molecular biology bioinformatics medical natural language processing communities common entity interest domain names genes gene products also considerable interest recognition chemical entities drugs context chemdner competition 27 teams participating task despite high f1 numbers reported muc-7 dataset problem named-entity recognition far solved main efforts directed reducing annotation labor employing semi-supervised learning robust performance across domains scaling fine-grained entity types recent years many projects turned crowdsourcing promising solution obtain high-quality aggregate human judgments supervised semi-supervised machine learning approaches ner another challenging task devising models deal linguistically complex contexts twitter search queries researchers comparisons ner performances different statistical models hmm hidden markov model maximum entropy crf conditional random fields feature sets researchers recently proposed graph-based semi-supervised learning model language specific ner tasks recently emerging task identifying important expressions text cross-linking wikipedia seen instance extremely fine-grained named entity recognition types actual wikipedia pages describing potentially ambiguous concepts example output wikification system another field seen progress remains challenging application ner twitter microblogs | [
3601,
5800,
1718,
4760,
8065,
715,
2558,
205,
5122,
7539,
5388,
1555,
5304,
3292,
2215,
1751,
7372,
4337,
3651,
4349,
4089,
1314,
5778,
5429,
4903,
3058,
5528,
5612,
6495,
7138,
5885,
5008
] | Validation |
1,445 | 9 | Common_Lisp:common lisp common lisp cl dialect lisp programming language published ansi standard document ansi incits 226-1994 r2004 formerly x3.226-1994 r1999 common lisp hyperspec hyperlinked html version derived ansi common lisp standard common lisp language developed standardized improved successor maclisp early 1980s several groups already work diverse successors maclisp lisp machine lisp aka zetalisp spice lisp nil s-1 lisp common lisp sought unify standardise extend features maclisp dialects common lisp implementation rather language specification several implementations common lisp standard available including free open-source software proprietary products common lisp general-purpose multi-paradigm programming language supports combination procedural functional object-oriented programming paradigms dynamic programming language facilitates evolutionary incremental software development iterative compilation efficient run-time programs incremental development often done interactively without interrupting running application also supports optional type annotation casting added necessary later profiling optimization stages permit compiler generate efficient code instance codice_1 hold unboxed integer range supported hardware implementation permitting efficient arithmetic big integers arbitrary precision types similarly compiler told per-module per-function basis type safety level wanted using optimize declarations common lisp includes clos object system supports multimethods method combinations often implemented metaobject protocol common lisp extensible standard features lisp macros code transformations reader macros input parsers characters common lisp provides backwards compatibility maclisp john mccarthy original lisp allows older lisp software ported common lisp work common lisp started 1981 initiative arpa manager bob engelmore develop single community standard lisp dialect much initial language design done via electronic mail 1982 guy l. steele jr. gave first overview common lisp 1982 acm symposium lisp functional programming first language documentation published 1984 common lisp language first edition second edition published 1990 incorporated many changes language made ansi common lisp standardization process final ansi common lisp standard published 1994 since update standard published various extensions improvements common lisp examples unicode concurrency clos-based io provided implementations libraries many available via quicklisp common lisp dialect lisp uses s-expressions denote code data structure function calls macro forms special forms written lists name operator first examples common lisp many data types number types include integers ratios floating-point numbers complex numbers common lisp uses bignums represent numerical values arbitrary size precision ratio type represents fractions exactly facility available many languages common lisp automatically coerces numeric values among types appropriate common lisp character type limited ascii characters modern implementations allow unicode characters symbol type common lisp languages largely unknown outside symbol unique named data object several parts name value function property list package value cell function cell important symbols lisp often used similarly identifiers languages hold value variable however many uses normally symbol evaluated value returned symbols evaluate example symbols keyword package self-evaluating boolean values common lisp represented self-evaluating symbols nil common lisp namespaces symbols called 'packages number functions available rounding scalar numeric values various ways function codice_2 rounds argument nearest integer halfway cases rounded even integer functions codice_3 codice_4 codice_5 round towards zero respectively functions return discarded fractional part secondary value example codice_6 yields -3 0.5 codice_7 yields -2 -0.5 codice_8 yields 2 0.5 codice_9 yields 4 -0.5 sequence types common lisp include lists vectors bit-vectors strings many operations work sequence type almost lisp dialects lists common lisp composed conses sometimes called cons cells pairs cons data structure two slots called car cdr list linked chain conses empty list cons car refers member list possibly another list cons cdr refers next cons—except last cons list whose cdr refers codice_10 value conses also easily used implement trees complex data structures though usually advised use structure class instances instead also possible create circular data structures conses common lisp supports multidimensional arrays dynamically resize adjustable arrays required multidimensional arrays used matrix mathematics vector one-dimensional array arrays carry type members even mixed types array specialized contain specific type members vector bits usually types supported many implementations optimize array functions array used type-specialized two type-specialized array types standard string vector characters bit-vector vector bits hash tables store associations data objects object may used key value hash tables automatically resized needed packages collections symbols used chiefly separate parts program namespaces package may export symbols marking part public interface packages use packages structures similar use c structs pascal records represent arbitrary complex data structures number type fields called slots structures allow single-inheritance classes similar structures offer dynamic features multiple-inheritance see clos classes added late common lisp conceptual overlap structures objects created classes called instances special case generic functions generic functions functions instances common lisp supports first-class functions instance possible write functions take functions arguments return functions well makes possible describe general operations common lisp library relies heavily higher-order functions example codice_11 function takes relational operator argument key function optional keyword argument used sort type data also sort data structures according key evaluation model functions simple evaluator encounters form codice_12 presumes symbol named f one following f name function arguments a1 a2 ... evaluated left-to-right order function found invoked values supplied parameters macro codice_14 defines functions function definition gives name function names arguments function body function definitions may include compiler directives known declarations provide hints compiler optimization settings data types arguments may also include documentation strings docstrings lisp system may use provide interactive documentation anonymous functions function literals defined using codice_13 expressions e.g codice_16 function squares argument lisp programming style frequently uses higher-order functions useful provide anonymous functions arguments local functions defined codice_17 codice_18 number operators related definition manipulation functions instance function may compiled codice_19 operator lisp systems run functions using interpreter default unless instructed compile others compile every function macro codice_20 defines generic functions generic functions collection methods macro codice_21 defines methods methods specialize parameters clos standard classes system classes structure classes individual objects many types corresponding system classes generic function called multiple-dispatch determine effective method use generic functions also first class data type many features generic functions methods described namespace function names separate namespace data variables key difference common lisp scheme common lisp operators define names function namespace include codice_14 codice_17 codice_18 codice_21 codice_20 pass function name argument another function one must use codice_27 special operator commonly abbreviated codice_28 first codice_11 example refers function named symbol codice_30 function namespace code codice_31 conversely call function passed way one would use codice_32 operator argument scheme evaluation model simpler one namespace positions form evaluated order -- arguments code written one dialect therefore sometimes confusing programmers experienced instance many common lisp programmers like use descriptive variable names list string could cause problems scheme would locally shadow function names whether separate namespace functions advantage source contention lisp community usually referred lisp-1 vs. lisp-2 debate lisp-1 refers scheme model lisp-2 refers common lisp model names coined 1988 paper richard p. gabriel kent pitman extensively compares two approaches common lisp supports concept multiple values expression always single primary value might also number secondary values might received inspected interested callers concept distinct returning list value secondary values fully optional passed via dedicated side channel means callers may remain entirely unaware secondary values need makes convenient use mechanism communicating information sometimes useful always necessary example multiple values supported handful standard forms common codice_35 special form accessing secondary values codice_36 returning multiple values data types common lisp include like programs many programming languages common lisp programs make use names refer variables functions many kinds entities named references subject scope association name entity name refers called binding scope refers set circumstances name determined particular binding circumstances determine scope common lisp include understand symbol refers common lisp programmer must know kind reference expressed kind scope uses variable reference dynamic versus lexical scope also run-time situation environment reference resolved binding introduced environment et cetera environments lisp globally pervasive instance new type defined known everywhere thereafter references type look global environment one type environment common lisp dynamic environment bindings established environment dynamic extent means binding established start execution construct codice_51 block disappears construct finishes executing lifetime tied dynamic activation deactivation block however dynamic binding visible within block also visible functions invoked block type visibility known indefinite scope bindings exhibit dynamic extent lifetime tied activation deactivation block indefinite scope visible functions called block said dynamic scope common lisp support dynamically scoped variables also called special variables certain kinds bindings necessarily dynamically scoped also restarts catch tags function bindings dynamically scoped using codice_17 provides lexically scoped function bindings function objects first-level object common lisp assigned dynamically scoped variables bound using codice_51 dynamic scope called using codice_32 codice_57 dynamic scope extremely useful adds referential clarity discipline global variables global variables frowned upon computer science potential sources error give rise ad-hoc covert channels communication among modules lead unwanted surprising interactions common lisp special variable top-level binding behaves like global variable programming languages new value stored value simply replaces top-level binding careless replacement value global variable heart bugs caused use global variables however another way work special variable give new local binding within expression sometimes referred rebinding variable binding dynamically scoped variable temporarily creates new memory location variable associates name location binding effect references variable refer new binding previous binding hidden execution binding expression terminates temporary memory location gone old binding revealed original value intact course multiple dynamic bindings variable nested common lisp implementations support multithreading dynamic scopes specific thread execution thus special variables serve abstraction thread local storage one thread rebinds special variable rebinding effect variable threads value stored binding retrieved thread created binding thread binds special variable codice_58 codice_58 behaves like thread-local storage among threads rebind codice_58 behaves like ordinary global threads refer top-level binding codice_58 dynamic variables used extend execution context additional context information implicitly passed function function without appear extra function parameter especially useful control transfer pass layers unrelated code simply extended extra parameters pass additional data situation like usually calls global variable global variable must saved restored scheme n't break recursion dynamic variable rebinding takes care variable must made thread-local else big mutex must used scheme n't break threads dynamic scope implementations take care also common lisp library many standard special variables instance standard i/o streams stored top-level bindings well-known special variables standard output stream stored *standard-output* suppose function foo writes standard output capture output character string *standard-output* bound string stream called common lisp supports lexical environments formally bindings lexical environment lexical scope may either indefinite extent dynamic extent depending type namespace lexical scope means visibility physically restricted block binding established references textually i.e lexically embedded block simply see binding tags tagbody lexical scope expression go x erroneous actually embedded tagbody contains label x however label bindings disappear tagbody terminates execution dynamic extent block code re-entered invocation lexical closure invalid body closure try transfer control tag via go tagbody executed first evaluates setf form stores function special variable *stashed* go end-label transfers control end-label skipping code print hello since end-label end tagbody tagbody terminates yielding nil suppose previously remembered function called situation erroneous one implementation response error condition containing message go tagbody tag some-label already left function tried evaluate go some-label lexically embedded tagbody resolves label however tagbody n't executing extent ended control transfer take place local function bindings lisp lexical scope variable bindings also lexical scope default contrast go labels indefinite extent lexical function variable binding established binding continues exist long references possible even construct established binding terminated references lexical variables functions termination establishing construct possible thanks lexical closures lexical binding default binding mode common lisp variables individual symbol switched dynamic scope either local declaration global declaration latter may occur implicitly use construct like defvar defparameter important convention common lisp programming special i.e dynamically scoped variables names begin end asterisk sigil codice_62 called “ earmuff convention ” adhered convention effectively creates separate namespace special variables variables intended lexical accidentally made special lexical scope useful several reasons firstly references variables functions compiled efficient machine code run-time environment structure relatively simple many cases optimized stack storage opening closing lexical scopes minimal overhead even cases full closures must generated access closure environment still efficient typically variable becomes offset vector bindings variable reference becomes simple load store instruction base-plus-offset addressing mode secondly lexical scope combined indefinite extent gives rise lexical closure turn creates whole paradigm programming centered around use functions first-class objects root functional programming thirdly perhaps importantly even lexical closures exploited use lexical scope isolates program modules unwanted interactions due restricted visibility lexical variables private one module binds lexical variable x calls another module b references x b accidentally resolve x bound b simply access x situations disciplined interactions variable desirable common lisp provides special variables special variables allow module set binding variable x visible another module b called able advantage able prevent happening also advantage consequently common lisp supports lexical dynamic scope macro lisp superficially resembles function usage however rather representing expression evaluated represents transformation program source code macro gets source surrounds arguments binds parameters computes new source form new form also use macro macro expansion repeated new source form use macro final computed form source code executed runtime typical uses macros lisp various standard common lisp features also need implemented macros macros defined defmacro macro special operator macrolet allows definition local lexically scoped macros also possible define macros symbols using define-symbol-macro symbol-macrolet paul graham book lisp describes use macros common lisp detail doug hoyte book let lambda extends discussion macros claiming macros single greatest advantage lisp programming language single greatest advantage programming language hoyte provides several examples iterative development macros macros allow lisp programmers create new syntactic forms language one typical use create new control structures example macro provides codice_73 looping construct syntax macro definition tagbody primitive common lisp special operator provides ability name tags use go form jump tags backquote provides notation provides code templates value forms preceded comma filled forms preceded comma at-sign spliced tagbody form tests end condition condition true jumps end tag otherwise provided body code executed jumps start tag example form using macro code expanded using function macroexpand-1 expansion example looks like macro expansion value variable test random 10 0 value variable body write-line hello body list forms symbols usually automatically upcased expansion uses tagbody two labels symbols labels computed gensym interned package two go forms use tags jump since tagbody primitive operator common lisp macro expanded something else expanded form uses macro also expanded fully expanding source form called code walking fully expanded walked form form replaced primitive macros must expanded source code containing evaluated compiled normally macros considered functions accept return s-expressions similar abstract syntax trees limited functions invoked evaluator compiler produce final source code macros written normal common lisp may use common lisp third-party operator available common lisp macros capable commonly called variable capture symbols macro-expansion body coincide calling context allowing programmer create macros wherein various symbols special meaning term variable capture somewhat misleading namespaces vulnerable unwanted capture including operator function namespace tagbody label namespace catch tag condition handler restart namespaces variable capture introduce software defects happens one following two ways scheme dialect lisp provides macro-writing system provides referential transparency eliminates types capture problem type macro system sometimes called hygienic particular proponents regard macro systems automatically solve problem unhygienic common lisp macro hygiene ensured one two different ways one approach use gensyms guaranteed-unique symbols used macro-expansion without threat capture use gensyms macro definition manual chore macros written simplify instantiation use gensyms gensyms solve type 2 capture easily applicable type 1 capture way macro expansion rename interfering symbols surrounding code capture references gensyms could used provide stable aliases global symbols macro expansion needs macro expansion would use secret aliases rather well-known names redefinition well-known names would ill effect macro another approach use packages macro defined package simply use internal symbols package expansion use packages deals type 1 type 2 capture however packages n't solve type 1 capture references standard common lisp functions operators reason use packages solve capture problems revolves around use private symbols symbols one package imported otherwise made visible packages whereas common lisp library symbols external frequently imported made visible user-defined packages following example unwanted capture operator namespace occurring expansion macro codice_73 macro expand form calls codice_75 intended refer standard common lisp macro codice_75 however context codice_75 may completely different meaning codice_73 may work properly common lisp solves problem shadowing standard operators functions forbidding redefinition redefines standard operator codice_75 preceding actually fragment non-conforming common lisp allows implementations diagnose reject condition system responsible exception handling common lisp provides conditions handler restart s. condition objects describing exceptional situation example error condition signaled common lisp system searches handler condition type calls handler handler search restarts use one restarts automatically repair current problem using information condition type relevant information provided part condition object call appropriate restart function restarts unhandled code presented users part user interface debugger example user select invoke one available restarts since condition handler called context error without unwinding stack full error recovery possible many cases exception handling systems would already terminated current routine debugger also customized replaced using codice_80 dynamic variable code found within unwind-protect forms finalizers also executed appropriate despite exception following example using symbolics genera user tries open file lisp function test called read-eval-print-loop repl file exist lisp system presents four restarts user selects retry open using different pathname restart enters different pathname lispm-init.lisp instead lispm-int.lisp user code contain error handling code whole error handling restart code provided lisp system handle repair error without terminating user code common lisp includes toolkit object-oriented programming common lisp object system clos one powerful object systems available language example peter norvig explains many design patterns simpler implement dynamic language features clos multiple inheritance mixins multimethods metaclasses method combinations etc. several extensions common lisp object-oriented programming proposed included ansi common lisp standard eventually clos adopted standard object-system common lisp clos dynamic object system multiple dispatch multiple inheritance differs radically oop facilities found static languages c++ java dynamic object system clos allows changes runtime generic functions classes methods added removed classes added redefined objects updated class changes class objects changed clos integrated ansi common lisp generic functions used like normal functions first-class data type every clos class integrated common lisp type system many common lisp types corresponding class potential use clos common lisp specification say whether conditions implemented clos pathnames streams could implemented clos usage possibilities clos ansi common lisp part standard actual common lisp implementations use clos pathnames streams input–output conditions implementation clos lisp interpreter directly executes lisp source code provided lisp objects lists symbols numbers ... read s-expressions lisp compiler generates bytecode machine code lisp source code common lisp allows individual lisp functions compiled memory compilation whole files externally stored compiled code fasl files several implementations earlier lisp dialects provided interpreter compiler unfortunately often semantics different earlier lisps implemented lexical scoping compiler dynamic scoping interpreter common lisp requires interpreter compiler use lexical scoping default common lisp standard describes semantics interpreter compiler compiler called using function compile individual functions using function compile-file files common lisp allows type declarations provides ways influence compiler code generation policy latter various optimization qualities given values 0 important 3 important speed space safety debug compilation-speed also function evaluate lisp code codice_81 codice_81 takes code pre-parsed s-expressions like languages text strings way code constructed usual lisp functions constructing lists symbols code evaluated function codice_81 several common lisp implementations like clozure cl sbcl implementing codice_81 using compiler way code compiled even though evaluated using function codice_81 file compiler invoked using function compile-file generated file compiled code called fasl fast load file fasl files also source code files loaded function load running common lisp system depending implementation file compiler generates byte-code example java virtual machine c language code compiled c compiler directly native code common lisp implementations used interactively even though code gets fully compiled idea interpreted language thus apply interactive common lisp language makes distinction read-time compile-time load-time run-time allows user code also make distinction perform wanted type processing wanted step special operators provided especially suit interactive development instance codice_86 assign value provided variable n't already bound codice_87 always perform assignment distinction useful interactively evaluating compiling loading code live image features also provided help writing compilers interpreters symbols consist first-level objects directly manipulable user code codice_88 special operator allows create lexical bindings programmatically packages also manipulable lisp compiler available runtime compile files individual functions make easy use lisp intermediate compiler interpreter another language following program calculates smallest number people room probability completely unique birthdays less 50 birthday paradox 1 person probability obviously 100 2 364/365 etc. answer 23 convention constants common lisp enclosed characters calling example function using repl read eval print loop define class codice_89 method displaying name age person next define group persons list codice_89 objects iterate sorted list prints three names descending age use loop macro demonstrated example use compare built exponentiation with-open-file macro opens file provides stream form returning file automatically closed funcall calls function object loop collects lines match predicate function available-shells calls function list-matching-lines pathname anonymous function predicate predicate returns pathname shell nil string filename shell example results mac os x 10.6 common lisp frequently compared contrasted scheme—if two popular lisp dialects scheme predates cl comes lisp tradition engineers—guy l. steele gerald jay sussman designed scheme chaired standards committee common lisp common lisp general-purpose programming language contrast lisp variants emacs lisp autolisp extension languages embedded particular products gnu emacs autocad respectively unlike many earlier lisps common lisp like scheme uses lexical variable scope default interpreted compiled code lisp systems whose designs contributed common lisp—such zetalisp franz lisp—used dynamically scoped variables interpreters lexically scoped variables compilers scheme introduced sole use lexically scoped variables lisp inspiration algol 68 widely recognized good idea cl supports dynamically scoped variables well must explicitly declared special differences scoping ansi cl interpreters compilers common lisp sometimes termed lisp-2 scheme lisp-1 referring cl use separate namespaces functions variables fact cl many namespaces go tags block names codice_72 keywords long-standing controversy cl scheme advocates tradeoffs involved multiple namespaces scheme broadly necessary avoid giving variables names clash functions scheme functions frequently arguments named codice_92 codice_93 codice_94 conflict system function codice_95 however cl necessary explicitly refer function namespace passing function argument—which also common occurrence codice_11 example cl also differs scheme handling boolean values scheme uses special values f represent truth falsity cl follows older lisp convention using symbols nil nil standing also empty list cl non-nil value treated true conditionals codice_68 whereas scheme non- f values treated true conventions allow operators languages serve predicates answering boolean-valued question returning useful value computation scheme value equivalent nil common lisp evaluates true boolean expression lastly scheme standards documents require tail-call optimization cl standard cl implementations offer tail-call optimization although often programmer uses optimization directive nonetheless common cl coding style favor ubiquitous use recursion scheme style prefers—what scheme programmer would express tail recursion cl user would usually express iterative expression codice_75 codice_99 codice_72 recently codice_101 package see category common lisp defined specification like ada c rather one implementation like perl version 6 many implementations standard details areas may validly differ addition implementations tend come extensions provide functionality covered standard free open-source software libraries created support extensions common lisp portable way notably found repositories common-lisp.net clocc common lisp open code collection projects common lisp implementations may use mix native code compilation byte code compilation interpretation common lisp designed support incremental compilers file compilers block compilers standard declarations optimize compilation function inlining type specialization proposed language specification common lisp implementations compile source code native machine code implementations create optimized stand-alone applications others compile interpreted bytecode less efficient native code eases binary-code portability also compilers compile common lisp code c code misconception lisp purely interpreted language likely lisp environments provide interactive prompt code compiled one-by-one incremental way common lisp incremental compilation widely used unix-based implementations clisp sbcl used scripting language invoked system transparently way perl unix shell interpreter see category common lisp used develop research applications often artificial intelligence rapid development prototypes deployed applications common lisp used many commercial applications including yahoo store web-commerce site originally involved paul graham later rewritten c++ perl notable examples include also exist open-source applications written common lisp since 2011 zach beane support common lisp foundation maintained quicklisp library manager allows automatic download installing loading 3600 libraries required work one implementation common lisp license allows redistribution chronological list books published published common lisp language programming common lisp especially ai programming | [
7878,
1445,
1819,
1820,
4302,
5019,
6796,
6087,
1825,
2915,
6092,
5734,
6095,
1840,
7899,
7902,
5395,
1476,
1102,
5397,
1478,
4332,
2218,
4704,
4705,
1804,
5757,
6116,
7557,
1116,
417,
54,
6471,
7573,
2600,
5077,
1885,
2249,
774,
1889,
... | Test |
1,446 | 9 | Syntax-directed_translation:syntax-directed translation syntax-directed translation refers method compiler implementation source language translation completely driven parser common method syntax-directed translation translating string sequence actions attaching one action rule grammar thus parsing string grammar produces sequence rule applications sdt provides simple way attach semantics syntax syntax-directed translation fundamentally works adding actions productions context-free grammar resulting syntax-directed definition sdd actions steps procedures carried production used derivation grammar specification embedded actions performed called syntax-directed translation scheme sometimes simply called 'translation scheme symbol grammar attribute value associated symbol common attributes could include variable type value expression etc given symbol x attribute attribute referred x thus given actions attributes grammar used translating strings language applying actions carrying information symbol attribute early metacompilers use terms syntax-driven syntax-directed translation descriptions metaprogramming language features outputting code see metacompiler meta ii tree-meta | [
1361,
6275,
5326,
1951
] | Test |
1,447 | 3 | Memory_hierarchy:memory hierarchy computer architecture memory hierarchy separates computer storage hierarchy based response time since response time complexity capacity related levels may also distinguished performance controlling technologies memory hierarchy affects performance computer architectural design algorithm predictions lower level programming constructs involving locality reference designing high performance requires considering restrictions memory hierarchy i.e size capabilities component various components viewed part hierarchy memories ... member typically smaller faster next highest member hierarchy limit waiting higher levels lower level respond filling buffer signaling activating transfer four major storage levels general memory hierarchy structuring many structures useful example paging algorithm may considered level virtual memory designing computer architecture one include level nearline storage online offline storage number levels memory hierarchy performance level increased time type memory storage components also change historically example memory hierarchy intel haswell mobile processor circa 2013 lower levels hierarchy – disks downwards – also known tiered storage formal distinction online nearline offline storage example always-on spinning disks online spinning disks spin-down massive array idle disk maid nearline removable media tape cartridges automatically loaded tape library nearline cartridges must manually loaded offline modern cpus fast program workloads bottleneck locality reference memory accesses efficiency caching memory transfer different levels hierarchy result cpu spends much time idling waiting memory i/o complete sometimes called space cost larger memory object likely overflow small/fast level require use larger/slower level resulting load memory use known pressure respectively register pressure cache pressure main memory pressure terms data missing higher level needing fetched lower level respectively register spilling due register pressure register cache cache miss cache main memory hard page fault main memory disk modern programming languages mainly assume two levels memory main memory disk storage though assembly language inline assemblers languages c registers directly accessed taking optimal advantage memory hierarchy requires cooperation programmers hardware compilers well underlying support operating system many programmers assume one level memory works fine application hits performance wall memory hierarchy assessed code refactoring | [
5012,
5371,
3948,
7529,
5737,
5042,
740,
1854,
7552,
1481,
5055,
2226,
1867,
2248,
5784,
6148,
441,
2633,
4047,
5483,
5487,
6198,
1568,
1570,
6922,
7666,
515,
8024,
5521,
3747,
1237,
6236,
3751,
534,
7314,
5889,
1252,
1254,
4847,
4479,
... | Validation |
1,448 | 4 | Supply_chain_cyber_security:supply chain cyber security supply chain cyber security refers efforts enhance cyber security within supply chain subset supply chain security focused management cyber security requirements information technology systems software networks driven threats cyber-terrorism malware data theft advanced persistent threat apt typical supply chain cyber security activities minimizing risks include buying trusted vendors disconnecting critical machines outside networks educating users threats protective measures take acting deputy undersecretary national protection programs directorate united states department homeland security greg schaffer said hearing aware instances malware found imported electronic computer devices sold within united states | [
3486
] | Test |
1,449 | 1 | Database_storage_structures:database storage structures database tables indexes may stored disk one number forms including ordered/unordered flat files isam heap files hash buckets b+ trees form particular advantages disadvantages commonly used forms b+ trees isam forms structures one aspect overall schema used database engine store information unordered storage typically stores records order inserted example heap unordered storage typically stores records order inserted storage offers good insertion efficiency formula_1 inefficient retrieval times formula_2 typically retrieval times better however databases use indexes primary keys resulting retrieval times formula_3 formula_1 keys database row offsets within storage system ordered storage typically stores records order may rearrange increase file size new record inserted resulting lower insertion efficiency however ordered storage provides efficient retrieval records pre-sorted resulting complexity formula_3 heap files lists unordered records variable size although sharing similar name heap files widely different in-memory heaps in-memory heaps ordered opposed heap files commonly used practice conventional relational databases use row-oriented storage meaning data associated given row stored together contrast column-oriented dbms store data given column together order quickly serve data warehouse-style queries correlation databases similar row-based databases apply layer indirection map multiple instances value numerical identifier | [
7248,
5209,
7715,
1730,
3951,
3776,
6345,
7067,
3005,
6430,
1003,
3011,
4950,
6543,
2304,
2124,
927,
4798,
6462,
1861,
5852,
6128,
2054,
7022,
5419,
7205,
684,
517,
7213,
7303,
6144,
4274,
1891,
4457,
1792,
3244,
784,
2265
] | Validation |
1,450 | 9 | Comparison_of_functional_programming_languages:comparison functional programming languages table shows comparison functional programming languages compares various features designs different functional programming languages | [
7032,
2740,
160,
2451,
4543,
4573,
5965,
7557,
2619,
5164,
5073
] | Test |
1,451 | 3 | ICOMP_(index):icomp index icomp intel comparative microprocessor performance index published intel used measure relative performance microprocessors three revisions icomp index version 1.0 benchmarked 486sx 25 version 2.0 benchmarked pentium 120 | [
7403,
1458,
2522,
1331
] | Test |
1,452 | 3 | Quantum_Effect_Devices:quantum effect devices quantum effect devices qed microprocessor design company incorporated 1991 quantum effect design based palo alto california three founders tom riordan earl killian ray kunita senior managers mips computer systems inc.. left mips time company difficult time selling entire computer systems mips magnum instead concentrating building microprocessor chips mips original mission soon sgi purchased mips idt major funder customer initial qed design original product plan qed build mips microprocessor laptop computer ace initiative microsoft support multiple risc architectures new windows nt operating system system companies like deskstation technology board companies like shablamm computer building products hope risc-based personal computers would become mainstream market never materialized first product r4600 orion microprocessor proved successful several embedded markets networking routers arcade games subsequent projects designed companies toshiba idt r4700 idt nkk r4650 sgi nec r5000 powerpc 603q powerpc microprocessor designed motorola meant apple computer home pc game machine designs neither designs productized powerpc 603q never reached full production several years later attempt increase product revenue company transformed product company selling line mips microprocessors time company changed name quantum effect devices successful products introductions like rm5200 rm7000 riscmark label company ipo 1 february 2000 initial stock price 16 jumped 56.50 first day trading company acquired pmc-sierra october 2000 time quantum effect devices valued stock swap worth 2.3 billion according one estimate company became microprocessor products division pmc acquisition done stock exchange valued 2.3 billion team completed rm9x00 product line pmc product line successful marketplace microprocessor core development team derived qed laid group pmc-sierra june 2005 last laid january 2006 company name attributed tom riordan believed company would survive age semiconductor geometry dimensions would become small quantum effects would dominate circuit behavior first qed microprocessor r4600 founders qed previously involved r4000 felt large device complicated simpler implementation would give better price/performance ratio reason r4600 re-implementation 5-stage classic risc pipeline large time caches small low cost device one highest performance microprocessors market initial target market mips laptop computer never materialized device found success several markets first risc processor used within cisco systems network router used several atari/midway arcade games well-known original mortal kombat game r4600 licensed idt toshiba manufactured sold devices r4700 targeted sgi wanted little floating point performance r4700 improved repeat rate floating point multiply instructions device used inside sgi indy low-end workstation r4700 licensed idt toshiba manufactured sold devices r4650 commissioned nkk desired cheaper implementation video console game machine r4650 achieved smaller die area cutting caches half implementing single precision floating-point device first qed device implemented multiply–accumulate instructions enabled software functions softmodem device used original microsoft webtv device r4650 licensed idt nkk manufactured sold devices r4640 chip system bus restricted 32-bits instead 64-bits r5000 commissioned sgi device doubled instruction data caches 32 kb implemented high-performance fully pipelined floating point unit multiply–accumulate capability srt divider device limited implementation superscalar instruction issue one integer instruction one floating-point instruction could issued one cycle device used sgi o2 sgi indy low-end workstations design owned sgi licensed design idt nec eventually toshiba powerpc 603q commissioned motorola target market apple computer low-cost accounts including home computer students home video console game named pippen 603q basically r4600 pipeline re-targeted powerpc instruction set since powerpc 603 power-efficient chip aim alliance name device chosen reflect low-cost low-power characteristics apple projects cancelled motorola stopped development 603q even though qed received first silicon samples functional rm52xx series first product line sold directly qed first series cost-reduced version r5000 smaller caches different pin-out earlier rm52x0 devices 16 kb caches later rm52x1 devices 32 kb caches rm523x devices 32-bit system buses rm526x 64-bit system buses product line successful laser printer market winning many accounts printer companies hewlett-packard lexmark ricoh samsung rm70xx series second product line sold directly qed implemented large 256 kb on-chip level 2 cache rm7000 one first microprocessors especially within embedded microprocessor market segment also implemented symmetric superscalar instruction issue two integer execution units rm7061 device pin-compatible upgrade rm526x series product line successful follow-on rm52xx products rm9x00 family first soc implemented qed apollo microprocessor core part rm9x00 pipeline lengthened 7 stages enable higher operating frequencies dynamic branch prediction added ameliorate longer branch latencies within rm9x00 two apollo cores used implement dual-core device processor cores successfully achieved operating frequency target 1 ghz soc system interconnect in-house design centralized storage transactions flowing soc peripherals included ddr memory controller sysad bus controller boot bus controller dma controller hypertransport controller second generation device added gigabit ethernet controller pci controller cache coherency product family successful due late market company financially conservative time leading company initial public offering would fully staff soc project one reasons selling company pmc-sierra fund soc projects time competitors like sibyte already entered market equivalent devices | [
6074,
3764,
6256,
1727,
5822,
5737,
5483,
4783,
5055,
7010,
4799,
5947,
4370,
7499,
3674,
7697
] | Test |
1,453 | 2 | Nokia_E60:nokia e60 nokia e60 traditional candybar style smartphone eseries business phone range s60 3rd edition symbian device introduced 12 october 2005 along nokia e61 nokia e70 | [
1066,
5979,
2271,
6517,
372,
1724,
7521,
3615,
4935,
5909,
3694,
3524,
3952,
472,
8072,
7170,
2922,
4407,
118,
23,
2564,
3703,
7261,
7545,
5044,
5493,
740,
1202,
5315,
3029,
5499,
7012,
139,
6465,
5062,
3039,
3653,
1582,
4894,
5068,
597... | Validation |
1,454 | 3 | Motorola_68010:motorola 68010 motorola mc68010 processor 16/32-bit microprocessor motorola released 1982 successor motorola 68000 fixes several small flaws 68000 adds features 68010 pin-compatible 68000 100 software compatible differences additionally 68010 loop mode accelerates loops consisting two instructions move dbra acts like tiny special-case instruction cache practice overall speed gain 68000 frequency less 10 68010 could used 68451 mmu however aspects design 1 clock memory access penalty made configuration unpopular vendors used mmu designs sun microsystems sun-2 workstation 68010 never popular 68000 however due 68010 small speed boost 68000 support virtual memory found number smaller unix systems 68451 mmu example torch triple x custom mmu sun-2 workstation unix pc ncr tower xp early hp 9000s like model 300 310 various research machines vendors stayed 68000 68020 introduced owners amiga atari st computers sega genesis game consoles replaced system 68000 cpu 68010 gain small speed boost | [
5097,
7327,
1254,
5100,
1075,
4845,
4479,
3688,
5374,
1638,
5652,
3708,
7905,
7990,
6111,
4244,
4702,
1386,
4336,
7654,
7010,
2133,
2868,
234,
2501,
2781,
3735,
2785,
4631,
7581,
6577,
5079,
4454,
1237,
2257,
5614,
3674,
7133,
2617,
2353,... | Test |
1,455 | 4 | Unicity_distance:unicity distance cryptography unicity distance length original ciphertext needed break cipher reducing number possible spurious keys zero brute force attack trying every possible key one decipherment makes sense i.e expected amount ciphertext needed determine key completely assuming underlying message redundancy claude shannon defined unicity distance 1949 paper communication theory secrecy systems consider attack ciphertext string wnaiw encrypted using vigenère cipher five letter key conceivably string could deciphered string—river water possibilities certain keys general rule cryptanalysis additional information impossible decode message course even case certain number five letter keys result english words trying possible keys get river water sxoos khdop well number working keys likely much smaller set possible keys problem knowing working keys right one rest spurious general given particular assumptions size key number possible messages average ciphertext length one key average generate readable message example see upper case english characters assume plaintext form 26 possible letters position string likewise assume five-character upper case keys k=26 possible keys majority work tremendous number possible messages n generated using even limited set characters n 26 l length message however smaller set readable plaintext due rules language perhaps likely much smaller n. moreover one-to-one relationship number keys work given k possible keys k × m/n work one correct key rest spurious since m/n gets arbitrarily small length l message increases eventually l large enough make number spurious keys equal zero roughly speaking l makes km/n=1 l unicity distance unicity distance equivalently defined minimum amount ciphertext required permit computationally unlimited adversary recover unique encryption key expected unicity distance shown u unicity distance h k entropy key space e.g 128 2 equiprobable keys rather less key memorized pass-phrase defined plaintext redundancy bits per character alphabet 32 characters carry 5 bits information per character 32 2 general number bits information per character n number characters alphabet binary logarithm english character convey bits information however average amount actual information carried per character meaningful english text 1.5 bits per character plain text redundancy 4.7 − 1.5 3.2 basically bigger unicity distance better one time pad unlimited size given unbounded entropy key space formula_2 consistent one-time pad unbreakable simple substitution cipher number possible keys number ways alphabet permuted assuming keys equally likely bits english text thus given 28 characters ciphertext theoretically possible work english plaintext hence key unicity distance useful theoretical measure n't say much security block cipher attacked adversary real-world limited resources consider block cipher unicity distance three ciphertext blocks although clearly enough information computationally unbounded adversary find right key simple exhaustive search may computationally infeasible practice unicity distance increased reducing plaintext redundancy one way deploy data compression techniques prior encryption example removing redundant vowels retaining readability good idea anyway reduces amount data encrypted ciphertexts greater unicity distance assumed one meaningful decryption ciphertexts shorter unicity distance may multiple plausible decryptions unicity distance measure much ciphertext required cryptanalysis much ciphertext required one reasonable solution cryptanalysis | [
907,
7862,
1353,
5262
] | Validation |
1,456 | 4 | Torrent_poisoning:torrent poisoning torrent poisoning intentionally sharing corrupt data data misleading file names using bittorrent protocol practice uploading fake torrents sometimes carried anti-infringement organisations attempt prevent peer-to-peer p2p sharing copyrighted content gather ip addresses downloaders decoy insertion content pollution method corrupted versions particular file inserted network deters users finding uncorrupted version also increases distribution corrupted file malicious user pollutes file converting another format indistinguishable uncorrupted files e.g may similar metadata order entice users download decoys malicious users may make corrupted file available via high bandwidth connections method consumes large amount computing resources since malicious server must respond large quantity requests result queries return principally corrupted copies blank file executable files infected virus.. known cases company created special version game published file sharing services advertising cracked undocumented hidden functionality making impossible win variant game method targets index found p2p file sharing systems index allows users locate ip addresses desired content thus method attack makes searching difficult network users attacker inserts large amount invalid information index prevent users finding correct resource invalid information could include random content identifiers fake ip addresses port numbers user attempts download corrupted content server fail establish connection due large volume invalid information users waste time trying establish connection bogus users thus increasing average time takes download file index poisoning attack requires less bandwidth server resources decoy insertion furthermore attacker transfer files respond requests reason index poisoning requires less effort methods attack companies disrupt p2p file sharing behalf content providers create software order launch attacks mediadefender written program directs users non-existent locations via bogus search results users typically select one top five search results method requires users persevere beyond initial failed attempts locate desired file idea many users simply give search frustration method attack prevents distributors serving users thus slows p2p file sharing attacker ’ servers constantly connect desired file floods provider ’ upstream bandwidth prevents users downloading file selective content poisoning also known proactive discriminatory content poisoning attempts detect copyright violators allowing legitimate users continue enjoy service provided open p2p network protocol identifies peer endpoint address file index format changed incorporate digital signature peer authentication protocol establish legitimacy peer downloads uploads files using identity based signatures system enables peer identify infringing users without need communication central authority protocol sends poisoned chunks detected users requesting copyright protected file legitimate users simply deny download requests known infringers latter usually accumulate clean chunks colluders paid peers share content others without authorization however method content poisoning forces illegitimate users discard even clean chunks prolonging download time voluntary collective licensing open music model theoretical systems users pay subscription fee access file-sharing network able legally download distribute copyright content selective content poisoning could potentially used limit access legitimate subscribed users providing poisoned content non-subscribed users attempt illegitimately use network eclipse attack also known routing-table poisoning instead poisoning network targets requesting peers directly attack attacker takes peer ’ routing table unable communicate peer except attacker attacker replicates whole network targeted peer manipulate number ways example attacker specify search results returned attacker also modify file comments peer ’ requests also directed back network attacker also modified also checks data randomly errors found attack attacker joins targeted swarm establishes connections many peers however attacker never provides chunks authentic otherwise peers common version attack chatty peer attack attacker establishes connection targeted peers via required handshake message followed message advertising number available chunks attacker never provide chunks also repeatedly resend handshake message attacks prevent downloads essentially peer wastes time dealing attacker instead downloading chunks others several reasons content providers copyright holders may choose torrent poisoning method guarding content first injecting decoys content providers normally monitor bittorrent network signs content illegally shared includes watching variations files files compressed formats process expensive time-consuming result poisoning continued first months following leak release second also unlikely torrent poisoning successful disrupting every illegal download instead aim content providers make illegal downloads statistically less likely clean complete hope users discouraged illegally downloading copyright material content providers copyright holders may decide financial outlay worth end result efforts methods attack described particularly effective measure effective countermeasures evolved measures must combined order significant impact illegal peer-to-peer filesharing using bittorrent protocols torrent files september 2004 altnet sued recording industry association america overpeer loudeye mediasentry others claiming spoofing services violated altnet patent file identification method called truenames 2005 finnish anti-infringement organisation viralg claimed software uses similar approach spoofing could used bring end illegal p2p file sharing firm offered total blocking peer 2 peer sharing intellectual property claimed patented virtual algorithm blocks illegal swapping data well claiming approach 99 effective despite claims algorithm yet tested bittorrent group finnish musicians requested investigation company arguing software effectively virus violation finnish law investigation declined finnish police later finnish parliamentary ombudsman jurisdictions concerns content providers copyright holders engaging poisoning activities may held liable damages users computers usa 2002 representative howard berman proposed peer peer piracy prevention act would granted immunity copyright holders taking steps prevent illegal distribution content i.e poisoning activities p2p networks long go far harm files stored p2p user computer however bill died later 2002 congressional term ended reintroduced 2005 reported hbo poisoning torrents show rome providing chunks garbage data users hbo also reported sent cease-and-desist letters internet service providers isps downloaders believe illegally downloaded episodes sopranos although targeted specifically bittorrent madonna american life album early example content poisoning release album tracks appeared similar length file size real album tracks leaked singer record label tracks featured clip madonna saying fuck think 're followed minutes silence similarly band barenaked ladies released number tracks online 2000 appeared legitimate copies tracks band latest album file contained short sample song followed clip band member saying although thought downloading new single actually downloading advertisement new album. ” unauthorized copy michael moore ’ movie sicko uploaded online became hit p2p websites pirate bay mediadefender hired poison torrents using decoy insertion example internet vigilantism anti-infringement vigilantes known create viruses distributed exclusively via p2p networks designed attack mp3s music files stored user pc nopir-b worm originated france poses dvd copying program deletes mp3 files user computer regardless whether legally obtained 19 october 2007 associated press ap released information accusing broadband service provider comcast hindering p2p file sharing traffic tests conducted ap shown comcast hindered uploading complete files bittorrent federal communications commission conducted public hearings response allegations comcast argued regulating network traffic enable reasonable downloading times majority users 21 august 2008 fcc issued order stated comcast network management unreasonable comcast must terminate use discriminatory network management end year comcast complied order appealed 6 june 2010 district court appeals columbia vacated fcc order comcast corp. v. fcc | [
2810,
5848,
2430,
2696,
6511,
2026,
1376,
330,
4508,
2850,
2354,
7480
] | Test |
1,457 | 2 | Amstrad_CP/M_Plus_character_set:amstrad cp/m plus character set amstrad cp/m plus character set alternatively known pcw character set zx spectrum +3 character set refers group 8-bit character sets introduced amstrad/locomotive software use conjunction adaptation digital research cp/m plus various amstrad cpc schneider cpc amstrad pcw schneider joyce machines character set also utilized amstrad zx spectrum +3 since 1987 least zx spectrum +3 existed eight language-specific variants based iso/iec 646 depending selected locale system language 0 default us another slight variant character set used locoscript languages 1 7 certain characters range 0..127 swapped characters range 128..255 character set according following table | [
3764,
2521,
7798,
2438
] | Test |
1,458 | 6 | Bonnie++:bonnie++ bonnie++ free software file system benchmarking tool unix-like operating systems developed russell coker bonnie++ benchmark suite aimed performing number simple tests hard drive file system performance bonnie++ allows benchmark file systems perform respect data read write speed number seeks performed per second number file metadata operations performed per second ./bonnie++ -u root final csv output includes information related data read write speed number seeks performed per second number file metadata operations performed per second cpu usage statistics given tests benchmark named bonnie++ based bonnie benchmark written tim bray | [
7442,
3326,
2451,
1183,
2743,
7403,
578,
2522,
5571,
3156,
352,
1451,
1331
] | Test |
1,459 | 4 | Safe@Office:safe office safe office line firewall vpn appliances developed sofaware technologies check point company check point safe office product line targeted small medium business segment includes 500 500w wi-fi series internet security appliance old s-box safe home 100 series 200 series 400w series discontinued appliances licensed according number protected ip addresses referenced users numbers 5 25 unlimited also variant built-in adsl modem | [
3223,
6043,
4014,
1805
] | Validation |
1,460 | 2 | Security_Support_Provider_Interface:security support provider interface security support provider interface sspi win32 api used microsoft windows systems perform variety security-related operations authentication sspi functions common interface several security support providers ssps security support provider dynamic-link library dll makes one security packages available applications following ssps installed windows sspi proprietary variant gssapi extensions windows-specific data types shipped windows nt 3.51 windows 95 nt lan manager security support provider ntlmssp windows 2000 implementation kerberos 5 added using token formats conforming official protocol standard rfc 1964 kerberos 5 gssapi mechanism providing wire-level interoperability kerberos 5 implementations vendors tokens generated accepted sspi mostly compatible gss-api sspi client windows may able authenticate gss-api server unix depending specific circumstances one significant shortcoming sspi lack makes gssapi interoperability impossible another fundamental difference ietf-defined gssapi microsoft sspi concept impersonation model server switch operate full privileges authenticated client operating system performs access control checks e.g opening new files whether less privileges privileges original service account depends entirely client connects/authenticates traditional gssapi model server runs service account elevate privileges perform access control client-specific application-specific fashion obvious negative security implications impersonation concept prevented windows vista restricting impersonation selected service accounts impersonation implemented unix/linux model using seteuid related system calls means unprivileged process elevate privileges also means take advantage impersonation process must run root another process cap_setuid capability | [
7149,
363,
3,
6795,
6420,
714,
720,
1464,
2928,
7907,
5747,
3293,
5399,
6458,
2587,
7567,
7925,
2953,
6840,
422,
5773,
7214,
4014,
1513,
4017,
2620,
6504,
448,
4022,
794,
4026,
1526,
7607,
3350,
3687,
5808,
2993,
1168,
1173,
2283,
2644,... | Validation |
1,461 | 4 | Vulnerability_scanner:vulnerability scanner vulnerability scanner computer program designed assess computers networks applications known weaknesses plain words scanners used discover weaknesses given system utilized identification detection vulnerabilities arising mis-configurations flawed programming within network-based asset firewall router web server application server etc modern vulnerability scanners allow authenticated unauthenticated scans modern scanners typically available saas software service provided internet delivered web application modern vulnerability scanner often ability customize vulnerability reports well installed software open ports certificates host information queried part workflow cis critical security controls effective cyber defense designates continuous vulnerability scanning critical control effective cyber defense | [
3932,
6515,
4583,
3088,
2829,
3681,
3448,
294,
2105,
4492,
3189,
566,
651,
2566,
6725,
5485,
1376,
5577,
5135,
3794,
2577,
5401,
6363,
2310,
6823,
1708,
2491,
5149,
6376,
7106,
848,
330,
6756,
3486,
2789,
74,
7865,
4645,
1899,
4914,
713... | Train |
1,462 | 5 | Border_Gateway_Protocol:border gateway protocol border gateway protocol bgp standardized exterior gateway protocol designed exchange routing reachability information among autonomous systems internet protocol classified path vector protocol border gateway protocol makes routing decisions based paths network policies rule-sets configured network administrator involved making core routing decisions bgp may used routing within autonomous system application referred interior border gateway protocol internal bgp ibgp contrast internet application protocol may referred exterior border gateway protocol external bgp ebgp current version bgp version 4 bgp4 published rfc 4271 2006 progressing 20 drafts documents based rfc 1771 version 4 rfc 4271 corrected errors clarified ambiguities updated specification common industry practices major enhancement support classless inter-domain routing cidr use route aggregation decrease size routing tables bgp4 use internet since 1994 ipv6 bgp first defined rfc 1883 1995 improved rfc 2283 1998 new rfc allows bgp-4 carry wide range ipv4 ipv6 address families also called multiprotocol extensions multiprotocol bgp mp-bgp bgp neighbors called peers established manual configuration among routers create tcp session port 179 bgp speaker sends 19-byte keep-alive messages every 60 seconds maintain connection among routing protocols bgp unique using tcp transport protocol bgp runs two peers autonomous system referred internal bgp ibgp interior border gateway protocol runs different autonomous systems called external bgp ebgp exterior border gateway protocol routers boundary one exchanging information another called border edge routers simply ebgp peers typically connected directly ibgp peers interconnected intermediate routers deployment topologies also possible running ebgp peering inside vpn tunnel allowing two remote sites exchange routing information secure isolated manner main difference ibgp ebgp peering way routes received one peer propagated peers instance new routes learned ebgp peer typically redistributed ibgp peers well ebgp peers transit mode enabled router however new routes learned ibgp peering re-advertised ebgp peers route-propagation rules effectively require ibgp peers inside interconnected full mesh routes propagated controlled detail via route-maps mechanism mechanism consists set rules rule describes routes matching given criteria action taken action could drop route could modify attributes route inserting routing table peering handshake open messages exchanged bgp speakers negotiate optional capabilities session including multiprotocol extensions various recovery modes multiprotocol extensions bgp negotiated time creation bgp speaker prefix network layer reachability information nlri advertises address family prefix families include ipv4 default ipv6 ipv4/ipv6 virtual private networks multicast bgp increasingly bgp used generalized signaling protocol carry information routes may part global internet vpns order make decisions operations peers bgp peer uses simple finite state machine fsm consists six states idle connect active opensent openconfirm established peer-to-peer session bgp implementation maintains state variable tracks six states session bgp defines messages peer exchange order change session one state another first state idle state idle state bgp initializes resources refuses inbound bgp connection attempts initiates tcp connection peer second state connect connect state router waits tcp connection complete transitions opensent state successful unsuccessful starts connectretry timer transitions active state upon expiration active state router resets connectretry timer zero returns connect state opensent state router sends open message waits one return order transition openconfirm state keepalive messages exchanged upon successful receipt router placed established state established state router send/receive keepalive update notification messages to/from peer simplest arrangement routers within single participating bgp routing must configured full mesh router must configured peer every router causes scaling problems since number required connections grows quadratically number routers involved alleviate problem bgp implements two options route reflectors rfc 4456 bgp confederations rfc 5065 following discussion basic update processing assumes full ibgp mesh given bgp router may accept network layer reachability information nlri updates multiple neighbors advertise nlri different set neighbors conceptually bgp maintains master routing table called local routing information base loc-rib separate main routing table router neighbor bgp process maintains conceptual adjacent routing information base incoming adj-rib-in containing nlri received neighbor conceptual adj-rib-out outgoing nlri sent neighbor conceptual preceding paragraph means physical storage structure various tables decided implementer bgp code structure visible bgp routers although usually interrogated management commands local router quite common example store two adj-ribs loc-rib together data structure additional information attached rib entries additional information tells bgp process things whether individual entries belong adj-ribs specific neighbors whether peer-neighbor route selection process made received policies eligible loc-rib whether loc-rib entries eligible submitted local router routing table management process eligible submitted bgp submit routes considers best main routing table process depending implementation process bgp route necessarily selected example directly connected prefix learned router hardware usually preferred long directly connected route interface active bgp route destination put routing table interface goes preferred routes loc-rib route would installed main routing table recently common mistake say bgp carries policies bgp actually carried information rules inside bgp-speaking routers could make policy decisions information carried explicitly intended used policy decisions communities multi-exit discriminators med bgp standard specifies number decision factors ones used common routing process selecting nlri go loc-rib first decision point evaluating nlri next-hop attribute must reachable resolvable another way saying next-hop must reachable must active route already main routing table router prefix next-hop address reachable next neighbor bgp process applies various standard implementation-dependent criteria decide routes conceptually go adj-rib-in neighbor could send several possible routes destination first level preference neighbor level one route destination installed conceptual adj-rib-in process also delete adj-rib-in routes withdrawn neighbor whenever conceptual adj-rib-in changes main bgp process decides neighbor new routes preferred routes already loc-rib replaces given route withdrawn neighbor route destination route removed loc-rib longer sent bgp main routing table manager router route destination non-bgp source withdrawn route removed main routing table verifying next hop reachable route comes internal i.e ibgp peer first rule apply according standard examine local_preference attribute several ibgp routes neighbor one highest local_preference selected unless several routes local_preference latter case route selection process moves next tie breaker local_preference first rule standard reachability next_hop verified cisco several vendors first consider decision factor called weight local router i.e transmitted bgp route highest weight preferred local_preference weight criteria manipulated local configuration software capabilities manipulation outside scope standard commonly used example community attribute see directly used bgp selection process bgp neighbor process however rule set local_preference another factor based manually programmed rule set attribute community value matches pattern matching criterion route learned external peer per-neighbor bgp process computes local_preference value local policy rules compares local_preference routes neighbor per-neighbor level ignoring implementation-specific policy modifiers order tie breaking rules recent edition bgp standard update multi_exit_disc value several implementations created med highest possible value current standard however specifies missing meds treated lowest possible value since current rule may cause different behavior vendor interpretations bgp implementations used nonstandard default value configuration feature allows old standard rule selected candidate routes received neighbors loc-rib software applies additional tie-breakers routes destination one route still tied point several bgp implementations offer configurable option load-share among routes accepting number bgp communities attribute tags applied incoming outgoing prefixes achieve common goal rfc 1997 common say bgp allows administrator set policies prefixes handled isps generally possible strictly speaking instance bgp natively concept allow one tell another restrict advertisement prefix north american peering customers instead isp generally publishes list well-known proprietary communities description one essentially becomes agreement prefixes treated examples common communities include local preference adjustments geographic peer type restrictions dos avoidance black holing prepending options isp might state routes received customers community xxx:500 advertised peers default community xxx:501 restrict advertisement north america customer simply adjusts configuration include correct community communities route isp responsible controlling prefix advertised end user technical ability enforce correct actions taken isp though problems area generally rare accidental common tactic end customers use bgp communities usually asn:70,80,90,100 control local preference isp assigns advertised routes instead using med effect similar also noted community attribute transitive communities applied customer rarely become propagated outside next-hop isps give communities public bgp extended community attribute added 2006 order extend range attributes provide community attribute structuring means type field extended format consists one two octets type field followed seven six octets respective community attribute content definition extended community attribute documented rfc 4360 iana administers registry bgp extended communities types extended communities attribute transitive optional bgp attribute however bit type field within attribute decides whether encoded extended community transitive non-transitive nature iana registry therefore provides different number ranges attribute types due extended attribute range usage manifold rfc 4360 exemplarly defines two-octet specific extended community ipv4 address specific extended community opaque extended community route target community route origin community number bgp qos drafts also use extended community attribute structure inter-domain qos signalling note since rfc 7153 extended communities compatible 32 bits asns introduction 32 bits numbers issues immediately obvious community attribute defines 16 bits asn field prevents matching field real asn value reason rfc 8092 rfc 8195 introduce large community attribute 12 bytes divided three field 4 bytes function parameter meds defined main bgp standard originally intended show another neighbor advertising preference several links preferred inbound traffic another application meds advertise value typically based delay multiple presence ixp impose send traffic destination following bgp version 4 message header format autonomous system internal bgp ibgp must ibgp peers connect full mesh everyone speaks everyone directly full-mesh configuration requires router maintain session every router large networks number sessions may degrade performance routers due either lack memory high cpu process requirements route reflectors confederations reduce number ibgp peers router thus reduce processing overhead route reflectors pure performance-enhancing technique confederations also used implement fine-grained policy route reflectors reduce number connections required single router two redundancy made route reflector routers need configured peers confederations sets autonomous systems common practice one confederation numbers seen internet whole confederations used large networks large configured encompass smaller manageable internal ass confederations used conjunction route reflectors confederations route reflectors subject persistent oscillation unless specific design rules affecting bgp interior routing protocol followed however alternatives introduce problems including following additionally route reflectors bgp confederations designed ease bgp router configuration nevertheless common tools experienced bgp network architects tools may combined example hierarchy route reflectors routing tables managed bgp implementation adjusted continually reflect actual changes network links breaking restored routers going coming back network whole normal changes happen almost continuously particular router link changes supposed relatively infrequent router misconfigured mismanaged may get rapid cycle states pattern repeated withdrawal re-announcement known route flapping cause excessive activity routers know broken link route continually injected withdrawn routing tables bgp design delivery traffic may function routes updated internet bgp routing change may cause outages several minutes feature known route flap damping rfc 2439 built many bgp implementations attempt mitigate effects route flapping without damping excessive activity cause heavy processing load routers may turn delay updates routes affect overall routing stability damping route flapping exponentially decayed first instance route becomes unavailable quickly reappears damping take effect maintain normal fail-over times bgp second occurrence bgp shuns prefix certain length time subsequent occurrences timed exponentially abnormalities ceased suitable length time passed offending route prefixes reinstated slate wiped clean damping also mitigate denial service attacks damping timings highly customizable also suggested rfc 2439 design choices stability sensitive suppression route advertisement route flap damping feature desirable implemented exterior border gateway protocol sessions ebgp sessions simply called exterior peers interior border gateway protocol sessions ibgp sessions simply called internal peers approach route flaps inside autonomous system propagated external ass flapping route ebgp chain flapping particular route throughout backbone method also successfully avoids overhead route flap damping ibgp sessions however subsequent research shown flap damping actually lengthen convergence times cases cause interruptions connectivity even links flapping moreover backbone links router processors become faster network architects suggested flap damping may important used since changes routing table handled much faster routers led ripe routing working group write current implementations bgp flap damping application flap damping isp networks recommended ... flap damping implemented isp operating network cause side-effects customers internet users customers content services ... side-effects would quite likely worse impact caused simply running flap damping improving stability without problems flap damping subject current research one largest problems faced bgp indeed internet infrastructure whole growth internet routing table global routing table grows point older less capable routers cope memory requirements cpu load maintaining table routers cease effective gateways parts internet connect addition perhaps even importantly larger routing tables take longer stabilize see major connectivity change leaving network service unreliable even unavailable interim late 2001 global routing table growing exponentially threatening eventual widespread breakdown connectivity attempt prevent isps cooperated keeping global routing table small possible using classless inter-domain routing cidr route aggregation slowed growth routing table linear process several years expanded demand multihoming end user networks growth superlinear middle 2004 full ipv4 bgp table excess 512,000 prefixes many older routers limit 512k 512,000–524,288 routing table entries august 12 2014 outages resulting full tables hit ebay lastpass microsoft azure among others number cisco routers commonly use tcam form high-speed content-addressable memory storing bgp advertised routes impacted routers tcam default allocated 512k entries ipv4 routes 512k entries ipv6 routes reported number ipv6 advertised routes 20k number advertised ipv4 routes reached default limit causing spillover effect routers attempted compensate issue using slow software routing opposed fast hardware routing via tcam main method dealing issue involves operators changing tcam allocation allow ipv4 entries reallocating tcam reserved ipv6 routes requires reboot routers 512k problem predicted advance number professionals actual allocations pushed number routes 512k announcement 15,000 new routes short order starting 07:48 utc almost routes verizon autonomous systems 701 705 created result deaggregation larger blocks introducing thousands new routes making routing table reach 515,000 entries new routes appear reaggregated within 5 minutes instability across internet apparently continued number hours even verizon caused routing table exceed 512k entries short spike would happened soon anyway natural growth route summarization often used improve aggregation bgp global routing table thereby reducing necessary table size routers consider as1 allocated big address space would counted one route table due customer requirement traffic engineering purposes as1 wants announce smaller specific routes prefix hosts as1 announce specific route counts as1 announcing four routes as2 see four routes as1 routing policy as2 decide whether take copy four routes overlaps specific routes store summary as2 wants send data prefix sent routers as1 route as1 router either dropped destination unreachable icmp message sent back depending configuration as1 routers as1 later decides drop route leaving as1 drop number routes announces three as2 see three routes depending routing policy as2 store copy three routes aggregate prefix thereby reducing number routes as2 stores two as2 wants send data prefix dropped destination unreachable icmp message sent back routers as2 as1 would routing table rfc 1771 border gateway protocol 4 bgp-4 planned coding numbers 16 bits 64510 possible public since asn 64512 65534 reserved private use 0 65535 forbidden 2011 15000 numbers still available projections envisioning complete depletion available numbers september 2013 rfc 6793 extends coding 16 32 bits keeping 16 bits range 0 65535 reserved numbers allows 4 billion available additional private range also defined rfc 6996 4200000000 4294967294 4294967295 forbidden rfc 7300 allow traversal router groups able manage new asns new attribute ot as4_path used 32 bits asn assignments started 2007 another factor causing growth routing table need load balancing multi-homed networks trivial task balance inbound traffic multi-homed network across multiple inbound paths due limitation bgp route selection process multi-homed network announces network blocks across bgp peers result may one several inbound links become congested links remain under-utilized external networks picked set congested paths optimal like routing protocols bgp detect congestion work around problem bgp administrators multihomed network may divide large contiguous ip address block smaller blocks tweak route announcement make different blocks look optimal different paths external networks choose different path reach different blocks multi-homed network cases increase number routes seen global bgp table one method growing popularity address load balancing issue deploy bgp/lisp locator/identifier separation protocol gateways within internet exchange point allow ingress traffic engineering across multiple links technique increase number routes seen global bgp table design routers running bgp accept advertised routes bgp routers default allows automatic decentralized routing traffic across internet also leaves internet potentially vulnerable accidental malicious disruption known bgp hijacking due extent bgp embedded core systems internet number different networks operated many different organizations collectively make internet correcting vulnerability introducing use cryptographic keys verify identity bgp routers technically economically challenging problem extension bgp use multipathing typically requires identical med weight origin as-path although implementations provide ability relax as-path checking expect equal path length rather actual numbers path expected match extended features like cisco dmzlink-bw enables ratio traffic sharing based bandwidth values configured individual links multiprotocol extensions bgp mbgp sometimes referred multiprotocol bgp multicast bgp defined ietf nowiki rfc 4760 /nowiki extension bgp allows different types addresses known address families distributed parallel whereas standard bgp supports ipv4 unicast addresses multiprotocol bgp supports ipv4 ipv6 addresses supports unicast multicast variants multiprotocol bgp allows information topology ip multicast-capable routers exchanged separately topology normal ipv4 unicast routers thus allows multicast routing topology different unicast routing topology although mbgp enables exchange inter-domain multicast routing information protocols protocol independent multicast family needed build trees forward multicast traffic multiprotocol bgp also widely deployed case mpls l3 vpn exchange vpn labels learned routes customer sites mpls network order distinguish different customer sites traffic customer sites comes provider edge router pe router routing bgp4 standard internet routing required internet service providers isps establish routing one another large private ip networks use bgp internally example joining number large open shortest path first ospf networks ospf scale size required another reason use bgp multihoming network better redundancy either multiple access points single isp multiple isps routers especially small ones intended small office/home office soho use may include bgp software soho routers simply capable running bgp using bgp routing tables size commercial routers may need specific software executable image contains bgp license enables open source packages run bgp include gnu zebra quagga openbgpd bird xorp vyatta devices marketed layer 3 switches less likely support bgp devices marketed routers high-end layer 3 switches usually run bgp products marketed switches may may size limitation bgp tables 20,000 routes far smaller full internet table plus internal routes devices however may perfectly reasonable useful used bgp routing smaller part network confederation-as representing one several smaller enterprises linked bgp backbone backbones small enterprise announces routes isp accepts default route perhaps small number aggregated routes bgp router used network single point entry internet may much smaller routing table size hence ram cpu requirement multihomed network even simple multihoming modest routing table size see rfc 4098 vendor-independent performance parameters single bgp router convergence control plane actual amount memory required bgp router depends amount bgp information exchanged bgp speakers way particular router stores bgp information router may keep one copy route manage different policies route advertising acceptance specific neighboring term view often used different policy relationships running router one router implementation takes memory per route another implementation may legitimate design choice trading processing speed memory full ipv4 bgp table excess 590,000 prefixes large isps may add another 50 internal customer routes depending implementation separate tables may kept view different peer notable free open source implementations bgp include systems testing bgp conformance load stress performance come vendors | [
7148,
709,
4676,
4677,
4311,
7170,
5733,
4683,
6432,
1462,
5039,
6446,
2219,
3640,
4706,
4709,
3312,
7214,
7217,
2612,
3337,
1900,
456,
6879,
2281,
6521,
106,
1543,
2644,
6178,
6531,
2650,
121,
7637,
4414,
4783,
6908,
3379,
5492,
3383,
... | Train |
1,463 | 9 | L-attributed_grammar:l-attributed grammar l-attributed grammars special type attribute grammars allow attributes evaluated one depth-first left-to-right traversal abstract syntax tree result attribute evaluation l-attributed grammars incorporated conveniently top-down parsing syntax-directed definition l-attributed inherited attribute formula_1 right side formula_2 depends every s-attributed syntax-directed definition also l-attributed implementing l-attributed definitions bottom-up parsers requires rewriting l-attributed definitions translation schemes many programming languages l-attributed special types compilers narrow compilers based form l-attributed grammar strict superset s-attributed grammars used code synthesis either inherited attributes synthesized attributes associated occurrence symbol formula_5 | [
1361,
5326,
1498,
1580
] | Train |
1,464 | 5 | Password_Authentication_Protocol:password authentication protocol password authentication protocol pap password-based authentication protocol used point point protocol ppp validate users almost network operating system remote servers support pap pap specified pap considered weak authentication scheme weak schemes simple lighter computational overhead much vulnerable attack weak schemes may limited application constrained environments avoided general among pap deficiencies fact transmits unencrypted passwords i.e plain-text network pap therefore used last resort remote server support stronger scheme chap eap pap authentication done time initial link establishment verifies identity client using two-way handshake pap packet embedded ppp frame protocol field value c023 hex | [
3,
2993,
1460,
6717,
3293,
3794,
4261,
6045,
1593,
5880,
699
] | Test |
1,465 | 3 | SSE4:sse4 sse4 streaming simd extensions 4 simd cpu instruction set used intel core microarchitecture amd k10 k8l announced september 27 2006 fall 2006 intel developer forum vague details white paper precise details 47 instructions became available spring 2007 intel developer forum beijing presentation sse4 fully compatible software written previous generations intel 64 ia-32 architecture microprocessors existing software continues run correctly without modification microprocessors incorporate sse4 well presence existing new applications incorporate sse4 intel sse4 consists 54 instructions subset consisting 47 instructions referred sse4.1 intel documentation available penryn additionally sse4.2 second subset consisting 7 remaining instructions first available nehalem-based core i7 intel credits feedback developers playing important role development instruction set starting barcelona-based processors amd introduced sse4a instruction set 4 sse4 instructions 4 new sse instructions instructions found intel processors supporting sse4.1 amd processors started supporting intel sse4.1 sse4.2 full sse4 instruction set bulldozer-based fx processors sse4a misaligned sse feature also introduced meant unaligned load instructions fast aligned versions aligned addresses also allowed disabling alignment check non-load sse operations accessing memory intel later introduced similar speed improvements unaligned sse nehalem processors introduce misaligned access non-load sse instructions avx known ssse3 supplemental streaming simd extensions 3 introduced intel core 2 processor line referred sse4 media intel came ssse3 moniker internally dubbed merom new instructions intel originally plan assign special name criticized journalists intel eventually cleared confusion reserved sse4 name next instruction set extension intel using marketing term hd boost refer sse4 unlike previous iterations sse sse4 contains instructions execute operations specific multimedia applications features number instructions whose action determined constant field set instructions take xmm0 implicit third operand several instructions enabled single-cycle shuffle engine penryn shuffle operations reorder bytes within register instructions introduced penryn microarchitecture 45 nm shrink intel core microarchitecture support indicated via cpuid.01h ecx.sse41 bit 19 flag sse4.2 added sttni string text new instructions several new instructions perform character searches comparison two operands 16 bytes time designed among things speed parsing xml documents also added crc32 instruction compute cyclic redundancy checks used certain data transfer protocols instructions first implemented nehalem-based intel core i7 product line complete sse4 instruction set support indicated via cpuid.01h ecx.sse42 bit 20 flag instructions operate integer rather sse registers simd instructions appear time although introduced amd sse4a instruction set counted separate extensions dedicated cpuid bits indicate support intel implements popcnt beginning nehalem microarchitecture lzcnt beginning haswell microarchitecture amd implements beginning barcelona microarchitecture amd calls pair instructions advanced bit manipulation abm encoding lzcnt similar enough bsr bit scan reverse lzcnt performed cpu supporting intel cpu prior haswell perform bsr operation instead raising invalid instruction error despite different result values lzcnt bsr trailing zeros counted using bsf bit scan forward tzcnt instructions sse4a instruction group introduced amd barcelona microarchitecture instructions available intel processors support indicated via cpuid.80000001h ecx.sse4a bit 6 flag | [
6502,
2449,
2000,
1252,
2814,
3173,
2989,
4845,
6698,
3942,
3443,
4224,
6344,
811,
5559,
6523,
6616,
4108,
2744,
5670,
5665,
5934,
742,
3717,
5669,
584,
3803,
4611,
2226,
5055,
6647,
1961,
1770,
3565,
4077,
6563,
3248,
6133,
1881,
766,
... | Test |
1,466 | 1 | IBM_Query_Management_Facility:ibm query management facility ibm db2 query management facility qmf z/os business analytics software solution developed ibm originally created reporting interface ibm db2 z/os database used many customers generate reports key business decisions inception qmf ’ reports green-screen reports could accessed online qmf modern visual dashboarding analytical solution handles data db2 z/os also structured unstructured data sources oracle teradata adabas hadoop webpages dashboards reports deployed via workstation gui browser tablet embedded within applications 1 official ibm site | [
4798,
7213,
3268,
3005
] | Train |
1,467 | 4 | Threat_Intelligence_Platform:threat intelligence platform threat intelligence platform emerging technology discipline helps organizations aggregate correlate analyze threat data multiple sources real time support defensive actions tips evolved address growing amount data generated variety internal external resources system logs threat intelligence feeds help security teams identify threats relevant organization importing threat data multiple sources formats correlating data exporting organization ’ existing security systems ticketing systems tip automates proactive threat management mitigation true tip differs typical enterprise security products system programmed outside developers particular users platform tips also use apis gather data generate configuration analysis whois information reverse ip lookup website content analysis name servers ssl certificates traditional approach enterprise security involves security teams using variety processes tools conduct incident response network defense threat analysis integration teams sharing threat data often manual process relies email spreadsheets portal ticketing system approach scale team enterprise grows number threats events increases attack sources changing minute hour day scalability efficiency difficult tools used large security operations centers socs example produce hundreds millions events per day endpoint network alerts log events making difficult filter manageable number suspicious events triage threat intelligence platforms make possible organizations gain advantage adversary detecting presence threat actors blocking tackling attacks degrading infrastructure using threat intelligence businesses government agencies also identify threat sources data useful relevant environment potentially reducing costs associated unnecessary commercial threat feeds tactical use cases threat intelligence include security planning monitoring detection incident response threat discovery threat assessment tip also drives smarter practices back siems intrusion detection security tools finely curated relevant widely sourced threat intelligence tip produces advantage held tips ability share threat intelligence stakeholders communities adversaries typically coordinate efforts across forums platforms tip provides common habitat makes possible security teams share threat information among trusted circles interface security intelligence experts receive guidance implementing coordinated counter-measures full-featured tips enable security analysts simultaneously coordinate tactical strategic activities incident response security operations risk management teams aggregating data trusted communities threat intelligence platforms made several primary feature areas allow organizations implement intelligence-driven security approach stages supported automated workflows streamline threat detection management analysis defensive process track completion threat intelligence platforms deployed software appliance physical virtual on-premises dedicated public clouds enhanced community collaboration | [
2961,
429,
7125,
3433,
7158,
124,
6795,
8123,
7111,
3875
] | Test |
1,468 | 8 | Direct_Internet_Message_Encapsulation:direct internet message encapsulation direct internet message encapsulation dime microsoft-proposed internet standard early 2000s streaming binary encapsulated data internet according ietf web site standard withdrawn never made rfc status however microsoft one time recommend dime transmitting files via web services also used java ee differences implementation protocol made difficult first version submitted ietf november 2001 last update submitted june 2002 december 2003 dime lost competition message transmission optimization mechanism soap attachments microsoft describes dime superseded soap message transmission optimization mechanism mtom specification standard intended improved version mime particular difficulty mime message must encoded text sections separated separator given message header means entire stream data must known sender starting communication choose separator occur data useful entire stream available communication initiated searching expensive dime oriented streaming allowing example receiver process chunks message arrive without wait entire message dime defined transmission format data link layer osi model although typically transmitted http one difficulty could form http message essentially size limit size information chunk 32 bits 1 gigabit many http receivers unused messages large buffered messages would simply fail expecting short message receiving huge one moreover http receiver secured would receiving message send back challenge message 400 code sender http connectionless would entirely lose possibly huge amount data sent accept deny challenge entirely satisfactory solution response challenge could course succeed expense sending data twice huge rather defeats point fair say method sending data http suffers problem alternate probably better solution criteria successful challenge e.g username password established out-of-band sent message first time receive challenge by-product connectionless http protocol since message treated individual message must able successfully include challenge response dime extremely fast compared practical applications protocols data binary rather say base64 encoded relatively compact chunking packet methods built protocol meant could streamed read suitable receiver whole message read dime defined data link layer possible encapsulate dime message another dime message would help compression purposes occasionally useful bypass networking infrastructure routers network layer os model would otherwise block encapsulated traffic binary may treat suspicion said protocols mime may equally suffer since dime generally used well-trusted clients specific port could opened router express purpose sending receiving dime traffic subvert security aspects since challenge would still occur merely accepted binary traffic norm port give numerous false positives | [
1986,
5492,
4682
] | Test |
1,469 | 4 | Sherwood_Applied_Business_Security_Architecture:sherwood applied business security architecture sabsa sherwood applied business security architecture framework methodology enterprise security architecture service management developed independently zachman framework similar structure sabsa model methodology developing risk-driven enterprise information security architectures delivering security infrastructure solutions support critical business initiatives primary characteristic sabsa model everything must derived analysis business requirements security especially security enabling function new business opportunities developed exploited process analyzes business requirements outset creates chain traceability strategy concept design implementation ongoing ‘ manage measure ’ phases lifecycle ensure business mandate preserved framework tools created practical experience support whole methodology model layered top layer business requirements definition stage lower layer new level abstraction detail developed going definition conceptual architecture logical services architecture physical infrastructure architecture finally lowest layer selection technologies products component architecture sabsa model generic starting point organization going process analysis decision-making implied structure becomes specific enterprise finally highly customized unique business model becomes reality enterprise security architecture central success strategic program information security management within organization sabsa particular example methodology used information technology ot operational technology environments note original sabsa matrix still valid today expanded comprehensive service management matrix updated detail terminology areas words david lynas sabsa author sabsa matrix sabsa service management matrix updated since late 90s redesigned deliver improvements feedback requested years fundamentally changed structure principles matrices elements changed position focussed terminology update consistency new versions downloaded along 2009 revision sabsa white paper important documents like sabsa certification roadmap sabsa members web site | [
3433
] | Test |
1,470 | 5 | Realm-Specific_IP:realm-specific ip realm-specific ip experimental ietf framework protocol intended alternative network address translation nat end-to-end integrity packets maintained rsip lets host borrow one ip addresses udp/tcp port one rsip gateways leasing usually public ip addresses ports rsip hosts located usually private addressing realms rsip client requests registration rsip gateway gateway turn delivers either unique ip address shared ip address unique set tcp/udp ports associates rsip host address address rsip host uses address send packets destinations realm tunnelled packets rsip host gateway contain addresses rsip gateway strips host address header sends packet destination rsip also used relay traffic several different privately addressed networks leasing several different addresses reach different destination networks rsip useful nat traversal ietf standard alternative universal plug play upnp protocol experimental stage yet widespread use | [
2111,
5039,
2681,
3777
] | Test |
1,471 | 6 | Archive_file:archive file archive file file composed one computer files along metadata archive files used collect multiple data files together single file easier portability storage simply compress files use less storage space archive files often store directory structures error detection correction information arbitrary comments sometimes use built-in encryption archive files particularly useful store file system data metadata within contents particular file thus stored systems sent channels support file system question file contents – examples include sending directory structure email beyond archival purposes archive files frequently used packaging software distribution software contents often naturally spread across several files archive known package archival file format additional conventions contents requiring manifest file resulting format known package format examples include deb debian jar java apk android features supported various kinds archives include archive programs self-extraction self-installation source volume medium information package notes/description file extension file header archive file indicators file format used computer archive files created file archiver software optical disc authoring software disk image software archive format file format archive file formats well-defined authors become conventions supported multiple vendors communities filename extensions used distinguish different types archives include zip rar 7z tar java also introduced whole family archive extensions jar war j java w web used exchange entire byte-code deployment sometimes also used exchange source code text html xml files default compressed archive files often include parity checks checksums error detection instance zip files use cyclic redundancy check crc rar archives may include redundant error correction data called recovery records archive files sometimes accompanied separate parity archive par files allow additional error detection recovery particularly recovery missing files multi-file archive | [
1710,
7789,
1352,
2390,
2391,
2566,
658,
3548,
7555,
1955,
7746,
2589,
3559,
7662,
2324,
3219,
510,
1675,
4438,
598,
7023,
7584,
3152,
6232,
169,
3413
] | Test |
1,472 | 3 | Metal_Gear_(video_game):metal gear video game metal gear overhead military action-adventure stealth video game originally released 1987 konami msx2 computer japan parts europe considered progenitor stealth game genre first video game designed hideo kojima would go direct sequels reworked port game released famicom months later later saw release international markets nes following two years version developed without kojima involvement features drastically altered level designs among changes faithful port msx2 version later included playstation 2 well game released playstation 3 xbox 360 playstation vita newer ports featuring revised translation additional gameplay features game revolves around solid snake operative special forces unit foxhound goes solo infiltration mission fortified state outer heaven destroy metal gear bipedal walking tank capable launching nuclear missiles anywhere world well rescue number fellow agents captured enemy game major international success nes version selling 1million units united states player controls military operative codenamed solid snake whose objective infiltrate enemy base avoiding visual contact direct confrontation patrolling guards player seen game enters alert mode situation snake must escape enemy sight order resume infiltration method escaping varies depending circumstances behind discovery snake starts mission unarmed arm numerous firearms explosives obtained throughout enemy stronghold weapon limited ammunition supplies replenished obtaining ammunition caches additional supplies suppressor also obtained allows player fire handgun submachine gun without making noise weapons also used clear obstacles hollow walls electrified floors snake also use fists punch defeat patrolling enemies occasionally player defeats guard punches without alerting anyone defeated guard yield single unit rations ammo box picked addition enemy guards player also confronted mercenaries challenge player combat serving boss characters enemy base consists three different buildings multiple floors including basement levels within player uses key cards items unlock doors explore new areas door open corresponding key cards information obtained rescuing hostages held within buildings rescuing five hostages player rank increase one star maximum rank four stars allowing increased carrying capacity maximum health however hostage killed player demoted previous rank transceiver available snake keep touch commanding officer big boss one resistance members operating covertly near outer heaven schneider diane jennifer snake allies specializes specific subject usually provide information advice based player current area although reply always guaranteed player must keep track character frequency number order remain contact throughout game msx2 version requires use tape drive sony bitcorder order save load game progress checkpoints game master ii cartridge also used enable save states via floppy disks point versions later platforms eliminated complicated requirements thanks standardized storage devices memory cards internal disk drives player character solid snake rookie member special forces group foxhound sent first mission assisted via radio commanding officer big boss offers information mission objectives items well local resistance movement composed leader schneider former architect guides snake layout fortress knows locations key items diane former positive punk vocalist provides information enemy forces home jennifer infiltrated outer heaven medical staff find missing brother assists snake inside agent among prisoners snake rescues includes grey fox gray fox later versions foxhound agent captured previous mission dr. pettrovich dr. drago pettrovich madnar later releases robotic engineer working outer heaven doctor daughter elen kidnapped enemy coerce father developing metal gear bosses include shoot gunner renamed shotmaker later versions former spetsnaz agent specializing riot gun machinegun kid former sas operative armed machine gun fire trooper former gsg 9 operative uses flamethrower coward duck dirty duck later releases boomerang throwing terrorist shields hostages arnold bloody brad later releases two tx-11 class androids designed dr. pettrovich legendary mercenary founded outer heaven whose true identity unknown end near end 20th century west discovers weapon mass destruction constructed inside outer heaven fortified state founded legendary mercenary 200 km north galzburg south africa special forces unit foxhound sends top agent gray fox infiltrate fortress assess situation neutralize threat foxhound loses contact gray fox days later last transmission metal gear ... discover happened gray fox foxhound commander big boss sends newest recruit solid snake area operation codenamed intrude n313 upon insertion outer heaven snake makes contact local resistance members schneider diane jennifer using skills equipment procures site manages rescue fox fox explains metal gear codename nuclear-equipped bipedal walking tank engage forms combat launch nuclear weapons location outer heaven plans use metal gear impose new world superpower destroy metal gear topple outer heaven mercenaries snake rescues lead metal gear engineer dr. pettrovich daughter elen scientist explains metal gear destroyed snake takes outer heaven troops however begins notice traps put way precise wonders information activities tracked big boss begins act strangely giving misleading advice leads snake several traps eventually ordering abort mission breaking fourth wall telling player turn system moreover schneider ambushed hostiles presumed dead losing contact snake snake penetrates outer heaven main base takes metal gear reaches completion safely escapes compound basement confronted mercenary leader outer heaven turns big boss corrupt leader reveals using connections steal military intelligence establish mercenary force fund activities aim outer heaven become world greatest superpower able bring even west knees rookie snake sent hoping captured feed misinformation authorities quite obviously underestimated snake capabilities lost metal gear much force big boss seemingly starts self-destruct sequence compound promises die alone snake join snake defeats big boss last battle escapes outer heaven compound crumbles flames behind end credits message big boss displayed saying meet solid snake kojima asked take project senior associate metal gear intended action game featured modern military combat however msx2 hardware limited number on-screen bullets enemies kojima felt impeded combat aspect inspired great escape reversed focus gameplay shooting enemy avoiding capture game titled intruder early planning stages packaging illustration used retail releases game depicts protagonist solid snake holding gun traced publicity still michael biehn posing character kyle reese 1984 film terminator kojima still newly employed konami time involvement production illustration metal gear originally released msx2 home computer japan july 13 1987 english version released europe year due memory constraints japanese version written entirely katakana character names presented roman letters english version written entirely uppercase numerous instances erroneous grammar misspellings features fewer radio calls japanese version 56 calls kept shortened messages august 18 2004 konami released port msx2 metal gear feature phones konami net dx service japan promotional tie-in updated port served basis version included second disc subsistence expanded edition metal gear solid 3 playstation 2 released 2005 later hd edition released playstation 3 xbox 360 2011 playstation vita 2012 msx2 metal gear would released virtual console download wii japan december 8 2009 rom used emulated re-release modified bring in-line later versions game released platforms port metal gear family computer famicom released japan december 22 1987 followed english localization nintendo entertainment system nes released north america june 1988 published konami ultra games division europe australia sometime 1989 notably first version metal gear released north america since msx2 platform commercialized market according kojima account port developed another konami division tokyo given source code msx2 version without consent original team many changes made porting process later led version publicly disowned kojima masahiro ueno worked programmer nes version stated staff worked port given three-month deadline ordered make port different possible msx2 version konami executives due hardware limitations mapper used metal gear boss ended replaced supercomputer guarded four enemy soldiers another big change made game level designs instead underwater infiltration original version game starts solid snake parachuting middle jungle alongside three soldiers never seen mentioned outside intro landing jungle player must reach transport truck end take snake entrance first building player also use transport trucks reach entrances buildings quicker since travel cyclical pattern basement floors building 1 2 msx2 version made separate buildings building 4 5 respectively reachable going one two jungle mazes located outdoor areas three buildings correct path take jungle maze never revealed game addition removal metal gear tank hind boss rooftop building 1 also replaced pair armed turret gunners called twin shot nes version also lacks higher alert phase msx2 version jetpack-wearing soldiers rooftops building 1 2 lost ability fly making act like regular guards hand enemies longer drop ammo rations punched death much like msx2 version english localization nes versions contains numerous instances erroneous grammar contact missing grey fox uh-oh truck started move feel asleep passcodes used version save progress snake killed enemy player given choice continue game last checkpoint quit resume later given passcode passcode keeps track snake rank also determines checkpoint version inventory hostages rescued bosses defeated certain event flags one particular passcode featured japanese north american version player types expletive fuck fills remaining spaces 1 transport player final battle equipment resulted passcode system altered european versions game vowels removed msx2 version released north america time nes version one served basis couple home computer ports released ultra games 1990 ms-dos commodore 64 emulated port famicom version also included bonus disc packaged alongside limited edition gamecube console bundle released exclusively japan msx2 version metal gear ranked msx magazine top 20 best selling msx games japan five months debuting 4 october 1987 issue peaking 3 following month games machine gave positive review version giving game 79 global note praised graphics size game area underlining fact ensured action suspense never wanes also wrote game rapidly addictive urge get game quite strong concluded positively quality game saying standard konami software maintained maybe people think hard joining 200,000 msx owners computer gaming world called nes version graphics acceptable criticized control system player great vulnerability unarmed start game nonetheless stated metal gear shows great promise future ultra games entries attempts move beyond standard run/jump/shoot format nes games concluded game potential super-hit unfortunately sabotaged weaknesses nes version metal gear ranked 104th best game made nintendo system nintendo power top 200 games list gamesradar ranked sixth-best nes game ever made staff felt popularized genre nes version major international success selling 1million units united states success led creation two separately produced sequels first one snake revenge produced specifically nes north america europe 1990 sequel developed hideo kojima released japan msx2 year response former creation latter followed metal gear solid playstation 1998 turn followed numerous sequels spinoffs see metal gear series intro theme operation intrude n313 main theme theme tara game theme another dead soldier msx2 version reused vr training theme metal gear solid turn reused theme tara one tunes heard shadow moses island stage super smash bros. brawl wii music beginning section battleship halberd interior stage adventure mode snake officially enters storyline also selected music ipod item 1988 konami published gamebook adaptation metal gear japan second installment konami gamebook series gamebook set two years events game solid snake called back action foxhound receives intelligence terrorist group obtained plans metal gear mass-producing mech book portrays solid snake unsuccessful illustrator personal life outside job foxhound agent 1990 novelization metal gear published u.s. scholastic books part worlds power series novelizations based third-party nes games metal gear book written alexander frost pen name f.x nine pen name used authors worlds power series book adheres much closely localized version backstory presented north american packaging manual opposed actual in-game plot changed reflect difference big boss featured book instead two different characters commander south colonel vermon cataffy serve solid snake commanding officer outer heaven leader respectively book also gives solid snake identity justin halley changes name organization fox hound snake men book targeted young kids cover illustration altered snake handgun airbrushed public q event conducted london geoff keighley march 13 2014 series creator hideo kojima expressed interest developing remakes msx2 metal gear games order reconcile plot discrepancies since introduced series plans time due ongoing development prequel set events original metal gear however kojima since departed konami following release phantom pain leaving possibility remakes question metal gear remake mod alien swarm development granted permission konami use copyrighted material agreement n't make profit recreation accept donations production canceled june 3 2014 david hayter set voice solid snake new fan remake currently development using unreal engine 4 titled outer heaven | [
4023,
6380,
6151,
3049
] | Test |
1,473 | 3 | ARM_Cortex-A77:arm cortex-a77 arm cortex-a77 microarchitecture implementing armv8.2-a 64-bit instruction set designed arm holdings austin design centre cortex-a77 4-wide decode out-of-order superscalar design new 1.5k macro-op mops cache instruction fetch 6-wide 4-wide backend 12 execution ports pipeline depth 13 stages execution latencies 10 stages cortex-a77 serves successor cortex-a76 core supports unprivileged 32-bit applications privileged applications must utilize 64-bit armv8-a isa also supports load acquire ldapr instructions armv8.3-a dot product instructions armv8.4-a pstate speculative store bypass safe ssbs bit instructions armv8.5-a arm announced 23 35 increases respectively integer floating point performance memory bandwidth increased 15 relative a76 cortex-a77 support arm dynamiq technology expected used high-performance cores used combination cortex-a55 power-efficient cores cortex-a77 available sip core licensees design makes suitable integration sip cores e.g gpu display controller dsp image processor etc one die constituting system chip soc | [
451,
278,
6165,
550,
4847,
6421,
987,
5472,
469,
4041,
7890,
722,
3008,
7442,
3365,
4947,
6720,
3786,
2926,
5740,
5576,
6910,
5750,
4879,
5752,
5405,
7376,
5406,
5585,
7654,
1864,
6378,
5323,
677,
6753,
6389,
4537,
950,
67,
1977,
2339,
... | Validation |
1,474 | 8 | HAProxy:haproxy haproxy free open source software provides high availability load balancer proxy server tcp http-based applications spreads requests across multiple servers written c reputation fast efficient terms processor memory usage haproxy used number high-profile websites including godaddy github bitbucket stack overflow reddit speedtest.net tumblr twitter tuenti used opsworks product amazon web services haproxy written 2000 willy tarreau core contributor linux kernel still maintains project 2013 company haproxy technologies llc created continue developing software addition contributions open-source community company provides commercial offering haproxy enterprise appliance-based application-delivery controllers named aloha company provides technical support additional modules extend functionality haproxy haproxy following features haproxy enterprise edition enterprise-class version haproxy includes robust cutting-edge code base enterprise suite add-ons expert support professional services core incorporates feature backports haproxy development branch customers require immediate access latest functionality hardened version code haproxy technologies ’ aloha plug-and-play load-balancing appliance deployed environment aloha provides graphical interface templating system used deploy configure appliance main intention direct competitor hardware load balancing boxes/appliances companies still provide separate appliance load balancers f5 networks haproxy following version releases servers equipped dual-core opteron xeon processor generally achieve 15000 40000 hits per second trouble saturating 2 gbit/sec connection linux | [
3637,
2291,
5824,
3383,
3368,
4072,
7637,
5571,
5064,
3613,
3338,
7848,
578,
515,
1435
] | Train |
1,475 | 2 | Mail_(Windows):mail windows mail email newsgroup client developed microsoft included windows 8 8.1 10 operating systems main function mail sending receiving email successor outlook express either included released windows 9x family older versions windows nt family windows mail announced microsoft successor outlook express october 10 2005 via community website channel 9 initial version featured fundamental changes new user interface much way new features origins windows mail traced back pre-release version outlook express 7 included early builds windows vista known codename longhorn version outlook express introduced various changes user interface relied winfs management storage contacts data retaining support post office protocol pop internet message access protocol imap email protocols outlook express 7 dropped support http omission inherited windows mail windows mail user interface changed match look feel windows vista interface features imported microsoft outlook 2003 including right-hand reading pane microsoft help groups added preconfigured link microsoft newsgroups additional functionality layered top standard newsgroup functionality individual threads marked question answered question postings may rated well windows mail uses ipv6 domain name servers resolves ipv6 mail messages stored individual files instead single database file transactional index database based extensible storage engine enables real-time searching improves stability reliability stored data case corruption indices rebuilt mail files account setup information longer stored windows registry instead stored alongside mail making possible copy entire windows mail configuration mail store another machine single step bayesian junk-mail filtering top-level domain blocking encoding blocking added phishing filter incorporated well protecting users web sites identified malicious removed features windows mail include windows mail documented application programming interface api based component object model com predecessor outlook express also featured api undocumented except simple mapi messaging functionality windows vista supports american english french german spanish international sort windows mail absent windows 7 time microsoft intended spin several windows components independently developed apps introduced part windows essentials software suite thus windows mail omitted favor windows live mail made available windows xp vista 7 policy eventually reverted successors windows essentials apps gradually reintegrated windows 8 8.1 10 components windows live mail succeeded mail mail added windows 8 one many apps written run full-screen snapped per microsoft metro design language philosophy n't share code windows mail windows live mail lacks newsgroups support windows store app mail included app container calendar people three uninstalled reinstalled separately mail windows 8 comes preset server configurations popular email services outlook.com exchange gmail aol mail yahoo mail imap accounts configured directly support pop even though app run windows desktop multi-window support like many microsoft apps introduced windows 8 many features hidden charms initially hidden toolbar bottom screen revealed right-clicking users subscribed microsoft account sync configurations mail across different computers mail preset server configurations outlook.com exchange gmail icloud yahoo mail aol mail custom imap accounts still added pop support returned mail calendar still windows store apps app container updated together third sibling people moved container standalone app users set windows 10 mail use system theme choose custom accent color background image light/dark preference multi-window support open email messages new window emails listed mail jumplist mail uses settings panel email sorting tools second pane toolbar viewing pane like vista version mail version important controls readily visible accounts grouped relabeled folders created within app existing folders edited deleted mail default folders possible use outlook.com aliases mentions mail like microsoft outlook mail allows users set quick actions delete set flag archive respond messages system notifications swipe gestures mail rss reader ability customize default type font microsoft announced plans add features microsoft outlook outlook express mail uses invoke search – contrary microsoft products use | [
7879,
3937,
3263,
7887,
378,
2198,
6096,
6102,
735,
7553,
7195,
5410,
7564,
2953,
4352,
5070,
422,
6844,
2245,
5781,
435,
5442,
4377,
5090,
3340,
7602,
1152,
6164,
4759,
1534,
6885,
7619,
2999,
7975,
5475,
6528,
2290,
4774,
1181,
3711,
... | Test |
1,476 | 9 | Defun:defun defun short define function macro lisp family programming languages defines function global environment uses form defining function codice_1 adds two numbers defining function codice_2 squares number defining function returns codice_3 codice_4 | [
790,
7032,
4543,
1445,
7394,
2600
] | Test |
1,477 | 0 | LOLITA:lolita lolita natural language processing system developed durham university 1986 2000 name acronym large-scale object-based linguistic interactor translator analyzer lolita developed roberto garigliano colleagues 1986 2000 designed general-purpose tool processing unrestricted text could basis wide variety applications core semantic network containing 90,000 interlinked concepts text could parsed analysed incorporated semantic net could reasoned long garigliano 1993 fragments semantic net could also rendered back english spanish several applications built using system including financial information analysers information extraction tools darpa ’ “ message understanding conference competitions ” muc-6 muc-7 latter involved processing original wall street journal articles perform tasks identifying key job changes businesses summarising articles lolita one small number systems worldwide compete sections tasks system description analysis muc-6 results written callaghan callaghan 1998 lolita early example substantial application written functional language consisted around 50,000 lines haskell around 6000 lines c. also complex demanding application many aspects haskell invaluable development lolita designed handle unrestricted text ambiguity various levels unavoidable significant laziness essential handling explosion syntactic ambiguity resulting large grammar much used semantic ambiguity system used multiple domain specific embedded languages semantic pragmatic processing generation natural language text semantic net also important ability work complex abstractions prototype new analysis algorithms quickly later systems based design include concepts sensegraph | [
1314,
2740,
205,
5429,
4573,
5008,
1435
] | Validation |
1,478 | 9 | Chicken_(Scheme_implementation):chicken scheme implementation chicken stylized chicken programming language specifically compiler interpreter implement dialect programming language scheme compiles scheme source code standard c. mostly r5rs compliant offers many extensions standard newer r7rs standard supported extension library chicken free open-source software available bsd license implemented mostly scheme parts c performance make embedding c programs easier chicken focus quickly clear slogan practical portable scheme system chicken main focus practical application scheme writing real-world software scheme well known use computer science curricula programming language experimentation seen little use business industry chicken community produced large set libraries perform variety tasks chicken wiki software running also chicken program also contains list software written chicken chicken goal portable compiling intermediate representation case portable c gambit bigloo programs written chicken compiled common popular operating systems linux macos unix-like systems windows haiku mobile platforms ios android also built-in support cross-compiling programs extensions allows used various embedded system platforms like many scheme compilers chicken uses standard c intermediate representation scheme program translated c chicken compiler c compiler translates c program machine code target computer architecture producing executable program universal availability c makes useful purpose chicken design inspired 1994 paper henry baker outlined innovative strategy compile scheme c. scheme program compiled c functions c functions never reach return statement instead call new continuation complete continuations c functions passed extra arguments c functions calculated compiler far essence continuation-passing style baker novel idea use c call stack scheme heap hence normal c stack operations automatic variable creation variable-sized array allocation used stack fills stack pointer reaches top stack garbage collection initiated design used copying garbage collector originally devised c. j. cheney copies live continuations live objects heap despite c code copy c stack frames scheme objects require knowledge c implementation full scheme heap consists c stack nursery together two heaps required generational garbage collector approach gives speed c stack many operations allows use continuations simple calls c functions baker solution guarantees asymptotic tail recursive behavior required scheme language standard implementation chicken scheme compiler even asymptotically safe space chicken scheme mostly r5rs-compliant notable limitations deviations r7rs compatibility supplied extension library core system basic support utf-8 characters however string indexing manipulation procedures utf-8 aware extension library exists adds support full utf-8 awareness chicken large software repository added libraries programs termed eggs system similar rubygems initially eggs developed one central svn repository creating tag would automatically cause new version extension become available download currently eggs developed anywhere version control system still maintaining semi-automatic release management using popular code hosting sites release method vcs-agnostic sense user need vcses installed developer free host anywhere choose even choose avoid public version control distribute plain tarballs released eggs latest version tested automatically part continuous integration process canonical test server exists core system eggs tested daily recent development version catch regressive bugs recent stable version ensure everything works users stable system also anyone volunteer supply testing capacity different hardware operating systems core releases chicken supports r5rs standard scheme also adds nonstandard features available scheme implementations chicken compiling c makes possible inject custom c code compiled result eases integrating c libraries foreign function interface supports converting back forth built-in c types corresponding scheme objects also extension libraries exist interfacing python lua java via java native interface jni bridge relatively easy cross-compile scheme code another platform example embedded use device make cross-compiling possible scheme code chicken imposes model separate compiling compiled module consists two shared libraries one library contains actual code used runtime compiled target platform import module used load code runs compile-time host platform procedural macro code chicken compiler also easily cross-compiled translation c achieved one simply use c compiler set build another platform since version 4 chicken built-in module system support low-level hygienic macros explicit renaming macros version 4 available add-on library standard syntax-rules macros also supported implicit renaming macros basically reversed version explicit renaming mechanism trades performance convenience identifier explicitly injected unhygienic automatically renamed avoid name capture performance cost occurs implicit renaming requires macro-expander retraverse expressions two times cost paid expansion time macro author must consider longer compiling times acceptable since version 4.11 chicken comes shipped debugger named feathers scheme code compiled needed debugging option debugging events injected specific points code implemented calls c function relatively low-overhead actually debugging code debugging try make tcp connection feathers server process possibly different machine process halted user may set breakpoints start program breakpoint hit client process debugged enters command loop allows interrogation client read variables mutate chicken supports local flow analysis allows compiler catch variable type errors compile-time perform type specialisation specialisation makes possible remove several safety checks type detection runtime type deduced compile-time results improved run-time performance scrutinizer allow cross-module flow analysis used optimize code part one compiling unit module | [
7878,
1445,
5019,
1820,
6796,
6087,
2915,
5734,
2218,
4704,
5055,
5757,
6116,
1116,
6471,
7573,
2600,
5077,
1885,
6489,
1889,
6497,
6507,
795,
6876,
4759,
6888,
3368,
1557,
5494,
5501,
6210,
144,
4074,
6922,
4085,
7298,
5515,
8025,
3749,
... | Test |
1,479 | 8 | Java_API_for_RESTful_Web_Services:java api restful web services jax-rs java api restful web services jax-rs java programming language api spec provides support creating web services according representational state transfer rest architectural pattern jax-rs uses annotations introduced java se 5 simplify development deployment web service clients endpoints version 1.1 jax-rs official part java ee 6 notable feature official part java ee configuration necessary start using jax-rs non-java ee 6 environments small entry web.xml deployment descriptor required jax-rs provides annotations aid mapping resource class pojo web resource annotations use java package codice_1 include addition provides annotations method parameters pull information request codice_10 annotations take key form used look value required january 2011 jcp formed jsr 339 expert group work jax-rs 2.0 main targets among others common client api support hypermedia following hateoas-principle rest may 2013 reached final release stage 2017-08-22 jax-rs 2.1 specification final release published main new supported features include server-sent events reactive clients json-b implementations jax-rs include | [
2371,
718,
7347,
5646,
6986,
5299,
5571,
7370,
3383,
2126,
2322,
7390,
3488,
2517,
773,
2519,
5874,
3915,
2799,
2807
] | Test |
1,480 | 4 | Rubber-hose_cryptanalysis:rubber-hose cryptanalysis cryptography rubber-hose cryptanalysis euphemism extraction cryptographic secrets e.g password encrypted file person coercion torture—such beating person rubber hose hence name—in contrast mathematical technical cryptanalytic attack according amnesty international un many countries world routinely torture people therefore logical assume least countries use would willing use form rubber-hose cryptanalysis practice psychological coercion prove effective physical torture physically violent highly intimidating methods include tactics threat harsh legal penalties incentive cooperate may form plea bargain offer drop reduce criminal charges suspect return full co-operation investigators alternatively countries threats may made prosecute co-conspirators inflict violence upon close relatives e.g spouse children parents person questioned unless co-operate contexts rubber-hose cryptanalysis may viable attack need decrypt data covertly information password may lose value known compromised argued one purposes strong cryptography force adversaries resort less covert attacks earliest known use term sci.crypt newsgroup message posted 16 october 1990 marcus j. ranum alluding corporal punishment although term used tongue-in-cheek implications serious modern cryptosystems weakest link often human user direct attack cipher algorithm cryptographic protocols used likely much expensive difficult targeting people use manage system thus many cryptosystems security systems designed special emphasis keeping human vulnerability minimum example public-key cryptography defender may hold key encrypt message decryption key needed decipher problem defender may unable convince attacker stop coercion plausibly deniable encryption second key created unlocks second convincing relatively harmless message example apparently personal writings expressing deviant thoughts desires type lawful taboo defender prove handed keys whilst attacker remains unaware primary hidden message case designer expectation attacker realize forego threats actual torture risk however attacker may aware deniable encryption assume defender knows one key meaning attacker may refuse stop coercing defender even one keys revealed assumption defender still withholding additional keys hold additional information jurisdictions statutes assume opposite—that human operators know access things session keys assumption parallels made rubber-hose practitioners example united kingdom regulation investigatory powers act makes crime surrender encryption keys demand government official authorized act according home office burden proof accused person possession key rests prosecution moreover act contains defense operators lost forgotten key liable judged done recover key lead-up 2017 kenyan general election head information communication technology independent electoral boundaries commission christopher msando murdered played major role developing new voting system election body showed apparent marks torture concerns murderers tried get password information | [
1811,
4930,
464,
807,
1353,
2379,
907,
3100,
119,
212,
2303,
7548,
6637,
6647,
7200,
4805,
5765,
6657,
1587,
5333,
5773,
4536,
6763,
6049,
433,
1320,
613,
4741,
1146,
4917
] | Test |
1,481 | 3 | Memory-level_parallelism:memory-level parallelism memory-level parallelism mlp term computer architecture referring ability pending multiple memory operations particular cache misses translation lookaside buffer tlb misses time single processor mlp may considered form instruction-level parallelism ilp however ilp often conflated superscalar ability execute one instruction time e.g processor intel pentium pro five-way superscalar ability start executing five different microinstructions given cycle handle four different cache misses 20 different load microinstructions time possible machine superscalar nevertheless high mlp arguably machine ilp superscalar executes one instruction time non-pipelined manner performs hardware prefetching software instruction-level prefetching exhibits mlp due multiple prefetches outstanding ilp multiple memory operations outstanding instructions instructions often conflated operations furthermore multiprocessor multithreaded computer systems may said exhibit mlp ilp due parallelism—but intra-thread single process ilp mlp often however restrict terms mlp ilp refer extracting parallelism appears non-parallel single threaded code | [
5012,
1447,
5371,
3948,
7527,
7529,
5737,
4318,
2567,
4694,
5042,
5055,
2226,
1867,
2961,
2248,
3667,
2969,
6148,
441,
4742,
5447,
2266,
4047,
1546,
4049,
5483,
1556,
5487,
6198,
1568,
1570,
6922,
3041,
7666,
1586,
515,
8024,
5521,
3747,
... | Test |
1,482 | 4 | Dridex:dridex dridex also known bugat cridex form malware specializes stealing bank credentials via system utilizes macros microsoft word targets malware windows users open email attachment word excel causing macros activate download dridex infecting computer opening victim banking theft primary objective software steal banking information users infected machines immediately launch fraudulent transactions bank information software installs keyboard listener performs injection attacks 2015 theft caused software estimated £20 million united kingdom 10 million united states 2015 dridex attacks detected 20 countries early september 2016 researchers spotted initial support targeting crypto-currency wallets | [
2733,
1340,
2021,
1766,
4759,
7186,
1383
] | Test |
1,483 | 7 | Softkinetic:softkinetic softkinetic belgian company develops gesture recognition hardware software real-time range imaging 3d cameras time-of-flight cameras founded july 2007 softkinetic provides gesture recognition solutions based technology interactive digital entertainment consumer electronics health fitness serious game industries softkinetic technology applied interactive digital signage advergaming interactive television physical therapy originally centered providing software development kits middleware softkinetic branched internal game application development establishment softkinetic studios september 2009 softkinetic progressed hardware partnering time-of-flight camera developer optrima september 2010 two companies merging reformed softkinetic march 2011 softkinetic gesture recognition software platform named iisu recognize distinguish isolate different scenic elements identify track body parts user adapt user shape posture movements existing physical model vice versa iisu compatible major real-time range imaging cameras middleware guards developers particularities hardware softkinetic hardware solution named depthsense formerly optricam line 3d time-of-flight imagers based patented cmos sensor time-of-flight tof technologies based current assisted photonic demodulation capd company patented cmos pixel technology depthsense hardware products range sensors consumer professional 3d cameras softkinetic studios collaborated numerous gesture recognition-based projects various platforms pc consoles set-top boxes arcade interactive digital signage companies orange vallée fuel industries october 8th 2015 sony corporation announced acquisition company | [
5666
] | Validation |
1,484 | 7 | Thread_(network_protocol):thread network protocol thread ipv6-based low-power mesh networking technology iot products intended secure future-proof thread protocol specification available cost however requires agreement continued adherence eula states membership thread group necessary implement practice ship thread technology thread group specifications membership thread group subject annual membership fee except academic tier july 2014 thread group alliance announced working group companies nest labs subsidiary alphabet/google samsung arm holdings qualcomm nxp semiconductors/freescale silicon labs big ass solutions somfy osram tyco international lock company yale attempt thread become industry standard providing thread certification products august 2018 apple joined group raising hopes help popularize protocol thread uses 6lowpan turn uses ieee 802.15.4 wireless protocol mesh communication zigbee systems thread however ip-addressable cloud access aes encryption bsd licensed open-source implementation thread called openthread also released nest mentioned thread uses 6lowpan based use connecting router called edge router thread calls edge routers border routers unlike proprietary networks 6lowpan like network edge routers maintain application layer state networks forward datagrams network layer means 6lowpan remains unaware application protocols changes lowers processing power burden edge routers also means thread need maintain application layer thread states multiple application layers supported long low-bandwidth able operate ipv6 thread touts single point failure system however network set one edge router serve single point failure edge router another router assume role leader certain functions leader fails another router edge router take place main way thread guarantees single point failure thread promises high level security devices specifically authenticated join network communications network secured network key competing internet things iot protocols currently already wide use globally include wi-fi halow bluetooth 5 zigbee z-wave vemesh | [
7876,
3078,
6461,
6489,
6874,
6987,
1421,
5571,
7950,
1435,
38
] | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.