node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
10,486 | 5 | SOAP:soap soap abbreviation simple object access protocol messaging protocol specification exchanging structured information implementation web services computer networks purpose provide extensibility neutrality independence uses xml information set message format relies application layer protocols often hypertext transfer protocol http simple mail transfer protocol smtp message negotiation transmission soap allows processes running disparate operating systems windows linux communicate using extensible markup language xml since web protocols like http installed running operating systems soap allows clients invoke web services receive responses independent language platforms soap provides messaging protocol layer web services protocol stack web services xml-based protocol consisting three parts soap three major characteristics example soap procedures application send soap request server web services enabled—such real-estate price database—with parameters search server returns soap response xml-formatted document resulting data e.g. prices location features since generated data comes standardized machine-parsable format requesting application integrate directly soap architecture consists several layers specifications soap evolved successor xml-rpc though borrows transport interaction neutrality web service addressing envelope/header/body elsewhere probably wddx soap designed object-access protocol 1998 dave winer box bob atkinson mohsen al-ghosein microsoft atkinson al-ghosein working specification made available submitted ietf 13 september 1999 according box due politics within microsoft microsoft hesitation dave winer shipped xml-rpc 1998 submitted internet draft reach rfc status therefore considered standard version 1.1 specification published w3c note 8 may 2000 since version 1.1 reach w3c recommendation status considered standard either version 1.2 specification however became w3c recommendation june 24 2003 soap specification maintained xml protocol working group world wide web consortium group closed 10 july 2009 soap originally stood simple object access protocol version 1.2 standard dropped acronym soap first introduced became underlying layer complex set web services based web services description language wsdl xml schema universal description discovery integration uddi different services especially uddi proved far less interest appreciation gives complete understanding expected role soap compared web services actually evolved soap specification broadly defined consisting following 3 conceptual components protocol concepts encapsulation concepts network concepts soap specification defines messaging framework consists soap message ordinary xml document containing following elements smtp http valid application layer protocols used transport soap http gained wider acceptance works well today internet infrastructure specifically http works well network firewalls soap may also used https protocol http application level uses encrypted transport protocol underneath either simple mutual authentication advocated ws-i method provide web service security stated ws-i basic profile 1.1 major advantage distributed protocols like giop/iiop dcom normally filtered firewalls soap amqp yet another possibility implementations support soap also advantage dcom unaffected security rights configured machines require knowledge transmitting receiving nodes lets soap loosely coupled way possible dcom also soap-over-udp oasis standard xml information set chosen standard message format widespread use major corporations open source development efforts typically xml information set serialized xml wide variety freely available tools significantly eases transition soap-based implementation somewhat lengthy syntax xml benefit drawback promotes readability humans facilitates error detection avoids interoperability problems byte-order endianness slow processing speed cumbersome example corba giop ice dcom use much shorter binary message formats hand hardware appliances available accelerate processing xml messages binary xml also explored means streamlining throughput requirements xml xml messages self-documenting nature usually 'overhead headers footers nested tags delimiters actual data contrast earlier protocols overhead usually relatively small percentage overall message financial messaging soap found result 2–4 times larger message previous protocols fix financial information exchange cdr common data representation xml information set serialized xml instance csv json xml-infoset representations exist also need specify generic transformation framework concept soap bindings allows specific bindings specific application drawback senders receivers support newly defined binding post /instock http/1.1 host www.example.org content-type application/soap+xml charset=utf-8 content-length 299 soapaction http //www.w3.org/2003/05/soap-envelope xml version= 1.0 soap envelope xmlns soap= http //www.w3.org/2003/05/soap-envelope xmlns m= http //www.example.org /soap envelope | [
7690,
4107,
6688,
6694,
10791,
11303,
5677,
8751,
1586,
1079,
3131,
8766,
5700,
10313,
10829,
7765,
1128,
7784,
9834,
4213,
6775,
1657,
124,
4740,
6284,
6797,
148,
6805,
7320,
10910,
160,
1185,
4768,
4771,
4778,
10924,
2221,
2222,
4788,
9... | Validation |
10,487 | 4 | Messaging_Architects:messaging architects messaging architects canadian software company specializing e-mail products flagship product netmail integrated email management platform launched march 1995 chronofax company distributor computer-based fax solutions chronofax became tobit software north america result partnership german company called tobit produced fax software novell netware groupwise markets three-and-a-half-year partnership tobit came close company renamed messaging architects messaging architects initially provided add-ons novell groupwise messaging platform company offers integrated email management platform called netmail netmail consolidates company portfolio email software solutions includes netmail secure formerly gwguardian m+guardian netmail archive formerly m+archive netmail search netmail migrate formerly migrator netmail store formerly m+securestore company also provides email platform migration services messaging architects also highly skilled professional services team full novell microsoft exchange certification messaging architects works messaging platform providers provide solutions microsoft exchange novell groupwise lotus notes late 2008 mark crispin inventor imap worked messaging architects senior software engineer developing entirely new imap server based upon distributed mail store extending mix format messaging architects email security email archiving solutions positioned gartner magic quadrant reports 2009 m+archive positioned magic quadrant email active archiving 2009 m+guardian email security solution achieve one gold two vbspam platinum awards virus bulletin anti-spam certification messaging architects also offers range remote on-site services managing email risk co-existence different email platforms including professional services email migration services email consulting email policy training | [] | Validation |
10,488 | 9 | RAPID:rapid rapid high-level programming language used control abb industrial robots rapid introduced along s4 control system 1994 abb superseding arla programming language features language include | [
4466,
2045,
9330
] | None |
10,489 | 6 | RichCopy:richcopy richcopy discontinued file copy utility program developed ken tamaru microsoft corporation multi-threaded may thus circumstances copy files faster utilities available windows operating system additionally similarities like multithreaded copying microsoft utility robocopy provides complete graphical user interface gui whereas robocopy command-line utility although gui interfaces robocopy richcopy copy files opened certain combinations file sharing attributes process may open files exclusive read access withholding file_share_read another company created non-free gs richcopy 360 copy open files developed | [
2406,
2568,
4074,
5482,
7983,
7088,
10101,
1750,
7672,
894
] | None |
10,490 | 4 | SHRED:shred spam harassment reduction via economic disincentives shred proposed sender-at-risk e-mail stamp mechanism reducing e-mail spamming problem indirectly increasing cost e-mail sending senders unwanted e-mail aims avoid defects earlier sender-at-risk mechanisms main aim shred provide economic incentives legitimate isps clean botnet problem within networks making cheaper continue pay excess postage charges delivered spam messages whilst requiring shred mandated universally adopted effective smtp re-engineered shred differs e-mail postage stamp systems shred stamps represent potential financial liability e-mail sender rather unconditional cost incur replacement cost cancelled e-mail recipient considers e-mail unwanted shred thus effectively electronic reputation system reputation—in form able affix stamps e-mail—is lost complaints bought back money thus imposing financial cost loss reputation presence absence stamp used e-mail receivers together sources information blacklists whitelists content analysis make judgments whether e-mail relayed delivered | [
4883,
9909
] | Test |
10,491 | 2 | NeXT_RISC_Workstation:next risc workstation next risc workstation nrw unreleased computer workstation designed next early 1990s successor m68k-based nextcube nextstation initially nrw based motorola 88110 microprocessor due lack confidence motorola commitment 88k architecture later redesigned around dual powerpc 601s pre-production motherboards enclosures produced nrw enter production next exited hardware market 1993 | [
8048,
7806
] | Test |
10,492 | 4 | Web_application_security:web application security web application security branch information security deals specifically security websites web applications web services high level web application security draws principles application security applies specifically internet web systems majority web application attacks occur cross-site scripting xss sql injection attacks typically made possible flawed coding failure sanitize application inputs outputs attacks ranked 2009 cwe/sans top 25 dangerous programming errors according security vendor cenzic top vulnerabilities march 2012 include open web application security project owasp provides free open resources led non-profit called owasp foundation owasp top 10 2017 published result recent research based comprehensive data compiled 40 partner organizations data approximately 2.3 million vulnerabilities discovered across 50,000 applications according owasp top 10 2017 ten critical web application security risks include secure web application development enhanced applying security checkpoints techniques early stages development well throughout software development lifecycle special emphasis applied coding phase development security mechanisms used include threat modeling risk analysis static analysis digital signature among others owasp emerging standards body web application security particular published owasp top 10 describes detail major threats web applications web application security consortium wasc created web hacking incident database whid also produced open source best practice documents web application security whid became owasp project february 2014 security fundamentally based people processes number technical solutions consider designing building testing secure web applications high level solutions include | [
899,
5636,
6916,
10756,
1803,
9356,
3473,
8978,
3604,
10392,
5373,
5246,
4892,
5404,
2975,
2084,
2213,
2470,
8998,
10020,
939,
10412,
3629,
9646,
7855,
1970,
5682,
7352,
5433,
571,
3643,
7739,
3262,
9791,
1474,
3525,
2758,
10437,
7368,
91... | Test |
10,493 | 3 | Tile_processor:tile processor tile processors multicore manycore chips contain one-dimensional commonly two-dimensional arrays identical tiles tile comprises compute unit processing engine cpu caches switch tiles viewed adding switch core core comprises compute unit caches typical tile processor configuration switches tiles connected using one mesh networks tilera tile pro 64 example contains 64 tiles tiles comprises cpu l1 l2 caches switches several mesh networks processors tile configuration include seaforth24 kilocore kc256 xmos xcore microcontrollers massively parallel processor arrays | [
4880,
7699,
10675
] | Validation |
10,494 | 2 | Robotics_middleware:robotics middleware robotics middleware middleware used complex robot control software systems described software glue make easier robot builders focus specific problem area wide variety projects robotics middleware exist one dominates fact many robotic systems use middleware middleware products rely wide range different standards technologies approaches make use interoperation difficult developers may prefer integrate system player project formerly player/stage project project create free software research robotics sensor systems components include player network server stage robot platform simulators although accurate statistics hard obtain player one popular open-source robot interfaces research post-secondary education major intelligent robotics journals conferences regularly publish papers featuring real simulated robot experiments using player stage rt-middleware common platform standards robots based distributed object technology rt-middleware supports construction various networked robotic systems integration various network-enabled robotic elements called rt-components specification standard rt-components discussed defined object management group omg urbi open source cross-platform software platform c++ used develop applications robotics complex systems based uobject distributed c++ component architecture also includes urbiscript orchestration language parallel event-driven script language uobject components plugged urbiscript appear native objects scripted specify interactions data exchanges uobjects linked urbiscript interpreter executed autonomous processes remote mode either another thread another process machine local network machine distant network miro distributed object oriented framework mobile robot control based corba common object request broker architecture technology miro core components developed aid ace adaptive communications environment object oriented multi-platform framework os-independent interprocess network real time communication use tao ace orb orb object request broker corba implementation designed high performance real time applications currently supported platforms include pioneers b21 robot soccer robots various robotic sensors orca describes goals also state successful think framework objectives must general flexible extensible sufficiently robust high-performance full-featured use commercial applications yet sufficiently simple experimentation university research environments describe approach orca software released lgpl gpl licenses openrdk open-source software framework robotics developing loosely coupled modules provides transparent concurrency management inter-process via sockets intra-process via shared memory blackboard-based communication linking technique allows input/output data ports conceptual system design modules connecting simulators generic robot drivers provided rock robot construction kit software framework development robotic systems underlying component model based orocos rtt real time toolkit rock provides tools required set run high-performance reliable robotic systems wide variety applications research industry contains rich collection ready use drivers modules use system easily extended adding new components isaac nvidia® isaac software development kit sdk developer toolbox accelerating development deployment artificial intelligence-powered robots sdk includes isaac robot engine packages high-performance robotics algorithms perform perception navigation hardware reference applications isaac sim virtual robotics laboratory high-fidelity 3d world simulator accelerates research design development robotics reducing cost risk developers quickly easily train test robots detailed highly realistic scenarios open source community version available github suppported hardware platform includes bom details refer kaya-robot ros robot operating system collection software frameworks robot software development heterogeneous computer cluster ros provides standard operating system services hardware abstraction low-level device control implementation commonly used functionality message-passing processes package management yarp open-source software package written c++ interconnecting sensors processors actuators robots | [
968,
8122,
3412,
6128
] | Test |
10,495 | 4 | Racetrack_problem:racetrack problem racetrack problem specific instance type race condition racetrack problem flaw system process whereby output and/or result process unexpectedly critically dependent sequence timing events run circular pattern note problem semantically different race condition circular nature problem term originates idea two signals racing circular motion influence output first racetrack problems occur electronics systems especially logic circuits computer software especially multithreaded distributed programs | [
6184,
7446
] | Test |
10,496 | 4 | Webroot_Window_Washer:webroot window washer webroot window washer tool designed protect user privacy permanently deleting traces web browsing history personal information files computer running microsoft windows currently versions planned program longer updated window washer .95 first launch product originally designed remove unwanted files accumulate computer ’ hard drive surfing internet areas trace file removal include internet history address bar cache cookies recent documents list recycle bin icq history temporary internet files stored computer web search window washer total removal feature completely erases everything found hard drive including operating system beginning 1.0 version launch mid-1998 new process added file deletion process known “ bleaching ” file encryption process seeks files random characters names destroys permanently removes computer ’ hard drive custom cookie selection feature also added allow users select specific cookies excluded deletion process making homepages internet preferences logins passwords stored future visits website software updates also included ability clean chk files created scandisk third party programs files activex java downloaded internet explorer 2.0 version updates launched late 1998 primarily designed able match advancements visual improvements windows 95/98 nt 4.0 window washer adapted user interface allow users use software multiple users programming new window ’ operations systems version window washer also supported netscape 4.5 internet explorer 5.0 well added features came along keyword storing feature search engines personal information stored entered online auto-complete form users also gained ability reassign wash path commonly washed items command-line washes routine cleaning cycles reprogrammed include cleaning information stored windows registry aka “ streams ” deletes tracking paths past actions user additional features 2.0 launch included real-time counter drive space restored items washed added status window custom plug-ins also made available beginning version history pathways left behind popular media programs realplayer adobe acrobat would included wash cycles customizable user interface added feature 3.0 version launch early 2000 additional third party plug-ins made available download well ability wash recent history cache windows media player increased compatibility also added netscape 6 msn explorer 6 aol 6 interface updated include easier custom configuration preferences settings notable upgrade 4.0 version addition automatic check updates feature release also included enhanced password security improvement destroying deleting function bleaching increased efficiency cleaning sweeps overall version 4.0 made window washer compatible aol 7.0 beta netscape 6.1 windows xp internet explorer 6.0 window washer 5.0 eventually included requested feature one-click personal privacy safety option shreds permanently destroys deletes files folders version 5.0 also came built safety feature prompts user confirm requested delete files categories personal files commonly stored operating system files saved files unintentionally deleted 5.0 features included cookie keeper helps maintain internet settings personal favorites option organize frequently visited sites without deleted clean-up cycles 6.0 product launch included completely new user interface well cleaning internet browsers including mozilla firefox version 6.6 latest version product available makes window washer compatible windows 7 windows vista operating system 32 bit 64 bit also includes cleaning functions internet explorer 8 | [
2257,
9713,
6797,
7983
] | Test |
10,497 | 0 | ClearForest:clearforest clearforest israeli software company developed marketed text analytics text mining solutions founded 1998 clearforest headquarters outside boston development center yehuda company acquired reuters april 2007 markets services names calais opencalais onecalais clearforest previously venture-backed last funding round led greylock ventures closed 2005 investors included db capital partners pitango walden israel booz allen jp morgan partners harbourvest partners february 7 2008 reuters announced launch open calais named-entity recognition semantic analysis service uses clearforest technology april 30 2007 reuters announced would acquire clearforest sources estimate acquisition 25 million clearforest offers several hosted solutions including clearforest also offers text analytics solutions targeted specific business problems including | [
8440,
2059,
5078
] | None |
10,498 | 1 | UK_Detector_Finds_Database:uk detector finds database uk detector finds database initiative members metal-detecting community united kingdom promote good practice within hobby online facility detectorists record finds ensure information preserved future generations joining scheme immediate access database uploading details finds instructions provided stage process personal gallery created user entering first record grows may browsed searched way personal database items submitted reviewed scheme team experts full identification details provided confirmed soon possible users also able record detector make model performance different circumstances different types find may assessed | [
2901
] | Test |
10,499 | 2 | IncludeOS:includeos includeos minimal open source unikernel operating system cloud services iot includeos allows users run c++ applications cloud without operating system includeos adds operating system functionality application allowing oneself create 'virtual machine application includeos applications boot tens milliseconds require megabytes disk memory minimalist architecture includeos means virtual memory space turn therefore concept system calls user space | [
2560,
6155,
7187,
10776,
25,
4637,
9762,
4643,
6180,
7217,
10803,
10809,
576,
2625,
8262,
6221,
3160,
10333,
97,
11363,
6760,
10856,
9835,
7285,
4727,
9335,
634,
1147,
3197,
1150,
5247,
11390,
2179,
10883,
10891,
6797,
10382,
6296,
2201,
... | Validation |
10,500 | 3 | Palm_IIIc:palm iiic palm iiic first colour pda made palm inc started sold 1998 ran palm os 3.5 first palm os version native colour support supported paletted 8-bit colour modes machine tft lcd bright indoors palm iiic features classic iii-series connector 8mb ram 20mhz dragonball ezi cpu unit also lithium ion rechargeable battery slightly modified version original palm iii chassis | [
2308,
6790,
3606,
8982,
6178,
5164,
9013,
694,
5318,
3017,
11337,
9037,
2258,
1621,
4832,
4449,
2285,
1776,
2420,
8952,
9598
] | Test |
10,501 | 3 | PowerPC_7xx:powerpc 7xx powerpc 7xx family third generation 32-bit powerpc microprocessors designed manufactured ibm motorola freescale semiconductor family called powerpc g3 well-known customer apple inc. introduced november 10 1997 term powerpc g3 often incorrectly imagined microprocessor fact number microprocessors different vendors used designations applied macintosh computers powerbook g3 multicolored imacs ibooks several desktops including beige blue white power macintosh g3s low power requirements small size made processors ideal laptops name lived last days apple ibook 7xx family also widely used embedded devices like printers routers storage devices spacecraft video game consoles 7xx family shortcomings namely lack smp support simd capabilities relatively weak fpu motorola 74xx range processors picked 7xx left powerpc 740 750 codename arthur introduced late 1997 evolutionary replacement powerpc 603e enhancements included faster 60x system bus 66 mhz larger l1 caches 32 kb instruction 32 kb data second integer unit enhanced floating point unit higher core frequency 750 support optional 256 512 1024 kb external unified l2 cache cache controller cache tags on-die cache accessed via dedicated 64-bit bus 740 750 added dynamic branch prediction 64-entry branch target instruction cache btic dynamic branch prediction uses recorded outcome branch stored 512-entry 2-bit branch history table bht predict outcome btic caches first two instructions branch target 740/750 models 6.35 million transistors initially manufactured ibm motorola aluminium based fabrication process die measured 67 mm 0.26 μm reached speeds 366 mhz consuming 7.3 w. 1999 ibm fabricated versions 0.20 μm process copper interconnects increased frequency 500 mhz decreased power consumption 6 w die size 40 mm 740 slightly outperformed pentium ii consuming far less power smaller die off-die l2 cache 750 increased performance approximately 30 situations design successful quickly surpassed powerpc 604e integer performance causing planned 604 successor scrapped powerpc 740 completely pin compatible older 603 allowing upgrades powerbook 1400 2400 even prototype powerbook 500/g3 750 l2 cache bus required pins thus different package 360-pin ball grid array bga powerpc 750 used many computers apple including original imac radiation-hardened processor based powerpc 750 intended use high radiation environments experienced board satellites spacecraft rad750 released purchase 2001 mars science laboratory curiosity mars reconnaissance orbiter spacecraft rad750 board processor 10.4 million transistors manufactured bae systems using either 250 150 nm process die area 130 mm² operates 110 200 mhz cpu withstand 200,000 1,000,000 rads temperature ranges −55 125 °c rad750 packaging logic functions price tag excess us 200,000 high price mainly due radiation hardening revisions powerpc 750 architecture manufacturing stringent quality control requirements extended testing processor chip manufactured motorola revised 740/750 design 1998 shrunk die size 51 mm thanks newer aluminium based fabrication 0.22 μm speeds increased 600 mhz 755 used ibook models model motorola chose keep developing 750 processors favour powerpc 7400 processor cores ibm continued develop powerpc 750 line introduced powerpc 750cx code-named sidewinder 2000 256 kib on-die l2 cache increased performance reducing power consumption complexity 400 mhz drew 4 w. 750cx 20 million transistors including l2 cache die size 43 mm 0.18 μm copper process 750cx used one imac ibook revision 750cxe codename anaconda introduced 2001 minor revision 750cx increased frequency 700 memory bus 100 mhz 133 mhz 750cxe also featured improved floating-point performance 750cx several ibook models last g3-based imac used processor cost reduced version 750cxe called 750cxr available lower frequencies gekko custom central processor nintendo gamecube game console based powerpc 750cxe adds 50 new instructions well modified fpu capable simd functionality 256 kib die l2 cache operates 485 mhz 162 mhz memory bus fabricated ibm 180 nm process die 43 mm large 750fx code-named sahara came 2002 increased frequency 900 mhz bus speed 166 mhz on-die l2 cache 512 kib also featured number improvements memory subsystem enhanced faster 200 mhz 60x bus controller wider l2 cache bus ability lock parts l2 cache manufactured using 0.13 μm copper based fabrication low-k dielectric silicon insulator technology 750fx 39 million transistors die size 35 mm consumes less 4 w 800 mhz typical loads last g3 type processor used apple employed ibook g3 low powered version 750fx available called 750fl 750fx powers nasa orion multi-purpose crew vehicle orion using honeywell international inc. flight computer originally built boeing 787 jet airliner 750gx codenamed gobi revealed 2004 latest powerful 7xx processor ibm on-die 1 mb l2 cache top frequency 1.1 ghz support bus speeds 200 mhz among enhancements compared 750fx manufactured using 0.13 μm process copper interconnects low-k dielectric silicon insulator technology 750gx 44 million transistors die size 52 mm consumes less 9 w 1 ghz typical loads low-power version 750gx available called 750gl 750vx codenamed mojave rumored confirmed canceled version 7xx line would powerful featured version date 4mb die l3 cache 400mhz ddr front side bus implementation altivec used powerpc 970 expected clock high 1.8 ghz starting 1.5 ghz reported additional pipeline stages advanced power management features reported finished ready production december 2003 said timing late get significant orders seeing apple ibook line switched g4s october year thus quickly fell roadmap never released heard since follow chips planned 750vxe would surpassed 2 ghz 750cl evolved 750cxe speeds ranging 400 mhz 1 ghz system bus 240 mhz l2 cache prefetch features graphics related instructions added improve performance added graphics-related functions match closely ones found gekko processor likely 750cl shrink processor general purpose use 750cl manufactured using 90 nm copper based fabrication low-k dielectric silicon insulator technology features 20 million transistors 16 mm die draws 2.7 w 600 mhz 9.8 w 1 ghz cpu wii virtually identical 750cl runs 729 mhz frequency supported stock 750cl measures 4.2 x 4.5 mm 18.9 mm smaller half size gekko microprocessor 43 mm incorporated gamecube first release cpu wii u believed evolution broadway architecture largely unconfirmed characteristics triple core cpu runs 1.24 ghz manufactured 45 nm process ibm ceased publish roadmap 750 family favor marketing custom processor vendor given ibm resources 750 core produced new features long willing buyer particular ibm public plans produce ordinary 750-based microprocessor process smaller 90 nm effectively phasing commodity chip competitive markets networking equipment however ibm make espresso processor nintendo 750 based design improvements multiprocessor support part triple core new 45 nm fabrication process edram instead regular l2 cache unknown changes made design 2015 rochester electronics started providing legacy support devices freescale discontinued 750 designs favor designs based powerpc e500 core powerquicc iii list complete list known 750 based designs pictures illustrations scale | [
6663,
5642,
1548,
1042,
2073,
1563,
8231,
11314,
8761,
6715,
576,
9302,
1635,
7269,
3185,
4211,
5235,
7286,
10872,
7299,
1158,
4743,
7302,
7305,
6311,
4264,
9391,
5297,
11447,
11449,
1725,
8896,
10945,
6878,
8931,
10985,
9964,
3319,
3323,
... | Test |
10,502 | 4 | Democratic_Congressional_Campaign_Committee_cyber_attacks:democratic congressional campaign committee cyber attacks friday july 29 2016 democratic congressional campaign committee reported computer systems infiltrated strongly believed us intelligence sources infiltrator groups russian foreign intelligence groups breached democratic national committee computer systems groups known fancy bear cozy bear sofacy crowdstrike assisted efforts deal dccc breach significant concern russians attempting influence 2016 presidential campaign russian cyber intrusions united states government private sector computer systems significantly increased u.s imposed sanctions russia invasion crimea ukraine president obama preference publicize cyber attacks | [
1024,
8320,
3843,
5636,
5764,
2187,
4240,
11152,
10003,
10132,
4117,
8726,
535,
1688,
2717,
9375,
1440,
5024,
9761,
4644,
4133,
5028,
11175,
297,
2857,
5547,
8489,
11052,
9518,
176,
7601,
1970,
9395,
9904,
8886,
1337,
441,
1979,
4027,
108... | Test |
10,503 | 4 | Areca_Backup:areca backup areca backup personal file backup software developed java released gnu general public license gpl 2 areca backup includes backup engine well graphical user interface command-line interface application includes following features areca also provides tools needed handle archives storage modes areca handle multiple storage modes backup types areca handle following types backups areca uses file size last modification time detect modified files one attributes modified whatever value file flagged modified allows fast detection modified files areca downloadable pre-packaged linux windows 2000/windows xp windows vista also runs operating system provided java runtime environment installed version 1.4.2 later translated chinese simplified chinese traditional czech danish dutch english french german hungarian italian japanese russian spanish swedish | [
9025,
7364,
6280,
5677,
1358,
7983,
823
] | None |
10,504 | 7 | Panzura:panzura panzura privately held company based us markets computer data storage products panzura founded 2008 randy chou john taylor members founding software team aruba networks company incorporated delaware first headquartered san jose california funded november 2010 12 million company initially funded matrix partners khosla ventures chevron technology ventures arm chevron corporation june 2012 opus capital led round 15 million funding included previous investors round 25 million funding june 2013 included meritech capital partners july 2013 flash memory maker sandisk announced new strategic investor alex lam sandisk joining board observer based campbell california 2013 panzura provides cloud storage data protection specialized cloud storage controllers panzura products accessed using network-attached storage nas protocols allow users secure access latest versions file widely distributed locations industry analysts sometimes call kind product cloud storage gateway available hardware appliance called quicksilver software-only use vmware esx quicksilver best show award may 2012 interop trade show panzura global cloud storage system integrates cloud storage platforms including amazon web services cleversafe emc atmos google hp cloud services nirvanix panzura received three patents technology 2013 panzura offers proprietary software delivered hardware appliances virtual machine licenses installed locally backup actively archive centralize data remote location architectural firm diller scofidio renfro credited panzura technology speeding backup recovery data hurricane sandy california state university northridge also used technology backing data march 2013 panzura announced achieved fips 140-2 security certification national institute standards technology use us government agencies contractors | [
7248,
1801,
420,
8446
] | Test |
10,505 | 1 | Database_tuning:database tuning database tuning describes group activities used optimize homogenize performance database usually overlaps query tuning refers design database files selection database management system dbms application configuration database environment operating system cpu etc. database tuning aims maximize use system resources perform work efficiently rapidly possible systems designed manage use system resources still much room improve efficiency customizing settings configuration database dbms hardware software configuration disk subsystems examined raid levels configuration block stripe size allocation configuration disks controller cards storage cabinets external storage systems sans transaction logs temporary spaces heavy consumers i/o affect performance users database placing appropriately crucial frequently joined tables indexes placed requested file storage retrieved parallel separate disks simultaneously frequently accessed tables indexes placed separate disks balance i/o prevent read queuing dbms tuning refers tuning dbms configuration memory processing resources computer running dbms typically done configuring dbms resources involved shared host system tuning dbms involve setting recovery interval time needed restore state data particular point time assigning parallelism breaking work single query tasks assigned different processing resources network protocols used communicate database consumers memory allocated data execution plans procedure cache much faster access data memory data storage maintaining sizable cache data makes activities perform faster consideration given work space caching execution plans procedures means reused instead recompiled needed important take much memory possible leaving enough processes os use without excessive paging memory storage processing resources sometimes assigned specific activities improve concurrency server eight processors six could reserved dbms maximize available processing resources database utilizes machine learning learn evaluate performance various workloads database maintenance includes backups column statistics updates defragmentation data inside database files heavily used database transaction log grows rapidly transaction log entries must removed log make room future entries frequent transaction log backups smaller interrupt database activity shorter periods time dbms use statistic histograms find data range table index statistics updates scheduled frequently sample much underlying data possible accurate updated statistics allow query engines make good decisions execution plans well efficiently locate data defragmentation table index data increases efficiency accessing data amount fragmentation depends nature data changed time amount free space database pages accept inserts data without creating additional pages | [
2688,
9481,
10258,
11667,
10518,
4376,
9112,
7968,
290,
1314,
7461,
3366,
8742,
2344,
5550,
7983,
5808,
10418,
9527,
3768,
5051,
3004,
9661,
9663,
4416,
2369,
5441,
5953,
11457,
8518,
72,
10699,
5840,
853,
2901,
9942,
9177,
987,
860,
9183... | Test |
10,506 | 9 | Server-side_scripting:server-side scripting server-side scripting technique used web development involves employing scripts web server produce response customized user client request website alternative web server deliver static web page scripts written number server-side scripting languages available see server-side scripting distinguished client-side scripting embedded scripts javascript run client-side web browser techniques often used together server-side scripting often used provide customized interface user scripts may assemble client characteristics use customizing response based characteristics user requirements access rights etc server-side scripting also enables website owner hide source code generates interface whereas client-side scripting user access code received client down-side use server-side scripting client needs make requests network server order show new information user via web browser requests slow experience user place load server prevent use application user disconnected server server serves data commonly used manner example according http ftp protocols users may choice number client programs modern web browsers request receive data using protocols case specialized applications programmers may write server client communications protocol used one another programs run user local computer without ever sending receiving data network considered clients operations programs would considered client-side operations netscape introduced implementation javascript server-side scripting netscape enterprise server first released december 1994 soon releasing javascript browsers server-side scripting later used early 1995 fred dufresne developing first web site boston television station wcvb technology described us patent 5835712 patent issued 1998 owned open invention network oin 2010 oin named fred dufresne distinguished inventor work server-side scripting today variety services use server-side scripting deliver results back client paid free service example would wolframalpha computational knowledge engine computes results outside clients environment returns computed result back commonly used service google proprietary search engine searches millions cached results related user specified keyword returns ordered list links back client apple siri application also employs server-side scripting outside web application application takes input computes result returns result back client earlier days web server-side scripting almost exclusively performed using combination c programs perl scripts shell scripts using common gateway interface cgi scripts executed operating system results served back web server many modern web servers directly execute on-line scripting languages asp jsp perl php ruby either web server via extension modules e.g mod_perl mod_php web server example webdna includes embedded database system either form scripting i.e. cgi direct execution used build complex multi-page sites direct execution usually results less overhead lower number calls external interpreters dynamic websites sometimes use custom web application servers glassfish plack python base http server library although may consider server-side scripting using dynamic web-based scripting techniques developers must keen understanding logical temporal physical separation client server user action trigger execution server-side code example developer working classic asp must explicitly cause user browser make request back web server creating interactions easily consume much development time lead unreadable code server-side scripts completely processed servers instead clients clients request page containing server-side scripts applicable server processes scripts returns html page client number server-side scripting languages available including | [
3462,
8582,
1802,
9229,
11154,
10387,
1556,
8858,
4507,
1435,
9245,
3876,
10020,
11688,
4777,
9981,
10026,
7212,
5677,
10284,
7983,
4658,
692,
2485,
9780,
1468,
4797,
7364,
8644,
1223,
5319,
5833,
10186,
11466,
3920,
9808,
5593,
5849,
1244,... | None |
10,507 | 9 | Asynchronous_module_definition:asynchronous module definition asynchronous module definition amd specification programming language javascript defines application programming interface api defines code module dependencies loads asynchronously desired implementations amd provide following benefits addition loading multiple javascript files runtime amd implementations allow developers encapsulate code smaller logically-organized files way similar programming languages java production deployment developers concatenate minify javascript modules based amd api one file traditional javascript amd specification implemented dojo toolkit requirejs libraries | [
1409,
259,
3462,
6791,
8854,
4378,
8605,
3743,
7455,
803,
5677,
3761,
11060,
438,
5311,
2880,
65,
7871,
9152,
4171,
11087,
339,
84,
4822,
4056,
5592,
9560,
603,
482,
5219,
7396,
487,
5483,
9195,
10991,
10097,
6143
] | None |
10,508 | 3 | IBM_System/360:ibm system/360 ibm system/360 s/360 family mainframe computer systems announced ibm april 7 1964 delivered 1965 1978 first family computers designed cover complete range applications small large commercial scientific design made clear distinction architecture implementation allowing ibm release suite compatible designs different prices partially compatible model 44 expensive systems use microcode implement instruction set features 8-bit byte addressing binary decimal hexadecimal floating-point calculations launch system/360 family introduced ibm solid logic technology slt new technology start powerful smaller computers slowest system/360 model announced 1964 model 30 could perform 34,500 instructions per second memory 8 64 kb high performance models came later 1967 ibm system/360 model 91 could 16.6 million instructions per second larger 360 models could 8 mb main memory though main memory big unusual—a large installation might little 256 kb main storage 512 kb 768 kb 1024 kb common 8 megabytes slower 8 microsecond large capacity storage lcs also available ibm 360 extremely successful market allowing customers purchase smaller system knowledge would always able migrate upward needs grew without reprogramming application software replacing peripheral devices many consider design one successful computers history influencing computer design years come chief architect system/360 gene amdahl project managed fred brooks responsible chairman thomas j. watson jr commercial release piloted another watson lieutenants john r. opel managed launch ibm ’ system 360 mainframe family 1964 application-level compatibility restrictions system/360 software maintained present day system z mainframe servers contrasting at-the-time normal industry practice ibm created entire new series computers small large low- high-performance using instruction set two exceptions specific markets feat allowed customers use cheaper model upgrade larger systems needs increased without time expense rewriting software introduction system/360 business scientific applications used different computers different instruction sets operating systems different-sized computers also instruction sets ibm first manufacturer exploit microcode technology implement compatible range computers widely differing performance although largest fastest models hard-wired logic instead flexibility greatly lowered barriers entry vendors customers choose machines could outgrow machines potentially powerful thus costly meant many companies simply buy computers ibm initially announced series six computers forty common peripherals ibm eventually delivered fourteen models including rare one-off models nasa least expensive model model 20 little 4096 bytes core memory eight 16-bit registers instead sixteen 32-bit registers system/360 models instruction set subset used rest range initial announcement 1964 included models 30 40 50 60 62 70 first three low- middle-range systems aimed ibm 1400 series market three first shipped mid-1965 last three intended replace 7000 series machines never shipped replaced 65 75 first delivered november 1965 january 1966 respectively later additions low-end included models 20 1966 mentioned 22 1971 25 1968 model 20 several sub-models sub-model 5 higher end model model 22 recycled model 30 minor limitations smaller maximum memory configuration slower i/o channels limited slower lower-capacity disk tape devices 30 model 44 1966 specialized model designed scientific computing real-time computing process control featuring additional instructions storage-to-storage instructions five complex instructions eliminated succession high-end machines included model 67 1966 mentioned briefly anticipated 64 66 85 1969 91 1967 anticipated 92 95 1968 195 1971 85 design intermediate system/360 line follow-on system/370 basis 370/165 system/370 version 195 include dynamic address translation implementations differed substantially using different native data path widths presence absence microcode yet extremely compatible except specifically documented models architecturally compatible 91 example designed scientific computing provided out-of-order instruction execution could yield imprecise interrupts program trap occurred several instructions read lacked decimal instruction set used commercial applications new features could added without violating architectural definitions 65 dual-processor version m65mp extensions inter-cpu signalling 85 introduced cache memory models 44 75 91 95 195 implemented hardwired logic rather microcoded models model 67 announced august 1965 first production ibm system offer dynamic address translation virtual memory hardware support time-sharing dat commonly referred mmu experimental one-off unit built based model 40 67 ibm announced models 64 66 dat versions 60 62 almost immediately replaced 67 time 60 62 replaced 65 dat hardware would reappear s/370 series 1972 though initially absent series like close relative 65 67 also offered dual cpus ibm stopped marketing system/360 models end 1977 ibm existing customers large investment software executed second-generation machines several models offered option emulation customer previous computer using combination special hardware special microcode emulation program used emulation instructions simulate target system old programs could run new machine however customers initially halt computer load emulation program ibm later added features modified emulator programs allow emulation 1401 1440 1460 1410 7010 control operating system model 85 later system/370 maintained precedent retaining emulation options allowing emulator programs execute operating system control alongside native programs system/360 excepting model 20 replaced compatible system/370 range 1970 model 20 users targeted move ibm system/3 idea major breakthrough fs technology dropped mid-1970s cost-effectiveness continuity reasons later compatible ibm systems include 4300 family 308x family 3090 es/9000 9672 families system/390 family ibm z series computers mostly identical compatible terms machine code architecture system/360 included amdahl 470 family successors hitachi mainframes univac 9000 series fujitsu facom rca spectra 70 series english electric system 4 system 4 machines built license rca rca sold spectra series univac became univac series 70 univac also developed univac series 90 successors 9000 series series 70 soviet union produced system/360 clone named es evm ibm 5100 portable computer introduced 1975 offered option execute system/360 apl.sv programming language hardware emulator ibm used approach avoid costs delay creating 5100-specific version apl special radiation-hardened otherwise somewhat modified system/360s form system/4 pi avionics computer used several fighter bomber jet aircraft complete 32-bit ap-101 version 4 pi machines used replicated computing nodes fault-tolerant space shuttle computer system five nodes u.s. federal aviation administration operated ibm 9020 special cluster modified system/360s air traffic control 1970 1990s 9020 software apparently still used via emulation newer hardware system/360 introduced number industry standards marketplace system/360 series computer system architecture specification specification makes assumptions implementation rather describes interfaces expected behavior implementation architecture describes mandatory interfaces must available implementations optional interfaces aspects architecture optional features models system/360 except model 20 model 44 implemented specification binary arithmetic logical operations performed register-to-register memory-to-register/register-to-memory standard feature commercial instruction set option installed packed decimal arithmetic could performed memory-to-memory memory-to-register operations scientific instruction set feature installed provided access four floating point registers could programmed either 32-bit 64-bit floating point operations models 85 195 could also operate 128-bit extended-precision floating point numbers stored pairs floating point registers software provided emulation models system/360 used 8-bit byte 32-bit word 64-bit double-word 4-bit nibble machine instructions operators operands could contain register numbers memory addresses complex combination instruction options resulted variety instruction lengths formats memory addressing accomplished using base-plus-displacement scheme registers 1 f 15 displacement encoded 12 bits thus allowing 4096-byte displacement 0-4095 offset address put base register register 0 could used base register index register branch address register 0 reserved indicate address first 4 kb memory register 0 specified described value 0x00000000 implicitly input effective address calculation place whatever value might contained within register 0 specified branch address register branch taken content register 0 ignored side effect instruction performed specific behavior permitted initial execution interrupt routines since base registers would necessarily set 0 first instruction cycles interrupt routine n't needed ipl initial program load boot one always clear register without need save exception model 67 addresses real memory addresses virtual memory available ibm mainframes system/370 series model 67 introduced virtual memory architecture mts cp-67 tss/360 used—but ibm mainline system/360 operating systems system/360 machine-code instructions 2 bytes long memory operands 4 bytes long one operand 6 bytes long two operands instructions always situated 2-byte boundaries operations like mvc move-characters hex d2 move 256 bytes information moving 256 bytes data required multiple mvc operations system/370 series introduced family powerful instructions mvcl move-characters-long instruction supports moving 16 mb single block operand two bytes long typically representing address 4-bit nibble denoting base register 12-bit displacement relative contents register range 000–fff shown hexadecimal numbers address corresponding operand contents specified general-purpose register plus displacement example mvc instruction moves 256 bytes length code 255 hexadecimal ff base register 7 plus displacement 000 base register 8 plus displacement 001 would coded 6-byte instruction d2ff 8001 7000 operator/length/address1/address2 system/360 designed separate system state problem state provided basic level security recoverability programming errors problem user programs could modify data program storage associated system state addressing data operation exception errors made machine enter system state controlled routine operating system could try correct terminate program error similarly could recover certain processor hardware errors machine check routines peripherals interfaced system via channels channel specialized processor instruction set optimized transferring data peripheral main memory modern terms could compared direct memory access dma initially two types channels byte-multiplexer channels known time simply multiplexor channels connecting slow speed devices card readers punches line printers communications controllers selector channels connecting high speed devices disk drives tape drives data cells drums every system/360 except model 20 standard 360 byte-multiplexer channel 1 selector channels smaller models model 50 integrated channels larger models model 65 channels large separate units separate cabinets ibm 2860 2870 60 62 70 allowed 2860 selector channels assumption would smaller 360s attached would slow-speed work byte-multiplexer channel able handle i/o to/from several devices simultaneously device highest rated speeds hence name multiplexed i/o devices onto single data path main memory devices connected byte-multiplexer channel configured operate 1-byte 2-byte 4-byte burst mode larger blocks data used handle progressively faster devices example 2501 card reader operating 600 cards per minute would 1-byte mode 1403-n1 printer would burst mode also byte-multiplexer channels larger models optional selector subchannel section would accommodate tape drives byte-multiplexor channel address typically 0 selector subchannel addresses c0 ff thus tape drives system/360 commonly addressed 0c0-0c7 common byte-multiplexer addresses 00a 2501 card reader 00c/00d 2540 reader/punch 00e/00f 1403-n1 printers 010-013 3211 printers 020-0bf 2701/2703 telecommunications units addresses still commonly used z/vm virtual machines system/360 models 40 50 integrated 1052-7 console usually addressed 01f however connected byte-multiplexer channel rather direct internal connection mainframe model 30 attached different model 1052 1051 control unit models 60 75 also use 1052-7 selector channels enabled i/o high speed devices storage devices attached control unit channel control unit let clusters devices attached channels higher speed models multiple selector channels could operate simultaneously parallel improved overall performance control units connected channels bus tag cable pairs bus cables carried address data information tag cables identified data bus general configuration channel connect devices chain like mainframe—control unit x—control unit y—control unit z control unit assigned capture range addresses services example control unit x might capture addresses 40-4f control unit c0-df control unit z 80-9f capture ranges multiple 8 16 32 64 128 devices aligned appropriate boundaries control unit turn one devices attached example could control unit 6 disks would addressed c0-c5 three general types bus-and-tag cables produced ibm first standard gray bus-and-tag cable followed blue bus-and-tag cable finally tan bus-and-tag cable generally newer cable revisions capable higher speeds longer distances peripherals specified minimum cable revisions upstream downstream cable ordering control units channel also significant control unit strapped high low priority device selection sent mainframe channel selection sent x- y- z- y- x control unit high selection checked outbound direction low inbound direction thus control unit x either 1st 5th either 2nd 4th z 3rd line also possible multiple channels attached control unit multiple mainframes thus providing rich high-performance multiple-access backup capability typically total cable length channel limited 200 feet less preferred control unit accounts 10 feet 200-foot limit ibm introduced new type i/o channel model 85 model 195 2880 block multiplexer channel channel allowed device suspend channel program pending completion i/o operation thus free channel use another device channels support either standard 1.5 mb/second connections 2-byte interface feature 3 mb/second latter use one tag cable two bus cables initial use 2305 fixed-head disk 8 exposures alias addresses rotational position sensing rps standard system/370 thereafter block multiplexer channels operate selector channel allow compatible attachment legacy subsystems uncertain reliability availability new monolithic integrated circuits ibm chose instead design manufacture custom hybrid integrated circuits built 11 mm square ceramic substrates resistors silk screened discrete glass encapsulated transistors diodes added substrate covered metal lid encapsulated plastic create solid logic technology slt module number slt modules flip chip mounted onto small multi-layer printed circuit slt card card one two sockets one edge plugged onto pins one computer slt boards reverse company cards mounted cards pins printed contact areas plugged sockets computer boards twenty slt boards could assembled side-by-side vertically horizontally form logic gate several gates mounted together constituted box-shaped logic frame outer gates generally hinged along one vertical edge could swung open provide access fixed inner gates larger machines could one frame bolted together produce final unit multi-frame central processing unit cpu smaller system/360 models used basic operating system/360 bos/360 tape operating system tos/360 disk operating system/360 dos/360 evolved dos/vs dos/vse vse/af vse/sp vse/esa z/vse larger models used operating system/360 os/360 ibm developed several versions os/360 increasingly powerful features primary control program pcp multiprogramming fixed number tasks mft multiprogramming variable number tasks mvt mvt took long time develop usable system less ambitious mft widely used pcp used intermediate machines final releases os/360 included mft mvt system/370 later machines mft evolved os/vs1 mvt evolved os/vs2 svs single virtual storage various versions mvs multiple virtual storage culminating current z/os announced model 67 august 1965 ibm also announced tss/360 time-sharing system delivery time 67 tss/360 response multics ambitious project included many advanced features performance problems delayed canceled reinstated finally canceled 1971 customers migrated cp-67 mts michigan terminal system tso time sharing option os/360 one several time-sharing systems cp-67 original virtual machine system also known cp/cms cp/67 developed outside ibm mainstream ibm cambridge scientific center cooperation mit researchers cp/cms eventually wide acceptance led development vm/370 virtual machine primary interactive sub operating system known vm/cms conversational monitoring system evolved today z/vm model 20 offered simplified rarely used tape-based system called tps tape processing system dps disk processing system provided support 2311 disk drive tps could run machine 8 kb memory dps required 12 kb pretty hefty model 20 many customers ran quite happily 4 kb cps card processing system tps dps card reader used read job control language cards defined stack jobs run read transaction data customer payments operating system held tape disk results could also stored tapes hard drives stacked job processing became exciting possibility small adventurous computer user little-known little-used suite 80-column punched-card utility programs known basic programming support bps jocularly barely programming support precursor tos available smaller systems ibm created new naming system new components created system/360 although well-known old names like ibm 1403 ibm 1052 retained new naming system components given four-digit numbers starting 2 second digit described type component follows ibm developed new family peripheral equipment system/360 carrying older 1400 series interfaces standardized allowing greater flexibility mix match processors controllers peripherals earlier product lines addition system/360 computers could use certain peripherals originally developed earlier computers earlier peripherals used different numbering system ibm 1403 chain printer 1403 extremely reliable device already earned reputation workhorse sold 1403-n1 adapted system/360 also available optical character recognition ocr readers ibm 1287 ibm 1288 could read alpha numeric a/n numeric hand printed nhp/nhw characters cashier rolls tape full legal size pages time done large optical/logic readers software slow expensive time small systems sold ibm 1052-7 console typewriter tightly integrated cpu — keyboard would physically lock program control certain high-end machines could optionally purchased 2250 graphical display costing upwards us 100,000 360/85 used 5450 display console compatible anything else line later 3066 console 370/165 370/168 used basic display design 360/85 first disk drives system/360 ibm 2302s ibm 2311s 156 kb/second 2302 based earlier 1302 available model 3 two 112.79 mb modules model 4 four modules 2311 removable 1316 disk pack based ibm 1311 theoretical capacity 7.2 mb although actual capacity varied record design used 360/20 1316 pack formatted fixed-length 270 byte sectors giving maximum capacity 5.4mb 1966 first 2314s shipped device eight usable disk drives integral control unit nine drives one reserved spare drive used removable 2316 disk pack capacity nearly 28 mb disk packs 2311 2314 physically large today standards — e.g. 1316 disk pack diameter six platters stacked central spindle top bottom outside platters store data data recorded inner sides top bottom platters sides inner platters providing 10 recording surfaces 10 read/write heads moved together across surfaces platters formatted 203 concentric tracks reduce amount head movement seeking data written virtual cylinder inside top platter inside bottom platter disks usually formatted fixed-sized sectors today hard drives though done cp/cms rather system/360 i/o software could customize length data record variable-length records case magnetic tapes powerful early system/360s used high-speed head-per-track drum storage devices 3,500 rpm 2301 replaced 7320 part original system/360 announcement capacity 4 mb 303.8 kb/second ibm 2303 announced january 31 1966 capacity 3.913 mb drums announced system/360 system/370 niche later filled fixed-head disks 6,000 rpm 2305 appeared 1970 capacities 5 mb 2305-1 11 mb 2305-2 per module although devices large capacity speed transfer rates made attractive high-performance needs typical use overlay linkage e.g os application subroutines program sections written alternate memory regions fixed head disks drums particularly effective paging devices early virtual memory systems 2305 although often called drum actually head-per-track disk device 12 recording surfaces data transfer rate 3 mb per second rarely seen ibm 2321 data cell mechanically complex device contained multiple magnetic strips hold data strips could randomly accessed placed upon cylinder-shaped drum read/write operations returned internal storage cartridge ibm data cell noodle picker among several ibm trademarked speedy mass online direct-access storage peripherals reincarnated recent years virtual tape automated tape librarian peripherals 2321 file capacity 400 mb time 2311 disk drive 7.2 mb ibm data cell proposed fill cost/capacity/speed gap magnetic tapes—which high capacity relatively low cost per stored byte—and disks higher expense per byte installations also found electromechanical operation less dependable opted less mechanical forms direct-access storage model 44 unique offering integrated single-disk drive standard feature drive used 2315 ramkit cartridge provided 1,171,200 bytes storage 2400 tape drives consisted combined drive control unit plus individual 1/2 tape drives attached system/360 ibm switched ibm 7 track 9 track tape format 2400 drives could purchased read wrote 7-track tapes compatibility older ibm 729 tape drives 1967 slower cheaper pair tape drives integrated control unit introduced 2415 1968 ibm 2420 tape system released offering much higher data rates self-threading tape operation 1600bpi packing density remained product line 1979 despite sold leased large numbers mainframe system era system/360 computers remain mainly non-operating property museums collectors examples existing systems include running list remaining system/360s found world inventory remaining system/360 cpus gallery shows operator console register value lamps toggle switches middle pictures emergency pull switch upper right pictures various models us television series mad men 2007–2015 ibm 360 featured plot device company leased system advertising agency prominent background seventh season crowdfunding campaign rescuing restoring ibm 360 system nuremberg received successful funding | [
512,
7173,
9739,
10267,
8732,
10786,
10796,
3630,
7733,
6207,
9291,
2638,
9811,
11351,
2652,
6242,
9829,
6248,
8301,
6772,
4726,
2168,
9351,
9355,
663,
1176,
6296,
8352,
6821,
1702,
10415,
2224,
6325,
7349,
9911,
1219,
2243,
8388,
6342,
9... | Test |
10,509 | 7 | Openbravo:openbravo openbravo cloud-based software provider specialized retail solutions head office openbravo s.l located pamplona spain openbravo also offices barcelona paris mexico df kolkata company main product openbravo commerce cloud cloud-based pos retail management solution worldwide distribution implementations software openbravo relies heavily partner network openbravo multiple-time winner infoworld bossie award best open source software application last awarded august 2014 openbravo roots development business administration software first developed two employees university navarra nicolas serrano ismael ciordia involved mid 1990s developing management university used emerging internet technologies work subsequently introduced new approach web applications concept realized new company called tecnicia founded august 2001 serrano ciordia aguinaga 2005 two management consultants manel sarasa josep mitjá asked venture capital company evaluate tecnicia prepare business plan evolution 2006 two consultants joined tecnicia ceo coo respectively around time spanish investment company sodena invested 6.4 million usd development company 2006 company renamed openbravo first product launched openbravo erp code open-sourced april year 2007 company announced acquisition librepos java-based point-of-sale pos application retail hospitality businesses librepos rebranded openbravo pos openbravo java pos may 2008 openbravo attracted three investors amadeus uk gimv belgium adara spain second investment round totalling 12.5 million usd investment launched openbravo one leading open source companies substantial resources develop products services july 2012 openbravo launched openbravo retail vertical solution retail industry including openbravo web pos new pos solution replaced previous openbravo java pos openbravo web pos web mobile responsive pos solution march 2014 openbravo erp renamed openbravo erp platform openbravo retail renamed openbravo commerce platform may 2015 openbravo commerce platform openbravo erp platform renamed openbravo commerce suite openbravo business suite openbravo announces strategic focus retail openbravo also launches openbravo subscription management recurring billing specialized solution recurring transactions based revenue models openbravo present 60 countries global partner network openbravo targets today mid-sized large organizations seeking complete solution manage entire business specific solutions help improve existing legacy systems openbravo focuses strategy retail openbravo commerce suite openbravo erp first product launched openbravo web-based erp business solution small medium-sized companies released openbravo public license based mozilla public license model program originally based compiere erp program also open source released gnu general public license version 2 program among top ten active projects sourceforge january 2008 using openbravo erp organizations automate register common business processes following processes supported sales procurement manufacturing projects finance mrp numerous commercial extensions available openbravo exchange procured users commercial edition openbravo erp paid-for version offers additional functionality compared free community edition integrated administration tools non-technical tool updates upgrades access openbravo exchange service level agreement characteristic openbravo erp application green web interface users maintain company data web-browser openbravo also create export reports data several formats pdf microsoft excel openbravo java-based architecture focuses two development models two models allow integration programs simple interface application open standards openbravo erp integrated open source applications like magento webshop pentaho business intelligence processmaker bpm liferay portal sugarcrm march 2014 openbravo erp renamed openbravo erp platform changed openbravo business suite may 2015 openbravo pos first pos solution offered openbravo java point-of-sale pos application retail hospitality businesses application came existence called tinapos legal reasons application renamed librepos 2007 librepos acquired openbravo known current name program completely integrated openbravo erp integration possible update stock levels financial journals customer data directly central database pos sales executed stores openbravo pos applied using pdas order intake july 2012 openbravo launched new pos solution openbravo web pos included openbravo commerce suite replaced openbravo java pos openbravo business suite launched may 2015 replacing previous openbravo erp platform global management solution built top openbravo technology platform including horizontal erp crm bi functionality across industries see latest confirmed stable cs release business suite release notes openbravo commerce suite openbravo solution retailers multi-channel retail management solution including responsive web mobile pos openbravo web pos backed comprehensive functionality merchandise management supply chain management enterprise management see latest confirmed stable cs release openbravo commerce suite release notes openbravo web pos launched 2012 included openbravo retail solution today openbravo commerce suite responsive web mobile pos solution core component functionality physical stores openbravo technology platform lies heart openbravo solutions modular mobile-enabled cloud-ready platform providing core set technologies allow extending openbravo fit companies needs developing completely new enterprise solutions looking best html5 framework openbravo mobile decided choose enyo openbravo web pos mobile solution openbravo analytics embedded analytics engine provides business intelligence capabilities openbravo solutions provides infrastructure necessary create analytical cubes olap reports combines power high performing open source business intelligence components pentaho use mondrian saiku allied openbravo user interface provide fully integrated analytics solution commercial solution companies recurring billing revenue models including functionality pricing definition automatic revenue recognition accounting openbravo user interface available multiple languages like english spanish french italian brazilian amongst others openbravo solutions distributed subscription-based model customers subscribe number users and/or pos terminals bundled pack services additional options two different commercial editions customers subscribe additional users and/or pos terminals well additional functionality packaged extension modules examples extension modules country localizations connectors like sugarcrm tools developed openbravo partners addition commercial editions community edition exists free limited set capabilities available without professional support available openbravo partners openbravo products distributed following licenses openbravo many partners across world including exceloid soft systems india | [
7489,
1539,
5224,
11113,
6091,
1612,
5677,
7532,
10509,
1008,
1680
] | Test |
10,510 | 9 | Scope_(computer_science):scope computer science computer programming scope name binding – association name entity variable – region computer program binding valid name used refer entity region referred parts program name may refer different entity may different binding nothing may unbound scope binding also known visibility entity particularly older technical literature – perspective referenced entity referencing name scope part program scope set bindings – precise definition tricky casual use practice largely corresponds block function file depending language type entity term scope also used refer set entities visible names valid within portion program given point program correctly referred context environment strictly speaking practice programming languages part program refers portion source code area text known lexical scope languages however part program refers portion run time time period execution known dynamic scope terms somewhat misleading – misuse technical terms discussed definition – distinction accurate precise standard respective terms lexical scope main focus article dynamic scope understood contrast lexical scope cases name resolution based lexical scope relatively straightforward use implement use one read backwards source code determine entity name refers implementation one maintain list names contexts compiling interpreting program difficulties arise name masking forward declarations hoisting considerably subtler ones arise non-local variables particularly closures strict definition lexical scope name identifier unambiguous – portion source code binding name entity applies – virtually unchanged 1960 definition specification algol 60 representative language specification follow commonly scope refers given name refer given variable – declaration effect – also apply entities functions types classes labels constants enumerations fundamental distinction scoping part program means languages lexical scope also called static scope name resolution depends location source code lexical context defined named variable function defined contrast languages dynamic scope name resolution depends upon program state name encountered determined execution context calling context practice lexical scope variable definition resolved searching containing block function fails searching outer containing block whereas dynamic scope calling function searched function called calling function progressing call stack course rules first look local definition variable modern languages use lexical scoping variables functions though dynamic scoping used languages notably dialects lisp scripting languages template languages perl 5 offers lexical dynamic scoping even lexically scoped languages scope closures confusing uninitiated depend lexical context closure defined called lexical resolution determined compile time also known early binding dynamic resolution general determined run time thus known late binding object-oriented programming dynamic dispatch selects object method runtime though whether actual name binding done compile time run time depends language de facto dynamic scoping common macro languages directly name resolution instead expand place programming frameworks like angularjs use term scope mean something entirely different used article frameworks scope object programming language use javascript case angularjs used certain ways framework emulate dynamic scope language uses lexical scope variables angularjs scopes scope scope using usual meaning term given part program following usual rules variable scope language like object using inheritance transclusion rules context angularjs sometimes term scope dollar sign used avoid confusion using dollar sign variable names often discouraged style guides scope important component name resolution turn fundamental language semantics name resolution including scope varies programming languages within programming language varies type entity rules scope called scope rules scoping rules together namespaces scoping rules crucial modular programming change one part program break unrelated part discussing scope three basic concepts scope extent context scope context particular frequently confused scope property identifier fixed context property program varies position precisely context property position program either position source code lexical context point run time execution context runtime context calling context execution context consists lexical context current execution point plus additional runtime state call stack thus execution point program variable name scope variable name context meaning context point execution point exits variable name scope returning function variable name goes context narrowly speaking execution program enters exits various scopes point execution identifiers context context hence identifiers come context go context program enters exits scope – however practice usage much looser scope source-code level concept property identifiers particularly variable function names – identifiers source code references entities program – part behavior compiler interpreter language issues scope similar pointers type reference used programs generally using value variable name context variable uninitialized analogous dereferencing accessing value wild pointer undefined however variables destroyed go context analog dangling pointer exist entities variables scope subset lifetime also known extent – name refer variable exists possibly undefined value variables exist necessarily visible variable may exist inaccessible value stored referred within given context accessible via given name case context program scope name cases lifetime irrelevant – label named position source code lifetime identical program statically compiled languages may context given point program likewise static variables – static global variable context entire program static local variable context within function local context lifetime entire run program determining entity identifier refers known name resolution name binding particularly object-oriented programming varies languages given identifier language properly compiler interpreter checks entities context matches case ambiguity two entities name global local variable name name resolution rules used distinguish frequently name resolution relies inner-to-outer rule python legb local enclosing global built-in rule names implicitly resolves narrowest relevant context cases name resolution explicitly specified codice_1 codice_2 keywords python cases default rules overridden two identical identifiers context time referring different entities one says name masking occurring higher-priority name usually innermost masking lower-priority name level variables known variable shadowing due potential logic errors masking languages disallow discourage masking raising error warning compile time run time various programming languages various different scoping rules different kinds declarations identifiers scoping rules large effect language semantics consequently behavior correctness programs languages like c++ accessing unbound variable well-defined semantics may result undefined behavior similar referring dangling pointer declarations identifiers used outside scope generate syntax errors scopes frequently tied language constructs determined implicitly many languages also offer constructs specifically controlling scope scope vary little single expression much entire program many possible gradations simplest scoping rule global scope – entities visible throughout entire program basic modular scoping rule two-level scoping global scope anywhere program local scope within function sophisticated modular programming allows separate module scope names visible within module private module visible outside within function languages c allow block scope restrict scope subset function others notably functional languages allow expression scope restrict scope single expression scopes include file scope notably c functions similarly module scope block scope outside functions notably perl subtle issue exactly scope begins ends languages c scope starts declaration thus different names declared within given block different scopes requires declaring functions use though necessarily defining requires forward declaration cases notably mutual recursion languages javascript python name scope begins start relevant block start function regardless defined names within given block scope javascript known variable hoisting however name bound value varies behavior in-context names undefined value differs python use undefined variables yields runtime error javascript undefined variables usable undefined value function declarations also hoisted top containing function usable throughout function many languages especially functional languages offer feature called let-expressions allow declaration scope single expression convenient example intermediate value needed computation example standard ml codice_3 returns 12 codice_4 expression evaluates 144 using temporary variable named x avoid calling codice_3 twice languages block scope approximate functionality offering syntax block embedded expression example aforementioned standard ml expression could written perl gnu c python auxiliary variables generator expressions list comprehensions python 3 expression scope c variable names function prototype expression scope known context function protocol scope variable names prototype referred may different actual definition – dummies – often omitted though may used generating documentation instance many block-structured programming languages allow scope restricted block known block scope began algol 60 e declaration ... valid block today particularly associated languages pascal c families traditions often block contained within function thus restricting scope part function cases perl block may within function representative example use block scope c code shown two variables scoped loop loop variable n initialized incremented iteration loop auxiliary variable n_squared initialized iteration purpose avoid adding variables function scope relevant particular block – example prevents errors generic loop variable accidentally already set another value example expression codice_6 would generally assigned auxiliary variable body loop would simply written codice_7 complicated examples auxiliary variables useful blocks primarily used control flow loops cases block scope means scope variable depends structure function flow execution however languages block scope typically also allow use naked blocks whose sole purpose allow fine-grained control variable scope example auxiliary variable may defined block used say added variable function scope discarded block ends loop might enclosed block initializes variables used inside loop initialized subtlety several programming languages algol 68 c demonstrated example standardized since c99 block-scope variables declared within body block also within control statement analogous function parameters declared function declaration block function body starts scope whole function body primarily used loops initialization statement separate loop condition unlike loops common idiom block scope used shadowing example inside block auxiliary variable could also called n shadowing parameter name considered poor style due potential errors furthermore descendants c java c despite support block scope local variable made go scope end function allow one local variable hide another languages attempted declaration second n would result syntax error one n variables would renamed block used set value variable block scope requires variable declared outside block complicates use conditional statements single assignment example python use block scope one may initialize variable codice_8 accessible codice_9 statement perl block scope instead requires declaring variable prior block often instead rewritten using multiple assignment initializing variable default value python necessary would perl would case single variable assignment alternative use ternary operator avoid block general possible multiple variable assignments difficult read complex logic significant issue c notably string assignment string initialization automatically allocate memory string assignment already initialized variable requires allocating memory string copy checking successful languages allow concept block scope applied varying extents outside function example perl snippet right counter variable name block scope due use keyword increment_counter function name global scope call increment_counter increase value counter one return new value code outside block call increment_counter otherwise obtain alter value counter idiom allows one define closures perl commonly used programming languages offer way create local variable function subroutine variable whose scope ends goes context function returns cases lifetime variable duration function call – automatic variable created function starts variable declared destroyed function returns – scope variable within function though meaning within depends whether scoping lexical dynamic however languages c also provide static local variables lifetime variable entire lifetime program variable context inside function case static local variables variable created program initializes destroyed program terminates static global variable context within function like automatic local variable importantly lexical scoping variable function scope scope within lexical context function moves context another function called within function moves back context function returns – called functions access local variables calling functions local variables context within body function declared contrast dynamic scoping scope extends runtime context function local variables stay context another function called moving context defining function ends thus local variables context function defined called functions languages lexical scoping nested functions local variables context nested functions since within lexical context functions lexically nested local variable enclosing function known non-local variable nested function function scope also applicable anonymous functions example snippet python code right two functions defined square sum_of_squares square computes square number sum_of_squares computes sum squares number example square 4 4 16 sum_of_squares 4 0 1 2 3 4 30 functions variable named n represents argument function two n variables completely separate unrelated despite name lexically scoped local variables function scope one scope lexically separate function thus n't overlap therefore sum_of_squares call square without n altered similarly sum_of_squares variables named total variables limited scope interfere variables named total might belong function words risk name collision identifiers unrelated identifiers even identical note also name masking occurring one variable named n context given time scopes overlap contrast similar fragment written language dynamic scope n calling function would remain context called function – scopes would overlap – would masked shadowed new n called function function scope significantly complicated functions first-class objects created locally function returned case variables nested function local unbound variables function definition resolve variables enclosing context create closure function also environment variables must returned potentially called different context requires significantly support compiler complicate program analysis scoping rule largely particular c c++ file scope scope variables functions declared top level file within function entire file – rather c declaration end source file precisely translation unit internal linking seen form module scope modules identified files modern languages replaced explicit module scope due presence include statements add variables functions internal context may call include statements difficult determine context body file c code snippet function name sum_of_squares file scope modular programming scope name entire module however may structured across various files paradigm modules basic unit complex program allow information hiding exposing limited interface module scope pioneered modula family languages python influenced modula representative contemporary example object-oriented programming languages lack direct support modules c++ similar structure instead provided class hierarchy classes basic unit program class private methods properly understood context dynamic dispatch rather name resolution scope though often play analogous roles cases facilities available python modules classes code organization module-level function conventionally private method choice programmer declaration global scope effect throughout entire program variable names global scope — called global variables — frequently considered bad practice least languages due possibility name collisions unintentional masking together poor modularity function scope block scope considered preferable however global scope typically used depending language various sorts identifiers names functions names classes data types cases mechanisms namespaces used avoid collisions use local variables — variable names limited scope exist within specific function — helps avoid risk name collision two identically named variables however two different approaches answering question mean within function lexical scoping lexical scope also called static scoping static scope variable name scope certain function scope program text function definition within text variable name exists bound variable value outside text variable name exist contrast dynamic scoping dynamic scope variable name scope certain function scope time-period function executing function running variable name exists bound value function returns variable name exist means function f invokes separately defined function g lexical scoping function g access f local variables assuming text g inside text f dynamic scoping function g access f local variables since g invoked invocation f consider example program right first line creates global variable x initializes 1 second line defines function g prints echoes current value x sets x 2 overwriting previous value third line defines function f creates local variable x hiding identically named global variable initializes 3 calls g. fourth line calls f. fifth line prints current value x exactly program print depends scoping rules language program one uses lexical scoping g prints modifies global variable x g defined outside f program prints 1 2 contrast language uses dynamic scoping g prints modifies f local variable x g called within f program prints 3 1 happens language program bash uses dynamic scoping program prints 3 1 lexical scope name always refers less local lexical environment property program text made independent runtime call stack language implementation matching requires analysis static program text type scoping also called static scoping lexical scoping standard algol-based languages pascal modula-2 ada well modern functional languages ml haskell also used c language syntactic semantic relatives although different kinds limitations static scoping allows programmer reason object references parameters variables constants types functions etc simple name substitutions makes much easier make modular code reason since local naming structure understood isolation contrast dynamic scope forces programmer anticipate possible dynamic contexts module code may invoked example consider pascal program fragment right variable codice_10 visible points never hidden another variable name codice_11 variable codice_12 visible main program hidden codice_13 variable codice_12 visible procedure codice_15 codice_16 variable codice_17 also visible procedure codice_15 codice_16 hide variable variable codice_20 visible procedure codice_16 therefore accessible either procedure codice_15 main program also procedure codice_16 visible procedure codice_15 therefore called main program could another procedure codice_16 declared program outside procedure codice_15 place program codice_16 mentioned determines two procedures named codice_16 represents thus precisely analogous scope variables correct implementation static scope languages first-class nested functions trivial requires function value carry record values variables depends pair function environment called closure depending implementation computer architecture variable lookup may become slightly inefficient deeply lexically nested functions used although well-known techniques mitigate also nested functions refer arguments immediately local variables relative locations known compile time overhead therefore incurred using type nested function applies particular parts program nested functions used naturally programs written language nested functions available c language lexical scoping used algol picked languages since deep binding approximates static lexical scoping introduced lisp 1.5 via funarg device developed steve russell working john mccarthy original lisp interpreter 1960 early lisps used dynamic scoping descendants dynamically scoped languages often adopt static scoping common lisp scheme srfi 15 dynamic static scoping perl another language dynamic scoping added static scoping afterwards languages like pascal c always lexical scoping since influenced ideas went algol 60 although c include lexically nested functions term lexical scope dates least 1967 term lexical scoping dates least 1970 used project mac describe scoping rules lisp dialect mdl known muddle dynamic scope global identifier refers identifier associated recent environment uncommon modern languages technical terms means identifier global stack bindings introducing local variable name codice_29 pushes binding onto global codice_29 stack may empty popped control flow leaves scope evaluating codice_29 context always yields top binding note done compile-time binding stack exists run-time type scoping called dynamic scoping generally certain blocks defined create bindings whose lifetime execution time block adds features static scoping dynamic scoping process however since section code called many different locations situations difficult determine outset bindings apply variable used one exists beneficial application principle least knowledge suggests code avoid depending reasons circumstances variable value simply use value according variable definition narrow interpretation shared data provide flexible system adapting behavior function current state policy system however benefit relies careful documentation variables used way well careful avoidance assumptions variable behavior provide mechanism detect interference different parts program dynamic scoping also voids benefits referential transparency dynamic scoping dangerous modern languages use languages like perl common lisp allow programmer choose static dynamic scoping defining redefining variable examples languages use dynamic scoping include logo emacs lisp latex shell languages bash dash powershell dynamic scoping fairly easy implement find identifier value program could traverse runtime stack checking activation record function stack frame value identifier practice made efficient via use association list stack name/value pairs pairs pushed onto stack whenever declarations made popped whenever variables go scope shallow binding alternative strategy considerably faster making use central reference table associates name stack meanings avoids linear search run-time find particular name care taken properly maintain table note strategies assume last-in-first-out lifo ordering bindings one variable practice bindings ordered even simpler implementation representation dynamic variables simple global variables local binding performed saving original value anonymous location stack invisible program binding scope terminates original value restored location fact dynamic scope originated manner early implementations lisp used obvious strategy implementing local variables practice survives dialects still use gnu emacs lisp lexical scope introduced lisp later equivalent shallow binding scheme except central reference table simply global variable binding environment current meaning variable global value maintaining global variables n't complex instance symbol object dedicated slot global value dynamic scoping provides excellent abstraction thread local storage used way based saving restoring global variable possible implementation strategy variable thread-local key variable accessed thread-local key used access thread-local memory location code generated compiler knows variables dynamic lexical thread-local key exist calling thread global location used variable locally bound prior value stored hidden location stack thread-local storage created variable key new value stored nested overrides variable within thread simply save restore thread-local location initial outer-most override scope terminates thread-local key deleted exposing global version variable thread modern languages macro expansion preprocessor key example de facto dynamic scope macro language transforms source code without resolving names since expansion done place names expanded text resolved notably free variables resolved based expanded loosely called dynamic scoping occurring c preprocessor used macro expansion de facto dynamic scope name resolution example macro expand add codice_8 passed variable identifier later resolved compiler based macro codice_33 called properly expanded dynamic scope independent macro defined properly c preprocessor lexical analysis expanding macro tokenization stage parsing syntax tree name resolution example following code codice_8 macro resolved expansion local variable expansion site seen one key reasons scope helps prevent name collisions allowing identical identifiers refer distinct things restriction identifiers must separate scopes sometimes restriction inconvenient many different things need accessible throughout program generally need identifiers global scope different techniques required avoid name collisions address many languages offer mechanisms organizing global identifiers details mechanisms terms used depend language general idea group identifiers given name — prefix — necessary entity referred qualified identifier consisting identifier plus prefix normally identifiers sense two sets scopes scope usually global scope qualified identifier visible one narrower scopes unqualified identifier without prefix visible well normally groups organized groups nested although many languages support concept details vary greatly languages mechanisms namespaces c++ c serve almost exclusively enable global identifiers organized groups languages mechanisms packages ada structures standard ml combine additional purpose allowing identifiers visible members group object-oriented languages often allow classes singleton objects fulfill purpose whether also mechanism primary purpose furthermore languages often meld approaches example perl packages largely similar c++ namespaces optionally double classes object-oriented programming java organizes variables functions classes organizes classes ada-like packages scoping rules representative languages follow c scope traditionally known linkage visibility particularly variables c lexically scoped language global scope known external linkage form module scope file scope known internal linkage local scope within function within function scopes nested via block scope however standard c support nested functions lifetime visibility variable determined storage class three types lifetimes c static program execution automatic block execution allocated stack manual allocated heap static automatic supported variables handled compiler manually allocated memory must tracked manually across different variables three levels visibility c external linkage global internal linkage roughly file block scope includes functions block scopes nested different levels internal linkage possible use includes internal linkage c visibility translation unit level namely source file processed c preprocessor notably including relevant includes c programs compiled separate object files linked executable library via linker thus name resolution split across compiler resolves names within translation unit loosely compilation unit properly different concept linker resolves names across translation units see linkage discussion c variables block scope enter scope declared top block move scope non-nested function called within block move back scope function returns move scope end block case automatic local variables also allocated declaration deallocated end block static local variables allocated program initialization deallocated program termination following program demonstrates variable block scope coming scope partway block exiting scope fact deallocated block ends program outputs levels scope c. variable names used function prototype function prototype visibility exit scope end function prototype since name used useful compilation may useful documentation label names goto statement function scope case label names switch statements block scope block switch variables intend use program must declared type specifier earlier point code like previous code beginning body function main declared b result type int variable either global local scope global variable variable declared main body source code outside functions local variable one declared within body function block modern versions allow nested lexical scoping go lexically scoped using blocks java lexically scoped java class contain three types variables local variables defined inside method particular block variables local defined lower levels example loop inside method use method local variables way around loop variables local loop destroyed soon loop ends member variables also called fields variables declared within class outside method default variables available methods within class also classes package parameters variables method declarations general set brackets defines particular scope variables top level within class differ behavior depending modifier keywords used definition following table shows access members permitted modifier javascript simple scoping rules variable initialization name resolution rules cause problems widespread use closures callbacks means lexical environment function defined used name resolution different lexical environment called irrelevant name resolution javascript objects name resolution properties separate topic javascript lexical scoping nested function level global scope outermost scope scoping used variables functions meaning function declarations opposed variables function type block scoping codice_35 codice_36 keywords standard since ecmascript 6 block scoping produced wrapping entire block function executing known immediately-invoked function expression iife pattern javascript scoping simple – lexical function-level – associated initialization name resolution rules cause confusion firstly assignment name scope defaults creating new global variable local one secondly create new local variable one must use codice_37 keyword variable created top function value codice_38 variable assigned value assignment expression reached known variable hoisting – declaration initialization hoisted top function thirdly accessing variables initialization yields codice_38 rather syntax error fourthly function declarations declaration initialization hoisted top function unlike variable initialization example following code produces dialog output samp undefined /samp local variable declaration hoisted shadowing global variable initialization variable undefined used functions first-class objects javascript frequently assigned callbacks returned functions function executed name resolution depends originally defined lexical environment definition lexical environment execution environment called nested scopes particular function global local javascript particularly closure used callback sometimes referred scope chain analogy prototype chain object closures produced javascript using nested functions functions first-class objects returning nested function enclosing function includes local variables enclosing function non-local lexical environment returned function yielding closure example closures frequently used javascript due used callbacks indeed hooking function local environment callback returning function creates closure unbound variables function body environment closure based nested scopes current lexical environment scope chain may accidental creating callback based parameters parameters must stored closure otherwise accidentally create closure refers variables enclosing environment may change name resolution properties javascript objects based inheritance prototype tree – path root tree called prototype chain – separate name resolution variables functions lisp dialects various rules scoping original lisp used dynamic scoping scheme inspired algol introduced static lexical scoping lisp family maclisp used dynamic scope default interpreter lexical scope default compiled code though compiled code could access dynamic bindings use codice_40 declarations particular variables however maclisp treated lexical binding optimization one would expect modern languages come closure feature one might expect lexical scoping modern lisps separate operation codice_41 available somewhat clumsily work around issue common lisp adopted lexical scoping scheme clojure islisp lexical scoping ordinary variables also dynamic variables cases explicitly marked must defined codice_42 special form bound codice_43 special form accessed explicit codice_44 special form dialects lisp like emacs lisp still use dynamic scoping default emacs lisp lexical scoping available per-buffer basis variables python function scope module scope global scope names enter scope start context function module globally exit scope non-nested function called context ends name used prior variable initialization raises runtime exception variable simply accessed assigned context name resolution follows legb rule local enclosing global built-in however variable assigned defaults creating local variable scope entire context rules overridden codice_1 codice_2 python 3 declaration prior use allows accessing global variables even intervening nonlocal variable assigning global nonlocal variables simple example function resolves variable global scope note x initialized codice_47 called error raised even though declared codice_47 declared lexically forward reference allowed python assignment creates new local variable change value global variable assignment variable within function causes declared local function hence local variable scope entire function thus using prior assignment raises error differs c local variable scope declaration entire function code raises error default name resolution rules overridden codice_1 codice_2 python 3 keywords code codice_51 declaration codice_52 means x resolves global variable thus accessed already initialized assignment assigns global variable rather declaring new local variable note codice_1 declaration needed codice_47 – since assign variable defaults resolving global variable codice_1 also used nested functions addition allowing assignment global variable unnested function also used access global variable presence nonlocal variable nested functions also codice_2 declaration assigning nonlocal variable similar using codice_1 unnested function r lexically scoped language unlike implementations values free variables determined set global variables r determined environment function created scoping environments may accessed using variety features codice_58 simulate experience dynamic scoping programmer desire block scoping functions access environment scope created variables created modified within function stay variables created modified within function stay unless assignment enclosing environment scope explicitly requested although r lexical scoping default function scopes changed | [
512,
10752,
5635,
11269,
6664,
2062,
9231,
6160,
8221,
9245,
547,
5677,
2105,
6717,
8771,
8773,
8262,
1610,
9804,
3675,
5213,
8289,
8293,
623,
1152,
8846,
655,
8854,
5783,
3736,
4777,
8874,
5803,
5806,
2225,
692,
3765,
7867,
4799,
6335,
... | Test |
10,511 | 1 | SAP_IQ:sap iq sap iq formerly known sap sybase iq sybase iq iq intelligent query column-based petabyte scale relational database software system used business intelligence data warehousing data marts produced sybase inc. sap company primary function analyze large amounts data low-cost highly available environment sap iq often credited pioneering commercialization column-store technology foundation sap iq lies column store technology allows speed compression ad-hoc analysis sap iq open interface approach towards ecosystem sap iq also integrated sap ’ business intelligence portfolio products form end-to-end business analytics software stack integral component sap in-memory data fabric architecture data management platform early 1990s waltham massachusetts-based expressway technologies inc. developed expressway 103 column-based engine optimized analytics would eventually become sybase iq sybase acquired expressway re-introduced product 1995 iq accelerator renamed shortly thereafter sybase iq giving version number 11.0 offering iq product part collection related technologies often found data warehouse including sybase adaptive server enterprise replication server powerdesigner powerdesigner sql anywhere sybase became one first mainstream companies acknowledge need specialized products data warehouse market version 12.0 sybase replaced loosely coupled query interface adaptive server enterprise tight coupling sql anywhere version 16 brings re-engineered column store extreme petabyte scale data volumes extreme data compression 2014 sap hana together partners bmmsoft hp intel netapp red hat announced world ’ largest data warehouse team engineers sap bmmsoft hp intel netapp red hat built data warehouse using sap hana sap iq 16 bmmsoft federated edmt running hp dl580 servers using intel xeon e7-4870 processors red hat enterprise linux 6 netapp fas6290 e5460 storage development testing 12.1pb data warehouse conducted sap/intel petascale lab santa clara calif. audited infosizing independent transaction processing council certified auditor release sp08 version numbers changed align match sap hana ’ version numbers reflect product ’ continuous integration sap hana actual release title sp03 follow-on sp02 covering platforms affected release sap ’ new approach streamlines simplifies data warehousing in-memory data fabric advent big data sap iq coupled sap hana deliver distributed in-memory analytics platform three main applications use cases try capitalize sap iq ’ strengths concerning scalability performance edw big data processor leveraging sap hana ’ in-memory speed operational reporting https //blogs.sap.com/2016/10/12/sap-nls-solution-sap-bw scenario sap enterprise resource planning erp data goes sap hana acts operational data store immediate analysis data analyzed integrated sap iq via near-line storage mechanisms described sap iq acts enterprise data warehouse receives data variety traditional sources oltp databases files systems sap hana operational data store ods https //blogs.sap.com/2019/05/22/q-the-easy-installer-for-sap-iq/ sap iq used edw also augmented hana ’ in-memory technology common uses include planning analysis reports simultaneous oltp processing needed case data flows sap iq sap hana sap businessobjects bi used achieve visibility across platforms user sap iq looks like relational dbms sql-based language layer accessible via odbc/jdbc drivers however inside sybase iq column-oriented dbms stores data tables sections columns data rather rows data like transactional databases column-orientation number advantages search done items matching particular value column data storage objects corresponding data column within table need accessed traditional row-based database would read whole table top bottom another advantage indexed correctly value would stored row data traditional database stored sap iq n-bitindex used access data nbit tiered indexing used allow increased compression fast incremental batch loads additionally column-based storage enables sap iq compress data efficiently fly prior sap iq 16 data page structured array cells fixed size values data type storage approach efficient structured fixed length data hold unstructured variable sized data seen today combat storage inefficiency store variable sized data minimal wasted space page composed cells variable size packed tightly together column store architecture supports variable number cells per page various page formats within column sap iq also applies lempel-ziv-welch lzw compression algorithms data page written disk significantly reduce data volume bitmaps used secondary indexes sap iq massively parallel processing mpp framework based shared-everything environment supports distributed query processing products capable mpp tend based shared-nothing environments benefit shared-everything flexible terms variety queries optimized—especially balancing needs many concurrent users downside extreme cases competition among processors access shared pool storage usually storage-area network lead i/o contention affects query performance 12 however aforementioned storage architecture sap iq allows compute storage layers scale independently also allows resources provisioned on-demand better utilization without restructuring underlying database sap iq uses clustered grid architecture made clusters sap iq servers multiplex clusters used scale performance large numbers concurrent queries queries great complexity built upon shared-everything architecture compute nodes interact shared storage queries ability distribute across compute nodes multiplex coordinator node manages database catalog coordinates transactional writes store nodes reader nodes readers writes like coordinator node storage fabric implemented numerous technologies allow sharing amongst multiplex nodes architecture multiple uses including workload balancing elastic virtual data marts workload balancing achieved sap iq query engine dynamically increasing/decreasing parallelism response changes server activity automatic failover node stops participating query nodes pick work originally assigned failed node query complete client side compatibility external load balances ensures queries initiated physical servers balanced fashion eliminate bottlenecks physical nodes multiplex grouped together “ logical servers ” allow workloads isolated security resource balancing purposes machines added demand changes aim grid architecture enable resiliency even global transactions sap iq loading engine used incremental batch low latency concurrent loading bulk loading client server data files bulk loading process allows multiple load process occur simultaneously loads different tables data loaded databases well files page-level snapshot versioning allows concurrent loads queries locking occurring table level sap replication server enhanced optimize loads sap iq transactions compiled fewest set operations bulk micro-batch loads sap iq performed gives appearance real-time continuous loads bulk loader performs operations parallel make full use server cores remove bottlenecks keep threads productive instead serializing process loading process remains two-phase process first reading raw data creating fp indexes second creating secondary indexes everything executed parallel high group indexes query optimizer relies information columns/rows contain data values structured set tiers increasing move pyramid lastly sap iq introduces write-optimized row level versioned rlv delta store enables high-velocity data loads fast availability data users store minimally indexes compressed row-level locking concurrent write transaction log append acts companion main store data loaded high speed rlv store migrating main store later merging periodically user appear though two separate entities work queries operate transparently across two stores make use users specify particular “ hot ” database tables rlv tables sap iq offers query apis based pure ansi sql standards restrictions include olap full-text search support stored procedures supported ansi sql transact-sql dialects executed scheduled immediate basis well database drivers variety programming languages java c/c++m php perl python ruby ado.net sap iq analytics engine query structured unstructured data join results together sap iq introduced new text index sql “ contains ” clause facilitate searching terms within blob unstructured text sap sybase ’ partnerships vendors allow various binary forms text files ingested sap iq text indexes created text indexes get data ready higher level text analysis applications perform full-text searches within sap iq via select statements select syntax used applications performing tokenization categorization text analysis in-database analytics built upon fundamental concept keeping analytics algorithms close data higher performance extensibility framework called “ in-database analytics ” enables embedding analytic functions inside database engine sap iq moving analytics database instead specialized environment database process error prone slower pre-built functions available natively via partners sap iq providing specialized statistical data mining libraries plug sap iq framework increases sap iq ’ power advance processing analysis data moved database specialized environment analytics data results obtained shared though dbms easily acquired sql interface user defined functions udfs partners extend dbms custom computations providing specialized statistical data mining libraries plug right sap iq enhance performance advanced processing analysis sap iq provides several features included base product licensable separately help protect security user ’ data new feature introduced iq 16 role based access control rbac enables separation duties upholds principle least privilege allowing breakdown privileged operations fine-grained sets individually granted users included part base product users groups permissions database administration authorities user login policies database encryption transport-layer security ipv6 role-based access control database auditing additional features part licensable option called advanced security option fips encryption kerberos authentication ldap authentication database column encryption part ilm sap iq allows users create multiple user dbspaces logical units storage/containers database objects organizing data used separate structured unstructured data group together according age value partition table data dbspaces also marked read-only enable one-time consistency checking back-up another application ilm ability partition tables place moving portions along storage fabric backup capabilities enables storage management process data cycles tiered storage moving faster expensive storage slower cheaper storage ages partitioning data according value multiplex set-up provides scalability high availability compute nodes multiplex coordinator node failover alternate coordinator node sap iq virtual backup also allows users quickly backup data along storage replication technology data continuously copied backups occur quickly “ behind scenes ” virtual backups completed verified test restore enterprise data copied development testing ’ left complete backup transactionally consistent point time sap claims disaster recovery easier shared everything approach mpp sap sybase powerdesigner modelling tool enables users build ilm model deployed sap iq storage types dbspaces lifecycle phases defined ilm model tool used generate reports create partition creation movement scripts sap iq provides federation hadoop distributed file system hdfs popular framework big data enterprise users continue store data hadoop utilize benefits integration achieved four different ways depending user ’ needs client-side federation etl data query federation client-side federation joins data iq hadoop client application level etl federation lets user load hadoop data column store schemas iq hdfs data also joined iq data fly sql queries iq finally results mapreduce jobs combined iq data also fly sap control center replaces sybase central web-based graphical tool administration monitoring sap control center used monitoring sap sybase servers resources node multiplex location well monitoring performance spotting usage trends web application multi-tiered plug-in architecture made server product-based agents bring sap sybase performance back control center server sap iq comes web-enabled application drivers facilitating access sap iq variety web 2.0 programming execution environments python perl php .net ruby query federation databases developers build applications interact multiple data sources time well database platforms vendors federation proxy tables map tables external databases created materialized in-memory tables interacted though resided within sap iq way data sources combined unified view sap iq also supports plugging external algorithms written c++ java sql queries call algorithms allowing execution in-database analytics provides better performance scalability additionally sybase iq also provides drivers access via languages php perl python ruby rails sap iq supports major operating system platforms including sybase claims sybase iq currently installed 2000 customer sites notable customers include comscore inc. corelogic investment technology group itg u.s. internal revenue service irs sybase iq widely used focused data-mart-style deployments also deployed enterprise data warehouse | [
11136,
3,
8582,
9353,
6797,
270,
10511,
9360,
4116,
1304,
5677,
10286,
8644,
9286,
3791,
10835,
7767,
5210,
4058,
8554,
8188
] | Test |
10,512 | 2 | Metal_(API):metal api metal low-level low-overhead hardware-accelerated 3d graphic compute shader application programming interface api developed apple inc. debuted ios 8 metal combines functions similar opengl opencl one api intended bring ios macos tvos apps performance benefits similar apis platforms vulkan debuted mid-february 2016 directx 12 metal object-oriented api invoked using swift objective-c programming languages full-blown control metal framework well related metalkit framework accessible via metal unified graphics compute language according apple promotional materials metal c++ based programming language developers use write code executed gpu graphics general-purpose data-parallel computations since metal based c++ developers find familiar easy use metal graphics compute programs written single unified language allows tighter integration two metal available since june 2 2014 ios devices powered apple a7 later since june 8 2015 macs 2012 models later running os x el capitan june 5 2017 wwdc apple announced second version metal supported macos high sierra ios 11 tvos 11 metal 2 separate api metal supported hardware metal 2 enables efficient profiling debugging xcode accelerated machine learning lower cpu workload support virtual reality macos specificities apple a11 gpu particular ios tvos metal supports apple-designed socs apple a7 newer macos metal supports intel hd iris graphics hd 4000 series newer amd gcn-based gpus nvidia kepler-based gpus newer metal designed around principles modern graphics compute apis vulkan direct3d 12 instructions sent gpu command buffers obtained command queues metal improves capabilities gpgpu programming using compute shaders metal uses specific shading language based c++14 implemented using clang llvm metal better performance opengl several reasons points reduce amount work cpu required successfully execute commands gpu lead overall performance gain cpu used compute tasks according apple 148,000 applications use metal directly 1.7 million use high-level frameworks june 2017 presumably applications games ios notable macos games using metal rendering listed | [
10755,
9732,
4615,
5647,
7697,
1042,
11289,
1057,
6186,
4139,
6700,
4657,
1074,
8754,
9784,
8253,
8262,
9802,
8783,
5713,
4180,
3670,
1623,
4184,
3672,
10838,
2141,
4702,
3681,
9826,
2149,
8806,
8296,
3691,
8303,
2673,
6771,
2676,
7292,
2... | Train |
10,513 | 1 | Australian_Plant_Name_Index:australian plant name index australian plant name index apni online database published names australian vascular plants covers names whether current names synonyms invalid names includes bibliographic typification details information australian plant census including distribution state links resources specimen collection maps plant photographs facility notes comments aspects originally brainchild nancy tyson burbidge began four-volume printed work consisting 3,055 pages containing 60,000 plant names compiled arthur chapman part australian biological resources study abrs 1991 made available online database handed australian national botanic gardens two years later responsibility maintenance given newly formed centre plant biodiversity research recognised australian herbaria authoritative source australian plant nomenclature core component australia virtual herbarium collaborative project 10 million funding aimed providing integrated online access data specimen collections australia major herbaria two query interfaces offered | [
560,
1227,
6580,
6571
] | Test |
10,514 | 9 | Microsoft_Visual_Programming_Language:microsoft visual programming language microsoft visual programming language mvpl visual programming dataflow programming language developed microsoft microsoft robotics studio microsoft visual programming language distinguished microsoft programming languages visual basic c microsoft language true visual programming language microsoft utilized term visual previous programming products reflect large degree development languages performed dragging dropping traditional wysiwyg fashion | [
2691
] | Test |
10,515 | 4 | Audio_injection:audio injection audio injection exploitation digital assistants amazon echo google home apple siri unwanted instructions third party services lack authentication reacting user commands making possible attackers issue activation words commands trigger execution desired actions injection results include fraud burglary data espionage takeover connected systems digital assistants require activation word trigger complete recording audio analysis spoken commands e.g ok google commands spoken natural language processed executed activation word different manufacturer often connected product ’ name possible product owner customize activation word meaning models react word processed language analyzed regards voice recognition authorization individual users result users audible range device authorizations trigger execute actions depending functionality actions range simple actions like music playback controlling lights security critical sensitive actions opening gates executing ordering chargeable transactions reading private information audio injection attacks performed remotely access audible area digital assistant restricted attacked increasing distance transmission either reached overcoming existent acoustic barriers e.g via vending opening momentary opened window via unusual loud playback via amplifiers loudspeakers approach possible control digital assistants rooms floors outside building digital assistants distinguish whether voice commands directly spoken reproduced loudspeaker system means attacks performed via devices support audio playback via loudspeaker radio television used run mass-attacks telephones hands-free systems digital assistants systems text-to-speech-processing misused systems accessed randomly anonymously absence owner well activated remotely critical answering machines automated monitoring function playing message aloud along could used remote precise attacks june 2014 television commercial microsoft depicted actor issuing voice command xbox causing command interpreted xbox systems room television showing commercial december 2016 adam jakowenko showed one virtual assistant could activate another one using tts-processing january 2017 television news coverage child ordering dollhouse amazon alexa interface included news anchor jim patton quoting child quotation triggered orders dollhouses viewers coverage alexa devices running | [] | Validation |
10,516 | 3 | Mac_68k_emulator:mac 68k emulator mac 68k emulator software emulator built versions classic mac os powerpc emulator enabled running applications system code originally written 680x0-based macintosh models exceptions notably connectix ram doubler emulator ran software noticeable impact lower performance relative program compiled powerpc first version written gary davidian originally created use motorola 88000 cpu used apple abortive first attempt risc target platform later version using dynamic recompilation developed eric traut later worked successful emulation projects connectix virtual game station virtual pc prior traut arrival connectix released speed doubler included even faster powerpc 68k emulator versions emulator emulated user subset 68ec040 instruction set 68020/68030 exception stack frame apple developer documents indicate emulator provided operating environment closely resembling macintosh centris 610 system based motorola 68lc040 microprocessor early versions emulated decoding instruction immediately carrying series equivalent powerpc instructions pci powermacs dynamic recompilation emulator used boost performance dynamic recompilation works recompiling common sections code faster powerpc-native sequences locally cached emulator could recognise sequence 680x0 code run previously-cached powerpc code avoid translation emulator theoretically capable emulating 680x0 code faster real 680x0 capable running 68lc040 floating point instructions making feat slightly simpler less impressive one reason emulation successful many apis mac os originally implemented traps 680x0 processor therefore calling api actually recognised 680x0 equivalent error condition would cause handle error one hardware vectors turn vector would look run operating system routine rom ram emulator traps could replaced native powerpc code code emulated application system api called could accelerated native powerpc code also allowed apple time port os powerpc first time-critical aspects rewritten native code leaving much os emulated gradually os rewritten native os got faster time programmer transition powerpc made fairly painless emulator started stopped automatically achieved using new type pointer called universal procedure pointer upp 68k code pointer appeared ordinary pointer code could used however actually led data structure contained special trap instruction flags indicating instruction set architecture isa called code powerpc code upp could passed calluniversalproc function call 68k emulator dealt details presenting passed parameters right order isa question well starting stopping emulator required compilers mac os created upps automatically proper macros used powerpc system libraries contained native stubs transparently call native still-68k functions needed meant dealing dual architecture required little work programmer like os applications could mix match 680x0 powerpc code fairly easily built powerpc versions classic mac os emulator also part classic environment mac os x. powerpc macintosh emulators sheepshaver therefore use emulator well running classic mac os native mac os x outside classic never used emulator | [
576,
7941,
6377,
3371,
9391,
4112,
8048,
1042,
499,
5235,
6130,
8625,
5976,
8700,
2653
] | Test |
10,517 | 8 | IFTTT:ifttt also known ifttt free web-based service create chains simple conditional statements called applets applet triggered changes occur within web services gmail facebook telegram instagram pinterest example applet may send e-mail message user tweets using hashtag copy photo facebook user archive someone tags user photo addition web-based application service runs ios android february 2015 ifttt renamed original application released new suite apps called lets users create shortcut applications actions 2015 ifttt users created 20 million recipes day functionalities suite apps since integrated redesigned ifttt app december 14 2010 linden tibbets co-founder ifttt posted blog post titled “ ifttt beginning ... ” ifttt website announcing new project first ifttt applications designed developed tibbets co-founder jesse tane september 7 2011 tibbets announced launch official website april 30 2012 users created 1 million tasks june 2012 service entered internet things space integrating belkin wemo devices allowing applets interact physical world july 10 2013 ifttt released iphone app later released version ipad ipod touch april 24 2014 ifttt released version android end 2014 ifttt business valued approximately usd 170 million february 19 2015 ifttt launched three new applications button triggers action press camera automatically uploads image service choice facebook twitter dropbox etc. notes camera except notes instead images november 2016 four apps combined one december 2016 company announced partnership jotform integrate applet create actions applications part revenue ifttt comes ifttt platform partners pay products connected service among ge bmw microsoft google others dropbox new york times twitter slack spotify partners choose various monthly plans lite free use basic 199 enterprise 499 july 2019 ifttt announced tenfold increase monthly charges pricing smaller integration partners ifttt employs following concepts ifttt received positively forbes time wired new york times reader digest microsoft developed comparable product microsoft flow | [
9796,
10020,
3692,
7533,
4623,
4624,
7983,
1427,
4888,
735
] | Test |
10,518 | 1 | Database_server:database server database server server uses database application provides database services computer programs computers defined client–server model database management systems dbmss frequently provide database-server functionality database management systems mysql rely exclusively client–server model database access others e.g sqlite meant using embedded database users access database server either front end running user computerwhich displays requested dataor back end runs server handles tasks data analysis storage master-slave model database master servers central primary locations data database slave servers synchronized backups master acting proxies database applications respond query language database understands query language converts submitted query server-readable form executes retrieve results examples proprietary database applications include oracle db2 informix microsoft sql server examples free software database applications include postgresql gnu general public licence include ingres mysql every server uses query logic structure sql structured query language query language less relational database applications clarification database server simply server maintains services related clients via database applications db-engines lists 300 dbmss ranking foundations modeling large sets data first introduced charles bachman 1969 bachman introduced data structure diagrams dsds means graphically represent data dsds provided means represent relationships different data entities 1970 codd introduced concept users database ignorant inner workings database codd proposed relational view data later evolved relational model databases use today 1971 database task report group codasyl driving force behind development programming language cobol first proposed data description language describing database data description language describing part data base known program data manipulation language research development databases focused relational model 1970s 1975 bachman demonstrated relational model data structure set similar congruent ways structuring data working honeywell entity-relationship model first proposed current form peter chen 1976 conducting research mit model became frequently used model describe relational databases chen able propose model superior navigational model applicable real world relational model proposed codd | [
2688,
7175,
9481,
10505,
1037,
270,
7310,
9360,
10258,
4630,
11030,
4376,
1049,
9112,
284,
4255,
7968,
290,
1314,
7461,
3366,
4135,
5287,
8229,
5546,
8742,
10921,
10413,
2222,
5550,
5808,
10418,
6451,
9527,
3768,
3004,
9661,
1215,
4416,
2... | Test |
10,519 | 0 | Morphological_dictionary:morphological dictionary field computational linguistics morphological dictionary linguistic resource contains correspondences surface form lexical forms words surface forms words found text corresponding lexical form surface form lemma followed grammatical information example part speech gender number english give gives giving gave given surface forms verb give lexical form would give verb two kinds morphological dictionaries aligned non-aligned aligned morphological dictionary correspondence surface form lexical form word aligned character level example θ empty symbol signifies noun signifies plural example left hand side surface form input right hand side lexical form output order used morphological analysis lexical form generated surface form morphological generation order would reversed formally σ alphabet input symbols formula_1 alphabet output symbols aligned morphological dictionary subset formula_2 alphabet possible alignments including empty symbol aligned morphological dictionary set string formula_4 non-aligned morphological dictionary simply set formula_5 pairs input output strings non-aligned morphological dictionary would represent previous example possible convert non-aligned dictionary aligned dictionary besides trivial alignments left right linguistically motivated alignments align characters corresponding morphemes possible frequently exists one lexical form associated surface form word example house may noun singular may verb present tense result necessary function relates input strings corresponding output strings define set formula_6 input words formula_7 correspondence function would formula_8 defined formula_9 | [
1890,
7839
] | Test |
10,520 | 8 | UWSGI:uwsgi uwsgi software application aims developing full stack building hosting services named web server gateway interface wsgi first plugin supported project uwsgi often used serving python web applications conjunction web servers cherokee nginx offer direct support uwsgi native uwsgi protocol | [
225,
865,
3237,
4485,
6664,
8554,
5612,
7983,
11221,
119,
2045
] | None |
10,521 | 5 | Wireless_Communications_Transfer_Protocol:wireless communications transfer protocol wireless communications transfer protocol wctp method used send messages wireless devices pagers npcs narrowband pcs networks uses http transport layer world wide web development wctp initiated messaging standards committee submitted radio paging community first proposal received sub-committee established improve protocol issue specification sub-committee moved ptc paging technical committee volunteer committee composed industry representatives pcia personal communications industry accepted first full release adopted protocol pcia standard current version wctp 1.3 | [
119
] | None |
10,522 | 7 | Peer-to-peer_web_hosting:peer-to-peer web hosting peer-to-peer web hosting using peer-to-peer networking distribute access webpages differentiated client–server model involves distribution web data dedicated web servers user-end client computers p2p web hosting may take form p2p web caches content delivery networks like dijjer coral cache allow users hold copies data single web pages distribute caches users faster access peak traffic | [
10368,
4229,
4490,
11029,
3350,
5026,
6435,
6565,
3366,
5158,
2222,
3770,
1087,
8640,
11073,
708,
6351,
3792,
6991,
7761,
5078,
11097,
3676,
5085,
225,
4194,
3428,
3813,
7921,
1908,
4725,
5749,
9332
] | Validation |
10,523 | 7 | BlackSpider_Technologies_Limited:blackspider technologies limited blackspider technologies limited british software company founded 2002 subsequently acquired surfcontrol july 2006 company provided cloud computing services filtering email spam malware blackspider start-up company founded 2002 john cheney reading berkshire uk january 2004 casenove private equity invested £4.6m 6.6m business allowing organisation grow french german markets july 2006 surfcontrol uk listed plc acquired blackspider £19.5m cash point acquisition blackspider £4m historic revenues operating loss £3.1m 1,200 customers october 2007 websense acquired surfcontrol approximately £204m following acquisition surfcontrol websense original blackspider management team including john cheney left found workbooks.com provider web-based crm software small businesses mailcontrol brand name blackspider technologies email filtering services products sold forcepoint brand name hosted email security | [
4194,
7515,
10772
] | Test |
10,524 | 5 | Software_Communications_Architecture:software communications architecture software communications architecture sca open architecture framework defines standard way radios instantiate configure manage waveform applications running platform sca separates waveform software underlying hardware platform facilitating waveform software portability re-use avoid costs redeveloping waveforms latest version sca 4.1 sca published joint tactical networking center jtnc architecture developed assist development software defined radio sdr communication systems capturing benefits recent technology advances expected greatly enhance interoperability communication systems reduce development deployment costs architecture also applicable embedded distributed-computing applications communications terminals electronic warfare ew sca structured sca deliberately designed meet commercial application requirements well military applications since sca intended become self-sustaining standard wide cross-section industry invited participate development validation sca sca system specification implementation independent set rules constrain design systems achieve objectives listed core framework cf defines essential core set open software interfaces profiles provide deployment management interconnection intercommunication software application components embedded distributed-computing communication system sense interfaces defined sca part cf standard waveform apis define key software interfaces allow waveform application radio platform interact sca use apis separate waveform software underlying hardware platform facilitating waveform software portability re-use avoid costs redeveloping waveforms | [
6419
] | Test |
10,525 | 5 | Google_Earth:google earth google earth computer program renders 3d representation earth based primarily satellite imagery program maps earth superimposing satellite images aerial photography gis data onto 3d globe allowing users see cities landscapes various angles users explore globe entering addresses coordinates using keyboard mouse program also downloaded smartphone tablet using touch screen stylus navigate users may use program add data using keyhole markup language upload various sources forums blogs google earth able show various kinds images overlaid surface earth also web map service client addition earth navigation google earth provides series tools desktop application additional globes moon mars available well tool viewing night sky flight simulator game also included features allow users view photos various places uploaded panoramio information provided wikipedia locations street view imagery web-based version google earth also includes voyager feature periodically adds in-program tours often presented scientists documentarians google earth viewed threat privacy national security leading program banned multiple countries countries requested certain areas obscured google satellite images usually areas containing military facilities core technology behind google earth originally developed intrinsic graphics late 1990s time company developing 3d gaming software libraries demo 3d software created spinning globe could zoomed similar powers ten film demo popular board intrinsic wanted remain focused gaming 1999 created keyhole inc. headed john hanke keyhole developed way stream large databases mapping data internet client software key part technology acquired patchworks mapping data governments sources product called keyhole earthviewer sold cds use fields real estate urban planning defense intelligence users paid yearly fee service despite making number capital deals nvidia sony small company struggling make payroll employees leaving fortunes company changed early 2003 cnn received discount software exchange placing keyhole logo on-air whenever map used keyhole expect would amount brief 5 10 second prerecorded animation clips used extensively miles o'brien live 2003 invasion iraq allowing cnn millions viewers follow progress war way never seen public interest software exploded keyhole servers able keep demand keyhole soon contacted central intelligence agency venture capital firm in-q-tel national geospatial-intelligence agency use defense mapping databases gave keyhole much-needed cash infusion intrinsic graphics sold 2003 vicarious visions gaming libraries sell well core group engineers management transitioned keyhole hanke remaining head time google finding 25 searches geospatial character including searches maps directions october 2004 google acquired keyhole part strategy better serve users google earth imagery displayed digital globe displays planet surface using single composited image far distance zooming far enough imagery transitions different imagery area finer detail varies date time one area next imagery retrieved satellites aircraft launch nasa usgs landsat 8 satellite google relied partially imagery landsat 7 suffered hardware malfunction left diagonal gaps images 2013 google used datamining remedy issue providing described successor blue marble image earth single large image entire planet achieved combining multiple sets imagery taken landsat 7 eliminate clouds diagonal gaps creating single mosaic image google uses landsat 8 provide imagery higher quality greater frequency imagery hosted google servers contacted application opened requiring internet connection imagery resolution ranges 15 meters resolution 15 centimeters much earth google earth uses digital elevation model data collected nasa shuttle radar topography mission creates impression three-dimensional terrain even imagery two-dimensional every image created google earth using satellite data provided google earth copyrighted map derivative google earth made copyrighted data united states copyright law may used except licenses google provides google allows non-commercial personal use images e.g personal website blog long copyrights attributions preserved contrast images created nasa globe software world wind use blue marble landsat usgs imagery public domain version 5.0 google introduced historical imagery allowing users view earlier imagery clicking clock icon toolbar opens time slider marks time available imagery past feature allows observation area changes time utilizing timelapse feature allows ability view zoomable video far back 32 years google earth shows 3d building models cities including photorealistic 3d imagery first 3d buildings google earth created using 3d modeling applications sketchup beginning 2009 building maker uploaded google earth via 3d warehouse june 2012 google announced would replacing user-generated 3d buildings auto-generated 3d mesh would phased starting select larger cities notable exception cities london toronto required time process detailed imagery vast number buildings reason given greater uniformity 3d buildings compete nokia apple maps already using technology coverage began year 21 cities four countries early 2016 3d imagery expanded hundreds cities 40 countries including every u.s. state encompassing every continent except antarctica 2009 collaboration google museo del prado madrid museum selected 14 paintings photographed displayed resolution 14,000 megapixels inside 3d version prado google earth google maps april 15 2008 version 4.3 google fully integrated street view google earth street view displays 360° panoramic street-level photos select cities surroundings photos taken cameras mounted automobiles viewed different scales many angles navigable arrow icons imposed introduced google earth 5.0 2009 google ocean feature allows users zoom surface ocean view 3d bathymetry supporting 20 content layers contains information leading scientists oceanographers april 14 2009 google added bathymetric data great lakes june 2011 google increased resolution deep ocean floor areas 1-kilometer grids 100 meters high-resolution features developed oceanographers columbia university lamont-doherty earth observatory scientific data collected research cruises sharper focus available 5 percent oceans seen hudson new york city wini seamount near hawaii mendocino ridge u.s pacific coast google programs features including within google earth allowing exploration mars moon view sky earth outer space including surfaces various objects solar system google sky feature introduced google earth 4.2 august 22 2007 browser-based application march 13 2008 android smartphones augmented reality features google sky allows users view stars celestial bodies produced google partnership space telescope science institute stsci baltimore science operations center hubble space telescope dr. alberto conti co-developer dr. carol christian stsci plan add public images 2007 well color images archived data hubble advanced camera surveys newly released hubble pictures added google sky program soon issued new features multi-wavelength data positions major satellites orbits well educational resources provided google earth community also christian conti website sky also visible sky mode constellations stars galaxies animations depicting planets orbits real-time google sky mashup recent astronomical transients using voevent protocol provided voeventnet collaboration programs similar google sky include microsoft worldwide telescope stellarium google mars application within google earth version program imagery planet mars google also operates browser-based version although maps much higher resolution within google earth include 3d terrain well infrared imagery elevation data also extremely-high-resolution images mars reconnaissance orbiter hirise camera similar resolution cities earth finally many high-resolution panoramic images various mars landers mars exploration rovers spirit opportunity viewed similar way google street view mars also small application found near face mars called meliza robot character user speak originally browser application google moon feature allows exploration moon google brought feature google earth 40th anniversary apollo 11 mission july 20 2009 announced demonstrated group invited guests google along buzz aldrin newseum washington d.c. google moon includes several tours including one apollo missions incorporating maps videos street view-style panoramas provided nasa google earth numerous features allow user learn specific places called layers include different forms media including photo video layers include tours guide user specific places set order layers created using keyhole markup language kml users also use create customized layers locations marked placemarks organized folders example user use placemarks list interesting landmarks around globe provide description photos videos viewed clicking placemarks viewing new layer application december 2006 google earth added new integration wikipedia panoramio wikipedia layer entries scraped coordinates via also community-layer project coordinates used different types display different languages supported built-in wikipedia layer panoramio layer features pictures uploaded panoramio users placed google earth based user-provided location data addition flat images google earth also includes layer user-submitted panoramic photos navigable similar way street view google earth includes multiple features allow user monitor current events 2007 google began offering users ability monitor traffic data provided google traffic real time based information crowdsourced gps-identified locations cell phone users google earth 4.2 flight simulator added application originally hidden feature introduced 2007 starting 4.3 given labeled option menu addition keyboard control simulator controlled mouse joystick simulator also runs animation allowing objects planes animate simulator another flight simulator geofs created name gefs-online using google earth plug-in api operate within web browser september 1 2015 program uses open-source program cesiumjs due google earth plug-in discontinued liquid galaxy cluster computers running google earth creating immersive experience september 30 2010 google made configuration schematics rigs public placing code setup guides liquid galaxy wiki liquid galaxy also used panoramic photo viewer using krpano well google street view viewer using peruse-a-rue peruse-a-rue method synchronizing multiple maps api clients google earth released macos linux ios android linux version began version 4 beta google earth native port using qt toolkit free software foundation consider development free compatible client google earth high priority free software project google earth released android february 22 2010 ios october 27 2008 mobile versions google earth make use multi-touch interfaces move globe zoom rotate view allow select current location automotive version google earth made available 2010 audi a8 google earth pro originally business-oriented upgrade google earth features movie maker data importer late january 2015 available 399/year though google decided make free public google earth pro currently standard version google earth desktop application version 7.3 pro version includes add-on software movie making advanced printing precise measurements currently available windows mac os x 10.8 later linux discontinued december 2008 google earth plus paid subscription upgrade google earth provided customers following features become available free google earth one feature gps integration allowed users read tracks waypoints gps device variety third-party applications created provide functionality using basic version google earth generating kml kmz files based user-specified user-recorded waypoints google earth enterprise designed use organizations whose businesses could take advantage program capabilities example globe holds company data available anyone company march 20 2015 google retired google earth enterprise product support ended march 22 2017 google earth enterprise allowed developers create maps 3d globes private use host platform gee fusion gee server gee portable server source code published github apache2 license march 2017 google earth 9 version google earth first released april 18 2017 development two years main feature version launching new web version google earth currently available google chrome version added voyager feature whereby users view portal page containing guided tours led scientists documentarians version also added 'm feeling lucky button represented die takes user random location earth along showing knowledge card containing short excerpt location wikipedia article google earth api free beta service allowing users place version google earth web pages api enabled sophisticated 3d map applications built unveiling google 2008 i/o developer conference company showcased potential applications game player controlled milktruck atop google earth surface google earth api deprecated december 15 2014 remained supported december 15 2015 google chrome ended support netscape plugin api google earth api relies end 2016 november 16 2016 google released virtual reality version google earth valve steam computer gaming platform google earth vr allows users navigate using vr controllers currently compatible oculus rift htc vive virtual reality headsets september 14 2017 part google earth vr 1.4 update google added street view support google earth outreach charity program google promotes donates various non-profit organizations beginning 2007 donations often accompanied layers featured google earth allowing users view non-profit projects goals navigating certain related locations google earth outreach offers online training using google earth google maps public education issues affecting local regions entire globe june 2008 training given 20 indigenous tribes amazon rainforest suruí help preserve culture raise awareness problem deforestation non-profit organizations featured google earth via outreach program include arkive global heritage fund wateraid world wide fund nature google earth engine cloud computing platform processing satellite imagery geospatial observation data provides access large database satellite imagery computational power needed analyze images google earth engine allows observation dynamic changes agriculture natural resources climate using geospatial data landsat satellite program passes places earth every sixteen days google earth engine become platform makes landsat sentinel-2 data easily accessible researchers collaboration google cloud storage google earth engine provides data catalog along computers analysis allows scientists collaborate using data algorithms visualizations platform uses python javascript application programming interfaces making requests servers google earth engine used multiple times tool tracking deforestation initial applications engine included mapping forests mexico identifying water congo basin detecting deforestation amazon rainforest using google earth engine track global forest loss gain university maryland reported overall loss global forest cover carnegie institute science claslite system imazon ’ sisteme de alerta de deforesation sad two institutions partnered google development google earth engine organizations use program build maps forests measure environmental disturbances additionally google earth engine expanded applications range tiger habitat monitoring malaria risk mapping global surface water software criticized number special interest groups including national officials invasion privacy posing threat national security typical argument software provides information military critical installations could used terrorists google earth blocked google iran sudan since 2007 due united states government export restrictions program also blocked morocco since 2006 maroc telecom major service provider country academic realm increasing attention devoted google earth place development digital globes particular international journal digital earth features multiple articles evaluating comparing development google earth differences compared professional scientific governmental platforms google earth role expansion earth observing media examined role shaping shared cultural consciousness regarding climate change humanity capacity treat earth engineerable object | [
4096,
5637,
8719,
3600,
7700,
9244,
11294,
7209,
1578,
10284,
5677,
3633,
1083,
6212,
69,
8262,
4683,
4685,
11343,
3664,
8280,
2139,
8285,
2658,
4194,
8821,
11391,
1670,
7816,
5262,
6800,
11408,
10393,
8858,
7835,
673,
7841,
8870,
1191,
1... | Test |
10,526 | 9 | JavaServer_Faces:javaserver faces javaserver faces jsf java specification building component-based user interfaces web applications formalized standard java community process part java platform enterprise edition also mvc web framework simplifies construction user interfaces ui server-based applications using reusable ui components page jsf 2 uses facelets default templating system view technologies xul plain java also employed contrast jsf 1.x uses javaserver pages jsp default templating system 2001 original java specification request jsr technology ultimately became javaserver faces proposed developing package name codice_1 june 2001 javaworld would report amy fowler team design javaserver faces api aka moonwalk – application framework creating web-based user interfaces based component-driven ui design-model javaserver faces uses xml files called view templates facelets views codice_2 processes requests loads appropriate view template builds component tree processes events renders response typically html language client state ui components objects scope interest saved end request process called statesaving note transient true restored upon next creation view either client server side save objects states jsf often used together ajax rich internet application development technique ajax combination web development techniques technologies make possible create rich user interfaces user interface components mojarra jsf reference implementation apache myfaces originally developed html ajax added via javascript changed however jsf supports multiple output formats ajax-enabled components easily added enrich jsf-based user interfaces jsf 2.0 specification provides built-in support ajax standardizing ajax request lifecycle providing simple development interfaces ajax events allowing event triggered client go proper validation conversion finally method invocation returning result browser via xml dom update jsf 2 includes support graceful degradation javascript disabled browser following companies projects offer ajax-based jsf frameworks component libraries facelets designed specifically javaserver faces adopted official view technology jsf 2.0 eliminates life-cycle conflicts existed jsp forcing workarounds java developers facelets allows easy component/tag creation using xml markup instead java code chief complaint jsf 1.x new jsf developments also provide wide accessibility java 5 annotations codice_3 codice_4 codice_5 removes need codice_6 cases except framework extension navigation simplified removing need codice_6 navigation cases page transitions invoked simply passing name desired view/facelet addition partial state saving dom updates part built-in standardized ajax support latest jsf release built-in support handling resources like images css javascript allowing artifacts included component libraries separated jar files simply co-located consistent place within web application includes logical naming versioning resources jsf 2.0 also includes number changes like adding support events separate development staging production modes similar codice_8 ruby rails significantly expanding standard set components january 2014 technology radar publication thoughtworks wrote article published november 2014 dzone website titled avoid jsf jens schauder wrote february 2014 çağatay çivici primefaces lead responded thoughtworks criticisms post titled jsf ’ told anymore çivici argues improvements jsf years offer many features embrace modern web development providing option write javascript html css also regarding state çağatay wrote | [
7176,
2062,
2576,
9245,
8739,
5165,
5677,
2106,
3131,
572,
7750,
1095,
595,
84,
102,
1128,
9834,
8825,
3705,
3712,
148,
4777,
8883,
692,
6328,
190,
6334,
9412,
6860,
3278,
7374,
1250,
5872,
9988,
4358,
1802,
3341,
1812,
6941,
10526,
387... | Test |
10,527 | 0 | Bradford's_law:bradford law bradford law pattern first described samuel c. bradford 1934 estimates exponentially diminishing returns searching references science journals one formulation journals field sorted number articles three groups one-third articles number journals group proportional 1 n n² number related formulations principle many disciplines pattern called pareto distribution practical example suppose researcher five core scientific journals subject suppose month 12 articles interest journals suppose order find another dozen articles interest researcher would go additional 10 journals researcher bradford multiplier b 2 i.e 10/5 new dozen articles researcher need look b times many journals looking 5 10 20 40 etc journals researchers quickly realize little point looking different researchers different numbers core journals different bradford multipliers pattern holds quite well across many subjects may well general pattern human interactions social systems like zipf law related good explanation works knowing useful librarians means specialty sufficient identify core publications field stock rarely researchers need go outside set however impact far greater armed idea inspired vannevar bush famous article may think eugene garfield institute scientific information 1960s developed comprehensive index scientific thinking propagates science citation index sci effect making easy identify exactly scientists science impact journals science appeared also caused discovery expect journals nature science core hard science pattern happen humanities social sciences result pressure scientists publish best journals pressure universities ensure access core set journals hand set core journals may vary less strongly individual researchers even strongly along schools-of-thought divides also danger over-representing majority views journals selected fashion bradford law also known bradford law scattering bradford distribution another general term come use since 2006 information scattering though better categorized secondary information scattering law distribution bibliometrics applied world wide web hjørland nicolaisen 2005 p. 103 identified three kinds scattering found literature bradford law including bradford papers unclear relation kind scattering actually measured interpretation bradford law terms geometric progression suggested v. yatsko introduced additional constant demonstrated bradford distribution applied variety objects distribution articles citations across journals v. yatsko interpretation y-interpretation effectively used compute threshold values case necessary distinguish subsets within set objects successful/unsuccessful applicants developed/underdeveloped regions etc | [
6279,
10621,
3694,
119
] | Test |
10,528 | 2 | Bruce_Perens'_Open_Source_Series:bruce perens open source series bruce perens open source series series books edited bruce perens series editor published prentice hall ptr principal topics linux open-source software books intended professional software developers system network administrators power users series published 2002 2006 24 titles series book licensed open publication license made available free download several months publication first book series published open content license | [
823
] | Validation |
10,529 | 4 | Two-man_rule:two-man rule two-man rule control mechanism designed achieve high level security especially critical material operations rule access actions require presence two authorized people times per us air force instruction afi 91-104 two-person concept designed prevent accidental malicious launch nuclear weapons single individual case minuteman missile launch crews launch order received operators must agree valid comparing authorization code order sealed authenticator special sealed envelope holds code sealed authenticators stored safe two separate locks operator key one lock neither open safe alone also operator one two launch keys order verified must insert keys slots control panel turn simultaneously precaution slots two launch keys positioned far enough apart make impossible one operator reach additional protection missile crew another launch control center must missiles launched total four keys thus required initiate launch submarine commanding officer executive officer must agree order launch valid mutually authorize launch operations personnel instead another party would confirm missile launch case land-based icbms third officer weapons officer must also confirm launch addition set keys distributed among key personnel submarine keys kept safes crew members access keys keys stored special safes board secured combination locks nobody board combination open safes unlock key comes part launch order emergency action message higher authority journalist ron rosenbaum pointed order issued process entirely concerned authenticating identity commanding officers authenticity order safeguards verify order person issuing actually sane notably major harold hering discharged air force asking question know order receive launch missiles came sane president two-man rule applies missile silos submarines check president sole authority order nuclear launch two-person integrity tpi security measure taken prevent single-person access comsec keying material cryptographic manuals tpi accomplished follows time one person possession combinations keys gain lone access security container cryptographic equipment containing comsec material neither one person sole possession comsec material requires tpi security no-lone zone area must staffed two qualified cleared individuals individual must within visual contact visual contact critical component requires no-lone-zone area designation no-lone zone may contain cryptographic component weapon system hardware test nuclear weapon active nuclear weapon controls united states air force usaf policy concerning critical weapons no-lone zone area presence single individual prohibited two-person concept requires presence two individuals knowledgeable task performed capable detecting incorrect unauthorized procedure part regarding task performed two-man rule used safety critical applications presence two people required potentially hazardous operation performed common safety practice example laboratories machine shops context additional security may less important fact one individual injured call help another example firefighters operating hazardous environment i.e interior structure fire hazmat zone also known idlh 'immediately dangerous life health function team least two personnel commonly one team environment team operates unit dual keys require authorization two separate parties particular action taken simplest form dual key security lock requires two keys unlock two keys would possession two separate persons lock could opened parties agreed open time 1963 canada accepted american w-40 nuclear warheads dual key control canadian soil used canadian bomarc missiles similarly many banks implement variant two-man rule secure large sums money valuable items concept unlocking vault requires two individuals different keys vault secured key lock system bank vaults secured combination lock one individual know half combination second person know remaining half point either person know person half lock combination requiring persons physically present order unlock vault extension broader rationale two-man rule regulations companies not-for-profit organizations may require signatures two executives checks rules make harder individual acting alone defraud organization software systems enforce two-man rule whereby certain actions example funds wire transfers take place approved two authorized users helps prevent expensive errors makes difficult commit fraud embezzlement requirements common financial systems also used controls critical infrastructure nuclear reactors electrical power generation dangerous operations biohazard research facilities finally testimony two witnesses valuable various situations deter wrongful act false accusation one prove wrongful act occurred late march 2015 many national aviation authorities and/or airlines made cockpits aircraft flight mandatory two-man no-lone zones result germanwings flight 9525 crash early investigation crash believed cockpit voice recorder audio later supported flight data recorder information co-pilot deliberately crashed aircraft locking cockpit door captain left use toilet | [
1272,
7887,
11507,
55
] | Test |
10,530 | 2 | SME_Server:sme server sme server formerly known e-smith linux distribution based centos offering operating system computers used web file email database servers employs comprehensive ui management-related tasks extensible templates letters sme stand small medium enterprise target market software one notable features distribution template system sme server 9.1 based centos 6.7 based red hat enterprise linux rhel version 32bit pae support 64bit available running apache 2.0 mysql 5.0 php 5 additional addons available current stable version called sme contribs core network environment easy simple access shared files printers sme server software allows easy sharing files printers windows macintosh clients information bay i-bay feature provides easy convenient information storage retrieval multiple groups via web ftp file sharing small business customers looking simple solution works different types connections internet sme server automates process connecting internet connect server supply isp account information server solution acts gateway entire network requires additional client software minimal configuration users immediately start browsing web using email access internet services pervasiveness email small businesses increasingly need support email employees sme server provides secure reliable email server allows easy creation individual group addresses greater versatility works mail client uses industry-standard imap pop3 smtp protocols secure webmail allows users access server web browser anywhere internet send receive e-mail via encrypted 128-bit ssl link top equipped clamav antivirus spamassassin reduce amount unsolicited mail security always priority company starts using internet sme server offers multi-layer architecture protecting external interface packet-filtering service restriction offers selective address port binding application-level access control lists protects internal network intrusion businesses remote branch sites telecommuting employees require remote access email resources local network sme server provides multiple tools webmail access email using browser 128-bit pptp secure client-to-server vpns open secure shell ssh provide encrypted access internal network server resources administrators companies typically require central directory email addresses users access sme server features robust directory service used email clients including outlook outlook express netscape communicator feature implemented using industry-standard ldap protocol small businesses also need secure reliable web presence intranet communicate employees sme server includes apache web server used 60 internet content easily edited updated desktop clients including dynamic content also supports use secure sockets layer ssl connections e-commerce sme server software supports hardware software disk mirroring raid 1 usb disk backup tape backup additional data protection almost packages sme server includes upstream vendors included unmodified purpose take advantage stability comes huge user base uses packages security allow automatic updates soon update available upstream vendor security updates redhat/centos available 2012 centos 4 sme server architecture explicitly supports developers making easy drop software place remove without needing modify existing files extensions easily add new features popular examples asterisk voip pbx hylafax server dansguardian web content filter joomla cms jinzorra jukebox mediawiki thin client server oscommerce online shop | [
4611,
3079,
3089,
4113,
8209,
8727,
543,
11297,
7204,
9253,
11305,
56,
3129,
4153,
59,
8248,
9276,
4673,
3654,
5190,
3147,
2125,
1107,
1110,
89,
5721,
4192,
3685,
10341,
10860,
5742,
2671,
11388,
2692,
8837,
9353,
9873,
11410,
8857,
10394... | None |
10,531 | 4 | Online_Armor_Personal_Firewall:online armor personal firewall online armor personal firewall firewall originally developed australian company tall emu program sold emsi software gmbh emsisoft ltd program provides protection microsoft windows operating system inbound outbound attacks three editions product independent proactive security challenge test performed matousec.com online armor premium received score 99 surpassing well-known firewalls zonealarm kaspersky internet security well known vulnerability profiling site company secunia found vulnerabilities march 2008 software though matousec reported weakness 25 march 2008 repaired latest version online armor gained negative positive feedback users reporting serious compatibility problems certain programs f-secure ad muncher noted product website also receiving praise free online support swift response problems 31 march 2015 emsisoft ltd announced discontinued selling new licenses online armor would possible activate new license keys end may 2015 support online armor would officially end 31 march 2016 | [
1792,
2049,
4480,
5380,
6797,
1172,
9496,
3482,
1436,
4511,
6431,
5924,
2213,
550,
8998,
10790,
1708,
3885,
7983,
8753,
823,
569,
5178,
11577,
5057,
1858,
10433,
11073,
2118,
4814,
9423,
10574,
7121,
10708,
4568,
9048,
2907,
6364,
5860,
3... | Test |
10,532 | 9 | Syntactic_closure:syntactic closure computer science syntactic closures implementation strategy hygienic macro system actual arguments macro call enclosed current environment inadvertently reference bindings introduced macro | [
5585,
10011,
10581
] | Test |
10,533 | 2 | Machine_code_monitor:machine code monitor machine code monitor machine language monitor software allows user enter commands view change memory locations computer options load save memory contents from/to secondary storage full-featured machine code monitors provide detailed control single-stepping execution machine language programs much like debugger include absolute-address code assembly disassembly capabilities machine code monitors became popular home computer era 1970s 1980s sometimes available resident firmware computers e.g. built-in monitor commodore 128 unheard perform one programming monitor lieu full-fledged symbolic assembler even full-featured assemblers became readily available machine code monitor indispensable debugging programs usual technique set break points code undergoing testing e.g. brk instruction 6502 assembly language start program microprocessor encountered break point test program would interrupted control would transferred machine code monitor typically would trigger register dump monitor would await programmer input activities point might include examining memory contents patching code and/or perhaps altering processor registers prior restarting test program general decline scratch-written assembly language software made use machine code monitor somewhat lost art systems higher-level languages employed debuggers used present abstract friendly view happening within program however use machine code monitors persists especially area hobby-built computers | [
5733,
11494,
7335,
8494,
7536,
5457,
7281,
3157,
9911,
7421,
477
] | Test |
10,534 | 3 | Xak:_The_Tower_of_Gazzel:xak tower gazzel xak precious package tower gazzel fantasy role-playing video game developed published japanese software developer microcabin game direct sequel technically third installment series tower gazzel sidestory taking place events game released japan latok kart defeated zamu gospel events portrayed xak ii friends intrigued rumours demonic tower man looking like latok roaming neighbourhood appearance false latok kidnapping rune greed family ploys lure two descendants duel tower laid villains al acrila gill berzes demon called zegraya using latok rune plan resurrect ancient demon gazzel demon unimaginable power comparable destroying entire mountain single attack player controls latok looking onto game world bird's-eye view latok swing sword optionally firing magical shots tip expense magic points jump short distances player choose take along one party four characters exploration tower so-called 'support members subtly change latok statistics addition triggering different events within game entirety tower large labyrinth spanning six floors elemental theme darkness basement respectively earth fire water wind heaven first fifth floors game one large puzzle goal reaching bottom floor defeating zegraya gazzel many puzzles revolve around fact floors heavily interconnected floor fire example large wall flames latok pass way water floor large door opened pours large amount water hole floor dousing flames another part puzzles involves choice support member take along support members n't affect latok combat statistics points game passed right support member tagging along even items game latok use right supportmember example latok finds magical scroll lightning spell inscribed n't master enough magic cast certain part first floor seemingly impassable wall rubble fray selected support member snatch lightning scroll latok use blast path rubble game saved fixed point entrance tower prevent player backtrack save game various items found teleport latok support member back entrance fixed point inside tower contrary predecessors tower gazzel use experience point system currency kind appear game latok starts game level 50 end xak ii advance instead occurs xak iii new equipment also unavailable latok sticks sword armor shield xak ii end throughout game eliminates need player spend large amounts time 'leveling collecting enough experience points and/or gold player character grow strong enough buy new equipment respectively way game emphasis puzzle aspect combat kind advancement system retained latok find different pairs gauntlets tower pair enhancing combat statistics game engine almost identical xak ii preserving real-time combat aspect music graphics even recycled previous installment compared xak ii xak gazzel runs much smoother even regular msx2 prompting much less shorter loading times possible supportmembers abilities follows addition single save point game represented healer fell bow except villains game uses little non-player characters emphasising puzzling aspect even | [
10339,
145,
10931,
4181,
6011
] | Test |
10,535 | 2 | Portsnap:portsnap portsnap system written colin percival secure distribution compressed digitally signed snapshots freebsd ports tree distribution follows client–server model uses transport protocol http pipelined http freebsd 6.0 portsnap part base system including 5.5 previous versions installed ports standalone program run manually cron job one alternatives classic cvsup method advantages include another alternative cvsup cvsync used manage openbsd source tree shares cvsup disadvantages though portsnap package distributed 2-clause bsd license | [
7425,
2180,
1927,
1801,
10761,
274,
9625,
1946,
4636,
9343,
2212,
6438,
684,
4908,
2222,
1071,
3248,
7983,
9009,
11698,
11573,
1718,
9784,
1465,
5177,
5819,
3006,
11459,
9927,
8266,
8395,
8909,
5710,
6864,
7249,
850,
10455,
6361,
8410,
64... | Test |
10,536 | 9 | Pstoedit:pstoedit pstoedit free computer program converts postscript pdf files vector formats supports many output formats including wmf/emf pdf dxf cgm html means free/shareware plugins svg mif rtf author maintainer wolfgang glunz pstoedit uses ghostscript perform first part conversion process ghostscript converts postscript pdf file basic postscript format translating complex functions basic functions line draw commands second part conversion process consists translating basic functions basic functions output format pstoedit multi platform ms windows setup program available 32bit 64bit complete job including instance making connection ghostscript ms office three interfaces installed command line interface interface means gsview import filter ms office however make actual use ms office interface 50 registration required registration also adds functionality two interfaces licensed gnu general public license pstoedit free software | [
10352,
8627,
8628
] | Test |
10,537 | 2 | Dalvik_(software):dalvik software dalvik discontinued process virtual machine vm google android operating system executes applications written android dalvik bytecode format still used distribution format longer runtime newer android versions dalvik integral part android software stack unsupported android versions 4.4 kitkat earlier commonly used mobile devices mobile phones tablet computers devices smart tvs wearables dalvik open-source software originally written dan bornstein named fishing village dalvík eyjafjörður iceland programs android commonly written java compiled bytecode java virtual machine translated dalvik bytecode stored .dex dalvik executable .odex optimized dalvik executable files related terms odex de-odex associated respective bytecode conversions compact dalvik executable format designed systems constrained terms memory processor speed successor dalvik android runtime art uses bytecode .dex files .odex files succession aiming performance improvements transparent end users new runtime environment included first time android 4.4 kitkat technology preview replaced dalvik entirely later versions android 5.0 lollipop first version art included runtime unlike java vms stack machines dalvik vm uses register-based architecture requires fewer typically complex virtual machine instructions dalvik programs written java using android application programming interface api compiled java bytecode converted dalvik instructions necessary tool called dx used convert java .class files .dex format multiple classes included single .dex file duplicate strings constants used multiple class files included .dex output conserve space java bytecode also converted alternative instruction set used dalvik vm uncompressed .dex file typically percent smaller size compressed java archive jar derived .class files dalvik executables may modified installed onto mobile device order gain optimizations byte order may swapped certain data simple data structures function libraries may linked inline empty class objects may short-circuited example optimized low memory requirements dalvik specific characteristics differentiate standard vms according google design dalvik permits device run multiple instances vm efficiently android 2.2 froyo brought trace-based just-in-time jit compilation dalvik optimizing execution applications continually profiling applications time run dynamically compiling frequently executed short segments bytecode native machine code dalvik interprets rest application bytecode native execution short bytecode segments called traces provides significant performance improvements relative merits stack machines versus register-based approaches subject ongoing debate generally stack-based machines must use instructions load data stack manipulate data thus require instructions register machines implement high-level code instructions register machine must encode source destination registers therefore tend larger difference importance vm interpreters opcode dispatch tends expensive along factors similarly relevant just-in-time compilation tests performed armv7 devices 2010 oracle owner java technology standard non-graphical java benchmarks showed hotspot vm java se embedded 2–3 times faster jit-based dalvik vm android 2.2 initial android release included jit compiler 2012 academic benchmarks confirmed factor 3 hotspot dalvik android board also noting dalvik code smaller hotspot furthermore benchmarks performed android device still show factor 100 native applications dalvik application android device upon running benchmarks using early interpreter 2009 java native interface jni native code showed order magnitude speedup dalvik published terms apache license 2.0 say dalvik clean-room implementation rather development top standard java runtime would mean inherit copyright-based license restrictions either standard-edition open-source-edition java runtimes oracle reviewers dispute august 12 2010 oracle acquired sun microsystems april 2009 therefore owns rights java sued google claimed infringement copyrights patents oracle alleged google developing android knowingly directly repeatedly infringed oracle java-related intellectual property may 2012 jury case found google infringe oracle patents trial judge ruled structure java apis used google copyrightable parties agreed zero dollars statutory damages 9 lines copied code | [
5637,
6150,
6664,
2058,
3082,
8719,
3600,
7700,
9244,
11294,
5663,
1578,
5677,
7733,
1083,
6718,
10303,
5697,
6212,
69,
5702,
8262,
4685,
3664,
7248,
8280,
8285,
2658,
9831,
6763,
9330,
3705,
11391,
1670,
9863,
4238,
5262,
10393,
7835,
67... | Test |
10,538 | 7 | Virtual_Enterprise_Network_Architecture:virtual enterprise network architecture fabric connect computer networking usage name used extreme networks market extended implementation ieee 802.1aq shortest path bridging mac-in-mac standard fabric connect technology originally developed enterprise solutions r department within nortel networks 2009 avaya inc acquired nortel networks enterprise business solutions transaction included fabric connect intellectual property together ethernet switching platforms supported subsequently fabric connect technology became part extreme networks portfolio virtue 2017 purchase avaya networking business assets avaya era technology promoted lead element virtual enterprise network architecture vena part extreme networks stated acquisition avaya networking assets specifically award-winning fabric technology ... strengthens extreme position leader across education healthcare government markets network virtualization capability based enhanced implementation ieee 802.1aq shortest path bridging spb standard fabric connect offers ability create simplified network dynamically virtualize elements efficiently provision utilize resources thus reducing strain network personnel extreme networks base fabric connect technology spb standard including support nowiki rfc 6329 /nowiki integrated ip routing ip multicast support unified technology allows replacement multiple conventional protocols spanning tree rip and/or ospf ecmp pim simply put fabric connect aim provide network-wide end-to-end multi-layer virtualization adjunct fabric connect technology fabric attach allows network operators extend network virtualization directly conventional wiring closet existing non-fabric ethernet switches automate provisioning devices appropriate virtual network particularly relevant mass unattended network end-point appearing ip phones wireless access points ip cameras fabric attach standardized protocols 802.1ab lldp exchange credentails obtain provisioning information allows client switches automatically re-configured fly parameters let traffic flows map fabric connect edge switches aka backbone edge bridge spb definition functioning fabric attach server switch method described ietf internet draft pending standardization activity fabric attach typically used automate wiring closet connectivity potential extensible use data center virtual machines able dynamically request vlan/vsn virtual service network assignment based upon application requirements range modular chassis-based products featuring carrier-grade linux operation system designed high-performance deployment scenarios need scale multiple terabit switching capacity support 10 40 gigabit ethernet connections designed eventually support 100 gigabit ethernet compact form-factor platform delivering high-density 10/40 gigabit ethernet connectivity targeted mid-market mid-size enterprise core switch applications range high-end 10 gigabit ethernet stackable switches extend fabric-based networking data center top-of-rack support 40 gigabit ethernet via mda slot range high-end gigabit ethernet stackable switches extend fabric-based networking branch metro locations range high-end gigabit ethernet stackable switches provide enterprise-class desktop features including poe offering 10 gbit/s uplink connections switch supports 144 gbit/s virtual backplane capacity delivering 1.152 tbit/s system eight creating virtual backplane stacking configuration mid-range gigabit ethernet stackable switches provide enterprise-class desktop features including poe/poe+ offering 1/10 gbit/s uplink connections switch supports 48gbit/s virtual backplane capacity delivering 384gbit/s system 8 creating virtual backplane stacking configuration entry-level gigabit ethernet stackable switches provide enterprise-class desktop features including poe/poe+ 1 gbit/s uplink connections | [
3752,
5518,
3751
] | Test |
10,539 | 4 | Cyber_threat_hunting:cyber threat hunting cyber threat hunting active cyber defence activity process proactively iteratively searching networks detect isolate advanced threats evade existing security solutions contrast traditional threat management measures firewalls intrusion detection systems ids malware sandbox computer security siem systems typically involve investigation evidence-based data warning potential threat threat hunting traditionally manual process security analyst sifts various data information using knowledge familiarity network create hypotheses potential threats limited lateral movement threat actors even effective efficient however threat hunting partially automated machine-assisted well case analyst uses software leverages machine learning user entity behavior analytics ueba inform analyst potential risks analyst investigates potential risks tracking suspicious behavior network thus hunting iterative process meaning must continuously carried loop beginning hypothesis hypothesis focus efforts known exploits potential bad actors assets data value using security data industry reports intelligence hypothesis formed hunt team sets prove disprove validity cyber threat hunts often employ automated manual tools techniques identify compromise detected three types hypotheses analyst researches hypothesis going vast amounts data network results stored used improve automated portion detection system serve foundation future hypotheses detection maturity level dml model expresses threat indicators detected different semantic levels high semantic indicators goal strategy tactics techniques procedure ttp valuable identify low semantic indicators network artifacts atomic indicators ip addresses siem tools typically provide indicators relatively low semantic levels therefore need develop siem tools provide threat indicators higher semantic levels representative notable vendors threat hunting software services include sans institute conducted research surveys effectiveness threat hunting track disrupt cyber adversaries early process possible according survey released 2017 60 hunt threats reported measurable improvements infosec programs based hunting efforts 91 report improvements speed accuracy response two types indicators sans institute identifies threat hunting maturity model follows cyberattackers operate undetected average 99 days obtain administrator credentials less three days according mandiant m-trends report study also showed 53 attacks discovered notification external party average company takes 170 days detect advanced threat 39 days mitigate 43 days recover according ponemon institute | [
2976,
612,
8580,
8998,
10437,
3433,
5577,
4972,
1453,
176,
4689,
11198,
3637,
9341,
11611,
4860,
5245,
8478
] | Test |
10,540 | 9 | Canigó_(framework):canigó framework canigó name chosen java ee framework generalitat de catalunya canigó defined common technological framework development execution web applications corporative systems departments generalitat de catalunya covers various functionalities canigó architecture based model–view–controller abstraction process allows division application logics three main components able developed different rols team actually canigó architecture mvc structured framework divided 3 layers 4 cross-cutting modules canigó modular structure gives developers option use needed modules cover project requirements modules defined interfaces isolating chosen implementations canigó based series resources api integration jpa open source packages spring swagger ... also offers extensions packages adding wide catalog reusable components one important architectural basis decoupling frontend backend using rest api architecture allows independent development teams work frontend backend framework consists blocks specified spring open source framework written java platform first version created rod johnson october 2002 last release version 5.0.9 published first week september 2018 canigó designed help configuration web applications also simplify systems construction different pieces easily interchangeable visible service integration security services database connection transactionality etc ... spring provides complete testing system possible develop unitary tests uncoupling objects context making easier execution test cases external data access spring easy task framework manages resources also support apis able bear vast majority java industry data access technologies like jdbc hibernate jpa jdo ibatis main basis canigó architecture completely integrated group also modular best practices java web applications developing technologies actual components constitute system module core framework main features located user authorisation authentication applications access management system since canigo 3.2.0 jsf deprecated presentation layer technology presentation layer responsibility delegated outside framework another teams specialized front-end technologies angular react goal providing simple access different services offered generalitat de catalunya module enables application data persistence retrieval application database management systems module delivers additional features framework module adds feature applications generate execution instrumentation data data ready mined processed monitoring tools | [
7364,
6860,
2038
] | None |
10,541 | 0 | Text_Retrieval_Conference:text retrieval conference text retrieval conference trec ongoing series workshops focusing list different information retrieval ir research areas tracks co-sponsored national institute standards technology nist intelligence advanced research projects activity part office director national intelligence began 1992 part tipster text program purpose support encourage research within information retrieval community providing infrastructure necessary large-scale evaluation text retrieval methodologies increase speed lab-to-product transfer technology track challenge wherein nist provides participating groups data sets test problems depending track test problems might questions topics target extractable features uniform scoring performed systems fairly evaluated evaluation results workshop provides place participants collect together thoughts ideas present current future research work new tracks added new research needs identified list current trec 2018 1997 japanese counterpart trec launched first workshop 1999 called ntcir nii test collection ir systems 2000 clef european counterpart specifically vectored towards study cross-language information retrieval launched nist claims within first six years workshops effectiveness retrieval systems approximately doubled conference also first hold large-scale evaluations non-english documents speech video retrieval across languages additionally challenges inspired large body publications technology first developed trec included many world commercial search engines independent report rtii found one-third improvement web search engines 1999 2009 attributable trec enhancements likely saved 3 billion hours time using web search engines ... additionally report showed every 1 nist partners invested trec least 3.35 5.07 benefits accrued u.s. information retrieval researchers private sector academia one study suggests state art ad hoc search advanced substantially past decade referring search topically relevant documents small news web collections gigabytes advances types ad hoc search past decade example test collections created known-item web search found improvements use anchor text title weighting url length useful techniques older ad hoc test collections 2009 new billion-page web collection introduced spam filtering found useful technique ad hoc web search unlike past test collections test collections developed trec useful potentially helping researchers advance state art also allowing developers new commercial retrieval products evaluate effectiveness standard tests past decade trec created new tests enterprise e-mail search genomics search spam filtering e-discovery several retrieval domains trec systems often provide baseline research examples include conference made varied international group researchers developers 2003 93 groups academia industry 22 countries participating | [
7780,
9222,
6762,
1771,
4272,
11538,
1913,
3323
] | Test |
10,542 | 7 | Apptix:apptix apptix application service provider asp technology company providing hosted business services software service apptix serves businesses customers highly regulated industries healthcare apptix services include microsoft exchange email voip phone service microsoft sharepoint collaboration services web conferencing/secure im email encryption mobile device management messaging active directory management archiving backup services september 2015 apptix acquired godaddy inc 22.5 million cash deal apptix founded 1997 spun telecomputing asa oslo norway company headquartered herndon virginia usa additional locations florida texas apptix publicly traded oslo stock exchange ose app apptix acquired integrated hosted exchange vendors asp-one mi8 mailstreet 2011 revenues totaled us 40.7 million 5 38.6 millionin 2010 positive net income trends continued first three quarters 2012 apptix microsoft partner offering hosted microsoft exchange microsoft sharepoint services apptix technology partners include parallels well symantec sonian mozy apptix ’ channel partners include insight enterprises megapath cincinnati bell inc. web.com sprint nextel corporation | [
3161,
929,
467,
9569
] | None |
10,543 | 3 | POWER6:power6 power6 microprocessor developed ibm implemented power isa v.2.03 became available systems 2007 succeeded power5+ ibm flagship power microprocessor claimed part eclipz project said goal converging ibm server hardware practical hence ipz acronym iseries pseries zseries power6 described international solid-state circuits conference isscc february 2006 additional details added microprocessor forum october 2006 next isscc february 2007 formally announced may 21 2007 released june 8 2007 speeds 3.5 4.2 4.7 ghz company noted prototypes reached 6 ghz power6 reached first silicon middle 2005 bumped 5.0 ghz may 2008 introduction p595 power6 dual-core processor core capable two-way simultaneous multithreading smt power6 approximately 790 million transistors 341 mm large fabricated 65 nm process notable difference power5 power6 executes instructions in-order instead out-of-order change often requires software recompiled optimal performance power6 still achieves significant performance improvements power5+ even unmodified software according lead engineer power6 project power6 also takes advantage viva-2 virtual vector architecture enables combination several power6 nodes act single vector processor core two integer units two binary floating-point units altivec unit novel decimal floating-point unit binary floating-point unit incorporates many microarchitectures logic circuit latch integration techniques achieve 6-cycle 13-fo4 pipeline according company paper unlike servers ibm competitors power6 hardware support ieee 754 decimal arithmetic includes first decimal floating-point unit integrated silicon 50 new floating point instructions handle decimal math conversions binary decimal feature also added z10 microprocessor featured system z10 core 64 kb four-way set-associative instruction cache 64 kb data cache eight-way set-associative design two-stage pipeline supporting two independent 32-bit reads one 64-bit write per cycle core semi-private 4 mib unified l2 cache cache assigned specific core fast access two cores share 32 mib l3 cache die using 80 gb/s bus power6 connect 31 processors using two inter node links 50 gb/s supports 10 logical partitions per core limit 254 per system interface service processor monitors adjusts performance power according set parameters ibm also makes use 5 ghz duty-cycle correction clock distribution network processor network company implements copper distribution wire 3 µm wide 1.2 µm thick power6 design uses dual power supplies logic supply 0.8-to-1.2 volt range sram power supply 150-mv higher thermal characteristics power6 similar power5 dr frank soltis ibm chief scientist said ibm solved power leakage problems associated high frequency using combination 90 nm 65 nm parts power6 design slightly enhanced power6+ introduced april 2009 shipping power 560 570 systems since october 2008 added memory keys secure memory partition feature taken ibm mainframe processors range power6 systems includes express models 520 550 560 enterprise models 570 595 various system models designed serve sized business example 520 express marketed small businesses power 595 marketed large multi-environment data centers main difference express enterprise models latter include capacity upgrade demand cuod capabilities hot-pluggable processor memory books ibm also offers four power6 based blade servers specifications shown table blades support aix linux bladecenter h chassis supported blades running aix linux bladecenter e ht chassis support blades running aix linux supercomputing 2007 sc07 conference reno new water-cooled power 575 revealed 575 composed 2u nodes 32 power6 cores 4.7 ghz 256 gb ram 448 cores installed single frame | [
6914,
4868,
10501,
3846,
4743,
6663,
5642,
1548,
1933,
6926,
3472,
4881,
5393,
7065,
1563,
1309,
3493,
6949,
6311,
8102,
1321,
9126,
9391,
4017,
5297,
7218,
10675,
1461,
7607,
8120,
6715,
9020,
1725,
1983,
1985,
2625,
10180,
8136,
336,
85... | Test |
10,544 | 3 | Bosconian:bosconian bosconian allows player ship freely roam across open space scrolls directions game also radar tracks position player ship enemy formation attacks space stations objective bosconian score many points possible destroying enemy missiles bases player controls small fighter ship move eight directions fire forward backward round consists number green enemy bases must destroyed advance next round semi-transparent automap helps identify location station consists six cannons arranged hexagon surrounding central core player must either destroy six cannons 200 points shoot core destroy station 1,500 points later rounds core capable defending opening closing launching missiles additionally player must avoid destroy stationary asteroids 10 points mines 20 points variety enemy missiles ships attempt collide ship enemy bases also occasionally launch squadron ships formation attacks — destroying leader causes remaining enemies disperse destroying enemies formation scores extra bonus points spy ship worth random bonus value also appear occasionally must destroyed round go condition red regardless long player taken throughout game digitized voice alerts player various events bosconian definite ending continue player lost lives similar galaga bosconian rolls round 255 round 0 causing game behave abnormally round player successfully complete round 0 game continues round 1 though player started upon scoring 2,000,000 points lives thereafter bosconian 1982 arcade award best science fiction/fantasy coin-op game january 1983 beating atari gravitar sega zaxxon bosconian later appeared several namco museum compilations playstation consoles game also released jakks pacific tv game controllers released part pac-man arcade party arcade machine 2010 home computer sequel bosconian '87 released 1987 amstrad cpc commodore 64 zx spectrum spiritual successor blast released 1989 japan runs namco system 1 hardware bears resemblance namco dragon spirit bosconian related title final blaster released 1990 pc-engine japan featured gameplay akin blast bosconian one first games continuation screen edged fantasy released one month earlier 1981 feature could disabled entirely arcade owners want changing dip switch setting | [
11522,
1060,
9093,
3307,
2540,
9006,
10287,
1776,
10931,
8663
] | Test |
10,545 | 4 | Internet_Crimes_Against_Children:internet crimes children internet crimes children icac task-force started united states department justice office juvenile justice delinquency prevention ojjdp 1998 primary goals provide state local law enforcement agencies tools prevent internet crimes children encouraging multi-jurisdictional cooperation well educating law enforcement agents parents teachers aims icac task forces catch distributors child pornography internet whether delivered on-line solicited on-line distributed channels catch sexual predators solicit victims internet chat rooms forums methods currently fifty states participate icac | [
1639,
10446,
7887,
10290,
796
] | Validation |
10,546 | 4 | Sentrigo:sentrigo sentrigo privately held software company located santa clara california usa acquisition april 2011 mcafee company founded 2006 nathan shuchami slavik markovich address several key challenges database security specifically inability monitor activity privileged users established credentials nefarious means difficulty maintaining dbms current patch level company products expanded include broader suite database security offerings including database audit vulnerability assessment well investors sentrigo included benchmark capital stata ventures juniper networks hedgehog family products providing vulnerability assessment database activity monitoring purposes reducing risks data breach meeting compliance regulations related sensitive data hedgehog allows customers protect databases oracle microsoft sql server sybase without interfering day-to-day operations company primary product introduced 2007 hedgehog enterprise provides core monitoring capability based sensor server model sensor resides database server os monitors memory/cache suspect database transactions sending alerts real-time management console thus unlike network-based host-based intrusion detection systems ids intrusion prevention systems ips hedgehog fully monitor databases running virtual machines even cloud server java-based application communicates sensors centrally monitor hundreds databases based set policies rules system audit alert suspend sessions violate preset conditions announced september 2010 hedgehog dbscanner enterprise vulnerability assessment solution databases includes capabilities automatically finding databases network subjects 3,000 different security checks reports provide details discovered vulnerabilities current patch level weak passwords shared accounts configuration errors insecure database code dbscanner implemented along hedgehog enterprise case shares common management console run standalone module vpatch solution virtual patching databases overcome problem many customers unable apply security patches databases timely manner may due inability schedule downtime production system time lag testing 3rd party support applications top database numerous reasons sentrigo vpatch includes set rules generate alerts known vulnerabilities exploited used terminate attackers database sessions vpatch rules updated frequent basis new security updates issued dbms vendor new vulnerabilities discovered sentrigo research team partners common practice developing applications web applications particular use fat database accounts common schema pooled connections enhance application performance using approach raises problem full end-to-end user tracking database layer database unable see end-user details like username ip address seeing application server ip common schema account hedgehog identifier solves problem providing application server plug-in captures end-user information transparently propagates database tier using standard database apis application changes required identifier supports custom java .net applications well major business applications technical details available blog entry fuzzor fuzzer oracle open source software tool developed sentrigo fuzzor provides database administrators programmers ability test pl/sql code security vulnerabilities tool discovers vulnerabilities attempting exploit code particularly helpful finding sql injection buffer overflow vulnerabilities sentrigo provides tool free charge | [
704,
1314,
4194,
10340,
8742,
3573,
11030,
5245
] | None |
10,547 | 9 | MDL_(programming_language):mdl programming language mdl datatypes lisp mit design language programming language descendant language lisp initial purpose provide high level language support dynamic modeling group massachusetts institute technology mit project mac initially developed 1971 pdp-10 computer time-sharing operating system named incompatible timesharing system later ran tenex tops-20 bsd aegis initial development team consisted gerald sussman carl hewitt artificial intelligence lab chris reeve bruce daniels david cressey dynamic modeling group later stu galley also dynamic modeling group wrote mdl documentation mdl initially called muddle style self-deprecating humor widely understood appreciated outside project mac early citadels information technology name sanitized mdl mdl provides several enhancements classic lisp supports several built-in data types including lists strings arrays user-defined data types offers multithreaded expression evaluation coroutines variables carry local value within scope global value passing data scopes advanced built-in functions supported interactive debugging mdl programs incremental development reconstruction source programs object programs although mdl obsolete features incorporated later versions lisp gerald sussman went develop scheme language collaboration guy steele later wrote specifications common lisp java carl hewitt already published idea language planner mdl project began subsequent thinking planner reflected lessons learned building mdl planner concepts influenced languages prolog smalltalk smalltalk simula turn influenced hewitt future work actor model largest influence mdl software genre interactive fiction game named zork sometimes called dungeon first written mdl later reeve daniels galley members dynamic modeling went start infocom company produced many early commercial works interactive fiction original source code mainframe environment snippet shown downloaded originally russian mirror syntaxhighlight /syntaxhighlight | [
10752,
11269,
2056,
2062,
9231,
7184,
2577,
9749,
8728,
4633,
4122,
8226,
5677,
3119,
2105,
3132,
6717,
577,
8258,
8771,
8262,
2120,
1613,
9299,
10841,
3675,
7267,
2660,
8293,
2666,
5751,
1147,
7805,
11390,
9345,
1159,
9865,
655,
9877,
47... | None |
10,548 | 3 | StrongARM:strongarm strongarm family computer microprocessors developed digital equipment corporation manufactured late 1990s implemented arm v4 instruction set architecture later sold intel 1997 continued manufacture replacing xscale early 2000s strongarm collaborative project dec advanced risc machines create faster arm microprocessor strongarm designed address upper-end low-power embedded market users needed performance arm could deliver able accept external support targets devices newer personal digital assistants set-top boxes traditionally semiconductor division dec located massachusetts order gain access design talent silicon valley dec opened design center palo alto california design center led dan dobberpuhl main design site strongarm project another design site worked project austin texas created ex-dec designers returning apple computer motorola project set 1995 quickly delivered first design sa-110 dec agreed sell strongarm intel part lawsuit settlement 1997 intel used strongarm replace ailing line risc processors i860 i960 semiconductor division dec sold intel many engineers palo alto design group moved sibyte start-up company designing mips system-on-a-chip soc products networking market austin design group spun become alchemy semiconductor another start-up company designing mips socs hand-held market new strongarm core developed intel introduced 2000 xscale sa-110 first microprocessor strongarm family first versions operating 100 160 200 mhz announced 5 february 1996 announced samples versions available volume production slated mid-1996 faster 166 233 mhz versions announced 12 september 1996 samples versions available announcement volume production slated december 1996 throughout 1996 sa-110 highest performing microprocessor portable devices towards end 1996 leading cpu internet/intranet appliances thin client systems sa-110 first design win apple messagepad 2000 also used number products including acorn computers risc pc eidos optima video editing system sa-110 lead designers daniel w. dobberpuhl gregory w. hoeppner liam madden richard t. witek sa-110 simple microarchitecture scalar design executed instructions in-order five-stage classic risc pipeline microprocessor partitioned several blocks ibox ebox immu dmmu biu wb pll ibox contained hardware operated first two stages pipeline program counter fetched decoded issued instructions instruction fetch occurs first stage decode issue second ibox decodes complex instructions arm instruction set translating sequences simpler instructions ibox also handled branch instructions sa-110 branch prediction hardware mechanisms speedy processing execution starts stage three hardware operates stage contained ebox comprises register file arithmetic logic unit alu barrel shifter multiplier condition code logic register file three read ports two write ports alu barrel shifter executed instructions single cycle multiplier pipelined latency multiple cycles immu dmmu memory management units instructions data respectively mmu contained 32-entry fully associative translation lookaside buffer tlb map 4 kb 64 kb 1 mb pages write buffer wb eight 16-byte entries enables pipelining stores bus interface unit biu provided sa-110 external interface pll generates internal clock signal external 3.68 mhz clock signal designed dec contracted centre suisse d'electronique et de microtechnique csem located neuchâtel switzerland instruction cache data cache capacity 16 kb 32-way set-associative virtually addressed sa-110 designed used slow therefore low-cost memory therefore high set associativity allows higher hit rate competing designs use virtual addresses allows memory simultaneously cached uncached caches responsible transistor count take half die area sa-110 contained 2.5 million transistors 7.8 mm 6.4 mm large 49.92 mm fabricated dec proprietary cmos-6 process fab 6 fab hudson massachusetts cmos-6 dec sixth-generation complementary metal–oxide–semiconductor cmos process cmos-6 0.35 µm feature size 0.25 µm effective channel length use sa-110 three levels aluminium interconnect used power supply variable voltage 1.2 2.2 volts v enable designs find balance power consumption performance higher voltages enable higher clock rates sa-110 packaged 144-pin thin quad flat pack tqfp sa-1100 derivative sa-110 developed dec announced 1997 sa-1100 targeted portable applications pdas differs sa-110 providing number features desirable applications accommodate features data cache reduced size 8 kb extra features integrated memory pcmcia color lcd controllers connected on-die system bus five serial i/o channels connected peripheral bus attached system bus memory controller supported fpm edo dram sram flash rom pcmcia controller supports two slots memory address data bus shared pcmcia interface glue logic required serial i/o channels implement slave usb interface sdlc two uarts irda interface mcp synchronous serial port sa-1100 companion chip sa-1101 introduced intel 7 october 1998 sa-1101 provided additional peripherals complement integrated sa-1100 video output port two ps/2 ports usb controller pcmcia controller replaces sa-1100 design device started dec partially complete acquired intel finish design fabricated dec former hudson massachusetts fabrication plant also sold intel sa-1100 contained 2.5 million transistors measured 8.24 mm 9.12 mm 75.15 mm fabricated 0.35 μm cmos process three levels aluminium interconnect packaged 208-pin tqfp one early recipients processor was-ill-fated psion netbook consumer oriented sibling psion series 7 sa-1110 derivative sa-110 developed intel announced 31 march 1999 positioned alternative sa-1100 announcement samples set june 1999 volume later year intel discontinued sa-1110 early 2003 sa-1110 available 133 206 mhz versions differed sa-1100 featuring support 66 mhz 133 mhz version 103 mhz 206 mhz version sdram companion chip provided additional support peripherals sa-1111 sa-1110 packaged 256-pin micro ball grid array used mobile phones personal data assistants pdas compaq later hp ipaq hp jornada sharp sl-5x00 linux based platforms simputer also used run intel web tablet tablet device considered potentially first introduce large screen portable web browsing intel dropped product prior launch 2001 sa-1500 derivative sa-110 developed dec initially targeted set-top boxes designed manufactured low volumes dec never put production intel sa-1500 available 200 300 mhz sa-1500 featured enhanced sa-110 core on-chip coprocessor called attached media processor amp on-chip sdram i/o bus controller sdram controller supported 100 mhz sdram i/o controller implemented 32-bit i/o bus may run frequencies 50 mhz connecting peripherals sa-1501 companion chip amp implemented long instruction word instruction set containing instructions designed multimedia integer floating-point multiply–accumulate simd arithmetic long instruction word 64 bits wide specifies arithmetic operation branch load/store instructions operate operands 64-entry 36-bit register file set control registers amp communicates sa-110 core via on-chip bus shares data cache sa-110 amp contained alu shifter branch unit load/store unit multiply–accumulate unit single-precision floating-point unit amp supported user-defined instructions via 512-entry writable control store sa-1501 companion chip provided additional video audio processing capabilities various i/o functions ps/2 ports parallel port interfaces various peripherals sa-1500 contains 3.3 million transistors measures 60 mm fabricated 0.28 µm cmos process used 1.5 2.0 v internal power supply 3.3 v i/o consuming less 0.5 w 100 mhz 2.5 w 300 mhz packaged 240-pin metal quad flat package 256-ball plastic ball grid array | [
7170,
9739,
4108,
9741,
5649,
38,
4139,
8253,
7234,
3142,
4679,
2635,
2638,
10325,
1119,
3175,
4204,
8820,
630,
4217,
8325,
8327,
659,
6804,
8851,
666,
4773,
7852,
9391,
4276,
9913,
2237,
5309,
8383,
10945,
6339,
4821,
7382,
2788,
7911,
... | Validation |
10,549 | 1 | Art_Loss_Register:art loss register art loss register alr world largest database stolen art computerized international database captures information lost stolen art antiques collectables alr london-based independent profit corporate offspring new york-based nonprofit international foundation art research ifar range functions served alr grown number listed items increased database used collectors art trade insurers law enforcement agencies worldwide 1991 ifar helped create art loss register alr commercial enterprise expand market database ifar managed alr u.s. operations 1997 1998 alr assumed full responsibility ifar database although ifar retains ownership 1992 database comprised 20,000 items grew size nearly tenfold first decade first steps towards alr began establishment ifar new york 1969 among explicit goals ifar created compile information stolen art response growth international art thefts ifar began publishing stolen art alert 1976 1990 ifar updating catalogue stolen art 10 times year magnitude problem overwhelmed grown 20,000 manual records ifar successful recording details losses good first step 1991 alr established london commercial company earning fees insurers theft victims founding shareholders included insurance auction houses think conflict interest christie cite note-72 majority shares owned founder julian radcliffe significant capital investment needed ifar could computerised database made available worldwide law enforcement agencies others response growth development ifar museum officials revised policies based assumption discussing theft would scare away potential donors afr initially formed partnership alr later split disagreements strategy issues control change policies secrecy ones emphasize openness gradual mirroring expectation publicizing theft likely promote recovery alr widely criticised methods actions chairman julian radcliffe register consistently lost money personal cash infusions chairman approach adopted alr criticised register contacted owners stolen art saying information revealing fee paid another instance alr lied sotheby ’ saying paintings stolen paintings shipped london seized alr likened approach police misleading suspect investigation | [
4545
] | None |
10,550 | 4 | Datto_(company):datto company datto inc. american cybersecurity data backup company founded 2007 norwalk connecticut 2017 became subsidiary vista equity partners merged autotask corporation founded 2007 connecticut software programmer austin mcchord mcchord initially built marketed hand-made data backup devices securing first customers 2008 afterwards built system allowed data synchronization two computers building version zenith infotech ran linux end 2009 company 70,000 monthly sales new datto product 2010 caused old systems crash replacement system designed scratch siris released several months later free upgrade 2011 datto credited helping local hospitals impacted tornado joplin missouri retrieve data 2011 sales 9 million following year 25 million established business model sold products primarily managed service providers 2013 company continuing focus small mid-size businesses clients susan g. komen cure several nfl teams september 2013 company raised 25 million first round venture capital financing led general catalyst partners time datto 225 employees posted four consecutive years 300 percent annual growth 2014 datto inc. purchased backupify cloud-to-cloud backup company backupify focused backing data servers complementing datto focus local private clouds november 2015 company garnered 75 million series b funding round mostly led technology crossover ventures 2015 became connecticut first unicorn company early 2017 datto acquired open mesh datto acquired vista equity partners around 1.5 billion late 2017 part deal datto merged vista portfolio company autotask corporation austin mcchord remained ceo combined company mcchord stepped ceo october 2018 remaining board recent years company increased employee number significantly datto 550 employees november 2015 700 employees january 2017 883 workers october 2017 434 norwalk 1,300 employees november 2017 march 2018 number grown 1,400 month datto ranked first among midsize companies democrat chronicle ’ top workplaces list datto builds hardware software data backup recovery purposes 2016 company released siris 3 data protection platform claiming first system market ransomware detection capability | [
1970,
9098,
8301,
823
] | Test |
10,551 | 1 | Codd's_12_rules:codd 12 rules codd twelve rules set thirteen rules numbered zero twelve proposed edgar f. codd pioneer relational model databases designed define required database management system order considered relational i.e. relational database management system rdbms sometimes jokingly referred codd twelve commandments codd produced rules part personal campaign prevent vision original relational database diluted database vendors scrambled early 1980s repackage existing products relational veneer rule 12 particularly designed counter positioning rule 0 foundation rule rule 1 information rule rule 2 guaranteed access rule rule 3 systematic treatment null values rule 4 dynamic online catalog based relational model rule 5 comprehensive data sublanguage rule rule 6 view updating rule rule 7 possible high-level insert update delete rule 8 physical data independence rule 9 logical data independence rule 10 integrity independence rule 11 distribution independence rule 12 nonsubversion rule | [
10413,
2901,
9286,
9397
] | Validation |
10,552 | 3 | Genghis_Khan_(video_game):genghis khan video game genghis khan original full title 1987 turn-based strategy game developed koei originally released nec pc-9801 msx sharp x68000 1988 dos nes 1990 amiga 1990 actually second game series 1985 aoki ōkami shiroki mejika also pc-88 pc-98 msx game takes player inside virtual life either genghis khan one archrivals player must arrange marriages father children appoint family members governmental positions fight order conquer old world armies must drafted soldiers must trained player rule lands england japan game two different ways play first mongol conquest begins year 1175 a.d one player mode players assume control lord temujin must conquer land keeping economy stable army ready fight attacking lands second world conquest goal conquer every opposing country world conquest begins year 1206 a.d started choosing number players difficulty supports 1-4 players players must choose want genghis khan mongols alexios byzantine richard england yoritomo japan player must randomly select stats leader successors player must stop random number choose certain stat done stats chosen certain character redone everyone ready go game begins countries eurasia cycle goes country means used turn comes player country get make three choices choices include training troops buying certain product/quantity merchant drafting soldiers sending treaty going war act takes one choice away three choices used cycle continues every country used turns season changes cycle goes different order seasons determine must pay troops farmers harvest crop food must distributed etc 1989 computer gaming world called genghis khan toughest satisfying richest historical simulation yet 1990 survey pre-20th century wargames magazine gave four five stars 1993 three stars orson scott card viewed unfavorably writing compute compared romance tedium back regarding gameplay another reviewer magazine stated genghis khan excellent prerequisite real leadership experience forces gauge resources making decisions 2008 armağan yavuz co-founder turkish developer taleworlds cited koei genghis khan influence mount blade series | [
9006,
9166,
1566
] | Test |
10,553 | 7 | Oracle_Fusion_Middleware:oracle fusion middleware oracle fusion middleware fmw also known fusion middleware consists several software products oracle corporation fmw spans multiple services including java ee developer tools integration services business intelligence collaboration content management fmw depends open standards bpel soap xml jms oracle fusion middleware provides software development deployment management service-oriented architecture soa includes oracle calls hot-pluggable architecture designed facilitate integration existing applications systems software vendors ibm microsoft sap ag many products included fmw banner qualify middleware products fusion middleware essentially represents re-branding many oracle products outside oracle core database applications-software offerings—compare oracle fusion oracle acquired many fmw products via acquisitions includes products bea systems stellent order provide standards-based software assist business process automation hp incorporated fmw service-oriented architecture soa portfolio oracle leveraged configurable network computing cnc technology acquired peoplesoft/jd edwards 2005 purchase oracle fusion applications based oracle fusion middleware finally released september 2010 according oracle 2013 120,000 customers using fusion middleware includes 35 world 50 largest companies 750 businessweek global 1000 fmw also supported 7,500 partners january 2008 oracle webcenter content formerly universal content management infoworld technology year award best enterprise content manager oracle soa suite winning award best enterprise service bus 2007 gartner wrote oracle fusion middleware reached degree completeness puts par cases ahead competing software stacks reported revenue suite us 1 billion fy06 estimating revenue genuinely middleware aspects us 740 million | [
1539,
5384,
4233,
4107,
9867,
9467,
6419,
8353,
8994,
10020,
8871,
1707,
5677,
9010,
9012,
1594,
8122,
3521,
6338,
9665,
2501,
6341,
1612,
597,
2901,
1367,
5210,
1755,
6107,
2269,
479,
1250,
10340,
3558,
4199,
7022,
8434,
10486,
1399,
332... | Train |
10,554 | 3 | Acrojet:acrojet acrojet 1985 flight simulator video game microprose originally developed commodore 64 c64 ported amstrad cpc msx zx spectrum nec pc-8801 nec pc-9801 emphasized aerial acrobatic flying maneuverability player flies bd5j small agile jet player complete series eight stunt courses routines jet example one set player fly plane around series pylons another player must fly figure eight stunts get harder play progresses game parameters weather configurable ten acrobatic events played four players four levels difficulty ten events player must fly series obstacles compute called acrojet realistic simulation also fun play stating game like microprose products emphasized accurate details controls original c64 version programmed william mike denman edward hill jr sound music done sid meier also researched science along denman stunts bill stealey actually retired united states air force lt colonel command pilot michael haire credited artwork | [
9006
] | Validation |
10,555 | 9 | Parameter_(computer_programming):parameter computer programming computer programming parameter formal argument special kind variable used subroutine refer one pieces data provided input subroutine pieces data values arguments often called actual arguments actual parameters subroutine going called/invoked ordered list parameters usually included definition subroutine time subroutine called arguments call evaluated resulting values assigned corresponding parameters unlike argument usual mathematical usage argument computer science thus actual input expression passed/supplied function procedure routine invocation/call statement whereas parameter variable inside implementation subroutine example one defines codice_1 subroutine codice_2 codice_3 parameters called codice_4 codice_5 arguments note variables expressions thereof calling context arguments subroutine called codice_6 variables codice_7 arguments values codice_5 see parameters arguments section information common case call value parameter acts within subroutine new local variable initialized value argument local isolated copy argument argument variable cases e.g call reference argument variable supplied caller affected actions within called subroutine discussed evaluation strategy semantics parameters declared value arguments passed parameters subroutines defined language details represented particular computer system depend calling conventions system following program c programming language defines function named salestax one parameter named price type price double i.e double-precision floating point number function return type also double function defined invoked follows example function invoked argument 10.00 happens 10.00 assigned price function begins calculating result steps producing result specified enclosed codice_9 indicates first thing multiply 0.05 value price gives 0.50. codice_10 means function produce result codice_9 therefore final result ignoring possible round-off errors one encounters representing decimal fractions binary fractions 0.50 terms parameter argument may different meanings different programming languages sometimes used interchangeably context used distinguish meaning term parameter sometimes called formal parameter often used refer variable found function definition argument sometimes called actual parameter refers actual input supplied function call example one defines function codice_12 codice_13 parameter called codice_14 codice_15 argument parameter unbound variable argument value variable complex expression involving values variables case call value passed function value argument – example codice_16 codice_17 equivalent calls – call reference variable argument passed reference variable even though syntax function call could stay specification pass-by-reference pass-by-value would made function declaration and/or definition parameters appear procedure definitions arguments appear procedure calls function definition codice_18 variable x parameter function call codice_16 value 2 argument function loosely parameter type argument instance parameter intrinsic property procedure included definition example many languages procedure add two supplied integers together calculate sum would need two parameters one integer general procedure may defined number parameters parameters procedure parameters part definition specifies parameters called parameter list contrast arguments expressions supplied procedure called usually one expression matching one parameters unlike parameters form unchanging part procedure definition arguments may vary call call time procedure called part procedure call specifies arguments called argument list although parameters also commonly referred arguments arguments sometimes thought actual values references assigned parameter variables subroutine called run-time discussing code calling subroutine values references passed subroutine arguments place code values references given parameter list discussing code inside subroutine definition variables subroutine parameter list parameters values parameters runtime arguments example c dealing threads common pass argument type void* cast expected type better understand difference consider following function written c function sum two parameters named addend1 addend2 adds values passed parameters returns result subroutine caller using technique automatically supplied c compiler code calls sum function might look like variables value1 value2 initialized values value1 value2 arguments sum function context runtime values assigned variables passed function sum arguments sum function parameters addend1 addend2 evaluated yielding arguments 40 2 respectively values arguments added result returned caller assigned variable sum_value difference parameters arguments possible supply inappropriate arguments procedure call may supply many arguments one arguments may wrong type arguments may supplied wrong order situations causes mismatch parameter argument lists procedure often return unintended answer generate runtime error within eiffel software development method language terms argument parameter distinct uses established convention term argument used exclusively reference routine inputs term parameter used exclusively type parameterization generic classes consider following routine definition routine codice_20 takes two arguments codice_21 codice_22 called routine formal arguments call codice_20 specifies actual arguments shown codice_24 codice_25 parameters also thought either formal actual formal generic parameters used definition generic classes example class codice_26 declared generic class two formal generic parameters codice_27 representing data interest codice_28 representing hash key data class hash_table g k hashable class becomes client codice_26 formal generic parameters substituted actual generic parameters generic derivation following attribute declaration codice_30 used character string based dictionary data key formal generic parameters substituted actual generic parameters type codice_31 strongly typed programming languages parameter type must specified procedure declaration languages using type inference attempt discover types automatically function body usage dynamically typed programming languages defer type resolution run-time weakly typed languages perform little type resolution relying instead programmer correctness languages use special keyword e.g void indicate subroutine parameters formal type theory functions take empty parameter list whose type void rather unit exact mechanism assigning arguments parameters called argument passing depends upon evaluation strategy used parameter typically call value may specified using keywords programming languages ada c++ clojure common lisp fortran 90 python ruby tcl windows powershell allow default argument explicitly implicitly given subroutine declaration allows caller omit argument calling subroutine default argument explicitly given value used provided caller default argument implicit sometimes using keyword optional language provides well-known value null empty zero empty string etc value provided caller powershell example default arguments seen special case variable-length argument list languages allow subroutines defined accept variable number arguments languages subroutines must iterate list arguments powershell example programming languages—such ada windows powershell—allow subroutines named parameters allows calling code self-documenting also provides flexibility caller often allowing order arguments changed arguments omitted needed powershell example lambda calculus function exactly one parameter thought functions multiple parameters usually represented lambda calculus function takes first argument returns function takes rest arguments transformation known currying programming languages like ml haskell follow scheme languages every function exactly one parameter may look like definition function multiple parameters actually syntactic sugar definition function returns function etc function application left-associative languages well lambda calculus looks like application function multiple arguments correctly evaluated function applied first argument resulting function applied second argument etc output parameter also known parameter return parameter parameter used output rather usual use input using call reference parameters call value parameters value reference output parameters idiom languages notably c c++ languages built-in support output parameters languages built-in support output parameters include ada see fortran since fortran 90 see various procedural extensions sql pl/sql see pl/sql functions transact-sql c .net framework swift scripting language tscript see tscript function declarations precisely one may distinguish three types parameters parameter modes output parameters often denoted codice_32 codice_33 codice_34 codice_35 input argument argument input parameter must value initialized variable literal must redefined assigned output argument must assignable variable need initialized existing value accessible must assigned value input/output argument must initialized assignable variable optionally assigned value exact requirements enforcement vary languages – example ada 83 output parameters assigned read even assignment removed ada 95 remove need auxiliary accumulator variable analogous notion value expression r-value value l-value assigned r-value/l-value value assigned respectively though terms specialized meanings c. cases input input/output distinguished output considered specific use input/output cases input output input/output supported default mode varies languages fortran 90 input/output default c sql extensions input default tscript parameter explicitly specified input output syntactically parameter mode generally indicated keyword function declaration codice_36 c conventionally output parameters often put end parameter list clearly distinguish though always followed tscript uses different approach function declaration input parameters listed output parameters separated colon return type function function computes size text fragment parameter modes form denotational semantics stating programmer intent allowing compilers catch errors apply optimizations – necessarily imply operational semantics parameter passing actually occurs notably input parameters implemented call value output input/output parameters call reference – straightforward way implement modes languages without built-in support – always implemented distinction discussed detail ada '83 rationale emphasizes parameter mode abstracted parameter passing mechanism reference copy actually implemented instance c input parameters default keyword passed value output input/output parameters codice_33 codice_38 passed reference pl/sql input parameters codice_39 passed reference output input/output parameters codice_40 codice_41 default passed value result copied back passed reference using codice_42 compiler hint syntactically similar construction output parameters assign return value variable name function found pascal fortran 66 fortran 77 pascal example semantically different called function simply evaluated – passed variable calling scope store output primary use output parameters return multiple values function use input/output parameters modify state using parameter passing rather shared environment global variables important use returning multiple values solve semipredicate problem returning value error status – see semipredicate problem multivalued return example return two variables function c one may write codice_13 input parameter codice_44 codice_45 output parameters common use case c related languages exception handling function places return value output variable returns boolean corresponding whether function succeeded archetypal example codice_46 method .net especially c parses string integer returning codice_47 success codice_48 failure following signature may used follows similar considerations apply returning value one several possible types return value specify type value stored one several output variables output parameters often discouraged modern programming essentially awkward confusing low-level – commonplace return values considerably easier understand work notably output parameters involve functions side effects modifying output parameter semantically similar references confusing pure functions values distinction output parameters input/output parameters subtle since common programming styles parameters simply input parameters output parameters input/output parameters unusual hence susceptible misunderstanding output input/output parameters prevent function composition since output stored variables rather value expression thus one must initially declare variable step chain functions must separate statement example c++ following function composition written output input/output parameters instead becomes codice_49 output parameter codice_27 input/output parameter special case function single output input/output parameter return value function composition possible output input/output parameter c/c++ address also returned function case becomes various alternatives use cases output parameters returning multiple values function alternative return tuple syntactically clearer automatic sequence unpacking parallel assignment used go python returning value one several types tagged union used instead common cases nullable types option types return value null indicate failure exception handling one return nullable type raise exception example python one might either idiomatically micro-optimization requiring local variable copying return using output variables also applied conventional functions return values sufficiently sophisticated compilers usual alternative output parameters c related languages return single data structure containing return values example given structure encapsulating width height one write object-oriented languages instead using input/output parameters one often use call sharing passing reference object mutating object though changing object variable refers | [
3462,
2062,
655,
6160,
9875,
7193,
1435,
9245,
3876,
5031,
428,
10413,
692,
3767,
8504,
5945,
2106,
10043,
6717,
5059,
10435,
8262,
74,
8524,
335,
7292,
7889,
467,
7894,
7386,
4320,
8293,
9701,
8554,
7147,
240,
6640,
3573,
119,
3960,
38... | Test |
10,556 | 4 | Personal_Internet_Security_2011:personal internet security 2011 personal internet security 2011 scareware rogue anti-virus fake computer protection program induces users think number viruses personal internet security fact virus program encourages users pay certain amount subscription clean computers protect computers users also notice different number viruses listed every time virus pops | [
4165,
9287,
7515,
1013,
3320,
7739
] | Test |
10,557 | 0 | Speech_recognition:speech recognition speech recognition interdisciplinary subfield computational linguistics develops methodologies technologies enables recognition translation spoken language text computers also known automatic speech recognition asr computer speech recognition speech text stt incorporates knowledge research linguistics computer science electrical engineering fields speech recognition systems require training also called enrollment individual speaker reads text isolated vocabulary system system analyzes person specific voice uses fine-tune recognition person speech resulting increased accuracy systems use training called speaker independent systems systems use training called speaker dependent speech recognition applications include voice user interfaces voice dialing e.g call home call routing e.g would like make collect call domotic appliance control search e.g find podcast particular words spoken simple data entry e.g. entering credit card number preparation structured documents e.g radiology report determining speaker characteristics speech-to-text processing e.g. word processors emails aircraft usually termed direct voice input term voice recognition speaker identification refers identifying speaker rather saying recognizing speaker simplify task translating speech systems trained specific person voice used authenticate verify identity speaker part security process technology perspective speech recognition long history several waves major innovations recently field benefited advances deep learning big data advances evidenced surge academic papers published field importantly worldwide industry adoption variety deep learning methods designing deploying speech recognition systems key areas growth vocabulary size speaker independence processing speed raj reddy first person take continuous speech recognition graduate student stanford university late 1960s previous systems required users pause word reddy system issued spoken commands playing game chess around time soviet researchers invented dynamic time warping dtw algorithm used create recognizer capable operating 200-word vocabulary dtw processed speech dividing short frames e.g 10ms segments processing frame single unit although dtw would superseded later algorithms technique carried achieving speaker independence remained unsolved time period late 1960s leonard baum developed mathematics markov chains institute defense analysis decade later cmu raj reddy students james baker janet m. baker began using hidden markov model hmm speech recognition james baker learned hmms summer job institute defense analysis undergraduate education use hmms allowed researchers combine different sources knowledge acoustics language syntax unified probabilistic model 1980s also saw introduction n-gram language model much progress field owed rapidly increasing capabilities computers end darpa program 1976 best computer available researchers pdp-10 4 mb ram could take 100 minutes decode 30 seconds speech two practical products point vocabulary typical commercial speech recognition system larger average human vocabulary raj reddy former student xuedong huang developed sphinx-ii system cmu sphinx-ii system first speaker-independent large vocabulary continuous speech recognition best performance darpa 1992 evaluation handling continuous speech large vocabulary major milestone history speech recognition huang went found speech recognition group microsoft 1993 raj reddy student kai-fu lee joined apple 1992 helped develop speech interface prototype apple computer known casper lernout hauspie belgium-based speech recognition company acquired several companies including kurzweil applied intelligence 1997 dragon systems 2000 l h speech technology used windows xp operating system l h industry leader accounting scandal brought end company 2001 speech technology l h bought scansoft became nuance 2005 apple originally licensed software nuance provide speech recognition capability digital assistant siri 2000s darpa sponsored two speech recognition programs effective affordable reusable speech-to-text ears 2002 global autonomous language exploitation gale four teams participated ears program ibm team led bbn limsi univ pittsburgh cambridge university team composed icsi sri university washington ears funded collection switchboard telephone speech corpus containing 260 hours recorded conversations 500 speakers gale program focused arabic mandarin broadcast news speech google first effort speech recognition came 2007 hiring researchers nuance first product goog-411 telephone based directory service recordings goog-411 produced valuable data helped google improve recognition systems google voice search supported 30 languages united states national security agency made use type speech recognition keyword spotting since least 2006 technology allows analysts search large volumes recorded conversations isolate mentions keywords recordings indexed analysts run queries database find conversations interest government research programs focused intelligence applications speech recognition e.g darpa ears program iarpa babel program early 2000s speech recognition still dominated traditional approaches hidden markov models combined feedforward artificial neural networks today however many aspects speech recognition taken deep learning method called long short-term memory lstm recurrent neural network published sepp hochreiter jürgen schmidhuber 1997 lstm rnns avoid vanishing gradient problem learn deep learning tasks require memories events happened thousands discrete time steps ago important speech around 2007 lstm trained connectionist temporal classification ctc started outperform traditional speech recognition certain applications 2015 google speech recognition reportedly experienced dramatic performance jump 49 ctc-trained lstm available google voice smartphone users use deep feedforward non-recurrent networks acoustic modeling introduced later part 2009 geoffrey hinton students university toronto li deng colleagues microsoft research initially collaborative work microsoft university toronto subsequently expanded include ibm google hence shared views four research groups subtitle 2012 review paper microsoft research executive called innovation dramatic change accuracy since 1979 contrast steady incremental improvements past decades application deep learning decreased word error rate 30 innovation quickly adopted across field researchers begun use deep learning techniques language modeling well long history speech recognition shallow form deep form e.g recurrent nets artificial neural networks explored many years 1980s 1990s years 2000s methods never non-uniform internal-handcrafting gaussian mixture model/hidden markov model gmm-hmm technology based generative models speech trained discriminatively number key difficulties methodologically analyzed 1990s including gradient diminishing weak temporal correlation structure neural predictive models difficulties addition lack big training data big computing power early days speech recognition researchers understood barriers hence subsequently moved away neural nets pursue generative modeling approaches recent resurgence deep learning starting around 2009–2010 overcome difficulties hinton et al deng et al reviewed part recent history collaboration colleagues across four groups university toronto microsoft google ibm ignited renaissance applications deep feedforward neural networks speech recognition early 2010s speech recognition also called voice recognition clearly differentiated speaker recognition speaker independence considered major breakthrough systems required training period 1987 ad doll carried tagline finally doll understands – despite fact described children could train respond voice 2017 microsoft researchers reached historical human parity milestone transcribing conversational telephony speech widely benchmarked switchboard task multiple deep learning models used optimize speech recognition accuracy speech recognition word error rate reported low 4 professional human transcribers working together benchmark funded ibm watson speech team task acoustic modeling language modeling important parts modern statistically-based speech recognition algorithms hidden markov models hmms widely used many systems language modeling also used many natural language processing applications document classification statistical machine translation modern general-purpose speech recognition systems based hidden markov models statistical models output sequence symbols quantities hmms used speech recognition speech signal viewed piecewise stationary signal short-time stationary signal short time-scale e.g. 10 milliseconds speech approximated stationary process speech thought markov model many stochastic purposes another reason hmms popular trained automatically simple computationally feasible use speech recognition hidden markov model would output sequence n -dimensional real-valued vectors n small integer 10 outputting one every 10 milliseconds vectors would consist cepstral coefficients obtained taking fourier transform short time window speech decorrelating spectrum using cosine transform taking first significant coefficients hidden markov model tend state statistical distribution mixture diagonal covariance gaussians give likelihood observed vector word general speech recognition systems phoneme different output distribution hidden markov model sequence words phonemes made concatenating individual trained hidden markov models separate words phonemes described core elements common hmm-based approach speech recognition modern speech recognition systems use various combinations number standard techniques order improve results basic approach described typical large-vocabulary system would need context dependency phonemes phonemes different left right context different realizations hmm states would use cepstral normalization normalize different speaker recording conditions speaker normalization might use vocal tract length normalization vtln male-female normalization maximum likelihood linear regression mllr general speaker adaptation features would so-called delta delta-delta coefficients capture speech dynamics addition might use heteroscedastic linear discriminant analysis hlda might skip delta delta-delta coefficients use splicing lda-based projection followed perhaps heteroscedastic linear discriminant analysis global semi-tied co variance transform also known maximum likelihood linear transform mllt many systems use so-called discriminative training techniques dispense purely statistical approach hmm parameter estimation instead optimize classification-related measure training data examples maximum mutual information mmi minimum classification error mce minimum phone error mpe decoding speech term happens system presented new utterance must compute likely source sentence would probably use viterbi algorithm find best path choice dynamically creating combination hidden markov model includes acoustic language model information combining statically beforehand finite state transducer fst approach possible improvement decoding keep set good candidates instead keeping best candidate use better scoring function scoring rate good candidates may pick best one according refined score set candidates kept either list n-best list approach subset models lattice scoring usually done trying minimize bayes risk approximation thereof instead taking source sentence maximal probability try take sentence minimizes expectancy given loss function regards possible transcriptions i.e. take sentence minimizes average distance possible sentences weighted estimated probability loss function usually levenshtein distance though different distances specific tasks set possible transcriptions course pruned maintain tractability efficient algorithms devised score lattices represented weighted finite state transducers edit distances represented finite state transducer verifying certain assumptions dynamic time warping approach historically used speech recognition largely displaced successful hmm-based approach dynamic time warping algorithm measuring similarity two sequences may vary time speed instance similarities walking patterns would detected even one video person walking slowly another walking quickly even accelerations deceleration course one observation dtw applied video audio graphics – indeed data turned linear representation analyzed dtw well-known application automatic speech recognition cope different speaking speeds general method allows computer find optimal match two given sequences e.g. time series certain restrictions sequences warped non-linearly match sequence alignment method often used context hidden markov models neural networks emerged attractive acoustic modeling approach asr late 1980s since neural networks used many aspects speech recognition phoneme classification isolated word recognition audiovisual speech recognition audiovisual speaker recognition speaker adaptation neural networks make fewer explicit assumptions feature statistical properties hmms several qualities making attractive recognition models speech recognition used estimate probabilities speech feature segment neural networks allow discriminative training natural efficient manner however spite effectiveness classifying short-time units individual phonemes isolated words early neural networks rarely successful continuous recognition tasks limited ability model temporal dependencies one approach limitation use neural networks pre-processing feature transformation dimensionality reduction step prior hmm based recognition however recently lstm related recurrent neural networks rnns time delay neural networks tdnn demonstrated improved performance area deep neural networks denoising autoencoders also investigation deep feedforward neural network dnn artificial neural network multiple hidden layers units input output layers similar shallow neural networks dnns model complex non-linear relationships dnn architectures generate compositional models extra layers enable composition features lower layers giving huge learning capacity thus potential modeling complex patterns speech data success dnns large vocabulary speech recognition occurred 2010 industrial researchers collaboration academic researchers large output layers dnn based context dependent hmm states constructed decision trees adopted recent overview articles one fundamental principle deep learning away hand-crafted feature engineering use raw features principle first explored successfully architecture deep autoencoder raw spectrogram linear filter-bank features showing superiority mel-cepstral features contain stages fixed transformation spectrograms true raw features speech waveforms recently shown produce excellent larger-scale speech recognition results since 2014 much research interest end-to-end asr traditional phonetic-based i.e. hmm-based model approaches required separate components training pronunciation acoustic language model end-to-end models jointly learn components speech recognizer valuable since simplifies training process deployment process example n-gram language model required hmm-based systems typical n-gram language model often takes several gigabytes memory making impractical deploy mobile devices consequently modern commercial asr systems google apple 2017 deployed cloud require network connection opposed device locally first attempt end-to-end asr connectionist temporal classification ctc -based systems introduced alex graves google deepmind navdeep jaitly university toronto 2014 model consisted recurrent neural networks ctc layer jointly rnn-ctc model learns pronunciation acoustic model together however incapable learning language due conditional independence assumptions similar hmm consequently ctc models directly learn map speech acoustics english characters models make many common spelling mistakes must rely separate language model clean transcripts later baidu expanded work extremely large datasets demonstrated commercial success chinese mandarin english 2016 university oxford presented lipnet first end-to-end sentence-level lip reading model using spatiotemporal convolutions coupled rnn-ctc architecture surpassing human-level performance restricted grammar dataset large-scale cnn-rnn-ctc architecture presented 2018 google deepmind achieving 6 times better performance human experts alternative approach ctc-based models attention-based models attention-based asr models introduced simultaneously chan et al carnegie mellon university google brain bahdanau et al university montreal 2016 model named listen attend spell las literally listens acoustic signal pays attention different parts signal spells transcript one character time unlike ctc-based models attention-based models conditional-independence assumptions learn components speech recognizer including pronunciation acoustic language model directly means deployment need carry around language model making practical deployment onto applications limited memory end 2016 attention-based models seen considerable success including outperforming ctc models without external language model various extensions proposed since original las model latent sequence decompositions lsd proposed carnegie mellon university mit google brain directly emit sub-word units natural english characters university oxford google deepmind extended las watch listen attend spell wlas handle lip reading surpassing human-level performance typically manual control input example means finger control steering-wheel enables speech recognition system signalled driver audio prompt following audio prompt system listening window may accept speech input recognition simple voice commands may used initiate phone calls select radio stations play music compatible smartphone mp3 player music-loaded flash drive voice recognition capabilities vary car make model recent car models offer natural-language speech recognition place fixed set commands allowing driver use full sentences common phrases systems therefore need user memorize set fixed command words health care sector speech recognition implemented front-end back-end medical documentation process front-end speech recognition provider dictates speech-recognition engine recognized words displayed spoken dictator responsible editing signing document back-end deferred speech recognition provider dictates digital dictation system voice routed speech-recognition machine recognized draft document routed along original voice file editor draft edited report finalized deferred speech recognition widely used industry currently one major issues relating use speech recognition healthcare american recovery reinvestment act 2009 arra provides substantial financial benefits physicians utilize emr according meaningful use standards standards require substantial amount data maintained emr commonly referred electronic health record ehr use speech recognition naturally suited generation narrative text part radiology/pathology interpretation progress note discharge summary ergonomic gains using speech recognition enter structured discrete data e.g. numeric values codes list controlled vocabulary relatively minimal people sighted operate keyboard mouse significant issue ehrs expressly tailored take advantage voice-recognition capabilities large part clinician interaction ehr involves navigation user interface using menus tab/button clicks heavily dependent keyboard mouse voice-based navigation provides modest ergonomic benefits contrast many highly customized systems radiology pathology dictation implement voice macros use certain phrases – e.g. normal report automatically fill large number default values and/or generate boilerplate vary type exam – e.g. chest x-ray vs. gastrointestinal contrast series radiology system alternative navigation hand cascaded use speech recognition information extraction studied way fill handover form clinical proofing sign-off results encouraging paper also opens data together related performance benchmarks processing software research development community studying clinical documentation language-processing prolonged use speech recognition software conjunction word processors shown benefits short-term-memory restrengthening brain avm patients treated resection research needs conducted determine cognitive benefits individuals whose avms treated using radiologic techniques substantial efforts devoted last decade test evaluation speech recognition fighter aircraft particular note us program speech recognition advanced fighter technology integration afti /f-16 aircraft f-16 vista program france mirage aircraft programs uk dealing variety aircraft platforms programs speech recognizers operated successfully fighter aircraft applications including setting radio frequencies commanding autopilot system setting steer-point coordinates weapons release parameters controlling flight display working swedish pilots flying jas-39 gripen cockpit englund 2004 found recognition deteriorated increasing g-loads report also concluded adaptation greatly improved results cases introduction models breathing shown improve recognition scores significantly contrary might expected effects broken english speakers found evident spontaneous speech caused problems recognizer might expected restricted vocabulary proper syntax could thus expected improve recognition accuracy substantially eurofighter typhoon currently service uk raf employs speaker-dependent system requiring pilot create template system used safety-critical weapon-critical tasks weapon release lowering undercarriage used wide range cockpit functions voice commands confirmed visual and/or aural feedback system seen major design feature reduction pilot workload even allows pilot assign targets aircraft two simple voice commands wingmen five commands speaker-independent systems also developed test f35 lightning ii jsf alenia aermacchi m-346 master lead-in fighter trainer systems produced word accuracy scores excess 98 problems achieving high recognition accuracy stress noise pertain strongly helicopter environment well jet fighter environment acoustic noise problem actually severe helicopter environment high noise levels also helicopter pilot general wear facemask would reduce acoustic noise microphone substantial test evaluation programs carried past decade speech recognition systems applications helicopters notably u.s. army avionics research development activity avrada royal aerospace establishment rae uk work france included speech recognition puma helicopter also much useful work canada results encouraging voice applications included control communication radios setting navigation systems control automated target handover system fighter applications overriding issue voice helicopters impact pilot effectiveness encouraging results reported avrada tests although represent feasibility demonstration test environment much remains done speech recognition overall speech technology order consistently achieve performance improvements operational settings training air traffic controllers atc represents excellent application speech recognition systems many atc training systems currently require person act pseudo-pilot engaging voice dialog trainee controller simulates dialog controller would conduct pilots real atc situation speech recognition synthesis techniques offer potential eliminate need person act pseudo-pilot thus reducing training support personnel theory air controller tasks also characterized highly structured speech primary output controller hence reducing difficulty speech recognition task possible practice rarely case faa document 7110.65 details phrases used air traffic controllers document gives less 150 examples phrases number phrases supported one simulation vendors speech recognition systems excess 500,000 usaf usmc us army us navy faa well number international atc training organizations royal australian air force civil aviation authorities italy brazil canada currently using atc simulators speech recognition number different vendors asr commonplace field telephony becoming widespread field computer gaming simulation telephony systems asr predominantly used contact centers integrating ivr systems despite high level integration word processing general personal computing field document production asr seen expected increases use improvement mobile processor speeds made speech recognition practical smartphones speech used mostly part user interface creating predefined custom speech commands language learning speech recognition useful learning second language teach proper pronunciation addition helping person develop fluency speaking skills students blind see blindness education low vision benefit using technology convey words hear computer recite well use computer commanding voice instead look screen keyboard students physically disabled suffer repetitive strain injury/other injuries upper extremities relieved worry handwriting typing working scribe school assignments using speech-to-text programs also utilize speech recognition technology freely enjoy searching internet using computer home without physically operate mouse keyboard speech recognition allow students learning disabilities become better writers saying words aloud increase fluidity writing alleviated concerns regarding spelling punctuation mechanics writing also see learning disability use voice recognition software conjunction digital audio recorder personal computer running word-processing software proven positive restoring damaged short-term-memory capacity stroke craniotomy individuals people disabilities benefit speech recognition programs individuals deaf hard hearing speech recognition software used automatically generate closed-captioning conversations discussions conference rooms classroom lectures and/or religious services speech recognition also useful people difficulty using hands ranging mild repetitive stress injuries involve disabilities preclude using conventional computer input devices fact people used keyboard lot developed rsi became urgent early market speech recognition speech recognition used deaf telephony voicemail text relay services captioned telephone individuals learning disabilities problems thought-to-paper communication essentially think idea processed incorrectly causing end differently paper possibly benefit software technology bug proof also whole idea speak text hard intellectually disabled person due fact rare anyone tries learn technology teach person disability type technology help dyslexia disabilities still question effectiveness product problem hindering effective although kid may able say word depending clear say technology may think saying another word input wrong one giving work fix causing take time fixing wrong word performance speech recognition systems usually evaluated terms accuracy speed accuracy usually rated word error rate wer whereas speed measured real time factor measures accuracy include single word error rate swer command success rate csr speech recognition machine complex problem however vocalizations vary terms accent pronunciation articulation roughness nasality pitch volume speed speech distorted background noise echoes electrical characteristics accuracy speech recognition may vary following mentioned earlier article accuracy speech recognition may vary depending following factors discontinuous speech full sentences separated silence used therefore becomes easier recognize speech well isolated speech continuous speech naturally spoken sentences used therefore becomes harder recognize speech different isolated discontinuous speech constraints often represented grammar speech recognition multi-levelled pattern recognition task e.g known word pronunciations legal word sequences compensate errors uncertainties lower level telephone speech sampling rate 8000 samples per second computed every 10 ms one 10 ms section called frame analysis four-step neural network approaches explained information sound produced air medium vibration register ears machines receivers basic sound creates wave two descriptions amplitude strong frequency often vibrates per second speech recognition become means attack theft accidental operation example activation words like alexa spoken audio video broadcast cause devices homes offices start listening input inappropriately possibly take unwanted action voice-controlled devices also accessible visitors building even outside building heard inside attackers may able gain access personal information like calendar address book contents private messages documents may also able impersonate user send messages make online purchases two attacks demonstrated use artificial sounds one transmits ultrasound attempt send commands without nearby people noticing adds small inaudible distortions speech music specially crafted confuse specific speech recognition system recognizing music speech make sounds like one command human sound like different command system popular speech recognition conferences held year two include speechtek speechtek europe icassp interspeech/eurospeech ieee asru conferences field natural language processing acl naacl emnlp hlt beginning include papers speech processing important journals include ieee transactions speech audio processing later renamed ieee transactions audio speech language processing since sept 2014 renamed ieee/acm transactions audio speech language processing—after merging acm publication computer speech language speech communication books like fundamentals speech recognition lawrence rabiner useful acquire basic knowledge may fully date 1993 another good source statistical methods speech recognition frederick jelinek spoken language processing 2001 xuedong huang etc computer speech manfred r. schroeder second edition published 2004 speech processing dynamic optimization-oriented approach published 2003 li deng doug o'shaughnessey updated textbook speech language processing 2008 jurafsky martin presents basics state art asr speaker recognition also uses features front-end processing classification techniques done speech recognition comprehensive textbook fundamentals speaker recognition depth source date details theory practice good insight techniques used best modern systems gained paying attention government sponsored evaluations organised darpa largest speech recognition-related project ongoing 2007 gale project involves speech recognition translation components good accessible introduction speech recognition technology history provided general audience book voice machine building computers understand speech roberto pieraccini 2012 recent book speech recognition automatic speech recognition deep learning approach publisher springer written microsoft researchers d. yu l. deng published near end 2014 highly mathematically oriented technical detail deep learning methods derived implemented modern speech recognition systems based dnns related deep learning methods related book published earlier 2014 deep learning methods applications l. deng d. yu provides less technical methodology-focused overview dnn-based speech recognition 2009–2014 placed within general context deep learning applications including speech recognition also image recognition natural language processing information retrieval multimodal processing multitask learning terms freely available resources carnegie mellon university sphinx toolkit one place start learn speech recognition start experimenting another resource free copyrighted htk book accompanying htk toolkit recent state-of-the-art techniques kaldi toolkit used 2017 mozilla launched open source project called common voice gather big database voices would help build free speech recognition project deepspeech available free github using google open source platform tensorflow commercial cloud based speech recognition apis broadly available aws azure ibm gcp demonstration on-line speech recognizer available cobalt webpage software resources see list speech recognition software | [
5122,
519,
2059,
5648,
1044,
7700,
4632,
538,
10794,
4652,
7724,
4662,
3127,
1083,
6715,
3646,
6208,
9798,
5197,
6223,
3664,
10320,
6748,
1633,
7780,
4092,
3698,
6789,
4744,
651,
6798,
1169,
4768,
6825,
9898,
2221,
5807,
9406,
6336,
5315,... | Test |
10,558 | 5 | Link_Capacity_Adjustment_Scheme:link capacity adjustment scheme link capacity adjustment scheme lcas method dynamically increase decrease bandwidth virtual concatenated containers lcas protocol specified itu-t g.7042 allows on-demand increase decrease bandwidth virtual concatenated group hitless manner brings bandwidth-on-demand capability data clients like ethernet mapped tdm containers lcas also able temporarily remove failed members virtual concatenation group failed member automatically cause decrease bandwidth repair bandwidth increase hitless fashion together diverse routing provides survivability data traffic without requiring excess protection bandwidth allocation | [
3168,
2668,
7478,
7407
] | Validation |
10,559 | 9 | MVEL:mvel mvflex expression language mvel hybrid dynamic/statically typed embeddable expression language runtime java platform originally started utility language application framework project developed completely independently mvel typically used exposing basic logic end-users programmers configuration xml files annotations may also used parse simple javabean expressions runtime allows mvel expressions executed either interpretively pre-compilation process support runtime bytecode generation remove overhead since mvel meant augment java-based software borrows syntax directly java programming language minor differences additional capabilities example side effect mvel typing model treats class method references regular variables possible use class function pointers static methods mvel also allows collections represented folds projections lisp-like syntax mvel relies java namespaces classes possess ability declare namespaces classes example quicksort algorithm implemented mvel 2.0 demonstrating scripting capabilities language | [
6502,
1095,
8262,
5612,
5677,
7983,
3413,
9590,
479
] | Test |
10,560 | 9 | Backus–Naur_form:backus–naur form computer science backus–naur form backus normal form bnf notation technique context-free grammars often used describe syntax languages used computing computer programming languages document formats instruction sets communication protocols applied wherever exact descriptions languages needed instance official language specifications manuals textbooks programming language theory many extensions variants original backus–naur notation used exactly defined including extended backus–naur form ebnf augmented backus–naur form abnf idea describing structure language using rewriting rules traced back least work pāṇini ancient indian sanskrit grammarian revered scholar hinduism lived sometime 7th 4th century bce notation describe sanskrit word structure notation equivalent power backus many similar properties western society grammar long regarded subject teaching rather scientific study descriptions informal targeted practical usage first half 20th century linguists leonard bloomfield zellig harris started attempts formalize description language including phrase structure meanwhile string rewriting rules formal logical systems introduced studied mathematicians axel thue 1914 emil post 1920s–40s alan turing 1936 noam chomsky teaching linguistics students information theory mit combined linguistics mathematics taking essentially thue formalism basis description syntax natural language also introduced clear distinction generative rules context-free grammars transformation rules 1956 john backus programming language designer ibm proposed metalanguage metalinguistic formulas describe syntax new programming language ial known today algol 58 1959 notation first used algol 60 report bnf notation chomsky context-free grammars apparently backus familiar chomsky work proposed backus formula defined classes whose names enclosed angle brackets example codice_1 names denotes class basic symbols development algol led algol 60 committee 1963 report peter naur called backus notation backus normal form donald knuth argued bnf rather read backus–naur form normal form conventional sense unlike instance chomsky normal form name pāṇini backus form also suggested view fact expansion backus normal form may accurate pāṇini independently developed similar notation earlier bnf described peter naur algol 60 report metalinguistic formula another example algol 60 report illustrates major difference bnf metalanguage chomsky context-free grammar metalinguistic variables require rule defining formation formation may simply described natural language within brackets following algol 60 report section 2.3 comments specification exemplifies works purpose including text among symbols program following comment conventions hold equivalence meant three structures shown left column may replaced occurrence outside strings symbol shown line right column without effect action program naur changed two backus symbols commonly available characters := symbol originally ≡ symbol originally word bar expr := term expr addop term first symbol alternative may class defined repetition explained naur function specifying alternative sequence recursively begin previous alternative repeated number times example codice_3 defined codice_4 followed number codice_5 later metalanguages schorre meta ii bnf recursive repeat construct replaced sequence operator target language symbols defined using quoted strings codice_6 codice_7 bracket removed mathematical grouping codice_8 added codice_3 rule would appear meta ii expr term '+ term .out 'add '- term .out 'sub changes made meta ii derivative programming languages able define extend metalanguage ability use natural language description metalinguistic variable language construct description lost many spin-off metalanguages inspired bnf see meta ii tree-meta metacompiler bnf class describes language construct formation formation defined pattern action forming pattern class name expr described natural language codice_4 followed sequence codice_5 class abstraction talk independent formation talk term independent definition added subtracted expr talk term specific data type expr evaluated specific combinations data types even reordering expression group data types evaluation results mixed types natural-language supplement provided specific details language class semantics used compiler implementation programmer writing algol program natural-language description supplemented syntax well integer rule good example natural metalanguage used describe syntax integer := digit integer digit specifics white space far rule states could space digits natural language complement bnf metalanguage explaining digit sequence white space digits english one possible natural languages translations algol reports available many natural languages origin bnf important impact programming language development period immediately following publication algol 60 report bnf basis many compiler-compiler systems directly used bnf like syntax directed compiler algol 60 developed edgar t. irons compiler building system developed brooker morris others changed programming language schorre metacompilers made programming language changes codice_12 became symbol identifiers dropping enclosing using quoted strings symbols target language arithmetic like grouping provided simplification removed using classes grouping value meta ii arithmetic expression rule shows grouping use output expressions placed meta ii rule used output code labels assembly language rules meta ii equivalent class definitions bnf unix utility yacc based bnf code production similar meta ii yacc commonly used parser generator roots obviously bnf bnf today one oldest computer-related languages still use bnf specification set derivation rules written symbol nonterminal __expression__ consists one sequences symbols sequences separated vertical bar indicating choice whole possible substitution symbol left symbols never appear left side terminals hand symbols appear left side non-terminals always enclosed pair := means symbol left must replaced expression right example consider possible bnf u.s. postal address opt-suffix-part := sr. jr. roman-numeral translates english note many things format first-name apartment specifier zip-code roman numeral left unspecified necessary may described using additional bnf rules bnf syntax may represented bnf like following note empty string original bnf use quotes shown codice_13 rule assumes whitespace necessary proper interpretation rule codice_14 represents appropriate line-end specifier ascii carriage-return line-feed depending operating system codice_15 codice_16 substituted declared rule name/label literal text respectively u.s. postal address example entire block-quote syntax line unbroken grouping lines rule example one rule begins codice_17 part rule aside line-end expression consists two lists separated pipe codice_18 two lists consists terms three terms two terms respectively term particular rule rule-name many variants extensions bnf generally either sake simplicity succinctness adapt specific application one common feature many variants use regular expression repetition operators codice_19 codice_20 extended backus–naur form ebnf common one another common extension use square brackets around optional items although present original algol 60 report instead introduced years later ibm pl/i definition notation universally recognised augmented backus–naur form abnf routing backus–naur form rbnf extensions commonly used describe internet engineering task force ietf protocols parsing expression grammars build bnf regular expression notations form alternative class formal grammar essentially analytic rather generative character many bnf specifications found online today intended human-readable non-formal often include many following syntax rules extensions | [
512,
1672,
2316,
9871,
1552,
4635,
1952,
5792,
8866,
1956,
3876,
428,
5677,
10413,
7983,
8502,
4919,
1976,
7612,
2751,
8262,
10569,
1610,
8524,
3277,
9804,
1490,
8057,
2650,
1116,
6753,
3554,
6242,
9315,
1769,
10474,
2798,
9330,
6521,
332... | Test |
10,561 | 2 | RMX_(operating_system):rmx operating system irmx real-time operating system designed specifically use intel 8080 intel 8086 family processors acronym real-time multitasking executive intel developed irmx 1970s originally released rmx/80 1976 rmx/86 1980 support create demand processors multibus system platforms functional specification rmx/86 authored bruce schafer miles lewitt completed summer 1978 soon intel relocated entire multibus business santa clara california aloha oregon schafer lewitt went manage one two teams developed rmx/86 product release schedule 1980 effective 2000 irmx supported maintained licensed worldwide tenasys corporation exclusive licensing arrangement intel irmx layered design containing kernel nucleus basic i/o system extended i/o system human interface installation need include components required intertask synchronization communication subsystems filesystem extended memory management command shell etc native filesystem specific irmx many similarities original unix v6 filesystem 14 character path name components file nodes sector lists application readable directories etc irmx supports multiple processes known jobs rmx parlance multiple threads supported within process task addition interrupt handlers threads exist run response hardware interrupts thus irmx multi-processing multi-threaded pre-emptive real-time operating system rtos following list commands supported irmx 86 several variations irmx developed since original introduction intel 8080 irmx ii iii irmx-86 irmx-286 dos-rmx irmx windows recently intime many original variants irmx still use irmx iii irmx windows intime currently supported development new real-time applications three supported variants irmx require intel 80386 equivalent higher processor run significant architectural difference intime rtos irmx variants support address segments see x86 memory segmentation original 8086 family processors relied heavily segment registers overcome limitations associated addressing large amounts memory via 16-bit registers irmx operating system compilers developed irmx include features exploit segmented addressing features original x86 architecture intime variant irmx include explicit support segmentation opting instead support simpler common 32-bit flat addressing scheme note despite fact native processes written intime operate using unsegmented flat-mode addressing possible port run older irmx applications use segmented addressing intime kernel intel introduced intel 80386 processor addition expanding irmx rtos support 32-bit registers irmx iii also included support four distinct protection rings named rings 0 3 describe protected-mode mechanism intel 32-bit architecture practice systems ever used rings 0 3 implement protection schemes ii iii -286 -86 variants intended standalone real-time operating systems number development utilities applications made irmx compilers pl/m fortran c editor aedit process data acquisition applications cross compilers hosted vax/vms system also made available intel irmx iii still supported today used core technology newer real-time virtualization rtos products including irmx windows intime irmx iii intel multibus hardware used majority core systems clscs london underground central line signals control system supplied westinghouse invensys commissioned late 1990s central line automatic train operation line automatic train protection trackside train borne equipment use irmx automatic train supervision elements use mix irmx multibus solaris sparc computers 16 irmx local site computers distributed along central line together 6 central irmx computers control centre 22 irmx computers dual redundant irmx clscs continues full operation oslo metro uses similar although less complex westinghouse-supplied irmx control system central common tunnel tracks expected decommissioned 2011 dos-rmx variant standalone irmx operating system designed allow two operating systems share single hardware platform simplest terms ms-dos irmx operate concurrently single ibm pc compatible computer irmx tasks processes scheduling priority dos kernel interrupts applications irmx events e.g. hardware interrupts pre-empt dos kernel ensure tasks respond real-time events time-deterministic manner functional sense dos-rmx predecessor irmx windows intime practice dos-rmx appears tsr ms-dos kernel loaded tsr irmx takes cpu changing protected mode running dos virtual machine within rmx task combination provides rmx real-time functionality well full ms-dos services like dos-rmx system provides hybrid mixture services capabilities defined ms-dos microsoft windows irmx inter-application communication via enhanced windows dde capability allows rmx tasks communicate windows processes irmx windows originally intended use combination 16-bit version microsoft windows 2002 irmx windows reintroduced adding rmx personalities intime rtos windows allowing used conjunction 32-bit protected-mode versions windows windows nt windows 2000 etc. like irmx predecessors intime real-time operating system like dos-rmx irmx windows runs concurrently general-purpose operating system single hardware platform intime 1.0 originally introduced 1997 conjunction windows nt operating system since upgraded include support subsequent protected-mode microsoft windows platforms including windows vista windows 7 intime also used stand-alone rtos intime binaries able run unchanged running stand-alone node intime rtos unlike windows intime run intel 80386 equivalent processor current versions windows operating system generally require least pentium level processor order boot execute introduction intime 3.0 included several important enhancements among support multi-core processors ability debug real-time processes intime kernel using microsoft visual studio intime smp operating system thus support multi-core processors restricted special form asymmetric multiprocessing used multi-core processor intime configured run one cpu core windows runs remaining processor core use cases viewed tenasys website | [
2179,
6276,
10883,
6797,
8976,
10001,
9366,
7319,
2201,
9628,
3366,
2345,
10030,
11383,
6207,
321,
1221,
9927,
6985,
9162,
9166,
6868,
341,
1750,
9813,
10590,
1247,
6624,
5603,
5220,
1253,
1126,
6129,
10482,
3571,
5492,
1399,
3960,
2045,
... | None |
10,562 | 3 | Apple_A10:apple a10 apple a10 fusion 64-bit arm-based system chip soc designed apple inc. manufactured tsmc first appeared iphone 7 7 plus introduced september 7 2016 addition a10 chip processor sixth-generation ipad seventh-generation ipod touch a10 first apple-designed quad-core soc two high-performance cores two energy-efficient cores apple states 40 greater cpu performance 50 greater graphics performance compared predecessor apple a9 a10 internally t8010 built tsmc 16 nm finfet process contains 3.3 billion transistors including gpu caches die size 125 mm features two apple-designed 64-bit 2.34 ghz armv8-a cores called hurricane die size 4.18 mm first apple-produced quad-core soc two high-performance cores designed demanding tasks like gaming also featuring two energy-efficient apple-designed 64-bit cores codenamed zephyr 0.78 mm normal tasks configuration similar arm big.little technology however unlike implementations big.little snapdragon 820 exynos 8890 one core type active time either high-performance low-power cores thus a10 fusion appears software benchmarks dual core chip apple claims high-performance cores 40 faster apple previous a9 processor two high-efficiency cores consume 20 power high performance hurricane cores used performing simple tasks checking email new performance controller decides realtime pair cores run given task order optimize performance battery life a10 l1 cache 64 kb data 64 kb instructions l2 cache 3 mb shared cores 4 mb l3 cache services entire soc new 6-core gpu built a10 chip 50 faster consuming 66 power a9 predecessor analysis suggested apple kept gt7600 used apple a9 replaced portions powervr based gpu proprietary designs changes appear using lower half-precision floating-point numbers allowing higher-performance lower power consumption embedded a10 m10 motion coprocessor a10 also includes new image processor apple says twice throughput prior image processor a10 adds hardware encoding heif hevc a10 packaged new info packaging tsmc reduces height package package also four lpddr4 ram chips integrating 2 gb ram iphone 7 ipad 6th generation ipod touch 7th generation 3 gb iphone 7 plus | [
10755,
9732,
1549,
5647,
7697,
4114,
9235,
11282,
6165,
11289,
7706,
8222,
1057,
2551,
38,
6183,
1576,
6186,
4139,
6700,
7211,
8237,
9774,
2097,
1074,
8754,
9784,
8250,
8253,
576,
7745,
1090,
7747,
2635,
8783,
4180,
10838,
1623,
3672,
108... | Validation |
10,563 | 3 | Arcus_II:_Silent_Symphony:arcus ii silent symphony | [] | Test |
10,564 | 2 | TRSDOS:trsdos trsdos stood tandy radio shack disk operating system operating system tandy trs-80 line 8-bit zilog z80 microcomputers sold radio shack late 1970s early 1980s tandy manuals recommended pronounced triss-doss trsdos confused tandy dos version ms-dos licensed microsoft tandy x86 line personal computers pcs original trs-80 model 1977 trsdos primarily way extending mbasic basic rom additional i/o input/output commands worked disk files rather cassette tapes used non-disk model systems later disk-equipped model iii computers used completely different version trsdos radio shack culminated 1981 trsdos version 1.3 1983 disk-equipped trs-80 model 4 computers used trsdos version 6 development model iii ldos logical systems inc last updated 1987 released ls-dos 6.3 completely unrelated version trsdos radio shack trs-80 model ii professional computer 1979 also based z80 equipped 8 inch disk drives later machines line models 12 16 6000 used z80 alternate cpu main motorola 68000 chip could run version trsdos backwards compatibility older z80 applications software model trsdos supports four floppy mini-diskette drives use 5¼-inch diskettes capacity 89kb later 160kb formatted double-density sectors versions trsdos models 4 ii support double-density double sided floppy diskettes formatted 80 tracks per side including 3.5 inch microfloppy drives available 1985 drives numbered 0 3 system diskettes contain trsdos code utilities present drive 0 times trsdos uses overlays satisfy system requests disk directories maintained memory tandy corporation trs-80 microcomputer disk drive disk operating system release first version trsdos randy cook buggy others wrote alternatives including newdos ldos disputes cook ownership source code tandy hired logical systems ldos developer continue trsdos development trsdos 6 shipped trs-80 model 4 1983 identical ldos 6.00 typical trsdos utilities although ms-dos owes heritage closely cp/m thence tops-10 many file manipulation commands similar trsdos comparison cp/m command copying files called pip pun pip printers chain copy centers era acronym standing peripheral interchange program | [
3841,
2179,
1804,
6797,
6675,
10387,
5397,
2198,
8729,
7983,
823,
7483,
6459,
965,
9166,
1750,
7269,
6120,
5359,
8306,
499,
5363,
2933,
5492
] | Test |
10,565 | 7 | Tarantool:tarantool tarantool open-source nosql database management system lua application server maintains databases memory ensures crash resistance write-ahead logging includes lua interpreter interactive console also accepts connections programs several languages mail.ru one largest internet companies russia started project 2008 part development moy mir world social network 2010 project head hired former technical lead mysql open-source contributors active especially area external-language connectors c perl php python ruby node.js tarantool became part mail.ru backbone used dynamic content user sessions unsent instant messages task queues caching layer traditional relational databases mysql postgresql 2014 tarantool also adopted social network services badoo odnoklassniki latter affiliated mail.ru since 2010 june 2014 researchers polytechnic institute coimbra university coimbra portugal conducted first formal independent performance test nosql systems included tarantool tests used standard ycsb benchmark nosql systems cassandra hbase oracle nosql redis voldemort scalaris elasticsearch mongodb orientdb data maintained memory ram data persistence ensured write-ahead logging snapshotting reasons industry observers compared tarantool membase replication asynchronous failover getting one tarantool server take another possible either replica server hot standby server locks tarantool uses lua-style coroutines asynchronous i/o result application programs stored procedures must written cooperative multitasking mind rather popular preemptive multitasking database storage basic unit tuple tuples tuple sets handle role rows tables relational databases tuples arbitrary number fields fields need names every tuple database one unique null primary key one secondary keys enabled immediate lookup via indexes supported index types binary tree hash bitmap r-tree spatial fields tuple type-agnostic specific numeric string data types users may insert update delete select granted appropriate privileges tarantool 2017 introduced optional on-disk storage engine allows databases larger memory size tarantool 2019 introduced optional sql interface complies mandatory features official sql standard tarantool comes part official distributions linux distros debian fedora ubuntu tarantool organization also supplies downloads linux distributions os x freebsd tarantool extended modules installed using luarocks includes selection extension rocks | [
2051,
8582,
9245,
6433,
4777,
4781,
10413,
7983,
7347,
5047,
823,
6458,
11326,
8644,
4186,
860,
9320,
8554,
7022,
4598,
6522,
2045
] | Validation |
10,566 | 4 | YubiKey:yubikey yubikey hardware authentication device manufactured yubico supports one-time passwords public-key encryption authentication universal 2nd factor u2f fido2 protocols developed fido alliance allows users securely log accounts emitting one-time passwords using fido-based public/private key pair generated device yubikey also allows storing static passwords use sites support one-time passwords facebook uses yubikey employee credentials google supports employees users password managers support yubikey yubico also manufactures security key device similar yubikey focused public-key authentication yubikey implements hmac-based one-time password algorithm hotp time-based one-time password algorithm totp identifies keyboard delivers one-time password usb hid protocol yubikey neo yubikey 4 include protocols openpgp card using 2048-bit rsa elliptic curve cryptography ecc p256 p384 near field communication nfc fido u2f yubikey allows users sign encrypt decrypt messages without exposing private keys outside world 4th generation yubikey launched november 16 2015 support openpgp 4096-bit rsa keys pkcs 11 support piv smart cards feature allows code signing docker images founded 2007 ceo stina ehrensvärd yubico private company offices palo alto seattle stockholm yubico cto jakob ehrensvärd lead author original strong authentication specification became known universal 2nd factor u2f yubico founded 2007 began offering pilot box developers november year original yubikey product shown annual rsa conference april 2008 robust yubikey ii model launched 2009 yubikey ii later models two slots available storing two distinct configurations separate aes secrets settings authenticating first slot used briefly pressing button device second slot gets used holding button 2 5 seconds 2010 yubico began offering yubikey oath yubikey rfid models yubikey oath added ability generate 6- 8-character one-time passwords using protocols initiative open authentication oath addition 32-character passwords used yubico otp authentication scheme yubikey rfid model included oath capability plus also included mifare classic 1k radio-frequency identification chip though separate device within package could configured normal yubico software usb connection yubico announced yubikey nano february 2012 miniaturized version standard yubikey designed would fit almost entirely inside usb port expose small touch pad button later models yubikey also available standard nano sizes 2012 also saw introduction yubikey neo improved upon previous yubikey rfid product implementing near-field communication nfc technology integrating usb side device yubikey neo neo-n nano version device able transmit one-time passwords nfc readers part configurable url contained nfc data exchange format ndef message neo also able communicate using ccid smart-card protocol addition usb hid human interface device keyboard emulation ccid mode used piv smart card openpgp support usb hid used one-time password authentication schemes 2014 yubikey neo updated fido universal 2nd factor u2f support later year yubico released fido u2f security key specifically included u2f support none one-time password static password smart card nfc features previous yubikeys launch correspondingly sold lower price point 18 compared 25 yubikey standard 40 nano version 50 yubikey neo 60 neo-n pre-release devices issued google fido/u2f development reported yubico winusb gnubby gnubby1 april 2015 company launched yubikey edge standard nano form factors slotted neo fido u2f products feature-wise designed handle otp u2f authentication include smart card nfc support yubikey 4 family devices first launched november 2015 usb-a models standard nano sizes yubikey 4 includes features yubikey neo including increasing allowed openpgp key size 4096 bits vs. previous 2048 dropped nfc capability neo ces 2017 yubico announced expansion yubikey 4 series support new usb-c design yubikey 4c released february 13 2017 android os usb-c connection one-time password feature supported android os yubikey features currently supported including universal 2nd factor u2f 4c nano version became available september 2017 april 2018 company brought security key yubico first device implement new fido2 authentication protocols webauthn reached w3c candidate recommendation status march client authenticator protocol ctap still development may 2018 launch device available standard form factor usb-a connector like previous fido u2f security key blue color uses key icon button distinguished number 2 etched plastic button keyring hole also less expensive yubikey neo yubikey 4 models costing 20 per unit launch lacks otp smart card features previous devices though retains fido u2f capability used one-time passwords stored static passwords yubikey emits characters using modified hexadecimal alphabet intended independent system keyboard settings possible alphabet referred modhex modified hexadecimal consists characters cbdefghijklnrtuv corresponding hexadecimal digits 0123456789abcdef due yubikeys using raw keyboard scan codes usb hid mode problems using devices computers set different keyboard layouts dvorak recommended either use operating system features temporarily switch standard us keyboard layout similar using one-time passwords although yubikey neo later devices configured alternate scan codes match layouts n't compatible modhex character set u2f authentication yubikeys security keys bypasses problem using alternate u2fhid protocol sends receives raw binary messages instead keyboard scan codes ccid mode acts smart card reader use hid protocols yubico replaced open-source components yubikey 4 closed-source code longer independently reviewed security flaws yubico states internal external review code done yubikey neos still using open-source code may 16 2016 yubico cto jakob ehrensvärd responded open-source community concerns blog post affirming company strong open source support addressing reasons benefits updates yubikey 4 october 2017 security researchers found vulnerability known roca implementation rsa keypair generation cryptographic library used large number infineon security chips vulnerability allows attacker reconstruct private key using public key yubikey 4 yubikey 4c yubikey 4 nano devices within revisions 4.2.6 4.3.4 affected vulnerability yubico remedied issue shipping yubikey 4 devices switching different key generation function offered free replacements affected keys replacement offer ended march 31 2019 cases issue bypassed generating new keys outside yubikey importing onto device june 2019 yubico released security advisory reporting reduced randomness fips-certified devices shortly power-up company offered free replacements affected keys | [
32,
11584,
2050,
8674,
4644,
3271,
6316,
3309,
7212,
5918,
10801,
1054,
2910,
4575
] | Test |
10,567 | 4 | Code_wheel:code wheel code wheel type copy protection used older computer games often published late 1980s early 1990s evolved original manual protection system program would require user enter specific word manual game would start continue beyond certain point system popular allowed actual media backed replaced freely retaining security increased availability photocopiers wishing distribute games simply started copying manuals well defeat measure although whole code wheels could directly photocopied component wheels could disassembled individually photocopied components could crafted together duplicate wheel contents code wheels could also copied onto paper user unlicensed copy could simply apply mathematical formula presented challenges calculate correct response suitable formula found code wheels actually made process copying easier since amount information could contain low compared manual potentially unlimited size thus code wheels rapidly phased favor regular manual protection protection based around color public access color photocopying time expensive uncommon made obsolete return protection based game media cd-roms introduced code wheel physical object consisting several circular sheets paper card different sizes fastened center creating set concentric circles game issues user set challenges symbols words identifiers instruct user manipulate wheel order reveal response single symbol word user must enter order start game entering anything expected response would result game halting performing behaviour associated unauthorised usage software example game starflight would send unbeatable police ships destroy player spaceship simple 2-ply code wheel consisted two circular sheets challenge symbols printed intervals around rim back sheet containing table responses printed fit circle front sheet series holes allowing responses viewed hole labelled challenge symbol computer would present three challenge symbols user would read response rotating front sheet first two challenge symbols aligned rim wheel read response hole indicated third challenge symbol type codewheel used large number games neuromancer cybercon 3 used code wheel printed carbon paper one usage single-ply code wheel two challenge symbols used amiga game rocket ranger player turned wheel match ranger current location read value hole corresponding location wanted fly holes simple column since mechanism player specify wanted fly impossible crackers remove game without destroying entire gameplay 3-ply code wheel used games star control fool errand retained back wheel printed responses front wheel holes added middle wheels front back contained mixture printed responses holes allowed next wheel show particular challenge symbols aligned interactive code wheels online oldgames.sk | [] | Test |
10,568 | 9 | Simula:simula simula name two simulation programming languages simula simula 67 developed 1960s norwegian computing center oslo ole-johan dahl kristen nygaard syntactically fairly faithful superset algol 60 also influenced design simscript simula 67 introduced objects classes inheritance subclasses virtual procedures coroutines discrete event simulation features garbage collection also forms subtyping besides inheriting subclasses introduced simula derivatives simula considered first object-oriented programming language name suggests simula designed simulations needs domain provided framework many features object-oriented languages today simula used wide range applications simulating vlsi designs process modeling protocols algorithms applications typesetting computer graphics education influence simula often understated simula-type objects reimplemented c++ object pascal java c several languages computer scientists bjarne stroustrup creator c++ james gosling creator java acknowledged simula major influence following account based jan rune holmevik historical essay kristen nygaard started writing computer simulation programs 1957 nygaard saw need better way describe heterogeneity operation system go ideas formal computer language describing system nygaard realized needed someone computer programming skills ole-johan dahl joined work january 1962 decision linking language algol 60 made shortly may 1962 main concepts simulation language set simula born special purpose programming language simulating discrete event systems kristen nygaard invited visit eckert–mauchly computer corporation late may 1962 connection marketing new univac 1107 computer visit nygaard presented ideas simula robert bemer director systems programming univac bemer sworn algol fan found simula project compelling bemer also chairing session second international conference information processing hosted ifip invited nygaard presented paper simula -- extension algol description discrete-event networks norwegian computing center got univac 1107 august 1963 considerable discount dahl implemented simula contract univac implementation based univac algol 60 compiler simula fully operational univac 1107 january 1965 following couple years dahl nygaard spent lot time teaching simula simula spread several countries around world simula later implemented burroughs b5500 computers russian ural-16 computer 1966 c. a. r. hoare introduced concept record class construct dahl nygaard extended concept prefixing features meet requirements generalized process concept dahl nygaard presented paper class subclass declarations ifip working conference simulation languages oslo may 1967 paper became first formal definition simula 67 june 1967 conference held standardize language initiate number implementations dahl proposed unify type class concept led serious discussions proposal rejected board simula 67 formally standardized first meeting simula standards group ssg february 1968 simula influential development smalltalk later object-oriented programming languages also helped inspire actor model concurrent computation although simula supports coroutines true concurrency late sixties early seventies four main implementations simula implementations ported wide range platforms tops-10 implemented concept public protected private member variables procedures later integrated simula 87 simula 87 latest standard ported wide range platforms mainly four implementations november 2001 dahl nygaard awarded ieee john von neumann medal institute electrical electronics engineers introduction concepts underlying object-oriented programming design implementation simula 67 april 2002 received 2001 a. m. turing award association computing machinery acm citation ideas fundamental emergence object oriented programming design programming languages simula simula 67 unfortunately neither dahl nygaard could make acm turing award lecture scheduled delivered november 2002 oopsla conference seattle died june august year respectively simula research laboratory research institute named simula language nygaard held part-time position opening 2001 new computer science building university oslo named ole johan dahl house dahl honour main auditorium named simula empty computer file minimal program simula measured size source code consists one thing dummy statement however minimal program conveniently represented empty block begins executing immediately terminates language return value program example hello world program simula simula case-insensitive realistic example use classes subclasses virtual procedures example one super class glyph two subclasses char line one virtual procedure two implementations execution starts executing main program simula concept abstract classes since classes pure virtual procedures instantiated means example classes instantiated calling pure virtual procedure however produce run-time error simula supports call name jensen device easily implemented however default transmission mode simple parameter call value contrary algol used call name source code jensen device must therefore specify call name parameters compiled simula compiler another much simpler example summation function formula_1 implemented follows code uses call name controlling variable k expression u allows controlling variable used expression note simula standard allows certain restrictions controlling variable loop code therefore uses loop maximum portability following formula_2 implemented follows simula includes simulation package discrete event simulations simulation package based simula object oriented features coroutine concept sam sally andy shopping clothes share one fitting room one browsing store 12 minutes uses fitting room exclusively three minutes following normal distribution simulation fitting room experience follows main block prefixed codice_1 enabling simulation simulation package used block simulations even nested simulating someone simulations fitting room object uses queue codice_2 getting access fitting room someone requests fitting room use must wait queue codice_3 someone leaves fitting room first one released queue codice_4 accordingly removed door queue codice_5 person subclass process activity described using hold time browsing store time spent fitting room calls procedures fitting room object requesting leaving fitting room main program creates objects activates person objects put event queue main program holds 100 minutes simulated time program terminates | [
512,
2304,
2432,
9345,
4998,
1804,
4877,
10764,
5775,
6160,
9871,
5397,
1952,
10145,
11555,
1702,
10617,
5677,
7983,
9264,
2482,
10547,
11574,
2617,
7612,
963,
10819,
8262,
3529,
1610,
1611,
8524,
5584,
5585,
11219,
1236,
4069,
10470,
6248,... | Test |
10,569 | 9 | SNOBOL:snobol snobol string oriented symbolic language series computer programming languages developed 1962 1967 bell laboratories david j. farber ralph e. griswold ivan p. polonsky culminating snobol4 one number text-string-oriented languages developed 1950s 1960s others included comit trac snobol4 stands apart programming languages era patterns first-class data type i.e data type whose values manipulated ways permitted data type programming language providing operators pattern concatenation alternation later object-oriented languages javascript patterns type object admit various manipulations strings generated execution treated programs executed eval function languages snobol4 quite widely taught larger us universities late 1960s early 1970s widely used 1970s 1980s text manipulation language humanities 1980s 1990s use faded newer languages awk perl made string manipulation means regular expressions fashionable snobol4 patterns subsume bnf grammars equivalent context-free grammars powerful regular expressions regular expressions current versions awk perl fact extensions regular expressions traditional sense regular expressions unlike snobol4 patterns recursive gives distinct computational advantage snobol4 patterns recursive expressions appear perl 5.10 though released december 2007 one designers snobol ralph griswold designed successors snobol4 called sl5 icon combined backtracking snobol4 pattern matching standard algol-like structuring well adding features initial snobol language created tool used authors work symbolic manipulation polynomials written assembly language ibm 7090 simple syntax one datatype string functions declarations little error control however despite simplicity personal nature use began spread groups result authors decided extend tidy rewrote added functions standard user-defined released result snobol3 snobol2 exist short-lived intermediate development version without user-defined functions never released snobol3 became quite popular rewritten computers ibm 7090 programmers result several incompatible dialects arose snobol3 became popular authors received requests extensions language also began receive complaints incompatibility bugs versions n't written address take advantage new computers introduced late 1960s decision taken develop snobol4 many extra datatypes features based virtual machine allow improved portability across computers snobol4 language translator still written assembly language however macro features assembler used define virtual machine instructions snobol implementation language sil much improved portability language making relatively easy port virtual machine hosted translator recreating virtual instructions machine included macro assembler indeed high level language snobol4 supports number built-in data types integers limited precision real numbers strings patterns arrays tables associative arrays also allows programmer define additional data types new functions snobol4 programmer-defined data type facility advanced time—it similar earlier cobol later pascal records snobol command lines form five elements optional general subject matched pattern object present matched portion replaced object via rules replacement transfer absolute branch conditional branch dependent upon success failure subject evaluation pattern evaluation pattern match object evaluation final assignment also transfer code created compiled program run snobol pattern simple extremely complex simple pattern text string e.g abcd complex pattern may large structure describing example complete grammar computer language possible implement language interpreter snobol almost directly backus–naur form expression changes creating macro assembler interpreter completely theoretical piece hardware could take little hundred lines new instruction added single line complex snobol patterns things would impractical impossible using primitive regular expressions used pattern matching languages power derives so-called spitbol extensions since incorporated basically modern implementations original snobol 4 language although possible achieve power without part power comes side effects possible produce pattern matching operation including saving numerous intermediate/tentative matching results ability invoke user-written functions pattern match perform nearly desired processing influence ongoing direction interrupted pattern match takes even indeed change pattern matching operation patterns saved like first-class data item concatenated used within patterns used create complex sophisticated pattern expressions possible write example snobol4 pattern matches complete name international postal mailing address well beyond anything practical even attempt using regular expressions snobol4 pattern-matching uses backtracking algorithm similar used logic programming language prolog provides pattern-like constructs via dcgs algorithm makes easier use snobol logic programming language case languages snobol stores variables strings data structures single garbage-collected heap snobol rivals apl distinctiveness format programming style radically unlike standard procedural languages basic fortran c. hello world program might follows ... end simple program ask user name use output sentence ... end choose three possible outputs ... meh output hi username end love output nice meet username end hate output oh username end continue requesting input forthcoming ... namecount namecount 1 getinput output please give name namecount 1 end classic implementation pdp-10 used study compilers formal grammars artificial intelligence especially machine translation machine comprehension natural languages original implementation ibm 7090 bell labs holmdel n.j. snobol4 specifically designed portability first implementation started ibm 7094 1966 completed ibm 360 1967 rapidly ported many platforms normally implemented interpreter difficulty implementing high-level features compiler spitbol compiler provides nearly facilities interpreter provides gnat ada compiler comes package gnat.spitbol implements spitbol string manipulation semantics called within ada program file editor michigan terminal system mts provided pattern matching based snobol4 patterns several implementations currently available macro snobol4 c written phil budne free open source implementation capable running almost platform catspaw inc provided commercial implementation snobol4 language many different computer platforms including dos macintosh sun rs/6000 others implementations available free catspaw minnesota snobol4 viktors berstis closest pc implementation original ibm mainframe version even including fortran-like format statement support also free although snobol structured programming features snobol preprocessor called snostorm designed implemented 1970s fred g. swartz use michigan terminal system mts university michigan snostorm used eight fifteen sites ran mts also available university college london ucl 1982 1984 snocone andrew koenig adds block-structured constructs snobol4 language snocone self-contained programming language rather proper superset snobol4 spitbol implementation also introduced number features using traditional structured programming keywords nevertheless used provide many equivalent capabilities normally thought structured programming notably nested if/then/else type constructs features since added recent snobol4 implementations many years commercial product april 2009 spitbol released free software gnu general public license according dave farber griswold polonsky finally arrived name symbolic expression interpreter sexi common backronyms snobol 'string oriented symbolic language quasi-initialism 'string oriented symbolic language | [
512,
2304,
9345,
515,
3462,
5510,
8582,
1804,
2316,
4492,
5521,
11153,
2585,
8474,
8606,
1952,
2336,
10145,
4777,
428,
10560,
8388,
8262,
11219,
10324,
2519,
4057,
2272,
6369,
8421,
6248,
11625,
8430,
7666,
9845,
502,
3960,
8057,
7164,
20... | Validation |
10,570 | 2 | Ambient_(desktop_environment):ambient desktop environment ambient mui-based desktop environment morphos development started 2001 david gerber main goals fully asynchronous simple fast ambient remotely resembles workbench directory opus magellan trying mix best worlds ambient strictly follow amiga workbench interface paradigm still many similarities programs called tools program attributes called tooltypes data files projects directories drawers ambient localized various languages part morphos also available separately various visual effects ambient taking advantage hardware accelerated visual effects morphos native icon format ambient png icon built-in support amiga icon formats ambient introduced special icon format called datatype icons icon simply image file renamed include .info extension icons read using amiga datatype system 2005 david gerber released ambient source code gpl developed ambient development team | [
8832,
3841,
139,
5264,
2193,
9236,
2197,
3233,
9249,
4387,
9762,
8618,
6062,
7983,
432,
8369,
8114,
8115,
6075,
11076,
5709,
1742,
850,
6995,
4564,
6233,
5729,
5736,
11370,
5743,
11123,
9848,
2045
] | Test |
10,571 | 9 | Side_effect_(computer_science):side effect computer science computer science operation function expression said side effect modifies state variable value outside local environment say observable effect besides returning value main effect invoker operation state data updated outside operation may maintained inside stateful object wider stateful system within operation performed example side effects include modifying non-local variable modifying static local variable modifying mutable argument passed reference performing i/o calling side-effect functions presence side effects program behaviour may depend history order evaluation matters understanding debugging function side effects requires knowledge context possible histories degree side effects used depends programming paradigm imperative programming commonly used produce side effects update system state contrast declarative programming commonly used report state system without side effects functional programming side effects rarely used lack side effects makes easier formal verifications program functional languages standard ml scheme scala restrict side effects customary programmers avoid functional language haskell expresses side effects i/o stateful computations using monadic actions assembly language programmers must aware hidden side effects—instructions modify parts processor state mentioned instruction mnemonic classic example hidden side effect arithmetic instruction implicitly modifies condition codes hidden side effect explicitly modifies register overt effect one potential drawback instruction set hidden side effects many instructions side effects single piece state like condition codes logic required update state sequentially may become performance bottleneck problem particularly acute processors designed pipelining since 1990 out-of-order execution processor may require additional control circuitry detect hidden side effects stall pipeline next instruction depends results effects absence side effects necessary sufficient condition referential transparency referential transparency means expression function call replaced value requires expression pure say expression must deterministic always give value input side-effect free side effects caused time taken operation execute usually ignored discussing side effects referential transparency cases hardware timing testing operations inserted specifically temporal side effects e.g codice_1 codice_2 instructions change state taking amount time complete function codice_3 side effects said idempotent sequential composition codice_4 called twice list arguments second call side effects assuming procedures called end first call start second call instance consider following python code codice_5 idempotent second call codice_5 argument change visible program state codice_7 already set 5 first call set 5 second call thus keeping value note distinct idempotence function composition codice_8 example absolute value idempotent function composition one common demonstration side effect behavior assignment operator c++ example assignment returns right operand side effect assigning value variable allows syntactically clean multiple assignment operator right associates equates result assigning 3 codice_9 gets assigned codice_10 presents potential hangup novice programmers may confuse | [
2817,
9345,
4101,
6926,
6160,
786,
6163,
9497,
5920,
8226,
3876,
4389,
2470,
4516,
6821,
9385,
3630,
8116,
8502,
3767,
9911,
7609,
2618,
2620,
4797,
5059,
7671,
7627,
11083,
11343,
10584,
7386,
477,
8289,
10083,
8293,
8421,
8554,
9454,
24... | Test |
10,572 | 1 | Personal_Identity_System:personal identity system personal identity system pis established 1947 register pakistani citizens personal identity system replaced national database registration authority 1972 independence pakistan prime minister liaquat ali khan launched personal identity system pis program registered managed issued national identification cards citizens pakistan muslim refugees settling pakistan | [
848
] | Test |
10,573 | 1 | MyBatis:mybatis mybatis java persistence framework couples objects stored procedures sql statements using xml descriptor annotations mybatis free software distributed apache license 2.0 mybatis fork ibatis 3.0 maintained team includes original creators ibatis unlike orm frameworks mybatis map java objects database tables java methods sql statements mybatis lets use database functionality like stored procedures views queries complexity vendor proprietary features often good choice legacy de-normalized databases obtain full control sql execution simplifies coding compared jdbc sql statements executed single line mybatis provides mapping engine maps sql results object trees declarative way sql statements built dynamically using built-in language xml-like syntax apache velocity using velocity integration plugin mybatis integrates spring framework google guice feature allows one build business code free dependencies mybatis supports declarative data caching statement marked cacheable data retrieved database stored cache future executions statement retrieve cached data instead hitting database mybatis provides default cache implementation based java hashmap default connectors integrating oscache ehcache hazelcast memcached provides api plug cache implementations sql statements stored xml files annotations depicts mybatis mapper consists java interface mybatis annotations sentence executed follows sql statements mappings also externalized xml file follows statements also executed using mybatis api details please refer user guide available mybatis site see external links mybatis integrates spring framework module allows mybatis participate spring transactions also build mybatis mappers sessions inject beans following sample shows basic xml configuration sets mapper injects blogservice bean calling mybatis calling bean velocity language driver lets use apache velocity generate dynamic sql queries fly mybatis provides code generator mybatis generator introspect database table many tables generate mybatis artifacts needed perform crud operations create retrieve update delete eclipse plugin available preserve custom code case regeneration use eclipse plugin mybatis migrations java command line tool keeps track database schema changes managing ddl files known migrations migrations allows query current status database apply schema changes also undo also helps detect solve concurrent database schema changes made different developers mybatis project subsidiary ibatis 3.0 maintained team includes original creators ibatis project created may 19 2010 apache ibatis 3.0 published team announced development continue new name new home google code november 10 2013 project announced movement github | [
3712,
6277,
3080,
5403,
8860,
9634,
5677,
10413,
7983,
3763,
7485,
7742,
9661,
6860,
4944,
2901,
479,
5987,
5612,
9590,
8825,
9467,
3710
] | None |
10,574 | 4 | Fortinet:fortinet fortinet american multinational corporation headquartered sunnyvale california develops markets cybersecurity software appliances services firewalls anti-virus intrusion prevention endpoint security fortinet founded 2000 brothers ken michael xie company first product fortigate firewall later adding wireless access points sandboxing messaging security 2004 fortinet raised 90 million funding company went public november 2009 raising 156 million initial public offering 2016 fortinet released security fabric architecture included integration automation network security devices third-party vendors product later adapted include multi-cloud iot sd-wan capabilities prior fortinet ken xie founded served executive netscreen michael xie served executive servegate 2000 co-founded appligation inc company renamed apsecure december 2000 later renamed fortinet based phrase fortified networks 2004 amid fundraising fortinet netscreen acquired juniper networks 4 billion fortinet spent two years research development introducing first product fortigate 2002 company raised 13 million private funding 2000 early 2003 additional 30 million financing raised august 2003 followed 50 million march 2004 fortinet first channel program established october 2003 company began distributing products canada december 2003 westcon canada uk february 2004 norwood adam 2004 fortinet offices asia europe north america april 2005 german court issued preliminary injunction fortinet uk subsidiary relation source code gpl-licensed elements dispute ended month later fortinet agreed make source code available upon request fortinet became profitable third quarter 2008 late year company acquired database security auditing intellectual property iplocks extended job offers company 28 employees august 2009 acquired intellectual property assets woven systems ethernet switching company according market research firm idc november 2009 held 15 percent unified threat management market also 2009 crn magazine survey-based annual report card arc placed fortinet first network security hardware seventh 2007 november 2009 fortinet initial public offering wherein company planned raise 52.4 million sale 5.8 million shares 6 million shares also sold stockholders first day trading fortinet increased share price 9 12.50 price increased market 16.62 end first day trading company raised 156 million financing 2010 fortinet 324 million annual revenues held largest share market according idc july 2013 fortinet made changes reseller program security operations center soc box order provide monthly financing options managed security service vendors less experience less capital program previously reorganized 2006 enterprise companies fortinet made three notable acquisitions 2012 2015 company acquired app-hosting service xdn formerly known 3crowd december 2012 coyote point 2013 wi-fi hardware company meru networks 2015 june 2016 fortinet acquired security monitoring analytics software vendor accelops july 2014 fortinet announced technical certification program called network security expert nse included eight levels certification later march 2016 company launched network security academy help fill open cyber security jobs u.s. fortinet donated equipment provided information universities help train students jobs field also 2016 fortinet launched program called fortivet recruit military veterans cybersecurity jobs january 2017 announced philip quade former member nsa would become company chief information officer end 2017 fortinet reported 416.7 million revenue 15 percent increase previous year december 31 2017 fortinet 467 u.s. foreign-issued patents 291 pending june 2018 fortinet acquired bradford networks maker access control iot security solutions january 2019 announced fortinet founder ken xie would participate annual world economic forum held davos switzerland fortinet released first product fortigate firewall 2002 followed anti-spam anti-virus software fortigate updated use application-specific integrated circuit asic architecture fortinet products later merged network security including firewalls anti-spam anti-virus software one appliance april 2016 fortinet began building security fabric architecture multiple network security products could communicate one platform later year company added security information event management siem products analyzed hardware software security alerts high gigabit port density consolidated network security features mid-sized businesses enterprise branch locations addition cloud security september 2016 company announced would integrate siem products security systems vendors 2017 fortinet announced addition switches access points analyzers sandboxes cloud capabilities security fabric addition endpoints firewalls later 2017 fortinet created standalone subsidiary fortinet federal develop cybersecurity products government agencies fortinet historically received security effectiveness certifications nss labs gartner research consulting firm ranked fortinet within top three companies magic quadrant enterprise network firewalls measures market trends direction july 2018 company launched fortigate sd-wan proprietary sd-wan service fortigate sd-wan included within gartner magic quadrant wan edge infrastructure later year later 2018 fortinet released fortiguard ai better detect new unknown threats also announced 6.0 version fortios security operating system enhanced centralized management expanded cloud capabilities may 2004 trend micro competing cyber security defense company filed legal complaint fortinet though international trade commission initially ruled fortinet trend micro patents center dispute later declared invalid 2010 2005 fortinet responded questions related employee relationship burma prime minister use fortinet appliances internet censorship myanmar fortinet stated products sold third party resellers acknowledged us embargoes 2005 fortinet created fortiguard labs internal security research team 2008 fortinet researchers sent report facebook highlighting widget zango appeared tricking users downloading spyware 2014 fortinet four research development centers asia well others us canada france march 2014 fortinet founded cyber threat alliance cta palo alto networks order share security threat data across vendors later joined mcafee symantec 2015 cta published white paper cryptowall ransomware detailed attackers obtained 325 million ransoms paid victims regain access files april 2015 fortinet provided threat intelligence interpol order help apprehend ringleader several online scams based nigeria scams resulted compromise business emails ceo fraud cost one business 15 million following year march 2016 fortinet technology company cisco joined nato data-sharing agreement improve information security capabilities january 2017 fortinet worked interpol conduct investigation web security several southeast asian countries investigation identified compromised websites including government-operated web servers later month fortinet researchers discovered spyware scammed victims impersonating irs also 2017 researchers helped identify malware called rootnik ransomware called macransom targeted android macos systems respectively 2018 fortinet entered information-sharing agreement interpol | [
2049,
2563,
6,
1052,
550,
10790,
2601,
6699,
8753,
10291,
569,
9279,
10308,
2118,
94,
2654,
2147,
8816,
10872,
6779,
9341,
127,
7809,
131,
1172,
3732,
156,
2721,
2213,
6823,
3243,
1708,
6834,
704,
10433,
7362,
202,
4814,
7887,
9423,
104... | None |
10,575 | 6 | TUGZip:tugzip tugzip freeware file archiver microsoft windows handles great variety archive formats including commonly used ones like zip rar gzip bzip2 sqx 7z also view disk image files like bin c2d img iso nrg tugzip repairs corrupted zip archives encrypt files 6 different algorithms since release tugzip 3.5.0.0 development suspended due lack time kindahl side tugzip supports following file formats | [
6022,
10121,
1420,
6797,
1940,
3222,
9880,
3114,
10027,
7983,
950,
6713,
2755,
11076,
1352,
4296,
10317,
4561,
722,
11614,
1631,
3296,
9953,
5858,
6759,
5096,
7529,
4459,
237,
1646,
4845,
7667,
6389,
4089,
894,
10623
] | Test |
10,576 | 3 | Frogger:frogger frogger 1981 arcade game developed gremlin industries konami published sega object game direct frogs homes one one crossing busy road navigating river full hazards frogger positively received followed several clones sequels 2005 frogger various home video game incarnations sold 20 million copies worldwide including 5 million united states game found way popular culture including television music objective game guide frog empty frog homes top screen game starts three five seven frogs depending settings used operator losing ends game player control 4 direction joystick used navigate frog push direction causes frog hop direction frogger either single-player two players alternating frog starts bottom screen contains horizontal road occupied cars trucks bulldozers speeding along player must guide frog opposing lanes traffic avoid becoming roadkill results loss life road median strip separating two major parts screen upper portion screen consists river logs alligators turtles moving horizontally across screen jumping swiftly moving logs backs turtles alligators player guide frog safety player must avoid snakes otters open mouths alligators brightly colored lady frog sometimes log may carried bonus points top screen contains five frog homes destinations frog sometimes contain insects good lurking alligators bad game opening tune first verse japanese children song called inu omawarisan dog policeman japanese tunes played gameplay include themes anime hana ko lunlun araiguma rascal united states release kept opening song intact added yankee doodle softline 1982 stated frogger earned ominous distinction 'the arcade game ways die many different ways lose life illustrated skull crossbones symbol frog including hit running road vehicle jumping river water running snakes otters alligator jaws river jumping home invaded alligator staying top diving turtle completely submerged riding log alligator turtle side screen jumping home already occupied frog jumping side home bush running time five frogs homes game progresses next level increased difficulty five levels game gets briefly easier yet getting progressively harder level player 30 seconds guide frog one homes timer resets whenever life lost frog reaches home safely every forward step scores 10 points every frog arriving safely home scores 50 points 10 points also awarded per unused second time guiding lady frog home eating fly scores 200 points 5 frogs reach home end level player earns 1,000 points single bonus frog 20,000 points 99,990 points maximum high score achieved original arcade cabinet players may exceed score game keeps last 5 digits frogger ported many contemporary home systems several platforms capable accepting rom cartridges magnetic media systems commodore 64 received multiple versions game sierra on-line gained magnetic media rights sublicensed developers published systems normally supported sierra cornsoft published official trs-80/dragon 32 timex sinclair 1000 timex sinclair 2068 ports even atari 2600 received multiple releases cartridge cassette supercharger sierra released disk and/or tape ports c64 apple ii original 128k macintosh ibm pc atari 2600 supercharger well cartridge versions trs-80 color computer parker brothers received license sega cartridge versions produced cartridge ports frogger atari 2600 intellivision atari 5200 colecovision atari 8-bit family ti-99/4a vic-20 commodore 64 parker brothers spent 10 million advertising frogger sold three million cartridges company successful first-year product beating sales revenues previous best-seller merlin coleco also released stand-alone mini-arcade tabletop versions frogger along pac-man galaxian donkey kong sold three million units combined frogger also ported 1983 gakken compact vision tv boy one 6 launch titles ed driscoll reviewed atari vcs version frogger space gamer 58 driscoll commented liked arcade version save lot quarters price line cartridges also proves atari n't one making home versions major arcade games vcs danny goodman creative computing video arcade games wrote 1983 atari 2600 version frogger one detailed translations seen noting addition wraparound screen 2013 entertainment weekly named frogger one top ten games atari 2600 hasbro interactive released vastly expanded remake original microsoft windows playstation 1997 unlike original game consisted multiple levels different preceding one commercial success pc version alone selling nearly one million units less four months 1998 hasbro released series ports original game sega genesis super nes game com game boy game boy color port featured game different graphics sega genesis port featuring graphics original arcade game sega genesis snes versions last games released consoles north america despite using box art ports otherwise unrelated 1997 remake 2005 infospace teamed konami digital entertainment create mobile game frogger prizes players across u.s. competed multiplayer tournaments win daily weekly prizes 2006 mobile game version frogger grossed 10 million united states java port game available compatible mobile phones port frogger released xbox live arcade xbox 360 july 12 2006 developed digital eclipse published konami two new gameplay modes versus speed mode co-op play music including familiar frogger theme removed version replaced music version included compilation konami classics vol 1 home versions frogger numerous sequels including frogger great quest frogger helmet chaos frogger shown bipedal wearing shirt crossed-out truck frogger also inspired unofficial sequel sega 1991 called ribbit featured improved graphics simultaneous two-player action additionally prototype game based gameplay elements frogger developed sega game gear never released prototype contained additional features redesigned levels unofficial clones include ribbit apple ii 1981 acornsoft hopper 1983 bbc micro acorn electron f software frogger 1983 bbc micro zx spectrum pss ’ personal software services hopper oric 1 uk 1983 later release oric atmos froggy zx spectrum released djl software 1984 solo software frogger sharp mz-700 1984 uk version newbrain name leap frog several clones retained basic gameplay frogger changing style and/or plot pacific coast highway 1982 atari 8-bit family splits gameplay two alternating screens one highway one water preppie 1982 atari 8-bit family changes frog preppy retrieving golf balls country club frostbite 1983 atari 2600 uses frogger river gameplay arctic theme crossy road 2014 ios android windows phone randomly generated series road river sections game one endless level one life single point given forward hop atari 2600 game freeway often considered clone frogger game developed independently released 1981 2008 city melbourne created spin-off called grogger part public service campaign encourage people take safe transportation home night drinking frogger tied american popular culture found film television music 1983 frogger made animated television debut segment cbs saturday supercade cartoon lineup frogger voiced bob sarlatte worked investigative reporter segment aired one season 1998 game featured seinfeld episode frogger jerry george visit soon-to-be-closed pizzeria frequented teenagers discover frogger machine still place george decade-old high score still recorded buys machine tries get across street without letting lose power would erase high score initials glc season 4 episode george lopez friends n't let friends marry drunks george says son max play one frog tries cross street obvious reference frogger frogger also appears films wreck-it ralph pixels ralph breaks internet music frogger referenced also found 1982 buckner garcia recorded song called froggy lament using sound effects game released album pac-man fever punk band bad religion recorded song called frogger traffic los angeles song includes sample game theme music beginning frontman greg graffin claims playing frogger life result traffic song included band 1985 ep back known 2004 remaster debut album could hell worse uk girl group sugababes sampled coin-insert tone frogger game 2002 hit single freak like addition film television music frogger found popular culture mediums well 2006 group austin texas used modified roomba dressed frogger play real-life version game realm science frogger name given transposon jumping gene family fruit fly drosophila melanogaster november 26 1999 rickey world famous sauce offered 10,000 first person could score 1,000,000 points frogger 1,000 new world record prior january 1 2000 march 25 2005 robert mruczek offered 1,000 beating fictitious world record 860,630 set george costanza famous episode seinfeld 250 new world record end year december 1 2006 john cunningham offered 250 exceeding fictitious world record 860,630 points february 28 2007 one ever able achieve bounties scores surpassed bounties expired first score verified beaten fictional george costanza seinfeld score 860,630 points set pat laffaye december 22 2009 896,980 points surpassed michael smith springfield virginia usa score 970,440 points july 15 2012 current frogger world record holder pat laffaye westport connecticut usa august 15 2017 scored 1,029,990 points becoming first person ever break one million points original arcade machine | [
9732,
4357,
7051,
6797,
10644,
4518,
4524,
5677,
10287,
11311,
6449,
10931,
8887,
10695,
10316,
4312,
3039,
9957,
8937,
1776
] | Test |
10,577 | 0 | Statistical_semantics:statistical semantics linguistics statistical semantics applies methods statistics problem determining meaning words phrases ideally unsupervised learning degree precision least sufficient purpose information retrieval term statistical semantics first used warren weaver well-known paper machine translation argued word sense disambiguation machine translation based co-occurrence frequency context words near given target word underlying assumption word characterized company keeps advocated j.r. firth assumption known linguistics distributional hypothesis emile delavenay defined statistical semantics statistical study meanings words frequency order recurrence furnas et al 1983 frequently cited foundational contribution statistical semantics early success field latent semantic analysis research statistical semantics resulted wide variety algorithms use distributional hypothesis discover many aspects semantics applying statistical techniques large corpora statistical semantics focuses meanings common words relations common words unlike text mining tends focus whole documents document collections named entities names people places organizations statistical semantics subfield computational semantics turn subfield computational linguistics natural language processing many applications statistical semantics listed also addressed lexicon-based algorithms instead corpus-based algorithms statistical semantics one advantage corpus-based algorithms typically labour-intensive lexicon-based algorithms another advantage usually easier adapt new languages lexicon-based algorithms however best performance application often achieved combining two approaches | [
1825,
1890,
7780,
9796,
4070,
11206,
4072,
1737,
7599,
9935,
2578,
10452,
8440,
7164
] | Test |
10,578 | 4 | Anti-Spam_Research_Group:anti-spam research group anti-spam research group asrg research group started within internet research task force irtf charter concluded 18 march 2013 still reference melting pot anti-spam research theorization particular wiki lives dedicated research curbing spam internet-wide level consists mailing list coordinate work small web site wiki irtf groups asrg contributed internet engineering task force ietf process drafts documents assistance creation new working groups one ietf group spun asrg marid asrg sporadically active little evolves anti-spam landscape activity happening mailing list 2008 asrg worked internet drafts dnsbls 2010 standardization feedback loop email | [
8224,
8130,
3145,
6762,
4272,
6517,
9532,
8093
] | None |
10,579 | 8 | Query_string:query string internet query string part uniform resource locator url assigns values specified parameters query string commonly includes fields added base url web browser client application example part html form web server handle hypertext transfer protocol request either reading file file system based url path handling request using logic specific type resource cases special logic invoked query string available logic use processing along path component url typical url containing query string follows server receives request page may run program passing query string case codice_1 unchanged program question mark used separator part query string web frameworks may provide methods parsing multiple parameters query string separated delimiter example url multiple query parameters separated ampersand codice_2 order queries n't matter codice_3 codice_4 produce results exact structure query string standardized methods used parse query string may differ websites link web page may url contains query string html defines three ways user agent generate query string one original uses contain content html form also known web form particular form containing fields codice_5 codice_6 codice_7 submitted content fields encoded query string follows definitive standard web frameworks allow multiple values associated single field e.g codice_11 field form query string contains pair codice_12 web forms may include fields visible user fields included query string form submitted convention w3c recommendation w3c recommends web servers support semicolon separators addition ampersand separators allow application/x-www-form-urlencoded query strings urls within html documents without entity escape ampersands form content encoded url query string form submission method get encoding used default submission method post result submitted http request body rather included modified url forms added html browsers rendered element single-line text-input control text entered control sent server query string addition get request base url another url specified attribute intended allow web servers use provided text query criteria could return list matching pages text input indexed search control submitted encoded query string follows though element deprecated browsers longer support render still vestiges indexed search existence example source special handling plus sign 'codice_13 within browser url percent encoding today deprecation indexed search redundant codice_15 also web servers supporting cgi e.g. apache process query string command line arguments contain equals sign 'codice_8 per section 4.4 cgi 1.1 cgi scripts still depend use historic behavior urls embedded html characters part url example space characters special meaning url example character codice_17 used specify subsection fragment document html forms character codice_8 used separate name value uri generic syntax uses url encoding deal problem html forms make additional substitutions rather applying percent encoding characters space encoded 'codice_13 codice_15 html 5 specifies following transformation submitting html forms get method web server following brief summary algorithm octet corresponding tilde codice_35 permitted query strings rfc3986 required percent-encoded html forms codice_36 encoding space 'codice_13 selection as-is characters distinguishes encoding rfc 3986 form embedded html page follows form action= cgi-bin/test.cgi method= get /form user inserts strings “ field ” “ clear already ” two text fields presses submit button program codice_38 program specified codice_39 attribute codice_40 element example receive following query string codice_41 form processed server cgi script script may typically receive query string environment variable named codice_42 program receiving query string ignore part requested url corresponds file program whole query string ignored however regardless whether query string used whole url including stored server log files facts allow query strings used track users manner similar provided http cookies work every time user downloads page unique identifier must chosen added query string urls links page contains soon user follows one links corresponding url requested server way download page linked previous one example web page containing following requested unique string codice_43 chosen page modified follows addition query string change way page shown user user follows example first link browser requests page codice_44 server ignores follows codice_45 sends page codice_46 expected adding query string links well way subsequent page request user carry query string codice_43 making possible establish pages viewed user query strings often used association web beacons main differences query strings used tracking http cookies according http specification various ad hoc limitations request-line length found practice recommended http senders recipients support minimum request-line lengths 8000 octets url long web server fails 414 request-uri long http status code common workaround problems use post instead get store parameters request body length limits request bodies typically much higher url length example limit post size default 2 mb iis 4.0 128 kb iis 5.0 limit configurable apache2 using codice_48 directive specifies number bytes 0 meaning unlimited 2147483647 2 gb allowed request body | [
2945,
899,
7965,
9762,
2470,
7847,
9780,
2485,
1206,
3642,
2106,
4797,
1096,
10959,
10450,
225,
865,
10466,
113,
6002,
7673
] | Test |
10,580 | 4 | Discretionary_access_control:discretionary access control computer security discretionary access control dac type access control defined trusted computer system evaluation criteria means restricting access objects based identity subjects and/or groups belong controls discretionary sense subject certain access permission capable passing permission perhaps indirectly subject unless restrained mandatory access control discretionary access control commonly discussed contrast mandatory access control mac occasionally system whole said discretionary purely discretionary access control way saying system lacks mandatory access control hand systems said implement mac dac simultaneously dac refers one category access controls subjects transfer among mac refers second category access controls imposes constraints upon first meaning term practice clear-cut definition given tcsec standard tcsec definition dac impose implementation least two implementations owner widespread example capabilities term dac commonly used contexts assume every object owner controls permissions access object probably many systems implement dac using concept owner tcsec definition say anything owners technically access control system n't concept owner meet tcsec definition dac users owners dac implementation ability make policy decisions and/or assign security attributes straightforward example unix file mode represent write read execute 3 bits user group others prepended another bit indicates additional characteristics another example capability systems sometimes described providing discretionary controls permit subjects transfer access subjects even though capability-based security fundamentally restricting access based identity subjects capability systems general allow permissions passed subject subject wanting pass permissions must first access receiving subject subjects generally access subjects system | [
1792,
8838,
7,
2193,
8210,
3480,
3360,
3616,
7206,
808,
2477,
4912,
2737,
4404,
5812,
10170,
5573,
11470,
210,
8402,
10835,
10968,
7260,
2013,
6625,
4067,
9958,
8302,
7663,
6902,
2558
] | None |
10,581 | 9 | Closure_(computer_programming):closure computer programming programming languages closure also lexical closure function closure technique implementing lexically scoped name binding language first-class functions operationally closure record storing function together environment environment mapping associating free variable function variables used locally defined enclosing scope value reference name bound closure created unlike plain function closure allows function access captured variables closure copies values references even function invoked outside scope concept closures developed 1960s mechanical evaluation expressions λ-calculus first fully implemented 1970 language feature pal programming language support lexically scoped first-class functions peter j. landin defined term closure 1964 environment part control part used secd machine evaluating expressions joel moses credits landin introducing term closure refer lambda expression whose open bindings free variables closed bound lexical environment resulting closed expression closure usage subsequently adopted sussman steele defined scheme 1975 lexically scoped variant lisp became widespread term closure often used synonym anonymous function though strictly anonymous function function literal without name closure instance function value whose non-local variables bound either values storage locations depending language see lexical environment section example following python code values codice_1 codice_2 closures cases produced returning nested function free variable enclosing function free variable binds value parameter codice_3 enclosing function closures codice_1 codice_2 functionally identical difference implementation first case used nested function name codice_6 second case used anonymous nested function using python keyword codice_7 creating anonymous function original name used defining irrelevant closure value like value need assigned variable instead used directly shown last two lines example usage may deemed anonymous closure nested function definitions closures free variable yet bound enclosing function evaluated value parameter free variable nested function bound creating closure returned enclosing function lastly closure distinct function free variables outside scope non-local variables otherwise defining environment execution environment coincide nothing distinguish static dynamic binding distinguished names resolve values example program functions free variable codice_3 bound non-local variable codice_3 global scope executed environment codice_3 defined immaterial whether actually closures often achieved function return since function must defined within scope non-local variables case typically scope smaller also achieved variable shadowing reduces scope non-local variable though less common practice less useful shadowing discouraged example codice_11 seen closure codice_3 body codice_11 bound codice_3 global namespace codice_3 local codice_6 use closures associated languages functions first-class objects functions returned results higher-order functions passed arguments function calls functions free variables first-class returning one creates closure includes functional programming languages lisp ml well many modern multi-paradigm languages python rust closures also frequently used callbacks particularly event handlers javascript used interactions dynamic web page closures also used continuation-passing style hide state constructs objects control structures thus implemented closures languages closure may occur function defined within another function inner function refers local variables outer function run-time outer function executes closure formed consisting inner function code references upvalues variables outer function required closure closures typically appear languages first-class functions—in words languages enable functions passed arguments returned function calls bound variable names etc. like simpler types strings integers example consider following scheme function example lambda expression codice_17 appears within function codice_18 lambda expression evaluated scheme creates closure consisting code lambda expression reference codice_19 variable free variable inside lambda expression closure passed codice_20 function calls repeatedly determine books added result list discarded closure reference codice_19 use variable time codice_20 calls function codice_20 might defined completely separate file example rewritten javascript another popular language support closures codice_24 keyword used instead codice_7 codice_26 method instead global codice_20 function otherwise structure effect code function may create closure return following example closure case outlives execution function creates variables codice_11 codice_29 live function codice_30 returns even though execution left scope longer visible languages without closures lifetime automatic local variable coincides execution stack frame variable declared languages closures variables must continue exist long existing closures references commonly implemented using form garbage collection closure used associate function set private variables persist several invocations function scope variable encompasses closed-over function accessed program code stateful languages closures thus used implement paradigms state representation information hiding since closure upvalues closed-over variables indefinite extent value established one invocation remains available next closures used way longer referential transparency thus longer pure functions nevertheless commonly used impure functional languages scheme closures many uses note speakers call data structure binds lexical environment closure term usually refers specifically functions closures typically implemented special data structure contains pointer function code plus representation function lexical environment i.e. set available variables time closure created referencing environment binds non-local names corresponding variables lexical environment time closure created additionally extending lifetime least long lifetime closure closure entered later time possibly different lexical environment function executed non-local variables referring ones captured closure current environment language implementation easily support full closures run-time memory model allocates automatic variables linear stack languages function automatic local variables deallocated function returns however closure requires free variables references survive enclosing function execution therefore variables must allocated persist longer needed typically via heap allocation rather stack lifetime must managed survive closures referencing longer use explains typically languages natively support closures also use garbage collection alternatives manual memory management non-local variables explicitly allocating heap freeing done using stack allocation language accept certain use cases lead undefined behaviour due dangling pointers freed automatic variables lambda expressions c++11 nested functions gnu c. funarg problem functional argument problem describes difficulty implementing functions first class objects stack-based programming language c c++ similarly version 1 assumed programmer knows delegates automatic local variables references invalid return definition scope automatic local variables stack – still permits many useful functional patterns complex cases needs explicit heap allocation variables version 2 solved detecting variables must stored heap performs automatic allocation uses garbage collection versions need track usage variables passed strict functional languages immutable data e.g erlang easy implement automatic memory management garbage collection possible cycles variables references example erlang arguments variables allocated heap references additionally stored stack function returns references still valid heap cleaning done incremental garbage collector ml local variables lexically scoped hence define stack-like model since bound values objects implementation free copy values closure data structure way invisible programmer scheme algol-like lexical scope system dynamic variables garbage collection lacks stack programming model suffer limitations stack-based languages closures expressed naturally scheme lambda form encloses code free variables environment persist within program long possibly accessed used freely scheme expression closures closely related actors actor model concurrent computation values function lexical environment called acquaintances important issue closures concurrent programming languages whether variables closure updated updates synchronized actors provide one solution closures closely related function objects transformation former latter known defunctionalization lambda lifting see also closure conversion different languages always common definition lexical environment definitions closure may vary also commonly held minimalist definition lexical environment defines set bindings variables scope also closures language capture however meaning variable binding also differs imperative languages variables bind relative locations memory store values although relative location binding change runtime value bound location languages since closure captures binding operation variable whether done closure performed relative memory location often called capturing variable reference example illustrating concept ecmascript one language function codice_31 closures referred variables codice_11 codice_6 use relative memory location signified local variable codice_3 instances behaviour may undesirable necessary bind different lexical closure ecmascript would done using codice_35 example expected behaviour would link emit id clicked variable e bound scope lazy evaluated click actually happens click event emits id last element 'elements bound end loop variable codice_36 would need bound scope block using codice_37 codice_38 keyword hand many functional languages ml bind variables directly values case since way change value variable bound need share state closures—they use values often called capturing variable value java local anonymous classes also fall category—they require captured local variables codice_39 also means need share state languages enable choose capturing value variable location example c++11 captured variables either declared codice_40 means captured reference codice_41 means captured value yet another subset lazy functional languages haskell bind variables results future computations rather values consider example haskell binding codice_42 captured closure defined within function codice_31 computation codice_44—which case results division zero however since computation captured value error manifests closure invoked actually attempts use captured binding yet differences manifest behavior lexically scoped constructs codice_45 codice_46 codice_47 statements constructs general considered terms invoking escape continuation established enclosing control statement case codice_46 codice_47 interpretation requires looping constructs considered terms recursive function calls languages ecmascript codice_45 refers continuation established closure lexically innermost respect statement—thus codice_45 within closure transfers control code called however smalltalk superficially similar operator codice_52 invokes escape continuation established method invocation ignoring escape continuations intervening nested closures escape continuation particular closure invoked smalltalk implicitly reaching end closure code following examples ecmascript smalltalk highlight difference code snippets behave differently smalltalk codice_52 operator javascript codice_45 operator analogous ecmascript example codice_55 leave inner closure begin new iteration codice_56 loop whereas smalltalk example codice_57 abort loop return method codice_31 common lisp provides construct express either actions lisp codice_59 behaves smalltalk codice_57 lisp codice_61 behaves javascript codice_55 hence smalltalk makes possible captured escape continuation outlive extent successfully invoked consider closure returned method codice_31 invoked attempts return value invocation codice_31 created closure since call already returned smalltalk method invocation model follow spaghetti stack discipline facilitate multiple returns operation results error languages ruby enable programmer choose way codice_45 captured example ruby codice_66 codice_7 example ways create closure semantics closures thus created different respect codice_45 statement scheme definition scope codice_45 control statement explicit arbitrarily named 'return sake example following direct translation ruby sample languages features simulate behavior closures languages java c++ objective-c c vb.net features result language object-oriented paradigm c libraries support callbacks sometimes implemented providing two values registering callback library function pointer separate codice_70 pointer arbitrary data user choice library executes callback function passes along data pointer enables callback maintain state refer information captured time registered library idiom similar closures functionality syntax codice_70 pointer type safe c idiom differs type-safe closures c haskell ml callbacks extensively used gui widget toolkits implement event-driven programming associating general functions graphical widgets menus buttons check boxes sliders spinners etc application-specific functions implementing specific desired behavior application gcc extension nested function used function pointer emulate closures providing containing function exit example invalid typedef int *fn_int_to_int int //type function int- int fn_int_to_int adder int number int main void java enables classes defined inside methods called local classes classes named known anonymous classes anonymous inner classes local class either named anonymous may refer names lexically enclosing classes read-only variables marked codice_39 lexically enclosing method capturing codice_39 variables enables capture variables value even variable want capture non-codice_39 always copy temporary codice_39 variable class capturing variables reference emulated using codice_39 reference mutable container example single-element array local class able change value container reference able change contents container advent java 8 lambda expressions closure causes code executed local classes one types inner class declared within body method java also supports inner classes declared non-static members enclosing class normally referred inner classes defined body enclosing class full access instance variables enclosing class due binding instance variables inner class may instantiated explicit binding instance enclosing class using special syntax upon execution print integers 0 9 beware confuse type class nested class declared way accompanied usage static modifier desired effect instead classes special binding defined enclosing class java 8 java supports functions first class objects lambda expressions form considered type codice_77 domain u image type expression called codice_78 method standard method call apple introduced blocks form closure nonstandard extension c c++ objective-c 2.0 mac os x 10.6 snow leopard ios 4.0 apple made implementation available gcc clang compilers pointers block block literals marked codice_52 normal local variables captured value block created read-only inside block variables captured reference marked codice_80 blocks need persist outside scope created may need copied c sharp programming language |c anonymous methods lambda expressions support closure visual basic .net many language features similar c also supports lambda expressions closures programming language |d closures implemented delegates function pointer paired context pointer e.g class instance stack frame heap case closures version 1 limited closure support example code work correctly variable stack returning test longer valid use probably calling foo via dg return 'random integer solved explicitly allocating variable heap using structs class store needed closed variables construct delegate method implementing code closures passed functions long used referenced values still valid example calling another function closure callback parameter useful writing generic data processing code limitation practice often issue limitation fixed version 2 variable automatically allocated heap used inner function delegate function escape current scope via assignment dg return local variables arguments referenced delegates referenced delegates escape current scope remain stack simpler faster heap allocation true inner class methods references function variables c++ enables defining function object overloading codice_81 objects behave somewhat like functions functional programming language may created runtime may contain state implicitly capture local variables closures c++11|the 2011 revision c++ language also supports closures type function object constructed automatically special language construct called lambda-expression c++ closure may capture context either storing copies accessed variables members closure object reference latter case closure object escapes scope referenced object invoking codice_81 causes undefined behavior since c++ closures extend lifetime context eiffel programming language |eiffel includes inline agents defining closures inline agent object representing routine defined giving code routine in-line example argument codice_83 agent representing procedure two arguments procedure finds country corresponding coordinates displays whole agent subscribed event type codice_84 certain button whenever instance event type occurs button — user clicked button — procedure executed mouse coordinates passed arguments codice_3 codice_86 main limitation eiffel agents distinguishes closures languages reference local variables enclosing scope design decision helps avoiding ambiguity talking local variable value closure latest value variable value captured agent created codice_87 reference current object analogous codice_88 java features arguments agent accessed within agent body values outer local variables passed providing additional closed operands agent embarcadero c++builder provides reserve word __closure provide pointer method similar syntax function pointer standard c could write pointer function type using following syntax typedef void *tmyfunctionpointer void similar way declare pointer method using following syntax typedef void __closure *tmymethodpointer category programming language concepts category implementation functional programming languages category subroutines category articles example python code category articles example scheme code category articles example javascript code category articles example c++ code category articles example eiffel code category articles example c sharp code category articles example code category articles example objective-c code category articles example java code category articles example ruby code category articles example smalltalk code category articles example haskell code | [
512,
2304,
386,
3462,
7175,
6536,
9225,
8587,
2062,
655,
10510,
3990,
5783,
8854,
2585,
11674,
1947,
10011,
9245,
10395,
1954,
10403,
3876,
10532,
5031,
4777,
5165,
5677,
435,
1715,
1333,
3767,
6074,
9914,
1982,
8262,
7756,
333,
1613,
968... | Validation |
10,582 | 4 | OpenPuff:openpuff openpuff steganography watermarking sometimes abbreviated openpuff puff freeware steganography tool microsoft windows created cosimo oliboni still maintained independent software program notable first steganography tool version 1.01 released december 2004 last revision supports wide range carrier formats openpuff used primarily anonymous asynchronous data sharing advantage steganography cryptography alone messages attract attention plainly visible encrypted messages — matter unbreakable — arouse suspicion may incriminating countries encryption illegal therefore whereas cryptography protects contents message steganography said protect messages communicating parties watermarking action signing file id copyright mark openpuff invisible steganographic way applied supported carrier invisible mark password protected accessible everyone using program openpuff semi-open source program cryptographic algorithms 16 taken aes nessie cryptrec joined unique multi-cryptography algorithm extensive testing performed statistical resistance properties csprng multi-cryptography modules using ent nist diehard test suites provided results taken 64kb 128kb ... 256mb samples security performance steganalysis resistance conflicting trade-offs security vs performance whitening security vs. steganalysis cryptography whitening data carrier injection encrypted whitened small amount hidden data turns big chunk pseudorandom suspicious data carrier injection encodes using non linear covering function takes also original carrier bits input modified carriers need much less change con1 lowering random-like statistical response deceive many steganalysis tests con2 always non-negligible probability detected even hidden stream behaves like “ natural container ” unpredictable side-effects caught flagrante delicto etc. resisting unpredictable attacks also possible even user forced legal physical coercion provide valid password deniable steganography decoy-based technique allows user deny convincingly fact sensitive data hidden user needs provide expendable decoy data would plausibly want keep confidential reveal attacker claiming | [
9289,
4617,
6797,
7983
] | Validation |
10,583 | 2 | Nokia_Nseries:nokia nseries nokia nseries multimedia smartphone tablet product family engineered marketed nokia corporation nseries devices commonly supported multiple high-speed wireless technologies 3g wireless lan digital multimedia services music playback photo/video capture viewing gaming internet services also supported line replaced 2011 nokia lumia line company flagship smartphone portfolio nokia n1 tablet introduced november 2014 revived n prefix marketed 'nseries 27 april 2005 nokia announced new brand multimedia devices press conference mobile phone manufacturers amsterdam first three nseries devices introduced conference consists n70 n90 n91 2 november 2005 nokia announced n71 n80 n92 25 april 2006 nokia announced n72 n73 n93 26 september 2006 nokia announced n75 n95 8 january 2007 nokia announced nokia n76 nokia n77 nokia n93i 29 august 2007 nokia announced n95 8gb n81 n81 8gb 14 november 2007 nokia announced n82 first nokia xenon flash 2008 gsma held barcelona n96 n78 unveiled two new nseries devices revealed end august 2008 nokia n79 nokia n85 december 2 2008 nokia nseries announced nokia n97 february 17 2009 nokia announced nokia n86 8 mp nokia first 8-megapixel phone nokia n8 12-megapixel camera announced april 2010 21 june 2011 nokia showcased nokia n9 based meego os fourth non-symbian nseries device n800 n810 n900 nseries retired replaced lumia year company introduced nokia n1 tablet november 18 2014 marked return n prefix 'nseries branding still absent nokia nseries aimed users looking pack many features possible one device better-than-average cameras often found nseries devices many using higher-quality carl zeiss optics one example video music playback photo viewing capabilities devices resemble standalone portable media devices 2008 recently launched devices gps mp3 player wlan functionality also present numbers describe traits phone exceptions though considering n8x n82 n86 8mp top-of-the-range smartphones advanced cameras clearly 'high-end fellow n9x models first nseries device n90 ran symbian os 8.1 mobile operating system n70 n72 nokia n8 released september 2010 world first phone run symbian^3 first phone nokia featuring 12-megapixel autofocus lens also last nseries phone run symbian os n800 n810 n900 nokia chose use linux-based maemo operating system last nseries mobile phones n9 developer-only n950 released september 2011 maemo merged intel moblin create meego may 2010 nokia opted use meego harmattan 1.2 n9/n950 november 18 2014 nokia announced n1 android 5.0 tablet june nokia connections singapore nokia launched new n9 meego 1.2 harmattan os company calls qt device whole app ui framework written qt also world first pure touch phone buttons home screen great new swipe ui reviews average good phone reviewers liking phone good quality operating system expressing concern fact loses competitors terms specs device expected sold selected regions q3 2011 | [
1537,
8577,
3205,
11655,
9359,
1424,
529,
2449,
8083,
10770,
5143,
2072,
7063,
5274,
5019,
5659,
669,
8472,
11545,
4003,
4132,
6310,
167,
40,
3626,
5290,
10410,
10802,
7220,
821,
823,
5175,
7866,
1083,
1728,
7617,
4291,
7877,
10053,
199,
... | Validation |
10,584 | 9 | Tail_call:tail call computer science tail call subroutine call performed final action procedure tail call might lead subroutine called later call chain subroutine said tail-recursive special case recursion tail recursion tail-end recursion particularly useful often easy handle implementations tail calls implemented without adding new stack frame call stack frame current procedure longer needed replaced frame tail call modified appropriate similar overlay processes function calls program jump called subroutine producing code instead standard call sequence called tail call elimination tail call elimination allows procedure calls tail position implemented efficiently goto statements thus allowing efficient structured programming words guy l. steele general procedure calls may usefully thought goto statements also pass parameters uniformly coded machine code jump instructions programming languages require tail call elimination however functional programming languages tail call elimination often guaranteed language standard allowing tail recursion use similar amount memory equivalent loop special case tail recursive calls function calls may amenable call elimination general tail calls language semantics explicitly support general tail calls compiler often still optimize sibling calls tail calls functions take return types caller function called computer must remember place called return address return location result call complete typically information saved call stack simple list return locations order times call locations describe reached tail calls need remember caller – instead tail call elimination leaves stack alone except possibly function arguments local variables newly-called function return directly original caller tail call n't appear lexically statements source code important calling function return immediately tail call returning tail call result since calling function never get chance anything call optimization performed non-recursive function calls usually optimization saves little time space since many different functions available call dealing recursive mutually recursive functions recursion happens tail calls however stack space number returns saved grow significant since function call directly indirectly creating new call stack frame time tail call elimination often asymptotically reduces stack space requirements linear n constant 1 tail call elimination thus required standard definitions programming languages scheme languages ml family among others scheme language definition formalizes intuitive notion tail position exactly specifying syntactic forms allow results tail context implementations allowing unlimited number tail calls active moment thanks tail call elimination also called 'properly tail-recursive besides space execution efficiency tail call elimination important functional programming idiom known continuation-passing style cps would otherwise quickly run stack space tail call located syntactical end function codice_1 codice_2 calls codice_3 last thing procedure executes returning thus tail position however tail calls necessarily located syntactical end subroutine calls codice_3 codice_5 tail position lies end if-branch respectively even though first one syntactically end codice_6 body code call codice_1 tail position codice_8 tail position either codice_9 codice_10 control must return caller allow inspect modify return value returning following program example scheme written tail recursion style multiplication function tail position compared program assumes applicative-order evaluation inner procedure codice_11 calls last control flow allows interpreter compiler reorganize execution would ordinarily look like efficient variant terms space time reorganization saves space state except calling function address needs saved either stack heap call stack frame codice_11 reused intermediate results storage also means programmer need worry running stack heap space extremely deep recursions typical implementations tail recursive variant substantially faster variant constant factor programmers working functional languages rewrite recursive code tail-recursive take advantage feature often requires addition accumulator argument codice_13 example function cases filtering lists languages full tail recursion may require function previously purely functional written mutates references stored variables tail recursion modulo cons generalization tail recursion optimization introduced david h. d. warren context compilation prolog seen explicitly set language described though named daniel p. friedman david s. wise 1974 lisp compilation technique name suggests applies operation left perform recursive call prepend known value front list returned perform constant number simple data-constructing operations general call would thus tail call save modulo said cons operation prefixing value start list exit recursive call appending value end growing list entry recursive call thus building list side effect implicit accumulator parameter following prolog fragment illustrates concept thus tail recursive translation call transformed first creating new list node setting codice_14 field making tail call pointer node codice_15 field argument filled recursively following fragment defines recursive function c duplicates linked list form function tail-recursive control returns caller recursive call duplicates rest input list even allocate head node duplicating rest would still need plug result recursive call codice_16 field call function almost tail-recursive warren method pushes responsibility filling codice_16 field recursive call thus becomes tail call sentinel head node used simplify code callee appends end growing list rather caller prepend beginning returned list work done way forward list start recursive call proceeds instead backward list end recursive call returned result thus similar accumulating parameter technique turning recursive computation iterative one characteristically technique parent frame created execution call stack tail-recursive callee reuse call frame tail-call optimization present tail-recursive implementation converted explicitly iterative form accumulating loop paper delivered acm conference seattle 1977 guy l. steele summarized debate goto structured programming observed procedure calls tail position procedure best treated direct transfer control called procedure typically eliminating unnecessary stack manipulation operations since tail calls common lisp language procedure calls ubiquitous form optimization considerably reduces cost procedure call compared implementations steele argued poorly implemented procedure calls led artificial perception goto cheap compared procedure call steele argued general procedure calls may usefully thought goto statements also pass parameters uniformly coded machine code jump instructions machine code stack manipulation instructions considered optimization rather vice versa steele cited evidence well optimized numerical algorithms lisp could execute faster code produced then-available commercial fortran compilers cost procedure call lisp much lower scheme lisp dialect developed steele gerald jay sussman tail call elimination guaranteed implemented interpreter tail recursion important high-level languages especially functional logic languages members lisp family languages tail recursion commonly used way sometimes way available implementing iteration language specification scheme requires tail calls optimized grow stack tail calls made explicitly perl variant goto statement takes function name codice_18 however language implementations store function arguments local variables call stack default implementation many languages least systems hardware stack x86 implementing generalized tail call optimization presents issue size callee activation record different caller additional cleanup resizing stack frame may required cases optimizing tail recursion remains trivial general tail call optimization may harder implement efficiently example java virtual machine jvm tail-recursive calls eliminated reuses existing call stack general tail calls changes call stack result functional languages scala target jvm efficiently implement direct tail recursion mutual tail recursion gcc llvm/clang intel compiler suites perform tail call optimization c languages higher optimization levels codice_19 option passed though given language syntax may explicitly support compiler make optimization whenever determine return types caller callee equivalent argument types passed function either require amount total storage space call stack various implementation methods available tail calls often optimized interpreters compilers functional programming logic programming languages efficient forms iteration example scheme programmers commonly express loops calls procedures tail position rely scheme compiler interpreter substitute tail calls efficient jump instructions compilers generating assembly directly tail call elimination easy suffices replace call opcode jump one fixing parameters stack compiler perspective first example initially translated pseudo-assembly language fact valid x86 assembly tail call elimination replaces last two lines single jump instruction subroutine codice_20 completes return directly return address codice_21 omitting unnecessary codice_22 statement typically subroutines called need supplied parameters generated code thus needs make sure call frame properly set jumping tail-called subroutine instance platforms call stack contain return address also parameters subroutine compiler may need emit instructions adjust call stack platform code codice_23 codice_24 parameters compiler might translate tail call optimizer could change code code efficient terms execution speed use stack space since many scheme compilers use c intermediate target code tail recursion must encoded c without growing stack even c compiler optimize tail calls many implementations achieve using device known trampoline piece code repeatedly calls functions functions entered via trampoline function tail-call another instead calling directly returning result returns address function called call parameters back trampoline called trampoline takes care calling function next specified parameters ensures c stack grow iteration continue indefinitely possible implement trampolines using higher-order functions languages support groovy visual basic .net c using trampoline function calls rather expensive normal c function call least one scheme compiler chicken uses technique first described henry baker unpublished suggestion andrew appel normal c calls used stack size checked every call stack reaches maximum permitted size objects stack garbage-collected using cheney algorithm moving live data separate heap following stack unwound popped program resumes state saved garbage collection baker says appel method avoids making large number small trampoline bounces occasionally jumping empire state building garbage collection ensures mutual tail recursion continue indefinitely however approach requires c function call ever returns since guarantee caller stack frame still exists therefore involves much dramatic internal rewriting program code continuation-passing style tail recursion related control flow operator means transformation following construct transforms preceding x may tuple involving one variable care must taken designing assignment statement x ← bar x dependencies respected one may need introduce auxiliary variables use swap construct general uses tail recursion may related control flow operators break continue following bar baz direct return calls whereas quux quuux involve recursive tail call foo translation given follows | [
2304,
4101,
3462,
8582,
9866,
2062,
2832,
3475,
6933,
8854,
10395,
5663,
1952,
3876,
5031,
4777,
5803,
10796,
10670,
5040,
1715,
692,
2105,
6074,
10043,
2620,
8000,
5059,
6596,
10571,
7889,
7386,
477,
10333,
11490,
10083,
8421,
6502,
487,
... | None |
10,585 | 9 | Data_descriptor:data descriptor computing data descriptor structure containing information describes data data descriptors may used compilers software structure run time languages like ada pl/i hardware structure computers burroughs large systems data descriptors typically used run-time pass argument information called subroutines hp openvms multics system-wide language-independent standards argument descriptors descriptors also used hold information data fully known run-time dynamically allocated array unlike dope vector data descriptor contain address information following descriptor used ibm enterprise pl/i describe character string source array descriptor multics definitions include structure base array information structure dimension multics ran systems 36-bit words | [
1952,
1702,
428,
3443,
6772,
8502,
2936
] | None |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.