node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
2,286 | 4 | Qualified_website_authentication_certificate:qualified website authentication certificate qualified website authentication certificate qwac certificate qualified digital certificate trust services defined eidas regulation enisa report proposed six strategies twelve recommended actions escalated approach targets important aspects detected critical improving website authentication market europe successfully introducing qualified website authentication certificates means increase transparency market different types website authentication certificates domain validated dv organization validated ov extended validation ev another distinction made among types website authentication certificates relates number domains secured certificate single domain wildcard multi domain extended validation certificates offer highest quality terms assurance identity certificate owner among existing types certificate market typically use ev certificate indicated green color β varies browser eidas regulation taken account established market industrial standardization efforts objective create disruption existing initiatives optimize effort qualified providers align eu regulations existing market standards eidas regulation trust services defined electronic services normally provided trust service providers tsps consist electronic signatures electronic seals electronic time stamps electronic registered delivery services website authentication essence eidas regulation provides framework promote website authentication certificates one five trust service defined eidas regulation article 45 sets requirement trust service providers issuing qualified website authentication certificates qualified implies requirements qualified trust service providers qtsps described previous section applicable annex iv defines content qualified certificates website authentication | [
3264,
9394,
5200,
3231
] | None |
2,287 | 8 | Thttpd:thttpd thttpd tiny/turbo/throttling http server open source software web server acme laboratories designed simplicity small execution footprint speed thttpd single-threaded portable compiles cleanly unix-like operating systems including freebsd sunos 4 solaris 2 bsd/os linux osf/1 executable memory size 50 kb used simplified replacement feature-rich servers uniquely suited service high volume requests static dataβfor example image hosting server first thttpd stands variously tiny turbo throttling thttpd bandwidth throttling feature enables server administrator limit maximum bit rate certain types files may transferred example administrator may choose restrict transfer jpeg image files 20 kilobytes per second prevents connection becoming saturated server still responsive heavy load tradeoff file transfer speed reduced thttpd support x-forwarded-for header least 2 public forks thttpd | [
1920,
5506,
4485,
7430,
1937,
7443,
5397,
8350,
7457,
3746,
8994,
11682,
3237,
9125,
7338,
9387,
44,
7983,
10800,
11439,
11189,
823,
6714,
10436,
1991,
11134,
595,
1363,
1747,
3545,
225,
865,
5731,
2404,
4837,
9320,
6379,
9580,
11376,
869... | Test |
2,288 | 2 | Universal_Access:universal access apple universal access component mac os x operating system provides computing abilities people visual impairment hearing impairment physical disability universal access preference pane system preferences application includes four sub-components providing different options settings | [
11521,
2819,
1796,
3719,
4615,
10888,
11402,
9100,
5647,
10512,
1042,
8852,
9109,
1686,
7318,
4888,
3228,
11037,
2207,
1439,
1699,
811,
3371,
5292,
1710,
6700,
7983,
4657,
1074,
8877,
10036,
3766,
2232,
9529,
9912,
11257,
9406,
576,
1729,
... | None |
2,289 | 3 | Hostages_(video_game):hostages video game hostages tactical shooter video game developed published infogrames released acorn electron archimedes atari st amiga apple iigs amstrad cpc bbc micro commodore 64 ms-dos msx nes zx spectrum platforms 1988 game released hostage rescue mission united states operation jupiter france nes port titled rescue embassy mission hostages terrorist group overrun embassy paris player takes control six-man gign team mission free hostages game split two three depending platform distinct sections hostages well received critics game received 5 5 stars dragon computer gaming world gave pc version positive review noting poor joystick keyboard response significant problem otherwise great game compute called hostages one better amiga combat games noting involve aliens swords sequel hostages titled alcatraz released infogrames amiga atari st dos platforms 1992 | [
10862,
9166,
9006
] | Test |
2,290 | 2 | Atari_TOS:atari tos tos operating system also tramiel operating system jack tramiel owner atari corp. time operating system atari st range computers range includes 520st 1040st stf/m/fm ste variants mega st/ste later 32-bit machines tt falcon030 developed using new version tos called multitos allowed multitasking recently users developed tos freemint atari tos operating system debuted atari 520st 1985 tos combines digital research gem gui running top dos-like gemdos features include flat memory model ms-dos-compatible disk format starting tos 1.04 support midi variant scsi called acsi later versions atari tos usually run rom chips contained computer thus local hard drives available home computers almost instant-running os tos booted floppy disks first sts half year st introduced st models started shipping latest version tos rom tos consisted following following extensions tos loaded separately true multitasking directly supported tos allowed six desk accessories loaded system similar tsrs terminate stay resident pcs multitos developed allow tos preemptively multitask tos desktop uses icons represent files devices windows dialog boxes display info desktop file desktop.inf read determine window settings icon placements drive icons otherwise standard default desktop two floppy icons trash icon used later versions use newdesk.inf saving reading desktop configuration executable files identified extensions tos programs gem programs auto boot placing folder named auto tos 1.4 allows gem programs set load automatically install application dialog programs *.ttp extensions environments used auto boot desktop accessories placed root directory default drive loaded automatically atari tos based gemdos uses modified fat12 hard disks fat16 file system major differences fact boot sector need contain ibm compatible jump sequence beginning typically 0xe9 0x 0x 0xeb 0x 0x90 lack tos 1.04 oem identifier compatible pc-based systems fact checksum used mark boot sector executable pc format uses signature word 0x55 0xaa instead executable boot sectors atari platform typically start mc68k jump opcode e.g 0x603c last two byte word must sum rest boot sector big-endian word form 0x1234 order bootable unlike ms-dos gemdos would typically allow disks unusual sector track counts disks 10 even 11 sectors per track 80 formatted tracks uncommon atari community typically safe combination 10 sectors per track 80 tracks used yielding unformatted capacity 800kb many users pushed capacity double density disks 900kb using custom formats gemdos disc file systems read using dos windows 9x tos 4.92 version multitos multitasking version tos format .img designed written rom chip tos 4 rom contains five user-selectable language versions | [
2179,
2181,
6289,
8082,
6675,
10257,
9881,
5663,
2345,
7849,
5293,
7983,
11447,
8136,
9166,
6100,
3797,
4309,
6104,
7269,
5612,
8557,
5359,
10352,
11123,
2811
] | Test |
2,291 | 6 | NetWare_File_System:netware file system computing netware file system nwfs file system based heavily modified version fat used novell netware operating system default file system volumes versions 2.x 4.x default file system sys volume continuing version 5.x novell developed two varieties nwfs novell storage services nss released 1998 superseded nwfs format nwfs on-disk format never publicly documented novell published specifications 32-bit nwfs larger files file system utilized performance feature named turbo fat transparent file compression also supported although significant impact performance file serving every name space requires separate directory entry file maximum number directory entries 16,000,000 two resident name spaces would reduce usable maximum number directory entries 8,000,000 three 5,333,333 16-bit nwfs could handle volumes 256 mib however name-space support dedicated api handle macintosh clients | [
5120,
2564,
6669,
3598,
10257,
9236,
6677,
5142,
8214,
3611,
9249,
9762,
5158,
7225,
11323,
8772,
1109,
4708,
9836,
7789,
9333,
6263,
9335,
9343,
7818,
6797,
654,
2193,
2194,
2197,
2199,
11419,
6309,
1190,
5286,
10405,
5293,
7344,
2230,
5... | Test |
2,292 | 4 | Tcpdump:tcpdump tcpdump common packet analyzer runs command line allows user display tcp/ip packets transmitted received network computer attached distributed bsd license tcpdump free software tcpdump works unix-like operating systems linux solaris freebsd dragonfly bsd netbsd openbsd openwrt macos hp-ux 11i aix systems tcpdump uses libpcap library capture packets port tcpdump windows called windump uses winpcap windows port libpcap tcpdump originally written 1988 van jacobson sally floyd vern paxson steven mccanne time working lawrence berkeley laboratory network research group late 1990s numerous versions tcpdump distributed part various operating systems numerous patches well coordinated michael richardson mcr bill fenner created www.tcpdump.org 1999. tcpdump prints contents network packets read packets network interface card previously created saved packet file tcpdump write packets standard output file also possible use tcpdump specific purpose intercepting displaying communications another user computer user necessary privileges system acting router gateway unencrypted traffic telnet http passes use tcpdump view login ids passwords urls content websites viewed unencrypted information user may optionally apply bpf-based filter limit number packets seen tcpdump renders output usable networks high volume traffic example available capture interfaces linux system unix-like operating systems user must superuser privileges use tcpdump packet capturing mechanisms systems require elevated privileges however -z option may used drop privileges specific unprivileged user capturing set unix-like operating systems packet capturing mechanism configured allow non-privileged users use done superuser privileges required | [
3714,
6797,
5397,
8725,
1304,
6177,
10788,
1064,
1580,
7983,
2045,
823,
8121,
5179,
700,
5181,
6083,
6345,
842,
8653,
9939,
6997,
11221,
7895,
7385,
8922,
9440,
4071,
11112,
8692,
5245
] | None |
2,293 | 3 | PhyreEngine:phyreengine phyreengine free use game engine sony interactive entertainment despite origins sony compatible playstation platforms support playstation 4 playstation 3 playstation vr playstation vita playstation portable microsoft windows opengl directx 11 google android apple ios phyreengine adopted several game studios used 200 published titles phyreengine distributed installable package includes full source code microsoft windows tools provided flexible use license allows playstation 3 game developer publisher tools middleware company create software based partly fully phyreengine platform engine uses sophisticated parallel processing techniques optimized synergistic processor unit spu cell broadband engine ps3 easily ported multi-core architectures phyreengine supports opengl direct3d addition low level ps3 libgcm library provides fully functional β game templates β source code including support havok complete xs nvidia physx bullet physics development phyreengine started 2003 create graphics engine playstation 3 first public demonstration occurred 2006 phyreengine launched gdc 2008 phyreengine finalist european develop industry excellence awards 2008 technical innovation category 2009 game engine category new features including deferred rendering showcased gdc 2009 version 2.40 released march 2009 included new β foliage rendering β system provides tools technology render ultra-realistic trees plants easily integrated games psp version engine announced sony gdc 2010 version 3.0 released 2011 new powerful asset pipeline combining enhanced versions already robust exporters powerful processing tool generate optimized assets platform also new rewritten level editor permits far data-driven approach authoring games using phyreengine version 3.0 phyreengine adds support playstation vita | [
9472,
643,
8454,
8071,
2826,
3210,
6797,
5914,
6311,
11306,
684,
7983,
306,
11700,
6072,
8122,
1985,
3025,
6738,
4182,
5083,
859,
9691,
9445,
8937,
4587,
6004,
6900,
1784,
1916,
6909
] | Validation |
2,294 | 2 | Network_scheduler:network scheduler network scheduler also called packet scheduler queueing discipline qdisc queueing algorithm arbiter node packet switching communication network manages sequence network packets transmit receive queues network interface controller several network schedulers available different operating systems implement many existing network scheduling algorithms network scheduler logic decides network packet forward next network scheduler associated queuing system storing network packets temporarily transmitted systems may single multiple queues case may hold packets one flow classification priority cases may possible schedule transmissions within constraints system cases network scheduler responsible deciding traffic forward gets dropped course time many network queueing disciplines developed provides specific reordering dropping network packets inside various transmit receive buffers queuing disciplines commonly used attempts compensate various networking conditions like reducing latency certain classes network packets generally used part quality service qos measures examples algorithms suitable managing network traffic include several implemented linux kernel modules freely available bufferbloat phenomenon packet-switched networks excess buffering packets causes high latency packet delay variation bufferbloat addressed network scheduler strategically discards packets avoid unnecessarily high buffering backlog examples include codel random early detection network scheduler may responsibility implementation specific network traffic control initiatives network traffic control umbrella term measures aimed reducing congest latency packet loss specifically active queue management aqm selective dropping queued network packets achieve larger goal preventing excessive network congestion scheduler must choose packets drop traffic shaping smooths bandwidth requirements traffic flows delaying transmission packets queued bursts scheduler decides timing transmitted packets quality service prioritization traffic based service class differentiated services reserved connection integrated services linux kernel packet scheduler integral part linux kernel network stack manages transmit receive ring buffers nics working layer 2 osi model handling ethernet frames example packet scheduler configured using utility called codice_1 short traffic control default queuing discipline packet scheduler uses fifo implementation called pfifo_fast although systemd since version 217 changes default queuing discipline fq_codel codice_2 codice_3 utilities enable system administrators configure buffer sizes codice_4 codice_5 device separately terms number ethernet frames regardless size linux kernel network stack contains several buffers managed network scheduler berkeley packet filter filters attached packet scheduler classifiers ebpf functionality brought version 4.1 linux kernel 2015 extends classic bpf programmable classifiers ebpf compiled using llvm ebpf backend loaded running kernel using codice_1 utility altq implementation network scheduler bsds openbsd version 5.5 altq replaced hfsc scheduler | [
1541,
4616,
9224,
3082,
10785,
6180,
8242,
4161,
8772,
6213,
8262,
8268,
589,
593,
6244,
7780,
5222,
10856,
4207,
3698,
119,
5244,
5245,
4734,
11391,
9345,
7821,
4238,
5774,
10382,
2711,
6808,
9882,
10909,
1694,
2723,
8364,
10933,
7865,
5... | Test |
2,295 | 1 | Standard_database_management_analysis:standard database management analysis standard database management analysis | [
2901
] | Test |
2,296 | 9 | XProc:xproc xproc w3c recommendation define xml transformation language define xml pipelines example abbreviated xproc file pipeline consists two atomic steps xinclude validate pipeline three inputs β source β source document β schemas β list w3c xml schemas β parameters β passing parameters xinclude step reads pipeline input β source β produces result document validate step reads pipeline input β schemas β output xinclude step produces result document result validation β result β result pipeline equivalent less abbreviated xproc pipeline | [
11650,
8070,
7943,
5907,
10910,
7455,
4768,
10791,
5677,
3921,
10453,
8923,
479,
6629,
124,
10611,
4213,
502,
6775,
10486,
508
] | Test |
2,297 | 9 | JLab:jlab jlab numerical computational environment implemented java main scripting engine jlab groovysci extension groovy additionally interpreted j-scripts similar matlab dynamic linking java class code supported jlab environment aims provide matlab/scilab like scientific computing platform supported scripting engines implemented java language current implementation jlab coexist two scripting engines | [
8262,
6074,
5677,
7326
] | Test |
2,298 | 8 | Web_annotation:web annotation web annotation online annotation associated web resource typically web page web annotation system user add modify remove information web resource without modifying resource annotations thought layer top existing resource annotation layer usually visible users share annotation system cases web annotation tool type social software tool web-based text annotation systems see text annotation web annotation used following purposes annotations considered additional layer respect comments comments published publisher hosts original document annotations added top may eventually become comments turn may integrated version document web annotations first standardised february 23 2017 release three official recommendations w3c web annotation working group w3c also previous web annotation standardisation effort annotea see conceived part semantic web many systems require software installed enable features fact noted footnotes software required additional software provided third party | [
8627,
8084,
5078,
3462
] | Validation |
2,299 | 4 | SYN_flood:syn flood syn flood form denial-of-service attack attacker sends succession codice_1 requests target system attempt consume enough server resources make system unresponsive legitimate traffic normally client attempts start tcp connection server client server exchange series messages normally runs like called tcp three-way handshake foundation every connection established using tcp protocol syn flood attack works responding server expected codice_4 code malicious client either simply send expected codice_4 spoofing source ip address codice_1 causing server send codice_3 falsified ip address β send codice_4 knows never sent codice_1 server wait acknowledgement time simple network congestion could also cause missing codice_4 however attack half-open connections created malicious client bind resources server may eventually exceed resources available server point server connect clients whether legitimate otherwise effectively denies service legitimate clients systems may also malfunction crash operating system functions starved resources way number well-known countermeasures listed rfc 4987 including | [
2947,
4490,
4495,
5402,
9372,
10924,
953,
7102,
3006,
6080,
8770,
9282,
3024,
3282,
10852,
2409,
4074,
4725,
6394
] | Test |
2,300 | 4 | Lucideus:lucideus lucideus enterprise cyber security platforms company incubated iit bombay backed cisco former chairman ceo john chambers protects multiple fortune 500 companies governments around world name lucideus derived lucifer satan deus god business hacking good company offers safe security assessment framework enterprise artificial intelligence machine learning platform used cyber-security risk analysis mitigation lucideus worked university delhi year-long postgraduate diploma course cyber security also signed r partnership agreements ground research cyber security technion university mit 2012 saket modi computer science engineer founded lucideus along co-founders vidit baxi rahul tyagi gathered together team security professionals started company objective providing cyber security training beginning 2013 lucideus launched range enterprise cyber security services company today works actively areas 2017 lucideus launched cyber risk assessment platform safe safe security assessment framework enterprises integrates existing technology stack enterprise provide real-time cyber risk assessment score number 0-5 macro level across organisation broken micro-level scoring safe score individually asset safe security assessment framework enterprise de-jargonizes cyber security understanding providing β one β number standard 0 5 estimates overall cyber health organisation takes account controls across people process technology lucideus aims make cyber risk informed business decision allow security team communicate non tech specialists cxos business unit leaders board cyber security posture enterprise lucideus pure-play cyber security services platforms provider builds delivers information security services generic customised pro actively secure continuously monitor re-actively respond cyber threats technology stack one companies 100 oscp offensive security certified professional certified delivery team enterprise cyber security services follows proactive continuous reactive approach security lucideus responsible security assessment applications built national payments corporation india bharat interface money bhim payment app november 2018 lucideus announced series funding 5m led john chambers | [
3941,
7503,
4081,
6834,
4062,
575
] | Validation |
2,301 | 2 | COSIX:cosix cosix chinese unix operating system developed since 1989 china national computer software technology service corporation cs jointly developed 64-bit version compaq released 1999 early version cosix kernel developed based unix system v 64-bit version based tru64 unix linux distribution named cosix linux developed cs released 1999 technical relationship cosix | [
6787,
6412,
5397,
1304,
3487,
3241,
7983,
3248,
2995,
9141,
823,
9784,
9151,
10436,
6369,
6760,
5492,
2424,
633
] | Test |
2,302 | 3 | Branch_Queue:branch queue computer architecture branch predictions branch queue takes place branch predictor predicts branch taken branch queue stores predictions used later branch queue consists 2 values taken taken branch queue helps algorithms increase parallelism optimization software implemented hardware one falls hardware software co-design | [
9932,
8231
] | None |
2,303 | 2 | EOS_(operating_system):eos operating system eos discontinued operating system developed eta systems spin-off division control data corporation use eta10 line supercomputers 1980s eos preceded binary executable compatible cdc vsos operating system cyber 205 like vsos eos demand paged virtual memory vs part 2 pages sizes improved virtual memory performance eta faster hardware pipelines though roots interactive livermore time sharing system ltss vsos focused batch-oriented operating system vsos run many institutions application-oriented performance historic focus supercomputing set features behind times limited user base address feature deficiency make operating system normal use vsos characteristics married unix characteristics hybrid os os intended effective batch work drove hardware maximum interactive use development unix workstation eos written mainly cybil pascal-like programming language created control data later cyber operating systems new effort vsos implemented impl fortran-like language created ltss implementation command line appearance systems similar lineage going back univac exec*8 eos released early hardware deliveries typical problems early os releases customers delayed payment supercomputer installations eta later released port unix eta-10 line quickly accepted customer base however port started single-processor kernel transparently exploit hardware architecture 8 large application cpus applications | [
673,
2179,
7173,
8262,
11205,
1480,
7497,
8524,
7983,
1776,
5363,
5492,
6675,
11539,
3960,
11517,
2045
] | Validation |
2,304 | 2 | Garbage_collection_(computer_science):garbage collection computer science computer science garbage collection gc form automatic memory management garbage collector collector attempts reclaim garbage memory occupied objects longer use program garbage collection invented john mccarthy around 1959 simplify manual memory management lisp garbage collection essentially opposite manual memory management requires programmer specify objects deallocate return memory system however many systems use combination approaches including techniques stack allocation region inference like memory management techniques garbage collection may take significant proportion total processing time program result significant influence performance good implementations enough memory depending application garbage collection faster manual memory management opposite also true often case past sub-optimal gc algorithms resources memory network sockets database handles user interaction windows file device descriptors typically handled garbage collection methods used manage resources particularly destructors may suffice manage memory well leaving need gc gc systems allow resources associated region memory collected causes resource reclaimed called finalization finalization may introduce complications limiting usability intolerable latency disuse reclaim especially limited resources lack control thread performs work reclaiming basic principles garbage collection find data objects program accessed future reclaim resources used objects many programming languages require garbage collection either part language specification example java c go scripting languages effectively practical implementation example formal languages like lambda calculus said garbage collected languages languages designed use manual memory management garbage-collected implementations available example c c++ languages like ada modula-3 c++/cli allow garbage collection manual memory management co-exist application using separate heaps collected manually managed objects others like garbage-collected allow user manually delete objects also entirely disable garbage collection speed required integrating garbage collection language compiler runtime system enables much wider choice methods post-hoc gc systems exist automatic reference counting arc including require recompilation post-hoc gc sometimes distinguished litter collection garbage collector almost always closely integrated memory allocator garbage collection frees programmer manually dealing memory deallocation result certain categories bugs eliminated substantially reduced bugs addressed garbage collection security implications typically garbage collection certain disadvantages including consuming additional resources performance impacts possible stalls program execution incompatibility manual resource management garbage collection consumes computing resources deciding memory free even though programmer may already known information penalty convenience annotating object lifetime manually source code overhead lead decreased uneven performance peer-reviewed paper came conclusion gc needs five times memory compensate overhead perform fast explicit memory management interaction memory hierarchy effects make overhead intolerable circumstances hard predict detect routine testing impact performance also given apple reason adopting garbage collection ios despite desired feature moment garbage actually collected unpredictable resulting stalls pauses shift/free memory scattered throughout session unpredictable stalls unacceptable real-time environments transaction processing interactive programs incremental concurrent real-time garbage collectors address problems varying trade-offs modern gc implementations try minimize blocking stop-the-world stalls much work possible background i.e separate thread example marking unreachable garbage instances application process continues run spite advancements example .net clr paradigm still difficult maintain large heaps millions objects resident objects get promoted older generations without incurring noticeable delays sometimes seconds need explicit manual resource management release/close non-gced resources object oriented language becomes transitive composition non-deterministic gc system resource resource-like object requires manual resource management release/close object used part another object composed object also become resource-like object requires manual resource management release/close tracing garbage collection common type garbage collection much garbage collection often refers tracing garbage collection rather methods reference counting overall strategy consists determining objects garbage collected tracing objects reachable chain references certain root objects considering rest garbage collecting however large number algorithms used implementation widely varying complexity performance characteristics reference counting garbage collection object count number references garbage identified reference count zero object reference count incremented reference created decremented reference destroyed count reaches zero object memory reclaimed manual memory management unlike tracing garbage collection reference counting guarantees objects destroyed soon last reference destroyed usually accesses memory either cpu caches objects freed directly pointed thus tends significant negative side effects cpu cache virtual memory operation number disadvantages reference counting generally solved mitigated sophisticated algorithms escape analysis compile-time technique convert heap allocations stack allocations thereby reducing amount garbage collection done analysis determines whether object allocated inside function accessible outside function-local allocation found accessible another function thread allocation said β escape β done stack otherwise object may allocated directly stack released function returns bypassing heap associated memory management costs generally speaking higher-level programming languages likely garbage collection standard feature languages built garbage collection added library boehm garbage collector c c++ functional programming languages ml haskell apl garbage collection built lisp especially notable first functional programming language first language introduce garbage collection dynamic languages ruby julia perl 5 php version 5.3 use reference counting javascript ecmascript also tend use gc object-oriented programming languages smalltalk java usually provide integrated garbage collection notable exceptions c++ delphi destructors historically languages intended beginners basic logo often used garbage collection heap-allocated variable-length data types strings lists burden programmers manual memory management early microcomputers limited memory slow processors basic garbage collection could often cause apparently random inexplicable pauses midst program operation basic interpreters applesoft basic apple ii family repeatedly scanned string descriptors string highest address order compact toward high memory resulting n performance could introduce minutes-long pauses execution string-intensive programs replacement garbage collector applesoft basic published call-a.p.p.l.e january 1981 pages 40β45 randy wigginton identified group strings every pass heap cut collection time dramatically basic.system released prodos 1983 provided windowing garbage collector basic reduced collections fraction second objective-c traditionally garbage collection release os x 10.5 2007 apple introduced garbage collection objective-c 2.0 using in-house developed runtime collector however 2012 release os x 10.8 garbage collection deprecated favor llvm automatic reference counter arc introduced os x 10.7 furthermore since may 2015 apple even forbids usage garbage collection new os x applications app store ios garbage collection never introduced due problems application responsivity performance instead ios uses arc garbage collection rarely used embedded real-time systems perceived need tight control use limited resources however garbage collectors compatible limited environments developed microsoft .net micro framework .net nanoframework java platform micro edition embedded software platforms like larger cousins include garbage collection among popular garbage collectors jdk could named commonly people compare garbage collectors terms ram consumption optimization receive different results compile-time garbage collection form static analysis allowing memory reused reclaimed based invariants known compilation form garbage collection studied mercury programming language saw greater usage introduction llvm automatic reference counter arc apple ecosystem ios os x 2011 incremental concurrent real-time garbage collectors developed baker algorithm lieberman algorithm baker algorithm allocation done either half single region memory becomes half full garbage collection performed moves live objects half remaining objects implicitly deallocated running program 'mutator check object references correct half move across background task finding objects generational garbage collection schemes based empirical observation objects die young generational garbage collection two allocation regions generations kept kept separate based object age new objects created young generation regularly collected generation full objects still referenced older regions copied next oldest generation occasionally full scan performed high-level language computer architectures include hardware support real-time garbage collection implementations real-time garbage collectors use tracing real-time garbage collectors meet hard real-time constraints used real-time operating system | [
10752,
10755,
11269,
2062,
9231,
9749,
8728,
4633,
5658,
541,
3102,
31,
9245,
7713,
8226,
10783,
5165,
5677,
9780,
11317,
566,
2105,
9275,
6717,
6718,
8767,
2625,
8771,
7237,
8262,
6730,
1613,
6221,
9299,
6228,
86,
8280,
3675,
8289,
6242,... | Test |
2,305 | 4 | Honeytoken:honeytoken field computer security honeytokens honeypots computer systems value lies use abuse generalization ideas honeypot canary values often used stack protection schemes honeytokens necessarily prevent tampering data instead give administrator measure confidence data integrity honeytokens fictitious words records added legitimate databases allow administrators track data situations would n't normally able track cloud based networks data stolen honey tokens allow administrators identify stolen leaked three locations medical records different honey tokens form fake medical records could added location different honeytoken would set records chosen unique unlikely ever appear legitimate traffic also detected network intrusion-detection system ids alerting system administrator things would otherwise go unnoticed one case go beyond merely ensuring integrity reactive security mechanisms may actually prevent malicious activity e.g dropping packets containing honeytoken router however mechanisms pitfalls might cause serious problems honeytoken poorly chosen appeared otherwise legitimate network traffic dropped term first coined augusto paes de barros 2003 honeytokens exist many forms dead fake account database entry would selected malicious queries making concept ideally suited ensuring data integrity particular example honeytoken fake email address used track mailing list stolen | [
1544,
9256,
5245,
2558
] | Validation |
2,306 | 5 | AX.25:ax.25 ax.25 amateur x.25 data link layer protocol originally derived layer 2 x.25 protocol suite designed use amateur radio operators used extensively amateur packet radio networks ax.25 v2.0 later occupies data link layer second layer osi model responsible establishing link-layer connections transferring data encapsulated frames nodes detecting errors introduced communications channel ax.25 pre-osi-model protocol original specification written cleanly separate osi layers rectified version 2.0 1984 assumes compliance osi level 2 ax.25 commonly used data link layer network layer ipv4 tcp used top ax.25 supports limited form source routing although possible build ax.25 switches similar way ethernet switches work yet accomplished ax.25 define physical layer implementation practice 1200 baud bell 202 tones 9600 baud g3ruh dfsk almost exclusively used vhf uhf hf standard transmission mode 300 baud bell 103 tones although little use ax.25 hf exists today physical layer ax.25 defines physical layer state machine timers related transmitter receiver switching delays link layer ax.25 uses hdlc frame syntax procedures iso 3309 frames transmitted nrzi encoding hdlc specifies syntax semantics variable-length address field frame ax.25 specifies field subdivided multiple addresses source address zero repeater addresses destination address embedded control fields use repeaters simplify compliance amateur radio rules addresses derive station call signs source destination repeater stations media access control follows carrier sense multiple access approach collision recovery csma/cr ax.25 supports virtual-circuit connected datagram-style connectionless modes operation latter used great effect automatic packet reporting system aprs simple source routing mechanism using digipeaters available datalink level digipeaters act simplex repeaters receiving decoding retransmitting packets local stations allow multi-hop connections established two stations unable communicate directly digipeaters use modify information frame address field perform function ax.25 specification defines complete albeit point point network layer protocol seen little use outside keyboard-to-keyboard keyboard-to-bbs connections net/rom rose texnet exist provide routing nodes principle variety layer 3 protocols used ax.25 including ubiquitous internet protocol approach used amprnet amateur radio tcp/ip network using ax.25 ui-frames datalink layer traditionally amateur radio operators connected ax.25 networks use terminal node controller contains microprocessor implementation protocol firmware devices allow network resources accessed using dumb terminal transceiver ax.25 also implemented personal computers example linux kernel includes native support ax.25 computer connects tranceiver via audio interface via simple modem computers also interconnect computers bridged routed tncs tranceivers located elsewhere using bpq ethernet framing also natively supported linux kernel facilitate modern setups actual tranceivers directly placed antenna mast creating 'low loss shorter rf wiring need replacing expensive long thick coax cables amplifiers cheap fiber rfi ways /emp/lightning resistant copper ethernet wiring bpq ethernet framing allows connect entire stacks tnc+tranceiver pairs existing network computers access radio links offered simulaniously transparently bridged communicate internally ax.25 filtered routing select specific tncs/radio frequencies note linux kernel ax.25 implementation contain bugs mainly disconnecting sessions bug appears slipped time due maintenance people using exclusively aprs virtual channel connected mode example tap interfaces supporting full 7 bytes call sign string length interface drivers expect 6 byte hw address mac up-to-7 byte one like ax.25 use requires ax.25 often used tnc implements kiss framing low-cost alternative using expensive uncommon hdlc controller cards kiss framing part ax.25 protocol sent air merely serves encapsulate protocol frames way successfully pass serial link tnc kiss framing derived slip makes many assumptions two endpoints involved conversation slip two slip-connected hosts kiss assumed kiss framing link serial host computer pc involved among things makes awkward address multiple tncs without multiple serial data channels alternatives kiss exist address limitations 6pack ax.25 frequently used establish direct point-to-point links packet radio stations without additional network layers sufficient keyboard-to-keyboard contacts stations accessing local bulletin board systems dx clusters recent years aprs become popular application tunneling ax.25 packets ip axip axudp used encapsulate ax.25 ip udp packets speeds commonly used transmit packet radio data rarely higher 9,600 bit/s typically 1,200 bit/s use additional network layers ax.25 impractical due data overhead involved limitation ax.25 per se places constraints sophistication applications designed use hdlc protocols identify frame address ax.25 implementation hdlc includes sender destination station call-sign plus ssid value range 0 15 frame address itu warc2003 radio amateur station callsign specification amended earlier maximum length six characters raised seven characters however ax.25 built-in hard limit six characters means seven-character callsign used ax.25 network ax.25 lacks explicit port sap ssid often assumes role thus one service per ax.25 station ssid address often kludged around varying degrees success amateurs notably phil karn ka9q argued ax.25 well-suited operation noisy limited-bandwidth radio links citing lack forward error correction fec automatic data compression however viable widely adopted successor ax.25 yet emerge likely reasons may include despite limitations extension ax.25 protocol supporting forward error correction created tapr extension called fx.25 small gadget transmitters need know transmitted need monitor channel occupation radio receiver rssi received signal strength indication know send transmitting interleaved reed-solomon fec signal smart modulation needs lot fewer resources reception signal thus sufficient microprocessor might cost usd 5 instead usd 30 system cost might stay us 50 transmitter included however recent years ability receive well send using cheap microcontrollers atmel avr motorola 68hc08 families demonstrated seems however new system compatible current bell 202 modulation unlikely widely adopted current modulation seems fulfill sufficient need little motivation exists move superior design especially new design requires significant hardware purchases | [
10112,
388,
8708,
3847,
6152,
9868,
2701,
11413,
2968,
11288,
2458,
5020,
1192,
11560,
682,
3115,
7723,
11181,
7865,
4543,
7490,
9284,
5321,
7498,
2911,
2912,
2785,
5472,
5092,
5863,
2920,
4335,
2802
] | Test |
2,307 | 9 | ECLR-attributed_grammar:eclr-attributed grammar eclr-attributed grammars special type attribute grammars variant lr-attributed grammars equivalence relation inherited attributes used optimize attribute evaluation ec stands equivalence class rie based eclr-attributed grammars superset lr-attributed grammars | [
2256,
7634
] | Test |
2,308 | 2 | HP_Veer:hp veer veer smartphone announced hp february 9 2011 device uses hp webos powered qualcomm snapdragon processor 2.6-inch screen smartphone notable credit card-sized dimensions depth comparable size deck cards device seen successor palm line-up pixi earlier centro models hp veer announced february 9 2011 along hp pre 3 hp touchpad veer released us may 15 2011 network marketed hp veer 4g device slated support touch-to-share proximity-based sharing feature later update official update supporting touch-to-share released although several users purchased devices ebay fully implemented touch-to-share sms sharing support following hp announcement august 18 would cease development webos hardware veer discontinued similar touchpad price lowered significantly firesale hp veer powered qualcomm snapdragon msm7230 system-on-a-chip made qualcomm based 45 nanometer cmos process veer snapdragon composed principally scorpion cpu running 800mhz adreno 205 gpu digital signal processor cellular transmission/reception/processing gsm umts gpsone gps module audio subsystem scorpion core implements armv7 architecture similar arm cortex-a8 supports arm neon instruction set extensions vfpv3 floating-point extensions referred β venum β media processing engine scorpion accelerate example image processing camera main purpose venum engine boost performance scorpion cpu multimedia processing resulting power saving task completed faster less power consumed processor venum media processing engine one without adreno 205 gpu supports opengl es 2.0 opengl es 1.1 openvg 1.1 egl 1.3 direct3d mobile svgt 1.2 directdraw hp veer 66 mm 2.6 inch capacitive touchscreen resolution 320 x 400 pixel touchscreen designed bare finger multiple fingers multi-touch sensing accelerometer allows orientation screen change portrait landscape mode proximity sensor deactivates display touchscreen device brought near face call slide-out 4-row qwerty keyboard microphone located slide-out keyboard left side device volume button upper right side power button top side ringer switch vibration mode usb 3.5 mm connectivities provided proprietary magnetic connector battery rated 910 mah non-removable hp states provides 5.0 hours talk time 300 hours standby time 8 gb board 6.5 gb available user microsd card socket veer shipped either webos 2.1.1 2.1.2 depending region seen official update since following pre-installed applications | [
1537,
3585,
10500,
6790,
9863,
5384,
3340,
1682,
2962,
405,
3606,
8982,
10393,
5019,
6178,
5164,
7983,
9266,
9013,
694,
11062,
1849,
9913,
1728,
7492,
10820,
5318,
11337,
5963,
9163,
9037,
2258,
2259,
1621,
6618,
5339,
2784,
4449,
4832,
3... | None |
2,309 | 4 | RootkitRevealer:rootkitrevealer rootkitrevealer proprietary freeware tool rootkit detection microsoft windows bryce cogswell mark russinovich runs windows xp windows server 2003 32-bit-versions output lists windows registry file system api discrepancies may indicate presence rootkit tool triggered sony bmg copy protection rootkit scandal rootkitrevealer longer developed | [
5380,
1417,
2443,
6797,
9488,
537,
3482,
5799,
5673,
7983,
7473,
9791,
5057,
10828,
10448,
5082,
9695,
3935,
4074,
11248
] | Test |
2,310 | 2 | Rpmdrake:rpmdrake rpmdrake graphical interface urpmi permits installation software packages provided part mandriva linux mageia rosa package installation application written gtk2-perl allows rpmdrake free software available gnu general public license version 2. urpmi developed guillaume cottenceau rafael garcia-suarez thierry vignaud first mandriva mageia see | [
11525,
10760,
2955,
7435,
7181,
7947,
2448,
1813,
6680,
8476,
5670,
4775,
7847,
6828,
6446,
1455,
7983,
1842,
823,
2872,
6583,
3131,
10172,
3649,
10817,
9671,
5067,
6227,
4309,
4951,
2010,
9564,
7140,
5096,
4841,
9324,
7920,
2417,
1138,
1... | Test |
2,311 | 1 | Watercraft:watercraft watercraft also known marine vessels waterborne vessels vehicles used water including ships boats hovercraft submarines watercraft usually propulsive capability whether sail oar paddle engine hence distinct simple device merely floats log raft watercraft would described either ship boat however numerous craft many people would consider neither ship boat surfboards used paddle board underwater robots seaplanes torpedoes although ships typically larger boats distinction two categories one size per se term watercraft unlike terms aircraft spacecraft rarely used describe individual object rather term serves unify category ranges jet skis aircraft carriers vessel may used saltwater freshwater pleasure recreation physical exercise commerce transport military missions usually purposes behind watercraft designs skills seafaring education leisure activities fishing resource extraction transportation cargo passengers conducting combat salvage operations general purpose water vehicle identifies utility maritime industry sub-sector design water vehicle created usually seeks achieve balance internal capacity tonnage speed seaworthiness tonnage predominantly consideration transport operations speed important warships safety primary consideration less experienced often smaller less stable training leisure vehicles due great level regulatory compliance required larger watercraft ensures infrequent instances foundering sea application extensive computer modeling ship model basin testing shipyard construction begins historically water vehicles propelled people poles paddles oars manipulation sails propel wind pressure and/or lift variety engineered machinery create subsurface thrust process internal combustion electricity technological history watercraft european history divided reference marine propulsion simple paddle craft oared galleys 8th century bce 15th century lateen sail age discovery early 15th century early 17th century full rigged ships age sail 16th mid 19th century age steam reciprocating marine steam engine roughly 1770 1914 steam turbine later gas turbine internal combustion engines using diesel fuel petrol lng fuels turn 20th century supplemented degree nuclear marine propulsion since 1950s naval watercraft current technological development seeks identify cheaper renewable less polluting sources propulsion watercraft shapes sizes secondary applications technology watercraft used structural materials navigation aids case warships weapon systems purpose usage physical environment define materials used construction historically included grasses leather timbers metals combined timber without silicate plastic derivatives others watercraft registration registration watercraft government authority united states consists alphanumeric string called vessel registration number issued state department motor vehicles navigation aids varied time astronomical observation mechanical mechanisms recently analogue digital computer devices rely gps systems naval weapon systems closely followed development land weapons developing development steam propulsion coupled rapid-firing breech-loading guns naval combat often concluded boarding combat opposing crews since early 20th century substantial development technologies allow force projection naval task force land objective using marine infantry | [
41,
676
] | Test |
2,312 | 4 | Security_log:security log security log used track security-related information computer system examples include according stefan axelsson unix installations run form security logging software mainly security logging facilities expensive terms disk storage processing time cost associated analyzing audit trail either manually special software | [
4640,
6273,
3532,
10604,
8080,
2801
] | None |
2,313 | 2 | Strsafe.h:strsafe.h strsafe.h non-standard c header file provided windows sdk starting windows xp service pack 2 provides safer buffer handling provided standard c string functions widely known security issues involving buffer overruns used correctly functions included strsafe.h replace standard c string handling i/o functions including codice_1 codice_2 codice_3 codice_4 strsafe functions require length string either characters bytes parameter operation would exceed length destination buffer operation fails string still terminated null final valid index using library functions result undefined behavior independent security researchers noted security issues still possible functions strsafe.h passed correct buffer length use library recommended united states department homeland security | [
3708
] | Test |
2,314 | 6 | Clustered_file_system:clustered file system clustered file system file system shared simultaneously mounted multiple servers several approaches clustering employ clustered file system direct attached storage node clustered file systems provide features like location-independent addressing redundancy improve reliability reduce complexity parts cluster parallel file systems type clustered file system spread data across multiple storage nodes usually redundancy performance shared-disk file system uses storage area network san allow multiple computers gain direct disk access block level access control translation file-level operations applications use block-level operations used san must take place client node common type clustered file system shared-disk file system βby adding mechanisms concurrency controlβprovides consistent serializable view file system avoiding corruption unintended data loss even multiple clients try access files time shared-disk file-systems commonly employ sort fencing mechanism prevent data corruption case node failures unfenced device cause data corruption loses communication sister nodes tries access information nodes accessing underlying storage area network may use number block-level protocols including scsi iscsi hyperscsi ata ethernet aoe fibre channel network block device infiniband different architectural approaches shared-disk filesystem distribute file information across servers cluster fully distributed others utilize centralized metadata server achieve result enabling servers access data shared storage device distributed file systems share block level access storage use network protocol commonly known network file systems even though file systems use network send data distributed file systems restrict access file system depending access lists capabilities servers clients depending protocol designed difference distributed file system distributed data store distributed file system allows files accessed using interfaces semantics local files example mounting/unmounting listing directories read/write byte boundaries system native permission model distributed data stores contrast require using different api library different semantics often database distributed file system may also created software implementing ibm distributed data management architecture ddm programs running one computer use local interfaces semantics create manage access files located networked computers client requests trapped converted equivalent messages defined ddm using protocols also defined ddm messages transmitted specified remote computer ddm server program interprets messages uses file system interfaces computer locate interact specified file distributed file systems may aim transparency number aspects aim invisible client programs see system similar local file system behind scenes distributed file system handles locating files transporting data potentially providing features listed incompatible timesharing system used virtual devices transparent inter-machine file system access 1960s file servers developed 1970s 1976 digital equipment corporation created file access listener fal implementation data access protocol part decnet phase ii became first widely used network file system 1985 sun microsystems created file system called network file system nfs became first widely used internet protocol based network file system notable network file systems andrew file system afs apple filing protocol afp netware core protocol ncp server message block smb also known common internet file system cifs 1986 ibm announced client server support distributed data management architecture ddm system/36 system/38 ibm mainframe computers running cics followed support ibm personal computer as/400 ibm mainframe computers mvs vse operating systems flexos ddm also became foundation distributed relational database architecture also known drda many peer-to-peer network protocols open-source distributed file systems cloud closed-source clustered file systems e. g. 9p afs coda cifs/smb dce/dfs lustre panfs google file system mnet chord project network-attached storage nas provides storage file system like shared disk file system top storage area network san nas typically uses file-based protocols opposed block-based protocols san would use nfs popular unix systems smb/cifs server message block/common internet file system used ms windows systems afp used apple macintosh computers ncp used oes novell netware failure disk hardware given storage node cluster create single point failure result data loss unavailability fault tolerance high availability provided data replication one sort another data remains intact available despite failure single piece equipment examples see lists distributed fault-tolerant file systems distributed parallel fault-tolerant file systems common performance measurement clustered file system amount time needed satisfy service requests conventional systems time consists disk-access time small amount cpu-processing time clustered file system remote access additional overhead due distributed structure includes time deliver request server time deliver response client direction cpu overhead running communication protocol software concurrency control becomes issue one person client accessing file block want update hence updates file one client interfere access updates clients problem complex file systems due concurrent overlapping writes different writers write overlapping regions file concurrently problem usually handled concurrency control locking may either built file system provided add-on protocol ibm mainframes 1970s could share physical disks file systems machine channel connection drives control units 1980s digital equipment corporation tops-20 openvms clusters vax/alpha/ia64 included shared disk file systems | [
5120,
2564,
6669,
3598,
10257,
9236,
6677,
5142,
8214,
1049,
3611,
9249,
9762,
5158,
3628,
7225,
7739,
11323,
9277,
8772,
9285,
1109,
5206,
4708,
5220,
8810,
9836,
7789,
9333,
11382,
6263,
9335,
1147,
9343,
7818,
654,
2193,
2194,
6291,
21... | Test |
2,315 | 4 | Keycloak:keycloak keycloak open source software product allow single sign-on identity management access management aimed modern applications services jboss community project stewardship red hat use upstream project rh-sso product conceptual perspective tool intent make easy secure applications services little coding first production release keycloak september 2014 development started year earlier 2016 red hat switched rh sso product based picketlink framework based keycloak upstream project followed merging picketlink codebase keycloak extent keycloak also considered replacement red hat jboss sso open source product previously superseded picketlink jboss.org redirecting old jbosssso subsite keycloak website jboss name registered trade mark red hat moved upstream open source projects names avoid using jboss jboss wildfly commonly recognized example among many features keycloak include 2 main components keycloak | [
3521,
11244,
5677,
9455,
6098,
6651
] | Test |
2,316 | 9 | Context-free_grammar:context-free grammar formal language theory context-free grammar cfg certain type formal grammar set production rules describe possible strings given formal language production rules simple replacements example rule formula_1 replaces formula_2 formula_3 multiple replacement rules given value example formula_1 formula_5 means formula_2 replaced either formula_3 formula_8 context-free grammars rules one-to-one one-to-many one-to-none rules applied regardless context left-hand side production rule always nonterminal symbol means symbol appear resulting formal language case language contains letters formula_3 formula_8 formula_11 rules also applied reverse check whether string grammatically correct according grammar example context-free grammar describes two-letter strings containing letters formula_3 formula_8 formula_14 formula_1 formula_5 start nonterminal symbol formula_17 use rule formula_14 turn formula_17 formula_20 apply one two later rules example apply formula_5 first formula_2 get formula_23 apply formula_1 second formula_2 get formula_26 since formula_3 formula_8 terminal symbols context-free grammars terminal symbols never appear left hand side production rule rules applied process used applying last two rules different orders order get possible strings within simple context-free grammar languages generated context-free grammars known context-free languages cfl different context-free grammars generate context-free language important distinguish properties language intrinsic properties properties particular grammar extrinsic properties language equality question two given context-free grammars generate language undecidable context-free grammars arise linguistics used describe structure sentences words natural language fact invented linguist noam chomsky purpose really lived original expectation contrast computer science use recursively-defined concepts increased used early application grammars used describe structure programming languages newer application used essential part extensible markup language xml called document type definition linguistics authors use term phrase structure grammar refer context-free grammars whereby phrase-structure grammars distinct dependency grammars computer science popular notation context-free grammars backusβnaur form bnf since time pΔαΉini least linguists described grammars languages terms block structure described sentences recursively built smaller phrases eventually individual words word elements essential property block structures logical units never overlap example sentence logically parenthesized logical metasymbols follows context-free grammar provides simple mathematically precise mechanism describing methods phrases natural language built smaller blocks capturing block structure sentences natural way simplicity makes formalism amenable rigorous mathematical study important features natural language syntax agreement reference part context-free grammar basic recursive structure sentences way clauses nest inside clauses way lists adjectives adverbs swallowed nouns verbs described exactly context-free grammars special form semi-thue systems general form date back work axel thue formalism context-free grammars developed mid-1950s noam chomsky also classification special type formal grammar called phrase-structure grammars chomsky called phrase structure grammar also known constituency grammar whereby constituency grammars stand contrast dependency grammars chomsky generative grammar framework syntax natural language described context-free rules combined transformation rules block structure introduced computer programming languages algol project 1957β1960 consequence also featured context-free grammar describe resulting algol syntax became standard feature computer languages notation grammars used concrete descriptions computer languages came known backusβnaur form two members algol language design committee block structure aspect context-free grammars capture fundamental grammar terms syntax grammar often identified context-free grammar rules especially computer science formal constraints captured grammar considered part semantics language context-free grammars simple enough allow construction efficient parsing algorithms given string determine whether generated grammar earley parser example algorithm widely used lr parsers simpler algorithms deal restrictive subsets context-free grammars context-free grammar defined 4-tuple formula_29 production rule formalized mathematically pair formula_32 formula_33 nonterminal formula_34 string variables and/or terminals rather using ordered pair notation production rules usually written using arrow operator left hand side right hand side formula_35 allowed empty string case customary denote Ξ΅ form formula_36 called -production common list right-hand sides left-hand side line using pipe symbol separate rules formula_37 formula_38 hence written formula_39 case formula_40 formula_41 called first second alternative respectively strings formula_42 say directly yields written formula_43 formula_44 formula_33 formula_46 formula_47 formula_48 thus result applying rule formula_49 strings formula_50 say yields written formula_51 formula_52 textbooks formula_53 formula_54 case formula_55 i.e. formula_56 relation formula_57 holds words formula_58 formula_59 reflexive transitive closure allowing word yield transitive closure requiring least one step formula_60 respectively language grammar formula_29 set language said context-free language cfl exists cfg formula_63 non-deterministic pushdown automata recognize exactly context-free languages context-free grammar said proper every context-free grammar effectively transformed weakly equivalent one without unreachable symbols weakly equivalent one without unproductive symbols weakly equivalent one without cycles every context-free grammar producing Ξ΅ effectively transformed weakly equivalent one without Ξ΅-productions altogether every grammar effectively transformed weakly equivalent proper cfg grammar formula_68 productions context-free proper since includes Ξ΅-production typical derivation grammar makes clear formula_69 language context-free however proved regular productions added context-free grammar set palindromes alphabet obtained canonical example context-free grammar parenthesis matching representative general case two terminal symbols one nonterminal symbol s. production rules first rule allows symbol multiply second rule allows symbol become enclosed matching parentheses third rule terminates recursion second canonical example two different kinds matching nested parentheses described productions terminal symbols nonterminal s. following sequence derived grammar context-free grammar pair characters way brackets simplest example grammar generates language formula_70 regular according pumping lemma regular languages special character Ξ΅ stands empty string changing grammar obtain grammar generating language formula_71 instead differs contains empty string original grammar context-free grammar language consisting strings b containing unequal number b nonterminal generate strings number b nonterminal u generates strings b nonterminal v generates strings fewer b omitting third alternative rule u v n't restrict grammar language another example non-regular language formula_72 context-free generated following context-free grammar formation rules terms formulas formal logic fit definition context-free grammar except set symbols may infinite may one start symbol contrast well-formed nested parentheses square brackets previous section context-free grammar generating sequences two different types parentheses separately balanced disregarding two types need nest inside one another example fact language context free proven using pumping lemma context-free languages proof contradiction observing words form formula_73 belong language language belongs instead general class described conjunctive grammar turn also includes non-context-free languages language words form formula_74 every regular grammar context-free context-free grammars regular following context-free grammar however also regular terminals b nonterminal s. language described nonempty strings formula_75s formula_76s end formula_75 grammar regular rule one nonterminal right-hand side nonterminals end right-hand side every regular grammar corresponds directly nondeterministic finite automaton know regular language using pipe symbols grammar described tersely follows derivation string grammar sequence grammar rule applications transform start symbol string derivation proves string belongs grammar language derivation fully determined giving step clarity intermediate string usually given well instance grammar string derived derivation often strategy followed deterministically determines next nonterminal rewrite given strategy derivation completely determined sequence rules applied instance leftmost derivation summarized distinction leftmost derivation rightmost derivation important parsers transformation input defined giving piece code every grammar rule executed whenever rule applied therefore important know whether parser determines leftmost rightmost derivation determines order pieces code executed see example parsers lr parsers derivation also imposes sense hierarchical structure string derived example string 1 1 derived according leftmost derivation structure string would ... indicates substring recognized belonging s. hierarchy also seen tree tree called parse tree concrete syntax tree string contrast abstract syntax tree case presented leftmost rightmost derivations define parse tree however another rightmost derivation string defines following parse tree note however parse trees obtained leftmost rightmost derivations example last tree obtained leftmost derivation follows string language grammar one parsing tree grammar said ambiguous grammar grammars usually hard parse parser always decide grammar rule apply usually ambiguity feature grammar language unambiguous grammar found generates context-free language however certain languages generated ambiguous grammars languages called inherently ambiguous languages context-free grammar syntactically correct infix algebraic expressions variables x z grammar example generate string follows note many choices made underway rewrite going performed next choices look quite arbitrary matter fact sense string finally generated always example second third rewrites could done opposite order also many choices made rule apply selected codice_1 changing choices made order made usually affects terminal string comes end let look detail consider parse tree derivation starting top step step tree expanded unexpanded codice_1es nonterminals remain picking different order expansion produce different derivation parse tree parse tree change pick different rule apply position tree different parse tree still produce terminal string codice_3 case yes particular grammar possible grammars property called ambiguous example codice_4 produced two different parse trees however language described grammar inherently ambiguous alternative unambiguous grammar given language example picking codice_1 start symbol alternative grammar produce codice_4 parse tree similar left one i.e implicitly assuming association codice_7 according standard operator precedence elaborate unambiguous context-free grammars constructed produce parse trees obey desired operator precedence associativity rules every context-free grammar generate empty string transformed one Ξ΅-production rule empty string product grammar generate empty string necessary include rule formula_78 need Ξ΅-rule every context-free grammar Ξ΅-production equivalent grammar chomsky normal form grammar greibach normal form equivalent means two grammars generate language especially simple form production rules chomsky normal form grammars theoretical practical implications instance given context-free grammar one use chomsky normal form construct polynomial-time algorithm decides whether given string language represented grammar cyk algorithm context-free languages closed various operations languages k l context-free result following operations closed general intersection hence neither complementation set difference following decidable problems context-free grammars parsing problem checking whether given word belongs language given context-free grammar decidable using one general-purpose parsing algorithms context-free parsing chomsky normal form grammars shown leslie g. valiant reducible boolean matrix multiplication thus inheriting complexity upper bound n conversely lillian lee shown n boolean matrix multiplication reducible n cfg parsing thus establishing kind lower bound latter decidable whether given non-terminal context-free grammar reachable whether productive whether nullable derive empty string decidable whether given grammar regular grammar well whether k grammar given k β₯0 k given latter problem undecidable given context-free language neither decidable whether regular whether k language given k algorithms decide whether language given context-free language empty well whether finite questions undecidable wider classes grammars become decidable context-free grammars e.g emptiness problem whether grammar generates terminal strings undecidable context-sensitive grammars decidable context-free grammars however many problems undecidable even context-free grammars examples given cfg generate language strings alphabet terminal symbols used rules reduction demonstrated problem well-known undecidable problem determining whether turing machine accepts particular input halting problem reduction uses concept computation history string describing entire computation turing machine cfg constructed generates strings accepting computation histories particular turing machine particular input thus accept strings machine n't accept input given two cfgs generate language undecidability problem direct consequence previous impossible even decide whether cfg equivalent trivial cfg defining language strings given two cfgs first one generate strings second one generate problem decidable language equality could decided two cfgs g1 g2 generate language l g1 subset l g2 l g2 subset l g1 using greibach theorem shown two following problems undecidable given cfg ambiguous undecidability problem follows fact algorithm determine ambiguity existed post correspondence problem could decided known undecidable given two cfgs string derivable grammars problem decidable undecidable post correspondence problem could decided given strings formula_79 alphabet formula_80 let grammar consist rule formula_82 denotes reversed string formula_83 formula_76 n't occur among formula_85 let grammar consist rule post problem given formula_79 solution share derivable string obvious way extend context-free grammar formalism allow nonterminals arguments values passed along within rules allows natural language features agreement reference programming language analogs correct use definition identifiers expressed natural way e.g easily express english sentences subject verb must agree number computer science examples approach include affix grammars attribute grammars indexed grammars van wijngaarden two-level grammars similar extensions exist linguistics extended context-free grammar regular right part grammar one right-hand side production rules allowed regular expression grammar terminals nonterminals extended context-free grammars describe exactly context-free languages another extension allow additional terminal symbols appear left-hand side rules constraining application produces formalism context-sensitive grammars number important subclasses context-free grammars lr parsing extends parsing support larger range grammars turn generalized lr parsing extends lr parsing support arbitrary context-free grammars grammars lr grammars essentially performs parsing lr parsing respectively nondeterministic grammars efficient expected although glr parsing developed 1980s many new language definitions parser generators continue based lalr lr parsing present day chomsky initially hoped overcome limitations context-free grammars adding transformation rules rules another standard device traditional linguistics e.g passivization english much generative grammar devoted finding ways refining descriptive mechanisms phrase-structure grammar transformation rules exactly kinds things expressed natural language actually allows allowing arbitrary transformations meet goal much powerful turing complete unless significant restrictions added e.g transformations introduce rewrite symbols context-free fashion chomsky general position regarding non-context-freeness natural language held since although specific examples regarding inadequacy context-free grammars terms weak generative capacity later disproved gerald gazdar geoffrey pullum argued despite non-context-free constructions natural language cross-serial dependencies swiss german reduplication bambara vast majority forms natural language indeed context-free | [
512,
6274,
5635,
5894,
1672,
10890,
3468,
2831,
5880,
2065,
9871,
5651,
5399,
1952,
1956,
9002,
6841,
10560,
7876,
4293,
8262,
10569,
10953,
1611,
846,
1490,
7634,
6102,
5464,
11490,
4070,
10732,
1652,
2936,
3577,
7805
] | None |
2,317 | 9 | Stata:stata stata general-purpose statistical software package created 1985 statacorp users work research especially fields economics sociology political science biomedicine epidemiology stata capabilities include data management statistical analysis graphics simulations regression custom programming also system disseminate user-written programs lets grow continuously name stata syllabic abbreviation words statistics data faq official forum stata insists correct english pronunciation stata must remain mystery stay-ta sta-ta stah-ta considered acceptable four major builds version stata small stata smaller student version educational purchase longer available stata always emphasized command-line interface facilitates replicable analyses starting version 8.0 however stata included graphical user interface based qt framework uses menus dialog boxes give access nearly built-in commands generates code always displayed easing transition command line interface flexible scripting language dataset viewed edited spreadsheet format version 11 commands executed data browser editor opened stata open single dataset one time stata holds entire dataset random-access virtual memory limits use extremely large datasets mitigated extent efficient internal storage integer storage types occupy one two bytes rather four single-precision 4 bytes rather double-precision 8 bytes default floating-point numbers dataset always rectangular format variables hold number observations mathematical terms vectors length although entries may missing values stata import data variety formats includes ascii data formats csv databank formats spreadsheet formats including various excel formats stata proprietary file formats changed time although every stata release includes new dataset format every version stata read older dataset formats write current recent previous dataset format using saveold command thus current stata release always open datasets created older versions older versions read newer format datasets stata read write sas xport format datasets natively using fdause fdasave commands econometric applications including gretl directly import stata file formats stata allows user-written commands distributed so-called ado-files straightforwardly downloaded internet indistinguishable user built-in commands respect stata combines extensibility often associated open-source packages features usually associated commercial packages software verification technical support professional documentation user-written commands later adopted statacorp become part subsequent official release appropriate checking certification documentation stata active email list august 1994 statalist 1000 messages per month turned web forum march 2014 still called statalist statacorp employees regularly contribute statalist maintained marcello pagano harvard school public health statacorp articles use stata new user-written commands published quarterly peer-reviewed stata journal stata journal quarterly publication containing articles statistics data analysis teaching methods effective use stata language user group meetings held annually united states stata conference uk germany italy less frequently several countries annual stata conference held united states hosted statacorp lp local stata distributors host user group meetings countries however stata developers frequently travel present meetings established societies act 10 may 2008 singapore stata users group world first government-approved users group registration 2048/2008 unique entity t08ss0091a slogan shaping data meaningfully non-profit organisation stataugs organise regular meetings provides programming statistical advice users singapore informal means active members stataugs mostly engaged biomedical research perform linear ols regression x optional part allows restrict sample used command subset example command applied females sample one could specify female == 1. br perform logistic regression x display scatter plot x restricted values x 10 perform ols regression x white heteroscedasticity-consistent standard errors calculate akaike information criterion aic bayesian information criterion bic regression code fizzbuzz since 2000 statacorp released new major release stata incrementing integer part version number roughly every two years users must pay fee wish upgrade latest major release minor releases incrementing decimal part version number sometimes made available major releases available free downloadable updates licence previous major release dates releases available stata website stata 16 released june 26 2019 stata versioning system designed give high degree backward compatibility ensuring code written previous releases continues work however users careful save open data among different versions | [
5129,
7945,
3980,
6797,
7950,
11539,
2457,
7580,
7326,
7983,
6962,
9780,
823,
6718,
5830,
5703,
4808,
5833,
4042,
5450,
2383,
2000,
9944,
2652,
1501,
10848,
4840,
363,
5612,
7924,
2045
] | Test |
2,318 | 8 | Focused_crawler:focused crawler focused crawler web crawler collects web pages satisfy specific property carefully prioritizing crawl frontier managing hyperlink exploration process predicates may based simple deterministic surface properties example crawler mission may crawl pages .jp domain predicates may softer comparative e.g. crawl pages baseball crawl pages large pagerank important page property pertains topics leading topical crawlers example topical crawler may deployed collect pages solar power swine flu even abstract concepts like controversy minimizing resources spent fetching pages topics crawl frontier management may device used focused crawlers may use web directory web text index backlinks web artifact focused crawler must predict probability unvisited page relevant actually downloading page possible predictor anchor text links approach taken pinkerton crawler developed early days web topical crawling first introduced filippo menczer chakrabarti et al coined term focused crawler used text classifier prioritize crawl frontier andrew mccallum co-authors also used reinforcement learning focus crawlers diligenti et al traced context graph leading relevant pages text content train classifiers form online reinforcement learning used along features extracted dom tree text linking pages continually train classifiers guide crawl review topical crawling algorithms menczer et al show simple strategies effective short crawls sophisticated techniques reinforcement learning evolutionary adaptation give best performance longer crawls shown spatial information important classify web documents another type focused crawlers semantic focused crawler makes use domain ontologies represent topical maps link web pages relevant ontological concepts selection categorization purposes addition ontologies automatically updated crawling process dong et al introduced ontology-learning-based crawler using support vector machine update content ontological concepts crawling web pages crawlers also focused page properties topics cho et al study variety crawl prioritization policies effects link popularity fetched pages najork weiner show breadth-first crawling starting popular seed pages leads collecting large-pagerank pages early crawl refinements involving detection stale poorly maintained pages reported eiron et al. kind semantic focused crawler making use idea reinforcement learning introduced meusel et al using online-based classification algorithms combination bandit-based selection strategy efficiently crawl pages markup languages like rdfa microformats microdata performance focused crawler depends richness links specific topic searched focused crawling usually relies general web search engine providing starting points davison presented studies web links text explain focused crawling succeeds broad topics similar studies presented chakrabarti et al. seed selection important focused crawlers significantly influence crawling efficiency whitelist strategy start focus crawl list high quality seed urls limit crawling scope domains urls high quality seeds selected based list url candidates accumulated sufficient long period general web crawling whitelist updated periodically created | [
2566,
3979,
140,
11284,
1913,
2459,
3744,
3875,
944,
8639,
8769,
10313,
714,
1240,
8046,
113,
3191,
8440,
4473
] | None |
2,319 | 2 | TextEdit_(API):textedit api textedit name collection application programming interfaces apis classic mac os performing text editing apis originally designed provide common text handling system support text entry fields dialog boxes simple text editing within macintosh gui time extended provide advanced text editing features limited original scope led fundamental limitations apple repeatedly stated textedit word processor therefore providing rich text editing always left third-party developers basic limitations textedit include first incarnation textedit provided support single style text applied text block adequate intended use supporting text entry fields later support added styled text textedit could used complex text editing tasks text editing areas web browsers etc textedit remains part carbon api macos superseded numerous solutions including atsui carbon third party waste text engine well nstext related classes within cocoa | [
576,
9700
] | Test |
2,320 | 1 | Relational_data_stream_management_system:relational data stream management system relational data stream management system rdsms distributed in-memory data stream management system dsms designed use standards-compliant sql queries process unstructured structured data streams real-time unlike sql queries executed traditional rdbms return result exit sql queries executed rdsms exit generating results continuously new data become available continuous sql queries rdsms use sql window function analyze join aggregate data streams fixed sliding windows windows specified time-based row-based continuous sql queries rdsms conform ansi sql standards common rdsms sql query performed declarative codice_1 statement continuous sql codice_1 operates data across one data streams optional keywords clauses include codice_3 optional codice_4 subclause specify rules joining multiple data streams codice_5 clause comparison predicate restrict records returned query codice_6 project streams common values smaller set codice_7 filter records resulting codice_6 codice_9 sort results following example continuous data stream aggregation using codice_1 query aggregates sensor stream weather monitoring station codice_1query aggregates minimum maximum average temperature values one-second time period returning continuous stream aggregated results one second intervals rdsms sql queries also operate data streams time row-based windows following example shows second continuous sql query using codice_12 clause one-second duration codice_12 clause changes behavior query output result new record arrives hence output stream incrementally updated results zero result latency | [
10413
] | Test |
2,321 | 2 | DeLi_Linux:deli linux desktop light linux deli linux short desktop linux distribution old pcs version 0.6.1 deli linux based slackware 7 using linux 2.2 deli linux version 0.7 development scratch linux 2.4.33.3 longer based slackware os still used slackware package management additionally new port system based crux deli linux based uclibc instead gnu c library port openbsd korn shell used default shell version 0.8 introduced pacman package manager 0.8 series focus internationalisation version 0.8.0 also switched web browser netsurf skipstone previously konqueror embedded dillo deli linux pre-packaged abiword siag office office suites web browser netsurf skipstone included email clients mutt sylpheed window managers icewm fluxbox included editing deli linux offers e3 elvis beaver since deli linux ships lightweight software many popular open source packages included gnome kde emacs mozilla thunderbird deli linux needs 386 32 mb ram minimum however linux swap partition needs selected setup run deli less 48 mb ram work smoothly 486 full installation packages requires nearly 750 mb hard disk space august 2010 developers announced deli linux discontinued instead two successor projects connochaetos deli cate connochaetos created 2010 arch linux derivative targeting i586 pentium 1 later processors time arch required least i686 trying follow gnu free system distribution guidelines fsdg discontinued july 2013 due maintainer lack time project financial situation project failure get endorsement free software foundation fsdg-compliant however june 2015 development connochaetos resumed longer derivative arch linux derivative slackware salix os another project deli cate runs 386 486 pentium-class machines | [
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,
10860,
5742,
2671,
11388,
2692,
8837,
9353,
9873,
11410,
8857,
10394,
11418... | Test |
2,322 | 6 | File_locking:file locking file locking mechanism restricts access computer file allowing one user process access specific time systems implement locking prevent classic interceding update scenario typical example race condition enforcing serialization update processes given file following example illustrates interceding update problem operating systems support concept record locking means individual records within given file may locked thereby increasing number concurrent update processes database maintenance uses file locking whereby serialize access entire physical file underlying database although prevent process accessing file efficient individually locking large number regions file removing overhead acquiring releasing lock poor use file locks like computer lock result poor performance deadlocks file locking may also refer additional security applied computer user either using windows security ntfs permissions installing third party file locking software ibm pioneered file locking 1963 use mainframe computers using os/360 termed exclusive control microsoft windows uses three distinct mechanisms manage access shared files windows inherits semantics share-access controls ms-dos system sharing introduced ms-dos 3.3 thus application must explicitly allow sharing opens file otherwise exclusive read write delete access file closed types access retrieve attributes file allowed file opened shared access applications may use byte-range locking control access specific regions file byte-range locks specify region file offset length type lock shared exclusive note region file locked required data within file applications sometimes exploit ability implement functionality applications use file read/write apis windows byte-range locks enforced also referred mandatory locks file systems execute within windows applications use file mapping apis windows byte-range locks enforced also referred advisory locks byte-range locking may also side-effects windows system example windows file-sharing mechanism typically disable client side caching file clients byte-range locks used client control file access client observe slower access read write operations must sent server file stored improper error-handling application program lead scenario file locked either using share access byte-range file locking accessed applications user may able restore file access manually terminating malfunctioning program typically done task manager utility sharing mode dwsharemode parameter createfile function used open files determines file-sharing sharing mode specified allow sharing file read write delete access combination subsequent attempts open file must compatible previously granted sharing-access file file closed sharing-access restrictions adjusted remove restrictions imposed specific file open byte-range locking type determined dwflags parameter lockfileex function used lock region file windows api function lockfile also used acquires exclusive lock region file file containing executable program file currently running computer system program e.g exe com dll cpl binary program file format normally locked operating system preventing application modifying deleting attempt denied sharing violation error despite fact program file opened application however access still allowed example running application file renamed copied read even executing files accessed applications windows using file handles file handles explored process explorer utility utility also used force-close handles without needing terminate application holding cause undefined behavior since program receive unexpected error using force-closed handle may even operate unexpected file since handle number may recycled microsoft windows xp server 2003 editions introduced volume snapshot vss capability ntfs allowing open files accessed backup software despite exclusive locks however unless software rewritten specifically support feature snapshot crash consistent properly supported applications assist operating system creating transactionally consistent snapshots commercial software accessing locked files windows include file access manager open file manager work installing drivers access files kernel mode unix-like operating systems including linux apple macos normally automatically lock open files several kinds file-locking mechanisms available different flavors unix many operating systems support one kind compatibility common mechanism two mechanisms may separate may implemented atop although types locks configured mandatory file locks unix default advisory means cooperating processes may use locks coordinate access file among uncooperative processes also free ignore locks access file way choose words file locks lock file lockers i/o two kinds locks offered shared locks exclusive locks case codice_1 different kinds locks may applied different sections byte ranges file else whole file shared locks held multiple processes time exclusive lock held one process coexist shared lock acquire shared lock process must wait processes hold exclusive locks acquire exclusive lock process must wait processes hold either kind lock unlike locks created codice_1 created codice_3 preserved across codice_4s making useful forking servers therefore possible one process hold exclusive lock file provided processes share filial relationship exclusive lock initially created single process duplicated across codice_4 shared locks sometimes called read locks exclusive locks sometimes called write locks however locks unix advisory n't enforced thus possible database concept shared writes vs. exclusive writes example changing field place may permitted shared access whereas garbage-collecting rewriting database may require exclusive access file locks apply actual file rather file name important since unix allows multiple names refer file together non-mandatory locking leads great flexibility accessing files multiple processes hand cooperative locking approach lead problems process writes file without obeying file locks set processes reason unix-like operating systems also offer limited support mandatory locking systems file whose setgid bit whose group execution bit file opened subject automatic mandatory locking underlying filesystem supports however non-local nfs partitions tend disregard bit file subject mandatory locking attempts read region locked exclusive lock write region locked shared exclusive lock block lock released strategy first originated system v seen today solaris hp-ux linux operating systems part posix however bsd-derived operating systems freebsd openbsd netbsd apple macos support linux also supports mandatory locking special -o mand parameter filesystem mounting rarely used unix-like operating systems prevent attempts open executable file running program writing third form locking separate provided codice_1 codice_3 one process hold exclusive codice_3 given file exclusive lock duplicated across later codice_4 simplifies coding network servers helps prevent race conditions confusing unaware mandatory locks effect codice_10 system call consequently certain programs may effectively circumvent mandatory locking authors advanced programming unix environment second edition observed codice_11 editor indeed page 456 whether codice_3 locks work network filesystems nfs implementation dependent bsd systems codice_3 calls file descriptor open file nfs-mounted partition successful no-ops linux prior 2.6.12 codice_3 calls nfs files would act locally kernel 2.6.12 implement codice_3 calls nfs files using posix byte-range locks locks visible nfs clients implement codice_1-style posix locks invisible lock upgrades downgrades release old lock applying new lock application downgrades exclusive lock shared lock another application blocked waiting exclusive lock latter application may get exclusive lock lock first application means lock downgrades block may counterintuitive codice_1 locks associated file given process removed file descriptor file closed process even lock never requested file descriptor also codice_1 locks inherited child process codice_1 close semantics particularly troublesome applications call subroutine libraries may access files neither bugs occurs using real codice_3-style locks preservation lock status open file descriptors passed another process using unix domain socket implementation dependent one source lock failure occurs buffered i/o buffers assigned user local workspace rather operating system buffer pool fread fwrite commonly used buffered i/o section file read another attempt read section likely obtain data local buffer problem another user attached file local buffers thing happening fwrite data obtained buffer fread obtaining data file user could changed could use flock exclusive access prevents simultaneous writes since reads reading buffer file data changed user 1 lost user 2 overwritten best solution problem use unbuffered i/o read write flock also means using lseek instead fseek ftell course 'll make adjustments function parameters results returned generally speaking buffered i/o unsafe used shared files amiga os lock file directory acquired using codice_21 function codice_22 lock shared processes read file/directory ca n't modify delete exclusive process successfully acquires lock access modify object lock whole object part lock must released codice_23 function unlike unix operating system implicitly unlock object process terminates shell scripts programs often use strategy similar use file locking creation lock files files whose contents irrelevant although often one find process identifier holder lock file whose sole purpose signal presence resource locked lock file often best approach resource controlled regular file using methods locking files apply example lock file might govern access set related resources several different files directories group disk partitions selected access higher level protocols like servers database connections using lock files care must taken ensure operations atomic obtain lock process must verify lock file exist create whilst preventing another process creating meantime various methods include lock files often named tilde codice_27 prefixed name file locking locking resource file may named arbitrarily certain mozilla products firefox thunderbird sunbird use type file resource lock mechanism using temporary file named parent.lock unlocker utility used determine process locking file displays list processes well choices process kill task unlock etc along list file options delete rename unix-like systems utilities used inspect state file locks process filename windows systems file locked possible schedule moving deletion performed next reboot approach typically used installers replace locked system files version control systems file locking used prevent two users changing file version parallel saving second user overwrite first user changed implemented marking locked files read-only file system user wanting change file performs unlock also called checkout operation check-in store operation done lock reverted nobody else allowed unlock file | [
2432,
6787,
6921,
8080,
2193,
10387,
5397,
1304,
6813,
2974,
671,
8991,
9762,
10786,
6184,
7983,
2995,
4919,
823,
11193,
5179,
9025,
3914,
9166,
8404,
5078,
10711,
10967,
4074,
8954,
8301,
3826,
5754,
3323,
3326
] | Test |
2,323 | 2 | Intent_(Android):intent android intent android operating system software mechanism allows users coordinate functions different activities achieve task intent messaging object provides facility performing late runtime binding code different applications android development environment significant use launching activities thought glue activities intents provide inter-application messaging system encourages collaboration component reuse intent basically passive data structure holding abstract description action performed dummies likens intent flicking switch intent turn light perform action flipping switch position concept created way allow developers easily remix different apps allow type task called activity handled application best suited even provided third party although concept new android architecture n't require elevated privileges access components makes open platform activities android defined classes control life cycle task user interface activities supported application declared manifest applications read activities supported intents one application start particular activities different application latter supports message type intent analysis 2011 researchers university california berkeley found intents pose security risk allowing attackers read content messages insert malicious messages applications | [
11361,
7804
] | None |
2,324 | 4 | Deception_technology:deception technology deception technology emerging category cyber security defense deception technology products detect analyze defend zero-day advanced attacks often real time automated accurate provide insight malicious activity within internal networks may unseen types cyber defense deception technology enables proactive security posture seeking deceive attackers detect defeat allowing enterprise return normal operations existing defense-in-depth cyber technologies struggled increasing wave sophisticated persistent human attackers technologies seek primarily defend perimeter firewalls end-point security defend perimeter 100 certainty cyber-attackers penetrate networks move unimpeded months stealing data intellectual property heuristics may find attacker within network often generate many alerts critical alerts missed since 2014 attacks accelerated evidence cyber-attackers penetrating traditional defenses rapidly increasing rate deception technology considers human attacker point view method exploiting navigating networks identify exfiltrate data integrates existing technologies provide new visibility internal networks share high probability alerts threat intelligence existing infrastructure deception technology automates creation traps decoys and/or lures mixed among within existing resources provide layer protection stop attackers penetrated network traps decoys assets either use real licensed operating system software emulations devices traps decoys use emulations also imitate medical devices automated teller machines atms retail point sale systems switches routers much lures generally real information technology resources files varying kinds placed actual assets upon penetrating network attackers seek establish backdoor use identify exfiltrate data intellectual property begin moving laterally internal vlans almost immediately look one traps decoys interacting one decoys trigger alert alerts high probability almost always coincide ongoing attack deception designed lure attacker β attacker may consider worthy asset continue injecting malware deception technology generally allows automated static dynamic analysis injected malware provides reports automation security operations personnel deception technology may also identify indicators compromise ioc suspect end-points part compromise cycle automation also allows automated memory analysis suspect end-point automatically isolating suspect end-point many partner integrations allow variety implementation paths existing enterprise government customers internet things iot devices usually scanned legacy defense depth cyber defense remain prime targets attackers within network deception technology identify attackers moving laterally network within devices integrated turnkey devices utilize embedded operating systems allow operating systems scanned closely protected embedded end-point intrusion detection software also well protected deception technology deployment network examples include process control systems scada used many manufacturing applications global basis deception technology associated discovery zombie zero attack vector wherein deception technology identified attacker utilizing malware embedded barcode readers manufactured overseas medical devices particular vulnerable cyber attacks within healthcare networks fda-certified devices closed systems accessible standard cyber defense software deception technology surround protect devices identify attackers using backdoor placement data exfiltration recent documented cyber attacks medical devices include x-ray machines ct scanners mri scanners blood gas analyzers pacs systems many networks utilizing devices protected deception technology attack vector called medical device hijack medjack estimated penetrated many hospitals worldwide specialized deception technology products capable addressing rise ransomware select products deceive ransomware engaging attack decoy resource isolating infection points alerting cyber defense software team honeypots perhaps first simple form deception honeypot appeared simply unprotected information technology resource presented attractive way prospective attacker already within network notion honeypots deceiving attackers perhaps delaying identifying ultimately supporting efforts shut attack good one potential benefits aside early honeypots exhibit challenges functionality integrity overall efficacy meeting goals key lack automation enabled broad scale deployment deployment strategy would seek cover enterprise tens thousands vlans must protected wo n't economically efficient using manual processes manual configuration gap legacy honeypots modern deception technology diminished time continue modern honeypots constitute low end deception technology space today traditional cyber defense technologies firewalls end-point security generate many alerts large enterprise alert volume may reach cases millions alerts per day security operations personnel process activity easily yet takes one successful penetration compromise entire network deception technology produces alerts end product binary process probability essentially reduced two values 0 100 party seeks identify ping enter view trap decoy utilizes lure immediately identified behavior anyone touching traps lures advantage heuristics probability-based approaches many thousands extraneous alerts techniques generate best practice shows deception technology stand-alone strategy deception technology additional compatible layer existing defense-in-depth cyber defense partner integrations make useful goal add protection advanced sophisticated human attackers successfully penetrate perimeter technical innovation deception technology received market industry analyst identified ten top technologies information security 2016 one deception technology industry analyst predicted august 2016 deception technology market currently 2016 approximately 50 100 million globally predicted 100 million 200 million revenue 2018 analyst earlier noted 2018 ... 10 percent enterprises use deception tools tactics actively participate deception operations attackers gartner also noted deception technology far underutilized technology provide serious advantages attackers cyber attackers two important analysts recently predicted market size exceeding 1 billion 2020 adoption fueled part continued highly visible targeted attacks large enterprise government institutions globally market research media estimates cumulative deception technology market value 12 billion 2017β2022 growing 19 cagr | [
8998,
9256,
2953,
10442,
107,
939,
11594,
2158,
7983,
4016,
4945,
1970,
8692,
7798,
10232,
7515
] | Test |
2,325 | 4 | Mega-D_botnet:mega-d botnet mega-d also known alias ozdok botnet peak responsible sending 32 spam worldwide october 14 2008 u.s federal trade commission cooperation marshal software tracked owners botnet froze assets november 6 2009 security company fireeye inc. disabled mega-d botnet disabling command control structure akin srizbi botnet takedown late 2008 mega-d/ozdok takedown involved coordination dozens internet service providers domain name registrars non-profit organizations like shadowserver m86 security researchers estimated take immediate effect spam botnet november 9 2009 spam stopped altogether although small trickle weekend directed couple small uk-based domains monitored since botnet bounced back exceeding pre-takedown levels nov. 22 constituting 17 worldwide spam dec. 13 july 2010 researchers university california berkeley published model mega-d protocol state-machine revealing internals proprietary protocol first time protocol obtained automatic reverse engineering technique developed berkeley researchers among contributions research paper reveals flaw mega-d protocol allowing template milking i.e. unauthorized spam template downloading flaw could used acquire spam templates train spam filters spam hits network november 2010 oleg nikolaenko arrested las vegas nevada federal bureau investigation charged violations can-spam act 2003 nikolaenko suspected operating mega-d botnet create zombie network many 500,000 infected computers | [
3072,
10756,
4487,
3724,
3347,
4883,
278,
9630,
10657,
4648,
939,
46,
10297,
5563,
3643,
7739,
7996,
11583,
9664,
9154,
8133,
10952,
81,
8789,
10457,
7515,
988,
9053,
3807,
8032,
3941,
4585,
10477,
4462,
2041,
10875,
3581,
5886,
9087
] | Test |
2,326 | 0 | Eva_HajiΔovΓ‘:eva hajiΔovΓ‘ eva hajiΔovΓ‘ born 23 august 1935 czech linguist specializing topicβfocus articulation corpus linguistics 2006 awarded association computational linguistics acl lifetime achievement award named fellow acl 2011 | [
3668,
4942,
7724
] | Test |
2,327 | 9 | BASIC09:basic09 basic09 structured basic programming language dialect developed microware behalf motorola then-new motorola 6809 cpu released february 1980 primarily used os-9 operating system released 1979 microware also released version os-9/68k 68000 microware basic contrast typical basics era basic09 includes multi-pass compiler produces compact bytecode known i-code i-code replaces number data structures found basics direct pointers code values speeding performance users compile code using codice_1 command point called directly os-9 operated native code case packed code cut-down version basic09 runtime system used runb improving memory footprint load time language includes number structured programming additions including local variables ability ignore line numbers favor named routines user-defined structures several distinct base data types including 16-bit 8-bit byte integers addition floating point strings key difference basic09 conventional basics era like canonical microsoft basic addition codice_2/codice_3 structure created separately executable blocks code code codice_2 common complete programs basics including variables local code executed stand-alone fashion codice_2s called using codice_6 command could include variables function-call semantics instance codice_7 calls procedure named codice_8 takes two parameters parameters imported procedure using codice_9 keyword example codice_10 side-effect use named procedures resulting memory workspace effect namespace respect basic09 system appears user directory callable programs contrasts typical basics one program available given time construction larger programs calling library-like code generally requires source code copy pasted separate programs basic09 user codice_11 procedures name workspace call code construct larger programs separately stored procedures addition code workspace program called codice_6 procedure name could found would look disk file name run worked basic09 code also executable program including machine language files meant basic09 could easily call system routines addition codice_6 common basic commands likewise used names instance codice_14 would print source code list procedure named bob codice_15 prints procedures currently memory adding codice_16 codice_17 added pretty printing indented loops branches improve readability one could also codice_18 codice_11 procedures storage addition organizational properties codice_2 basic09 also included number extensions flow control statements found basic provide structure instance codice_21 statement could used traditional codice_21 ... codice_23 format single line could used structured multi-line format codice_24 loops naturally structured format codice_25 placed line basic09 also added codice_26 codice_27 additional clarity working non-indexed loops also included center-exit codice_28 used codice_29 statement testing anywhere loop body basic09 included several built-in data types addition traditional string string 40-bit floating point real types found basics era also included 16-bit signed integer 8-bit unsigned byte logical boolean type boolean types packed bytes single boolean used entire 8-bit byte store single value language provided separate bytewise boolean operators bitwise operations bytes integers contrast basics also operated different base types basic09 decorate variable name indicate type instead used codice_30 definitions instance codice_31 declare two boolean variables codice_32 array five integers additionally basic09 included codice_33 keyword allowed compound types defined element listed single line separated semicolons instance defines employee record type named codice_34 three elements codice_35 codice_36 codice_37 employee_record type used definition like type instance codice_38 defines array 100 employee_record elements accessed code using dot notation instance codice_39 line numbers used basic dialects primarily way support editor users would edit particular lines code typing number text following either adding replacing lines already memory every line code number also made suitable indicating target codice_40 codice_41 compared languages like fortran separate line label used purpose basic09 normally use line numbers editor modified allow user edit lines without referring number however basic09 assume sort full-screen capability using cursor keys option instead system separate editor prompt allowed user move using keys moving forward backward one line time insert new line code without line number user left blank start statement note language case sensitive user-provided values like procedure variable names keywords keywords typed editor lower case shown upper case program codice_17ed basic09 allowed multiple statements single line code used separator instead used dialects used colon codice_43 assignment operator addition normal codice_44 codice_43 identical effect codice_44 made difference assignments comparisons obvious internal multipass compiler converts basic09 source code tokenized optimized bytecode called i-code i-code differs traditional tokenizing approach found basics number items placed directly memory instead using references looked instance ms-based interpreters variable reference code left string format variable codice_47 would represented memory three letters val execution variable encountered code interpreter look string table variables find associated storage address memory finally read value stored location table usually constructed value follows name save time final lookup contrast i-code address variable determined advance reference code replaced address avoids runtime search variable table optimizations include separate codice_24 routine used index variable integer separate integer real math libraries added performance basic09 also included codice_1 command took procedure name returned optimized version optimizations included removing non-coding instructions like code comments replacement constant expressions single value instance codice_1 would recognize codice_51 contains constants right replaces code codice_52 requires single operation runtime addition removing division square root codice_1 reduced memory footprint procedure improved performance 10 30 although common run programs within basic09 enviornment basics basic09 also shipped separate run-only version code known runb runb removed editing debugging features system half size full basic09 result purpose runb primarily run packed modules called programs meant user typed name basic09 module os/9 command line module marked packed opened run runb instead basic09 reduces memory footprint improves load time | [
1952,
5059,
5635,
7269,
7983,
1776,
3413,
4918,
7071
] | None |
2,328 | 7 | Zoho_Corporation:zoho corporation zoho corporation indian software development company focus zoho corporation lies web-based business tools information technology including office tools suite internet things management platform suite management software company founded 1996 sridhar vembu tony thomas pleasanton california offices seven countries global headquarters chennai 1996 2009 company known adventnet inc. adventnet expanded operations japan june 2001 zoho crm released 2005 followed releases projects creator sheet 2006 zoho expanded collaboration space release zoho docs zoho meeting 2007 2008 company added invoicing mail applications claims reached 10 lakh 1 million users august year 2009 company renamed zoho corporation online office suite name company launched grew without outside funding privately owned interview 2016 founder ceo sridhar vembu said one reasons zoho shunning outside funding financialisation associated investments would often put immense pressure funded company focus excessively return investments company would lose sight human objectives whereas beyond money also mission purpose life first zoho user conference zoholics launched 2012 year since 2005 zoho released additional applications 2017 released zoho one comprehensive suite zoho applications zoho headquartered chennai tamil nadu 2019 12 offices around world us headquarters currently pleasanton california plans move austin texas 2021 research development campus estancia park chennai zoho office tenkasi tirunelveli district tamil nadu product zoho desk built launched company operates china also offices singapore japan bulk support operations carried office chennai.zoho also office renigunta andhra pradesh operating office since 2018 | [
1539,
526,
4623,
10265,
5662,
5666,
9766,
39,
5159,
10283,
3121,
5681,
10820,
4683,
590,
1102,
7248,
6737,
5202,
9305,
4194,
5732,
3690,
2170,
9347,
4236,
10893,
5268,
6307,
2217,
9906,
7352,
4289,
3269,
1224,
724,
6367,
2795,
3819,
253,
... | Test |
2,329 | 5 | Radio_Link_Control:radio link control radio link control rlc layer 2 radio link protocol used umts lte air interface protocol specified 3gpp ts 25.322 umts ts 36.322 lte ts 38.322 5g new radio nr rlc located top 3gpp mac-layer pdcp-layer main tasks rlc protocol rlc features specific lte 1 re-segmentation 2 rlc sdu discard notified upper layer | [
2752,
3273,
3847
] | None |
2,330 | 4 | Fully_undetectable:fully undetectable fully undetectable usually shortened fud stand data encrypted making appear random noise also stand software detected anti-viruses scan performed term used hacker circles refer something appears clean many anti-viruses even though hacking tool | [
9569,
4956,
3629,
10309
] | Test |
2,331 | 3 | BioCompute_Object:biocompute object biocompute object bco project community-driven initiative build framework standardizing sharing computations analyses generated high-throughput sequencing hts also referred next-generation sequencing ngs massively parallel sequencing mps originally started collaborative contract george washington university food drug administration project grown include 20 universities biotechnology companies public-private partnerships pharmaceutical companies including seven bridges harvard medical school bco aims ease exchange hts workflows various organizations fda pharmaceutical companies contract research organizations bioinformatic platform providers academic researchers one biggest challenges bioinformatics documenting sharing scientific workflows way computation results peer-reviewed reliably reproduced bioinformatic pipelines typically use multiple pieces software typically multiple versions available multiple input parameters multiple outputs possibly platform-specific configurations experimental parameters laboratory protocol small changes computational parameters may large impact scientific validity results biocompute framework provides object oriented design bco contains details pipeline used constructed digitally signed shared biocompute concept originally developed satisfy fda regulatory research review needs evaluation validation verification genomics data however biocompute framework follows fair data principles used broadly provide communication interoperability different platforms industries scientists regulators standardization genomic data biocompute objects mostly useful three groups users 1 academic researchers carrying new genetic experiments 2 pharma/biotech companies wish submit work fda regulatory review 3 clinical settings hospitals labs offer genetic tests personalized medicine utility academic researchers ability reproduce experimental data accurately less uncertainty utility entities wishing submit work fda streamlined approach less uncertainty ability accurately reproduce work clinical settings critical hts data clinical metadata transmitted accurate way ideally standardized way readable stakeholder including regulatory partners biocompute object json format minimum contains software versions parameters necessary evaluate verify computational pipeline may also contain input data files links reference genomes executable docker components biocompute object integrated hl7 fhir provenance resource common workflow language research object biocompute object working group facilitates means different stakeholders provide input current practices bco working group formed preparation 2017 hts computational standards regulatory sciences workshop initially made workshop participants continual growth bco working group direct result interaction variety stakeholders interested communities standardization computational hts data processing public-private partnerships formed universities private genomic data companies software platforms government regulatory institutions easy point entry new individuals institutions bco project participate discussion best practices objects | [
9320,
2948
] | Test |
2,332 | 2 | Geoffrey_Knauth:geoffrey knauth geoffrey s. knauth board directors free software foundation teaches computer science lycoming college contributed gnu objective-c collection library degree economics harvard university | [
2050,
2180,
11654,
4493,
1939,
802,
3618,
5555,
9148,
10687,
10822,
5703,
5833,
8147,
3674,
2010,
10464,
9579,
8304,
1394,
8436
] | Test |
2,333 | 3 | Who_Dares_Wins_II:dares wins ii dares wins ii run gun game developed published alligata software released 1985 commodore 64 well amstrad cpc atari 8-bit family bbc micro commodore 16 plus/4 msx zx spectrum game remake earlier dares wins given injunction accused similar commando main character lone soldier sent enemy territory wielding gun five grenades player must capture eight enemy outposts massive opposition player blow vehicles rescue prisoners level player takes long prisoners executed firing squad zzap 64 rated game 90/100 calling game fantastic landscapes incredible revisited game 7 years later gave revised rating 78/100 saying n't weathered years well still playable dion guy nintendo life called game something wished nintendo virtual console lot fun despite extremely difficult | [
11238,
9006
] | None |
2,334 | 3 | Popek_and_Goldberg_virtualization_requirements:popek goldberg virtualization requirements popek goldberg virtualization requirements set conditions sufficient computer architecture support system virtualization efficiently introduced gerald j. popek robert p. goldberg 1974 article formal requirements virtualizable third generation architectures even though requirements derived simplifying assumptions still represent convenient way determining whether computer architecture supports efficient virtualization provide guidelines design virtualized computer architectures system virtual machines capable virtualizing full set hardware resources including processor processors memory storage resources peripheral devices virtual machine monitor vmm also called hypervisor piece software provides abstraction virtual machine three properties interest analyzing environment created vmm terminology popek goldberg vmm must present three properties terminology used reference book smith nair 2005 vmms typically assumed satisfy equivalence resource control properties additionally meeting performance property called efficient vmms popek goldberg describe characteristics instruction set architecture isa physical machine must possess order run vmms possess properties analysis derives characteristics using model third generation architectures e.g. ibm 360 honeywell 6000 dec pdp-10 nevertheless general enough extended modern machines model includes processor operates either system user mode access linear uniformly addressable memory assumed subset instruction set available system mode memory addressed relative relocation register i/o interrupts modelled derive virtualization theorems give sufficient necessary conditions virtualization popek goldberg introduce classification instructions isa 3 different groups main result popek goldberg analysis expressed follows theorem 1 conventional third-generation computer effective vmm may constructed set sensitive instructions computer subset set privileged instructions intuitively theorem states build vmm sufficient instructions could affect correct functioning vmm sensitive instructions always trap pass control vmm guarantees resource control property non-privileged instructions must instead executed natively i.e. efficiently holding equivalence property also follows theorem also provides simple technique implementing vmm called trap-and-emulate virtualization recently called classic virtualization sensitive instructions behave nicely vmm trap emulate every one related problem deriving sufficient conditions recursive virtualization conditions vmm run copy built popek goldberg present following sufficient conditions theorem 2 conventional third-generation computer recursively virtualizable architectures like non-hardware-assisted x86 meet conditions virtualized classic way architectures still fully virtualized x86 case meaning cpu mmu level using different techniques like binary translation replaces sensitive instructions generate traps sometimes called critical instructions additional processing however makes vmm less efficient theory hardware traps non-negligible performance cost well well-tuned caching binary translation system may achieve comparable performance case x86 binary translation relative first generation x86 hardware assist merely made sensitive instructions trappable effectively gives theorem different sufficiency conditions theorem 3 hybrid vmm may constructed third generation machine set user sensitive instructions subset set privileged instructions conditions isa virtualization expressed theorem 1 may relaxed expense efficiency property vmms non-virtualizable isas popek goldberg sense routinely built virtualization architectures requires correct handling critical instructions i.e. sensitive unprivileged instructions one approach known patching adopts techniques commonly used dynamic recompilation critical instructions discovered run-time replaced trap vmm various mechanisms caching emulation code hardware assists proposed make patching process efficient different approach paravirtualization requires guest operating systems modified ported running virtual environment section presents relevant architectures relate virtualization requirements pdp-10 architecture instructions sensitive alter query processor mode privileged instructions save restore condition codes containing user iot bits sensitive instructions system/370 privileged satisfies virtualization requirements motorola mc68000 single unprivileged sensitive instruction instruction sensitive allows access entire status register includes condition codes also user/supervisor bit interrupt level trace control later family members starting mc68010 move sr instruction made privileged new move ccr instruction provided allow access condition code register ia-32 instruction set pentium processor contains 18 sensitive unprivileged instructions categorized two groups introduction amd-v intel vt-x instruction sets 2005 allows x86 processors meet popek goldberg virtualization requirements effort needed support virtualization ia-64 architecture described 2000 article magenheimer christian hyperprivileged mode ultrasparc architecture specified ultrasparc architecture 2005 defines sun4v platform super-set sun4u platform still compliant sparc v9 level-1 specification sensitive instructions powerpc instruction set privileged efficiency requirement popek goldberg definition vmm concerns execution non-privileged instructions must execute natively distinguishes vmm general class hardware emulation software unfortunately even architecture meets popek goldberg requirements performance virtual machine differ significantly actual hardware early experiments performed system/370 meets formal requirements theorem 1 showed performance virtual machine could low 21 native machine benchmarks cost trapping emulating privileged instructions vmm significant led ibm engineers introduce number hardware assists roughly doubled performance system/370 virtual machines assists added several stages end 100 assists late models system/370 one main driving factors development hardware assists system/370 virtual memory guest operating system implemented virtual memory even non-privileged instructions could experience longer execution times penalty imposed requirement access translation tables used native execution see shadow page tables | [
5378,
5380,
6924,
4112,
2073,
8474,
10016,
6821,
3630,
7983,
4695,
2653,
7134,
7269,
9964,
5358,
499,
11636,
7286,
8700
] | Test |
2,335 | 9 | SIOD:siod scheme one defun humorously scheme one day siod programming language dialect language lisp small-size implementation dialect scheme written c designed embedded inside c programs notable perhaps smallest practical implementation lisp-like language written george j. carrette originally free open-source software released gnu lesser general public license lgpl siod features include | [
10752,
11269,
2056,
2062,
9231,
7184,
2577,
9749,
8728,
4633,
4122,
8226,
3119,
2105,
3132,
6717,
8258,
8771,
8262,
1613,
9299,
10841,
3675,
7267,
2660,
8293,
2666,
5751,
7805,
9345,
1159,
9865,
6797,
9877,
5803,
2225,
7867,
4799,
7880,
8... | None |
2,336 | 0 | Victor_Yngve:victor yngve victor h. yngve july 5 1920 β january 15 2012 professor emeritus linguistics university chicago one earliest researchers computational linguistics natural language processing use computers analyze process languages created first program produce random well-formed output sentences given text children book called engineer small little train importantly showed computer processing terms human brain process sentences certain kind complexity ones exceed depth limit nothing length kind established independently george miller depth limit seven plus minus two sentence constituents memory given time yngve also author comit first string processing language compare snobol trac perl developed ibm 700/7000 series computers yngve collaborators mit 1957-1965 yngve created language supporting computerized research field linguistics specifically area machine translation natural language processing 1970 paper getting word edgewise yngve coined term 'back channel behavior describe conversational phenomenon day known linguistic literature back-channeling according duncan yngve paper also suggested term turn-taking independently erving goffman duncan 1972 283 | [
10569,
1890,
7780,
8582
] | None |
2,337 | 3 | Wide-issue:wide-issue wide-issue architecture computer processor issues one instruction per clock cycle considered three broad types | [
6818,
10669,
6926,
6815
] | Test |
2,338 | 7 | Perforce:perforce perforce legally perforce software inc. minneapolis minnesota-based developer software used application development including version control software web-based repository management developer collaboration application lifecycle management agile planning software software sold helix hansoft brand names company equally owned private equity firms clearlake capital francisco partners perforce software founded 1995 alameda california christopher seiwald software developer computer science graduate uc berkeley first product also called perforce version control system allowing companies collaborate large software projects keeping track changes source code binary files june 2013 company released helix swarm tool developers working different geographical areas collaborate code review june 2014 company released version perforce versioning engine known p4d supported concurrency ability program run multiple parts concurrently march 2015 company renamed product perforce helix supported distributed development support included security features allowing suspicious usage tracking helix security capabilities included ip threat detection capabilities co-developed analytics vendor interset october company collaborated gitlab release gitswarm software tool combined github distributed workflow developers perforce single code repository february 2016 seiwald sold company investment group summit partners janet dryer named new ceo company headquarters relocated minneapolis november perforce announced acquisition seapine software provider application lifecycle management alm tools seapine testtrack alm software rebranded helix alm september 2017 company acquired uppsala sweden-based hansoft developer agile planning software also september perforce announced acquired finnish repository management services company deveo deveo products merged perforce helix teamhub first solo venture git-based development teams january 2018 summit partners sold perforce private equity firm clearlake capital may perforce acquired uk-based programming research prqa static code analysis firm june company announced ceo janet dryer moving role chair board coo/cfo mark ties taking role ceo october company acquired mobile web automation testing company perfecto january 2019 perforce announced acquisition rogue wave software software company focus development tools high-performance computing april 2019 private equity firm francisco partners acquired 50 perforce becoming equal partner clearlake capital perforce develops software used software developers manage code development process product line includes following helix core formerly perforce helix company versioning control engine large scale development environments helix version control system manages central database master repository file versions helix core clients fall roughly five categories git command gui web plugin perforce system make part content available git repositories users git clients work file content history git commits visible users clients perforce changelists vice versa users submit changed files together changelists applied atomic commits server client software released pre-built executables microsoft windows macos linux solaris freebsd operating systems helix alm formerly testtrack suite tools used application lifecycle management alm allowing developers manage product system development phases one product software originally developed seapine software acquired perforce rebranded helix alm provides centralized suite capabilities managing requirements defects issues testing throughout software development cycle three components suite company develops helix qac static code analysis software tool c c++ programming languages perforce customers software developers wide variety companies including netflix sap disney intuit nyse company considered leader gaming space 18 top 20 games developers including ubisoft electronic arts using perforce version control company headquartered minneapolis minnesota november 2017 listed additional offices alameda california mason ohio hallbergmoos germany helsinki finland sydney australia uppsala sweden wokingham england | [
2432,
2465,
162,
7425,
11256,
6154,
4919,
6797,
7983,
9070,
6993,
119,
2901,
823,
1304,
5210,
2045
] | None |
2,339 | 3 | Cache_(computing):cache computing computing cache aue hardware software component stores data future requests data served faster data stored cache might result earlier computation copy data stored elsewhere cache hit occurs requested data found cache cache miss occurs cache hits served reading data cache faster recomputing result reading slower data store thus requests served cache faster system performs cost-effective enable efficient use data caches must relatively small nevertheless caches proven many areas computing typical computer applications access data high degree locality reference access patterns exhibit temporal locality data requested recently requested already spatial locality data requested stored physically close data already requested inherent trade-off size speed given larger resource implies greater physical distances also tradeoff expensive premium technologies sram vs cheaper easily mass-produced commodities dram hard disks buffering provided cache benefits bandwidth latency larger resource incurs significant latency access e.g take hundreds clock cycles modern 4 ghz processor reach dram mitigated reading large chunks hope subsequent reads nearby locations prediction explicit prefetching might also guess future reads come make requests ahead time done correctly latency bypassed altogether use cache also allows higher throughput underlying resource assembling multiple fine grain transfers larger efficient requests case dram circuits might served wider data bus example consider program accessing bytes 32-bit address space served 128-bit off-chip data bus individual uncached byte accesses would allow 1/16th total bandwidth used 80 data movement would memory addresses instead data reading larger chunks reduces fraction bandwidth required transmitting address information hardware implements cache block memory temporary storage data likely used central processing units cpus hard disk drives hdds frequently use cache web browsers web servers cache made pool entries entry associated data copy data backing store entry also tag specifies identity data backing store entry copy cache client cpu web browser operating system needs access data presumed exist backing store first checks cache entry found tag matching desired data data entry used instead situation known cache hit example web browser program might check local cache disk see local copy contents web page particular url example url tag content web page data percentage accesses result cache hits known hit rate hit ratio cache alternative situation cache checked found contain entry desired tag known cache miss requires expensive access data backing store requested data retrieved typically copied cache ready next access cache miss previously existing cache entry removed order make room newly retrieved data heuristic used select entry replace known replacement policy one popular replacement policy least recently used lru replaces oldest entry entry accessed less recently entry see cache algorithm efficient caching algorithms compute use-hit frequency size stored contents well latencies throughputs cache backing store works well larger amounts data longer latencies slower throughputs experienced hard drives networks efficient use within cpu cache system writes data cache must point write data backing store well timing write controlled known write policy two basic writing approaches write-back cache complex implement since needs track locations written mark dirty later writing backing store data locations written back backing store evicted cache effect referred lazy write reason read miss write-back cache requires block replaced another often require two memory accesses service one write replaced data cache back store one retrieve needed data policies may also trigger data write-back client may make many changes data cache explicitly notify cache write back data since data returned requester write operations decision needs made write misses whether data would loaded cache defined two approaches write-through write-back policies use either write-miss policies usually paired way entities cache may change data backing store case copy cache may become out-of-date stale alternatively client updates data cache copies data caches become stale communication protocols cache managers keep data consistent known coherency protocols small memories close cpu operate faster much larger main memory cpus since 1980s used one caches sometimes cascaded levels modern high-end embedded desktop server microprocessors may many six types cache levels functions examples caches specific function d-cache i-cache translation lookaside buffer mmu earlier graphics processing units gpus often limited read-only texture caches introduced morton order swizzled textures improve 2d cache coherency cache misses would drastically affect performance e.g mipmapping used caching important leverage 32-bit wider transfers texture data often little 4 bits per pixel indexed complex patterns arbitrary uv coordinates perspective transformations inverse texture mapping gpus advanced especially gpgpu compute shaders developed progressively larger increasingly general caches including instruction caches shaders exhibiting increasingly common functionality cpu caches example gt200 architecture gpus feature l2 cache fermi gpu 768 kb last-level cache kepler gpu 1536 kb last-level cache maxwell gpu 2048 kb last-level cache caches grown handle synchronisation primitives threads atomic operations interface cpu-style mmu digital signal processors similarly generalised years earlier designs used scratchpad memory fed dma modern dsps qualcomm hexagon often include similar set caches cpu e.g modified harvard architecture shared l2 split l1 i-cache d-cache memory management unit mmu fetches page table entries main memory specialized cache used recording results virtual address physical address translations specialized cache called translation lookaside buffer tlb cpu caches generally managed entirely hardware variety software manages caches page cache main memory example disk cache managed operating system kernel disk buffer integrated part hard disk drive sometimes misleadingly referred disk cache main functions write sequencing read prefetching repeated cache hits relatively rare due small size buffer comparison drive capacity however high-end disk controllers often on-board cache hard disk drive data blocks finally fast local hard disk drive also cache information held even slower data storage devices remote servers web cache local tape drives optical jukeboxes scheme main concept hierarchical storage management also fast flash-based solid-state drives ssds used caches slower rotational-media hard disk drives working together hybrid drives solid-state hybrid drives sshds web browsers web proxy servers employ web caches store previous responses web servers web pages images web caches reduce amount information needs transmitted across network information previously stored cache often re-used reduces bandwidth processing requirements web server helps improve responsiveness users web web browsers employ built-in web cache internet service providers isps organizations also use caching proxy server web cache shared among users network another form cache p2p caching files sought peer-to-peer applications stored isp cache accelerate p2p transfers similarly decentralised equivalents exist allow communities perform task p2p traffic example corelli cache store data computed demand rather retrieved backing store memoization optimization technique stores results resource-consuming function calls within lookup table allowing subsequent calls reuse stored results avoid repeated computation related dynamic programming algorithm design methodology also thought means caching bind dns daemon caches mapping domain names ip addresses resolver library write-through operation common operating unreliable networks like ethernet lan enormous complexity coherency protocol required multiple write-back caches communication unreliable instance web page caches client-side network file system caches like nfs smb typically read-only write-through specifically keep network protocol simple reliable search engines also frequently make web pages indexed available cache example google provides cached link next search result prove useful web pages web server temporarily permanently inaccessible another type caching storing computed results likely needed memoization example ccache program caches output compilation order speed later compilation runs database caching substantially improve throughput database applications example processing indexes data dictionaries frequently used subsets data distributed cache uses networked hosts provide scalability reliability performance application hosts co-located spread different geographical regions semantics buffer cache totally different even fundamental differences intent process caching process buffering fundamentally caching realizes performance increase transfers data repeatedly transferred caching system may realize performance increase upon initial typically write transfer data item performance increase due buffering occurring within caching system read caches data item must fetched residing location least order subsequent reads data item realize performance increase virtue able fetched cache faster intermediate storage rather data residing location write caches performance increase writing data item may realized upon first write data item virtue data item immediately stored cache intermediate storage deferring transfer data item residing storage later stage else occurring background process contrary strict buffering caching process must adhere potentially distributed cache coherency protocol order maintain consistency cache intermediate storage location data resides buffering hand typical caching implementations data item read written first time effectively buffered case write mostly realizing performance increase application write originated additionally portion caching protocol individual writes deferred batch writes form buffering portion caching protocol individual reads deferred batch reads also form buffering although form may negatively impact performance least initial reads even though may positively impact performance sum individual reads practice caching almost always involves form buffering strict buffering involve caching buffer temporary memory location traditionally used cpu instructions directly address data stored peripheral devices thus addressable memory used intermediate stage additionally buffer may feasible large block data assembled disassembled required storage device data may delivered different order produced also whole buffer data usually transferred sequentially example hard disk buffering sometimes increases transfer performance reduces variation jitter transfer latency opposed caching intent reduce latency benefits present even buffered data written buffer read buffer cache also increases transfer performance part increase similarly comes possibility multiple small transfers combine one large block main performance-gain occurs good chance data read cache multiple times written data soon read cache sole purpose reduce accesses underlying slower storage cache also usually abstraction layer designed invisible perspective neighboring layers | [
7173,
9739,
5649,
2066,
7699,
5655,
2586,
541,
10781,
8231,
9770,
7218,
52,
566,
10811,
3645,
3646,
2623,
2113,
7234,
3142,
6221,
2638,
1106,
1623,
1122,
4708,
10340,
3175,
8295,
9834,
8815,
624,
4725,
630,
3702,
8822,
8825,
6268,
9343,
... | Test |
2,340 | 8 | HitDynamics:hitdynamics hitdynamics provider web analytics software allowing website owners track traffic sites ascertain traffic sources deliver conversions sales company founded internet entrepreneur max polyakov january 2005 acquired 6 march 2006 hitwise company technology exists web analytics arm hitwise suite cupid plc also founded max polyakov | [
6576
] | None |
2,341 | 4 | Zygalski_sheets:zygalski sheets method zygalski sheets cryptologic technique used polish cipher bureau world war ii war also british cryptologists bletchley park decrypt messages enciphered german enigma machines zygalski-sheet apparatus takes name polish cipher bureau mathematicianβcryptologist henryk zygalski invented october 1938 zygalski device comprised set 26 perforated sheets initially six possible sequences inserting three rotors enigma machine scrambler sheet related starting position left slowest-moving rotor 26 Γ 26 matrix represented 676 possible starting positions middle right rotors duplicated horizontally vertically aβz aβy sheets punched holes positions would allow female occur polish mathematicianβcryptologist marian rejewski writes perforated-sheets device operated like rejewski card-catalog method developed using cyclometer zygalski-sheet procedure independent number plugboard plug connections enigma machine cipher bureau manual manufacture sheets security reasons done mathematician-cryptologists using razor blades time-consuming 15 december 1938 third job finished date germans introduced rotors iv v thus increasing labor making sheets tenfold since ten times many sheets needed 60 possible combinations sequences enigma machine 3 rotors selected among 5 25 july 1939 five weeks outbreak world war ii polish general staff cipher bureau disclosed french british allies warsaw cryptologic achievements breaking enigma ciphers part disclosures involved zygalski perforated-sheet method british bletchley park near london england undertook production two complete sets perforated sheets work done aid perforators section headed john r.f jeffreys sheets known bletchley netz netzverfahren net method though later remembered gordon welchman jeffreys sheets latter term however referred another catalog produced jeffreys section first set completed late december 1939 28 december part second set delivered polish cryptologists escaped german-overrun poland pc bruno outside paris france remaining sheets completed 7 january 1940 couriered alan turing france shortly thereafter help writes rejewski continued solving enigma daily keys sheets used poles make first wartime decryption enigma message 17 january 1940 may 1940 germans completely changed procedure enciphering message keys exception norwegian network result zygalski sheets use though herivel tip could still used | [
7416,
9156,
8318
] | Test |
2,342 | 3 | Abracadabra_(video_game):abracadabra video game abracadabra text adventure game developed odisea software published proein soft line spanish amstrad cpc msx zx spectrum 1988 year 1209 knight named clus d'eledorf bewitched jealous queen saligia enamored become ghost haunting castle burgenfels would confess love game divided two parts part one clus find way rid witch break curse escape prison second part clus needs seek rescue beloved princess violeta greenwald forest game well received spanish video game press microhobby called excellent game high level graphic quality importantly stunning setting realization fantasy adventure game provides elements necessary satisfy even demanding fans genre micromania gave score 8/10 caad opined among adventures existing spanish market one definitely best | [
9006
] | None |
2,343 | 4 | US_Cyber_Challenge:us cyber challenge us cyber challenge private-public partnership program dedicated finding high level cybersecurity talent endeavor significantly reduce shortage today cyber workforce program identifies attracts recruits trains next generation cybersecurity professionals us cyber challenge currently program council cybersecurity center internet security us cyber challenge founded 2010 karen s. evans former administrator office electronic government information technology office management budget mission us cyber challenge fill workforce gap cybersecurity professionals process assessment training employment networking summer 2015 us cyber challenge hosted four camps across country two camps statewide camps located delaware illinois two camps regional camps located virginia eastern regional utah western regional camp schedule order qualify invitation one four cyber camps individuals must compete online qualifying competition cyber quests 2015 cyber quests schedule | [
3994
] | Test |
2,344 | 1 | Query_plan:query plan query plan query execution plan ordered set steps used access data sql relational database management system specific case relational model concept access plans since sql declarative typically large number alternative ways execute given query widely varying performance query submitted database query optimizer evaluates different correct possible plans executing query returns considers best option query optimizers imperfect database users administrators sometimes need manually examine tune plans produced optimizer get better performance given database management system may offer one mechanisms returning plan given query packages feature tools generate graphical representation query plan tools allow special mode set connection cause dbms return textual description query plan another mechanism retrieving query plan involves querying virtual database table executing query examined oracle instance achieved using explain plan statement textual plan given query screenshot shown indicates query engine scan primary key index employee table matching seek primary key index contactid column contact table find matching rows resulting rows side shown nested loops join operator sorted returned result set connection order tune query user must understand different operators database may use ones might efficient others still providing semantically correct query results reviewing query plan present opportunities new indexes changes existing indexes also show database properly taking advantage existing indexes see query optimizer query optimizer always choose efficient query plan given query databases query plan reviewed problems found query optimizer gives hints improve databases alternatives express query queries return results tried query tools generate embedded hints query use optimizer databases like oracle provide plan table query tuning plan table return cost time executing query oracle offers two optimization approaches rbo slowly deprecated cbo used tables referenced query must analyzed analyze table dba launch code dbms_stats package tools query optimization include | [
10632,
8201,
10505,
8979,
2068,
10389,
7446,
11030,
2456,
1049,
5658,
5403,
9112,
10137,
4255,
9248,
9631,
9634,
11552,
1447,
4263,
7080,
10793,
10413,
10286,
9397,
3004,
3388,
1341,
7868,
10048,
2369,
5953,
6850,
580,
11324,
2246,
9286,
26... | None |
2,345 | 2 | Computer_multitasking:computer multitasking computing multitasking concurrent execution multiple tasks also known processes certain period time new tasks interrupt already started ones finish instead waiting end result computer executes segments multiple tasks interleaved manner tasks share common processing resources central processing units cpus main memory multitasking automatically interrupts running program saving state partial results memory contents computer register contents loading saved state another program transferring control context switch may initiated fixed time intervals pre-emptive multitasking running program may coded signal supervisory software interrupted cooperative multitasking multitasking require parallel execution multiple tasks exactly time instead allows one task advance given period time even multiprocessor computers multitasking allows many tasks run cpus multitasking common feature computer operating systems allows efficient use computer hardware program waiting external event user input input/output transfer peripheral complete central processor still used another program time-sharing system multiple human operators use processor dedicated use behind scenes computer serving many users multitasking individual programs multiprogramming systems task runs must wait external event operating system scheduler forcibly swaps running task cpu real-time systems designed control industrial robots require timely processing single processor might shared calculations machine movement communications user interface often multitasking operating systems include measures change priority individual tasks important jobs receive processor time considered less significant depending operating system task might large entire application program might made smaller threads carry portions overall program processor intended use multitasking operating systems may include special hardware securely support multiple tasks memory protection protection rings ensure supervisory software damaged subverted user-mode program errors term multitasking become international term word used many languages german italian dutch danish norwegian early days computing cpu time expensive peripherals slow computer ran program needed access peripheral central processing unit cpu would stop executing program instructions peripheral processed data usually inefficient first computer using multiprogramming system british leo iii owned j. lyons co. batch processing several different programs loaded computer memory first one began run first program reached instruction waiting peripheral context program stored away second program memory given chance run process continued programs finished running use multiprogramming enhanced arrival virtual memory virtual machine technology enabled individual programs make use memory operating system resources concurrently running programs practical purposes non-existent invisible multiprogramming n't give guarantee program run timely manner indeed first program may well run hours without needing access peripheral users waiting interactive terminal problem users handed deck punched cards operator came back hours later printed results multiprogramming greatly reduced wait times multiple batches processed early multitasking systems used applications voluntarily ceded time one another approach eventually supported many computer operating systems known today cooperative multitasking although rarely used larger systems except specific applications cics jes2 subsystem cooperative multitasking scheduling scheme employed microsoft windows classic mac os enable multiple applications run simultaneously cooperative multitasking still used today risc os systems cooperatively multitasked system relies process regularly giving time processes system one poorly designed program consume cpu time either performing extensive calculations busy waiting would cause whole system hang server environment hazard makes entire environment unacceptably fragile preemptive multitasking allows computer system reliably guarantee process regular slice operating time also allows system deal rapidly important external events like incoming data might require immediate attention one another process operating systems developed take advantage hardware capabilities run multiple processes preemptively preemptive multitasking implemented pdp-6 monitor multics 1964 os/360 mft 1967 unix 1969 available operating systems computers small dec pdp-8 core feature unix-like operating systems linux solaris bsd derivatives well modern versions windows specific time processes grouped two categories waiting input output called i/o bound fully utilizing cpu cpu bound primitive systems software would often poll busywait waiting requested input disk keyboard network input time system performing useful work advent interrupts preemptive multitasking i/o bound processes could blocked put hold pending arrival necessary data allowing processes utilize cpu arrival requested data would generate interrupt blocked processes could guaranteed timely return execution earliest preemptive multitasking os available home users sinclair qdos sinclair ql released 1984 people bought machine commodore amiga released following year first commercially successful home computer use technology multimedia abilities make clear ancestor contemporary multitasking personal computers microsoft made preemptive multitasking core feature flagship operating system early 1990s developing windows nt 3.1 windows 95 later adopted apple macintosh mac os x unix-like operating system uses preemptive multitasking native applications similar model used windows 9x windows nt family native 32-bit applications multitasked preemptively 64-bit editions windows x86-64 itanium architectures longer support legacy 16-bit applications thus provide preemptive multitasking supported applications another reason multitasking design real-time computing systems number possibly unrelated external activities needed controlled single processor system systems hierarchical interrupt system coupled process prioritization ensure key activities given greater share available process time multitasking greatly improved throughput computers programmers started implement applications sets cooperating processes e. g. one process gathering input data one process processing input data one process writing results disk however required tools allow processes efficiently exchange data threads born idea efficient way cooperating processes exchange data would share entire memory space thus threads effectively processes run memory context share resources parent processes open files threads described lightweight processes switching threads involve changing memory context threads scheduled preemptively operating systems provide variant threads named fibers scheduled cooperatively operating systems provide fibers application may implement fibers using repeated calls worker functions fibers even lightweight threads somewhat easier program although tend lose benefits threads machines multiple processors systems directly support multithreading hardware essential multitasking system safely effectively share access system resources access memory must strictly managed ensure process inadvertently deliberately read write memory locations outside process address space done purpose general system stability data integrity well data security general memory access management responsibility operating system kernel combination hardware mechanisms provide supporting functionalities memory management unit mmu process attempts access memory location outside memory space mmu denies request signals kernel take appropriate actions usually results forcibly terminating offending process depending software kernel design specific error question user may receive access violation error message segmentation fault well designed correctly implemented multitasking system given process never directly access memory belongs another process exception rule case shared memory example system v inter-process communication mechanism kernel allocates memory mutually shared multiple processes features often used database management software postgresql inadequate memory protection mechanisms either due flaws design poor implementations allow security vulnerabilities may potentially exploited malicious software use swap file swap partition way operating system provide memory physically available keeping portions primary memory secondary storage multitasking memory swapping two completely unrelated techniques often used together swapping memory allows tasks loaded time typically multitasking system allows another process run running process hits point wait portion memory reloaded secondary storage processes entirely independent much trouble program multitasking environment complexity multitasking systems comes need share computer resources tasks synchronize operation co-operating tasks various concurrent computing techniques used avoid potential problems caused multiple tasks attempting access resource bigger systems sometimes built central processor number i/o processors kind asymmetric multiprocessing years multitasking systems refined modern operating systems generally include detailed mechanisms prioritizing processes symmetric multiprocessing introduced new complexities capabilities | [
2560,
2051,
10757,
9224,
3081,
6155,
6675,
7187,
7699,
8725,
10776,
25,
10267,
8732,
4637,
9762,
4643,
6180,
5158,
6184,
3626,
45,
7217,
7218,
10803,
9784,
10809,
570,
58,
576,
2113,
2625,
6221,
5711,
10838,
3160,
7771,
2140,
10333,
97,
... | None |
2,346 | 7 | Run-time_infrastructure_(simulation):run-time infrastructure simulation simulation run-time infrastructure rti middleware required implementing high level architecture hla rti fundamental component hla provides set software services necessary support federates coordinate operations data exchange runtime execution sense implementation hla interface specification part specification modern rti implementations conform ieee 1516 and/or hla 1.3 api specifications specifications include network protocol rti implementors rti create specification due interoperability rti products often rti versions assumed unless vendor specifies interoperability products versions | [
8122,
11109,
756,
7045
] | None |
2,347 | 3 | Golvellius:golvellius sega licensed franchise 1988 released remake game master system mark iii japan featuring enhanced graphics entirely different overworld dungeon layouts version released worldwide name golvellius valley doom later year 1988 compile released yet another remake msx2 system titled game featured mostly graphics ones sega master system version overworld dungeon layouts entirely different 2009 announced dotemu/d4 entreprise golvellius re-released iphone os platform scenario three different versions golvellius ending promised sequel never developed/released however spin-off game titled super cooks came included 1989 release disc station special shoka gou | [
10931,
9006
] | None |
2,348 | 1 | Propel_(PHP):propel php propel free open-source mit object-relational mapping toolkit written php also integral part php framework symfony default orm including version 1.2 propel project started august 2003 availability beta versions php version 5 version 5 php finally able provide level support object-oriented programming made projects like propel possible also created demand hitherto-missing components large-scale object-oriented architectures propel originally based apache torque project java language orm project propel primary function provide mapping php classes database tables accomplish propel includes generator component uses source code generation build php classes based datamodel definition written xml propel also includes runtime component manages connections transactions idiosyncratic rules describe workings rdbms used propel | [
3080,
1034,
6154,
9614,
2465,
7074,
7983,
190,
8644,
11259,
4171,
10587,
11357,
479,
3553,
7785,
7147,
5612,
4853,
9467,
7293
] | Train |
2,349 | 3 | Imagination_Creator:imagination creator creator family single-board computers developed imagination technologies promote educational research software development based mips architecture first board platform creator ci20 released august 2014 second development kit called creator ci40 introduced kickstarter campaign november 2015 creator ci20 board based ingenic jz4780 mobile-class application processor contains dual-core 1.2 ghz mips32 cpu 32k l1 cache 512k l2 cache ieee754 floating point unit coupled powervr sgx540 gpu processor supports mxu 32-bit simd extension addition board provides creator ci40 board based cxt200 chip optimized specifically iot applications contains dual-core dual-threaded 550 mhz mips interaptiv cpu 32k l1 cache 512k l2 cache ieee754 floating point unit coupled ensigma c4500 wi-fi radio processor addition board provides creator boards support creator iot framework open source software package based lwm2m protocol developed open mobile alliance | [
7234,
2349,
7983,
1776,
1427,
4124
] | Test |
2,350 | 3 | LGA_1356:lga 1356 lga 1356 land grid array 1356 pins also called socket b2 intel microprocessor socket released q1 2012 two processor 2p i.e dual socket segment server market supports 3 64-bit wide ddr3 channels whereas socket lga 2011 supports 4 channels socket lga 1155 supports 2 channels lga 1356 one two sockets designed replacement lga 1366 cpu socket lga 2011 known socket r lga 1356 1356 protruding pins make contact pads processor processors lga 1356 lga 1366 sockets compatible since different socket notches supports intel sandy bridge-en microprocessors code-named romley-en marketed xeon e5-2400 series main difference lga 2011 lga 1356 2 intel quickpath interconnect qpi connections lga 2011 1 qpi connection lga 1356 noticeable differences include 24 lanes pci express pci-e version 3.0 connections compared 40 lanes lga 2011 three channels ddr3 support compared four lga 2011 ddr3 channel support one dimm applicable ddr3 ddr3-l plans leaked early 2011 estimated releases first quarter 2012 september 2011 releases estimated end first quarter 2012 socket b2 processors following mechanical maximum load limits exceeded heatsink assembly shipping conditions standard use load limits crack processor die make unusable processors using socket static load limit previous models using lga 1366 socket b | [
3588,
5901,
5649,
5523,
4886,
2455,
3992,
8855,
11417,
3995,
4252,
6175,
7714,
10019,
4523,
2604,
6192,
9649,
4537,
7105,
4805,
7110,
8394,
3403,
4427,
5073,
4179,
3798,
4185,
7002,
9945,
11484,
9570,
10468,
613,
1000,
8552,
1260,
4717,
1... | Train |
2,351 | 9 | Pnuts:pnuts pnuts dynamic scripting language java platform designed used dual language system java programming language goals pnuts project provide small fast scripting language tight integration java language pnuts uses syntax simple friendly java developers also expressive java pnuts share type system java code easily invoke define pnuts functions likewise pnuts code easily manipulate java objects pnuts code even define java classes pnuts compiles java byte codes classes used java like class class written pnuts even later replaced class written java code changes pnuts syntax look similar java following code sample written java also valid pnuts script alternatively expressiveness pnuts could utilized pnuts originally developed 1997 toyokazu tomatsu testing tool java classes pnuts since extended mainly focusing essential functionality required java-based scripting engine module system bytecode compiler commercial usage pnuts includes rockwell automation factorytalk development system looks like project longer development | [
9345,
5612,
5677,
7983,
9780
] | None |
2,352 | 9 | M-expression:m-expression computer programming m-expressions meta-expressions early proposed syntax lisp programming language inspired contemporary languages fortran algol john mccarthy published first paper lisp 1960 research fellow massachusetts institute technology described language symbolic expressions s-expressions could represent complex structures lists defined set primitive operations s-expressions language meta-expressions m-expressions could used define complex operations finally showed meta-language could represented s-expressions resulting system potentially self-hosting mccarthy planned develop automatic lisp compiler using m-expressions language syntax s-expressions describe compiler internal processes stephen b. russell read paper suggested s-expressions convenient syntax although mccarthy disapproved idea russell colleague daniel j. edwards hand-coded interpreter program could execute s-expressions program adopted mccarthy research group establishing s-expressions dominant form lisp mccarthy reflected fate m-expressions 1979 recent circa 2003 variant i-expressions use indentation indicate parentheses implicitly thus ways intermediate s-expressions m-expressions i-expressions introduced scheme request implementation 49 auxiliary syntax scheme widely adopted | [
512,
4992,
10752,
11269,
3334,
6919,
7562,
2062,
9231,
5651,
1301,
9749,
9877,
8728,
4633,
6556,
3869,
10012,
2335,
6047,
8479,
8226,
4516,
5031,
9128,
5033,
5803,
2225,
10547,
11255,
311,
2105,
7867,
6717,
4799,
5569,
6594,
8771,
4550,
7... | None |
2,353 | 3 | RH1750:rh1750 rh1750 radiation-hardened implementation mil-std-1750a processor produced gec-plessey marconi communications primary target market aerospace industry | [
10098
] | Test |
2,354 | 4 | Jon_Callas:jon callas jon callas american computer security expert software engineer user experience designer technologist co-founder former cto global encrypted communications service silent circle held major positions digital equipment corporation apple pgp entrust considered one respected well-known names mobile security industry callas credited creating several internet engineering task force ietf standards including openpgp dkim zrtp wrote prior work entrust chief technical officer co-founder pgp corporation former chief technical officer entrust website callas describes entrepreneur innovator information business security including cryptography operating system security public key infrastructure intellectual property rights well innovator human-computer interactions collaboration social virtual reality also worked bruce schneier counterpane internet security one primary authors dkim method chief scientist original pgp inc. founded phil zimmermann callas member infosec think tank shmoo group callas received bsc mathematics university maryland college park attended 1977 1980 minored philosophy english literature member technical staff century computing 1980 1981 served principal software engineer digital equipment 1981 1993 working got work wide variety things graphics schedulers memory management operating system security created random password generator digital equipment designed pathworks network operating system well software macintosh client systems server systems running vms unix created cross-platform communications computers running mac os vms unix windows os/2 using appletalk decnet tcp/ip networks also developed software 3d pex ddx openvms osf/1 windows nt digital equipment folded callas co-founded world benders inc. worked 1993 1995 world benders lead architect developer meeting space cross-platform group collaboration product allowed people conduct meetings real-time existing networks callas held title senior scientist ii apple computer 1995 1997 describes firm β security privateer designed built next-generation cryptographic security products mac os x ios including 'filevault 2 full-disk encryption product also designed concurrent programming system high-performance computing 'transforms addition led engineering approvals fips 140 validation ios callas trusted security apple operating system worked apple whole disk encryption worst time working apple year steve jobs came back callas said apple worked gursharan sidhu inventor appletalk callas shipped first crypto built os called powertalk said failed far early although colleague bruce gaya managed hack piece password manager called keychain could run without rest powertalk thus rescued oblivion present keychain apple products completely utterly rewritten β proud saving joined pgp inc. developer pretty good privacy january 1997 chief scientist network associates nai bought pgp december 1997 callas became cto total network security division nai creating architecture direction company network security products serving primary author ietf openpgp standard director software engineering counterpane 1999 2001 serving co-architect counterpane managed security monitoring system β redundant system adaptive fail-over monitors networks three continents also led engineering team built system taking prototype operational four months managed counterpane export control process getting approval system including fifteen new ciphers senior architect wave systems corporation 2001 2002 lead architect wave embassy trust system performed security analysis created product security subsystems co-founded new pgp corporation 2002 worked server architect pgp july 2002 october 2009 time company principal author ietf openpgp standard rfc2440 developed pgp pretty good privacy universal server security privateer could tell 'd kill associates october 2009 july 2011 chief technical officer entrust provider identity-based security software july 2011 january 2013 co-founded silent circle 2012 blackphone 2013 continued serve cto silent circle april 2016 led development operations groups former produces apps manifest silent circle services subscribers latter runs actual services callas holds patents patents pending several systems methods erasing media facilitating secure media access secure transparent electronic communications dynamic security operations partial message authentication facilitating encryption decryption operations email server callas security product designs major innovation awards wall street journal others one primary authors dkim method member infosec think tank shmoo group served adjunct professor indiana university since 2012 callas lectured widely computers internet security scheduled speaker oslo freedom forum 2014 callas selected one two keynote speakers 2015 pdf technical conference san jose california may 2016 callas rejoined apple callas appeared january 11 2018 episode john wants answers callas stated tech companies bigger threat privacy government views stem big tech mass pooling personal data advertising polarization within silicon valley companies committed privacy many earn revenues selling user data callas stated advertising market takes downturn companies protect users data insulated harm lives san jose california | [
1315,
11653,
2800,
4793,
8283,
2558
] | Test |
2,355 | 2 | VM/386:vm/386 vm/386 multitasking operating system 'control program took early advantage capabilities intel 386 processor utilizing virtual 8086 mode users able run existing text-based graphical dos software safely separate environments system offered high degree control ability set memory cpu usage limits unique config.sys autoexec.bat files could configured application even different dos versions 1991 vendor announced intentions support dpmi 1.0 vm/386 vm/386 initially developed softguard systems producer copy-protection software plans include features like non-dos system support financial constraints forced sale intelligent graphics corporation igc launched product 1987 pc magazine award technical excellence 1988 company also introduced multi-user version allowed number serial terminals even graphical systems connected single 386 computer current versions software built multi-user support handle tens users networked environment windows 3.11 support access controls virtual memory device sharing among features version software designed cooperate unix bundled everex systems workstations system sees use mainly vertical applications like point-of-sale systems ability run reliably cheap reliable hardware outweigh gains newer operating systems complex less reliable early competition included desqview 386 sunny hill software omniview starpath systems vmos/3 windows/386 2.01 target market shifted away single-user systems multiple-user setups many serial terminals began compete directly likes multiuser dos pc-mos/386 | [
2179,
10499,
10757,
10883,
394,
3978,
1804,
6797,
273,
7057,
6675,
7187,
11539,
9366,
11667,
6296,
2201,
25,
10776,
8092,
4637,
7325,
9887,
10016,
9762,
421,
5158,
10235,
2345,
4394,
7983,
3248,
7217,
11184,
6837,
9525,
823,
9784,
4409,
1... | Validation |
2,356 | 5 | Professional_video_over_IP:professional video ip professional video ip systems use existing standard video codec reduce program material bitstream e.g. mpeg transport stream use internet protocol ip network carry bitstream encapsulated stream ip packets typically accomplished using variant rtp protocol carrying professional video ip networks special challenges compared non-time-critical ip traffic many problems similar encountered voice ip much higher level engineering requirements particular strict quality service requirements must fulfilled use professional broadcast environments since even well-engineered ip networks tend small residual packet loss rate caused low-probability statistical congestion events amplification bit errors underlying hardware professional solutions use kind forward error correction ensure encoded video stream reconstructed even packets lost typically applied packet level since encapsulated video bitstream typically designed tolerate low levels bit burst errors rather loss whole packets resending packets option sequential nature underlying video signal live video resent packet would arrive well arrival next frame video network delay variation kept minimum using high-speed network backbone ensuring video traffic encounter excessive queue delays typically done either ensuring network close full capacity video traffic prioritized using traffic engineering techniques see remaining delay variation removed buffering expense added time delay forward error correction used small proportion packets arriving deadline tolerated since dealt discarded receipt treated way lost packets added time delay particularly unwelcome ptz cameras makes operator control difficult values 250ms problem presented latency variation makes synchronization complex making recovery underlying timing video signal far difficult typically solved genlocking ends system external station sync signals typically generated sources gps atomic clocks thus requiring extraction coarse timing information receiving end order achieve high-quality video synchronization extraction coarse timing data typically done using phase locked loop long time constant even packet loss mitigation video ip work network capable carrying content reasonable maximum packet loss rate practice means video ip work overloaded networks since ip offer traffic guarantees must applied network engineering level one approach quality service approach simply allocates sufficient bandwidth video-carrying traffic congest possible load pattern approaches include dynamic reduction frame rate resolution network admission control bandwidth reservation traffic shaping traffic prioritization techniques require complex network engineering work simple approach building non-blocking network possible see rsvp one approach ip network traffic engineering pro-mpeg wide area network group done much recent work creating draft standard interoperable professional video ip within security products industry ip-based closed circuit television cctv making gains analog market key components ip-based cctv remain consistent analog technologies image capture combination ip-based cameras analog cameras using ip-based encoders image transmission storage retrieval uses technologies raid arrays iscsi recorded indexed video video management affords web browser-enabled management control ip-based cctv systems one key advantage ip-based cctv ability use network infrastructure providing adequate bandwidth availability switching routing rather coaxial cabling however running bandwidth-intensive surveillance video corporate data networks point organizational contention depending potential impact network performance class companies produce video management software help manage capture storage video content digital video also makes possible video content analysis allows automatic detection identification various kinds objects motion also another emerging model off-site storage surveillance video online surveillance providers utilizing cloud computing technologies consolidate multi-site surveillance video web manufacturers cctv equipment steadily integrating ip network technology product portfolios | [
5472,
9381,
1710,
1876,
7863,
6586
] | None |
2,357 | 4 | Correlation_attack:correlation attack cryptography correlation attacks class known plaintext attacks breaking stream ciphers whose keystream generated combining output several linear feedback shift registers called lfsrs rest article using boolean function correlation attacks exploit statistical weakness arises poor choice boolean function β possible select function avoids correlation attacks type cipher inherently insecure simply essential consider susceptibility correlation attacks designing stream ciphers type correlation attacks possible significant correlation output state one individual lfsr keystream generator output boolean function combines output state lfsrs combined partial knowledge keystream easily derived partial knowledge plaintext two simply xored together allows attacker brute-force key individual lfsr rest system separately instance keystream generator four 8-bit lfsrs combined produce keystream one registers correlated boolean function output may brute force first remaining three total attack complexity 2 2 compared cost launching brute force attack entire system complexity 2 represents attack effort saving factor 256 substantial second register correlated function may repeat process drop attack complexity 2 2 2 effort saving factor 65028 sense correlation attacks considered divide conquer algorithms correlation attacks perhaps best explained via example consider case geffe keystream generator geffe generator consists three lfsrs lfsr-1 lfsr-2 lfsr-3 denote outputs registers formula_1 formula_2 formula_3 respectively boolean function combines three registers provide generator output given formula_4 i.e formula_1 formula_2 xor formula_1 formula_3 2 8 possible values outputs three registers value combining function shown table consider output third register formula_3 table makes clear 8 possible outputs formula_3 6 equal corresponding value generator output formula_11 i.e formula_12 75 possible cases thus say lfsr-3 correlated generator weakness may exploit follows suppose intercept ciphertext formula_13 plaintext formula_14 encrypted stream cipher using geffe generator keystream generator i.e formula_15 formula_16 formula_17 output lfsr-1 time formula_18 etc suppose know part plaintext e.g know formula_19 first 32 bits plaintext corresponding 4 ascii characters text improbable may seem know plaintext valid xml file instance know first 4 ascii characters must xml similar many file formats network protocols standard headers footers guessed easily given intercepted formula_20 known/guessed formula_19 may easily find formula_22 formula_23 xoring two together know 32 consecutive bits generator output may begin brute force search space possible keys initial values lfsr-3 assuming know tapped bits lfsr-3 assumption line kerckhoffs principle given key keyspace may quickly generate first 32 bits lfsr-3 output compare recovered 32 bits entire generator output established earlier 75 correlation output lfsr-3 generator know correctly guessed key lfsr-3 approximately 24 first 32 bits lfsr-3 output match corresponding bits generator output guessed incorrectly expect roughly half 16 first 32 bits two sequences match thus may recover key lfsr-3 independently keys lfsr-1 lfsr-2 stage reduced problem brute forcing system 3 lfsrs problem brute forcing single lfsr system 2 lfsrs amount effort saved depends length lfsrs realistic values substantial saving make brute force attacks practical need stop observe table formula_2 also agrees generator output 6 times 8 correlation 75 correlation formula_2 generator output may begin brute force attack lfsr-2 independently keys lfsr-1 lfsr-3 leaving lfsr-1 unbroken thus able break geffe generator much effort required brute force 3 entirely independent lfsrs meaning geffe generator weak generator never used generate stream cipher keystreams note table formula_1 agrees generator output 4 times 8 50 correlation use brute force lfsr-1 independently others correct key yield output agrees generator output 50 time average incorrect key represents ideal situation security perspective combining function formula_11 chosen correlation variable combining function output close possible 50 practice may difficult find function achieves without sacrificing design criteria e.g period length compromise may necessary example illustrates well relatively simple concepts behind correlation attacks perhaps simplifies explanation precisely brute forcing individual lfsrs proceeds make statement incorrectly guessed keys generate lfsr output agrees generator output roughly 50 time given two random bit sequences given length probability agreement sequences particular bit 0.5 however specific individual incorrect keys may well generate lfsr output agrees generator output less often exactly 50 time particularly salient case lfsrs whose correlation generator especially strong small enough correlations certainly outside realm possibility incorrectly guessed key also lead lfsr output agrees desired number bits generator output thus may able find key lfsr uniquely certainty may instead find number possible keys although still significant breach cipher security say megabyte known plaintext situation would substantially different incorrect key may generate lfsr output agrees 512 kilobytes generator output likely generate output agrees much 768 kilobytes generator output like correctly guessed key would rule weaker correlation individual register generator output known plaintext required find register key high degree confidence readers background probability theory able see easily formalise argument obtain estimates length known plaintext required given correlation using binomial distribution correlations exploited example attack geffe generator examples called first order correlations correlations value generator output individual lfsr possible define higher order correlations addition instance may possible given boolean function strong correlations individual registers combines significant correlation may exist boolean function two registers e.g formula_28 would example second order correlation define third order correlations obvious way higher order correlation attacks powerful single order correlation attacks however effect subject law limiting returns table shows measure computational cost various attacks keystream generator consisting eight 8-bit lfsrs combined single boolean function understanding calculation cost relatively straightforward leftmost term sum represents size keyspace correlated generators rightmost term represents size keyspace remaining generators higher order correlations lead powerful attacks also difficult find space available boolean functions correlate generator output increases number arguments function boolean function formula_29 n variables said -th order correlation immune -th order correlation immunity integer significant correlation exists function output boolean function inputs example boolean function first order second order correlations third order correlation exhibits 2nd order correlation immunity obviously higher correlation immunity makes function suitable use keystream generator although thing needs considered siegenthaler showed correlation immunity boolean function algebraic degree n variables satisfies β€ n given set input variables means high algebraic degree restrict maximum possible correlation immunity furthermore function balanced β€ n β 1 follows impossible function n variables n -th order correlation immune also follows fact function written using reed-muller basis combination xors input functions given possibly extreme severity correlation attack impact stream cipher security considered essential test candidate boolean combination function correlation immunity deciding use stream cipher however important note high correlation immunity necessary sufficient condition boolean function appropriate use keystream generator issues consider e.g whether function balanced whether outputs many roughly many 1 0 possible inputs considered research conducted methods easily generating boolean functions given size guaranteed least particular order correlation immunity research uncovered links correlation immune boolean functions error correcting codes | [
7556,
262,
2567,
3084,
2957,
3984,
7056,
658,
660,
1173,
1941,
3477,
4128,
1315,
4389,
10662,
6954,
11185,
10806,
1847,
9528,
7161,
2110,
10315,
6863,
8273,
9170,
7635,
212,
9556,
10963,
11349,
2265,
7643,
9697,
8674,
229,
618,
1898,
881,... | None |
2,358 | 4 | Penny_Black_(research_project):penny black research project penny black project microsoft research project tries find effective practical ways fighting spam identifying spams consumes recipient time idea make sender emails pay certain amount sending currency mode payment could cpu cycles turing tests memory cycles payment would limit spammers ability send large quantities emails quickly project name derived penny black world first adhesive stamp used paid postage goal project move e-mail costs receiver sender general idea sender must prove expended certain amount effort specifically receiver message alone project aims devise method without introducing additional challenge-response mechanisms third parties without requiring extra maintenance updates retaining current architecture e-mail system one project ideas ticket server credit-based method validating emails tickets would required perform actions sending emails three operations ticket server provides request ticket cancel ticket refund ticket server would allow user request ticket exchange proof work expending cpu cycles solving hard algorithms processing power turing tests even paying money server could also cancel ticket example receiving email ticket receiver could request ticket cancelled reused person cancels ticket also option refund ticket sender causes original sender regain new ticket example user might refund ticket came email spam using friendly trusted emails would little cost tickets would frequently refunded however spammers would required invest either lot computing time money order create enough tickets send large numbers e-mails one obvious flaws project entirely stop spam hopes slow spam enough longer cost effective spammers using methods reduce spam also require policies universal amongst mail clients intended mass email may also work intended example subscribers particular email service may end getting emails significant delay email service also become increased expenses provider | [
5920,
5956,
6762,
6639,
7983,
3922,
3508,
10263,
7482,
2140
] | Test |
2,359 | 5 | DIXIE:dixie dixie obsolete protocol accessing x.500 directory services dixie intended provide lightweight means clients access x.500 directory services dixie allowed tcp/ip clients connect dixie-to-dap gateway would provide access x.500 directory service design allows client access directory without requiring support cumbersome open systems interconnection protocol stack dixie created 1990 university michigan tim howes mark smith bryan beecher dixie formally specified rfc 1249 published 1991 university offered completed unix implementation protocol including dixie server application development library dixie clients dixie client apple macintosh also provided efforts led development lightweight directory access protocol ldap replaced dixie created acronym dixie stand anything however later became known stand directory interface x.500 implemented efficiently | [
11456,
6054,
6651,
5531,
10238
] | Test |
2,360 | 4 | Warrant_canary:warrant canary warrant canary method communications service provider aims inform users provider served secret government subpoena despite legal prohibitions revealing existence subpoena warrant canary typically informs users secret subpoena particular date canary updated time period specified host warning removed users assume host served subpoena intention allow provider warn users existence subpoena passively without disclosing others government sought obtained access information records secret subpoena secret subpoenas covered 18 u.s.c Β§2709 c usa patriot act provide criminal penalties disclosing existence warrant third party including service provider users united states secret subpoenas national security letters originated 1986 electronic communications privacy act used suspected agents foreign power revised 2001 patriot act secret subpoenas used anyone may information deemed relevant counter-intelligence terrorism investigations idea using negative pronouncements thwart nondisclosure requirements court orders served secret warrants first proposed steven schear cypherpunks mailing list mainly uncover targeted individuals isps also suggested used public libraries 2002 response usa patriot act would force librarians disclose circulation history patrons first commercial use warrant canary us cloud storage provider rsync.net began publishing canary 2006 addition digital signature provides recent news headline proof warrant canary recently posted well mirroring posting internationally november 5 2013 apple became prominent company publicly state never received order user data section 215 patriot act september 18 2014 gigaom reported warrant canary statement appear anymore next two apple transparency reports covering julyβdecember 2013 januaryβjune 2014 tumblr also included warrant canary transparency report issued february 3 2014 august 2014 online cloud service spider oak implemented encrypted warrant canary publishes clear message every 6 months three pgp signatures geographically distributed signers must sign message β government agency forced spideroak update page would need enlist help three signers september 2014 us security researcher moxie marlinspike wrote every lawyer 've spoken indicated 'canary remove choose update would likely legal consequences simply posting something explicitly says 've received something matter court exercising judicial power warrant could obtained another person prohibits disclosure existence non-existence however could easily remedied amalgamating right fair trial warrant canary australia everyone right fair trial case law larger picture law right access lawyer one write warrant canary way seeks access legal representation may effect triggering canary informing larger public existence secret warrant authority object remove notice seeking legal representation could seen authority infringement legal right australia goal canary effectively causing stay proceedings common law jurisdictions would cure inherent prohibition reducing warrant canaries matter negative positive action addition notice removal notice whatever case may australia outlawed use certain kind warrant canary march 2015 making illegal journalist disclose information existence non-existence warrant issued new mandatory data retention laws unlikely journalist could give correct canary situation anyway legislation agency obtaining warrant compelled inform journalist warrant afterwards computer security privacy specialist bruce schneier wrote blog post p ersonally never believed warrant canaries would work relies fact prohibition speaking n't prevent someone speaking courts generally n't impressed sort thing easily imagine secret warrant includes prohibition triggering warrant canary know right secret legal proceedings issue said case law specific united states would render covert continuance warrant canaries subject constitutionality challenges west virginia state board education v. barnette wooley v. maynard rule free speech clause prohibits compelling someone speak one wishes easily extended prevent someone compelled lie new york times co. v. united states protects one exercising first amendment publish government information even wishes government except grave exceptional circumstances previously set act precedent latter also carries weight acting direct government intervention similar government intervention warrant canary following list companies organizations whose warrant canaries longer appear transparency reports 2015 coalition organizations consisting eff freedom press foundation nyu law calyx institute berkman center created website called canary watch order provide compiled list companies providing warrant canaries mission provide prompt updates changes canary state often difficult users ascertain canary validity thus canary watch aimed provide simple display active canaries blocks time active may 2016 announced canary watch longer accept submissions new canaries monitor existing canaries changes take downs coalition organizations created canary watch explained decision discontinue project stating achieved goals raise awareness illegal unconstitutional national security process including national security letters secret court processes electronic frontier foundation also noted fact canaries non-standard makes difficult automatically monitor changes takedowns | [
1315,
7437,
8446,
4063
] | Train |
2,361 | 2 | Comparison_of_OpenGL_and_Direct3D:comparison opengl direct3d direct3d opengl competing application programming interfaces apis used applications render 2d 3d computer graphics hardware acceleration process commonplace since approximately 1999. graphics processing units gpus almost always implement one version apis examples include directx 9 opengl 2 circa 2004 directx 10 opengl 3 circa 2008 recently directx 11 opengl 4 circa 2011 gpus support recent versions standards backward-compatible applications use older standards example one run older directx 9 games recent directx 11-certified gpu direct3d application development targets microsoft windows platform opengl api open standard means various hardware makers operating system developers freely create opengl implementation part system opengl implementations exist wide variety platforms notably opengl dominating graphics api unix-like computer systems application developer perspective direct3d opengl equally open full documentation necessary development tools available restrictions detail two computer graphics apis following note many essential opengl extensions methods although documented also patented thus imposing serious legal troubles implement see issues mesa opengl direct3d implemented display device driver significant difference however direct3d implements api common runtime supplied microsoft turn talks low-level device driver interface ddi opengl every vendor implements full api driver means api functions may slightly different behavior one vendor next glsl shader compilers different vendors also show slightly different behavior following compares two apis structured around various considerations mostly relevant game development proprietary direct3d officially implemented microsoft windows family operating systems including embedded versions used xbox family video game consoles sega dreamcast several mostly functional reimplementations direct3d api made third parties wine project port common windows apis unix-like operating systems cedega proprietary fork wine however process progressively impeded due interdependence directx upon many proprietary components windows direct3d proprietary nature requires difficult process reverse engineering opengl implementations available across many platforms including microsoft windows unix-based systems mac os x linux nintendo sony developed libraries similar identical opengl subset opengl chosen main graphics library android blackberry ios symbian opengl es form microsoft opengl driver provides hardware acceleration windows vista support dropped windows xp soon failed deliver fahrenheit graphics api low level support opengl-direct3d merger late 1990s opengl hardware acceleration windows achieved users first installing installable client drivers icds developed gpu makers icds virtually cases bundled standard driver download package hardware vendor ihv installing recent graphics drivers sufficient provide hardware opengl support recently google almost native graphics layer engine angle project provides means convert opengl es 2.0 application calls directx 9 done webgl subset variant opengl web run common direct3d runtime means less variation vendors first version direct3d 1996 elicited broad criticism even simple operations state changes required creating submitting objects called execute buffers contrast opengl state changes performed one function call direct3d model frustrated many programmers famous complaint made high-profile game developer john d. carmack codice_1 file urged microsoft abandon direct3d favor opengl chris hecker made similar request open letter microsoft aprilβmay 1997 issue game developer magazine version 5 second version named reflect release part directx 5 replaced execute buffers new drawprimitive api still considered cumbersome chris hecker open letter microsoft referred drawprimitive immature poorly-designed clone opengl missing architectural decisions make opengl fast despite controversy microsoft continued evolve api detailed history releases added features given microsoft direct3d web pages former critics direct3d acknowledge direct3d good better opengl abilities ease use january 2007 john carmack said β¦dx9 really quite good api level even direct3d side things know long history people thinking 'm antagonistic microsoft done good job sensibly evolving stepβthey 're worried breaking backwards compatibilityβand pretty clean api especially like work 'm 360 probably best graphics api far sensibly designed thing 've worked design features direct3d remained unchanged since version one notably reliance microsoft component object model com one advantage using com api used com-aware language notably object pascal delphi microsoft visual c++ c visual basic .net opengl specification implemented programming language c though used languages built concept state machine api opengl depends one programming language feature made callable almost language proper bindings bindings exist current programming languages general direct3d designed virtualize 3d hardware interfaces direct3d frees game programmer accommodating graphics hardware opengl hand designed 3d hardware-accelerated rendering system may emulated software two apis fundamentally designed two separate modes thought functional differences two apis work one functional difference apis manage hardware resources direct3d expects application opengl makes implementation tradeoff opengl decreases difficulty developing api time increasing complexity creating implementation driver performs well direct3d developer must manage hardware resources independently however implementation simpler developers flexibility allocate resources efficient way possible application 2005 another functional difference apis way handled rendering textures direct3d method codice_2 convenient prior versions opengl required manipulating pixel buffers p-buffers cumbersome risky codepath used program different anticipated driver maker code would fall back software rendering causing substantial performance drop however broad support frame buffer objects extension provided opengl equivalent direct3d method successfully addressed shortcoming render target feature opengl brought par direct3d aspect outside minor functional differences mostly addressed years two apis provide nearly level function hardware software makers generally respond rapidly changes directx e.g. pixel processor shader requirements directx 9 stream processors directx 10 tessellation directx 11 contrast new features opengl usually implemented first vendors retroactively applied standard shortly establishment direct3d opengl viable graphics libraries circa 1995 microsoft sgi engaged called api wars much argument revolved around api offered superior performance question relevant due high cost dedicated graphics processors time meant consumer market using software renderers implemented microsoft direct3d opengl dos business software autocad dos games id software quake originally optimized run many different graphics chipsets hardware makers 3dlabs member opengl architecture review board made opengl compatible graphics accelerators e.g. glint chip developers john carmack id software optimized products opengl multitasking user environments windows x window system x11 unix-like systems became prevalent relevance hardware faded microsoft marketed direct3d faster based in-house performance comparisons two software libraries performance deficit blamed rigorous specification conformance required opengl perception changed 1996 special interest group graphics interactive techniques siggraph conference time silicon graphics sgi challenged microsoft optimized windows software implementation opengl called cosmogl various demos matched exceeded performance direct3d sgi critical milestone showed opengl poor software rendering performance due microsoft reference opengl implementation due alleged design flaws opengl contrast software rendering 3d api largely irrelevant direct3d opengl applications many directx applications used direct3d software rendering preferring perform software rendering using directdraw facilities access display hardware opengl applications hardware support expected hardware much faster software fallback opengl application constituted rude surprise opengl developer case time sgi demonstrated opengl software rendering performance could competitive direct3d software rendering fast becoming irrelevant due wide availability low cost 3d graphics hardware 1998 even s3 virge graphics accelerator substantially faster fastest pentium ii running direct3d mmx rasterizer substantive modern performance difference arises structure hardware drivers provided hardware developers directx independent hardware vendor ihv drivers kernel-mode drivers installed operating system user-mode part api handled directx runtime provided microsoft opengl however ihv driver divided two parts user-mode part implements opengl api kernel-mode driver called user-mode part issue calling kernel-mode operations user-mode requires performing system call i.e. making cpu switch kernel mode slow operation taking order microseconds complete time cpu perform operations minimizing number times switching operation occurs would improve performance example gpu command buffer full rendering data api could simply store requested rendering call temporary buffer command buffer nearly empty perform switch kernel-mode add set stored commands batch termed marshalling direct3d ihv drivers kernel-mode user-mode code ihv hand chance optimizations occur direct3d runtime user-mode part implements api explicit knowledge driver inner workings effectively support marshalling means every direct3d call sends commands hardware must perform kernel-mode switch takes time order microseconds complete led several behaviors regarding use direct3d important need submitting large batches triangles one function call since opengl ihv drivers user-mode component ihvs ability implement marshalling thus improving performance still kernel-mode switching theoretical maximum number switches opengl implementations simply equal direct3d standard behavior direct3d 10 release included windows vista allows parts drivers run user-mode making possible ihvs implement marshalling thus bringing two back relative performance parity mac os x opengl system similar ihvs implement simpler version opengl api user kernel mode components apple additions runtime provide direct interface user code basic work make ihvs jobs easier introduction mantle amd lead increased discussion modernizing apis updating abstraction concepts used apis reflect graphics processing unit gpu operations microsoft opengl vendors began showcase visions limiting removing altogether driver overhead amount work cpu needs prepare gpu commands march 2014 microsoft presented basic assumptions goals directx12 3d component ready december 2015 opengl vendors took different approach gdc 2014 presented mix features mandatory opengl 4.3 opengl 4.4 already arb extensions show fast paths already present implementations nvidia amd intel later amd donated mantle khronos group api renamed vulkan current cross-platform api dedicated reduce driver overhead better distributing work among multiple cpu gpu cores using unified management compute kernels graphical shaders presentation apitest introduced new tool microbenchmarking specific solutions given problems emphasizing exploration fast paths current apis opengl 4.x direct3d 11 supported gathered results showed modern opengl many times faster direct3d 11 opengl originally designed then-powerful sgi workstations includes many features like stereo rendering imaging subset generally considered limited use games although stereoscopic gaming drawn interest development consumer-level 3d displays api whole contains 250 calls subset perhaps 100 useful game development however official gaming-specific subset ever defined minigl released 3dfx stopgap measure support glquake might served starting point additional features like stencil soon adopted games support full opengl standard continued today workstations consumer machines use architectures operating systems modern versions opengl standard still include features although special workstation-class video cards accelerate opengl extension mechanism probably heavily disputed difference two apis opengl includes mechanism driver advertise extensions api thus introducing new functions blend modes new ways transfer data gpus different texture wrapping parameters allows new functions exposed quickly lead confusion different vendors implement similar extensions different apis many extensions periodically standardized opengl architecture review board arb made core part future opengl revisions hand direct3d specified one vendor microsoft leading consistent api denying access vendor-specific features nvidia ultrashadow technology instance available stock direct3d apis time writing noted direct3d support texture format extensions via fourcc little-known rarely used used s3 texture compression graphics cards added support pixel shaders known opengl fragment shaders direct3d provided one pixel shader 1.1 ps1.1 standard geforce 3 radeon 8500 advertised compatibility opengl functions accessed variety custom extensions theory microsoft approach allows one code path support brands card whereas opengl programmers must write two separate systems reality though limits pixel processing early cards pixel shader 1.1 nothing pseudo-assembly language version nvidia-specific opengl extensions part cards claimed ps 1.1 functionality nvidia built natively radeon 8500 released microsoft released update direct3d included pixel shader 1.4 nothing pseudo-assembly language version ati-specific opengl extensions cards claimed ps 1.4 support ati cards designed precise hardware needed make functionality happen situation existed short time apis second-generation pixel shading cards functioned far similarly architecture evolving toward kind pixel processing conclusion pixel shader 2.0 allowed unified code path direct3d around time opengl introduced arb-approved vertex pixel shader extensions codice_3 codice_4 sets cards supported standard also opengl always seen use professional graphics market directx directx used mostly computer games term professional used refer professional production display graphics computer animated films scientific visualisation opposed games graphics produced end user personal rather professional use currently opengl directx large enough overlap functionality either could used common purposes operating system often main criterion dictating used directx common choice windows opengl nearly everything else esoteric applications still divide applicability two apis accelerated 3d across network connection directly supported opengl opengl extension x window system glx example past many professional graphics cards supported opengl 2010 virtually professional cards work windows platform also support direct3d part change professional graphics market largely unix-based hardware like sgis suns lower cost pc-based systems leading growth windows market segment time providing new market opengl software unix-based consumer systems running linux mac os x principal historical reason opengl dominance professional market performance many professional graphics applications example softimage|3d alias poweranimator originally written iris gl high-end sgi workstations far capable graphically raw cpu power pcs time later many ported opengl even personal computer evolving system powerful enough run professional graphics applications users able run maya example successor alias poweranimator either sgis windows-based personal computers today linux mac os x windows price competition eventually broke sgi dominance market established base opengl software engineers broadening user base opengl apple linux operating systems resulted market directx opengl viable widespread apis reason opengl historic advantage marketing design directx set apis marketed professional graphics applications indeed even designed uses directx api designed low-level high-performance access broadly available lower-performance consumer-priced graphics hardware purpose game development opengl much general purpose 3d api targeting full range graphics hardware low-end commodity graphics cards professional scientific graphics visualization well range average consumer providing features necessarily exclusive specific kind user gaming developers typically n't demanded wide api professional graphics system developers many games n't need overlay planes stencils although n't prevented game developers using available specifically game designers rarely interested pixel invariance demanded certain parts opengl standards conversely highly useful film computer-aided modeling attempt made merge opengl directx sgi microsoft fahrenheit graphics api intended bring together high end ability opengl broad low-level support directx microsoft eventually retreated project never allocated sufficient resources produce part rendering engine move widely held purposed ensure lock-in developers windows-directx platform would lost fahrenheit api became world de facto standard graphics api however fahrenheit led many improvements directx main architect fahrenheit works microsoft directx earliest days 3d accelerated gaming performance reliability key benchmarks several 3d accelerator cards competed dominance software written specific brand graphics card however years opengl direct3d emerged software layers hardware mainly industry support cross-hardware graphics library competition two rose game developer would choose either one early days 3d accelerated gaming vendors supply full opengl driver reason twofold firstly consumer-oriented accelerators implement enough functionality properly accelerate opengl secondly many vendors struggled implement full opengl driver good performance compatibility instead wrote minigl drivers implemented subset opengl enough run glquake later opengl games mostly based quake engine proper opengl drivers became prevalent hardware evolved consumer-oriented accelerators caught sgi systems opengl originally designed would around time directx 6 directx 7 console world proprietary native apis dominant consoles e.g. ps3 providing opengl wrapper around native api original xbox supported direct3d 8.1 native api xbox 360 supports directx9 native api console developers prefer use native apis console maximize performance making opengl direct3d comparisons relevant mostly pc platforms opengl embedded systems called opengl es subset opengl 3d graphics api designed embedded devices various versions smartphone operating systems support opengl es android ios ipad iphone ipod touch maemo nokia n900 symbian opengl es available 6 variants opengl es 1.0 1.1 2.0 3.0 3.1 3.2 release 2.0 removed backward compatibility older variants due extensive programmable pipeline functions available gl es 2.0 fixed-pipeline functions gl es 1.0 1.1 opengl es 3.0 needed new hardware opengl es 2.0 opengl es 3.1 meant software update needing new drivers direct3d mobile direct3d derivative supported windows ce currently windows phone 7 devices use .net framework ui accelerated direct3d mobile 9 adreno 200/205 integrated gpus qualcomm windows phone 8 implements direct3d 11 limited feature level 9_3 | [
8576,
9732,
6539,
6797,
5397,
2208,
10658,
7983,
823,
1083,
8125,
10173,
321,
1346,
10051,
8262,
2259,
11487,
1632,
3300,
10727,
11247,
5492,
3573,
8438,
508,
2045,
2943
] | Validation |
2,362 | 5 | Host_Monitoring_Protocol:host monitoring protocol host monitoring protocol hmp obsolete tcp/ip protocol described rfc 869 | [
10242,
3847,
649,
9868,
3218,
9365,
10005,
11413,
5402,
5531,
3742,
10271,
9380,
2085,
9381,
3751,
3752,
10924,
562,
2996,
9909,
10171,
4797,
5181,
3133,
3006,
5437,
7364,
2887,
8265,
2509,
4687,
5843,
2904,
5469,
5470,
5471,
5472,
10341,
... | Test |
2,363 | 2 | IPhone_OS_1:iphone os 1 iphone os 1 first major release ios apple mobile operating system iphone os 1.1.5 latest last version apple iphone os 1 version ios first iteration touch-centric mobile operating system official name given initial release apple marketing literature simply stated iphone runs version apple desktop operating system macos known mac os x march 6 2008 release iphone software development kit iphone sdk apple named iphone os later went rename ios june 7 2010 succeeded iphone os 2 july 11 2008 iphone os 1.1.3 update cost 19.95 ipod touch users | [
10755,
9732,
1549,
4111,
5647,
7697,
6675,
11289,
6186,
4139,
6700,
1074,
8754,
9784,
8253,
8767,
576,
5696,
8774,
8783,
4180,
10838,
1623,
3672,
9308,
3167,
3681,
9826,
8806,
3691,
8304,
2673,
6264,
7292,
2686,
6783,
7806,
10878,
3722,
7... | Test |
2,364 | 9 | BAPP:bapp acronyms bapp b.a.p.p bamp b.a.m.p refer set open-source software programs commonly used together run dynamic web sites servers set solution stack open source web platform bapp refers bamp refers two acronyms three major uses operating system freebsd bsd descendant generally regarded reliable robust operating systems accurately report uptime remotely freebsd bsd descendants common free operating system listed netcraft list 50 web servers longest uptime uptime operating systems versions linux determined remotely making top choice among isps hosting providers long uptime also indicates kernel updates deemed necessary installing new kernel requires reboot resets uptime counter system though originators open source programs design work specifically combination become popular low acquisition cost ubiquity components come bundled current bsd distributions particularly deployed isps used combination represent solution stack technologies support application servers stacks include unified application development environments apple computer webobjects java/java ee grails microsoft .net architecture scripting component bapp stack origins cgi web interfaces became popular early 1990s technology allows user web browser execute program web server thereby receive dynamic well static content programmers used scripting languages programs ability manipulate text streams easily efficiently even originate disparate sources reason system designers often referred scripting systems glue languages variants term include | [
225,
865,
6850,
8644,
9345,
8582,
6281,
6797,
7022,
7983,
9389,
119,
2485,
9780,
823,
8539,
4439,
9151
] | Test |
2,365 | 2 | IPhone_OS_2:iphone os 2 iphone os 2 second major release ios mobile operating system developed apple inc. successor iphone os 1 first release ios support third-party applications via app store iphone os 2.2.1 final version iphone os 2 succeeded iphone os 3 june 17 2009. iphone os 2.0 became available july 11 2008 release iphone 3g devices running 1.x upgradable version version ios introduces app store making third-party applications available iphone ipod touch prior public release iphone os 2.0 apple held keynote event announce iphone os software development kit sdk developers notable feature iphone os 2 app store feature introduced way install custom applications device via jailbreaking strongly discouraged unsupported apple 500 applications available download launch app store though amount grown dramatically since app store 2 million apps 2016 mail app makeover push-emails provide always-on capability also supports microsoft office attachments well iwork attachments new features including support bcc multiple email delete ability select outgoing email contacts app new home screen icon available ipod touch along release ability search contacts without searched one-by-one well sim contacts import ability new features added maps app iphone os 2.2 software update among features added inclusion google street view directions public transit walking ability display address dropped pin device landscape mode calculator app displays scientific calculator also app icon updated settings ability turn wifi back airplane mode well ability turn on/off location services within app rene ritchie imore said overall iphone firmware 2.0 stunning achievement really puts iphone par apple ii mac one great revolutions modern technology takes beyond simple phone ipod even smartphone makes leading contender next great shift computing however criticized stability issues overall sluggishness macworld said iphone 2.0 software full kind refinements β expect second-generation apple product iphone os still β perfect wish apple addressed lingering shortcomings β welcome step-up already arguably best mobile platform market iphone os 2 cost 9.95 ipod touch users free iphone users | [
10755,
9732,
1549,
4111,
5647,
7697,
6675,
11289,
6186,
4139,
6700,
1074,
8754,
9784,
8253,
8767,
576,
5696,
8774,
8783,
4180,
10838,
1623,
3672,
9308,
3167,
3681,
9826,
8806,
3691,
2673,
6264,
7292,
2686,
6783,
7806,
10878,
5784,
1177,
4... | Validation |
2,366 | 2 | IPhone_OS_3:iphone os 3 iphone os 3 third major release ios mobile operating system developed apple inc. successor iphone os 2 announced march 17 2009 released june 17 2009 succeeded ios 4 june 21 2010 new version dropped iphone os naming convention iphone os 3 last version use iphone os naming convention iphone os 3 added system-wide cut copy paste dialog bubble allowing users easily move content also introduced spotlight search indexing feature designed help users locate specific information device contacts email messages apps home screen expanded let users add 11 pages showcasing total 180 apps messages app received support mms camera app received support video recording iphone 3gs new voice memos app let users record voice iphone os 3 announced march 17 2009 beta version available developers day iphone os 3 officially released june 17 2009. iphone os 3 introduced cut copy paste bubble dialog users double-tap text paste button would incorporate anything stored device clipboard marked area spotlight system-wide indexing search feature aiming help users search device specific contacts email messages calendar appointments multimedia files apps accessed swiping right home screen iphone os 3 expands maximum number pages home screen 11 total number 180 apps messages app received native support multimedia messaging service mms allowing users send receive messages also contain pictures contacts locations voice recordings video messages camera app introduced video recording iphone 3gs photos app featured new copy button ability delete multiple photos iphone os 3 added voice memos app allowing users record voice upgrading iphone os 3 free iphone upgrading iphone os 3 cost ipod touch users 5 10 depending device purchase date iphone os 3 last ios charge ipod touch users upgrade starting ios 4 ios upgrades became free users including users ipod touch | [
10755,
9732,
1549,
4111,
5647,
7697,
6675,
11289,
6186,
4139,
6700,
1074,
8754,
9784,
8253,
8767,
576,
5696,
8774,
8783,
4180,
10838,
1623,
3672,
9308,
3167,
3681,
9826,
8806,
3691,
2673,
6264,
7292,
2686,
6783,
7806,
10878,
5784,
1177,
4... | Validation |
2,367 | 4 | Weird_machine:weird machine computer security weird machine computational artifact additional code execution happen outside original specification program closely related concept weird instructions building blocks exploit based crafted input data expected valid input activates normal intended functionality computer program input unexpected program developer may activate unintended functionality weird machine consists unintended functionality programmed selected inputs exploit classical attack taking advantage stack buffer overflow input given vulnerable program crafted delivered becomes executed program code however data areas program memory protected executed directly like input may instead take form pointers pieces existing program code become executed unexpected order generate functionality exploit snippets code used exploit referred gadgets context return-oriented programming interpretation data code weird machine functionality definition outside original program specification reached also proof-carrying code pcc formally proven function certain specific way disparity essentially caused disconnect formal abstract modelling computer program real-world instance influenced events captured original abstraction memory errors power outages two central categories mitigation problems caused weird machine functionality include input validation within software protecting problems arising platform program runs memory errors input validation aims limit scope forms unexpected inputs e.g whitelists allowed inputs software program would end unexpected state interpreting data internally equally importantly secure programming practices protecting buffer overflows make less likely input data becomes interpreted unintended ways lower layers hardware program executed | [
1474,
642,
522,
1103,
3473,
4562,
1820,
2558
] | Test |
2,368 | 2 | OpenAL:openal openal open audio library open open-source cross-platform audio application programming interface api designed efficient rendering multichannel three-dimensional positional audio api style conventions deliberately resemble opengl openal environmental 3d audio library add realism game simulating attenuation degradation sound distance doppler effect change frequency result motion material densities openal aimed originally open standard open-source replacement proprietary generally incompatible one another 3d audio systems eax a3d reference implementation later became proprietary open source implementations openal soft available openal originally developed 2000 loki software help business porting windows games linux demise loki project maintained time free software/open source community implemented nvidia nforce sound cards motherboards hosted largely developed creative technology on-going support apple blue ripple sound via rapture3d openal driver individual open-source developers openal charter says architecture review board arb modeled opengl arb organization ever formed openal specification generally handled discussed via email public mailing list since 1.1 implementation creative turned proprietary last releases free licenses still accessible project subversion source code repository however openal soft widely used open source alternative general functionality openal encoded source objects audio buffers single listener source object contains pointer buffer velocity position direction sound intensity sound listener object contains velocity position direction listener general gain applied sound buffers contain audio data pcm format either 8- 16-bit either monaural stereo format rendering engine performs necessary calculations far distance attenuation doppler effect etc net result end user properly written openal application sounds behave quite naturally user moves three-dimensional space virtual world programmer perspective little additional work required make happen existing opengl-based 3d graphical application unlike opengl specification openal specification includes two subsections api core consisting actual openal function calls alc audio library context api used manage rendering contexts resource usage locking cross platform manner also 'alut audio library utility toolkit library provides higher level 'convenience functions β exactly analogous opengl 'glut order provide additional functionality future openal utilizes extension mechanism individual vendors thereby able include extensions distributions openal commonly purpose exposing additional functionality proprietary hardware extensions promoted arb architecture review board status indicating standard extension maintained backwards compatibility arb extensions prospect added core api period time advanced digital signal processing hardware-accelerated sound effects efx effects extension environmental audio extensions eax used single listener model openal tailored single human user fit artificial intelligence robotic simulations multiple human participants collaborative musical performances cases multiple listener model required openal also fails take account sound propagation delays speed sound used doppler effect distance sound source translates amplitude effect attenuation delay hence openal used time difference arrival calculations unless functionality added separately api available following platforms operating systems android supports opensl es amigaos 3.x 4.x bada blackberry 10 blackberry playbook bsd ios supports core audio irix linux supports alsa oss portaudio pulseaudio mac os 8 mac os 9 mac os x core audio microsoft windows supports directsound windows multimedia api windows multimedia device mmdevice api morphos openbsd solaris qnx aros supported gaming devices instance gamecube playstation 2 playstation 3 xbox xbox 360 wii playstation portable following video games known use openal | [
10369,
10371,
3210,
6797,
3734,
162,
6180,
2221,
8621,
7983,
4919,
823,
7991,
6971,
2368,
9408,
7108,
9799,
10316,
593,
11602,
4182,
4699,
10076,
3167,
10080,
2658,
9320,
8937,
5612,
10480,
8561,
10359,
10360,
10363,
2045,
6910,
2943
] | Test |
2,369 | 1 | Outline_of_databases:outline databases following outline provided overview topical guide databases database β organized collection data today typically digital form data typically organized model relevant aspects reality example availability rooms hotels way supports processes requiring information example finding hotel vacancies databases described following database languages β database security β database design β database management system β data warehouse β | [
5632,
8201,
2068,
5658,
5151,
5157,
8742,
10286,
11324,
9286,
72,
10326,
7767,
11360,
11362,
9828,
8808,
2669,
2681,
1146,
10389,
5271,
1697,
5794,
4263,
10413,
5808,
10418,
9397,
3768,
9942,
2780,
10471,
6383,
7412,
9467,
6395,
1283,
9481,... | None |
2,370 | 4 | DeCSS:decss decss one first free computer programs capable decrypting content commercially produced dvd video disc release decss linux-based computing systems could play encrypted video dvds decss development done without license dvd copy control association cca organization responsible dvd copy protectionβnamely content scramble system css used commercial dvd publishers release decss resulted norway criminal trial subsequent acquittal one authors decss dvd cca launched numerous lawsuits united states effort stop distribution software decss devised three people two remain anonymous released internet mailing list livid october 1999 one known author trio norwegian programmer jon lech johansen whose home raided 2000 norwegian police still teenager time put trial norwegian court violating norwegian criminal code section 145 faced possible jail sentence two years large fines acquitted charges early 2003 5 march 2003 norwegian appeals court ruled johansen would retried court said arguments filed prosecutor additional evidence merited another trial 22 december 2003 appeals court agreed acquittal 5 january 2004 norway ΓΈkokrim economic crime unit decided pursue case program first released 6 october 1999 johansen posted announcement decss 1.1b closed source windows-only application dvd ripping livid-dev mailing list source code leaked end month first release decss preceded weeks program called dod dvd speed ripper group called drinkordie also faced later raids piracy prosecutions jail one member even extradited australia usa prosecution despite never set foot n't include source code apparently work dvds drink die reportedly disassembled object code xing dvd player obtain player key group wrote decss including johansen came call masters reverse engineering may obtained information drink die css decryption source code used decss mailed derek fawcus decss released decss source code leaked fawcus noticed decss included css-auth code violation gnu gpl johansen made aware contacted fawcus solve issue granted license use code decss non-gpl terms 22 january 2004 dvd cca dropped case jon johansen decss program collaborative project johansen wrote graphical user interface transcripts borgarting court appeal published norwegian newspaper verdens gang contain following description process led release decss internet relay chat henceforth irc jon lech johansen made contact like-minded people seeking develop dvd-player linux operating system 11 september 1999 conversation mdx encryption algorithm css could found using poorly secured software-based dvd-player conversation jon lech johansen mdx 22 september mdx informs nomad found code css decryption mdx would send code jon lech johansen nomad allegedly found decryption algorithm so-called reverse engineering xing dvd-player decryption keys less openly accessible information made possible mdx create code css_scramble.cpp retrieved chat logs dated 4 november 1999 25 november 1999 appears nomad carried reverse engineering process xing player characterized illegal case presented high court known jon lech johansen 4 november 1999 regarding authentication code high court takes basis nomad obtained code electronic mailing list livid linux video internet created derek fawcus appears livid posting dated 6 october 1999 derek fawcus date read decss source code compared appears creators decss taken derek fawcus code almost verbatim alteration removal derek fawcus copyright header paragraph containing commentaries change function names name code css_auth.cpp high court takes basis program jon lech johansen later programmed graphical user interface consisted nomad decryption algorithm derek fawcus authentication package creation graphical user interface made program accessible also users without special knowledge programming program published internet first time 6 october 1999 jon lech johansen tested movie matrix downloaded approximately 2.5 200 megabytes movie hard drive computer file film fragment jon lech johansen saved computer release decss source code made css algorithm available public scrutiny soon found susceptible brute force attack quite different decss encryption 40-bit use keys high-end home computer 1999 running optimized code could brute-force within 24 hours modern computers brute-force seconds less programmers around world created hundreds programs equivalent decss merely demonstrate trivial ease system could bypassed others add dvd support open source movie players licensing restrictions css make impossible create open source implementation official channels closed source drivers unavailable operating systems users need decss watch even legally obtained movies first legal threats sites hosting decss beginning decss mirroring campaign began early november 1999 universal v. reimerdes preliminary injunction dvd copy control association inc. v. bunner followed soon january 2000 response threats program also called decss unrelated function developed program used strip cascading style sheets tags html pages one case school removed student webpage included copy program mistaking original decss program received great deal negative media attention css stripping program specifically created bait mpaa manner protest legislation prohibits publication copy protection circumvention code countries implement wipo copyright treaty united states digital millennium copyright act devised clever ways distributing descriptions decss algorithm steganography various internet protocols t-shirts dramatic readings midi files haiku poem decss haiku even so-called illegal prime number lawrence lessig future ideas 2001 p. 187-190 freely available | [
8037,
2885,
6797,
823,
2587,
10173,
8923
] | Validation |
2,371 | 9 | Chris_Tomic:chris tomic chris tomic born 1978 german computer scientist inventor entrepreneur reality tv personality featured several television shows mostly german news channel n-tv television studies germany heinrich-heine-universitΓ€t dΓΌsseldorf started developing technologies internet mobile industry dΓΌsseldorf company novadoc gmbh 2001 tomic created ucp protocol set standard worldwide first delivery binary messages mobile handsets operator-logos monophonic ringtones 1998 executive director company novadoc gmbh focused research development secure mobile payments micropayments sms mobile payments 2001 became cto company monstermob ltd uk 2003 monstermob ltd floated london stock exchange opening market capitalisation Β£32m spanish internet firm lanetro zed bought majority 53 stake business agreement mean lanetro zed monstermob ltd together become world largest company mobile value-added services mvas market terms revenue enlarged company operating 31 countries around world employing 1,200 staff | [] | None |
2,372 | 9 | Rasmus_Lerdorf:rasmus lerdorf rasmus lerdorf born 22 november 1968 danish-canadian programmer co-authored inspired php scripting language authoring first two versions language participated development later versions led group developers including jim winstead later created blo.gs stig bakken shane caraveo andi gutmans zeev suraski continues contribute project lerdorf born disko island greenland moved denmark early years lerdorf family moved canada denmark 1980 later moved king city ontario 1983 graduated king city secondary school 1988 1993 graduated university waterloo bachelor applied science systems design engineering contributed apache http server added limit clause msql dbms variant limit clause already around decade mainframe relational database management systems like oracle rdb running vax/vms formerly digital equipment corporation apparently yet picked emerging pc-based databases later adapted several sql-compatible dbms released first version php 1995 september 2002 november 2009 lerdorf employed yahoo inc. infrastructure architecture engineer 2010 joined wepay order develop application programming interface throughout 2011 roving consultant startups 22 february 2012 announced twitter joined etsy july 2013 rasmus joined jelastic senior advisor help creation new technology lerdorf frequent speaker open source conferences around world keynote presentation oscms 2007 presented security vulnerability projects represented conference year lerdorf also appeared wearedevelopers conferences 2017 2019 making speech history php new php 7 release 2017 25 years php.. 2003 lerdorf named mit technology review tr100 one top 100 innovators world age 35 | [
6154,
9614,
3986,
8986,
8735,
2465,
2727,
190,
8644,
1353,
4171,
10587,
11357,
865,
3553,
7785,
7147,
4853,
8057,
11259,
7293
] | None |
2,373 | 5 | SILC_(protocol):silc protocol silc secure internet live conferencing protocol protocol provides secure synchronous conferencing services much like irc internet silc protocol divided three main parts silc key exchange ske protocol silc authentication protocol silc packet protocol silc protocol additionally defines silc commands used manage silc session silc provides channels groups nicknames private messages common features however silc nicknames contrast many protocols e.g irc unique user able use nickname even one already use real identification protocol performed unique client id silc protocol uses overcome nickname collision problem present many protocols messages sent silc network binary allowing contain type data including text video audio multimedia data ske protocol used establish session key security parameters protecting silc packet protocol ske based diffie-hellman key exchange algorithm form asymmetric cryptography exchange protected digital signatures silc authentication protocol performed successful ske protocol execution authenticate client and/or server authentication may based passphrase digital signatures successful gives access relevant silc network silc packet protocol intended secure binary packet protocol assuring content packet consisting packet header packet payload secured authenticated packets secured using algorithms based symmetric cryptography authenticated using message authentication code algorithm hmac silc channels groups protected using symmetric channel keys optionally possible digitally sign channel messages also possible protect messages privately generated channel key previously agreed upon channel members private messages users silc network protected session keys however possible execute ske protocol two users use generated key protect private messages private messages may optionally digitally signed messages secured key material generated ske protocol previously agreed upon key material example passphrases silc provides security even silc server may compromised silc designed pekka riikonen 1996 1999 first released public summer 2000 client server written protocol specifications proposed ultimately request publication denied june 2004 iesg rfc published date present time several clients advanced official silc client irssi plugin silc protocol also integrated popular pidgin instant messaging client gui clients silky colloquy silky client put hold abandoned 18th july 2007 due inactivity several years latest news silky website client completely rewritten 2008 three silc protocol implementations written silc clients use libsilc part silc toolkit silc toolkit dual-licensed distributed gnu general public license gpl revised bsd license described silc faq chats secured generation symmetric encryption keys keys generated somewhere occurs server means chats might compromised server compromised version man-in-the-middle attack solution offered chat members generate public-private keypair asymmetric encryption private key shared chat members done band public key used encrypt messages channel approach still open compromise one members chat private key compromised share key another without agreement group silc uses similar pattern irc global silc network many small independent networks consisting one several servers although claimed silc scale better many servers single network original network called silcnet silc.silcnet.org round-robin however may 2014 one active though unstable server four several public networks known external links section however also shut due declining popularity silc | [
10242,
3847,
649,
4490,
9868,
3218,
9365,
10005,
11413,
5402,
5531,
3742,
10271,
9380,
2085,
9381,
3751,
3752,
10924,
562,
2996,
9909,
8758,
10171,
4797,
3133,
3006,
5181,
5437,
7364,
2887,
8265,
2509,
4687,
6993,
5843,
2904,
5469,
5470,
... | Test |
2,374 | 9 | Transformation_language:transformation language transformation language computer language designed transform input text certain formal language modified output text meets specific goal program transformation systems stratego/xt txl tom dms asf+sdf transformation languages major component transformation languages systems driven declarative descriptions structure input text typically grammar allowing applied wide variety formal languages documents macro languages kind transformation languages transform meta language specific higher programming language like java c++ fortran lower-level assembly language model-driven engineering technical space model transformation languages mtls take input models conforming given metamodel produce output models conforming different metamodel example language qvt omg standard also low-level languages lx family implemented bootstrapping method l0 language may considered assembler transformation languages also high-level graphical language built upon lx called mola number xml transformation languages include tritium xslt xquery stx fxt xduce cduce haxml xmlambda flexml concepts languages typical transforms | [
9345,
515,
5896,
8973,
6032,
6420,
6182,
4519,
5677,
10927,
10672,
305,
8262,
4042,
11475,
3159,
987,
477,
605,
4064,
10474,
5228,
4980,
502,
6775,
3960
] | Validation |
2,375 | 4 | ClearOS:clearos clearos also known clearos system formerly clarkconnect operating system marketed software company clearcenter based centos red hat enterprise linux designed use small medium enterprises network gateway network server web-based administration interface positioned alternative windows small business server clearos succeeds clarkconnect software built clearfoundation support services purchased clearcenter clearos 5.1 removes previous limitations mail dmz multiwan functions clearos 6.1 release distribution full-featured operating system gateway network servers built source packages red hat enterprise linux features include | [
4611,
3079,
3089,
4113,
8209,
8727,
543,
11297,
7204,
9253,
11305,
561,
56,
3129,
4153,
59,
8248,
9276,
4673,
3654,
5190,
3147,
2125,
1107,
1110,
2134,
89,
5721,
4192,
3685,
10860,
5742,
2671,
11388,
2692,
8837,
9353,
9873,
11410,
8857,
... | Validation |
2,376 | 5 | SIP_trunking:sip trunking sip trunking enables end point β pbx phone exchange system send receive calls via internet sip applied signalling protocol multiple real-time application sip trunk able control voice video messaging applications also voice internet protocol voip technology streaming media service based session initiation protocol sip internet telephony service providers itsps deliver telephone services unified communications customers equipped sip-based ip pbx unified communications facilities unified communications applications provide voice video streaming media applications desktop sharing web conferencing shared whiteboard architecture sip trunking provides partitioning unified communications network two different domains expertise interconnection two domains must occur sip trunk interconnection two domains created transport via internet protocol ip involves setting specific rules regulations well ability handle services protocols fall name sip trunking itsp responsible applicable regulatory authority regarding following law obligations public domain private domain instead nature subject particular constraints law may either responsibility itsp end user enterprise third party provides voice services company domain elements perform characteristic features requested domain particular result part front-end network customer logically divided two levels private domain consists three levels | [
5472,
5972,
8934,
10271
] | Test |
2,377 | 2 | Joinup_collaboration_platform:joinup collaboration platform joinup collaboration platform created european commission funded european union via interoperability solutions public administrations programme isa programme joinup launched 9 december 2011 replaced open source observatory repository osor.eu semantic interoperability centre europe semic.eu communities funded isa programme two became joinup initial communities site aims let public administrations promote e-government systems specifically offers meeting place collaborative working environment development interoperability joinup hosts communities practice community common assessment method standards specifications camss community national interoperability frameworks observatory nifo platform also raises awareness free open source software semantic interoperability public sector joinup offers catalogue open source software interoperability assets models interoperability maturity model imm target audience includes using developing implementing e-government systems site focuses european public sector projects open others platform three main functions site offers software development tools including software repository apache subversion issue tracker joinup provides access federation catalogue hosted public administrations eu member states standardisation bodies european committee standardization cen european telecommunications standards institute etsi joinup also used european commission directorate general informatics make available applications examples include circabc document management system open e-prior tool help manage electronic procurement online collection software eci help organisations gather signatures support request european commission propose legislation december 2014 isa programme added epractice community joinup platform epractice offers services professional community egovernment einclusion ehealth practitioners january 2015 opengovernment community added ec directorate general communications networks content technology detailed list potential services someone receives registering platform found list software contributions made community new version joinup currently developed one features joinup platform creation maven repositories new projects disappear joinup platform powered tailored version drupal content management framework version 6 downloaded joinup web site latest version 1.7.2 released march 15 2015 software like platform powers suitable used application lifecycle management tool software forge source code past versions found development platform done hosts running debian linux joinup platform runs 10 hosts ec datacentre luxembourg includes load balancer network-attached storage reverse-proxy main part platform three red hat linux hosts running apache webserver drupal fourth linux host running apache tomcat java server apache solr search engine apache maven build automation tools fifth linux host running apache subversion software versioning revisioning system sixth linux host running mysql relational database system seventh gnu mailman platform software used offer similar services involving public administrations regions countries australia new zealand openray platform piloted since june 2012 open technology foundation otf research organisation supporting government sector research evaluation trialling uptake open technologies standards methods 21 november 2013 semantic services federated show openray repository also 21 november 2013 government south australia announced would start piloting internal version joinup platform software test use ec open e-prior south australia test use joinup sharing re-use retrieved 2013-11-24 aim improve collaboration procurement activities openroad similar collaboration platform begun vietnam ministry science technology january 2013 joinup federation similar projects french adullact started 2002 association des dΓ©veloppeurs et utilisateurs de logiciels libres pour les administrations et les collectivitΓ©s territoriales association developers users free software governments local authorities adullact actually inspiration ec's open source observatory repository examples would spanish centro de transferencia de tecnologΓa centre technology transfer la forja de guadalinex hosted junta de andalucia platform could also compared national information exchange model niem xml-based information exchange framework united states however niem designed develop disseminate support information exchange standards processes enable jurisdictions automate information sharing ec joinup sharing information technology joinup might even compared comprehensive knowledge archive network ckan however focuses software packages semantic assets storage distribution data spreadsheets contents databases | [
865,
2948,
9353,
3052,
8717,
7022,
1363,
756,
4919,
8408,
479
] | Test |
2,378 | 6 | Veritas_File_System:veritas file system veritas file system vxfs called jfs onlinejfs hp-ux extent-based file system originally developed veritas software oem agreement vxfs used primary filesystem hp-ux operating system on-line defragmentation resize support turned via license known onlinejfs also supported aix linux solaris opensolaris sinix/reliant unix unixware sco openserver vxfs originally developed unix system laboratories vxfs packaged part veritas storage foundation also includes veritas volume manager according vendor first commercial journaling file system claim taken two ways i.e. first implementation journaling file system commercial context first file system available unbundled product dan koren cited one original developers vxfs notes mailing list finished release 1.0 one year later starting development vxfs contract corporation 1990 sources agree product first released 1991 internet widely available early 1990s getting new file system deployed unix like operating systems difficult one- two-year delay release commercialization file system unusual on-disk layout vxfs versioned upgradeable file system mounted file system gone ten versions vxfs file system run single instance mode parallel access cluster mode parallel mode allows multiple servers also known cluster nodes simultaneously access file system run mode vxfs referred veritas cluster file system cluster file system provides cache coherency posix compliance across nodes data changes atomically seen cluster nodes simultaneously cluster file system shares binaries on-disk layout single instance vxfs moving cluster single instance mode straightforward | [
5120,
2564,
6669,
3598,
10257,
9236,
6677,
5142,
8214,
3611,
9249,
9762,
5158,
7225,
11323,
8772,
1109,
11363,
4708,
9836,
7789,
9333,
6263,
9335,
10872,
9343,
640,
7818,
654,
2193,
2194,
2197,
2199,
10903,
6297,
11419,
6309,
1190,
5286,
... | Test |
2,379 | 3 | Message_Signaled_Interrupts:message signaled interrupts message signaled interrupts msi alternative in-band method signaling interrupt using special in-band messages replace traditional out-of-band assertion dedicated interrupt lines complex implement device message signaled interrupts significant advantages pin-based out-of-band interrupt signaling message signaled interrupts supported pci bus since version 2.2 later available pci express bus non-pci architectures also use message signaled interrupts traditionally device interrupt line pin asserts wants signal interrupt host processing environment traditional form interrupt signaling out-of-band form control signaling since uses dedicated path send control information separately main data path msi replaces dedicated interrupt lines in-band signaling exchanging special messages indicate interrupts main data path particular msi allows device write small amount interrupt-describing data special memory-mapped i/o address chipset delivers corresponding interrupt processor common misconception msi allows device send data processor part interrupt data sent part memory write transaction used chipset determine interrupt trigger processor data available device communicate additional information interrupt handler example pci express separate interrupt pins instead uses special in-band messages allow pin assertion deassertion emulated non-pci architectures also use msi another example hp gsc devices interrupt pins generate interrupts writing directly processor interrupt register memory space hypertransport protocol also supports msi complex implement device message signaled interrupts significant advantages pin-based out-of-band interrupt signaling mechanical side fewer pins makes simpler cheaper reliable connector advantage standard pci connector pci express takes advantage savings msi increases number interrupts possible conventional pci limited four interrupts per card shared among cards using one message signaled interrupts allow dozens interrupts per card useful also slight performance advantage software pin-based interrupt could race posted write memory pci device would write data memory send interrupt indicate dma write complete however pci bridge memory controller might buffer write order interfere memory use interrupt could arrive dma write complete processor could read stale data memory prevent race interrupt handlers required read device ensure dma write finished read moderate performance penalty msi write pass dma write race eliminated pci defines two optional extensions support message signaled interrupts msi msi-x pci express compatible legacy interrupts software level requires msi msi-x msi first defined pci 2.2 permits device allocate 1 2 4 8 16 32 interrupts device programmed address write generally control register interrupt controller 16-bit data word identify interrupt number added data word identify interrupt platforms windows use 32 interrupts use 16 interrupts msi-x first defined pci 3.0 permits device allocate 2048 interrupts single address used original msi found restrictive architectures particular made difficult target individual interrupts different processors helpful high-speed networking applications msi-x allows larger number interrupts gives one separate target address data word devices msi-x necessarily support 2048 interrupts optional features msi 64-bit addressing interrupt masking also mandatory msi-x intel systems lapic must enabled pci pci express msi/msi-x work even uniprocessor single core systems systems msis handled writing interrupt vector directly lapic processor/core needs service interrupt intel lapics 2009 supported 224 msi-based interrupts according 2009 intel benchmark using linux using msi reduced latency interrupts factor almost three compared i/o apic delivery motherboard implementations particularly among pci pci-x bridges non-functional msi support amd-8131 serverworks pci express chipsets among problems least versions linux also observed motherboards nvidia nforce chipsets broken msi support result nvidia enabled msi support graphics card drivers first time many users nforce-based motherboards complained instability eventually traced back msi implementation motherboard users complained errors ranging relatively harmless unresponsive gpus windows vista 7 eventually recover usb devices intermittently ceasing work linux gpu tasked heavy workloads hard freezes blue screens kernel panics platforms later versions drivers blacklist platforms activate msi microsoft family operating systems windows vista later versions support msi msi-x support added longhorn development cycle around 2004 msi supported earlier versions like windows xp windows server 2003 solaris express release 6/05 added support msi msi-x part new device driver interface ddi interrupt framework freebsd 6.3 7.0 added support msi msi-x openbsd 5.0 added support msi 6.0 added support msi-x linux gained support msi msi-x around 2003 linux kernel versions 2.6.20 known serious bugs limitations implementation msi/msi-x haiku gained support msi around 2010 msi-x support added later 2013 netbsd 8.0 added support msi msi-x | [
4695,
3272,
5384,
4074,
6184,
2476,
5457,
8625,
823,
3294
] | Train |
2,380 | 2 | MS-DOS_4.0_(multitasking):ms-dos 4.0 multitasking ms-dos 4.0 multitasking release ms-dos developed microsoft based ms-dos 2.0 lack interest oems particularly ibm previously gave microsoft multitasking code ibm pc dos included topview led released scaled-back form sometimes referred european ms-dos 4.0 primarily used confused pc dos 4.00 ms-dos 4.01 later contain multi-tasking features apricot computers pre-announced ms-dos 4.0 early 1986 microsoft demonstrated september year paris trade show however european oems international computers limited icl actually licensed releases software particular ibm declined product concentrating instead improvements ms-dos 3.x new joint development microsoft produce os/2 result project scaled back features promised particular oems delivered september 1987 version multi-tasking ms-dos 4.1 reported developed icl drs professional workstation pws releases made contracts fulfilled july 1988 ibm announced ibm dos 4.0 unrelated product continuing dos 3.3 3.4 leading initial conjecture microsoft might release different version number however microsoft eventually released ms-dos 4.0 ms-dos 4.01 following quickly fix issues many reported well minor improvements support new executable file format key feature release support preemptive multitasking use protected mode available 80386 processors allowed specially-written programs continue executing background mode access user input output returned foreground os reported include time-sliced scheduler interprocess communication via pipes shared memory limited form multitasking considered useful server rather workstation environment particularly coupled ms-net 2.0 released simultaneously limitations ms-dos 3.0 remained including inability use memory 640 kb contributed product lack adoption particularly light need write programs specifically targeted new environment int 21h/ah=87h used distinguish multitasking ms-dos 4.x later ms-dos/pc dos 4.x issues microsoft president jon shirley described specialized version went far saying maybe n't called dos 4.0 although clear whether always intention enthusiastic response oems would resulted true successor dos 3.x marketing positioned additional option dos 3.x workstations xenix higher-end servers multiuser systems | [
8576,
6787,
6148,
10757,
6797,
8976,
3857,
3477,
2201,
5406,
10273,
8098,
7983,
178,
2355,
8499,
9525,
7483,
321,
6596,
8262,
9033,
5067,
6476,
9166,
4305,
4051,
4441,
1247,
5600,
5856,
5220,
8423,
4712,
9194,
8301,
499,
5363,
4727,
3323,... | Test |
2,381 | 9 | Graph_reduction:graph reduction computer science graph reduction implements efficient version non-strict evaluation evaluation strategy arguments function immediately evaluated form non-strict evaluation also known lazy evaluation used functional programming languages technique first developed chris wadsworth 1971 simple example evaluating arithmetic expression follows reduction sequence employs strategy known outermost tree reduction expression evaluated using innermost tree reduction yielding reduction sequence notice reduction order made explicit addition parentheses expression could also simply evaluated right left addition associative operation represented tree expression looks like term tree reduction comes represented tree think innermost reduction working bottom outermost works top expression also represented directed acyclic graph allowing sub-expressions shared trees outermost innermost reduction also applies graphs hence graph reduction evaluation outermost graph reduction proceed follows notice evaluation requires four steps outermost graph reduction referred lazy evaluation innermost graph reduction referred eager evaluation combinator graph reduction fundamental implementation technique functional programming languages program converted combinator representation mapped directed graph data structure computer memory program execution consists rewriting parts graph reducing move towards useful results concept graph reduction allows evaluated values shared first developed chris wadsworth 1971 ph.d. dissertation dissertation cited peter henderson james h. morris jr. 1976 paper β lazy evaluator β introduced notion lazy evaluation 1976 david turner incorporated lazy evaluation sasl using combinators sasl early functional programming language first developed turner 1972 | [
4769,
10403,
6536,
10618,
10043,
1982
] | None |
2,382 | 4 | IBM_4767:ibm 4767 ibm 4767 pcie cryptographic coprocessor hardware security module hsm includes secure cryptoprocessor implemented high-security tamper resistant programmable pcie board specialized cryptographic electronics microprocessor memory random number generator housed within tamper-responding environment provide highly secure subsystem data processing cryptography performed sensitive key material never exposed outside physical secure boundary clear format ibm 4767 validated fips pub 140-2 level 4 highest level certification achievable commercial cryptographic devices ibm 4767 data sheet describes coprocessor detail ibm supplies two cryptographic-system implementations toolkits custom application development also available applications may include financial pin transactions bank-to-clearing-house transactions emv transactions integrated circuit chip based credit cards general-purpose cryptographic applications using symmetric key algorithms hashing algorithms public key algorithms operational keys symmetric rsa private generated coprocessor saved either keystore file application memory encrypted master key coprocessor coprocessor identical master key use keys performance benefits include incorporation elliptic curve cryptography ecc format preserving encryption fpe hardware ibm supports 4767 certain ibm z ibm power systems x86 servers linux microsoft windows april 2016 ibm 4767 superseded ibm 4765 discontinued ibm 4767 supported platforms listed successor 4767 ibm 4768 introduced ibm z called crypto express6s cex6s available feature code 0893 links point various relevant cryptographic standards iso 13491 secure cryptographic devices https //www.iso.org/standard/61137.html iso 9564 pin security https //www.iso.org/standard/68669.html ansi x9.24 part 1 key management using symmetric techniques https //webstore.ansi.org/recorddetail.aspx sku=ansi+x9.24-1-2017 ansi x9.24 part 2 key management using asymmetric techniques https //webstore.ansi.org/recorddetail.aspx sku=ansi+x9.24-2-2016 fips 140-2 https //nvlpubs.nist.gov/nistpubs/fips/nist.fips.140-2.pdf | [
6797,
10678,
823
] | Test |
2,383 | 3 | Random-access_memory:random-access memory random-access memory ram form computer memory read changed order typically used store working data machine code random-access memory device allows data items read written almost amount time irrespective physical location data inside memory contrast direct-access data storage media hard disks cd-rws dvd-rws older magnetic tapes drum memory time required read write data items varies significantly depending physical locations recording medium due mechanical limitations media rotation speeds arm movement ram contains multiplexing demultiplexing circuitry connect data lines addressed storage reading writing entry usually one bit storage accessed address ram devices often multiple data lines said 8-bit 16-bit etc devices today technology random-access memory takes form integrated circuit ic chips mos metal-oxide-semiconductor memory cells ram normally associated volatile types memory dram modules stored information lost power removed although non-volatile ram also developed types non-volatile memories exist allow random access read operations either allow write operations kinds limitations include types rom type flash memory called nor-flash two main types volatile random-access semiconductor memory static random-access memory sram dynamic random-access memory dram commercial uses semiconductor ram date back 1965 ibm introduced sp95 sram chip system/360 model 95 computer toshiba used dram memory cells toscal bc-1411 electronic calculator based bipolar transistors commercial mos memory based mos transistors developed late 1960s first commercial dram ic chip intel 1103 introduced october 1970 synchronous dynamic random-access memory sdram later debuted samsung km48sl2000 chip 1992 early computers used relays mechanical counters delay lines main memory functions ultrasonic delay lines could reproduce data order written drum memory could expanded relatively low cost efficient retrieval memory items required knowledge physical layout drum optimize speed latches built vacuum tube triodes later discrete transistors used smaller faster memories registers registers relatively large costly use large amounts data generally dozen hundred bits memory could provided first practical form random-access memory williams tube starting 1947 stored data electrically charged spots face cathode ray tube since electron beam crt could read write spots tube order memory random access capacity williams tube hundred around thousand bits much smaller faster power-efficient using individual vacuum tube latches developed university manchester england williams tube provided medium first electronically stored program implemented manchester baby computer first successfully ran program 21 june 1948 fact rather williams tube memory designed baby baby testbed demonstrate reliability memory magnetic-core memory invented 1947 developed mid-1970s became widespread form random-access memory relying array magnetized rings changing sense ring magnetization data could stored one bit stored per ring since every ring combination address wires select read write access memory location sequence possible magnetic core memory standard form computer memory system displaced solid-state mos metal-oxide-silicon semiconductor memory integrated circuits ics early 1970s prior development integrated read-only memory rom circuits permanent read-only random-access memory often constructed using diode matrices driven address decoders specially wound core rope memory planes semiconductor memory began 1960s bipolar memory used bipolar transistors improved performance could compete lower price magnetic core memory invention mosfet metal-oxide-semiconductor field-effect transistor also known mos transistor mohamed atalla dawon kahng bell labs 1959 led development mos semiconductor memory john schmidt fairchild semiconductor 1964 addition higher performance mos memory cheaper consumed less power magnetic core memory development silicon-gate mos integrated circuit ic technology federico faggin fairchild 1968 enabled production mos memory chips mos memory overtook magnetic core memory dominant memory technology early 1970s integrated bipolar static random-access memory sram invented robert h. norman fairchild semiconductor 1963 followed development mos sram john schmidt fairchild 1964 commercial use sram began 1965 ibm introduced sp95 memory chip system/360 model 95 dynamic random-access memory dram allowed replacement 4 6-transistor latch circuit single transistor memory bit greatly increasing memory density cost volatility data stored tiny capacitance transistor periodically refreshed every milliseconds charge could leak away toshiba toscal bc-1411 electronic calculator introduced 1965 used form capacitive bipolar dram storing 180-bit data discrete memory cells consisting germanium bipolar transistors capacitors 1967 robert h. dennard ibm filed patent single-transistor mos dram memory cell using mosfet transistor first commercial dram ic chip intel 1103 manufactured 8Β΅m mos process capacity 1kb released 1970 synchronous dynamic random-access memory sdram developed samsung electronics first commercial sdram chip samsung km48sl2000 capacity 16mb introduced samsung 1992 mass-produced 1993 first commercial ddr sdram double data rate sdram memory chip samsung 64mb ddr sdram chip released june 1998 gddr graphics ddr form ddr sgram synchronous graphics ram first released samsung 16mb memory chip 1998 two widely used forms modern ram static ram sram dynamic ram dram sram bit data stored using state six-transistor memory cell form ram expensive produce generally faster requires less dynamic power dram modern computers sram often used cache memory cpu dram stores bit data using transistor capacitor pair together comprise dram cell capacitor holds high low charge 1 0 respectively transistor acts switch lets control circuitry chip read capacitor state charge change form memory less expensive produce static ram predominant form computer memory used modern computers static dynamic ram considered volatile state lost reset power removed system contrast read-only memory rom stores data permanently enabling disabling selected transistors memory altered writeable variants rom eeprom flash memory share properties rom ram enabling data persist without power updated without requiring special equipment persistent forms semiconductor rom include usb flash drives memory cards cameras portable devices solid-state drives ecc memory either sram dram includes special circuitry detect and/or correct random faults memory errors stored data using parity bits error correction codes general term ram refers solely solid-state memory devices either dram sram specifically main memory computers optical storage term dvd-ram somewhat misnomer since unlike cd-rw dvd-rw need erased reuse nevertheless dvd-ram behaves much like hard disc drive somewhat slower memory cell fundamental building block computer memory memory cell electronic circuit stores one bit binary information must set store logic 1 high voltage level reset store logic 0 low voltage level value maintained/stored changed set/reset process value memory cell accessed reading sram memory cell type flip-flop circuit usually implemented using fets means sram requires low power accessed expensive low storage density second type dram based around capacitor charging discharging capacitor store 1 0 cell however charge capacitor slowly leaks away must refreshed periodically refresh process dram uses power achieve greater storage densities lower unit costs compared sram useful memory cells must readable writeable within ram device multiplexing demultiplexing circuitry used select memory cells typically ram device set address lines a0 ... combination bits may applied lines set memory cells activated due addressing ram devices virtually always memory capacity power two usually several memory cells share address example 4 bit 'wide ram chip 4 memory cells address often width memory microprocessor different 32 bit microprocessor eight 4 bit ram chips would needed often addresses needed provided device case external multiplexors device used activate correct device accessed one read over-write data ram many computer systems memory hierarchy consisting processor registers on-die sram caches external caches dram paging systems virtual memory swap space hard drive entire pool memory may referred ram many developers even though various subsystems different access times violating original concept behind random access term ram even within hierarchy level dram specific row column bank rank channel interleave organization components make access time variable although extent access time rotating storage media tape variable overall goal using memory hierarchy obtain highest possible average access performance minimizing total cost entire memory system generally memory hierarchy follows access time fast cpu registers top slow hard drive bottom many modern personal computers ram comes easily upgraded form modules called memory modules dram modules size sticks chewing gum quickly replaced become damaged changing needs demand storage capacity suggested smaller amounts ram mostly sram also integrated cpu ics motherboard well hard-drives cd-roms several parts computer system addition serving temporary storage working space operating system applications ram used numerous ways modern operating systems employ method extending ram capacity known virtual memory portion computer hard drive set aside paging file scratch partition combination physical ram paging file form system total memory example computer 2 gb ram 1 gb page file operating system 3 gb total memory available system runs low physical memory swap portions ram paging file make room new data well read previously swapped information back ram excessive use mechanism results thrashing generally hampers overall system performance mainly hard drives far slower ram software partition portion computer ram allowing act much faster hard drive called ram disk ram disk loses stored data computer shut unless memory arranged standby battery source sometimes contents relatively slow rom chip copied read/write memory allow shorter access times rom chip disabled initialized memory locations switched block addresses often write-protected process sometimes called shadowing fairly common computers embedded systems common example bios typical personal computers often option called β use shadow bios β similar enabled functions rely data bios β rom instead use dram locations also toggle shadowing video card rom rom sections depending system may result increased performance may cause incompatibilities example hardware may inaccessible operating system shadow ram used systems benefit may hypothetical bios used booting favor direct hardware access free memory reduced size shadowed roms several new types non-volatile ram preserve data powered development technologies used include carbon nanotubes approaches utilizing tunnel magnetoresistance amongst 1st generation mram 128 kib bytes chip manufactured 0.18 Β΅m technology summer 2003 june 2004 infineon technologies unveiled 16 mib 16 Γ 2 bytes prototype based 0.18 Β΅m technology two 2nd generation techniques currently development thermal-assisted switching tas developed crocus technology spin-transfer torque stt crocus hynix ibm several companies working nantero built functioning carbon nanotube memory prototype 10 gib 10 Γ 2 bytes array 2004 whether technologies eventually take significant market share either dram sram flash-memory technology however remains seen since 2006 solid-state drives based flash memory capacities exceeding 256 gigabytes performance far exceeding traditional disks become available development started blur definition traditional random-access memory disks dramatically reducing difference performance kinds random-access memory ecoram specifically designed server farms low power consumption important speed memory wall growing disparity speed cpu memory outside cpu chip important reason disparity limited communication bandwidth beyond chip boundaries also referred bandwidth wall 1986 2000 cpu speed improved annual rate 55 memory speed improved 10 given trends expected memory latency would become overwhelming bottleneck computer performance cpu speed improvements slowed significantly partly due major physical barriers partly current cpu designs already hit memory wall sense intel summarized causes 2005 document first chip geometries shrink clock frequencies rise transistor leakage current increases leading excess power consumption heat ... secondly advantages higher clock speeds part negated memory latency since memory access times able keep pace increasing clock frequencies third certain applications traditional serial architectures becoming less efficient processors get faster due so-called von neumann bottleneck undercutting gains frequency increases might otherwise buy addition partly due limitations means producing inductance within solid state devices resistance-capacitance rc delays signal transmission growing feature sizes shrink imposing additional bottleneck frequency increases n't address rc delays signal transmission also noted clock rate versus ipc end road conventional microarchitectures projected maximum 12.5 average annual cpu performance improvement 2000 2014 different concept processor-memory performance gap addressed 3d integrated circuits reduce distance logic memory aspects apart 2d chip memory subsystem design requires focus gap widening time main method bridging gap use caches small amounts high-speed memory houses recent operations instructions nearby processor speeding execution operations instructions cases called upon frequently multiple levels caching developed deal widening gap performance high-speed modern computers relies evolving caching techniques prevent loss processor performance takes less time perform computation initiated complete 53 difference growth speed processor speeds lagging speed main memory access solid-state hard drives continued increase speed ~400 mb/s via sata3 2012 ~3 gb/s via nvme/pcie 2018 closing gap ram hard disk speeds although ram continues order magnitude faster single-lane ddr4 3200 capable 25 gb/s modern gddr even faster fast cheap non-volatile solid state drives replaced functions formerly performed ram holding certain data immediate availability server farms 1 terabyte ssd storage 200 1tb ram would cost thousands dollars despite speed ram still necessity efficient computation large local data sets analytics machine learning though producing graphics video games vr | [
9732,
4622,
2066,
4114,
9235,
7189,
9762,
9767,
8232,
10285,
5681,
5682,
4147,
1592,
8248,
570,
1083,
11324,
2111,
7745,
7748,
8774,
9799,
1098,
7243,
6221,
9300,
7772,
7774,
3685,
2152,
8301,
10351,
1136,
5744,
7283,
7284,
7285,
8822,
62... | Test |
2,384 | 4 | TACLANE:taclane taclane short tactical fastlane tactical local area network encryption family inline network encryptors ine developed manufactured general dynamics mission systems meet national security agency nsa requirements high assurance internet protocol encryptor haipe version 4.1 nov 2013 taclane devices type 1 key-agile in-line network encryptors provide network communications security internet protocol ip asynchronous transfer mode atm networks individual user enclaves users security level typically deployed department defense dod tactical strategic networks government agencies contractors taclanes allow users communicate securely legacy networks mobile subscriber equipment packet network non-secure internet protocol router network niprnet secret internet protocol router network siprnet emerging atm networks taclanes provide encryption ip datagram traffic atm traffic ip datagrams encapsulated atm cells support variety ip atm mixed network configurations taclanes used overlay secure virtual private network top existing public and/or private network infrastructures taclane-micro introduced became certified nsa 2007 protect classified information top secret 2014 announced general dynamics c4 systems general dynamics mission systems delivered 100,000 taclane-micro encryptors u.s. navy space naval warfare systems command spawar taclane-c100 designated suite b cryptographic high value product chvp encryptor certified national security agency nsa suite b device secure network communications secret level 2012 certification makes c100 non-controlled cryptographic item cci taclane-10g encryptor haipe encryptor offer simultaneous ip ethernet capabilities providing 10 gbit/s throughput speed 10g secures information classified top secret sci government commercial networks encryptor became certified national security agency nsa 2015 allowed u.s government agencies order 10g encryptor taclane-1g ruggedized tactical strategic environments encryptor became nsa certified secure information classified top secret sci 2013 taclane-flex became certified nsa secure information top secret/sci level 2017 taclane-nano encryptor works integrate flyaway kits deployable systems well facilitates communications intelligence surveillance reconnaissance dismounted tactical forward deployment covert special operations encryptor certified nsa yet general dynamics mission systems announced end production product december 2015 general dynamics mission systems announced end life eol product | [
5472,
11109,
395,
3629,
7887
] | Test |
2,385 | 7 | Snapforce_CRM:snapforce crm snapforce crm comprehensive customer relationship management crm saas application developed snapforce.com primary use case customer management sales automation although also configured telephony support additional software components include customer databases customer interaction tracking reporting workflow automation snapforce crm configured handle inbound outbound calling calls logged prospect customer record automatically real time may 2014 company became first crm software provider offer telephony services native feature snapforce crm recognized one ten top players customer relationship management market report 2015 | [
4194
] | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.