node_id
int64
0
76.9k
label
int64
0
39
text
stringlengths
13
124k
neighbors
listlengths
0
3.32k
mask
stringclasses
4 values
3,585
2
Windows_Embedded_Compact_7:windows embedded compact 7 windows embedded compact 7 formerly known windows embedded ce 7.0 seventh major release windows embedded ce operating system windows embedded compact 7 real-time os separate windows nt line designed target enterprise specific tools industrial controllers consumer electronics devices digital cameras gps systems also automotive infotainment systems windows embedded compact designed run multiple cpu architectures supports x86 sh automotive arm development microsoft employee working division claimed microsoft working hard release shares underlying kernel windows phone microsoft officially confirmed said windows phone 7 based windows embedded ce 6.0 r3 features borrowed windows embedded compact 7 thus making hybrid solution windows embedded compact 7 released march 1 2011 windows embedded compact 7 contains features
[ 448, 2452, 2818, 458, 4759, 5637, 895, 1536, 6256, 7616, 3180, 3187, 2472, 4500, 4687, 1097, 5571, 7453, 5313, 224, 5055, 7660, 3809, 8118, 2329, 3048, 6136, 7029, 3907, 2066, 2885, 5781, 6580, 7685, 352, 3751, 5442, 4377, 5794, 444, 44...
Test
3,586
2
KernelCare:kernelcare kernelcare live kernel patching service provides security patches bugfixes range popular linux kernels installed without rebooting system kernelcare software released gpl2 first beta introduced march 2014 commercially launched may 2014 kernelcare supports centos/rhel 5.x 6.x 7.x cloudlinux 5.x 6.x 7.x parallels cloud server oracle linux/rhel 6.x 7.x amazon linux virtuozzo openvz rhel6/rhel proxmox 3.x 4.x 5.x virt-sig/xen4centos debian 6.x 7.x 8.x 9.x ubuntu 14.04 lts 16.04 lts 18.04 lts kernelcare agent resides user server periodically checks kernelcare distribution servers new patches available currently running kernel kernelcare agent downloads applies patches running kernel kernelcare patch piece code used substitute vulnerable buggy code kernel arbitrary code line modification missing security check set functions even modified data structures patch compiled usual generated code additional information changed code pieces caused original source code modification information apply code pieces resulting code modifications safely applied running kernel special kernelcare kernel module applies patches loads patches kernel address space sets relocations i.e. fixes references original kernel code data safely switches execution path original code updated code blocks code ensures patch applied safely cpu n't execute original code blocks moment switching new version
[ 3256, 2182, 3613, 4670, 5021, 13, 7528, 3271, 7532, 3626, 5041, 5744, 6443, 7550, 405, 2942, 6117, 4341, 5762, 412, 415, 65, 3666, 5783, 2970, 5088, 6500, 785, 2266, 788, 7956, 1522, 5453, 7605, 4759, 5460, 7242, 1535, 1924, 4397, 6892,...
Train
3,587
6
Fsck:fsck system utility fsck file system consistency check tool checking consistency file system unix unix-like operating systems linux macos freebsd similar command chkdsk exists microsoft windows ancestor ms-dos agreed pronunciation pronounced f-s-c-k f-s-check fizz-check f-sack fisk fizik f-sick f-sock f-sek feshk sibilant fsk fix farsk fusk generally fsck run either automatically boot time manually system administrator command works directly data structures stored disk internal specific particular file system use fsck command tailored file system generally required exact behaviors various fsck implementations vary typically follow common order internal operations provide common command-line interface user fsck utilities provide options either interactively repairing damaged file systems user must decide fix specific problems automatically deciding fix specific problems user answer questions reviewing problems need resolved file system without actually fixing partially recovered files original file name reconstructed typically recovered lost+found directory stored root file system system administrator also run fsck manually believe problem file system file system normally checked unmounted mounted read-only system special maintenance mode modern journaling file systems designed tools fsck need run unclean shutdown i.e crash ufs2 file system freebsd background fsck usually necessary wait fsck finish accessing disk full copy-on-write file systems zfs btrfs designed avoid causes corruption traditional fsck repair tool scrub utility examines repairs problems background mounted file system equivalent programs microsoft windows ms-dos chkdsk scandisk severity file system corruption led terms fsck fscked becoming used among unix system administrators minced oath fuck fucked unclear whether usage cause effect report question answer session usenix 1998 claims fsck originally different name go fsck occasionally used online injunction person go correct issue attitude ignorance subject matter etc way running fsck involves fixing fundamental errors following example checks file system configured mounted /usr partition file system needs unmounted first following example checks linux jfs file system mdadm software raid device
[ 3599, 361, 6789, 2817, 4759, 4480, 1537, 2379, 200, 6505, 7258, 5480, 3532, 3106, 5571, 578, 923, 5138, 6117, 667, 5760, 2589, 5946, 6033, 6380, 7667, 4987, 4183, 4447, 7581, 7498, 3417, 5789, 6404, 174, 6500, 4283, 4020 ]
Test
3,588
4
BREACH:breach breach backronym browser reconnaissance exfiltration via adaptive compression hypertext security exploit https using http compression breach built based crime security exploit breach announced august 2013 black hat conference security researchers angelo prado neal harris yoel gluck idea discussed community announcement crime attack presented general attack could work effectively large number protocols exploits spdy request compression tls compression demonstrated largely mitigated browsers servers crime exploit http compression mitigated even though authors crime warned vulnerability might even widespread spdy tls compression combined breach instance crime attack http compression—the use gzip deflate data compression algorithms via content-encoding option within http many web browsers servers given compression oracle rest breach attack follows general lines crime exploit performing initial blind brute-force search guess bytes followed divide-and-conquer search expand correct guess arbitrarily large amount content breach exploits compression underlying http protocol therefore turning tls compression makes difference breach still perform chosen-plaintext attack http payload result clients servers either forced disable http compression completely thus reducing performance adopt workarounds try foil breach individual attack scenarios using cross-site request forgery csrf protection another suggested approach disable http compression whenever referrer header indicates cross-site request header present approach allows effective mitigation attack without losing functionality incurring performance penalty affected requests around 2013-2014 ietf draft proposal tls extension length-hiding padding theory could used mitigation attack allows actual length tls payload disguised insertion padding round fixed set lengths randomize external length thereby decreasing likelihood detecting small changes compression ratio basis breach attack however draft since expired without action
[ 363, 794, 887, 6795, 1168, 1173, 2644, 1460, 5824, 2566, 8189, 8093, 6540, 5399, 6458, 6553, 2587, 4071, 7567, 3219, 7925, 3899, 2691, 6049, 1594, 4990, 7214, 7771, 353, 1059, 1513, 2620, 359, 3426 ]
Validation
3,589
4
Self-service_password_reset:self-service password reset self-service password reset sspr defined process technology allows users either forgotten password triggered intruder lockout authenticate alternate factor repair problem without calling help desk common feature identity management software often bundled software package password synchronization capability typically users forgotten password launch self-service application extension workstation login prompt using another user web browser telephone call users establish identity without using forgotten disabled password answering series personal questions using hardware authentication token responding notification e-mail less often providing biometric sample voice recognition users either specify new unlocked password ask randomly generated one provided self-service password reset expedites problem resolution users fact thus reduces help desk call volume also used ensure password problems resolved adequate user authentication eliminating important weakness many help desks social engineering attacks intruder calls help desk pretends intended victim user claims forgotten account password asks new password rather merely asking users answer security questions modern password reset systems may also leverage sequence authentication steps despite benefits self-service password reset relies solely answers personal questions introduce new vulnerabilities since answers questions often obtained social engineering phishing techniques simple research users frequently reminded never reveal password less likely treat sensitive answers many commonly used security questions pet names place birth favorite movie much information may publicly available users personal home pages answers elicited someone pretending conduct opinion survey offering free dating service since many organizations standard ways determining login names real names attacker knows names several employees organization choose one whose security answers readily obtained vulnerability strictly due self-service password reset—it often exists help desk prior deployment automation self-service password reset technology often used reduce type vulnerability introducing stronger caller authentication factors human-operated help desk using prior deployment automation september 2008 yahoo e-mail account governor alaska vice president united states nominee sarah palin accessed without authorization someone able research answers two security questions zip code date birth able guess third met husband incident clearly highlighted choice security questions important prevent social engineering attacks password systems jakobsson stolterman wetzel yang proposed use preferences authenticate users password reset underlying insights preferences stable long period time publicly recorded approach includes two phases -- setup authentication setup user asked select items either like dislike several categories items dynamically selected big candidate set presented user random order authentication phase users asked classify preferences like dislike selected items displayed random order jakobsson stolterman wetzel yang evaluated security approach user experiments user emulations attacker simulations two-factor authentication 'strong authentication method adds another layer security password reset process cases consists preference based authentication plus second form physical authentication using something user possesses i.e smartcards usb tokens etc. one popular method sms email advanced sspr software requires user provide mobile phone number personal e-mail address setup event password reset pin code sent user phone email need enter code password reset process modern technology also allows authentication via voice biometrics using voice recognition technology major problem self-service password reset inside corporations similar organizations enabling users access system forgot primary password since sspr systems typically web-based users need launch web browser fix problem yet log workstation problem solved various approaches addressing catch-22 compromises e.g. desktop software deployment domain-wide password reset account telephone access visiting neighbour continuing call help desk etc. companies created software presents restricted web browser login screen sole ability access password reset page without logging system example novell client login extension technology technologies effectively give user access computer resources specifically web browser reset passwords without authenticating computer security high priority capabilities limited user expected mode two additional problems related one locked users conjunction preference-based authentication self-service password reset procedures could also rely network existing human relations among users scenario user forgot password asks colleague assistance helper colleague authenticates password reset application vouches user identity scenario problem changes one authenticating user forgot password one understanding users ability vouch users
[ 2489, 1078, 3794, 5582, 3795 ]
Test
3,590
2
Absolute_Linux:absolute linux absolute linux lightweight linux distribution works older hardware based slackware linux client designed everyday use internet multimedia documents absolute linux default file window managers icewm rox programs offered default include gimp libreoffice firefox xfburn p7zip qbittorrent many script utilities included absolute linux aid configuration maintenance system
[ 352, 3751, 2193, 5232 ]
Test
3,591
2
Tinfoil_Hat_Linux:tinfoil hat linux tinfoil hat linux thl compact security-focused linux distribution designed high security developed shmoo group first version 1.000 released february 2002 appears low priority project image files source available gzip format thl used almost modern pc requires intel 80386 better computer least 8 mb ram distribution fits single hd floppy small footprint provides additional benefits beyond making system easy understand verify- computer need even hard drive making easier sanitize computer use logo tinfoil hat tux linux mascot wearing tinfoil hat tinfoil hat uses number measures defeat hardware software surveillance methods like keystroke logging video camera tempest advantage thl used virtually modern pc using x86 processor architecture example one might install computer kept locked room connected network used cryptographically signing keys fairly easy create tinfoil hat booting floppy microsoft windows verifying checksum tricky text documentation salted jokes reinforces humor stark contrast serious paranoiac tone surrounding text- name pokes fun tinfoil hats commonly ascribed paranoiacs method protecting oneself mind-control waves tinfoil hat linux requires one work text-only environment linux i.e starting straight bourne shell editor vi graphical user interface uses busybox instead normal util-linux gnu coreutils formerly known fileutils shellutils textutils common unix tools tinfoil hat also offers gnu nano text editor
[ 362, 5200, 4759, 1629, 3444, 7251, 474, 4496, 3100, 7075, 6725, 1941, 578, 314, 5232, 2758, 1663, 2864, 6209, 3219, 7667, 6761, 2063, 343, 4824, 5523, 7587, 5259, 1893, 5530, 5704, 6317, 352, 3751, 1992, 7954, 6244 ]
Test
3,592
4
Christien_Rioux:christien rioux christien rioux also known handle dildog co-founder chief scientist burlington massachusetts based company veracode main patent holder educated mit rioux computer security researcher l0pht heavy industries company stake later bought symantec stake looked security weaknesses software led development smart risk analyzer sra co-authored best-selling windows password auditing tool stake lc l0phtcrack antisniff network intrusion detection system also member cult dead cow ninja strike force formerly member l0pht dildog best known author original code back orifice 2000 open source remote administration tool also well known author tao windows buffer overflow
[ 6412, 819, 3842, 4663, 7175, 1404, 6157, 6411 ]
Test
3,593
2
After_School_(app):school app school ios android social network mobile application allows users defined network currently high schools share anonymous text-based posts images others july 2016 school users 20,000 american high schools according ceo michael callahan app created network “ teens could use express reach others ask offer help fellow teens distress. ” app created michael callahan cory levy one inc. debuted mid-november 2014 re-release app april 2015 school implemented “ mature content ” filters age verification 24/7 live anonymous support first fastest internet response system threats february 2016 school announced raising 16.4 million series round app also detects threatening harmful messages using language algorithms enforces single-report immediate user removal violations
[]
Test
3,594
4
FTP_bounce_attack:ftp bounce attack ftp bounce attack exploit ftp protocol whereby attacker able use port command request access ports indirectly use victim machine middle man request technique used port scan hosts discreetly access specific ports attacker access direct connection example nmap port scanner nearly modern ftp server programs configured default refuse port commands would connect host originating host thwarting ftp bounce attacks
[ 3932, 7637, 1984, 1942, 2615, 4914 ]
Test
3,595
2
WAITS:waits waits heavily modified variant digital equipment corporation monitor operating system later renamed better known tops-10 pdp-6 pdp-10 mainframe computers used stanford artificial intelligence laboratory sail mid-1960s 1991 mainframe computer ran also went name sail never official expansion waits common variant west-coast alternative another variant worst acronym invented timesharing system name endorsed sail community public vote choosing among alternatives two contenders saints stanford ai new timesharing system sinners stanford incompatible non-new extensively rewritten system proposed systems programmers though waits less visible frequent exchange people ideas two communities innovations pioneered waits exerted enormous indirect influence waits alumni xerox parc elsewhere also played major roles developments led xerox star apple macintosh sun workstation later sold sun microsystems early screen modes emacs example directly inspired waits e editor -- one family editors first real-time editing editing commands invisible one typed text point insertion/overwriting modern style multi-region windowing said originated system also featured unusual level support called multimedia computing allowing analog audio video signals including tv radio switched programming terminals switching capability terminal video even allowed users separate offices view type virtual terminal single user instantly switch among multiple full virtual terminals also invented bucky bits thus alt key every ibm pc waits legacy one waits feature notable pre-web days news-wire search engine called ns news service allowed waits hackers instantly find store notified selected ap new york times news-wire stories searches using arbitrary combinations words news story retrieval search instantaneous story automatically indexed words came wire
[ 1522, 7325, 7605, 280, 2818, 4759, 190, 4670, 5021, 3614, 8066, 4397, 13, 5911, 5644, 3271, 5116, 6984, 299, 3626, 7142, 5571, 2300, 5041, 7827, 4786, 578, 7550, 4244, 5232, 1992, 405, 6367, 6922, 1116, 8167, 8115, 5161, 5865, 7396, 65,...
Train
3,596
3
Universal_Data_Element_Framework:universal data element framework universal data element framework udef controlled vocabulary developed open group provided framework categorizing naming indexing data assigned every item data structured alphanumeric tag plus controlled vocabulary name describes meaning data allowed relating data elements similar elements defined organizations udef defined dewey-decimal like code concept example employee number often used human resource management udef tag a.5_12.35.8 controlled vocabulary description employee.person_employer.assigned.identifier udef superseded open data element framework o-def application used hospital last name first name several people could include following example concepts examples following udef ids available
[]
Test
3,597
5
Logical_link_control:logical link control ieee 802 reference model computer networking logical link control llc data communication protocol layer upper sublayer data link layer layer 2 seven-layer osi model llc sublayer provides multiplexing mechanisms make possible several network protocols e.g ip ipx decnet appletalk coexist within multipoint network transported network medium also provide flow control automatic repeat request arq error management mechanisms llc sublayer acts interface media access control mac sublayer network layer llc sublayer primarily concerned multiplexing protocols transmitted mac layer transmitting demultiplexing receiving also provide node-to-node flow control error management flow control error management capabilities llc sublayer used protocols netbios frames protocol however protocol stacks running atop 802.2 use llc sublayer flow control error management cases flow control error management taken care transport layer protocol tcp application layer protocol higher layer protocols work end-to-end fashion i.e re-transmission done original source final destination rather individual physical segments protocol stacks multiplexing capabilities llc sublayer used llc sublayer key component early packet switching networks x.25 networks lapb data link layer protocol flow control error management carried node-to-node fashion meaning error detected frame frame retransmitted one switch next instead extensive handshaking nodes made networks slow ieee 802.2 standard specifies llc sublayer ieee 802 local area networks ieee 802.3/ethernet ethertype field used ieee 802.5 ieee 802.11 ieee 802.2 also used non-ieee 802 networks fddi since bit errors rare wired networks ethernet provide flow control automatic repeat request arq meaning incorrect packets detected cancelled retransmitted except case collisions detected csma/cd mac layer protocol instead retransmissions rely higher layer protocols ethertype ethernet frame using ethernet ii framing used multiplex different protocols top ethernet mac header seen llc identifier however ethernet frames lacking ethertype llc identifier ethernet header instead use ieee 802.2 llc header ethernet header provide protocol multiplexing function wireless communications bit errors common wireless networks ieee 802.11 flow control error management part csma/ca mac protocol part llc layer llc sublayer follows ieee 802.2 standard non-ieee 802 protocols thought split mac llc layers example hdlc specifies mac functions framing packets llc functions protocol multiplexing flow control detection error control retransmission dropped packets indicated protocols cisco hdlc use hdlc-like packet framing llc protocol telephone network modems ppp link layer protocols considered llc protocol providing multiplexing provide flow control error management telephone network bit errors might common meaning error management crucial today provided modern protocols today modem protocols inherited llc features older lapm link layer protocol made modem communication old x.25 networks gprs llc layer also ciphering deciphering sn-pdu sndcp packets another example data link layer split llc flow error control mac multiple access itu-t g.hn standard provides high-speed local area networking existing home wiring power lines phone lines coaxial cables
[ 4469, 6871, 6966, 709, 4580, 2281, 4676, 3775, 3525, 1543, 2644, 3777, 7170, 7173, 1364, 3283, 7637, 2117, 2119, 6908, 3462, 2400, 5492, 2219, 3207, 1952, 3383, 3797, 3799, 5142, 7916, 2043, 3314, 2057, 3819, 3821, 768, 7029, 7217, 7765, ...
Test
3,598
2
Image_Mastering_API:image mastering api image mastering application programming interface imapi component microsoft windows operating system used cd dvd authoring recording windows applications windows media player windows media center windows movie maker windows dvd maker windows explorer use imapi create iso images burn discs windows refers discs created using imapi mastered burns contrast term live file system implies packet writing use imapi imapi originally introduced windows xp imapi version 2.0 released windows vista windows server 2008 26 june 2007 version released update windows xp windows server 2003 microsoft received requests hardware software vendors 19 january 2009 microsoft released windows feature pack storage 1.0 update allows imapi 2.0 support recordable blu-ray disc bd-r rewritable blu-ray disc bd-re media also adds support universal disk format udf 2.5 file system windows feature pack storage available windows xp later integrated windows 7 imapi provides ability create burn single-session multi-session discs including bootable discs also provides low-level access burn engine developing support new devices well access extended recorder properties imapi supports every major writable cd dvd format including imapi supports writing disks iso 9660 including cdda audio joliet imapi v2.0 also supports writing discs universal disk format file system imapi version 2.0 supports following additional features unlike imapi version 1.0 imapi version 2.0 implemented dll rather windows service imapi 2.0 suffers limitations notably allow filesystem imported raw image .iso file optical drive effect means generate disk images used modify
[ 7149, 6420, 714, 720, 1460, 2928, 7907, 5747, 2953, 6840, 422, 3672, 5090, 4017, 6504, 4022, 4026, 7607, 1526, 3687, 4759, 6880, 2283, 5479, 7263, 5850, 150, 6933, 519, 3052, 4448, 3407, 1232, 2702, 7687, 1989, 4848, 4129, 8073, 2018, 8...
Test
3,599
2
Copy-on-write:copy-on-write copy-on-write cow cow sometimes referred implicit sharing shadowing resource-management technique used computer programming efficiently implement duplicate copy operation modifiable resources resource duplicated modified necessary create new resource resource shared copy original modifications must still create copy hence technique copy operation deferred first write sharing resources way possible significantly reduce resource consumption unmodified copies adding small overhead resource-modifying operations copy-on-write finds main use sharing virtual memory operating system processes implementation fork system call typically process modify memory immediately executes new process replacing address space entirely thus would wasteful copy process memory fork instead copy-on-write technique used copy-on-write implemented efficiently using page table marking certain pages memory read-only keeping count number references page data written pages kernel intercepts write attempt allocates new physical page initialized copy-on-write data although allocation skipped one reference kernel updates page table new writable page decrements number references performs write new allocation ensures change memory one process visible another copy-on-write technique extended support efficient memory allocation page physical memory filled zeros memory allocated pages returned refer page zeros marked copy-on-write way physical memory allocated process data written allowing processes reserve virtual memory physical memory use memory sparsely risk running virtual address space combined algorithm similar demand paging copy-on-write pages also used linux kernel kernel same-page merging feature loading libraries application also use copy-on-write technique dynamic linker maps libraries private like follows writing action libraries trigger cow virtual memory management codice_1 cow also used library application system code multithreaded systems cow implemented without use traditional locking instead use compare-and-swap increment decrement internal reference counter since original resource never altered safely copied multiple threads reference count increased without need performance-expensive locking mutexes reference counter turns 0 definition 1 thread holding reference resource safely de-allocated memory without use performance-expensive locking mechanisms benefit copy resource resulting performance gain traditional deep-copying therefore valid single- multithreaded systems string class provided c++ standard library specifically designed allow copy-on-write implementations initial c++98 standard newer c++11 standard php programming language types except references implemented copy-on-write example strings arrays passed reference modified duplicated non-zero reference counts allows act value types without performance problems copying assignment making immutable qt framework many types copy-on-write implicitly shared qt terms qt uses atomic compare-and-swap operations increment decrement internal reference counter since copies cheap qt types often safely used multiple threads without need locking mechanisms mutexes benefits cow thus valid single- multithreaded systems cow may also used underlying mechanism snapshots provided logical volume management file systems btrfs zfs database servers microsoft sql server typically snapshots store modified data stored close main array weak form incremental backup substitute full backup systems also use cow technique avoid fuzzy backups otherwise incurred file set files backed changes backup implementing snapshots two techniques despite names copy-on-write usually refers first technique cow two data writes compared row one difficult implement efficiently thus used infrequently copy-on-write technique used emulate read-write storage media require wear leveling physically write read many qcow2 qemu copy write disk image format uses copy-on-write technique reduce disk image size live cds live usbs use copy-on-write techniques give impression able add delete files directory without actually making changes cd usb flash drive phantom os uses cow levels database file system time computer running system fail starts software operating system resume operation small amounts work lost basic approach program data kept virtual memory schedule summary software data written virtual memory forming log tracks current value location value computer fails recent copy log data remain safe disk operation resumes operating system software reads log restore consistent copies programs data approach uses copy-on-write levels software including application software requires support within application programming language practice phantom os permits languages generate java byte codes
[ 1438, 2547, 7161, 4672, 3271, 6431, 3626, 7182, 5049, 6117, 759, 56, 2245, 6854, 5437, 4375, 6500, 788, 6505, 7605, 5457, 460, 1534, 7976, 4406, 821, 7258, 828, 5130, 1561, 5842, 836, 5843, 2313, 6558, 2683, 5859, 5865, 515, 4444, 5518,...
Test
3,600
8
Co-ment:co-ment co-ment online word processor allowing collaborative writing commenting inspired software package stet created handle gnu gpl version 3 online revision free software available affero gpl co-ment allows groups users collaboratively elaborate online texts offers wiki-style editing environment supporting many syntaxes allows finely controlled layouts including table images main interest comment feature allowing users attach remarks specific extracts text leading text building procedure based strong equipped debates advanced comment navigation features also provided help discover new annotations go history debate also possible set email alerts text edits new comments co-ment fitted many import/export formats support txt doc odt html co-ment special focus layout respect exported file types available free web service extended pro accounts following wordpress model source code available website also bundled drupal module greatest use cases co-ment education particular first language literature teaching secondary education co-ment inspired stet tool created handle online revision gpl v3 since used licenses mozilla public license creative commons licence family co-ment also used legal works administrative works advocacy works
[ 5965 ]
Test
3,601
0
Collocation_extraction:collocation extraction collocation extraction task using computer extract collocations automatically corpus traditional method performing collocation extraction find formula based statistical quantities words calculate score associated every word pairs proposed formulas mutual information t-test z test chi-squared test likelihood ratio within area corpus linguistics collocation defined sequence words terms co-occur often would expected chance 'crystal clear 'middle management 'nuclear family 'cosmetic surgery examples collocated pairs words words often found together make compound noun example 'riding boots 'motor cyclist
[ 1718, 1444, 4760, 8065, 715, 5304, 3292, 2215, 1751, 7372, 4337, 3651, 4349, 4089, 1314, 5429, 5528, 5612, 7138, 5885, 5008 ]
Test
3,602
2
Etcher_(software):etcher software balenaetcher commonly referred 'etcher free open-source utility used writing image files .iso .img files well zipped folders onto storage media create live sd cards usb flash drives developed balena licensed apache license 2.0 etcher developed using electron framework supports windows macos linux latest stable release balenaetcher version 1.5.51. balenaetcher originally called etcher name changed october 29 2018 resin.io changed name balena balenaetcher uses google analytics mixpanel even 'send anonymous usage data checkbox checked etcher primarily used graphical user interface additionally command line interface available active development future planned features include support persistent storage allowing live sd card usb flash drive used hard drive well support flashing multiple boot partitions single sd card usb flash drive
[ 2451, 3915, 5571, 7848, 4207, 3271 ]
Test
3,603
4
Kill_Pill:kill pill computing kill pill term given mechanisms technologies designed render systems useless either user command predefined set circumstances kill pill technology commonly used disable lost stolen devices security purposes also used enforcement rules contractual obligations kill pill technology used prominently smartphones especially disablement lost stolen devices notable example find iphone service allows user password protect wipe idevice remotely aiding protection private data similar applications exist smartphone operating systems including android blackberry windows phone kill pill technology notably used anti-piracy measure windows vista released ability severely limit functionality determined copy obtained piracy feature later dropped complaints false positives caused genuine copies vista act though pirated concept kill pill also applied remote removal server malicious files applications client system technology standard component handheld computing devices mainly due generally limited operating systems means obtaining applications functionality also reportedly available applications downloaded windows store windows 8 operating systems kill pill technology used frequently vehicles variety reasons remote vehicle disablement used prevent vehicle starting prevent moving prevent vehicle continued operation non-remotely vehicles require driver recognition starting moving asking password form biometrics driver kill pill technology often used governments prevent drunk driving repeat offenders punishment deterrent installation ignition interlock devices sentencing alternative drunk drivers almost 50 united states device requires driver blow breathalyzer starting vehicle driver found legal blood alcohol content limit vehicle start kill pill technology also implemented contextually disable certain aspects smartphone functionality patent obtained apple claims ability disable antenna screen camera smartphone settings like theaters schools areas high security sensitivity kill pill technology criticized allowing suppression personal liberties kill pill utilized school setting prevent academic dishonesty suggested governments may also use suppress people example disabling phone camera antenna area protest ability remotely remove files applications user device also come fire apple apparent ability blacklist applications rendering unusable idevice raised concerns user rights downloading app store july 2014 applications appear apple blacklist website
[ 6312, 3172, 7619, 740, 7120 ]
Test
3,604
3
Squish_'em:squish 'em squish'em also known squish'em sam 1983 video game designed tony ngo published sirius software atari 8-bit family vic-20 commodore 64 msx colecovision console colecovision version features digitised speech without additional hardware published squish'em featuring sam game sequel sewer sam squish'em vertically scrolling game likened 1980 arcade game crazy climber players guide sam top uncompleted 48 storey buildings order collect suitcases money time sam reaches top building grabs money parachutes order attempt next building building represented grid girders connected vertically horizontally different patterns sometimes single way next storey building style buildings change grid layout colors change sam progresses game sam moves shimmying horizontally across grid climbing upwards moved storey climb back buildings patrolled dangerous enemies move horizontally across grid debris dropped sam must avoid making contact enemy without jumping hit falling debris results sam knocked building losing life player starts game four lives extra lives collected play 128 held player enemies 'squished jumped also jumped avoided ascending next storey enemy squished rendered harmless short period turning white becoming invulnerable enemy turned white must avoided jumped jumping enemies difficult landing squishing play progresses enemies become taller faster making harder squish avoid falling debris prevents players climbing many storeys enemies must avoided skillfully order prevent sam cornered invulnerable enemy tall easily jumped colecovision version game digitised speech employed sam performs certain actions instance exclaims squish 'em successfully attacking enemy money money money collecting suitcase top building one colecovision games contain speech unlike rival intellivision console colecovision lacks speech module craig holyoak deseret news rated colecovision version 3 5 praising game voice effects criticizing unoriginal despite boundaries technology pushed stated game contains plenty cute enabling appeal ages genders also stated little new keep experienced gamer long screen holyoak played game intensely number days lost interest mastering ability squish dangerous enemies finished stating less jaded looking climbing game new twist squish 'em may well unofficial homebrew clone even using name released atari 2600 2007
[]
Validation
3,605
3
MSX-Engine:msx-engine msx-engine chip specially developed integrated circuit home computers built according msx specifications generally chip combines functions many separate older/simpler chips one done reduce required circuit board space power consumption importantly production costs complete systems first msx-engine chip t7775 operated next standard zilog z80-clone chip main cpu system later versions engine also included z80 clone cpu single chip package s-1990 special case really msx-engine chip used glue logic msx-engine external r800 cpu t9769 used msx 2 computers msx 1 computers mostly t7775 t7937 used also find s-1985 s-3527 systems msx 2 generation msx2+ onwards toshiba took complete production msx engine chips last generation msx turbo-r used nec s-1990 turbor bus controller together r800 cpu msx engine chips yamaha mostly used msx-computers sony philips toshiba chips mostly used computers sanyo matsushita panasonic/national short overview msx-engine chips note ic also used many msx2 computers include msx2-specific functions machines implemented using additional ic's s1990 msx-engine acts like bus controller combining element combines z80 inside t9769c actual msx engine r800 cpu memory slot logic hardware inside t9769c also contains hardware assists debugging software
[ 5822, 3308, 974, 3382 ]
Test
3,606
9
ADMB:admb admb ad model builder free open source software suite non-linear statistical modeling created david fournier developed admb project creation non-profit admb foundation ad ad model builder refers automatic differentiation capabilities come autodif library c++ language extension also created david fournier implements reverse mode automatic differentiation related software package admb-re provides additional support modeling random effects markov chain monte carlo methods integrated admb software making useful bayesian modeling addition bayesian hierarchical models admb provides support modeling random effects frequentist framework using laplace approximation importance sampling admb widely used scientists academic institutions government agencies international commissions commonly ecological modeling particular many fisheries stock assessment models built using software admb freely available new bsd license versions available windows linux mac os x opensolaris operating systems source code admb made publicly available march 2009 work david fournier 1970s development highly parameterized integrated statistical models fisheries motivated development autodif library ultimately admb likelihood equations models typically non-linear estimates parameters obtained numerical methods early fournier work became clear general numerical solutions likelihood problems could reliably achieved using function minimization algorithms incorporate accurate information gradients likelihood surface computing gradients i.e partial derivatives likelihood respect model variables must also done accuracy likelihood computation fournier developed protocol writing code compute required derivatives based chain rule differential calculus protocol similar suite methods came known reverse mode automatic differentiation statistical models using methods typically included eight constituent code segments model developers usually interested first constituents programming tools reduce overhead developing maintaining seven greatly increase productivity bjarne stroustrup began development c++ 1970s bell labs enhancement c programming language c++ spread widely 1989 c++ compilers available personal computers polymorphism c++ makes possible envisage programming system mathematical operators functions overloaded automatically compute derivative contributions every differentiable numerical operation computer program fournier formed otter research ltd. 1989 1990 autodif library included special classes derivative computation requisite overloaded functions c++ operators functions standard c++ math library autodif library automatically computes derivatives objective function accuracy objective function thereby frees developer onerous task writing maintaining derivative code statistical models equally important standpoint model development autodif library includes gradient stack quasi-newton function minimizer derivative checker container classes vectors matrices first application autodif library published 1992 autodif library however completely liberate developer writing model constituents listed 1993 fournier abstracted writing statistical models creating admb special template language simplify model specification creating tools transform models written using templates autodif library applications admb produces code manage exchange model parameters model function minimizer automatically computes hessian matrix inverts provide estimate covariance estimated parameters admb thus completes liberation model developer tedious overhead managing non-linear optimization thereby freeing focus interesting aspects statistical model mid-1990s admb earned acceptance researchers working aspects resource management population models based admb used monitor range endangered species commercially valuable fish populations including whales dolphins sea lions penguins albatross abalone lobsters tunas marlins sharks rays anchovy pollock admb also used reconstruct movements many species animals tracked electronic tags 2002 fournier teamed hans skaug introduce random effects admb development included automatic computation second third derivatives use forward mode automatic differentiation followed two sweeps reverse model ad certain cases 2007 group admb users included john sibert mark maunder anders nielsen became concerned admb long-term development maintenance agreement reached otter research sell copyright admb purpose making admb open-source project distributing without charge non-profit admb foundation created coordinate development promote use admb admb foundation drafted proposal gordon betty moore foundation funds purchase admb otter research moore foundation provided grant national center ecological analysis synthesis university california santa barbara late 2007 regents university california could purchase rights admb purchase completed mid-2008 complete admb libraries posted admb project website december 2008 may 2009 3000 downloads libraries occurred source code made available december 2009 mid-2010 admb supported common operating systems windows linux macos sun/sparc common c++ compilers gcc visual studio borland 32 64 bit architectures admb foundation efforts first two years admb project focused automating building admb different platforms streamlining installation creation user-friendly working environments planned technical developments include parallelization internal computations implementation hybrid mcmc improvement large sparse matrix use random effects models
[ 5098, 2820, 1626, 4759, 5548, 1731, 3619, 5288, 5117, 6356, 5571, 4872, 578, 4705, 1569, 4067, 3981, 3388, 4070, 3807, 1398, 6934, 1879, 7579, 7860, 3410, 256, 3915, 4999 ]
Validation
3,607
2
Conda_(package_manager):conda package manager conda open-source cross-platform language-agnostic package manager environment management system originally developed solve difficult package management challenges faced python data scientists today popular python/r package manager released berkeley software distribution license anaconda inc big difference conda pip package manager package dependencies managed significant challenge python data science reason conda created pip installs python package dependencies required whether conflict packages previously installed working installation example google tensorflow suddenly stop working pip-install new package needs different version numpy library insidiously everything might still appear work get different results unable reproduce results elsewhere n't pip-install order conda analyses current environment everything installed version limitations specify e.g want tensorflow 2.0 figures install compatible dependencies tell want ca n't done pip contrast install package specify dependencies even breaks packages conda allows users easily install different versions binary software packages required libraries appropriate computing platform also allows users switch package versions download install updates software repository conda written python programming language manage projects containing code written language e.g. r including multi-language projects conda install python programming language similar python-based cross-platform package managers wheel pip popular conda channel bioinformatics software bioconda provides multiple software distributions computational biology fact conda package environment manager included versions anaconda miniconda anaconda repository
[ 5363, 4070, 5965, 3559, 3915, 3036, 7848, 6367 ]
Test
3,608
7
CBRP:cbrp cbrp cluster based routing protocol routing protocol wireless mesh networks cbrp originally designed mid 1998 national university singapore subsequently published internet draft august 1998 cbrp one earlier hierarchical ad-hoc routing protocols cbrp nodes dynamically form clusters maintain structural routing support minimize excessive discovery traffic typical ad-hoc routing many performance studies cbrp conducted area vehicular ad-hoc network vanet cbrp shown perform moderately well large high density mesh networks
[ 6335, 6987 ]
Validation
3,609
4
Data_Protection_Act_1998:data protection act 1998 data protection act 1998 c 29 united kingdom act parliament designed protect personal data stored computers organised paper filing system enacted eu data protection directive 1995 provisions protection processing movement data dpa 1998 individuals legal rights control information act apply domestic use example keeping personal address book anyone holding personal data purposes legally obliged comply act subject exemptions act defined eight data protection principles ensure information processed lawfully superseded data protection act 2018 dpa 2018 23 may 2018 dpa 2018 supplements eu general data protection regulation gdpr came effect 25 may 2018 gdpr regulates collection storage use personal data significantly strictly 1998 act replaced data protection act 1984 access personal files act 1987 implemented eu data protection directive 1995 privacy electronic communications ec directive regulations 2003 altered consent requirement electronic marketing positive consent opt-in box exemptions remain marketing similar products services existing customers enquirers still given permission opt basis jersey data protection law modelled uk law section 1 defines personal data data used identify living individual anonymised aggregated data less regulated act providing anonymisation aggregation done reversible way individuals identified various means including name address telephone number email address act applies data held intended held computers 'equipment operating automatically response instructions given purpose held 'relevant filing system cases paper records may classified 'relevant filing system address book salesperson diary used support commercial activities freedom information act 2000 modified act public bodies authorities durant case modified interpretation act providing case law precedent person data processed following rights schedule 1 lists eight data protection principles personal data processed fairly lawfully order data classed 'fairly processed least one six conditions must applicable data schedule 2 except mentioned exceptions individual needs consent collection personal information use purpose question european data protection directive defines consent “ …any freely given specific informed indication wishes data subject signifies agreement personal data relating processed ” meaning individual may signify agreement writing however non-communication interpreted consent additionally consent appropriate age capacity individual circumstances case e.g. organisation intends continue hold use personal data relationship individual ends consent cover even consent given n't assumed last forever although cases consent lasts long personal data needs processed individuals may able withdraw consent depending nature consent circumstances personal information collected used data protection act also specifies sensitive personal data must processed according stricter set conditions particular consent must explicit act structured processing personal data covered act providing number exceptions part iv notable exceptions act grants acknowledges various police court powers act details number civil criminal offences data controllers may liable data controller failed gain appropriate consent data subject however 'consent specifically defined act common law matter uk data protection act large act reputation complexity basic principles honoured protecting privacy interpreting act always simple many companies organisations individuals seem unsure aims content principles act hide behind act refuse provide even basic publicly available material quoting act restriction act also impacts way organisations conduct business terms contacted marketing purposes telephone direct mail also electronically led development permission based marketing strategies definition personal data data relating living individual identified sensitive personal data concerns subject race ethnicity politics religion trade union status health sex life criminal record information commissioner office website states regarding subject access requests sars right find organisation using storing personal data called right access exercise right asking copy data commonly known making ‘ subject access request general data protection regulation gdpr came force 25 may 2018 organisations could charge specified fee responding sar £10 requests following gdpr copy personal data provided free organisation may charge additional copies charge fee thinks request ‘ manifestly unfounded excessive ’ may ask reasonable fee administrative costs associated request compliance act regulated enforced independent authority information commissioner office maintains guidance relating act january 2017 information commissioner office invited public comments eu ’ article 29 working party proposed changes data protection law anticipated introduction extensions interpretation act guide general data protection regulation
[ 1998, 1347, 2548, 803, 2727, 2923, 2666, 2862, 5318, 591, 4619, 3814, 4000, 4821 ]
Validation
3,610
9
Code_Morphing_Software:code morphing software code morphing software cms technology used transmeta microprocessors execute x86 instructions broad view cms reads x86 instructions generates instructions proprietary vliw processor style shade cms translation much expensive shade produces much higher quality code cms also contains interpreter simulates user-mode system mode operation
[ 5571, 352, 512 ]
Test
3,611
4
Cryptographic_Module_Testing_Laboratory:cryptographic module testing laboratory cryptographic module testing laboratory cmtl information technology computer security testing laboratory accredited conduct cryptographic module evaluations conformance fips 140-2 u.s. government standard national institute standards technology nist national voluntary laboratory accreditation program nvlap accredits cmtls meet cryptographic module validation program cmvp standards procedures replaced fips 140-2 cryptographic module validation program cmvp laboratories must meet following requirements cmtl also common criteria cc testing laboratory cctl cc fips 140-2 different abstractness focus tests fips 140-2 testing defined cryptographic module provides suite conformance tests four fips 140 security levels fips 140-2 describes requirements cryptographic modules includes areas physical security key management self tests roles services etc standard initially developed 1994 prior development cc cc evaluation protection profile pp usually created user security target st typically pp covers broad range products operational environment modifiable operational environment operating system requirements common criteria applicable fips security levels 2
[ 4608, 2879, 298, 6208, 1326, 1805 ]
Test
3,612
4
Blackra1n:blackra1n blackra1n program jailbreaks versions 3.1 3.1.1 3.1.2 apple operating system iphone ipod touch known ios program uses bug usb code firmware iphone ipod touch allowing unsigned code executed blackra1n uses exploit patch firmware iphone ipod touch dfu device firmware upgrade mode mode used upgrading firmware itunes also activated user program allows users install cydia icy removed blackra1n rc3 rock package managers applications allow user access tweaks homebrew applications root directory file system ios device blackra1n also perform tethered jailbreaks ipod touch 3g iphone 3gs devices running os 3.1.2 ios 3.1.3 released spiritjb released provided untethered jailbreaks 3.1.2 3.1.3. blackra1n superseded spirit comex
[ 8103, 6788, 3559, 6628, 5571, 327, 6952, 3025, 5189 ]
Test
3,613
8
LYME_(software_bundle):lyme software bundle lyme lyce software stacks composed entirely free open-source software build high-availability heavy duty dynamic web pages stacks composed lyme lyce bundles combined many free open-source software packages e.g netsniff-ng security testing hardening snort intrusion detection ids intrusion prevention system ips rrdtool diagrams nagios collectd cacti monitoring databases mnesia couchdb well yaws also mochiweb misultin cowboy written erlang web applications developed lyme/lyce may run entirely one erlang virtual machine contrast lamp web server apache application written php perl python might process database always separate process result using erlang lyme lyce applications perform well high load distribution fault tolerance needed query data manipulation language mnesia also erlang rather sql therefore web-application lyme developed using single programming language interest lyme stack begun august 2005 soon cited high-performance web application platform used single development language throughout favorable comparisons popular stacks ruby rails soon forthcoming comparisons lamp also favourable although highlighted difficulties porting sql thinking different context mnesia successful user lyme swedish internet payment-processing company klarna built whole architecture lyme seen successful project demonstrates virtues lyme functional programming general lyme also covered erlang session software practice advancement spa 2008 besides yaws several web servers written erlang e.g mochiweb misultin cowboy besides mnesia couchdb couple databases written erlang e.g. cloudant couchbase server born membase database management system optimized storing data behind interactive web applications riak simpledb part amazon web services
[ 3256, 2182, 10, 7528, 7532, 2559, 1474, 5744, 2942, 7555, 6117, 4341, 5762, 412, 5064, 415, 3666, 2970, 3680, 7956, 5453, 5803, 5460, 7242, 1535, 1924, 6892, 1176, 1933, 5829, 1208, 4435, 3404, 1227, 1596, 165, 7312, 5884, 1991, 5540, 8...
Test
3,614
3
SUN_workstation:sun workstation sun workstation modular computer system designed stanford university early 1980s became seed technology many commercial products including original workstations sun microsystems 1979 xerox donated alto computers developed palo alto research center stanford computer science department well universities developing early internet altos connected using ethernet form several local area networks sun design inspired alto used lower-cost modular components project name derived initials campus stanford university network professor forest baskett suggested best-known configuration relatively low-cost personal workstation computer-aided logic design work design created 3m computer 1 million instructions per second mips processor 1 megabyte memory 1 megapixel raster scan bit-map graphics display sometimes 10,000 estimated price called fourth — megapenny director computer facilities ralph gorin suggested configurations initially funded project graduate student andy bechtolsheim designed hardware several students staff members assisting software aspects project vaughan pratt became unofficial faculty leader project 1980 three key technologies made sun workstation possible large-scale integration vlsi integrated circuits multibus ecad ecad electronic computer assisted design known electronic design automation allowed single designer quickly develop systems greater complexity stanford artificial intelligence laboratory sail pioneered personal display terminals 1971 system showing age bechtolsheim used stanford university drawing system suds design sun boards sail system suds originally developed foonly computer structured computer aided logic design scald package used verify design automate layout produce wire-wrapped prototypes printed circuit boards vlsi integrated circuits finally allowed high-level hardware functionality included single chip graphics display controller first board designed published 1980 motorola 68000 cpu along memory parallel port controller serial port controller included main cpu board designed bechtolsheim third board interface 2.94 mbits/second experimental ethernet speed standardized 10 mbits/second multibus computer interface made possible use standard enclosures use circuit boards made different vendors create configurations example cpu board combined multi-port serial controller created terminal server called tip terminal interface processor connected many terminals digital equipment corporation time-sharing systems stanford anywhere internet configuring multiple ethernet controllers including commercial ones available one cpu board created router william yeager wrote software later adopted evolved cisco systems version hardware les earnest licensed cpu board one first commercial low-cost laser printer controllers company called imagen processor board combined prototype high performance graphics display students james h. clark group later formed silicon graphics incorporated eventually ten sun workstations built 1981 1982 stanford declined build bechtolsheim licensed hardware design several vendors frustrated none chosen build workstation vinod khosla also stanford convinced bechtolsheim along scott mcnealy found sun microsystems order build sun-1 workstation included improvements earlier design faculty members research using sun workstations included david cheriton brian reid john hennessy
[ 7010, 4066, 5079, 1258, 4783, 970, 3595 ]
Test
3,615
2
Nokia_N80:nokia n80 nokia n80 3g smartphone nokia announced november 2 2005 part multimedia nseries line runs symbian os v9.1 s60 3rd edition interface first released june 2006 support high-speed umts/wcdma connections features include 3.1-megapixel camera interpolated 2.0-megapixels built-in flash front camera videoconferencing wi-fi 802.11g universal plug play upnp fm radio bluetooth 1.2 minisd memory card slot support 3d java games 2.1-inch display pixel density 259 ppi due 352x416 resolution 2.1 displaymaking one nokia sharpest displays 2005 2006 n80 world first upnp-compatible phone allowing transfer media files compatible devices wi-fi n80 officially described multimedia computer nokia like successor nokia n95 nokia originally announced n80 supporting bluetooth 2.0 however released bluetooth 1.2 therefore n80 currently support stereo playback bluetooth nokia n80 internet edition second version handset hardware normal n80 released q4 2006 available patina bronze pearl black following additional software included january 2007 pearl black model available sale us 499 nokia announced new internet edition firmware available 'classic n80 using nokia official software updater downloadable nokia.com internet edition firmware made available nokia software updater end users could update n80 specification n80 internet edition flashing n80 firmware n80 internet edition required use several hacked nokia servicing software applications including phoenix service software nokia software update nemesis changing product code method questionable legality jurisdictions may violate terms phone warranty reports occasional failure method due user error unknown reasons leaving phone unusable state properly-equipped service center could recover
[ 1066, 5979, 2271, 1159, 6517, 372, 1724, 7521, 4935, 1453, 5909, 3694, 3524, 3952, 472, 8072, 2922, 4407, 118, 23, 2564, 3703, 7261, 484, 7545, 5044, 5493, 740, 1202, 5315, 3029, 5499, 7012, 139, 6465, 5062, 3039, 3653, 1582, 4894, 5068...
Validation
3,616
3
Orion_(system-on-a-chip):orion system-on-a-chip orion system-on-a-chip manufactured marvell technology group used network-attached storage based armv5te architecture on-chip support ethernet sata usb used hardware made hewlett-packard d-link among others supported lenny release debian gnu/linux
[ 3764 ]
Test
3,617
4
HP_MediaSmart_Server:hp mediasmart server hp mediasmart server home server hewlett-packard ran microsoft windows home server operating system october 2008 hp mediasmart server sold two models ex470 rrp us 599 ex475 rrp us 749 feature 1.8 ghz amd sempron 3400+ processor one gigabit ethernet port four internal sata drive bays four usb 2.0 ports one esata port two models identical exception amount included storage ex470 one 500 gb hard drive preinstalled ex475 two 500 gb hard drives preinstalled hackers enthusiasts modded ex470 adding vga monitor upgrading memory 512 mb 2 gb upgrading processor 2.6 ghz amd le-1640 december 29 2008 hp announced two models ex485 ex487 available pre-orders starting january 8 2009 newer models include support apple time machine backup software also use 2.0 ghz intel celeron processor replacing amd sempron old models features include revamped user interface larger preinstalled hard drives one 750 gb drive ex485 two 750 gb drives ex487 april 30 2009 hp announced mediasmart server lx195 intended low-cost entry home server market new model featured single internal 640 gb drive 1.6 ghz intel atom 230 processor 1 gb ddr2 memory gigabit ethernet four usb ports storage expansion software features included lx195 initial launch features ex485/ex487 server september 14 2009 hp launched two new mediasmart servers ex490 comes 1 tb hard disk storage costs 549 ex495 comes 1.5 tb costs 699 7200 rpm 490 comes intel celeron processor 2.2 ghz 495 intel pentium processor dual core 2.5 ghz november 30 2010 windows home server team microsoft confirmed rumors hp would offering hardware next version windows home server codenamed vail hp would stop selling mediasmart servers altogether end calendar year 2010
[ 3764, 1536, 5571 ]
Train
3,618
5
Silly_window_syndrome:silly window syndrome silly window syndrome problem computer networking caused poorly implemented tcp flow control serious problem arise sliding window operation sending application program creates data slowly receiving application program consumes data slowly server problem unable process incoming data requests clients reduce amount data send time window setting tcp packet server continues unable process incoming data window becomes smaller smaller sometimes point data transmitted smaller packet header making data transmission extremely inefficient name problem due window size shrinking silly value since certain amount overhead associated processing packet increased number packets means increased overhead process decreasing amount data end result thrashing synchronization sender receiver regarding capacity flow data size packet window syndrome problem created silly window syndrome created sender nagle algorithm used nagle solution requires sender send first segment even small one wait ack received maximum sized segment mss accumulated silly window syndrome created receiver david clark solution used clark solution closes window another segment maximum segment size mss received buffer half empty 3 causes sws sws efficiency communication almost 0 sws duration short possible heuristic method send tcp must allow sending application make write calls collect data transferred call transmitting large segment sending tcp delays sending segments accumulate reasonable amounts data known clumping heuristic method receiver uses maintain internal record available window delay advertising increase window size sender advance significant amount amount depends receiver buffer size maximum segment size using method prevents small window advertisements received applications extract data octets slowly
[ 3172, 7637, 2633, 4125, 3462 ]
Test
3,619
9
DADiSP:dadisp dadisp data analysis display pronounced day-disp numerical computing environment developed dsp development corporation allows one display manipulate data series matrices images interface similar spreadsheet dadisp used study signal processing numerical analysis statistical physiological data processing dadisp designed perform technical data analysis spreadsheet like environment however unlike typical business spreadsheet operates table cells contain single scalar values dadisp worksheet consists multiple interrelated windows window contains entire series multi-column matrix window stores data also displays data several interactive forms including 2d graphs xyz plots 3d surfaces images numeric tables like traditional spreadsheet windows linked change data one window automatically updates dependent windows numerically graphically users manipulate data primarily windows dadisp window normally referred letter w followed window number w1 example formula codice_1 assigns series values 1 2 3 w1 formula codice_2 sets second window compute square value w1 w2 contain series 1 4 9 values w1 change 3 5 2 4 values w2 automatically update 9 25 4 16 dadisp includes series based programming language called spl series processing language used implement custom algorithms spl c/c++ like syntax incrementally compiled intermediate bytecode executed virtual machine spl supports standard variables assigned codice_3 hot variables assigned codice_4 example statement codice_5 assigns series 1 2 3 standard variable square values assigned codice_6 variable b contains series 1 3 9 changes b change b preserves values assigned without regard future state however statement codice_7 creates hot variable hot variable analogous window except hot variables display data assignment codice_8 computes square values changes b automatically updates setting codice_9 causes b automatically update 9 25 4 16 dadisp originally developed early 1980s part research project mit explore aerodynamics formula one racing cars original goal project enable researchers quickly explore data analysis algorithms without need traditional programming
[ 6507, 5098, 3606, 2820, 4759, 5288, 5117, 6356, 5571, 4872, 4705, 1569, 4067, 3981, 4070, 1774, 7860, 3410, 256, 4999, 1435 ]
Test
3,620
9
PDF/E:pdf/e iso 24517-1:2008 iso standard published 2008 standard defines format pdf/e creation documents used geospatial construction manufacturing workflows ref name= pdf/e-iso-standard iso 24517-1:2008 document management -- engineering document format using pdf -- part 1 use pdf 1.6 pdf/e-1 /ref based pdf reference version 1.6 adobe systems specification also supports interactive media including animation 3d pdf/e subset pdf designed open neutral exchange format engineering technical documentation. ref name= pdf/e-ready-guide creating pdf/e-ready files /ref pdf/e standard specifies portable document format pdf used creation documents engineering workflows key benefits pdf/e include standard define method creation conversion paper electronic documents pdf/e format committee managing iso 24517 pdf/e needs subject-matter experts assist development part 2 standard iso 24517 pdf/e created meet needs organizations need reliably create exchange review engineering documentation however first part standard address 3d video dynamic content address integrated source data
[ 6172, 7721, 6428, 1543, 7732, 6015, 2214, 737, 4884, 6208, 1114, 5948, 1774, 2057, 2872, 2877, 3916, 698, 1435, 7144 ]
Test
3,621
1
Anchor_modeling:anchor modeling anchor modeling agile database modeling technique suited information changes time structure content provides graphical notation used conceptual modeling similar entity-relationship modeling extensions working temporal data modeling technique involves four modeling constructs anchor attribute tie knot capturing different aspects domain modeled resulting models translated physical database designs using formalized rules translation done tables relational database mostly sixth normal form anchor modeling created order take advantage benefits high degree normalization avoiding drawbacks advantages able non-destructively evolve model avoid null values keep information free redundancies gained performance issues due extra joins largely avoided thanks feature modern database engines called 'table elimination order handle changes information content anchor modeling emulates aspects temporal database resulting relational database schema earliest installations using anchor modeling made sweden first dating back 2004 data warehouse insurance company built using technique 2007 technique used data warehouses one oltp system presented internationally lars rönnbäck 2007 transforming data intelligence tdwi conference amsterdam stirred enough interest technique warrant formal description since research concerning anchor modeling done collaboration creators olle regardt lars rönnbäck team department computer systems sciences stockholm university first paper anchor modeling formalized presented 28th international conference conceptual modeling best paper award commercial web site provides material anchor modeling free use creative commons license online modeling tool also available free use open source anchor modeling four basic modeling concepts anchors attributes ties knots anchors used model entities events attributes used model properties anchors ties model relationships anchors knots used model shared properties states attributes ties historized changes information model need kept example model showing different graphical symbols concepts seen symbols resemble used entity–relationship modeling couple extensions double outline attribute tie indicates history changes kept knot symbol outlined square rounded edges also available anchor modeling handles two types informational evolution structural changes content changes changes structure information represented extensions high degree normalization makes possible non-destructively add necessary modeling concepts needed capture change way every previous schema always remains subset current schema since existing schema touched gives benefit able evolve database highly iterative manner without causing downtime changes content information done emulating similar features temporal database relational database anchor modeling pieces information tied points time intervals time open closed time points events occur modeled using attributes e g birth dates persons time purchase intervals time value valid captured historization attributes ties e g changes hair color person period time person married relational database achieved adding single column data type granular enough capture speed changes table corresponding historized attribute tie adds slight complexity one row table examined order know interval closed points intervals time directly related domain modeled points time information entered database handled use metadata anchor modeling rather mentioned constructs information changes database needs kept bitemporal anchor modeling used addition updates also delete statements become non-destructive anchor modeling one-to-one mapping symbols used conceptual model tables relational database every anchor attribute tie knot corresponding table database unambiguously defined structure conceptual model thereby translated relational database schema using simple automated rules vice versa different many modeling techniques complex sometimes subjective translation steps conceptual logical physical levels anchor tables contain single column identities stored identity assumed property entity always present immutable identities rarely available domain modeled instead technically generated e g incrementing number sequence example anchor identities nephews donald duck set 1-tuples codice_1 knots thought combination anchor single attribute knot tables contain two columns one identity one value due storing identities values together knots historized usefulness comes able reduce storage requirements improve performance since tables referencing knots store short value rather long string example knot genders set 2-tuples codice_2 static attribute tables contain two columns one identity entity value belongs one actual property value historized attribute tables extra column storing starting point time interval knotted attribute table value column identity references knot table example static attribute names set 2-tuples codice_3 example knotted static attribute genders set 2-tuples codice_4 example historized attribute changing colors outfits set 3-tuples codice_5 static tie tables relate two anchors contain two columns storing identities historized tie tables extra column storing starting point time interval knotted tie tables additional column referenced knot example static tie sibling relationship set 2-tuples codice_6 resulting tables sixth normal form except ties columns part primary key
[ 4048, 7071, 7999, 6462, 1768, 2054, 5419, 2124, 3621 ]
Test
3,622
3
Gyrodine:gyrodine note player fire guns time
[]
Train
3,623
9
Runtime_library:runtime library computer programming runtime library rtl set low-level routines used compiler invoke behaviors runtime environment inserting calls runtime library compiled executable binary runtime environment implements execution model built-in functions fundamental behaviors programming language execution run time computer program execution calls runtime library cause communication executable binary runtime environment runtime library often includes built-in functions memory management exception handling therefore runtime library always specific platform compiler runtime library may implement portion runtime environment behavior one reads code calls available typically thin wrappers simply package information send runtime environment operating system however sometimes term runtime library meant include code runtime environment even though much code directly reached via library call example language features performed efficient accurate runtime implemented runtime environment may invoked via runtime library api e.g logic errors array bounds checking dynamic type checking exception handling possibly debugging functionality reason programming bugs discovered program tested live environment real data despite sophisticated compile-time checking testing performed development another example runtime library may contain code built-in low-level operations complicated inlining compilation implementations arithmetic operations directly supported targeted cpu various miscellaneous compiler-specific operations directives concept runtime library confused ordinary program library like created application programmer delivered third party dynamic library meaning program library linked run time example c programming language requires minimal runtime library commonly called codice_1 defines large standard library called c standard library provided implementation
[ 5012, 5630, 4662, 3843, 2820, 3955, 1361, 6002, 5218, 6960, 5571, 1191, 1854, 930, 4525, 7474, 2420, 1774, 5771, 1495, 5515, 5606, 956, 3238, 6778, 1989, 5091, 5190, 2085 ]
Test
3,624
2
John_Mashey:john mashey john r. mashey born 1946 us computer scientist director entrepreneur mashey holds ph.d. computer science pennsylvania state university developed assist assembler language teaching software worked pwb/unix operating system bell labs 1973 1983 authoring pwb shell also known mashey shell moved silicon valley join convergent technologies ending director software joined mips computer systems early 1985 managing operating systems development helping design mips risc architecture well specific cpus systems software continued similar work silicon graphics 1992–2000 contributing design numaflex modular computer architecture using numalink ending vp chief scientist mashey one founders standard performance evaluation corporation spec benchmarking group acm national lecturer four years guest editor ieee micro one long-time organizers hot chips conferences chaired technical conferences operating systems cpu chips gave public talks software engineering risc design performance benchmarking supercomputing credited first spread term concept big data 1990s became consultant venture capitalists high-tech companies trustee computer history museum 2008 2012 received usenix lifetime achievement award flame award contributions unix community since early days written articles skeptical inquirer regarding climate change denial 2010 published 250-page critical report wegman report mashey report concluded wegman report contained plagiarized text story featured usa today interviewed science magazine stated spending retirement years compiling voluminous critiques calls 'real conspiracy produce 'climate antiscience research investigated secretive funding climate contrarian thinktanks mashey blogs desmogblog focuses global warming mashey became scientific technical consultant committee skeptical inquiry 2015 mashey married angela hey cambridge university waterloo university graduate ph.d. imperial college london
[ 5055, 7010, 1180, 1493, 3692, 6046 ]
Test
3,625
4
Cooperative_database:cooperative database cooperative database type database holds information customers transactions many companies contribute information database return aggregate information customers companies provided databases used promotional mailings credit card fraud detection fighting e-mail spam alternatively term cooperative database used describe database systems incorporate techniques aid users beyond returning direct answers databases example give explanations query returns results detect report user misconception suggested query provide justifications returned answers relax query attributes find close non-precise answers fundamental goal extend databases towards reflecting cooperative principle particular avoid misleading users omission pertinent contextual detail
[ 2054 ]
Test
3,626
6
File_attribute:file attribute file attributes metadata associated computer files define file system behavior attribute one two states set cleared attributes considered distinct metadata dates times filename extensions file system permissions addition files folders volumes file system objects may attributes traditionally ms-dos microsoft windows four attributes archive hidden read-only system windows added new ones systems derived 4.4bsd-lite freebsd netbsd openbsd dragonfly bsd macos sets system user attributes newer versions linux kernel also support set file attributes traditionally dos microsoft windows files folders accepted four attributes new versions windows came microsoft added inventory available attributes ntfs file system including limited attributes displayed attributes column windows explorer include 4.4bsd 4.4bsd-lite files directories folders accepted four attributes could set owner file superuser user attributes two attributes could set superuser system attributes freebsd added additional attributes also supported dragonfly bsd freebsd also supports whereas dragonfly bsd supports netbsd added another attribute also supported openbsd macos added three attributes dos os/2 windows codice_3 command cmd.exe command.com used change display four traditional file attributes file explorer windows show seven mentioned attributes set clear system attribute windows powershell become component windows 7 later features two commands read write attributes codice_4 codice_5 change attribute file windows nt user must appropriate file system permissions known write attributes write extended attributes 4.4bsd 4.4bsd-lite derivatives codice_6 codice_7 commands used change display file attributes change user attribute file 4.4bsd-derived operating systems user must owner file superuser change system attribute user must superuser linux codice_8 codice_9 commands used change display file attributes
[ 1807, 3599, 4297, 2547, 7161, 5021, 4672, 13, 3271, 6431, 3276, 5041, 7546, 5049, 7550, 405, 1855, 6117, 2949, 4347, 759, 65, 4733, 6853, 6854, 5437, 5784, 6857, 5088, 4375, 6500, 785, 2266, 788, 3682, 6505, 1522, 7605, 3595, 3685, 5457...
Test
3,627
7
CtrlS:ctrls ctrls tier-4 datacenter india headquartered hyderabad deals large group networked computer servers typically used various organizations remote storage processing distribution large amounts data large groups remote servers networked allow centralized data storage online access computer services resources ctrls belongs industry hyderabad branches mumbai delhi ctrls datacenters founded 2008 hyderabad india established aim keep online applications data secure provide network storage services various organizations sridhar pinnapureddy founder ceo ctrls spearheaded 200 innovations energy management dc infra cloud disaster recovery also founder chairman pioneer group companies interests internet services infrastructure picked recognitions outstanding entrepreneur year – 2010 asia pacific region apea rajiv gandhi shiromani global economic council karamveer puraskar 2007 awarded icongo accomplishments contributions society ctrls developed capabilities provide platform level services include data center infrastructure storage backup hardware os layers network security layers offers services disaster recovery demand managed services private cloud-on-demand enable clients make paradigm shift captive datacenter model outsourced one tier 4 data centers ctrls located hyderabad mumbai delhi bangalore headquarters hyderabad
[ 4211, 5894, 4217, 2988, 7613, 370, 632, 189, 289, 1634, 3091, 6262, 7165, 3954, 7722, 3958, 6806, 22, 1550, 5927, 2212, 6906, 5135, 7741, 320, 3028, 7838, 5940, 2317, 3309, 754, 5064, 330, 7114, 4627, 2961, 2430, 4636, 7037, 1982, 1514,...
Test
3,628
0
Lexicase:lexicase lexicase type dependency grammar originally developed beginning early 1970s stanley starosta university hawaii dozens starosta graduate students also contributed theory wrote least 20 doctoral dissertations using lexicase analyze numerous languages asia japanese mandarin vietnamese thai khmer tagalog etc europe greek russian etc africa swahili yoruba lexicase monostratal x-bar grammar i.e transformational grammar words heads phrases i.e assumed empty phrases lexicase words features determine morphosyntactic distribution dependents primary goal lexicase provide simple transparent disprovable means testing cross-linguistic tendencies lexically focused theory lexicase used identify verb subcategories korean russian thai vietnamese noun subcategories khmer thai provide overall language description pacoh central vietnam regarding arguments clause structure used explore case greek mandarin chinese transitivity ergativity amis indigenous language taiwan proto-central pacific austronesian among topics
[ 2882 ]
Test
3,629
5
TSIG:tsig tsig transaction signature computer-networking protocol defined rfc 2845 primarily enables domain name system dns authenticate updates dns database commonly used update dynamic dns secondary/slave dns server tsig uses shared secret keys one-way hashing provide cryptographically secure means authenticating endpoint connection allowed make respond dns update although queries dns may usually made without authentication updates dns must authenticated since make lasting changes structure internet naming system update request may arrive via insecure channel internet one must take measures ensure authenticity integrity request use key shared client making update dns server helps ensure authenticity integrity update request one-way hashing function serves prevent malicious observers modifying update forwarding destination thus ensuring integrity message source destination timestamp included tsig protocol prevent recorded responses reused would allow attacker breach security tsig places requirement dynamic dns servers tsig clients contain accurate clock since dns servers connected network network time protocol provide accurate time source dns updates like queries normally transported via udp since requires lower overhead tcp however dns servers support udp tcp requests update specified rfc 2136 set instructions dns server include header zone updated prerequisites must satisfied record updated tsig adds final record includes timestamp hash request also includes name secret key used sign request rfc 2535 recommendations form name response successful tsig update also signed tsig record failures signed prevent attacker learning anything tsig key using specially crafted update probes nsupdate program use tsig dns updates tsig record format records update request meaning fields described rfc 1035 although tsig widely deployed several problems protocol result number alternatives extensions proposed
[ 644, 2043, 7217, 2134, 7637, 4759, 4261 ]
Validation
3,630
9
FP_(programming_language):fp programming language fp short function programming programming language created john backus support function-level programming paradigm allows eliminating named variables language introduced backus 1977 turing award lecture programming liberated von neumann style subtitled functional style algebra programs paper sparked interest functional programming research eventually leading modern functional languages function-level paradigm backus hoped fp never found much use outside academia 1980s backus created successor language fl remained research project values fp programs map one another comprise set closed sequence formation values built set atoms booleans integers reals characters etc ⊥ undefined value bottom sequences bottom-preserving fp programs functions f map single value x another functions either primitive i.e. provided fp environment built primitives program-forming operations also called functionals example primitive function constant transforms value x constant-valued function x̄ functions strict another example primitive function selector function family denoted 1,2 ... contrast primitive functions functionals operate functions example functions unit value 0 addition 1 multiplication functional unit produces value applied function f one core functionals fp addition constructed primitives functionals function may defined recursively equation simplest kind e f expression built primitives defined functions function symbol f using functionals fp84 extension fp include infinite sequences programmer-defined combining forms analogous backus added fl successor fp lazy evaluation unlike ffp another one backus variations fp fp84 makes clear distinction objects functions i.e. latter longer represented sequences former fp84 extensions accomplished removing fp restriction sequence construction applied non -⊥ objects fp84 entire universe expressions including whose meaning ⊥ closed sequence construction fp84 semantics embodied underlying algebra programs set function-level equalities may used manipulate reason programs
[ 6507, 1270, 2740, 1549, 4573, 1892, 1774, 1381, 3570 ]
Test
3,631
4
Inference_attack:inference attack inference attack data mining technique performed analyzing data order illegitimately gain knowledge subject database subject sensitive information considered leaked adversary infer real value high confidence example breached information security inference attack occurs user able infer trivial information robust information database without directly accessing object inference attacks piece together information one security level determine fact protected higher security level
[]
Validation
3,632
2
Utah_GLX:utah glx utah glx project aimed creating fully free open-source basic hardware-accelerated 3d renderer using opengl rendering api linux kernel-based operating systems utah glx predates direct rendering infrastructure used 2014 john d. carmack worked utah glx
[ 6692, 7669 ]
Validation
3,633
4
Trusteer:trusteer trusteer portfolio digital identity trust software products belonging ibm security founded mickey boodaei rakesh k. loonkar israel 2006 trusteer acquired september 2013 ibm 1 billion highest valuation multiple ibm ever paid business ibm trusteer helps organizations seamlessly establish digital identity trust across web customer journey cloud-based intelligence backed ai patented machine learning trusteer provides holistic approach identifying new existing customers without negatively impacting user experience 500 leading organizations rely trusteer help enable secure customers ’ digital journey support business growth trusteer presence north america south america europe africa japan ibm trusteer helps brands accelerate digital growth establishing digital identity trust across channels helping recognize customers deter bad actors trusteer rapport adaptive endpoint solution helps protect financial institutions end-users transparently detecting protecting financial malware infections phishing attacks account takeover provides comprehensive security layer anti-virus software typically designed address financial malicious activity software service offering uses 24/7 threat intelligence including geographic customize detection matrix address new threats real-time including attacking specific financial institution used leading financial institutions worldwide trusteer rapport combines global footprint millions endpoints years threat data analysis experience innovative technology achieve high rates detection low false positives increasingly sophisticated financial threat environment specifically trusteer rapport detects alerts organization pharming phishing screenshots overlays financial malware advises end-user account risk compromised moment installed end-user ’ computer trusteer rapport immediately checks removes existing financial malware malicious patches starts performing continuous transparent monitoring kernel operating system browser application levels protect new threats trusteer rapport supports browser extensions google chrome microsoft edge apple safari mozilla firefox supports microsoft internet explorer use trusteer rapport end-users simply install rapport browser extension web browser choice trusteer rapport compatible microsoft windows 7 higher multiple mac os x versions supported browsers platforms end-users download trusteer rapport free charge financial institutions offer software free charge offer safer online banking customers organizations also acquire trusteer mobile sdk extend protection native mobile applications trusteer pinpoint platform digital identity trust lifecycle platform designed provide b2c access management dynamically managing digital identity trust web mobile applications platform made three products trusteer pinpoint platform allows organizations improve digital customer journey single platform dynamically manage risk-based seamless authentication user-friendly step-up authentication establish trust identity proofing new guest users happens need validate new anonymous customer user true customer intent initiating payment fraud abusing loyalty program guests new customers let unimpeded ones complete step-up authentication using advanced intelligence global visibility ibm trusteer pinpoint™ assure solution designed help detect predict risk fraudulent intent new guest customers also enables companies conduct early account monitoring new accounts ’ type insight ’ critical reducing abandonment caused friction security measures increasing loyalty program registrations growing digital channel sustain trust continuous authentication trusted users better protect customer accounts payment journeys compromised detecting account takeovers unauthorized logins activity requires comprehensive view account access device session user perspective ibm trusteer pinpoint detect delivers kind visibility using behavioral biometric capabilities behavioral analytics transparently build user profiles continually authenticate online identities using machine learning patented analytics platform analyzes patterns mouse movements astonishing speeds volumes differentiate account user ’ “ normal ” digital behavior abnormal behavior insight combined device activity evidence transactional data geolocation data either abnormal user behavior known fraudster behavior detected trusteer pinpoint detect provides recommended action real-time along detailed reasoning session details organization take steps confirm trust necessary confirm trust combine risk assessment strong adaptive authentication confirm trust abnormal user behavior suspicious activity identified ibm trusteer pinpoint verify cloud-based authentication service seamlessly integrates pinpoint assure pinpoint detect help companies apply strong step-up authentication necessary application developers simply use exposed interfaces service challenge users perform second factor authentication via digital application users choose enroll various forms two-factor authentication one-time passcodes via email sms mobile push notification biometric authentication trusteer pinpoint products use context- based intelligence combining device id proxy emulator detection malware remote access trojan rat infection detection bot detection email phone number intelligence account history patterns behavioral biometrics navigation session analysis determine trust risk level associated user trusteer mobile sdk helps organizations build digital identity trust mobile confidence customers differentiating trusted mobile devices users suspicious ones exposes real-time mobile risk allow account compromise mitigation proactively detects mobile device risk native mobile applications available standalone assessing risk indicators mobile device integrates ibm trusteer pinpoint digital identity trust platform use threat intelligence correlate mobile device user behavior account risk factors across digital channels specifically ibm trusteer mobile sdk generates strong persistent global device id uses robust set capabilities detect mobile device risks real-time applies machine learning analytics offer actionable insights suspicious mobile user behavior threat detection capabilities include real-time overlay attacks emulators sms stealers remote access tools rats insecure wi-fi networks active pharming rooting jailbreaking uses server-side trusteer pinpoint capabilities correlated aggregated awareness device anomalies user behavior account risk indicators—such account takeover phishing attacks malware infections compromised credentials advanced evasion methods—across digital channels also works seamlessly trusteer pinpoint platform detect protect mobile device fraudulent activity early digital account creation process guest user new mobile device introduced trusteer apex automated solution tries prevent exploits malware compromising endpoints extracting information apex three layers security exploit prevention data exfiltration prevention credentials protection apex protects employee credentials phishing attacks validating employees submitting credentials authorized enterprise web-application login urls apex also prevents corporate employees re-using corporate credentials access non-corporate public applications like paypal e-bay facebook twitter apex requires users provide different credentials applications lower risk credentials exposure trusteer apex targeted behaviors small group applications hypothesis responsible overwhelming majority exploits namely java adobe ’ reader flash microsoft ’ office technology behind trusteer apex rely threat signatures so-called whitelists good applications instead watches applications run spots suspicious malicious behavior based knowledge normal application behavior refined large user base trusteer claims apex block web-based attacks used implant malware exploiting vulnerable applications data loss due malware infections spotting attempts untrusted applications processes send data outside organization connect internet-based command control c c networks end users reported problems rapport slow pcs due high cpu ram utilization incompatibility various security/antivirus products difficulty removing software presentation given 44con september 2011 bypassing trusteer rapport keylogger protection shown relatively trivial shortly thereafter trusteer confirmed flaw corrected said even hacker able use flaw disable anti-keylogging functions rapport secondary security protection technologies would still play rapport software incompatible windows tool driver verifier may cause blue screen system crash since driver verifier intended end users production environment workstations trusteer support recommends end users run driver verifier trusteer endpoint protection installed march 2011 blue gem rival company filed lawsuit trusteer california court blue gem accused trusteer plagiarizing code order maintain compatibility anti-keystroke logging software types intel chipset first introduced back 2007 trusteer described accusations baseless
[ 7630, 2789, 4408, 3807, 6130, 3514, 6586, 7003, 4531, 6543, 2803 ]
Test
3,634
4
Virtual_machine_escape:virtual machine escape computer security virtual machine escape process breaking virtual machine interacting host operating system virtual machine completely isolated guest operating system installation within normal host operating system 2008 vulnerability cve-2008-0923 vmware discovered core security technologies made vm escape possible vmware workstation 6.0.2 5.5.4 fully working exploit labeled cloudburst developed immunity inc. immunity canvas commercial penetration testing tool cloudburst presented black hat usa 2009
[ 3761, 1594, 4295, 5571, 5613, 1805 ]
Test
3,635
2
Address_space_layout_randomization:address space layout randomization address space layout randomization aslr computer security technique involved preventing exploitation memory corruption vulnerabilities order prevent attacker reliably jumping example particular exploited function memory aslr randomly arranges address space positions key data areas process including base executable positions stack heap libraries linux pax project first coined term aslr published first design implementation aslr july 2001 patch linux kernel seen complete implementation providing also patch kernel stack randomization since october 2002 first mainstream operating system support aslr default openbsd version 3.4 2003 followed linux 2005 address space randomization hinders types security attacks making difficult attacker predict target addresses example attackers trying execute return-to-libc attacks must locate code executed attackers trying execute shellcode injected stack find stack first cases system obscures related memory-addresses attackers values guessed mistaken guess usually recoverable due application crashing address space layout randomization based upon low chance attacker guessing locations randomly placed areas security increased increasing search space thus address space randomization effective entropy present random offsets entropy increased either raising amount virtual memory area space randomization occurs reducing period randomization occurs period typically implemented small possible systems must increase vma space randomization defeat randomization attackers must successfully guess positions areas wish attack data areas stack heap custom code useful data loaded one state attacked using nop slides code repeated copies data allows attack succeed area randomized one handful values contrast code areas library base main executable need discovered exactly often areas mixed example stack frames injected onto stack library returned following variables declared calculate probability attacker succeeding assume number attempts carried without interrupted signature-based ips law enforcement factor case brute forcing daemon restarted also figure many bits relevant many attacked attempt leaving however many bits attacker defeat following formulas represent probability success given set attempts bits entropy many systems formula_14 thousands millions 64-bit systems numbers typically reach millions least hector marco-gisbert ismael ripoll showed 2014 bypass aslr 64-bit systems less one second certain circumstances 32-bit systems 2004 computer speeds 16 bits address randomization shacham co-workers state ... 16 bits address randomization defeated brute force attack within minutes authors statement depends ability attack application multiple times without delay proper implementations aslr like included grsecurity provide several methods make brute force attacks infeasible one method involves preventing executable executing configurable amount time crashed certain number times android possibly systems implement library load order randomization form aslr randomizes order libraries loaded supplies little entropy approximation number bits entropy supplied per needed library appears yet account varied library sizes actual entropy gained really somewhat higher note attackers usually need one library math complex multiple libraries shown well note case attacker using one library simplification complex formula formula_15 values tend low even large values importantly since attackers typically use c standard library thus one often assume formula_17 however even small number libraries bits entropy gained thus potentially interesting combine library load order randomization vma address randomization gain extra bits entropy note extra bits entropy apply mmap segments libraries attackers may make use several methods reduce entropy present randomized address space ranging simple information leaks attacking multiple bits entropy per attack heap spraying little done possible leak information memory layout using format string vulnerabilities format string functions printf use variable argument list job format specifiers describe argument list looks like way arguments typically passed format specifier moves closer top stack frame eventually return pointer stack frame pointer extracted revealing address vulnerable library address known stack frame completely eliminate library stack randomization obstacle attacker one also decrease entropy stack heap stack typically must aligned 16 bytes smallest possible randomization interval heap must page-aligned typically 4096 bytes attempting attack possible align duplicate attacks intervals nop slide may used shellcode injection string replaced arbitrary number slashes attempting return system number bits removed exactly formula_18 intervals attacked decreases limited due amount data stack heap stack example typically limited grows much less allows although conservative estimate would around 8– corresponding 4– stack stuffing heap hand limited behavior memory allocator case glibc allocations 128 kb created using mmap limiting attackers 5 bits reduction also limiting factor brute forcing although number attacks perform reduced size attacks increased enough behavior could circumstances become apparent intrusion detection systems aslr-protected addresses leaked various side channels removing mitigation utility recent attacks used information leaked cpu branch target predictor buffer btb memory management unit mmu walking page tables clear class aslr attack mitigated benefit aslr reduced eliminated several mainstream general-purpose operating systems implement aslr android 4.0 ice cream sandwich provides address space layout randomization aslr help protect system third party applications exploits due memory-management issues position-independent executable support added android 4.1 android 5.0 dropped non-pie support requires dynamically linked binaries position independent library load ordering randomization accepted android open-source project 26 october 2015 included android 7.0 release dragonfly bsd implementation aslr based upon openbsd model added 2010 default enabled setting sysctl vm.randomize_mmap 1 support aslr appear freebsd 13.0 currently development disabled default apple introduced aslr ios 4.3 released march 2011 kaslr introduced ios 6 randomized kernel base 0x01000000 1+0xrr 0x00200000 0xrr random byte sha1 random data generated iboot 2nd-stage ios boot loader linux kernel enabled weak form aslr default since kernel version 2.6.12 released june 2005 pax exec shield patchsets linux kernel provide complete implementations exec shield patch linux supplies 19 bits stack entropy period 16 bytes 8 bits mmap base randomization period 1 page 4096 bytes places stack base area 8 mb wide containing 524,288 possible positions mmap base area 1 mb wide containing 256 possible positions position-independent executable pie implements random base address main executable binary place since 2003 provides address randomness main executable used shared libraries pie feature use network facing daemons – pie feature used together prelink feature executable prelink tool implements randomization prelink time rather runtime design prelink aims handle relocating libraries dynamic linker allows relocation occur many runs program result real address space randomization would defeat purpose prelinking randomization disabled specific process changing execution domain using personality 2 kernel address space layout randomization kaslr bringing support address space randomization running linux kernel images randomizing kernel code placed boot time merged linux kernel mainline kernel version 3.14 released 30 march 2014 compiled disabled boot time specifying one kernel boot parameters several side-channel attacks x86 processors could leak kernel addresses late 2017 kernel page-table isolation kpti aka kaiser developed defeat attacks however method protect side-channel attacks utilizing collisions branch predictor structures microsoft windows vista released january 2007 later aslr enabled executables dynamic link libraries specifically linked aslr-enabled compatibility enabled default applications typically older software incompatible aslr fully enabled editing registry entry hklm\system\currentcontrolset\control\session manager\memory management\moveimages installing microsoft enhanced mitigation experience toolkit locations heap stack process environment block thread environment block also randomized security whitepaper symantec noted aslr 32-bit windows vista may robust expected microsoft acknowledged weakness implementation host-based intrusion prevention systems wehntrust ozone also offer aslr windows xp windows server 2003 operating systems wehntrust open-source complete details ozone implementation available noted february 2012 aslr 32-bit windows systems prior windows 8 effectiveness reduced low memory situations similar effect also achieved linux research test code caused mac os x 10.7.3 system kernel panic left unclear aslr behavior scenario support aslr userland appeared netbsd 5.0 released april 2009 enabled default netbsd-current april 2016 kernel aslr support amd64 added netbsd-current october 2017 making netbsd first bsd system support kaslr 2003 openbsd became first mainstream operating system support strong form aslr activate default openbsd completed aslr support 2008 added support pie binaries openbsd 4.4 malloc 3 designed improve security taking advantage aslr gap page features implemented part openbsd codice_3 system call detect use-after-free bugs released 2013 openbsd 5.3 first mainstream operating system enable position-independent executables default multiple hardware platforms openbsd 5.7 activated position-independent static binaries static-pie default mac os x leopard 10.5 released october 2007 apple introduced randomization system libraries mac os x lion 10.7 released july 2011 apple expanded implementation cover applications stating address space layout randomization aslr improved applications available 32-bit apps heap memory protections making 64-bit 32-bit applications resistant attack os x mountain lion 10.8 released july 2012 later entire system including kernel well kexts zones randomly relocated system boot aslr introduced solaris beginning solaris 11.1 released october 2012 aslr solaris 11.1 set system-wide per zone per-binary basis side-channel attack utilizing branch target buffer demonstrated bypass aslr protection 2017 attack named aslr⊕cache demonstrated could defeat aslr web browser using javascript
[ 449, 1339, 3932, 5627, 2451, 8064, 8066, 5373, 1265, 1739, 3100, 5381, 5737, 1938, 310, 578, 4877, 3548, 1019, 2318, 3557, 755, 5413, 757, 2326, 3220, 2327, 8118, 6567, 3905, 4986, 4729, 4990, 5962, 2885, 7498, 1989, 3680, 1805 ]
Test
3,636
2
GhostBSD:ghostbsd ghostbsd unix-like operating system based trueos mate default desktop environment gnome previous desktop environment xfce-desktop community based edition aims easy install ready-to-use easy use project goal combine security privacy stability usability openness freedom free charge prior ghostbsd 18.10 project based freebsd may 2018 announced future versions operating system based trueos beginning ghostbsd 18.10 project moved base freebsd trueos following trueos based ghostbsd releases ghostbsd originally licensed 3-clause bsd license revised bsd license new bsd license modified bsd license 2014 eric turgeon re-licensed ghostbsd 2-clause license simplified bsd license freebsd license ghostbsd contains gpl-licensed software following minimum recommended requirements
[ 5268, 1522, 1523, 1341, 1254, 7514, 191, 6085, 6711, 1356, 1547, 4498, 7355, 481, 3457, 732, 2300, 5571, 6278, 7827, 8194, 8096, 1193, 1013, 4059, 5232, 6367, 8001, 6918, 5760, 6211, 3986, 4806, 5065, 594, 4441, 5865, 4534, 6477, 424, 2...
Test
3,637
4
F5_Networks:f5 networks f5 networks inc. global company specializes application services application delivery networking adn f5 technologies focus delivery security performance availability web applications well availability servers cloud resources data storage devices networking components f5 headquartered seattle washington additional development manufacturing sales/marketing offices worldwide known originally load balancing product today f5 product services line expanded things related delivery applications including local load balancing acceleration global dns based load balancing acceleration security web application firewall application authentication access products ddos defense f5 technologies available data center cloud including private public multi-cloud environments based platforms aws microsoft azure google cloud openstack f5 networks originally named f5 labs established 1996 company name inspired 1996 movie twister reference made fastest powerful tornado fujita scale f5 f5 first product launched 1997 load balancer called big-ip server went became overloaded big-ip directed traffic away server servers could handle load june 1999 company initial public offering listed nasdaq stock exchange symbol ffiv 2010 2011 f5 networks fortune list 100 fastest-growing companies company also rated one top ten best-performing stocks p 500 2010 f5 also named best place work online jobs recruiting site glassdoor 2015 2016 competitors included cisco systems 2012 citrix systems radware françois locoh-donou replaced john mcadam president ceo april 3 2017 may 3 2017 f5 announced would move longtime headquarters waterfront near seattle center new downtown seattle skyscraper called f5 tower move occur early 2019 2017 f5 launched dedicated site organization focused gathering global threat intelligence data analyzing application threats publishing related findings dubbed “ f5 labs ” nod company ’ history team continues research application threats publish findings every week benefit broader security community 2019 f5 networks occupies leading position ranking popular companies wikipedia f5 big-ip product family comprises hardware modularized software virtual appliances run f5 tmos operating system depending appliance selected one big-ip product modules added offerings include september 7 2004 f5 networks released version 9.0 big-ip software addition appliances run software version 9.0 also marked introduction company tmos architecture significant enhancements including subsequent releases enhanced performance improves application security supported cloud application deployments f5 describes big-iq framework managing big-ip devices application services irrespective form factors hardware software cloud deployment model on-premises private/public cloud hybrid big-iq supports integration ecosystem participants public cloud providers orchestration engines cloud connectors set open restful apis big-iq uses multi-tenant approach management allows organizations move closer service without concern might affect stability security services fabric silverline cloud-based application service offerings include security services waf ddos protection services 2017 company introduced technologies make f5 capabilities portable across broader range environments including
[ 1809, 385, 7536, 6440, 6107, 1474, 3637, 6456, 3653, 62, 765, 2961, 5434, 5439, 6149, 3338, 5452, 1919, 806, 113, 2291, 5824, 2296, 4414, 4783, 7275, 3394, 6560, 7289, 4091, 2340, 7683, 6583, 6235, 6951, 6592, 875, 3756, 6962, 1249, 696...
Test
3,638
2
Unix_security:unix security unix security refers means securing unix unix-like operating system secure environment achieved design concepts operating systems also vigilant user administrative practices core security feature systems file system permissions files typical unix filesystem permissions set enabling different access file permissions file commonly set using chmod command seen ls command example unix permissions permit different users access file different user groups different permissions file advanced unix filesystems include access control list concept allows permissions granted multiple users groups access control list may used grant permission additional individual users groups example example chacl command linux operating system user sue granted write permission /pvr directory users unix style operating systems often belong managed groups specific access permissions enables users grouped level access system many unix implementations add additional layer security requiring user member wheel user privileges group order access codice_1 command unix unix-like systems account group enables user exact complete control system often known root account access account gained unwanted user results complete breach system root account however necessary administrative purposes security reasons root account seldom used day day purposes sudo program commonly used usage root account closely monitored root access visualised familiar superman stories using following analogy unix many tools improve security used properly users administrators selecting strong password guarding properly probably important things user improve unix security unix systems essential information users stored file codice_2this file keeps track users registered system main definitions passwords correctly hash password also stored place entries codice_2 occupy exactly one line following form example would since users must read access codice_2 file many common tasks codice_5 use codice_2 map uids login names example anyone could also read password hashes users solve problem file codice_7 created store password hashes root read access password shadowing 2nd field password hash replaced x tells system retrieve corresponding user password via codice_7 file codice_7 file often contains values first two fields remaining fields codice_7 file include fields may used improve unix security enforcing password security policy administrators delete old accounts promptly operating systems like software may contain bugs need fixing may enhanced addition new features patching operating system secure manner requires software come trustworthy source altered since packaged common methods verifying operating system patches altered include use cryptographic hash md5 based checksum use read-only media security standpoint specific packaging method rpm package manager format originally red hat linux important use features ensure integrity patch source distributions include ability examine code suspicious content drawback absent accompanying cryptographic hash value user must able perform security analysis code linux distributions use rpm package manager format providing base functionality software updates make use md5 gpg ensure content integrity hash values packaged rpm file verified package installed linux distributions use debian .deb package format providing base functionality software updates make use gpg signatures ensure content integrity signature computed package constructed verified later package installed regardless vendor distribution software distributions provide mechanism verifying software legitimate modified since originally packaged unnecessary system software installed configured system software longer required removed completely possible commands inetd xinetd act super-servers variety network protocols rlogin telnet ftp turning unnecessary services approach usually called proactive security operating systems secure default amongst others free bsd flavours freebsd netbsd openbsd proactively secure example output netstat netbsd 3.0 workstation clearly outlines technique following example bsd system shows machine ssh service listening public network interface computer sendmail listening loopback interface access service may restricted using firewall file system security within unix unix-like systems based 9 permission bits set user group id bits sticky bit total 12 bits permissions apply almost equally filesystem objects files directories devices 9 permission bits divided three groups three bits first group describes permissions file owner second group describes permissions group associated file owner directory containing file third group describes permissions associated process user id file group three bits contains bit indicating read write execute access granted case directories execute access interpreted permission perform filename lookup within directory set user id set group id bits commonly abbreviated set-uid set-gid respectively used change identity process executes file either bits set file set-uid permission bit set cause process executes file temporarily switch effective user id file owner file set-gid permission bit set cause process executes file temporarily switch effective group id file group process may alternate effective user group id inherited file real user group id inherited user logged system provides mechanism process may limit access rights possesses code regions require access rights form security technique known privilege separation improves program security limiting unintended undesirable actions processes directory set-gid permission bit set cause newly created file initial file group value equal file group directory provides mechanism whereby subsystem system mail subsystem create files common file group value set-gid processes within subsystem able read write file sticky bit formally known save text swap bit derives name original purpose originally sticky bit caused process initial memory image stored contiguous image disk drive used store real memory pages use improved performance commonly executed commands making initial memory image readily available modern unix systems longer perform function bit set name preserved nonetheless case files sticky-bit may used system indicate style file locking performed case directories sticky bit prevents process one super-user privileges one effective user id file owner deleting file within directory sticky bit commonly used publicly writable directories various temporary working space directories system root squash reduction access rights remote superuser root using identity authentication local user remote user primarily feature nfs may available systems well problem arises remote file system shared multiple users users belong one multiple groups unix every file folder normally separate permissions read write execute owner normally creator file group owner belongs world users allows restriction read write access authorized users general nfs server must also protected firewall superuser rights ordinary user able change file ownership set arbitrary permissions access protected content even users need root access individual workstations may authorized similar actions shared file system root squash reduces rights remote root making one longer superuser unix like systems root squash option turned /etc/exports file server side implementing root squash authorized superuser performs restricted actions logging nfs server directly mounting exported nfs folder selinux set kernel extensions control access precisely strictly defining files folders network ports resources accessed confined process system mostly used restrict processes database server rather human users also limit processes run root distributions use comparable alternatives like apparmor unix-like operating systems immune microsoft windows viruses binaries created run windows generally wo n't run platforms however many unix like installations provide file storage services microsoft windows clients use samba software may unintentionally become repository viruses stored users common unix servers act mail transfer agents consequently email virus scanning often installed clamav virus scanner available source code form may used scan unix file systems viruses infect operating systems viruses worms target unix-like operating systems fact first computer worm—the morris worm—targeted unix systems network firewall protects systems networks network threats exist opposite side firewall firewalls block access strictly internal services unwanted users cases filter network traffic content iptables current user interface interacting linux kernel netfilter functionality replaced ipchains unix like operating systems may provide native functionality open source firewall products exist detailed information iptables contained elsewhere brief discussion contained order describe iptables may used configure linux firewall netfilter provides state-full packet filter configured according network interface protocol source and/or destination address source and/or destination port state packet network packet traverses several chains time received network interface time accepted host forwarded another host common chains input output forward input chain traversed packets received network interface regardless whether accepted host forwarded another host output chain traversed packets transmitted network interface forward chain traversed packets routed host one network interface another case multi-homed system system one physical network interface built-in chains default policy defines action taken packet reaches end chain packet traversal ends rule matches packet action accept drop reject return simplest iptables firewall consists rules desired service followed rule indicates packets reach rule dropped system permitted example incoming email traffic would rule accepted connections smtp port dropped others rule would required indicated established connections also permitted outgoing connections would receive responses systems following example shows simple packet filter input chain described example addition explicit drop action ensures packets discarded default policy input chain accidentally changed accept less need output chain default policy output chain safely set accept instances may desirable firewall limit certain outgoing connections certain set approved systems known egress filtering may used prevent viruses within firewall escaping systems example may policy network limit outgoing email connections single authorized email servers way combating e-mail spam could achieved following example need include rules example default policy output chain accept note also rule assumes host acting firewall sending email email server good assumption typically firewall system contains minimal amount system code needed act firewall restrictive output chain would contain permissive accept entries services may accessed outside firewall restrictive drop policy chain secure network communication packet sniffing attacks
[ 1630, 5814, 2644, 2649, 5571, 6908, 578, 5933, 6017, 3638, 3117, 6823, 1019, 2043, 588, 4716, 759, 5773, 3821, 4632, 1047, 7214, 1691, 7765, 4014, 6242, 1805, 3426 ]
Test
3,639
1
Project_6:project 6 project 6 simply p6 global surveillance project jointly operated u.s. central intelligence agency cia close cooperation german intelligence agencies bundesnachrichtendienst bnd bundesamt für verfassungsschutz bfv part efforts combat terrorism project includes massive database containing personal information photos license plate numbers internet search histories telephone metadata presumed jihadists headquarters project located neuss germany
[ 1344, 5509 ]
Test
3,640
5
Explicit_Congestion_Notification:explicit congestion notification explicit congestion notification ecn extension internet protocol transmission control protocol defined rfc 3168 2001 ecn allows end-to-end notification network congestion without dropping packets ecn optional feature may used two ecn-enabled endpoints underlying network infrastructure also supports conventionally tcp/ip networks signal congestion dropping packets ecn successfully negotiated ecn-aware router may set mark ip header instead dropping packet order signal impending congestion receiver packet echoes congestion indication sender reduces transmission rate detected dropped packet rather responding properly ignoring bits outdated faulty network equipment historically dropped mangled packets ecn bits set measurements suggested fraction web servers public internet setting ecn prevents network connections reduced less 1 passive support existed ubuntu linux since 12.04 windows server since 2012 passive support popular websites increased 8.5 2012 70 may 2017 adoption across internet requires clients actively request ecn june 2015 apple announced ecn enabled default supported future products help drive adoption ecn signaling industry-wide ecn requires specific support internet layer transport layer following reasons without ecn congestion indication echo achieved indirectly detection lost packets ecn congestion indicated setting ecn field within ip packet ce echoed back receiver transmitter setting proper bits header transport protocol example using tcp congestion indication echoed back setting ece bit ecn uses two least significant right-most bits diffserv field ipv4 ipv6 header encode four different code points endpoints support ecn mark packets ect 0 ect 1 packet traverses active queue management aqm queue e.g. queue uses random early detection red experiencing congestion corresponding router supports ecn may change code point codice_5 instead dropping packet act referred “ marking ” purpose inform receiving endpoint impending congestion receiving endpoint congestion indication handled upper layer protocol transport layer protocol needs echoed back transmitting node order signal reduce transmission rate ce indication handled effectively upper layer protocol supports ecn used conjunction upper layer protocols tcp support congestion control method echoing ce indication transmitting endpoint tcp supports ecn using two flags tcp header first ecn-echo ece used echo back congestion indication i.e signal sender reduce amount information sends second congestion window reduced cwr acknowledge congestion-indication echoing received use ecn tcp connection optional ecn used must negotiated connection establishment including suitable options syn syn-ack segments ecn negotiated tcp connection sender indicates ip packets carry tcp segments connection carrying traffic ecn capable transport marking ect code point allows intermediate routers support ecn mark ip packets ce code point instead dropping order signal impending congestion upon receiving ip packet congestion experienced code point tcp receiver echoes back congestion indication using ece flag tcp header endpoint receives tcp segment ece bit reduces congestion window packet drop acknowledges congestion indication sending segment cwr bit set node keeps transmitting tcp segments ece bit set receives segment cwr bit set see affected packets tcpdump use filter predicate codice_6 since transmission control protocol tcp perform congestion control control packets pure acks syn fin segments control packets usually marked ecn-capable 2009 proposal suggests marking syn-ack packets ecn-capable improvement known ecn+ shown provide dramatic improvements performance short-lived tcp connections ecn also defined transport layer protocols perform congestion control notably dccp stream control transmission protocol sctp general principle similar tcp although details on-the-wire encoding differ principle possible use ecn protocols layered udp however udp requires congestion control performed application current networking apis give access ecn bits since ecn effective combination active queue management aqm policy benefits ecn depend precise aqm used observations however appear hold across different aqms expected ecn reduces number packets dropped tcp connection avoiding retransmission reduces latency especially jitter effect drastic tcp connection single outstanding segment able avoid rto timeout often case interactive connections remote logins transactional protocols http requests conversational phase smtp sql requests effects ecn bulk throughput less clear modern tcp implementations fairly good resending dropped segments timely manner sender window large use ecn found detrimental performance highly congested networks using aqm algorithms never drop packets modern aqm implementations avoid pitfall dropping rather marking packets high load many modern implementations tcp/ip protocol suite support ecn however usually ship ecn disabled windows versions since windows server 2008 windows vista support ecn tcp since windows server 2012 enabled default windows server versions data center transmission control protocol dctcp used previous windows versions non-server versions disabled default ecn support enabled using shell command freebsd 8.0 netbsd 4.0 implement ecn support tcp activated sysctl interface setting 1 value parameter likewise sysctl used openbsd since version 2.4.20 linux kernel released november 2002 linux supports three working modes ecn tcp configured sysctl interface setting parameter one following values beginning version 4.1 linux kernel released june 2015 mechanism specified rfc 3168 section 6.1.1.1 enabled default ecn enabled value 1 fallback mechanism attempts ecn connectivity initial setup outgoing connections graceful fallback transmissions without ecn capability mitigating issues ecn-intolerant hosts firewalls mac os x 10.5 10.6 implement ecn support tcp controlled using boolean sysctl variables first variable enables ecn incoming connections already ecn flags set second one tries initiate outgoing connections ecn enabled variables default set enable respective behavior june 2015 apple inc. announced os x 10.11 released later year would ecn turned default never happened macos sierra ecn enabled 50 percent tcp sessions june 2015 apple inc. announced ios 9 next version ios would support ecn turned default tcp ecn negotiation enabled 5 randomly selected connections wi-fi ethernet ios 9 50 randomly selected connections wi-fi ethernet cellular carriers ios 10 100 ios 11 solaris kernel supports three states ecn tcp default behavior solaris 11 full ecn usage activated via since ecn marking routers dependent form active queue management routers must configured suitable queue discipline order perform ecn marking cisco ios routers perform ecn marking configured wred queuing discipline since version 12.2 8 t. linux routers perform ecn marking configured one red gred queue disciplines explicit ecn parameter using sfb discipline using codel fair queuing fq_codel discipline cake queuing discipline modern bsd implementations freebsd netbsd openbsd support ecn marking altq queueing implementation number queuing disciplines notably red blue freebsd 11 included codel pie fq-codel fq-pie queuing disciplines implementation ipfw/dummynet framework ecn marking capability data center transmission control protocol data center tcp dctcp utilizes ecn enhance transmission control protocol congestion control algorithm used data center networks whereas standard tcp congestion control algorithm able detect presence congestion dctcp using ecn able gauge extent congestion dctcp modifies tcp receiver always relay exact ecn marking incoming packets cost ignoring function meant preserve signalling reliability makes dctcp sender vulnerable loss acks receiver mechanism detect cope algorithms provide equivalent better receiver feedback reliable approach active research topic
[ 7148, 1068, 709, 4676, 4677, 7170, 4683, 6432, 1462, 4320, 5039, 6446, 2219, 4709, 3312, 1123, 7214, 7217, 2612, 3337, 1900, 456, 6879, 2281, 6521, 106, 2644, 6531, 2650, 121, 4414, 7637, 6908, 3379, 5492, 3383, 494, 5850, 7297, 5169, 2...
Test
3,641
8
Chartbeat:chartbeat chartbeat technology company provides data analytics global publishers company started 2009 headquartered new york city us saas company integrates code websites publishers media companies news organizations track audience engagement loyalty metrics make decisions content publish promote web sites august 2010 company spun betaworks separate entity chartbeat praised criticized alternative google analytics real-time data betaworks launched chartbeat april 2009 real-time web analytics tool said publishers could use react quickly changes user behavior time google analytics offer real-time data launch chartbeat part broader strategy betaworks capitalize growth real-time stream-based social web betaworks also invested twitter tumblr bit.ly tweetdeck august 2010 company spun betaworks separate entity july 2011 chartbeat launched newsbeat version service news sites february 2016 founding ceo tony haile resigned company seven years ceo long time coo john saroff named successor october 2017 chartbeat made updates user experience design including rebrand flagship product chartbeat publishing
[ 1250, 330, 3850, 84 ]
Train
3,642
4
Robert_Lipka:robert lipka robert stephen lipka june 16 1945 – july 5 2013 former army clerk national security agency nsa 1997 pleaded guilty conspiracy commit espionage sentenced 18 years prison arrested 30 years betrayal statute limitations espionage robert lipka assigned national security agency intelligence analyst 1964 19-year-old u.s. army soldier worked central communications room 1964–1967 responsible removing disseminating highly classified documents throughout agency despite junior rank lipka held high security clearance access diverse array highly classified documents september 1965 lipka presented soviet embassy 16th street walk-in volunteer spy announced responsible shredding highly classified documents next two years made contact residency around fifty times using variety skilled tradecraft according handler time former kgb general oleg danilovich kalugin young soldier lipka ... involved shredding destroying nsa documents could supply us wealth material goes say lipka gave whatever got hands often little idea turning lipka compromised daily weekly top-secret reports white house information us troop movements throughout world communications among nato allies two years lipka supplied kgb top-secret information received payment 27,000 kalugin claims lipka used money received around 500 1,000 per package delivered finance college education however lipka regularly complained deserved money threatened break contact demand met august 1967 lipka made good threat left nsa end military service order attend millersville university pennsylvania order discourage attempts kgb recontact lipka sent final message claiming double agent us intelligence along according vasili mitrokhin kgb knew lie high importance classified documents lipka provided residency illegals non diplomatic cover handlers tried renew contact lipka intermittently least another 11 years though without success similar john anthony walker case lipka ex-wife made accusations treason fbi 1993 armed accusations revelations kalugin memoir information separate investigation implicating lipka fbi decided use false flag operation catch fbi agent dmitri droujinsky contacted lipka posing gru officer based washington named sergei nikitin lipka told nikitin still owed money course four meetings nikitin gave lipka 10,000 lengthy investigation lipka admitted spy nsa february 1996 arrested home millersville pa charged handing classified documents soviet union statute limitations espionage cases matter lipka ceased spying soviet union three decades arrest may 1997 lipka accepted plea deal avoid trial could resulted life sentence courtroom philadelphia inquirer reported lipka exploded tears confessed handed classified information kgb agents sentenced september 1997 18 years prison 10,000 fine additional reimbursement fbi 10,000 given nikitin according federal bureau prisons lipka released december 8 2006 july 5 2013 robert lipka died meadville pa age 68 remains cremated john w. whiteside iii fool mate true story espionage national security agency 2014
[ 6869, 8071 ]
Validation
3,643
3
Composite_artifact_colors:composite artifact colors composite artifact colors designation commonly used address several graphic modes 1970s 1980s home computers machines connected ntsc tv monitor composite video outputs video signal encoding allowed extra colors displayed manipulating pixel position screen limited machine hardware color palette though modern tvs might work well mode used mainly games since limited display horizontal resolution normal mostly used ibm pc cga graphics trs-80 color computer apple ii computers also possible atari 8-bit limitations composite video regarding horizontal resolution also exploited systems adjacent pixel values got averaged horizontally producing solid colors generating transparency effects pal displays ntsc 4.43 ones effect n't generate new colors rather mix adjacent horizontal pixel values however depending pal system used results vary pal pal n used color artifacts seen ntsc might also possible higher resolution video connection used graphics displayed dither patterns machines zx spectrum mega drive took advantage situation using ibm color graphics adapter cga ntsc tv-out separation luminance chrominance imperfect yielding cross-color artifacts color smearing especially problem 80-column text reason text graphics modes described exists twice normal color version monochrome version monochrome version mode turns ntsc color decoding viewing monitor completely resulting black-and-white picture also color bleeding hence sharper picture rgbi monitors two versions mode identical exception 320×200 graphics mode monochrome version produces third palette described however programmers learned flaw could turned asset distinct patterns high-resolution dots would smear consistent areas solid colors thus allowing display completely new colors since new colors result cross-color artifacting often called artifact colors standard 320×200 four-color 640×200 color-on-black graphics modes could used technique resulting screens would usable resolution 160×200 16 colors trs-80 color computer 256×192 two color graphics mode uses four colors due quirk ntsc television system possible reliably display 256 dots across screen due limitations ntsc signal phase relationship vdg clock colorburst frequency first colorset green black dots available alternating columns green black distinct appear muddy green color however one switches white black colorset instead muddy gray expected result either orange blue reversing order alternating dots give opposite color effect mode becomes 128×192 4 color graphics mode black orange blue white available apple ii created color graphics exploiting similar effect coco games used mode colors available useful ones provided hardware 4 color modes vdg internally power either rising falling edge clock bit patterns represent orange blue predictable coco games start title screen asks user press reset button colors correct coco 3 fixes clock-edge problem always user holds f1 key reset choose color set coco 3 analog rgb monitor black white dot patterns artifact see one uses tv composite monitor patch games use hardware 128×192 four color mode gime chip allows color choices mapped users pal countries see green purple stripes instead solid red blue colors readers rainbow hot coco magazine learned use poke commands switch 6847 vdg one artifact modes extended color basic continues operate though still displaying one 128x192 four-color modes thus entire set extended color basic graphics commands used artifact colors users developed set 16 artifact colors using 4×2 pixel matrix use poke commands also make colors available graphics commands although colors drawn one horizontal line time interesting artworks produced effects especially since coco max art package provides palette colors resulting 16 color palette color graphics apple ii series uses quirk ntsc television signal standard made color display relatively easy inexpensive implement apple ii display provides two pixels per ntsc subcarrier cycle color burst reference signal computer attached color display display green showing one alternating pattern pixels magenta opposite pattern alternating pixels white placing two pixels next later blue orange became available tweaking offset pixels half pixel-width relation color-burst signal high-resolution display offers colors simply compressing narrower pixels subcarrier cycle coarse low-resolution graphics display mode works differently output pattern dots per pixel offer color options patterns stored character generator rom replaces text character bit patterns computer switched low-res graphics mode text mode low-res graphics mode uses memory region circuitry used graphics 8 mode atari 8-bit computers using color television interface adaptor ctia chip designed display black white resolution 320×192 programmers found using artifact colors blue red also used mode software on-line systems wizard princess use feature display four colors atari began shipping computers improved graphic television interface adaptor gtia users found programs displayed incorrect colors needed updates many high-profile game titles offers graphics optimized composite color monitors ultima ii first game game series ported ibm pc uses cga composite graphics king quest also innovative use 16-color graphics titles include microsoft decathlon king quest ii king quest iii using composite connection pal tv system generate new colors instead horizontal blurring effect given different bandwidths pal broadcast systems pal-m pal-n pal-b etc.. actual effect intensity vary effect pronounced higher display resolutions used exploited game artists machines using dithering patterns one notable example mega drive takes full advantage simulate transparency effects earlier machine zx spectrum uses effect blend colors simulate half bright variations basic 8 color palette home computers like atari st commodore amiga also graphics prepared dithering techniques take advantage composite tv connections regarding amiga special hold-and-modify particularly suited displaying high color tv-like images taking full advantage horizontal blurring
[ 3643, 1862 ]
Validation
3,644
4
Metadata_removal_tool:metadata removal tool metadata removal tool metadata scrubber type privacy software built protect privacy users removing potentially privacy-compromising metadata files shared others e.g. sending e-mail attachments posting web metadata removal tools also commonly used reduce overall sizes files particularly image files posted web example small image website may contain metadata including thumbnail image easily contain much metadata image data thus removal metadata halve file size metadata found many types files documents spreadsheets presentations images audio files include information details file authors file creation modification dates location gps document revision history thumbnail images comments since metadata sometimes clearly visible authoring applications depending application settings risk user unaware existence forget file shared private confidential information inadvertently exposed purpose metadata removal tools minimize risk data leakage metadata removal tools exist today divided four groups
[ 7151, 5150, 5806, 8191, 84 ]
Test
3,645
0
TAUM_system:taum system taum traduction automatique à l'université de montréal name research group set université de montréal 1965 research done 1968 1980 gave birth taum-73 taum-meteo machine translation prototypes using q-systems programming language created alain colmerauer among first attempts perform automatic translation linguistic analysis prototypes never used actual production taum-meteo name erroneously used many years designate meteo system subsequently developed john chandioux
[ 2852, 5008, 2321 ]
Test
3,646
7
Stub_(distributed_computing):stub distributed computing stub distributed computing piece code converts parameters passed client server remote procedure call rpc main idea rpc allow local computer client remotely call procedures different computer server client server use different address spaces parameters used function procedure call converted otherwise values parameters could used pointers parameters one computer memory would point different data computer client server may also use different data representations even simple parameters e.g. big-endian versus little-endian integers stubs perform conversion parameters remote procedure call looks like local function call remote computer stub libraries must installed client server side client stub responsible conversion marshalling parameters used function call deconversion results passed server execution function server skeleton stub server side responsible deconversion parameters passed client conversion results execution function stubs generated one two ways server program implements procedure interface said export interface client program calls procedures interface said import interface writing distributed application programmer first writes interface definition using idl programmers write client program imports interface server program exports interface interface definition processed using idl compiler generate components combined client server programs without making changes existing compilers particular interface procedure interface compiler generate appropriate marshalling unmarshalling operations stub procedure header file supports data types interface definition header file included source files client server programs client stub procedures compiled linked client program server stub procedures compiled linked server program idl compiler designed process interface definitions use different languages enabling clients servers written different languages communicate using remote procedure calls achieve goal semantics transparency designers made rpc look like lpc using concept stubs hide actual rpc implementation programs interface underlying rpc system
[ 3172, 7299, 3905 ]
Test
3,647
4
Sandstorm_Enterprises:sandstorm enterprises sandstorm enterprises american computer security software vendor founded 1998 simson garfinkel james van bokkelen gene spafford dan geer january 2010 purchased niksun inc. sandstorm located greater boston area sandstorm major products phonesweep first commercial multi-line telephone scanner war dialer introduced 1998 netintercept commercial network forensics tool introduced 2001 designed second-generation network analysis tool netintercept operated primarily level tcp udp data streams application-layer objects transport 2002 sandstorm purchased lanwatch commercial packet-oriented lan monitor originally developed ftp software lanwatch sold separate product much functionality used netintercept display individual packets 2019 phonesweep product still sold supported niksun core parts netintercept product also still exist incorporated niksun netdetector network forensics product line
[ 4699 ]
Test
3,648
4
IPhone_Dev_Team:iphone dev team iphone dev team group engineers ios formerly iphone os community developed several tools enable use applications authorized apple inc iphone ipod touch ipad enable use iphone gsm carriers contracted apple applications provided owners ability sidestep limitations placed devices manufacturer allowing activities deep customization easy international roaming group tools became emblematic activities termed jailbreaking sim unlocking respectively extent electronic frontier foundation made primary example used petition create dmca anti-circumvention exemption jailbreaking apple executive greg joswiak vice president iphone product marketing quoted countering comment petition products maintained iphone dev team include
[ 113, 6788, 4141, 4575, 2327 ]
Test
3,649
2
Jean-Marie_Hullot:jean-marie hullot jean-marie hullot february 16 1954 – june 17 2019 french computer scientist programmer authored important programs original macintosh nextstep mac os x platforms include sos interface mac later became interface builder nextstep 1985 later still evolved important part mac os x also led ical isync development teams mac os x 2002 1981 jean-marie hullot received ph.d. computer science university paris orsay adviser gérard huet researcher inria 1979 1985 joined next 1996 co-founded realnames url translation service closed 2002 worked cto application division apple inc. 2001 2005 president ceo fotopedia collaborative photo encyclopaedia died june 17 2019
[ 7259, 5450, 6971 ]
Test
3,650
4
Intruder_detection:intruder detection information security intruder detection process detecting intruders behind attacks unique persons technique tries identify person behind attack analyzing computational behaviour concept sometimes confused intrusion detection also known ids techniques art detecting intruder actions intruder detection systems try detect attacking system analyzing computational behaviour biometric behaviour keystroke dynamics paramount intruder detection techniques parameter classified real 'behavioural biometric pattern keystroke dynamics analyze times keystrokes issued computer keyboard cellular phone keypad searching patterns first techniques used statistics probability concepts like 'standard deviations 'mean later approaches use data mining neural networks support vector machine etc earlier works reference concept intruder authentication intruder verification intruder classification si6 project one first projects deal full scope concept confusion spanish translation 'intrusion detection system also known ids people translate 'sistemas de detección de intrusiones others translate 'sistemas de detección de intrusos former correct
[ 3680, 7120 ]
Test
3,651
0
Automatic_summarization:automatic summarization automatic summarization process shortening text document software order create summary major points original document technologies make coherent summary take account variables length writing style syntax automatic data summarization part machine learning data mining main idea summarization find subset data contains information entire set techniques widely used industry today search engines example others include summarization documents image collections videos document summarization tries create representative summary abstract entire document finding informative sentences image summarization system finds representative important i.e salient images surveillance videos one might want extract important events uneventful context two general approaches automatic summarization extraction abstraction extractive methods work selecting subset existing words phrases sentences original text form summary contrast abstractive methods build internal semantic representation use natural language generation techniques create summary closer human might express summary might include verbal innovations research date focused primarily extractive methods appropriate image collection summarization video summarization summarization task automatic system extracts objects entire collection without modifying objects examples include keyphrase extraction goal select individual words phrases tag document document summarization goal select whole sentences without modifying create short paragraph summary similarly image collection summarization system extracts images collection without modifying images extraction techniques merely copy information deemed important system summary example key clauses sentences paragraphs abstraction involves paraphrasing sections source document general abstraction condense text strongly extraction programs harder develop require use natural language generation technology growing field work done abstractive summarization creating abstract synopsis like human majority summarization systems extractive selecting subset sentences place summary machine learning techniques closely related fields information retrieval text mining successfully adapted help automatic summarization apart fully automated summarizers fas systems aid users task summarization mahs machine aided human summarization example highlighting candidate passages included summary systems depend post-processing human hams human aided machine summarization broadly two types extractive summarization tasks depending summarization program focuses first generic summarization focuses obtaining generic summary abstract collection whether documents sets images videos news stories etc. second query relevant summarization sometimes called query-based summarization summarizes objects specific query summarization systems able create query relevant text summaries generic machine-generated summaries depending user needs example summarization problem document summarization attempts automatically produce abstract given document sometimes one might interested generating summary single source document others use multiple source documents example cluster articles topic problem called multi-document summarization related application summarizing news articles imagine system automatically pulls together news articles given topic web concisely represents latest news summary image collection summarization another application example automatic summarization consists selecting representative set images larger set images summary context useful show representative images results image collection exploration system video summarization related domain system automatically creates trailer long video also applications consumer personal videos one might want skip boring repetitive actions similarly surveillance videos one would want extract important suspicious activity ignoring boring redundant frames captured high level summarization algorithms try find subsets objects like set sentences set images cover information entire set also called core-set algorithms model notions like diversity coverage information representativeness summary query based summarization techniques additionally model relevance summary query techniques algorithms naturally model summarization problems textrank pagerank submodular set function determinantal point process maximal marginal relevance mmr etc task following given piece text journal article must produce list keywords key phrase capture primary topics discussed text case research articles many authors provide manually assigned keywords text lacks pre-existing keyphrases example news articles rarely keyphrases attached would useful able automatically number applications discussed consider example text news article keyphrase extractor might select army corps engineers president bush new orleans defective flood-control pumps keyphrases pulled directly text contrast abstractive keyphrase system would somehow internalize content generate keyphrases appear text closely resemble human might produce political negligence inadequate protection floods abstraction requires deep understanding text makes difficult computer system keyphrases many applications enable document browsing providing short summary improve information retrieval documents keyphrases assigned user could search keyphrase produce reliable hits full-text search employed generating index entries large text corpus depending different literature definition key terms words phrases keyword extraction highly related theme beginning work turney many researchers approached keyphrase extraction supervised machine learning problem given document construct example unigram bigram trigram found text though text units also possible discussed compute various features describing example e.g. phrase begin upper-case letter assume known keyphrases available set training documents using known keyphrases assign positive negative labels examples learn classifier discriminate positive negative examples function features classifiers make binary classification test example others assign probability keyphrase instance text might learn rule says phrases initial capital letters likely keyphrases training learner select keyphrases test documents following manner apply example-generation strategy test documents run example learner determine keyphrases looking binary classification decisions probabilities returned learned model probabilities given threshold used select keyphrases keyphrase extractors generally evaluated using precision recall precision measures many proposed keyphrases actually correct recall measures many true keyphrases system proposed two measures combined f-score harmonic mean two f 2 pr p r matches proposed keyphrases known keyphrases checked stemming applying text normalization designing supervised keyphrase extraction system involves deciding several choices apply unsupervised first choice exactly generate examples turney others used possible unigrams bigrams trigrams without intervening punctuation removing stopwords hulth showed get improvement selecting examples sequences tokens match certain patterns part-of-speech tags ideally mechanism generating examples produces known labeled keyphrases candidates though often case example use unigrams bigrams trigrams never able extract known keyphrase containing four words thus recall may suffer however generating many examples also lead low precision also need create features describe examples informative enough allow learning algorithm discriminate keyphrases non- keyphrases typically features involve various term frequencies many times phrase appears current text larger corpus length example relative position first occurrence various boolean syntactic features e.g. contains caps etc turney paper used 12 features hulth uses reduced set features found successful kea keyphrase extraction algorithm work derived turney ’ seminal paper end system need return list keyphrases test document need way limit number ensemble methods i.e. using votes several classifiers used produce numeric scores thresholded provide user-provided number keyphrases technique used turney c4.5 decision trees hulth used single binary classifier learning algorithm implicitly determines appropriate number examples features created need way learn predict keyphrases virtually supervised learning algorithm could used decision trees naive bayes rule induction case turney genex algorithm genetic algorithm used learn parameters domain-specific keyphrase extraction algorithm extractor follows series heuristics identify keyphrases genetic algorithm optimizes parameters heuristics respect performance training documents known key phrases another keyphrase extraction algorithm textrank supervised methods nice properties like able produce interpretable rules features characterize keyphrase also require large amount training data many documents known keyphrases needed furthermore training specific domain tends customize extraction process domain resulting classifier necessarily portable turney results demonstrate unsupervised keyphrase extraction removes need training data approaches problem different angle instead trying learn explicit features characterize keyphrases textrank algorithm exploits structure text determine keyphrases appear central text way pagerank selects important web pages recall based notion prestige recommendation social networks way textrank rely previous training data rather run arbitrary piece text produce output simply based text intrinsic properties thus algorithm easily portable new domains languages textrank general purpose graph-based ranking algorithm nlp essentially runs pagerank graph specially designed particular nlp task keyphrase extraction builds graph using set text units vertices edges based measure semantic lexical similarity text unit vertices unlike pagerank edges typically undirected weighted reflect degree similarity graph constructed used form stochastic matrix combined damping factor random surfer model ranking vertices obtained finding eigenvector corresponding eigenvalue 1 i.e. stationary distribution random walk graph vertices correspond want rank potentially could something similar supervised methods create vertex unigram bigram trigram etc however keep graph small authors decide rank individual unigrams first step include second step merges highly ranked adjacent unigrams form multi-word phrases nice side effect allowing us produce keyphrases arbitrary length example rank unigrams find advanced natural language processing get high ranks would look original text see words appear consecutively create final keyphrase using four together note unigrams placed graph filtered part speech authors found adjectives nouns best include thus linguistic knowledge comes play step edges created based word co-occurrence application textrank two vertices connected edge unigrams appear within window size n original text n typically around 2–10 thus natural language might linked text nlp natural processing would also linked would appear string n words edges build notion text cohesion idea words appear near likely related meaningful way recommend reader since method simply ranks individual vertices need way threshold produce limited number keyphrases technique chosen set count user-specified fraction total number vertices graph top vertices/unigrams selected based stationary probabilities post- processing step applied merge adjacent instances unigrams result potentially less final keyphrases produced number roughly proportional length original text initially clear applying pagerank co-occurrence graph would produce useful keyphrases one way think following word appears multiple times throughout text may many different co-occurring neighbors example text machine learning unigram learning might co-occur machine supervised un-supervised semi-supervised four different sentences thus learning vertex would central hub connects modifying words running pagerank/textrank graph likely rank learning highly similarly text contains phrase supervised classification would edge supervised classification classification appears several places thus many neighbors importance would contribute importance supervised ends high rank selected one top unigrams along learning probably classification final post-processing step would end keyphrases supervised learning supervised classification short co-occurrence graph contain densely connected regions terms appear often different contexts random walk graph stationary distribution assigns large probabilities terms centers clusters similar densely connected web pages getting ranked highly pagerank approach also used document summarization considered like keyphrase extraction document summarization aims identify essence text real difference dealing larger text units—whole sentences instead words phrases getting details summarization methods mention summarization systems typically evaluated common way using so-called rouge recall-oriented understudy gisting evaluation measure recall-based measure determines well system-generated summary covers content present one human-generated model summaries known references recall-based encourage systems include important topics text recall computed respect unigram bigram trigram 4-gram matching example rouge-1 computed division count unigrams reference appear system count unigrams reference summary multiple references rouge-1 scores averaged rouge based content overlap determine general concepts discussed automatic summary reference summary determine result coherent sentences flow together sensible manner high-order n-gram rouge measures try judge fluency degree note rouge similar bleu measure machine translation bleu precision- based translation systems favor accuracy promising line document summarization adaptive document/text summarization idea adaptive summarization involves preliminary recognition document/text genre subsequent application summarization algorithms optimized genre first summarizes perform adaptive summarization created supervised text summarization much like supervised keyphrase extraction basically collection documents human-generated summaries learn features sentences make good candidates inclusion summary features might include position document i.e. first sentences probably important number words sentence etc main difficulty supervised extractive summarization known summaries must manually created extracting sentences sentences original training document labeled summary summary typically people create summaries simply using journal abstracts existing summaries usually sufficient sentences summaries necessarily match sentences original text would difficult assign labels examples training note however natural summaries still used evaluation purposes since rouge-1 cares unigrams duc 2001 2002 evaluation workshops tno developed sentence extraction system multi-document summarization news domain system based hybrid system using naive bayes classifier statistical language models modeling salience although system exhibited good results researchers wanted explore effectiveness maximum entropy classifier meeting summarization task known robust feature dependencies maximum entropy also applied successfully summarization broadcast news domain unsupervised approach summarization also quite similar spirit unsupervised keyphrase extraction gets around issue costly training data unsupervised summarization approaches based finding centroid sentence mean word vector sentences document sentences ranked regard similarity centroid sentence principled way estimate sentence importance using random walks eigenvector centrality lexrank algorithm essentially identical textrank use approach document summarization two methods developed different groups time lexrank simply focused summarization could easily used keyphrase extraction nlp ranking task lexrank textrank graph constructed creating vertex sentence document edges sentences based form semantic similarity content overlap lexrank uses cosine similarity tf-idf vectors textrank uses similar measure based number words two sentences common normalized sentences lengths lexrank paper explored using unweighted edges applying threshold cosine values also experimented using edges weights equal similarity score textrank uses continuous similarity scores weights algorithms sentences ranked applying pagerank resulting graph summary formed combining top ranking sentences using threshold length cutoff limit size summary worth noting textrank applied summarization exactly described lexrank used part larger summarization system mead combines lexrank score stationary probability features like sentence position length using linear combination either user-specified automatically tuned weights case training documents might needed though textrank results show additional features absolutely necessary another important distinction textrank used single document summarization lexrank applied multi-document summarization task remains cases—only number sentences choose grown however summarizing multiple documents greater risk selecting duplicate highly redundant sentences place summary imagine cluster news articles particular event want produce one summary article likely many similar sentences would want include distinct ideas summary address issue lexrank applies heuristic post-processing step builds summary adding sentences rank order discards sentences similar ones already placed summary method used called cross-sentence information subsumption csis methods work based idea sentences recommend similar sentences reader thus one sentence similar many others likely sentence great importance importance sentence also stems importance sentences recommending thus get ranked highly placed summary sentence must similar many sentences turn also similar many sentences makes intuitive sense allows algorithms applied arbitrary new text methods domain-independent easily portable one could imagine features indicating important sentences news domain might vary considerably biomedical domain however unsupervised recommendation -based approach applies domain multi-document summarization automatic procedure aimed extraction information multiple texts written topic resulting summary report allows individual users professional information consumers quickly familiarize information contained large cluster documents way multi-document summarization systems complementing news aggregators performing next step road coping information overload multi-document summarization may also done response question multi-document summarization creates information reports concise comprehensive different opinions put together outlined every topic described multiple perspectives within single document goal brief summary simplify information search cut time pointing relevant source documents comprehensive multi-document summary contain required information hence limiting need accessing original files cases refinement required automatic summaries present information extracted multiple sources algorithmically without editorial touch subjective human intervention thus making completely unbiased multi-document extractive summarization faces problem potential redundancy ideally would like extract sentences central i.e. contain main ideas diverse i.e. differ one another lexrank deals diversity heuristic final stage using csis systems used similar methods maximal marginal relevance mmr trying eliminate redundancy information retrieval results general purpose graph-based ranking algorithm like page/lex/textrank handles centrality diversity unified mathematical framework based absorbing markov chain random walks absorbing random walk like standard random walk except states absorbing states act black holes cause walk end abruptly state algorithm called grasshopper addition explicitly promoting diversity ranking process grasshopper incorporates prior ranking based sentence position case summarization state art results multi-document summarization however obtained using mixtures submodular functions methods achieved state art results document summarization corpora duc 04 07 similar results also achieved use determinantal point processes special case submodular functions duc-04 new method multi-lingual multi-document summarization avoids redundancy works simplifying generating ideograms represent meaning sentence document evaluates similarity qualitatively comparing shape position said ideograms recently developed tool use word frequency need training preprocessing kind works generating ideograms represent meaning sentence summarizes using two user-supplied parameters equivalence two sentences considered equivalent relevance long desired summary simplish simplifying summarizing tool performs automatic multi-lingual multi-document summarization idea submodular set function recently emerged powerful modeling tool various summarization problems submodular functions naturally model notions coverage information representation diversity moreover several important combinatorial optimization problems occur special instances submodular optimization example set cover problem special case submodular optimization since set cover function submodular set cover function attempts find subset objects cover given set concepts example document summarization one would like summary cover important relevant concepts document instance set cover similarly facility location problem special case submodular functions facility location function also naturally models coverage diversity another example submodular optimization problem using determinantal point process model diversity similarly maximum-marginal-relevance procedure also seen instance submodular optimization important models encouraging coverage diversity information submodular moreover submodular functions efficiently combined together resulting function still submodular hence one could combine one submodular function models diversity another one models coverage use human supervision learn right model submodular function problem submodular functions fitting problems summarization also admit efficient algorithms optimization example simple greedy algorithm admits constant factor guarantee moreover greedy algorithm extremely simple implement scale large datasets important summarization problems submodular functions achieved state-of-the-art almost summarization problems example work lin bilmes 2012 shows submodular functions achieve best results date duc-04 duc-05 duc-06 duc-07 systems document summarization similarly work lin bilmes 2011 shows many existing systems automatic summarization instances submodular functions breakthrough result establishing submodular functions right models summarization problems submodular functions also used summarization tasks tschiatschek et al. 2014 show mixtures submodular functions achieve state-of-the-art results image collection summarization similarly bairi et al. 2015 show utility submodular functions summarizing multi-document topic hierarchies submodular functions also successfully used summarizing machine learning datasets specific applications automatic summarization include common way evaluate informativeness automatic summaries compare human-made model summaries evaluation techniques fall intrinsic extrinsic inter-textual intra-textual intrinsic evaluation tests summarization system extrinsic evaluation tests summarization based affects completion task intrinsic evaluations assessed mainly coherence informativeness summaries extrinsic evaluations hand tested impact summarization tasks like relevance assessment reading comprehension etc intra-textual methods assess output specific summarization system inter-textual ones focus contrastive analysis outputs several summarization systems human judgement often wide variance considered good summary means making evaluation process automatic particularly difficult manual evaluation used time labor-intensive requires humans read summaries also source documents issues concerning coherence coverage one metrics used nist annual document understanding conferences research groups submit systems summarization translation tasks rouge metric recall-oriented understudy gisting evaluation essentially calculates n-gram overlaps automatically generated summaries previously-written human summaries high level overlap indicate high level shared concepts two summaries note overlap metrics like unable provide feedback summary coherence anaphor resolution remains another problem yet fully solved similarly image summarization tschiatschek et al. developed visual-rouge score judges performance algorithms image summarization domain independent summarization techniques generally apply sets general features used identify information-rich text segments recent research focus drifted domain-specific summarization techniques utilize available knowledge specific domain text example automatic summarization research medical text generally attempts utilize various sources codified medical knowledge ontologies main drawback evaluation systems existing far need least one reference summary methods one able compare automatic summaries models hard expensive task much effort done order corpus texts corresponding summaries furthermore methods need human-made summaries available comparison also manual annotation performed e.g scu pyramid method case evaluation methods need input set summaries serve gold standards set automatic summaries moreover perform quantitative evaluation regard different similarity metrics
[ 3601, 1718, 1444, 4760, 8065, 715, 4037, 7981, 2648, 7539, 6103, 5304, 3292, 2215, 1751, 7372, 4337, 4349, 7578, 4089, 5429, 4450, 5528, 5612, 7138, 5885, 5008 ]
Test
3,652
1
PhpMyAdmin:phpmyadmin phpmyadmin free open source administration tool mysql mariadb portable web application written primarily php become one popular mysql administration tools especially web hosting services tobias ratschiller consultant later founder software company maguma started work php-based web front-end mysql 1998 inspired mysql-webadmin gave project phpadsnew also original author 2000 lack time time phpmyadmin already become one popular php applications mysql administration tools large community users contributors order coordinate growing number patches group three developers olivier müller marc delisle loïc chapeaux registered phpmyadmin project sourceforge took development 2001 july 2015 main website downloads left sourceforge moved content delivery network time releases began pgp-signed afterwards issue tracking moved github mailing lists migrated version 4 uses ajax extensively enhance usability software used html frames features provided program include
[ 7957, 5717, 2451, 1343, 1359, 5126, 5571, 6279, 4708, 4064, 6029, 4167, 6755, 6386, 6661, 5956, 4363, 5780, 6056, 3915, 1695, 2255, 2259, 7598 ]
Test
3,653
2
Nokia_phone_series:nokia phone series nokia strategic nomenclature traced back 2005 nseries line launched offering devices flagship specifications premium hardware various price points devices considered bread butter company often positioned showcase latest technologies thanks newfound consumer enterprise interest smartphones time company introduced four additional collections diversify product portfolio meet demands market segments new phone series named eseries targeting small business enterprise customers xseries providing consumer-grade multimedia-focused devices cseries nokia used target low-end mid-range market segments tseries devices exclusive chinese market nokia nseries multimedia smartphone tablet product family served company flagship portfolio aimed users looking pack many features possible one device nokia eseries stands executive consists business-oriented smartphones emphasis enhanced connectivity support corporate e-mail push services phones enterprise market list may also include upcoming devices others previously intended part series scrapped renamed due nokia number-only naming change phones included series nokia xseries stands xpress younger users phones included line feature phones smartphones include features focusing social entertainment music special dedicated keys inbuilt storage facilities succeeded nokia xpressmusic brand phones list may also include upcoming devices others previously intended part series scrapped renamed due nokia number-only naming change phones included series nokia cseries stands core nokia calls core range products offering different phones low-end high-end various markets list may also include upcoming devices others previously intended part series scrapped renamed due nokia number-only naming change phones included series nokia zseries stands zuper supposed nokia meego tablet series originally intended released 2010 early 2011 tablets cancelled unknown reasons product name revealed ovi store november 2010 list may also include upcoming devices others previously intended part series scrapped renamed due nokia number-only naming change tablets included series nokia tseries stands time china-specific line phones made cater services offered china technologies web features disabled replaced country proprietary inventions instance phones offered series would include td-scdma ev-do networks dominant marketplace line launched 13 june 2011 chinese version nokia conversations blog list may also include upcoming devices phones included series nokia aseries stands asha means hope feature-phone line introduced nokia nokia world 2011 phones series developing markets younger users messaging connectivity list may also include upcoming devices phones included series nokia lseries stands lumia means light series smartphones originally made nokia using windows phone operating system officially unveiled nokia world 2011 created exclusive partnership february year allow nokia use modify microsoft mobile operating system devices come host nokia-exclusive services microsoft purchased nokia devices services division april 2014 since lumia series manufactured exclusively microsoft subsidiary microsoft mobile initially retaining nokia branding later dropped favor microsoft first generation phones series include nokia lumia 510 nokia lumia 610 nokia lumia 710 nokia lumia 800 nokia lumia 900 run windows phone 7 subsequent generations use windows phone 8 windows phone 8.1 full list devices found microsoft lumia list lumia devices
[ 1066, 5979, 2271, 6517, 372, 1724, 7521, 3615, 1453, 4935, 3694, 3524, 3952, 472, 5909, 8072, 1544, 2922, 4407, 118, 23, 2564, 3703, 7261, 4147, 7545, 5044, 3637, 5493, 1202, 5315, 3029, 5499, 7012, 139, 6465, 5062, 3039, 1582, 4894, 50...
Test
3,654
8
Parse.ly:parse.ly parse.ly technology company provides web analytics content optimization software online publishers parse.ly built three products parse.ly reader parse.ly publisher platform latest parse.ly dash analytics tool large publishers parse.ly content optimization platform online publishers parse.ly product dash built top parse.ly platform dash parses articles publisher site analyzes identify data around metrics specific publishers topics authors sections referrers technology uses natural language processing extracted 350,000 unique topics urls crawled addition providing site analytics dash show users topics resonating people across web webwide trends interface parse.ly founded sachin kamdar andrew montalenti dreamit ventures early stage startup accelerator program philadelphia launched first product parse.ly reader september 2009 may 2009 parse.ly received 20k seed funding dreamit ventures december 2010 parse.ly received 1.8m series funding blumberg capital ff venture capital scott becker cofounder invite media hutchison jonathan axelrod jeffrey greenblatt august 2017 parse.ly received series b funding round 6.8 million round led grotech investors blumberg capital
[ 4600, 5429, 4691 ]
Test
3,655
5
RSSOwl:rssowl rssowl news aggregator rss atom news feeds written java built eclipse rich client platform uses swt widget toolkit allow fit look feel different operating systems remaining cross-platform released eclipse public license rssowl free software addition full text searches saved searches notifications filters rssowl v2.1 synchronized discontinued google reader rssowl began small project sourceforge end july 2003 first public version 0.3a rssowl 1.0 released december 19 2001 released support rss atom news feeds initial release also supported exporting feeds pdf rtf html release available windows mac linux solaris rssowl 1.1 added support toolbars quicksearch news feeds version 1.2 improved toolbar customization added support atom 1.0 news feeds versions 1.2.1 1.2.2 added universal binary support mac well drag drop tabs built feed validator rssowl sourceforge project month january 2005 rssowl 2.0 announced march 7 2007 eclipsecon 2007 version 2.0 rebuilt eclipse rich client platform used db4o database storage lucene text searching several milestone versions released final 2.0 version added labeling news feeds pop-up notification new feeds storage news articles news bins final 2.0 version released milestone 9 added support secure password credential storage news filters support embedding firefox 3.0 xulrunner render news feeds proxy support windows rssowl 2.1 released july 15 2011 google reader synchronization support new layouts rssowl longer maintained original developer however maintained fork available known rssowlnix rssowl translated many languages bengali bulgarian czech chinese simplified chinese traditional danish dutch english finnish french galician german greek hungarian italian japanese korean norwegian polish portuguese russian serbian cyrillic serbian latin slovenian spanish swedish thai turkish ukrainian
[ 1152, 2812, 5984, 3172, 7063, 7975, 1276, 2842, 393, 5571, 7015, 3043, 4352, 4357, 1502, 5699, 6582, 3915, 7692 ]
Test
3,656
1
Titan_traffic_database:titan traffic database titan traffic database database allegedly use swedish signals intelligence agency national defence radio establishment fra according news report rapport svt june 2008 based account anonymous source source alleged agency storing massive amounts information talking content leading private citizen lodging complaint police ultimately prosecutor launch full-scale investigation deemed illegal time
[ 2054 ]
Test
3,657
2
Nokia_Eseries:nokia eseries nokia eseries consists business-oriented smartphones running symbian os emphasis enhanced connectivity support corporate e-mail push services well enterprise-styled products many featuring qwerty keyboards devices advanced office features s60 platform phones equipped wireless lan also provide voip client sip protocol throughout series lifetime main competitors blackberry products research motion eseries marketed 2011 october 12 2005 mobile phone manufacturer nokia announced company refers eseries consisting three mobile phones nokia e60 nokia e61 nokia e70 may 18 2006 nokia announced addition e50 series refers business device rather smartphone february 12 2007 nokia announced addition three new devices series e61i e65 e90 april 11 2008 nokia australia advised e61i discontinued may 2008 replaced featured smaller e71 later releases included e72 e52 e5 last eseries device nokia e6 2011
[ 1066, 5979, 2271, 3082, 6517, 372, 1724, 7521, 3615, 1453, 4935, 3694, 3524, 3952, 472, 5909, 7170, 1544, 8072, 2922, 4407, 118, 23, 2564, 3703, 7261, 7545, 5044, 5493, 740, 1202, 5315, 3029, 5499, 7012, 139, 6465, 5062, 3039, 3653, 489...
Test
3,658
1
Corpus_manager:corpus manager corpus manager corpus browser corpus query system tool multilingual corpus analysis allows effective searching corpora corpus manager usually represents complex tool allows one perform searches language forms sequences may provide information context allow user search positional attributes lemma tag etc called concordances features include ability search collocations frequency statistics well metadata information processed text narrower meaning corpus manager refers server side corpus query engine whereas client side simply called user interface corpus manager software installed personal computer might provided web service
[ 5885, 3660 ]
Train
3,659
9
Higher-order_abstract_syntax:higher-order abstract syntax computer science higher-order abstract syntax abbreviated hoas technique representation abstract syntax trees languages variable binders abstract syntax tree abstract mathematical object certain structure nature instance first-order abstract syntax foas trees commonly used compilers tree structure implies subexpression relation meaning parentheses required disambiguate programs concrete syntax hoas exposes additional structure relationship variables binding sites foas representations variable typically represented identifier relation binding site use indicated using identifier hoas name variable use variable refers directly binding site number reasons technique useful first makes binding structure program explicit need explain operator precedence foas representation need rules binding scope hand interpret hoas representation second programs alpha-equivalent differing names bound variables identical representations hoas make equivalence checking efficient one mathematical object could used implement hoas graph variables associated binding sites via edges another popular way implement hoas example compilers de bruijn indices domain logical frameworks term higher-order abstract syntax usually used refer specific representation uses binders meta-language encode binding structure object language instance logical framework lf λ-construct arrow → type first-order encoding object language construct codice_1 would using twelf syntax codice_2 family object language expressions family codice_3 representation variables implemented perhaps natural numbers shown constant codice_4 witnesses fact variables expressions constant codice_1 expression takes three arguments expression bound variable bound another expression variable bound within canonical hoas representation object language would representation object level variables appear explicitly constant codice_1 takes expression bound meta-level function codice_2 → codice_2 body let function higher-order part expression free variable represented expression holes filled meta-level function applied concrete example would construct object level expression assuming natural constructors numbers addition using hoas signature codice_9 twelf syntax function formula_1 specific representation advantages beyond ones one reusing meta-level notion binding encoding enjoys properties type-preserving substitution without need define/prove way using hoas drastically reduce amount boilerplate code binding encoding higher-order abstract syntax generally applicable object language variables understood variables mathematical sense stand-ins arbitrary members domain often always case instance advantages gained hoas encoding dynamic scope appears dialects lisp dynamically scoped variables act like mathematical variables
[ 1361, 4728, 2514, 7333, 4240, 6980, 3300 ]
Train
3,660
1
Sketch_Engine:sketch engine sketch engine corpus manager text analysis software developed lexical computing limited since 2003 purpose enable people studying language behaviour lexicographers researchers corpus linguistics translators language learners search large text collections according complex linguistically motivated queries sketch engine gained name one key features word sketches one-page automatic corpus-derived summaries word grammatical collocational behaviour currently supports provides corpora 90+ languages sketch engine product lexical computing limited company founded 2003 lexicographer research scientist adam kilgarriff started collaboration pavel rychlý computer scientist working natural language processing centre masaryk university developer manatee bonito two major parts software suite introduced concept word sketches since sketch engine commercial software however core features manatee bonito developed 2003 extended since freely available gpl license within nosketch engine suite sketch engine consists three main components underlying database management system called manatee web interface search front-end called bonito web interface corpus building management called corpus architect manatee database management system specifically devised effective indexing large text corpora based idea inverted indexing keeping index positions given word text used index text corpora comprising tens billions words searching corpora indexed manatee performed formulating queries corpus query language cql manatee written c++ offers api number programming languages including python java perl ruby recently rewritten go faster processing corpus queries bonito web interface manatee providing access corpus search client–server model manatee server bonito plays client part written python corpus architect web interface providing corpus building management features also written python sketch engine used major british publishing houses producing dictionaries macmillan english dictionary dictionnaires le robert oxford university press shogakukan four uk ’ five biggest dictionary publishers use sketch engine
[ 2451, 5983, 2629, 715, 993, 6428, 3959, 1554, 5571, 578, 3658, 4985, 5965, 80, 3158 ]
Test
3,661
4
Vera_Security:vera security vera data-centric security platform enables organizations effectively protect kind data policies rules governing access usage data regardless data resides travels vera enables global tracking auditing management data comprehensive security service saas platform vera also provides developers access downloadable software development kit sdk vera launched product april 2015 within first year operations announced partnerships dropbox okta centrify well strategic integrations box vmware microsoft office vera focuses sales marketing efforts large enterprises industries financial services manufacturing media entertainment technology sectors carlos delatorre serves chief executive officer since 2018 joining vera carlos led global sales organization mongodb world ’ fastest-growing database ecosystem first enterprise database company successfully ipo 26 years also served vice president sales clearslide inc. drove enterprise sales strategy business growth prior clearslide carlos served vice president sales dynamicops acquired vmware also held senior sales leadership roles bmc software bladelogic imlogic oblix company headquartered silicon valley secured venture financing notable investors including battery ventures sutter hill ventures capital one growth ventures vera nominated top 10 finalist innovation sandbox competition rsa conference 2016 crn magazine named vera “ 10 coolest security startups 2015 ” since vera additional awards vera privately funded company 31 million venture financing company announced 14 million series round november 2014 included hiring robin daniels cmo february 2016 vera announced 17 million series b round led sutter hill ventures participation existing investors battery ventures amplify partners private investors may 2016 capital one growth ventures joined company series b round financing founding ceo veritas software mark leslie joined vera board directors roger lee battery ventures stefan dyckerhoff sutter hill ventures also serve company board content storage agnostic platform vera capable securing type digital content anywhere ’ stored vera require end-users download proprietary agents plug-ins access secure data offers native integrations common file sharing enterprise platforms like box dropbox okta microsoft office 365 vera incorporates three primary components platform architecture secure cloud platform set end-user clients web-based administration dashboard vera dashboard gives end-users administrators full visibility control activity around content matter stored transmitted vera dashboard admin manage access controls set update policies oversee users activity run audit reports usage vera software development kit march 2016 vera announced sdk allows developers add encryption tracking policy enforcement access control custom legacy business applications vera sdk enables users programmatically execute following tasks device secure files unsecure files give access file specific users groups domains revoke access file specific users groups domains revoke access file users
[ 4295, 2566, 5511 ]
Test
3,662
0
Native-language_identification:native-language identification native-language identification nli task determining author native language l1 based writings second language l2 nli works identifying language-usage patterns common specific l1 groups applying knowledge predict native language previously unseen texts motivated part applications second-language acquisition language teaching forensic linguistics amongst others nli works assumption author l1 dispose towards particular language production patterns l2 influenced native language relates cross-linguistic influence cli key topic field second-language acquisition sla analyzes transfer effects l1 later learned languages using large-scale english data nli methods achieve 80 accuracy predicting native language texts written authors 11 different l1 backgrounds compared baseline 9 choosing randomly identification l1-specific features used study language transfer effects second-language acquisition useful developing pedagogical material teaching methods l1-specific instructions generating learner feedback tailored native language nli methods also applied forensic linguistics method performing authorship profiling order infer attributes author including linguistic background particularly useful situations text e.g anonymous letter key piece evidence investigation clues native language writer help investigators identifying source already attracted interest funding intelligence agencies natural language processing methods used extract identify language usage patterns common speakers l1-group done using language learner data usually learner corpus next machine learning applied train classifiers like support vector machines predicting l1 unseen texts range ensemble based systems also applied task shown improve performance single classifier systems various linguistic feature types applied task include syntactic features constituent parses grammatical dependencies part-of-speech tags surface level lexical features character word lemma n-grams also found quite useful task however seems character n-grams single best feature task building educational applications bea workshop naacl 2013 hosted inaugural nli shared task competition resulted 29 entries teams across globe 24 also published paper describing systems approaches
[ 5429, 715 ]
Test
3,663
9
JavaScript_OSA:javascript osa javascript osa originally javascript osa abbreviated jsosa freeware inter-process communication scripting language macintosh computer javascript osa uses core language mozilla implementation javascript programming language see spidermonkey language used alternative applescript language use unrelated web browser-based scripting seen similar function microsoft jscript .net language windows machines although interoperability two languages system-level scripting language identical mozilla core language extensions added via core object macos object macos object methods obtaining objects bound applications done via appleevent messaging system part macintosh open scripting architecture language first released 2001 bundled late night software flagship product script debugger may 2005 new alpha version language made available testing improved second version language bundled version 4 script debugger javascript osa eventually discontinued due lack interest dropped script debugger 5 2012 os x yosemite introduced javascript automation jxa system-wide support scripting javascript built upon javascriptcore open scripting architecture features objective-c bridge enables entire cocoa applications programmed javascript
[ 183, 2451, 4755, 6172, 3092, 5998, 2658, 7734, 313, 3719, 6368, 237, 54, 3398, 2870, 6660, 422, 340, 5172, 6400, 5786, 7687, 4287 ]
Validation
3,664
2
FlexOS:flexos flexos discontinued modular real-time multiuser multitasking operating system rtos designed computer-integrated manufacturing laboratory retail financial markets developed digital research flexible automation business unit monterey california since november 1986 marketed since january 1987 reengineered continuation digital research concurrent dos 286 multiuser multitasking operating system flexos designed frank holsworth like portable cp/m concurrent dos 286 concurrent dos 68k concurrent dos v60 flexos written c higher portability across hardware platforms featured low interrupt latency fast context switching supported popular ssl/tls libraries wolfssl original protected mode flexos 286 version 1.3 designed host machines equipped 286 cpus adaptations nec v60 nec v70 motorola 68000 processors planned flexos 286 executables using system native int dch int 220 application program interface filename extension .286 cp/m api front-end fe available well using extension .cmd executables filename extension .68k reserved flexos 68k file extension derived concurrent dos 68k 1986 may 1987 flexos version 1.31 released 80286 machines developer version required ibm pc/at-compatible machine 640 kb conventional 512 kb extended memory either monochrome cga ega graphics adapter flexos supported concept dynamically loadable unloadable subdrivers came driver prototypes floppies hard disks printers serial interfaces ram disks mice console drivers boot flex286.sys kernel would load resource managers device drivers specified config.sys binary file mixed similarly named config.sys configuration file dos shell command.286 would execute config.bat startup batch job instead common autoexec.bat flexos optional dos emulator provided limited pc dos 2.1 compatibility dos .com .exe programs certain restrictions applied since programs executed processor protected mode due bugs earlier steppings intel 80286 flexos 286 dos front-end required least 80286 e2 stepping function properly see loadall problems already caused delays delivery concurrent dos 286 earlier system optionally supported multitasking gem vdi graphical applications flexos 1.31 could linked none either two modules flexos 1.31 also supported flexnet june 1987 also versions 1.0 flexos 386 hosts flexos 186 remote cell controllers flexos 386 provided windowing feature offered pc dos 3.2 gem compatibility flexos 286 flexos 386 versions 2.0 registered 3 july 1989 among major flexos customers 1990/1991 fanuc ibm icl nixdorf siemens tec thorn emi software micrologic novell bought digital research july 1991 x/gem flexos release 1.0 a.k.a x/gem flexos 286 386 flexnet registered 21 december 1992 flexos used primary test platform new novell embedded systems technology nest novell decided abandon development various digital research operating systems multiuser dos successor concurrent dos novell dos successor dr dos sold flexos santa clara california-based integrated systems inc. isi july 1994 deal comprised direct payment half sum well shares representing 2 company company already psos+ another modular real-time multitasking operating system embedded systems continued maintain flexos well flexos version 2.33 current may 1998 flexos 2.34 released soon added support faster cpus 64 mb memory eide atapi cdrom drives integrated systems bought competitor wind river systems february 2000 owned intel since 2009 following list commands supported flexos known flexos versions include motorola 68000 freescale/nxp coldfire mcf5251 platform intel 80286 platform intel 80186/nec v20/v30 platform intel 80386 platform nec v60 platform named ibm 4680 os version 1 ibm originally chose dr concurrent dos 286 basis ibm 4680 computer ibm plant system products point-of-sale terminals 1986 last release ibm 4680 os version 4 replaced ibm 4690 version 1 versions july 1993 ibm announced adoption flexos version 2.32 basis ibm 4690 os version 1 pre-released 24 september 1993 generally made available 25 march 1994 flexos 2.32 supported 286 386 modes efficient memory management better console pipe systems brought overall quality performance improvements compared version came ibm 4680 os version 4 removed limits number applications running concurrently due efficient use kospool order support java ibm 4690 os version 2 brought support long filenames means virtual filesystem vfs architecture introduced fat32 volumes according year store ihl consulting group/ris news ibm 4690 os still market share 12 pos register/client market june 2005 ibm starting phase favour ibm retail environment suse ires ibm continue maintain 4690 os april 2015 recent version released ibm may 2012 ibm 4690 os version 6 release 3 meanwhile toshiba released toshiba 4690 os version 6 release 4 january 2014 siemens used still maintains flexos factory automation equipment well example s5 step-5 operating system s5-dos/mt based flexos 386 x/gem flexnet btrieve whereas smaller s5-dos system also present systems variant digital research personal cp/m-86 siemens industrial systems like coros ls-b/flexos coros os-b/flexos gracis/flexos os-525 flexos x/gem-based computers pc 16-20 pc 32 series available flexos well japanese post office shared terminals iii ctm iv based flexos
[ 4291, 6088, 7172, 402, 4336, 1495, 3664, 5079, 771, 6849, 5784, 1894, 6496, 7950, 4745, 1516, 1522, 7605, 2280, 5110, 126, 4421, 5138, 839, 4428, 6918, 5865, 858, 861, 3748, 7312, 3751, 8043, 1994, 4843, 1624, 2010, 8077, 8087, 6994, 66...
Validation
3,665
4
Administrative_share:administrative share administrative shares hidden network shares created windows nt family operating systems allow system administrators remote access every disk volume network-connected system shares may permanently deleted may disabled administrative shares accessed users without administrative privileges administrative shares collection automatically shared resources including following administrative shares following characteristics administrative shares created windows xp home edition administrative shares deleted network share recreated automatically next reboot however possible disable administrative shares disabling administrative shares without caveats previous versions local files feature windows vista windows 7 requires administrative shares operate windows xp implements simple file sharing also known forceguest feature enabled computers part windows domain enabled authenticates incoming access requests network shares guest user account limited access rights windows effectively disables access administrative shares default windows vista later use user account control uac enforce security one uac features denies administrative rights user accesses network shares local computer network unless accessing user registered windows domain using built administrator account windows domain possible allow administrative share access accounts administrative permissions adding localaccounttokenfilterpolicy value registry
[ 6575, 3932, 5571, 6256 ]
Validation
3,666
2
SystemTap:systemtap computing systemtap codice_1 scripting language tool dynamically instrumenting running production linux kernel-based operating systems system administrators use systemtap extract filter summarize data order enable diagnosis complex performance functional problems systemtap consists free open-source software includes contributions red hat ibm intel hitachi oracle community members systemtap debuted 2005 red hat enterprise linux 4 update 2 technology preview four years development systemtap 1.0 released 2009 tracepoints cpython vm jvm added systemtap 1.2 systemtap files written systemtap language saved codice_2 files run codice_1 command-line system carries number analysis passes script allowing run scripts may executed one three backends selected codice_4 option default loadable kernel module fullest capability inspect manipulate part system therefore requires privilege another backend based dynamic program analysis library dyninst instrument user user-space programs requires least privilege newest backend based ebpf byte-code limited linux kernel interpreter capabilities requires intermediate level privilege case module unloaded script finished running scripts generally focus events starting finishing script compiled-in probe points linux tracepoints execution functions statements kernel user-space guru mode scripts may also embedded c may run codice_5 command-line option however use guru mode discouraged systemtap release includes probe points designed remove need guru-mode scripts guru mode required order permit scripts modify state instrumented software apply types emergency security fixes systemtap release 1.7 software implements new stapsys group privilege level following script shows applications setting tcp socket options system options set whether option set successfully many examples shipped systemtap also real-world examples systemtap use war stories page systemtap attach dtrace markers compiled application using macros codice_6 header file
[ 3256, 2182, 3613, 7528, 7532, 5744, 6443, 2942, 6117, 4341, 5762, 412, 415, 2970, 7956, 5453, 5460, 7242, 1535, 1924, 6892, 1176, 1933, 5829, 7637, 1208, 6211, 1579, 4435, 5865, 7669, 3404, 1227, 1596, 165, 6586, 7312, 8037, 1607, 5884, ...
Test
3,667
7
ProActive:proactive proactive parallel suite open-source software enterprise workload orchestration part ow2 community workflow model allows define set executables scripts written scripting language along dependencies proactive parallel suite schedule orchestrate executions optimising use computational resources hood proactive parallel suite relies active object -based java framework optimise task distribution ensure fault-tolerance model created denis caromel professor university nice sophia antipolis several extensions model made later members oasis team inria book theory distributed objects presents asp calculus formalizes proactive features provides formal semantics calculus together properties proactive program execution active objects basic units activity distribution used building concurrent applications using proactive active object runs thread thread executes methods invoked active object active objects passive objects subsystem belongs active object proactive programmer explicitly manipulate thread objects unlike standard java active objects created hosts involved computation active object created activity fact runs thread location local remote perfectly transparent active object manipulated passive instance class active object composed two objects body standard java object body visible outside active object body responsible receiving calls requests active object storing queue pending calls executes calls order specified synchronization policy synchronization policy specified calls managed first first fifo manner thread active object chooses method queue pending requests executes parallelism provided inside active object important decision proactive design enabling use pre-post conditions class invariants side subsystem sends call active object active object represented proxy proxy generates future objects representing future values transforms calls request objects terms metaobject reification performs deep copies passive objects passed parameters proactive library designed developing applications model introduced eiffel// parallel extension eiffel programming language model application structured subsystems one active object therefore one thread subsystem one subsystem active object thread subsystem thus composed one active object number passive objects—possibly passive objects thread one subsystem executes methods objects subsystem shared passive objects subsystems features impact application topology objects make subsystem—the active object passive objects—only active object known objects outside subsystem objects active passive may references onto active objects object o1 reference onto passive object o2 o1 o2 part subsystem also consequences semantics message-passing subsystems object subsystem calls method active object parameters call may references passive objects subsystem would lead shared passive objects passive objects passed parameters calls active objects always passed deep-copy active objects hand always passed reference symmetrically also applies objects returned methods called active objects thanks concepts asynchronous calls futures data sharing application written proactive n't need structural change—actually hardly change all—whether runs sequential multi-threaded distributed environment whenever possible method call active object reified asynchronous request possible call synchronous blocks reply received request asynchronous immediately returns future object future object acts placeholder result not-yet-performed method invocation consequence calling thread go executing code long n't need invoke methods returned object need arises calling thread automatically blocked result method invocation yet available although future object structure similar active object future object active stub proxy code excerpt highlights notion future objects suppose user calls method foo method bar active object foo method returns void bar method returns object class v foo called active object returns immediately current thread execute methods subsystem similarly bar called returns immediately result v ca n't computed yet future object placeholder result method invocation returned point view caller subsystem difference future object object would returned call issued onto passive object methods returned calling thread continues executing code call effectively performed role future mechanism block caller thread gee method called v result yet set inter-object synchronization policy known wait-by-necessity
[ 4928, 553, 5371, 8174, 5559, 4049, 4318, 3458, 5571, 5042, 4154, 1481, 5939, 4159, 1023, 1295, 5947, 3041, 240, 1586, 515, 8024, 2961, 3578, 4993, 3915, 2441, 5447, 357, 2266, 5890 ]
Test
3,668
7
Wave_(financial_services_and_software):wave financial services software wave company provides suite financial services online software small businesses wave headquartered leslieville neighbourhood toronto canada company manages 244 billion income expense transactions customers including 16 billion annual invoicing company first product free online accounting software designed businesses 1-9 employees followed invoicing personal finance receipt-scanning software ocr 2012 wave began branching financial services initially payments wave credit card processing payroll wave followed lending wave february 2017 2010 wave launched first free double-entry accounting platform cloud included unlimited bank data downloads company initial product accounting wave double entry accounting tool services include direct bank data imports invoicing expense tracking customizable chart accounts journal transactions accounting wave integrates expense tracking software shoeboxed e-commerce website etsy next product launched payroll wave launched 2012 acquisition smallpayroll.ca payroll wave available u.s.a. canada invoicing wave offshoot company earlier accounting tools additional products launched shortly company rebrand december 2012 include wave also produces free mobile applications integrate online functionality 2017 wave signed agreement provide platform rbc online business banking site rbc-wave service co-branded wave currently supports adding custom taxes via settings however must manually apply tax every transaction come way automate currently supports tax exclusive pricing us sales tax taxes added top prices quoted two effects makes unable handle taxes countries like australia prices must quoted inclusive taxes gst way set invoice total wave calculate tax portion fine b2b businesses makes software unsuitable b2c businesses wave provides software free 3 million customers 200 countries worldwide revenue company comes paid financial services company offers wave previously included advertising pages source revenue advertising removed january 2017 wave software free opposed freemium tools used without tiers limits indefinitely wave currently disclose revenue financial statements publicly however media reports 2016 indicated annual revenues 20 million time 2017 wave raised 24m usd funding led nab ventures ceo kirk simpson cpo james lochrie launched wave accounting inc. july 2009 wave accounting launched public november 16 2010 june 2011 series funding led omers ventures closed september 2011 feddev ontario invested one million dollars funding october 2011 5-million investment led u.s. venture capital firm charles river ventures announced may 2012 wave accounting closed series b financing round led social+capital partnership follow-on participation charles river ventures omers ventures wave acquired company called small payroll november 2011 later launched payroll product called wave payroll february 2012 wave officially launched wave payroll public canada followed american release november year august 2012 company announced acquisition vuru.co online stock-tracking service terms deal disclosed december 2012 company rebranded wave emphasize broadened spectrum services june 11 2019 company announced acquired tax preparation company h r block 537 million
[ 3668, 7766, 5258, 7332, 696, 1165 ]
Validation
3,669
6
Single-source_publishing:single-source publishing single-source publishing also known single-sourcing publishing content management method allows source content used across different forms media one time labor-intensive expensive work editing need carried one document source document stored one place reused reduces potential error corrections made one time source document benefits single-source publishing primarily relate editor rather user user benefits consistency single-sourcing brings terminology information assumes content manager applied organized conceptualization underlying content poor conceptualization make single-source publishing less useful single-source publishing sometimes used synonymously multi-channel publishing though whether two terms synonymous matter discussion general definition single-source publishing single official delineation single-source publishing multi-channel publishing official governing bodies provide delineation single-source publishing often understood creation one source document authoring tool converting document different file formats human languages multiple times minimal effort multi-channel publishing either seen synonymous single-source publishing similar one source document process results mere reproduction source origins single-source publishing lie indirectly release windows 3.0 1990 eclipsing ms-dos graphical user interfaces help files went unreadable text along bottom screen hypertext systems winhelp on-screen help interfaces allowed software companies cease printing large expensive help manuals products reducing costs producer consumer system raised opportunities well many developers fundamentally changed way thought publishing writers software documentation simply move writers traditional bound books writers electronic publishing rather became authors central documents could reused multiple times across multiple formats first single-source publishing project started 1993 cornelia hofmann schneider electric seligenstadt using software based interleaf automatically create paper documentation multiple languages based single original source file xml developed mid- late-1990s also significant development single-source publishing method xml markup language allows developers separate documentation two layers shell-like layer based presentation core-like layer based actual written content method allows developers write content one time switching multiple different formats delivery methods mid-1990s several firms began creating using single-source content technical documentation boeing helicopter sikorsky aviation pratt whitney canada user manuals ford owners manuals based tagged sgml xml content generated using arbortext epic editor add-on functions developed contractor concept behind usage complex hierarchical content lend discrete componentization could used across variety requirements tagging differences within single document using capabilities built sgml xml ford example able tag single owner manual files 12 model years could generated via resolution script running single completed file pratt whitney likewise able tag 20 subsets jet engine manuals single-source files calling desired version publication time world book encyclopedia also used concept tag articles american british versions english starting early 2000s single-source publishing used increasing frequency field technical translation still regarded efficient method publishing material different languages printed manual translated example online help software program manual accompanies could automatically generated using method metadata could created entire manual individual pages files could translated metadata one step removing need recreate information even database structures although single-source publishing decades old importance increased urgently 2010s consumption information products rises number target audiences expands work developers content creators within industry software documentation perception choice embrace single-source publishing render one operations obsolete editors using single-source publishing criticized below-standard work quality leading critics describe single-source publishing conveyor belt assembly content creation heavily used technical translation risks error regard indexing two words might synonyms english may synonyms another language document produced via single-sourcing index translated automatically two words rendered synonyms synonyms source language target language
[ 6380 ]
Test
3,670
9
Tom_(pattern_matching_language):tom pattern matching language tom programming language particularly well-suited programming various transformations tree structures xml based documents tom language extension adds new matching primitives c java well support rewrite rules systems rules controlled using strategy language tom good
[ 1662, 6489, 1435 ]
Validation
3,671
4
Verax_(film):verax film verax five-minute 2013 short film edward snowden leaking event hong kong produced amateur filmmakers hong kong posted youtube june 2013 name film originates snowden codename means truth teller latin produced group j.shot videos according producers first film ever produced snowden film four parts first depicts central intelligence agency employees discussing snowden case second involves newspaper journalist corresponding snowden third involves hong kong police officers chinese ministry state security employees discussing trying find edward snowden fourth involves characters waiting snowden appear snowden reveals media end film includes extracts snowden interview guardian final captions state snowden departed hong kong 23 june film features mira hong kong hotel snowden stayed rubik cube item according agence france-presse snowden reportedly used identify guardian journalist featured film marcus tsui one project filmmakers described film snapshot time andreas wiseman screen daily wrote plot uses large degree creative licence film created expatriates australia canada ireland united states producers film jeff floro edwin lee shawn tse marcus tsui lee irish citizen sole professional filmmaker involved served editor cinematographer lee served journalist multimedia television sectors worked south china morning post atv home 11 july 2013 two days snowden revealed identity edwin lee contacted friends possibility making film lee tsui created film script one day shooting actors time rehearse lines according producers film intended homage hong kong lee said intrigued snowden came hong kong us love hong kong death call hong kong home filmmakers group youtube page stated nearly every media outlet wanted get hands decided produce short fiction video depict experience hk would affected certain parties namely cia contingent based hk would tasked find snowden hong kong police would stuck u.s. china journalists want get scoop lee said film created catch onto interest snowden attention hong kong according tse 28-year-old native toronto ontario graduate york university film studies programme worked teacher hong kong tried give hong kong limelight think deserves tse said group initially considered outright comedy spoof thriller style jason bourne ultimately opted depiction events may unfolded lee said bourne film series works director michael mann inspired regards snowden presence filmmakers stated snowden central character prominent maelstrom events surrounding knew little snowden give prominent role story lee said film focuses vignettes snowden snowden serves catalyst events affect characters snowden live dialogue film lee said half film focus hong kong half snowden four filmmakers stated political motives shawn tse said knew right get-go film going neutral possible way try infringe upon basically thought snowden trying really idea lee described film snapshot time said snowden popped hong kong got much attention really got people talking wanted give alternative view situation beyond media chase knew cassandra chan served associate producer said us government abused internet response use power internet hopefully good reasons dean napolitano wall street journal wrote film makes subtle observations hong kong sometimes tense relationship mainland china one country two systems policy – underscored scene security official china central government barks orders hong kong police officers aforementioned scene official mainland speaks mandarin hong kong officials speak cantonese according napolitano film implies chinese authorities real power hong kong lee stated scene vehicle represent hong kong relationship china paraphrased alexis lai cnn murkiness beijing role snowden affair regards scene lee said say china n't pulling strings would naïve ... even though gives us autonomy always beijing calls shots officially officials mainland government said influence decisions hong kong authorities 1 july 2013 edwin lee said snowden left hong kong plans write sequel 29 july 2013 filmmakers plans show film film festivals considered making sequel film shot three four days time shooting snowden hiding within hong kong end film production snowden fled russia edwin lee said quickened editing process film could released sooner shorten project agence france-presse stated film stayed true actual locations hong kong snowden reportedly seen scenes shot mira hotel several office interiors used scenes lingerie company let filmmakers use offices edwin lee one filmmakers said filming style lot adrenaline ... guerilla filmmaking style also stated foot-on-the-gas filmmaking lee described filming style docu-drama recreation napolitano said ways resembles modern hong kong crime drama technical dialogue sterile conference rooms time-lapse photography sweeping aerial shots city famous skyline jonathan dehart diplomat stated usage time-lapse-style footage grey clouds hong kong panoramas shaky cam style features spy genre films film used original photography exception two stock photography shots purchased pond5 28 june 2013 filmmakers yet determined total cost film estimate budget 5,000 hong kong dollars 641 us dollars afp said budget shoestring patrick frater variety stated 1 june 2013 total cost 4,200 hkd 550 us adam withnall belfast telegraph said budget 645 u.s. dollars £420 british pounds one-night stay mira expensive single item budget made one third budget filmmakers stated make film gain return investment jeff floro works finance day job said lost money film dean napolitano wall street journal wrote film quite saturday night live -style spoof neither slick thriller given cast non-actors micro budget rebecca keegan los angeles times stated verax feels quite polished insta-film due presence electronic music soundtrack likens soundtrack social network sweeping views hong kong skyscrapers shots within mira hotel keegan added actors leaden delivery sometimes gives neophyte status away voice russia stated shaky camera work usage local actors reminiscent bourne spy thriller series patrick frater variety said film strong production values driving music somewhat amateurish acting performances alexis lai cnn said film surprisingly suspenseful sophisticated gorgeous time-lapse panoramas city shaky cam shots reminiscent hollywood cast film consisted friends four filmmakers dean napolitano wall street journal said cast varying degrees thespian abilities andrew cromeek 25-year-old american chester new york english teacher took role snowden previously acted one commercial one student film filmmakers reviewed friends believed remotely appeared similar snowden shawn tse said looked caucasian white friends see could play snowden cromeek worked company tse worked teacher tse believed cromeek going perfect snowden cromeek believed zero resemblance snowden according tse let cromeek grow beard several days taking hong kong barbershop cromeek gave hairstylist photograph snowden received haircut 50 hong kong dollars us 6.41 according tse hong kong hairstylist warned cromeek careful mistaken snowden cromeek lightened haircolor using gold spray paint put eyeglasses trimmed beard day shooting moles placed neck makeup film team also used special wardrobe make cromeek appear like snowden cromeek reported parents family members friends gave telephone calls film made public cast list film released youtube tuesday 25 june 2013 several publications contacted filming group interviews wall street journal first agence france-presse afp los angeles times afterwards interviews increased interest film 28 june got 5,000 views 30 june gained 8,500 views 2 july got 89,000 views 16 july received 220,000 hits 30 july received almost 250,000 views luke buckmaster online australian political news magazine crikey stated verax nowiki /nowiki greatest asset showcase narrative efficiency getting key points across using language arrangement images solicit logical necessarily emotional responses without needing put fine point jin jiabao china central television said film events vividly portrayed stephanie ip associated press wrote film initially gained popularity 29 july 2013 praise film given way criticism many viewers berating four directors amateur work bad casting adam withnall wrote belfast telegraph many criticised four directors amateur work bad casting independent wider international audience n't forgiving less-than-professional quirks cast television program new day said hope andrew cromeek rest cast better real jobs regards criticism andrew cromeek argued filmmakers expect gain large amount attention youtube filmmakers professional cromeek said think way shot quite cool amateur actors one take kind like shoot go ok done fine completely ok people like 'it worst acting world totally fine ip wrote verax source pride friends made even acknowledge limitations
[ 6092, 5509 ]
Validation
3,672
6
Joliet_(file_system):joliet file system joliet filesystem commonly used store information cd-rom computer discs defined extension iso 9660 standard joliet specified endorsed microsoft supported versions windows operating system since windows 95 windows nt 4.0 primary focus relaxation filename restrictions inherent full iso 9660 compliance joliet accomplishes supplying additional set filenames encoded ucs-2be utf-16be practice since windows 2000 filenames stored special supplementary volume descriptor safely ignored iso 9660-compliant software thus preserving backward compatibility specification allows filenames 64 unicode characters length however documentation mkisofs states filenames 103 characters length appear cause problems microsoft documented use 110 characters many current pc operating systems able read joliet-formatted media thus allowing exchange files operating systems even non-roman characters involved arabic japanese cyrillic formerly possible plain iso 9660-formatted media operating systems read joliet media include microsoft recommends use joliet extension developers targeting windows allows unicode characters used text fields includes file names volume name secondary volume descriptor type 2 contains information primary one sector 16 offset 40 bytes ucs-2be sector 17 offset 40 bytes result volume name limited 16 characters disktype program prints joliet unicode volume name present
[ 1254, 4759, 5384, 5128, 5571, 5656, 7827, 578, 3554, 3903, 3598 ]
Test
3,673
3
Ultra_80:ultra 80 sun microsystems ultra 80 computer workstation shipped november 1999 2002 enclosure fairly large high wide deep heavy tower design launch shipped solaris 2.5.1 available variety different configurations one model 1450 two model 2450 four model 4450 64-bit ultrasparc ii cpus 4 gb ram released ultra 80 sun highest performance workstation ultra 80 similar lower-cost sun ultra 60 somewhat larger supports cpus memory although designed workstation rather server may rack mounted using optional kit enterprise 420r server product based ultra 80 motherboard specialized rack-mountable chassis custom power supplies parts appropriate server applications last order date ultra 80 july 2002 last model stopped shipping october 2002 later ultra 45 introduced 2006 supports maximum two cpus rather four ultra 80 ultra 80 shipped solaris 2.5.1 capable running later versions solaris solaris 10 oracle solaris 11 dropped support ultrasparc ii iii iv processors well linux various unix operating systems ultra 80 run microsoft windows directly although internal pci card sunpci ii pro similar sun could fitted allow use windows full specifications found sun web site although sold either one two four cpus use three cpus supported configuration cpus run 450 mhz 16-kb data 16-kb instruction cache chip secondary 4-mb external cache x1195a part number one cpus cpu integrated floating point processor ultra 80 uses 144-pin 5v 60-ns dimm memory modules either 64 256 mb installed sets four identical dimms 16 dimm sockets possible fit 4 gb 16 256 mb modules memory bus 576 bits wide 512 bits used data 64 bits error correction specifications list maximum throughput 1.78-gb/s performance improved 2-way interleaving used giving 512 mb 2 gb maximum performance achieved 4-way interleaving case 16 memory slots would used providing machine 1 gb 4 gb ram half ultra 80 memory must fitted motherboard half memory riser board care needed handling memory riser board connector designed repeated use must tightened using torque wrench supplied ultra 80 detailed service manual ultra 80 takes one two 1 high sca scsi disk drives internally sold 18.2-gb 36.4-gb disks practice use sca disk internal disks must mounted carrier spud-bracket sun part number 540-3024 scsi ids internal disks 0 3 set sca backplane changed optional 1.44 mb 3.5 ms-dos/ibm compatible floppy drive fitted ultra 80 could purchased new optional 12/24 gb native/compressed dds-3 tape drive work dds-4 drive probably larger tape drives optional 644 mb suncd 32x-speed photo cd compatible cd-rom drive optional 10x dvd-rom could specified well 3rd-party rewritable cd-rom drives could also used.. ultra 80 four full-size slots compliant pci specification version 2.1 systems might inoperable pci 2.2 card installed two upa graphics slots running 112 mhz supporting one two elite3d m3 and/or elite3d m6 graphics options popular creator3d framebuffer supported usually always work ultra 80s sold pgx32 framebuffer even though low performance made appropriate use server rather workstation applications although sold ultra 80s later xvr series framebuffers also work expert3d series sun ultra 80 fitted dual channel ultra-3 scsi controller speed 40 mb/s one controller c0 used internal disk cd-rom dvd-rom tape second channel c1 used external 68-pin ultra wide scsi connector rear ultra 80 sun ultra 80 1 gb/s ethernet used optional sun x1141a ethernet card usb officially supported various usb boards pcs known work linux solaris maximum power consumption documented 380w components list specifies sony 670w 12a power supply sun part number 300-1357 ultra 80 well-built workstation use cheap mass-produced commodity pc parts like sun ultra workstations ultra 5 ultra 10 well cooled suffering none overheating problems sun previous quad-processor machine sparcstation 20 support ultra 80 ended october 2007 addition official support knowledgeable people often sun employees regular visitors comp.unix.solaris comp.sys.sun.hardware comp.sys.sun.admin usenet newsgroups sun ultra 80 workstation facts guide gives following data well known specint 95 specfp 95 benchmarks although search web site standard performance evaluation corporation spec show figures spec ceased use benchmark ultra 80 released last results submitted web site 3rd quarter 1998 little year ultra 80 released november 1999 number results less-commonly-used specfp_rate95 specfp_rate_base95 benchmarks found spec web site given
[ 1254, 1258, 1923, 908, 7535, 1185, 2299, 4418, 1107, 4967, 5587, 1023, 418, 7114, 8138, 4999, 1237, 5705, 971, 7781, 6505 ]
Test
3,674
3
PowerPC_600:powerpc 600 powerpc 600 family first family powerpc processors built designed somerset facility austin texas jointly funded staffed engineers ibm motorola part aim alliance somerset opened 1992 goal make first powerpc processor keep designing general purpose powerpc processors personal computers first incarnation became powerpc 601 1993 second generation soon followed powerpc 603 powerpc 604 64-bit powerpc 620 powerpc 601 first generation microprocessors support basic 32-bit powerpc instruction set design effort started earnest mid-1991 first prototype chips available october 1992 first 601 processors introduced ibm rs/6000 workstation october 1993 alongside powerful multichip cousin ibm power2 line processors first apple power macintoshes march 14 1994 601 first advanced single-chip implementation power/powerpc architecture designed crash schedule establish powerpc marketplace cement aim alliance order achieve extremely aggressive schedule including substantially new function substantial performance enhancements new instructions importantly power/powerpc first symmetric multiprocessing smp implementation design leveraged number key technologies project management strategies 601 team leveraged much basic structure portions ibm risc single chip rsc processor also included support vast majority new powerpc instructions power instruction set nearly every portion rsc design modified many design blocks substantially modified completely redesigned given completely different unified i/o bus structure smp/memory coherency support new powerpc changes leveraging basic rsc structure beneficial reducing uncertainty chip area/floorplanning timing analysis/tuning worth noting 601 implemented substantial new key functions smp also acted bridge power future powerpc processors assist ibm software developers transitions powerpc start design tape-out first 601 prototype 12 months order push hard establish powerpc market early order help effort rapidly incorporate 88110 bus architecture 601 benefit alliance customers motorola management provided 88110 bus architecture specifications also handful 88110 bus-literate designers help 60x bus logic implementation verification given apple system design team familiar i/o bus structure motorola 88110 i/o bus implementation well defined documented 601 team adopted bus technology improve time market bus renamed 60x bus implemented 601 motorola small number apple designers joined 120 ibm designers creating 601 using 88110 bus basis 60x bus helped schedules number ways helped apple power macintosh team reducing amount redesign support asics reduced amount time required processor designers architects propose document negotiate close new bus interface successfully avoiding bus wars expected 601 management team 88110 bus previous rsc buses n't adopted worthy note accepting 88110 bus benefit apple efforts alliance expense first ibm rs/6000 system design team efforts support asics already implemented around rsc totally different bus structure 60x bus later became fairly long lived basic interface many variants 601 603 604 g3 g4 motorola/freescale powerquicc processors chip designed suit wide variety applications support external l2 cache symmetric multiprocessing four functional units including floating point unit integer unit branch unit sequencer unit processor also included memory management unit integer pipeline four stages long branch pipeline two stages long memory pipeline five stages long floating-point pipeline six stages long first launched ibm systems fall 1993 marketed ibm ppc601 motorola mpc601 operated speeds ranging 50 80 mhz fabricated using 0.6 µm cmos process four levels aluminum interconnect die 121 mm² large contained 2.8 million transistors 601 32 kb unified l1 cache capacity considered large time on-chip cache thanks partly large cache considered high performance processor segment outperforming competing intel pentium powerpc 601 used first power macintosh computers apple variety rs/6000 workstations smp servers ibm groupe bull ibm sole manufacturer 601 601+ microprocessors burlington vermont east fishkill new york production facilities 601 used ibm cmos-4s process 601+ used ibm cmos-5x process extremely small number 601 601+ processors relabeled motorola logos part numbers distributed motorola facts somewhat obscured given various pictures motorola mpc601 particularly one specific case masterful motorola marketing 601 named one time magazine 1994 products year motorola marking updated version powerpc 601v powerpc 601+ operating 90 120 mhz introduced 1994 fabricated newer 0.5 µm cmos process four levels interconnect resulting die measuring 74 mm² 601+ design remapped cmos-4s cmos-5x ibm-only team avoid time-to-market delays design tool changes commonizing fab groundrules 601 601+ designed ibm eda tools ibm systems fabricated ibm-only facilities powerpc 603 first processor implementing complete 32-bit powerpc architecture specified designed low cost low end processor portable embedded use one main features power saving functions doze nap sleep mode could dramatically reduce power requirements drawing 2 mw sleep mode 603 four-stage pipeline five execution units integer unit floating point unit branch prediction unit load/store unit system registry unit separate 8 kb l1 caches instructions data 32/64 bit 60x memory bus reaching 75 mhz 603 core hardware support smp powerpc 603 1.6 million transistors fabricated ibm motorola 0.5 µm cmos process four levels interconnect die 85 mm² large drawing 3 w 80 mhz 603 architecture direct ancestor powerpc 750 architecture marketed apple powerpc g3 603 intended used portable apple macintosh computers could run 68k emulation software performance apple considered adequate due smaller processor caches result apple chose use 603 low-cost desktop performa line caused delay apple powerbook 5300 powerbook duo 2300 apple chose wait processor revision apple use 603 performa 5200 line led processor getting poor reputation aside issue 68k emulation performance performa machines shipped variety design flaws severe related aspects computers design including networking performance stability bus problems width speed contention complexity rom bugs hard disk performance none problems 5200 line aside 68k emulation performance inherently due 603 rather processor retrofitted used 68k motherboards obsolete parts site low end mac rates performa 5200 worst mac all-time 603 found widespread use different embedded appliances performance issues 603 addressed powerpc 603e l1 cache enlarged enhanced 16 kb four-way set-associative data instruction caches clock speed processors doubled reaching 200 mhz shrinking fabrication process 0.35 µm allowed speeds 300 mhz part sometimes called powerpc 603ev 603e 603ev 2.6 million transistors 98 mm² 78 mm² large respectively 603ev draws maximum 6 w 300 mhz powerpc 603e first mainstream desktop processor reach 300 mhz used power macintosh 6500 603e also used accelerator cards phase5 amiga line computers cpus ranging speeds 160 240 mhz powerpc 603e still sold today ibm freescale others like atmel honeywell makes radiation hardened variant rhppc powerpc 603e also heart bebox inc bebox notable since multiprocessing system something 603 n't designed ibm also used powerpc 603e processors thinkpad 800 series laptop computers certain digital oscilloscope series lecroy used powerpc 603e main processor 603e processors also power 66 satellites iridium satellite phone fleet satellites contain seven motorola/freescale powerpc 603e processors running roughly 200 mhz custom 603e processor also used mark 54 lightweight torpedo powerpc 603e core renamed g2 freescale basis many embedded powerquicc ii processors keeps developed freescale powerquicc ii soc processors bear designation mpc82xx come variety configurations reaching 450 mhz freescale enhanced 603e core calling e300 powerquicc ii pro embedded processors larger 32/32 kb l1 caches performance enhancing measures added freescale powerquicc ii pro soc processors bear designation mpc83xx come variety configurations reaching speeds 667 mhz e300 also core mpc5200b soc processor used small efika computer powerpc 604 introduced december 1994 alongside 603 designed high-performance chip workstations entry-level servers support symmetric multiprocessing hardware 604 used extensively apple high-end systems also used macintosh clones ibm low-end rs/6000 servers workstations amiga accelerator boards embedded cpu telecom applications 604 superscalar processor capable issuing four instructions simultaneously 604 six-stage pipeline six execution units work parallel finishing six instructions every cycle two simple one complex integer units one floating point unit one branch processing unit managing out-of-order execution one load/store unit separate 16 kb data instruction l1 caches external interface 32- 64-bit 60x bus operates clock rates 50 mhz powerpc 604 contains 3.6 million transistors fabricated ibm motorola 0.5 µm cmos process four levels interconnect die measured 12.4 mm 15.8 mm 196 mm² drew 14-17 w 133 mhz operated speeds 100 180 mhz powerpc 604e introduced july 1996 added condition register unit separate 32 kb data instruction l1 caches among changes memory subsystem branch prediction unit resulting 25 performance increase compared predecessor 5.1 million transistors manufactured ibm motorola 0.35 µm cmos process five levels interconnect die 148 mm² 96 mm² large manufactured motorola ibm respectively drawing 16-18 w 233 mhz operated speeds 166 233 mhz supported memory bus 66 mhz powerpc 604ev 604r mach 5 introduced august 1997 essentially 604e fabricated ibm motorola newer process reaching higher speeds lower energy consumption die 47 mm² small manufactured 0.25 µm cmos process five levels interconnect drew 6 w 250 mhz operated speeds 250 400 mhz supported memory bus 100 mhz apple dropped 604ev 1998 favor powerpc 750 ibm kept using entry-level models rs/6000 computers several years powerpc 620 first implementation entire 64-bit powerpc architecture second generation powerpc alongside 603 604 geared towards high-end workstation server market powerful paper initially supposed launched alongside brethren delayed 1997 arrive performance comparably poor considerably cheaper 604e surpassed 620 therefore never produced large quantities found little use sole user powerpc 620 groupe bull escala unix machines n't deliver large numbers ibm intended use workstations servers decided wait even powerful rs64 power3 64-bit processors instead 620 produced motorola 0.5 µm process 6.9 million transistors die area 311 mm² operated clock rates 120 150 mhz drew 30 w 133 mhz later model built using 0.35 µm process enabling reach 200 mhz 620 similar 604 five-stage pipeline support symmetric multiprocessing number execution units load/store unit branch unit fpu three integer units larger 32 kb instruction data caches support l2 cache may capacity 128 mb powerful branch load/store units buffers 620 powerful branch history table also larger could dispatch instructions processor handle out-of-order execution efficiently 604 floating point unit also enhanced compared 604 faster fetch cycle support several key instruction hardware like sqrt made combined faster wider data buses efficient fpu 604 system bus wider faster 128-bit memory bus called 6xx bus designed system bus multiprocessor systems processors caches memory i/o connected assisted system control chip supports 32- 64-bit powerpc processors memory addresses larger 32 bits numa environments also used power3 rs64 601 well 604-based rs/6000 systems bridge chip bus later evolved gx bus power4 later gx+ gx++ power5 power6 respectively gx bus also used ibm z10 z196 system z mainframes powerpc 602 stripped version powerpc 603 specially made game consoles motorola ibm introduced february 1995 smaller l1 caches 4 kb instruction 4 kb data single-precision floating-point unit scaled back branch prediction unit offered speeds ranging 50 80 mhz drew 1.2 w 66 mhz consisted 1 million transistors 50 mm² large manufactured 0.5 µm cmos process four levels interconnect 3do developed m2 game console used two powerpc 602 never marketed october 21 1996 fabless semiconductor company quantum effect devices qed announced powerpc 603-compatible processor named powerpc 603q microprocessor forum despite name anything common 603 ground implementation 32-bit powerpc architecture targeted high-end embedded market developed two years small simple energy efficient powerful equaling expensive 603e drawing less power in-order five-stage pipeline single integer unit double precision floating point unit fpu separate 16 kb instruction 8 kb data caches integer unit brand new design fpu derived r4600 save time 69 mm² small using 0.5 µm fabrication process drew 1.2 w 120 mhz 603q designed motorola withdrew contract 603q went full production result 603q canceled qed could continue market processor since lacked powerpc license powerpc 613 seems name motorola given third generation powerpc supposedly renamed powerpc 750 response exponential technology x704 processor designed outgun 604 wide margin hardly sources confirming though might pure speculation reference completely different processor similar powerpc 613 powerpc 614 might name given motorola third generation powerpc later renamed reason 613 suggested part renamed powerpc 7400 motorola even bumped fourth generation powerpc even though architectural differences g3 g4 small hardly sources confirming though might pure speculation reference completely different processor powerpc 615 powerpc processor announced ibm 1994 never reached mass production main feature incorporate x86 core die thus making processor able natively process powerpc x86 instructions operating system running powerpc 615 could either chose execute 32-bit 64-bit powerpc instructions 32-bit x86 instructions mix three mixing instructions would involve context switch cpu small overhead operating systems supported 615 minix special development version os/2 330 mm² large manufactured ibm 0.35 µm process pin compatible intel pentium processors comparable speed processor introduced prototype program killed part fact microsoft never supported processor engineers working powerpc 615 would later find way transmeta worked crusoe processor powerpc 625 early name apache series 64-bit powerpc processors designed ibm based amazon powerpc-as instruction set later renamed rs64 designation powerpc 625 never used final processors powerpc 630 early name high end 64-bit powerpc processor designed ibm unify power powerpc instruction sets later renamed power3 probably distinguish consumer oriented powerpc processors used apple powerpc 641 codename habanero defunct powerpc project ibm 1994–96 timeframe suggested third generation powerpc based 604 processor
[ 4661, 6074, 3936, 1075, 1452, 1454, 1083, 5737, 7905, 4702, 6474, 1131, 5079, 2257, 441, 5450, 5097, 3348, 5100, 6170, 1922, 5477, 4408, 3708, 7990, 1199, 6200, 7654, 4815, 6226, 2342, 2353, 2719, 7327, 4847, 3440, 7339, 912, 7361, 234, ...
Test
3,675
2
Tom_Duff:tom duff thomas douglas selkirk duff born december 8 1952 computer programmer duff born toronto ontario canada named putative ancestor fifth earl selkirk grew toronto leaside 1974 graduated university waterloo b.math two years later got m.sc university toronto duff worked new york institute technology computer graphics lab mark williams company chicago moving lucasfilm computer research development division thomas porter another lucasfilm employee developed new approach compositing images 1984 paper compositing digital images seminal work algebra image compositing according keith packard porter-duff compositing key technique computer graphics see example xrender glitz duff later worked 12 years bell labs computing science research center worked computer graphics wireless networking plan 9 course work authored well known rc shell version 10 unix operating system duff worked pixar animation studios since 1996
[ 7693, 1435, 6360 ]
Test
3,676
7
Cascading_(software):cascading software cascading software abstraction layer apache hadoop apache flink cascading used create execute complex data processing workflows hadoop cluster using jvm-based language java jruby clojure etc hiding underlying complexity mapreduce jobs open source available apache license commercial support available driven inc. cascading originally authored chris wensel later founded concurrent inc re-branded driven cascading actively developed community number add-on modules available use cascading apache hadoop must also installed hadoop job .jar must contain cascading .jars cascading consists data processing api integration api process planner process scheduler cascading leverages scalability hadoop abstracts standard data processing operations away underlying map reduce tasks developers use cascading create .jar file describes required processes follows ‘ source-pipe-sink ’ paradigm data captured sources follows reusable ‘ pipes ’ perform data analysis processes results stored output files ‘ sinks ’ pipes created independent data process tied data sources sinks called ‘ flow ’ flows grouped ‘ cascade ’ process scheduler ensure given flow execute dependencies satisfied pipes flows reused reordered support different business needs developers write code jvm-based language need learn mapreduce resulting program regression tested integrated external applications like java application cascading often used ad targeting log file analysis bioinformatics machine learning predictive analytics web content mining extract transform load etl applications cascading cited one top five powerful hadoop projects sd times 2011 major open source project relevant bioinformatics included hadoop definitive guide tom white project also cited presentations conference proceedings hadoop user group meetings useful tool working hadoop apache spark
[ 4469, 7924, 5064, 6387, 3879 ]
Test
3,677
2
MAD_(MUD):mad mud mad multi access dungeon global mud similar mud1 ran fremp11 bitnet node operated école nationale supérieure des mines de paris mud developed bruno chabrier vincent lextrait two students school began operating 1984 slightly less two years bitnet administrators concerned impact widespread adoption game asked école des mines stop mad installed several nodes world completely banned consequence success resulted complete saturation bitnet several occasions
[ 4995, 4906 ]
Test
3,678
2
Solaris_Trusted_Extensions:solaris trusted extensions solaris trusted extensions set security extensions incorporated solaris 10 operating system sun microsystems featuring mandatory access control model succeeds trusted solaris family security-evaluated operating systems based earlier versions solaris solaris 10 5/09 common criteria certified evaluation assurance level eal4+ capp rbacpp lspp protection profiles certain trusted solaris features fine-grained privileges part standard solaris 10 release beginning solaris 10 11/06 solaris includes component called solaris trusted extensions gives additional features necessary position successor trusted solaris inclusion features mainstream solaris release marks significant change trusted solaris longer necessary use different solaris release modified kernel labeled security environments solaris trusted extensions opensolaris project trusted extensions additions enhancements include solaris trusted extensions enforce mandatory access control policy aspects operating system including device access file networking print window management services achieved adding sensitivity labels objects thereby establishing explicit relationships objects appropriate explicit authorization allows applications users read and/or write access objects component also provides labeled security features desktop environment apart extending support common desktop environment trusted solaris 8 release delivers first labeled environment based gnome solaris trusted extensions facilitate access data multiple classification levels single desktop environment solaris trusted extensions also delivers labeled device access labeled network communication cipso standard cipso used pass security information within labeled zones solaris trusted extensions complies federal information processing standard fips
[ 2098, 3697, 4229, 5571, 7827, 1010, 7090, 6208, 3732, 8037, 3423, 6505 ]
Test
3,679
5
SCTP_packet_structure:sctp packet structure stream control transmission protocol sctp simpler basic packet structure tcp consists two basic sections sctp packets require common header section shown blue background sctp packet consists addition common header chunks chunk common format contents vary green bytes diagram signify one chunk chunk length equate multiple 4 bytes protocol implicitly pads chunk trailing zeros additionally chunk type may define set parameters includes inside chunk value field consequently length chunk length two types parameter exist optional/variable-length parameters parameter type parameter length parameter value fields behave like chunk counterparts minimum size parameter 4 bytes occurs parameter value field empty parameter consists type length fields rfc 2960 defines following list chunk types detailed information type provided following subsections following table chunk parameters defined please note following color scheme init ack chunk replicates init chunk except chunk type always 2 defined yet defined yet two re-configuration parameters mentioned may appear chunk combinations valid see rfc 6525 details parameter used sender inform receiver wishes reset sequence numbers message-ids i-data used outgoing streams parameter used sender request receiver resets sequence numbers message-ids i-data used outgoing streams parameter used sender inform receiver wishes reset tsns ssns/mids streams parameter used response re-configuration request except possibly incoming ssn reset request elicits outgoing ssn reset request parameter granted parameter used sender request additional outgoing streams added association i.e incoming streams receiver parameter used sender request additional incoming streams added association i.e outgoing streams receiver pad chunk introduced facilitate path mtu discovery enabling sender arbitrarily increase size sctp packet i-data chunk introduced avoid large message one stream blocking messages streams transmitted sctp primarily uses tsn achieve reliability cases tsn also needed distinguish different data chunks message fragmented data tsn additionally doubles fragment sequence number means fragments message must sent using consecutive tsns effectively blocking data i-data chunk disentangles different uses tsn data chunks data i-data chunks compatible may used association forward-tsn chunk introduced support selective unreliability allows sender tell receiver retransmit number chunks requests receiver consider chunks received i-forward-tsn chunk introduced used instead forward-tsn i-data used instead data
[ 2644, 7637, 3819, 4942 ]
Validation
3,680
4
Intrusion_detection_system:intrusion detection system intrusion detection system ids device software application monitors network systems malicious activity policy violations malicious activity violation typically reported either administrator collected centrally using security information event management siem system siem system combines outputs multiple sources uses alarm filtering techniques distinguish malicious activity false alarms ids types range scope single computers large networks common classifications network intrusion detection systems nids host-based intrusion detection systems hids system monitors important operating system files example hids system analyzes incoming network traffic example nids also possible classify ids detection approach well-known variants signature-based detection recognizing bad patterns malware anomaly-based detection detecting deviations model good traffic often relies machine learning another reputation-based detection recognizing potential threat according reputation scores ids products ability respond detected intrusions systems response capabilities typically referred intrusion prevention system intrusion detection systems also serve specific purposes augmenting custom tools using honeypot attract characterize malicious traffic although relate network security ids differs firewall firewall looks outwardly intrusions order stop happening firewalls limit access networks prevent intrusion signal attack inside network ids describes suspected intrusion taken place signals alarm ids also watches attacks originate within system traditionally achieved examining network communications identifying heuristics patterns often known signatures common computer attacks taking action alert operators system terminates connections called intrusion prevention system performs access control like application layer firewall ids classified detection takes place network host detection method employed signature anomaly-based network intrusion detection systems nids placed strategic point points within network monitor traffic devices network performs analysis passing traffic entire subnet matches traffic passed subnets library known attacks attack identified abnormal behavior sensed alert sent administrator example nids would installing subnet firewalls located order see someone trying break firewall ideally one would scan inbound outbound traffic however might create bottleneck would impair overall speed network opnet netsim commonly used tools simulating network intrusion detection systems nid systems also capable comparing signatures similar packets link drop harmful detected packets signature matching records nids classify design nids according system interactivity property two types on-line off-line nids often referred inline tap mode respectively on-line nids deals network real time analyses ethernet packets applies rules decide attack off-line nids deals stored data passes processes decide attack nids also combined technologies increase detection prediction rates artificial neural network based ids capable analyzing huge volumes data smart way due self-organizing structure allows ins ids efficiently recognize intrusion patterns neural networks assist ids predicting attacks learning mistakes inn ids help develop early warning system based two layers first layer accepts single values second layer takes first layers output input cycle repeats allows system automatically recognize new unforeseen patterns network system average 99.9 detection classification rate based research results 24 network attacks divided four categories dos probe remote-to-local user-to-root host intrusion detection systems hids run individual hosts devices network hids monitors inbound outbound packets device alert user administrator suspicious activity detected takes snapshot existing system files matches previous snapshot critical system files modified deleted alert sent administrator investigate example hids usage seen mission critical machines expected change configurations signature-based ids refers detection attacks looking specific patterns byte sequences network traffic known malicious instruction sequences used malware terminology originates anti-virus software refers detected patterns signatures although signature-based ids easily detect known attacks difficult detect new attacks pattern available signature-based ids signatures released vendor products on-time updating ids signature key aspect anomaly-based intrusion detection systems primarily introduced detect unknown attacks part due rapid development malware basic approach use machine learning create model trustworthy activity compare new behavior model since models trained according applications hardware configurations machine learning based method better generalized property comparison traditional signature-based ids although approach enables detection previously unknown attacks may suffer false positives previously unknown legitimate activity may also classified malicious existing idss suffer time-consuming detection process degrades performance idss efficient feature selection algorithm makes classification process used detection reliable new types could called anomaly-based intrusion detection systems viewed gartner user entity behavior analytics ueba evolution user behavior analytics category network traffic analysis nta particular nta deals malicious insiders well targeted external attacks compromised user machine account gartner noted organizations opted nta traditional ids systems may attempt stop intrusion attempt neither required expected monitoring system intrusion detection prevention systems idps primarily focused identifying possible incidents logging information reporting attempts addition organizations use idps purposes identifying problems security policies documenting existing threats deterring individuals violating security policies idps become necessary addition security infrastructure nearly every organization idps typically record information related observed events notify security administrators important observed events produce reports many idps also respond detected threat attempting prevent succeeding use several response techniques involve idps stopping attack changing security environment e.g reconfiguring firewall changing attack content intrusion prevention systems ips also known intrusion detection prevention systems idps network security appliances monitor network system activities malicious activity main functions intrusion prevention systems identify malicious activity log information activity report attempt block stop it.. intrusion prevention systems considered extensions intrusion detection systems monitor network traffic and/or system activities malicious activity main differences unlike intrusion detection systems intrusion prevention systems placed in-line able actively prevent block intrusions detected ips take actions sending alarm dropping detected malicious packets resetting connection blocking traffic offending ip address ips also correct errors defragment packet streams mitigate tcp sequencing issues clean unwanted transport network layer options.. intrusion prevention systems classified four different types majority intrusion prevention systems utilize one three detection methods signature-based statistical anomaly-based stateful protocol analysis number techniques attackers using following considered 'simple measures taken evade ids earliest preliminary ids concept delineated 1980 james anderson national security agency consisted set tools intended help administrators review audit trails user access logs file access logs system event logs examples audit trails fred cohen noted 1987 impossible detect intrusion every case resources needed detect intrusions grow amount usage dorothy e. denning assisted peter g. neumann published model ids 1986 formed basis many systems today model used statistics anomaly detection resulted early ids sri international named intrusion detection expert system ides ran sun workstations could consider user network level data ides dual approach rule-based expert system detect known types intrusions plus statistical anomaly detection component based profiles users host systems target systems author ides intelligent system detecting intruders teresa f. lunt proposed adding artificial neural network third component said three components could report resolver sri followed ides 1993 next-generation intrusion detection expert system nides multics intrusion detection alerting system midas expert system using p-best lisp developed 1988 based work denning neumann haystack also developed year using statistics reduce audit trails 1986 national security agency started ids research transfer program rebecca bace bace later published seminal text subject intrusion detection 2000 wisdom sense w statistics-based anomaly detector developed 1989 los alamos national laboratory w created rules based statistical analysis used rules anomaly detection 1990 time-based inductive machine tim anomaly detection using inductive learning sequential user patterns common lisp vax 3500 computer network security monitor nsm performed masking access matrices anomaly detection sun-3/50 workstation information security officer assistant isoa 1990 prototype considered variety strategies including statistics profile checker expert system computerwatch bell labs used statistics rules audit data reduction intrusion detection 1991 researchers university california davis created prototype distributed intrusion detection system dids also expert system network anomaly detection intrusion reporter nadir also 1991 prototype ids developed los alamos national laboratory integrated computing network icn heavily influenced work denning lunt nadir used statistics-based anomaly detector expert system lawrence berkeley national laboratory announced bro 1998 used rule language packet analysis libpcap data network flight recorder nfr 1999 also used libpcap ape developed packet sniffer also using libpcap november 1998 renamed snort one month later snort since become world largest used ids/ips system 300,000 active users monitor local systems remote capture points using tzsp protocol audit data analysis mining adam ids 2001 used tcpdump build profiles rules classifications 2003 yongguang zhang wenke lee argue importance ids networks mobile nodes 2015 viegas colleagues proposed anomaly-based intrusion detection engine aiming system-on-chip soc applications internet things iot instance proposal applies machine learning anomaly detection providing energy-efficiency decision tree naive-bayes k-nearest neighbors classifiers implementation atom cpu hardware-friendly implementation fpga literature first work implement classifier equivalently software hardware measures energy consumption additionally first time measured energy consumption extracting features used make network packet classification implemented software hardware
[ 2173, 3932, 7151, 6417, 1445, 6419, 3613, 2554, 3950, 1461, 385, 2566, 6107, 2213, 3635, 7186, 2577, 5401, 38, 6823, 2944, 3650, 429, 1135, 74, 2614, 4741, 3681, 6507, 4025, 2626, 5454, 7963, 5806, 6515, 1533, 2996, 7626, 7627, 3698, 54...
Test
3,681
4
Mobile_secure_gateway:mobile secure gateway mobile secure gateway msg industry term software hardware appliance provides secure communication mobile application respective backend resources typically within corporate network addresses challenges field mobile security msg typically composed two components client library gateway client library linked mobile application establishes secure connectivity gateway using cryptographic protocol typically ssl/tls represents secured channel used communication mobile application hosts gateway separates internal infrastructure internet allowing authorized client requests reach specific set hosts inside restricted network client library linked corresponding mobile application provides secure access via gateway set hosts client library exposes public api mobile application mimicking platform default http client library application uses api communicate desired hosts secure way gateway server daemon typically installed onto physical virtual appliance placed dmz gateway public interface exposed internet untrusted network accepts tcp/ip connections mobile applications operates ipv4 and/or ipv6 networks incoming client connections typically use ssl/tls provide security network communication mutual trust communicating peers communication protocol typically based http gateway forwards requests connected apps collection configured hosts typically http https servers services within internal network response host sent back respective mobile app
[ 623, 3932, 6694, 6515, 3855, 3448, 2105, 1461, 651, 2566, 6725, 2747, 5485, 1376, 3794, 5401, 3383, 2310, 6823, 2491, 5149, 6376, 3726, 1584, 4440, 6756, 3486, 3819, 2789, 74, 7865, 1989, 7319, 3680, 1805 ]
Test
3,682
3
Separation_kernel:separation kernel separation kernel type security kernel used simulate distributed environment concept introduced john rushby 1981 paper rushby proposed separation kernel solution difficulties problems arisen development verification large complex security kernels intended provide multilevel secure operation general-purpose multi-user systems according rushby task separation kernel create environment indistinguishable provided physically distributed system must appear regime separate isolated machine information flow one machine another along known external communication lines one properties must prove separation kernel therefore channels information flow regimes explicitly provided variant separation kernel partitioning kernel gained acceptance commercial aviation community way consolidating onto single processor multiple functions perhaps mixed criticality commercial real-time operating system products genre used aircraft manufacturers safety-critical avionics applications 2007 information assurance directorate u.s. national security agency nsa published separation kernel protection profile skpp security requirements specification separation kernels suitable used hostile threat environments skpp describes common criteria parlance class modern products provide foundational properties rushby conceptual separation kernel defines security functional assurance requirements construction evaluation separation kernels yet providing latitude choices available developers skpp defines separation kernel hardware and/or firmware and/or software mechanisms whose primary function establish isolate separate multiple partitions control information flow subjects exported resources allocated partitions separation kernel core functional requirements include separation kernel allocates exported resources control partitions partitions isolated except explicitly allowed information flows actions subject one partition isolated viz. detected communicated subjects another partition unless flow allowed partitions flows defined configuration data note 'partition 'subject orthogonal abstractions 'partition indicated mathematical genesis provides set-theoretic grouping system entities whereas 'subject allows us reason individual active entities system thus partition collection containing zero elements subject active element may contain zero subjects separation kernel provides hosted software programs high-assurance partitioning information flow control properties tamperproof non-bypassable capabilities provide configurable trusted foundation variety system architectures september 2008 integrity-178b green hills software became first separation kernel certified skpp wind river systems separation kernel technology active certification process 2009 2011 information assurance directorate sunset skpp nsa longer certify specific operating systems including separation kernels skpp noting conformance protection profile offer sufficient confidence national security information appropriately protected context larger system conformant product integrated sel4 microkernel formal proof configured separation kernel proof information flow enforcement together implies high level assurance usecase muen separation kernel also formally verified open source separation kernel x86 machines
[ 1522, 7325, 7605, 280, 2818, 4759, 190, 4670, 5021, 8066, 8167, 4397, 13, 5644, 3271, 5116, 6984, 299, 3626, 4498, 7142, 5571, 2300, 5041, 7827, 4786, 578, 7550, 4244, 5232, 1992, 405, 6367, 1959, 6208, 6922, 8115, 5161, 5865, 7396, 65,...
Test
3,683
4
Amavis:amavis amavis open-source content filter electronic mail implementing mail message transfer decoding processing checking interfacing external content filters provide protection spam viruses malware considered interface mailer mta mail transfer agent one content filters amavis used notable features common mail filtering installation amavis consists postfix mta spamassassin spam classifier clamav anti-virus protection running unix-like operating system many virus scanners 30 spam scanners crm114 dspam bogofilter supported well mtas three topologies interfacing mta supported amavisd process sandwiched two instances mta yielding classical after-queue mail filtering setup amavisd used smtp proxy filter before-queue filtering setup amavisd process consulted provide mail classification forward mail message case consulting client remains charge mail forwarding last approach used milter setup limitations historical client program amavisd-submit since version 2.7.0 before-queue setup preferred allows mail message transfer rejected smtp session sending client after-queue setup filtering takes place mail message already received enqueued mta case mail filter longer reject message deliver possibly tagged discard generate non-delivery notification cause unwanted backscatter case bouncing message fake sender address disadvantage before-queue setup requires resources cpu memory proportional current peak mail transfer rate unlike after-queue setup delay acceptable resource usage corresponds average mail transfer rate introduction option smtpd_proxy_options=speed_adjust postfix 2.7.0 resource requirements before-queue content filter much reduced countries legislation permit mail filtering discard mail message accepted mta rules after-queue filtering setup discarding quarantining messages leaves possibility delivering possibly tagged messages rejecting before-queue setup smtp proxy milter amavis receive mail messages mta one sockets protocol families pf_inet ipv4 pf_inet6 ipv6 pf_local unix domain socket using protocols esmtp lmtp simple private protocol am.pdp used helper program like amavisd-milter interface milters output side protocols esmtp lmtp used pass message back-end mta instance lda message passed spawned process unix pipe esmtp lmtp used session optionally encrypted using tls starttls rfc 3207 extension protocol smtp command pipelining rfc 2920 supported client server code spam scanning enabled daemon process amavisd conceptually similar spamd process spamassassin project cases forked child processes call spamassassin perl modules directly hence performance similar main difference protocols used amavis typically speaks standard esmtp protocol mta spamc/spamd case mta typically spawns spamc program passing message unix pipe spamc process transfers message spamd daemon using private protocol spamd calls spamassassin perl modules design priorities amavisd-new called amavis reliability security adherence standards performance functionality intention mail message could lost due unexpected events like i/o failures resources depletion unexpected program terminations amavisd program meticulously checks completion status every system call i/o operation unexpected events logged possible handled several layers event handling amavis never takes responsibility mail message delivery away mta final success status reported mta message passed back-end mta instance reception confirmed case fatal failures processing transferring message message processed stays queue front-end mta instance re-tried later approach also covers potential unexpected host failures crashes amavisd process one components use program resources like memory size file descriptors disk usage creation subprocesses controlled large mail messages kept memory available memory size impose limit size mail messages processed memory resources wasted unnecessarily great deal attention given security aspects required handling potentially malicious nonstandard garbled data mail messages coming untrusted sources process handling mail messages runs reduced privileges dedicated user id optionally run chroot-ed risks buffer overflows memory allocation bugs largely avoided implementing protocol handling mail processing perl handles dynamic memory management transparently care taken content processed messages inadvertently propagate system perl provides additional security safety net marking tainted data originating wild amavis careful put perl feature good use avoiding automatic untainting data use taint untainting explicitly strategic points late data flow amavis use several external programs enhance functionality de-archivers de-compressors virus scanners spam scanners programs often implemented languages like c c++ potential risk mail message passed one programs cause failure even open security hole risk limited running programs unprivileged user id possibly chroot-ed nevertheless external programs like unmaintained de-archivers avoided use external programs configurable disabled selectively group like decoders virus scanners despite implemented interpreted programming language perl amavis slow good performance functionality implemented amavis speaking external components achieved dealing data large chunks e.g line-by-line avoiding unnecessary data copying optimizing frequently traversed code paths using suitable data structures algorithms well low-level optimizations bottlenecks detected development profiling code benchmarking detailed timing report log help recognize bottlenecks particular installation certain external modules programs like spamassassin command-line virus scanners slow using would constitute vast majority elapsed time processing resources making resources used amavis proportionally quite small components like external mail decoders virus scanners spam scanners selectively disabled needed remains functionality implemented amavis like transferring mail message mta using smtp lmtp protocol checking mail header section validity checking banned mail content types verifying generating dkim signatures consequence mail processing tasks like dkim signing verification mail checking disabled exceptionally fast rival implementations compiled languages even full checks using fast virus scanner spam scanning disabled surprisingly fast implementation protocols message structures closely follows set applicable standards rfc 5322 rfc 5321 rfc 2033 rfc 3207 rfc 2045 rfc 2046 rfc 2047 rfc 3461 rfc 3462 rfc 3463 rfc 3464 rfc 4155 rfc 5965 rfc 6376 rfc 5451 rfc 6008 rfc 4291 several cases functionality re-implemented amavis code even though public cpan perl module exists lacks attention detail following standard lacks sufficient checking handling errors amavis licensed gplv2 license applies current code well historical branches exception supporting programs like monitoring statistics reporting covered new bsd license project started 1997 unix shell script detect block e-mail messages containing virus intended block viruses mta mail transfer agent lda local delivery stage running unix-like platform complementing virus protection mechanisms running end-user personal computers next tool re-implemented perl program later evolved daemonized process dozen developers took turns first five years project developing several variants keeping common goal project name development infrastructure since december 2008 2018-10-09 active branch officially amavisd-new developed maintained mark martinec since march 2002 agreed developers time private correspondence christian bricart lars hecking hilko bengen rainer link mark martinec project name amavis largely interchangeable name amavisd-new branch lots functionality added years like adding protection spam unwanted content besides original virus protection focus kept reliability security adherence standards performance domain amavis.org use project registered 1998 christian bricart one early developers still maintaining domain name registration domain entirely dedicated active branch project mailing list moved sourceforge amavis.org march 2011 hosted ralf hildebrandt patrick ben koetter project web page main distribution site located jožef stefan institute ljubljana slovenia handover 2018 development taking place years 2002 2018 october 9 2018 mark martinec announced general support discussion mailing list retirement project also patrick ben koetter continue new project leader patrick notified migration source code public gitlab repository plan next steps regarding project development history project name project branches varied somewhat initially spelling project name amavis mail virus scanner introduced christian bricart rewrite perl name program amavis-perl daemonized versions initially distributed name amavisd-snapshot amavisd modular rewrite hilko bengen called amavis-ng march 2002 amavisd-new branch introduced mark martinec initially patch amavisd-snapshot-20020300 later evolved self-contained project surviving actively maintained branch nowadays project name preferably spelled amavis name program amavisd name amavis mostly interchangeable amavisd-new hilko bengen
[ 5983, 5116, 1277, 3106, 5571, 1435, 5931, 6908, 658, 3379, 1105, 5401, 2219, 1019, 3031, 5416, 8122, 3819, 5248, 8029, 1598, 1233, 6233, 2713 ]
Test
3,684
8
Mustache_(template_system):mustache template system mustache web template system implementations available actionscript c++ clojure coffeescript coldfusion common lisp dart delphi erlang fantom go haskell io java javascript julia lua .net objective-c ocaml perl php pharo python r racket ruby rust scala smalltalk swift tcl cfengine xquery mustache described logic-less system lacks explicit control flow statements like else conditionals loops however looping conditional evaluation achieved using section tags processing lists lambdas named mustache heavy use braces resemble sideways moustache mustache used mainly mobile web applications mustache-1 inspired ctemplate et started github distribution end 2009 first version template engine implemented ruby running yaml template texts preserved main principles input data class input data characterized mvc-view mustache template nothing reference methods input data view logic decisions code contained view markup ex output xml contained template mvp context input data mvp- presenter mustache template mvp- view simplest template hello template section tag text codice_1 boolean value section tag acts like conditional codice_1 array acts like foreach loop template escaped codice_3 contains html wo n't escaped syntax highlighting available atom coda emacs textmate vim visual studio code mustache templates support built many web application frameworks ex cakephp support javascript includes client-side programming many javascript libraries ajax frameworks jquery dojo yui well server-side javascript using node.js commonjs many mustache engine implementations available meet common specification see external links — final users results common syntax march 2011 last spec_version 1.1.2 mustache engines v1.x architecture render method mustache_compiler class parser class mustache inspired numerous javascript template libraries forked original simplicity add certain functionality use handlebars.js self-described br handlebars.js extension mustache templating language created chris wanstrath handlebars.js mustache logicless templating languages keep view code separated like know handlebars differs predecessor h1 /h1 h2 /h2 using context var context mustache would require either block nested object flattening context thus would h1 /h1 h2 /h2
[ 2451, 5983, 1445, 6701, 993, 109, 5998, 6428, 562, 2740, 3368, 831, 486, 3543, 4705, 6029, 4070, 5091, 5506, 7848, 7113, 1889, 5965, 2530, 4743, 2619, 1803 ]
Validation