node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
1,985 | 4 | Robust_random_early_detection:robust random early detection robust random early detection rred queueing disclipine network scheduler existing random early detection red algorithm variants found vulnerable emerging attacks especially low-rate denial-of-service attacks ldos experiments confirmed existing red-like algorithms notably vulnerable ldos attacks due oscillating tcp queue size caused attacks robust red rred algorithm proposed improve tcp throughput ldos attacks basic idea behind rred detect filter attack packets normal red algorithm applied incoming flows rred algorithm significantly improve performance tcp low-rate denial-of-service attacks detection filter block added front regular red block router basic idea behind rred detect filter ldos attack packets incoming flows feed red algorithm distinguish attacking packet normal tcp packets critical rred design within benign tcp flow sender delay sending new packets loss detected e.g. packet dropped consequently packet suspected attacking packet sent within short-range packet dropped basic idea detection algorithm robust red rred nowiki rred-enque pkt 01 f←rred-flowhash pkt 02 tmax←max flow f .t1 t2 03 pkt.arrivaltime within tmax tmax+t* 04 reduce local indicator 1 bin corresponding f 05 else 06 increase local indicator 1 bin f 07 flow f .i←maximum local indicators bins f 08 flow f .i =0 09 red-enque pkt //pass pkt red block 10 red drops pkt 11 t2←pkt.arrivaltime 12 else 13 flow f .t1←pkt.arrivaltime 14 drop pkt 15 return simulation code rred algorithm published active queue management denial-of-service attack aqm dos simulation platform aqm dos simulation platform able simulate variety dos attacks distributed dos spoofing dos low-rate dos etc active queue management aqm algorithms red rred sfb etc. automatically calculates records average throughput normal tcp flows dos attacks facilitate analysis impact dos attacks normal tcp flows aqm algorithms | [
1691,
1068,
1607
] | Test |
1,986 | 4 | Dark_Mail_Alliance:dark mail alliance dark mail alliance organization dedicated creating email protocol architecture end-to-end encryption october 2013 silent circle lavabit announced project create secure alternative email began fundraising effort dark mail alliance team consists phil zimmermann jon callas mike janke ladar levison dark internet mail environment dime aims secure communication platform asynchronous messaging across internet presented ladar levison stephen watt def con multiple revisions dime specifications latest revision presented preliminary draft magma reference mime server implementation supports server side encryption simple mail transfer protocol smtp post office protocol pop internet message access protocol imap hypertext transfer protocol http volcano thunderbird fork dime support | [
7071,
7725,
1468,
1647,
6908,
7975,
5773,
3383,
5029
] | Test |
1,987 | 2 | Windows_Security_Log:windows security log security log microsoft windows log contains records login/logout activity security-related events specified system audit policy auditing allows administrators configure windows record operating system activity security log security log one three logs viewable event viewer local security authority subsystem service writes events log security log one primary tools used administrators detect investigate attempted successful unauthorized activity troubleshoot problems microsoft describes best last defense log audit policies govern also favorite targets hackers rogue system administrators seeking cover tracks committing unauthorized activity audit policy set record logins successful login results user user name computer name logged well user name logging depending version windows method login ip address may may recorded windows 2000 web server instance log ip addresses successful logins windows server 2003 includes capability categories events logged sheer number loggable events means security log analysis time-consuming task third-party utilities developed help identify suspicious trends also possible filter log using customized criteria administrators allowed view clear log way separate rights view clear log addition administrator use winzapper delete specific events log reason administrator account compromised event history contained security log unreliable defense set remote log server services shut allowing console access log approaches maximum size either overwrite old events stop logging new events makes susceptible attacks intruder flood log generating large number new events partial defense increase maximum log size greater number events required flood log possible set log overwrite old events chris benton notes problem nt really bad habit crashing logs become full randy franklin smith ultimate windows security points given ability administrators manipulate security log cover unauthorized activity separation duty operations security-monitoring staff combined frequent backups log server accessible latter improve security another way defeat security log would user log administrator change auditing policies stop logging unauthorized activity intends carry policy change could logged depending audit policy change setting event could deleted log using winzapper point onward activity would generate trail security log microsoft notes possible detect attempts elude security monitoring solution techniques challenging many events occur attempt cover tracks intrusive activity events occur regularly typical business network benton points one way preventing successful attacks security obscurity keeping department security systems practices confidential helps prevent users formulating ways cover tracks users aware log copied remote log server :00 every hour instance may take measures defeat system attacking :10 deleting relevant log events top next hour log manipulation needed attacks simply aware security log works enough take precautions detection instance user wanting log fellow employee account corporate network might wait hours gain unobserved physical access computer cubicle surreptitiously use hardware keylogger obtain password later log user account terminal services wi-fi hotspot whose ip address traced back intruder log cleared event viewer one log entry immediately created freshly cleared log noting time cleared admin cleared information starting point investigation suspicious activity addition windows security log administrators check internet connection firewall security log clues theoretically possible write false events log microsoft notes able write security log seauditprivilege required default local system network service accounts privilege microsoft windows internals states processes call audit system services must seauditprivilege privilege successfully generate audit record winzapper faq notes possible add 'made event records log feature added considered nasty reference fact someone administrator access could use functionality shift blame unauthorized activity innocent party server 2003 added api calls applications could register security event logs write security audit entries specifically authzinstallsecurityeventsource function installs specified source security event source eventtracker newsletter states possibility tampering enough cause logs inadmissible must specific evidence tampering order logs considered inadmissible | [
4382,
2408,
454,
7282,
2495,
4759,
3795,
6022
] | Test |
1,988 | 5 | Circuit_switching:circuit switching circuit switching method implementing telecommunications network two network nodes establish dedicated communications channel circuit network nodes may communicate circuit guarantees full bandwidth channel remains connected duration communication session circuit functions nodes physically connected electrical circuit defining example circuit-switched network early analog telephone network call made one telephone another switches within telephone exchanges create continuous wire circuit two telephones long call lasts circuit switching contrasts packet switching divides data transmitted packets transmitted network independently packet switching instead dedicated one communication session time network links shared packets multiple competing communication sessions resulting loss quality service guarantees provided circuit switching circuit switching bit delay constant connection opposed packet switching packet queues may cause varying potentially indefinitely long packet transfer delays circuit degraded competing users protected use callers circuit released new connection set even actual communication taking place channel remains reserved protected competing users virtual circuit switching packet switching technology emulates circuit switching sense connection established packets transferred packets delivered order circuit switching commonly used connecting voice circuits concept dedicated path persisting two communicating parties nodes extended signal content voice advantage using circuit switching provides continuous transfer without overhead associated packets making maximal use available bandwidth communication one disadvantage relatively inefficient unused capacity guaranteed connection used connections network call setup control administrative purposes possible use separate dedicated signalling channel end node network isdn one service uses separate signalling channel plain old telephone service pots method establishing connection monitoring progress termination network may also utilize separate control channel case links telephone exchanges use ccs7 packet-switched signalling protocol communicate call setup control information use tdm transport actual circuit data early telephone exchanges suitable example circuit switching subscriber would ask operator connect another subscriber whether exchange via inter-exchange link another operator case end result physical electrical connection two subscribers telephones duration call copper wire used connection could used carry calls time even subscribers fact talking line silent circuit switching contrasts packet switching divides data transmitted small units called packets transmitted network independently packet switching shares available network bandwidth multiple communication sessions multiplexing multiple telecommunications connections physical conductor possible long time nonetheless channel multiplexed link either dedicated one call time idle calls circuit switching route associated bandwidth reserved source destination making circuit switching relatively inefficient since capacity reserved whether connection continuous use contrast packet switching process segmenting data transmitted several smaller packets packet labeled destination sequence number ordering related packets precluding need dedicated path help packet find way destination packet dispatched independently may routed via different path destination original message reordered based packet number reproduce original message result datagram packet switching networks require circuit established allow many pairs nodes communicate concurrently channel | [
7052,
1618,
6071,
1443,
1916,
3956,
823,
5387,
7824,
1375,
2117,
740,
320,
5755,
585,
4970,
8108,
3887,
3724,
3982,
4801,
6468,
7566,
1302,
2057,
2061,
768,
1974,
2880,
4093,
5175,
1142,
6781,
84,
4378
] | Test |
1,989 | 2 | Library_(computing):library computing computer science library collection non-volatile resources used computer programs often software development may include configuration data documentation help data message templates pre-written code subroutines classes values type specifications ibm os/360 successors referred partitioned data sets library also collection implementations behavior written terms language well-defined interface behavior invoked instance people want write higher level program use library make system calls instead implementing system calls addition behavior provided reuse multiple independent programs program invokes library-provided behavior via mechanism language example simple imperative language c behavior library invoked using c normal function-call distinguishes call library function versus another function program way code organized system library code organized way used multiple programs connection code part program organized used within one program distinction gain hierarchical notion program grows large multi-million-line program case may internal libraries reused independent sub-portions large program distinguishing feature library organized purposes reused independent programs sub-programs user needs know interface internal details library value library lies reuse behavior program invokes library gains behavior implemented inside library without implement behavior libraries encourage sharing code modular fashion ease distribution code behavior implemented library connected invoking program different program lifecycle phases code library accessed build invoking program library called static library alternative build executable invoking program distribute independently library implementation library behavior connected executable invoked executed either part process starting execution middle execution case library called dynamic library loaded run time dynamic library loaded linked preparing program execution linker alternatively middle execution application may explicitly request module loaded compiled languages standard library although programmers also create custom libraries modern software systems provide libraries implement majority system services libraries commoditized services modern application requires code used modern applications provided system libraries earliest programming concepts analogous libraries intended separate data definitions program implementation jovial brought compool communication pool concept popular attention 1959 although adopted idea large-system sage software following computer science principles separation concerns information hiding comm pool purpose permit sharing system data among many programs providing centralized data description cobol also included primitive capabilities library system 1959 jean sammet described inadequate library facilities retrospect another major contributor modern library concept came form subprogram innovation fortran fortran subprograms compiled independently compiler lacked linker prior introduction modules fortran-90 type checking fortran subprograms impossible finally historians concept remember influential simula 67 simula first object-oriented programming language classes nearly identical modern concept used java c++ c class concept simula also progenitor package ada module modula-2 even developed originally 1965 simula classes could included library files added compile time libraries important program linking binding process resolves references known links symbols library modules linking process usually automatically done linker binder program searches set libraries modules given order usually considered error link target found multiple times given set libraries linking may done executable file created whenever program used run time references resolved may addresses jumps routine calls may main program one module depending upon another resolved fixed relocatable addresses common base allocating runtime memory memory segments module referenced programming languages may use feature called smart linking whereby linker aware integrated compiler linker knows external references used code library never actually used even though internally referenced discarded compiled application example program uses integers arithmetic arithmetic operations exclude floating-point library routines smart-linking feature lead smaller application file sizes reduced memory usage references program library module stored relative symbolic form resolved code libraries assigned final static addresses relocation process adjusting references done either linker loader general relocation done individual libraries addresses memory may vary depending program using libraries combined position-independent code avoids references absolute addresses therefore require relocation linking performed creation executable another object file known static linking early binding case linking usually done linker may also done compiler static library also known archive one intended statically linked originally static libraries existed static linking must performed modules recompiled modules required program sometimes statically linked copied executable file process resulting stand-alone file known static build program static build may need relocation virtual memory used address space layout randomization desired shared library shared object file intended shared executable files shared object files modules used program loaded individual shared objects memory load time run time rather copied linker creates single monolithic executable file program shared libraries statically linked meaning references library modules resolved modules allocated memory executable file created often linking shared libraries postponed loaded modern operating systems shared library files format executable files offers two main advantages first requires making one loader rather two single loader considered well worth added complexity secondly allows executables also used shared libraries symbol table typical combined executable shared library formats elf mach-o unix pe windows older environments 16-bit windows mpe hp 3000 stack-based data local allowed shared-library code significant restrictions placed shared-library code library code may shared memory multiple processes well disk virtual memory used processes would execute physical page ram mapped different address spaces processes advantages instance openstep system applications often hundred kilobytes size loaded quickly majority code located libraries already loaded purposes operating system programs accomplish ram sharing using position-independent code unix leads complex flexible architecture using common virtual addresses windows os/2 systems make sure various tricks like pre-mapping address space reserving slots shared library code great probability shared third alternative single-level store used ibm system/38 successors allows position-dependent code places significant restrictions code placed shared cases different versions shared libraries cause problems especially libraries different versions file name different applications installed system require specific version scenario known dll hell named windows os/2 dll file modern operating systems 2001 clean-up methods eliminate situations use application-specific private libraries dynamic linking late binding linking performed program loaded load time executed run time rather executable file created dynamically linked library dynamic-link library dll windows os/2 dynamic shared object dso unix-like systems library intended dynamic linking minimal amount work done linker executable file created records library routines program needs index names numbers routines library majority work linking done time application loaded load time execution run time usually necessary linking program called dynamic linker linking loader actually part underlying operating system however possible exceedingly difficult write program uses dynamic linking includes dynamic linker even operating system provides support dynamic linking programmers originally developed dynamic linking multics operating system starting 1964 mts michigan terminal system built late 1960s since shared libraries systems change often systems compute likely load address shared library system needed store information libraries executables every shared library loaded undergone process load predetermined address speeds process dynamic linking optimization known prebinding macos prelinking linux disadvantages technique include time required precompute addresses every time shared libraries change inability use address space layout randomization requirement sufficient virtual address space use problem alleviated adoption 64-bit architectures least time loaders shared libraries vary widely functionality depend executable storing explicit paths libraries change library naming layout file system cause systems fail commonly name library path stored executable operating system supplying method find library disk based algorithm shared library executable depends deleted moved renamed incompatible version library copied place earlier search executable would fail load called dependency hell existing many platforms infamous windows variant commonly known dll hell problem occur version library uniquely identified program references libraries full unique identifiers dll hell problems earlier windows versions arose using names libraries guaranteed unique resolve dynamic links programs avoid dll hell later versions windows rely largely options programs install private dlls—essentially partial retreat use shared libraries—along mechanisms prevent replacement shared system dlls earlier versions microsoft windows checks registry determine proper place load dlls implement com objects dlls check directories defined order first windows checks directory loaded program private dll directories set calling codice_1 function system32 system windows directories current working directory finally directories specified path environment variable applications written .net framework framework since 2002 also check global assembly cache primary store shared dll files remove issue dll hell openstep used flexible system collecting list libraries number known locations similar path concept system first starts moving libraries around causes problems although users incur time cost first starting system unix-like systems search path specifying file-system directories look dynamic libraries systems specify default path configuration file others hard-code dynamic loader executable file formats specify additional directories search libraries particular program usually overridden environment variable although disabled setuid setgid programs user ca n't force program run arbitrary code root permissions developers libraries encouraged place dynamic libraries places default search path downside make installation new libraries problematic known locations quickly become home increasing number library files making management complex dynamic loading subset dynamic linking involves dynamically linked library loading unloading run time request request may made implicitly compile time explicitly run time implicit requests made compile time linker adds library references include file paths simply file names explicit requests made applications make direct calls operating system api run time operating systems support dynamically linked libraries also support dynamically loading libraries via run-time linker api instance microsoft windows uses api functions loadlibrary loadlibraryex freelibrary getprocaddress microsoft dynamic link libraries posix-based systems including unix unix-like systems use dlopen dlclose dlsym development systems automate process although originally pioneered 1960s dynamic linking reach operating systems used consumers late 1980s generally available form operating systems early 1990s period object-oriented programming oop becoming significant part programming landscape oop runtime binding requires additional information traditional libraries n't supply addition names entry points code located within also require list objects depend side-effect one oop main advantages inheritance means parts complete definition method may different places simply listing one library requires services another true oop system libraries may known compile time vary system system time many developers worked idea multi-tier programs display running desktop computer would use services mainframe minicomputer data storage processing instance program gui-based computer would send messages minicomputer return small samples huge dataset display remote procedure calls rpc already handled tasks standard rpc system soon majority minicomputer mainframe vendors instigated projects combine two producing oop library format could used anywhere systems known object libraries distributed objects supported remote access microsoft com example system local use dcom modified version supports remote access time object libraries held status next big thing programming world number efforts create systems would run across platforms companies competed try get developers locked system examples include ibm system object model som/dsom sun microsystems distributed objects everywhere doe next portable distributed objects pdo digital objectbroker microsoft component object model com/dcom number corba-based systems inevitable cooling marketing hype object libraries continue used object-oriented programming distributed information systems class libraries rough oop equivalent older types code libraries contain classes describe characteristics define actions methods involve objects class libraries used create instances objects characteristics set specific values oop languages like java distinction clear classes often contained library files like java jar file format instantiated objects residing memory although potentially able made persistent separate files others like smalltalk class libraries merely starting point system image includes entire state environment classes instantiated objects another solution library issue comes using completely separate executables often lightweight form calling using remote procedure call rpc network another computer approach maximizes operating system re-use code needed support library code used provide application support security every program additionally systems require library exist machine forward requests network however approach means every library call requires considerable amount overhead rpc calls much expensive calling shared library already loaded machine approach commonly used distributed architecture makes heavy use remote calls notably client-server systems application servers enterprise javabeans code generation libraries high-level apis generate transform byte code java used aspect-oriented programming data access frameworks testing generate dynamic proxy objects also used intercept field access system stores codice_2 codice_3 files directories codice_4 codice_5 codice_6 filenames always start codice_7 end suffix codice_8 archive static library codice_9 shared object dynamically linked library systems might multiple names dynamically linked library names names symbolic links remaining name names might include major version library full version number example systems codice_10 would filename second major interface revision dynamically linked library codice_11 codice_12 files sometimes found library directories libtool archives usable system system inherits static library conventions bsd library stored codice_8 file use codice_9-style dynamically linked libraries codice_15 suffix instead libraries macos however consist frameworks placed inside special directories called bundles wrap library required files metadata example framework called codice_16 would implemented bundle called codice_17 codice_18 either dynamically linked library file symlink dynamically linked library file codice_19 dynamic-link libraries usually suffix codice_20 although file name extensions may identify specific-purpose dynamically linked libraries e.g codice_21 ole libraries interface revisions either encoded file names abstracted away using com-object interfaces depending compiled codice_22 files either static libraries representations dynamically linkable libraries needed compilation known import libraries unlike unix world uses different file extensions linking codice_23 file windows one must first know regular static library import library latter case codice_24 file must present run time | [
7149,
1460,
2924,
26,
2928,
1435,
7182,
5747,
1478,
5757,
5760,
2953,
1495,
4366,
5782,
5784,
5786,
5794,
5800,
1523,
5803,
1526,
97,
1532,
108,
1554,
7263,
1557,
1559,
3021,
1564,
130,
5842,
1582,
150,
7298,
3052,
4448,
1598,
7310,
174... | Validation |
1,990 | 9 | Dynamic_compilation:dynamic compilation dynamic compilation process used programming language implementations gain performance program execution although technique originated self best-known language uses technique java since machine code emitted dynamic compiler constructed optimized program runtime use dynamic compilation enables optimizations efficiency available compiled programs except code duplication metaprogramming runtime environments using dynamic compilation typically programs run slowly first minutes compilation recompilation done runs quickly due initial performance lag dynamic compilation undesirable certain cases implementations dynamic compilation optimizations could done initial compile time delayed compilation run-time causing unnecessary slowdowns just-in-time compilation form dynamic compilation closely related technique incremental compilation incremental compiler used pop-2 pop-11 forth versions lisp e.g maclisp least one version ml programming language poplog ml requires compiler programming language part runtime system consequence source code read time terminal file possibly data-structure constructed running program translated machine code block function may replace previous function name immediately available use program need speed compilation interactive development testing compiled code likely heavily optimised code produced standard 'batch compiler reads source code produces object files subsequently linked run however incrementally compiled program typically run much faster interpreted version program incremental compilation thus provides mixture benefits interpreted compiled languages aid portability generally desirable incremental compiler operate two stages namely first compiling intermediate platform-independent language compiling machine code host machine case porting requires changing 'back end compiler unlike dynamic compilation defined incremental compilation involve optimisations program first run | [
5012,
6982,
1361,
6002,
5218,
1370,
1854,
4525,
7474,
2420,
5771,
5606,
4543,
3749,
6778,
352,
5190,
4286
] | Test |
1,991 | 3 | Menuconfig:menuconfig codice_1 one five similar tools configure linux source necessary early step needed compile source code codice_1 menu-driven user interface allows user choose features linux options compiled normally invoked using command codice_1 menuconfig target linux makefile codice_1 first version linux predecessor tool question-and-answer-based utility codice_5 codice_6 third tool linux configuration codice_7 requires qt also codice_8 uses gtk+ codice_9 similar codice_1 tools use kconfig language internally kconfig also used projects das u-boot bootloader embedded devices buildroot tool generating embedded linux systems busybox single-executable shell utility toolbox embedded systems despite simple design codice_1 offers considerable advantages question-and-answer-based configuration tool codice_6 notable basic search system ability load save files filenames different “ codice_13 ” codice_1 gives user ability navigate forwards backwards directly features rather using codice_5 pressing key many many times navigate linearly configuration specific feature user satisfied previous codice_13 file using codice_6 uses previous file answer questions interactively presenting new features intended version upgrade may appropriate times codice_1 light load system resources unlike codice_7 uses qt version 2.6.31.1 formerly tk codice_8 utilizes gtk+ possible ignore features codice_5 makes likely one configure incomplete oversized kernel recommended start codice_13 file included linux distribution makes easier configure custom kernel better editing codice_13 hand codice_1 shows descriptions feature adds primitive version 2.6.31.1 dependency checking make oldconfig dependency checking done one step requires user locate features changed hand sure needed ones still enabled practically using codice_1 codice_6 diff also cvs decent text editor provides flexibility dependability configuring linux significant labor users strongly advised make backups i.e codice_27 help information distributed throughout kernel source tree various files called kconfig use codice_1 linux source requirement make tool c compiler ncurses library left features setting empty enclosed two punctuation marks note supplied dependency information primitive tell names depentant features user encouraged read linux readme since also many make targets beyond modules_install install configure kernel different features activated using different interactive interface | [
362,
3256,
2182,
3613,
7528,
7532,
5744,
6443,
2942,
6117,
4341,
5059,
5762,
412,
415,
3666,
2970,
7956,
1155,
5453,
5460,
7242,
1535,
1924,
6892,
1176,
1933,
5829,
1208,
6211,
4435,
5865,
7669,
3404,
1227,
1596,
165,
7312,
1607,
5884,
... | Test |
1,992 | 2 | Booting:booting computing booting process starting computer initiated hardware button press software command switched computer central processing unit cpu software main memory process must load software memory executed may done hardware firmware cpu separate processor computer system restarting computer also called rebooting hard e.g electrical power cpu switched soft power cut systems soft boot may optionally clear ram zero hard soft booting initiated hardware button press software command booting complete operative runtime system typically operating system applications attained process returning computer state hibernation sleep involve booting minimally embedded systems require noticeable boot sequence begin functioning turned may simply run operational programs stored rom computing systems state machines reboot may method return designated zero-state unintended locked state addition loading operating system stand-alone utility boot process also load storage dump program diagnosing problems operating system boot short bootstrap bootstrap load derives phrase pull oneself one bootstraps usage calls attention requirement software loaded onto computer software already running computer mechanism must exist load initial software onto computer early computers used variety ad-hoc methods get small program memory solve problem invention read-only memory rom various types solved paradox allowing computers shipped start program could erased growth capacity rom allowed ever elaborate start procedures implemented many different methods available load short initial program computer methods reach simple physical input removable media hold complex programs early computers 1940s 1950s one-of-a-kind engineering efforts could take weeks program program loading one many problems solved early computer eniac program stored memory set problem configuration interconnecting cables bootstrapping apply eniac whose hardware configuration ready solving problems soon power applied edsac system second stored-program computer built used stepping switches transfer fixed program memory start button pressed program stored device david wheeler completed late 1948 loaded instructions punched tape executed first programmable computers commercial sale univac ibm 701 included features make operation simpler typically included instructions performed complete input output operation hardware logic could used load contents punch card typical ones input media magnetic drum magnetic tape contained bootstrap program pressing single button booting concept called variety names ibm computers 1950s early 1960s ibm used term initial program load ibm 7030 stretch later used mainframe lines starting system/360 1964 ibm 701 computer 1952–1956 load button initiated reading first 36-bit word main memory punched card card reader magnetic tape tape drive magnetic drum unit depending position load selector switch left 18-bit half-word executed instruction usually read additional words memory loaded boot program executed turn loaded larger program medium memory without help human operator term boot used sense since least 1958 ibm computers era similar features example ibm 1401 system c. 1958 used card reader load program punched card 80 characters stored punched card read memory locations 001 080 computer would branch memory location 001 read first stored instruction instruction always move information first 80 memory locations assembly area information punched cards 2 3 4 could combined form stored program information moved assembly area machine would branch instruction location 080 read card next card would read information processed another example ibm 650 1953 decimal machine group ten 10-position switches operator panel addressable memory word address 8000 could executed instruction thus setting switches 7004000400 pressing appropriate button would read first card card reader memory op code 70 starting address 400 jump 400 begin executing program card ibm competitors also offered single button program load noteworthy variation found burroughs b1700 neither bootstrap rom hardwired ipl operation instead system reset reads executes opcodes sequentially tape drive mounted front panel sets boot loader ram executed however since makes assumptions system equally well used load diagnostic maintenance test routine tapes display intelligible code front panel even cases gross cpu failure ibm system/360 successors including current z/architecture machines boot process known initial program load ipl ibm coined term 7030 stretch revived design system/360 continues use environments today system/360 processors ipl initiated computer operator selecting three hexadecimal digit device address cuu c=i/o channel address uu=control unit device address followed pressing load button high end system/360 models system/370 later systems functions switches load button simulated using selectable areas screen graphics console often ibm 2250-like device ibm 3270-like device example system/370 model 158 keyboard sequence 0-7-x zero seven x order results ipl device address keyed input area amdahl 470v/6 related cpus supported four hexadecimal digits cpus optional second channel unit installed total 32 channels later ibm would also support 16 channels ipl function system/360 successors compatibles amdahl reads 24 bytes operator-specified device main storage starting real address zero second third groups eight bytes treated channel command words ccws continue loading startup program first ccw always simulated cpu consists read ipl command command chaining suppress incorrect length indication enforced i/o channel commands complete first group eight bytes loaded processor program status word psw startup program begins execution location designated psw ipl device usually disk drive hence special significance read-type command exactly procedure also used ipl input-type devices tape drives even card readers device-independent manner allowing example installation operating system brand-new computer os initial distribution magnetic tape disk controllers command also causes selected device seek cylinder head simulating seek cylinder head command search record simulating search id equal command seeks searches simulated tape card controllers device classes command simply sequential read command read ipl command disk tape card deck must contain special program load actual operating system standalone utility main storage specific purpose ipl text placed disk stand-alone dasdi direct access storage device initialization program equivalent program running operating system e.g. ickdsf ipl-able tapes card decks usually distributed ipl text already present minicomputers starting digital equipment corporation dec pdp-5 pdp-8 1965 simplified design using cpu assist input output operations saved cost made booting complicated pressing single button minicomputers typically way toggle short programs manipulating array switches front panel since early minicomputers used magnetic core memory lose information power bootstrap loaders would remain place unless erased erasure sometimes happened accidentally program bug caused loop overwrote memory minicomputers simple form booting include hewlett-packard hp 2100 series mid-1960s original data general nova 1969 dec pdp-11 1970 dec later added optional diode matrix read-only memory pdp-11 stored bootstrap program 32 words 64 bytes consisted printed circuit card m792 plugged unibus held 32 16 array semiconductor diodes 512 diodes place memory contained one bits card programmed cutting diode whose bit zero dec also sold versions card bm792-yx series pre-programmed many standard input devices simply omitting unneeded diodes following older approach earlier pdp-1 hardware loader operator need push load switch instruct paper tape reader load program directly core memory data general supernova used front panel switches cause computer automatically load instructions memory device specified front panel data switches jump loaded code nova 800 1200 switch loaded program main memory special read-only memory jumped minicomputer paper tape reader first program run boot process boot loader would read core memory either second-stage boot loader often called binary loader could read paper tape checksum operating system outside storage medium pseudocode boot loader might simple following eight instructions related example based loader nicolet instrument corporation minicomputer 1970s using paper tape reader-punch unit teletype model 33 asr teleprinter bytes second-stage loader read paper tape reverse order length second stage loader final byte overwrites location 7 instruction location 6 executes location 7 starts second stage loader executing second stage loader waits much longer tape containing operating system placed tape reader difference boot loader second stage loader addition checking code trap paper tape read errors frequent occurrence relatively low-cost part-time-duty hardware teletype model 33 asr friden flexowriters far reliable also comparatively costly earliest microcomputers altair 8800 released first 1975 even earlier similar machine based intel 8008 cpu bootstrapping hardware started cpu would see memory would contain executable code containing binary zeros—memory cleared resetting powering front panels machines carried toggle switches entering addresses data one switch per bit computer memory word address bus simple additions hardware permitted one memory location time loaded switches store bootstrap code meanwhile cpu kept attempting execute memory content correctly loaded cpu enabled execute bootstrapping code process tedious error-free boot process minicomputers microcomputers revolutionized introduction integrated circuit read-only memory rom many variants including mask-programmed roms programmable roms prom erasable programmable roms eprom flash memory allowed firmware boot programs included part computer introduction external rom italian telephone switching elaborator called gruppi speciali patented 1975 alberto ciaramella researcher cselt gruppi speciali starting 1975 fully single-button machine booting operating system rom memory composed semiconductors ferrite cores although rom device natively embedded computer gruppi speciali due design machine also allowed single-button rom booting machines designed therefore bootstrap device architecture-independent e.g pdp-11 storing state machine switch-off also place another critical feature telephone switching contest typically every microprocessor reset power-on condition perform start-up process usually takes form begin execution code found starting specific address look multibyte code specific address jump indicated location begin execution system built using microprocessor permanent rom occupying special locations system always begins operating without operator assistance example intel x86 processors always start running instructions beginning f000 fff0 mos 6502 processor initialization begins reading two-byte vector address fffd ms byte fffc ls byte jumping location run bootstrap code apple inc. first computer apple 1 introduced 1976 featured prom chips eliminated need front panel boot process case altair 8800 commercial computer according apple ad announcing switches lights ... firmware proms enables enter display debug programs hex keyboard due expense read-only memory time apple ii series booted disk operating systems using series small incremental steps passing control onward next phase gradually complex boot process see apple dos boot loader little disk operating system relied rom hardware also extremely flexible supported wide range customized disk copy protection mechanisms see software cracking history operating systems notably pre-1995 macintosh systems apple closely interwoven hardware impossible natively boot operating system standard one opposite extreme scenario using switches mentioned highly inflexible relatively error-proof foolproof long hardware working normally common solution situations design boot loader works program belonging standard os hijacks system loads alternative os technique used apple a/ux unix implementation copied various freeware operating systems beos personal edition 5 machines like atari st microcomputer instant-on operating system executing rom retrieval os secondary tertiary store thus eliminated one characteristic operations bootstrapping allow system customizations accessories support software loaded automatically atari floppy drive read additional components boot process timeout delay provided time manually insert floppy system searched extra components could avoided inserting blank disk atari st hardware also designed cartridge slot could provide native program execution gaming purposes holdover atari legacy making electronic games inserting spectre gcr cartridge macintosh system rom game slot turning atari could natively boot macintosh operating system rather atari tos ibm personal computer included rom-based firmware called bios one functions firmware perform power-on self test machine powered read software boot device execute firmware compatible bios ibm personal computer used ibm pc compatible computers extensible firmware interface developed intel originally itanium-based machines later also used alternative bios x86-based machines including apple macs using intel processors unix workstations originally vendor-specific rom-based firmware sun microsystems later developed openboot later known open firmware incorporated forth interpreter much firmware written forth standardized ieee ieee standard 1275-1994 firmware implements standard used powerpc-based macs powerpc-based machines well sun sparc-based computers advanced risc computing specification defined another firmware standard implemented mips-based alpha-based machines sgi visual workstation x86-based workstations computer turned softwareincluding operating systems application code dataremains stored non-volatile memory computer powered typically operating system loader random-access memory ram computer first executes relatively small program stored read-only memory rom along small amount needed data access nonvolatile device devices operating system programs data loaded ram small program starts sequence known bootstrap loader bootstrap boot loader small program job load data programs executed ram often multiple-stage boot loaders used several programs increasing complexity load one process chain loading computer systems upon receiving boot signal human operator peripheral device may load small number fixed instructions memory specific location initialize least one cpu point cpu instructions start execution instructions typically start input operation peripheral device may switch-selectable operator systems may send hardware commands directly peripheral devices i/o controllers cause extremely simple input operation read sector zero system device memory starting location 1000 carried effectively loading small number boot loader instructions memory completion signal i/o device may used start execution instructions cpu smaller computers often use less flexible automatic boot loader mechanisms ensure computer starts quickly predetermined software configuration many desktop computers example bootstrapping process begins cpu executing software contained rom example bios ibm pc predefined address cpus including intel x86 series designed execute software reset without outside help software contains rudimentary functionality search devices eligible participate booting load small program special section commonly boot sector promising device typically starting fixed entry point start sector boot loaders may face peculiar constraints especially size instance ibm pc compatibles boot sector typically work 32 kb later relaxed 64 kb system memory use instructions supported original 8088/8086 processors first stage pc boot loaders fsbl first-stage boot loader located fixed disks removable drives must fit first 446 bytes master boot record order leave room default 64-byte partition table four partition entries two-byte boot signature bios requires proper boot loader — even less additional features like four partition entries 16 16 bytes disk signature 6 bytes disk timestamp 6 bytes advanced active partition 18 bytes special multi-boot loaders supported well environments floppy superfloppy volume boot records 59 bytes occupied extended bios parameter block fat12 fat16 volumes since dos 4.0 whereas fat32 ebpb introduced dos 7.1 requires even 87 bytes leaving 423 bytes boot loader assuming sector size 512 bytes microsoft boot sectors therefore traditionally imposed certain restrictions boot process example boot file located fixed position root directory file system stored consecutive sectors conditions taken care codice_1 command slightly relaxed later versions dos boot loader able load first three sectors file memory happened contain another embedded boot loader able load remainder file memory microsoft added lba fat32 support even switched boot loader reaching two physical sectors using 386 instructions size reasons time vendors managed squeeze much functionality single boot sector without relaxing original constraints minimal available memory 32 kb processor support 8088/8086 example dr-dos boot sectors able locate boot file fat12 fat16 fat32 file system load memory whole via chs lba even file stored fixed location consecutive sectors examples first-stage bootloaders include coreboot libreboot das u-boot second-stage boot loaders gnu grub bootmgr syslinux ntldr bootx operating systems able load operating system properly transfer execution operating system subsequently initializes may load extra device drivers second-stage boot loader need drivers operation may instead use generic storage access methods provided system firmware bios open firmware though typically restricted hardware functionality lower performance many boot loaders like gnu grub windows bootmgr windows nt/2000/xp ntldr configured give user multiple booting choices choices include different operating systems dual multi-booting different partitions drives different versions operating system case new version unexpected problems different operating system loading options e.g. booting rescue safe mode standalone programs function without operating system memory testers e.g. memtest86+ basic shell gnu grub even games see list pc booter games boot loaders also load boot loaders example grub loads bootmgr instead loading windows directly usually default choice preselected time delay user press key change choice delay default choice automatically run normal booting occur without interaction boot process considered complete computer ready interact user operating system capable running system programs application programs many embedded systems must boot immediately example waiting minute digital television gps navigation device start generally unacceptable therefore devices software systems rom flash memory device begin functioning immediately little loading necessary loading precomputed stored rom device made large complex systems may boot procedures proceed multiple phases finally operating system programs loaded ready execute operating systems designed never start stop boot loader might load operating system configure mere process within system irrevocably transfer control operating system boot loader terminates normally process would computers also capable booting computer network scenario operating system stored disk server certain parts transferred client using simple protocol trivial file transfer protocol tftp parts transferred operating system takes control booting process second-stage boot loader network booting begins using generic network access methods provided network interface boot rom typically contains preboot execution environment pxe image drivers required system functionality limited operating system kernel drivers transferred started result rom-based booting completed entirely possible network boot operating system ability use network interface boot device device operating system loaded modern pc uefi bios firmware supports booting various devices typically local solid state drive hard disk drive via gpt master boot record mbr drive disk optical disc drive using el torito usb mass storage device ftl-based flash drive sd card multi-media card slot hard disk drive optical disc drive etc network interface card using pxe older less common bios-bootable devices include floppy disk drives scsi devices zip drives ls-120 drives typically firmware uefi bios allow user configure boot order boot order set first dvd drive second hard disk drive firmware try boot dvd drive fails e.g dvd drive try boot local hard disk drive example pc windows xp installed hard drive user could set boot order one given insert linux live cd order try linux without install operating system onto hard drive example dual booting user chooses operating system start computer performed power-on self-test post example dual booting user chooses inserting removing cd computer common choose operating system boot selecting bios uefi boot menu using computer keyboard boot menu typically entered pressing keys post several devices available enable user quick-boot usually variant linux various simple tasks internet access examples splashtop latitude upon starting ibm-compatible personal computer x86 cpu executes real mode instruction located reset vector physical memory address 16-bit x86 processors 32-bit 64-bit x86 processors usually pointing firmware uefi bios entry point inside rom memory location typically contains jump instruction transfers execution location firmware uefi bios start-up program program runs power-on self-test post check initialize required devices dram pci bus including running embedded roms complicated step setting dram spi made difficult fact point memory limited initializing required hardware firmware uefi bios goes pre-configured list non-volatile storage devices boot device sequence finds one bootable bootable mbr device defined one read last two bytes first sector contain little-endian word found byte sequence disk also known mbr boot signature otherwise established code inside sector executable x86 pcs bios found bootable device loads boot sector linear address usually segment offset bioses erroneously use transfers execution boot code case hard disk referred master boot record mbr definition operating-system specific conventional mbr code checks mbr partition table partition set bootable one active flag set active partition found mbr code loads boot sector code partition known volume boot record vbr executes vbr often operating-system specific however operating systems main function load execute operating system kernel continues startup active partition active partition boot sector invalid mbr may load secondary boot loader select partition often via user input load boot sector usually loads corresponding operating system kernel cases mbr may also attempt load secondary boot loaders trying boot active partition else fails issue int 18h bios interrupt call followed int 19h case int 18h would return order give back control bios would attempt boot devices attempt remote boot via network invoke rom basic systems particularly newer macintoshes new editions microsoft windows use intel efi also coreboot allows computer boot without firmware/bios constantly running system management mode 16-bit bios interfaces required certain x86 operating systems dos windows 3.1/95/98 booted via uefi however boot loaders retain 16-bit bios call support modern cpus microcontrollers example ti omap sometimes even dsps may boot rom boot code integrated directly silicon processor could perform quite sophisticated boot sequence load boot programs various sources like nand flash sd mmc card difficult hardwire required logic handling devices integrated boot rom used instead scenarios boot rom usage enables flexible boot sequences hardwired logic could provide example boot rom could try perform boot multiple boot sources also boot rom often able load boot loader diagnostic program via serial interfaces like uart spi usb feature often used system recovery purposes reasons usual boot software non-volatile memory got erased could also used initial non-volatile memory programming clean non-volatile memory installed hence software available system yet embedded system designs may also include intermediary boot sequence step form additional code gets loaded system ram integrated boot rom additional code loaded way usually serves way overcoming platform limitations small amounts ram dedicated primary boot loader das u-boot loaded next step system boot sequence additional code boot sequence step usually referred secondary program loader spl also possible take control system using hardware debug interface jtag interface may used write boot loader program bootable non-volatile memory e.g flash instructing processor core perform necessary actions program non-volatile memory alternatively debug interface may used upload diagnostic boot code ram start processor core instruct execute uploaded code allows example recovery embedded systems software remains supported boot device processor integrated boot rom jtag standard popular interface many cpus microcontrollers devices manufactured jtag interfaces 2009 microcontrollers provide special hardware interfaces used take arbitrary control system directly run code instead allow insertion boot code bootable non-volatile memory like flash memory via simple protocols manufacturing phase interfaces used inject boot code possibly code non-volatile memory system reset microcontroller begins execute code programmed non-volatile memory like usual processors using roms booting notably technique used atmel avr microcontrollers others well many cases interfaces implemented hardwired logic cases interfaces could created software running integrated on-chip boot rom gpio pins digital signal processors serial mode boot parallel mode boot host port interface hpi boot case dsps often second microprocessor microcontroller present system design responsible overall system behavior interrupt handling dealing external events user interface etc dsp dedicated signal processing tasks systems dsp could booted another processor sometimes referred host processor giving name host port processor also sometimes referred master since usually boots first memories controls overall system behavior including booting dsp controlling dsp behavior dsp often lacks boot memories relies host processor supply required code instead notable systems design cell phones modems audio video players dsp cpu/microcontroller co-existing many fpga chips load configuration external serial eeprom configuration rom power-up | [
1807,
362,
4291,
6073,
1442,
710,
4297,
5021,
13,
3271,
3276,
2204,
6807,
732,
5041,
7546,
7550,
5401,
6823,
405,
1855,
5055,
2226,
6119,
1864,
4347,
6131,
65,
5079,
771,
4366,
4733,
74,
6853,
5784,
5440,
4740,
5088,
6500,
785,
2266,
... | Test |
1,993 | 4 | Phoraging:phoraging field computer security phoraging pronounced foraging defined process collecting data many different online sources build identity someone ultimate aim committing identity theft along phishing pharming third p cybercrime phoraging concept similar many ways phishing pharming information diving similar mosaic theory finance phoraging searching information usually aim identity theft whereby criminal collects data variety different online sources build identity consumer commit identity theft crooks phorage information variety different sources including social networking sites public records phishing attacks confidential information submitted unsecured way websites well computer viruses spyware put data together guess passwords answers security questions ultimate aim stealing money pc pro referred concept january 2009 issue security vendor verisign also use refer term uk office fair trading defines phoraging tactic used fraudsters aggregate personal information multiple sources intent misusing individual identity tactic known 'phoraging | [
7630,
3480,
5309,
1805
] | Test |
1,994 | 2 | OS/VS2_(SVS):os/vs2 svs single virtual storage svs refers release 1 operating system/virtual storage 2 os/vs2 successor system mvt option operating system/360 os/vs2 svs stopgap measure pending availability mvs although ibm provided support enhancements svs long shipping mvs svs provides single 16mib address space shared tasks system regardless size physical memory os/360 used interval timer feature providing time day triggering time-dependent events support s/370 made limited use new timing facilities retained dependency interval timer svs uses tod clock clock comparator cpu timer exclusively wake applied data research lawsuit ibm decided although clear whether lawsuit actually deciding factor result svs include sort/merge program language processor new assembler xf replacing assembler f required system generation process authorized program facility apf new facility limited use certain dangerous services programs authorized link edited ac 1 loaded link list lpa sys1.svclib mvs ibm enhanced facility allow installation designate additional data sets authorized reader/interpreter svs runs pageable storage much less benefit automatic sysin batching asb reader svs include os/360 facility called direct sysout dso whereby specific output classes could diverted data sets tape instead normal spool datasets dasd prices dropped facility dropped use svs provide os/360 provided limited interactive facilities conversational remote job entry crje graphic job processing gjp interactive terminal facility itf satellite graphic job processing sgjp prior time sharing option tso ibm carry forward svs tso continues provide equivalent facilities except support use 2250 terminal use 2250 batch job using graphics access method gam graphics subroutine package gsp remains supported os/360 included batch debugging facility named testran clumsier equivalent facility ibsys/ibjob used much advent tso testran became even less relevant svs include dynamic support system dss new os/vs debugging facility system software remained available selectable unit 64 mvs/system extensions release 2 storage key facility system/360 system/370 keeps track page frame modified machine check handler mch svs correct parity ecc error unmodified page unassigning damaged page frame marking page table entry cause pagein operation newly assigned page table replaces special handling refreshable transient svc routines os/360 svs expands size error recovery procedure erp transient area none processors svs runs equivalent 2361 large core storage lcs thus need hierarchy support svs provide svs also dropped support obsolete i/o equipment os/360 load modules could permanently loaded initial program load ipl time area real storage known link pack area lpa svs lpa split three areas searched turn os/360 support multiprocessor version 360/65 svs provide equivalent support customers wanting run multiprocessor system/370 use mvs os/360 introduced telecommunications access method tcam successor queued telecommunications access method qtam svs include qtam svs include remote job entry rje however asp hasp provide comparable facilities larger 16 mib address space svs provides less external fragmentation mvt rollin/rollout would provide less benefit svs include os/360 transient svc routines loaded 1 kib areas known svc transient areas considerable amount code required manage svs svc routines preloaded virtual storage svc transient areas svs retains spool support os/360 shops used asp hasp precursors jes2 jes3 storage management svs similar mvt notable differences description somewhat simplified glosses special cases svs 16mib addressable storage single address space regardless size physical memory nucleus flpa virtual=real v=r meaning virtual address area mapped corresponding physical address job step svs request v=r storage assigned pages v=r region mapped corresponding real page frames program check occurs interrupt code 16 17 svs checks whether page assigned virtual address svs assign page frame read contents page page assigned svs causes abnormal end abend abend code 0c4 mvt would used protection violation svs provides services page fixing unfixing page fixed page frame subject page stealing primary purpose page fixing i/o i/o channels s/370 successors ability address translation however part support virtual storage operating systems ibm provided indirect data address ida feature channel control word ccw ida bit set points ida list idal rather directly i/o buffer svs provides ccw translation service part execute channel program excp svc excp necessary page fixing allocate storage ida lists translate virtual addresses real put translated addresses appropriate ida words put real addresses ida lists translated ccw i/o completes excp reverses process freeing storage translating status back virtual addition svs provides execute channel program real storage excvr svc privileged applications paged fixing build ida lists ibm provided several enhancements svs shipped part included | [
7605,
4291,
7331,
6518,
4670,
6705,
8066,
8173,
6094,
7172,
299,
5481,
5571,
5041,
4695,
7264,
4421,
5396,
7003,
7546,
3874,
402,
1992,
839,
4428,
2769,
5764,
850,
2596,
5244,
3905,
2786,
607,
2431,
3664,
4544,
4366,
6849,
3233,
7040,
3... | Test |
1,995 | 3 | Comparison_of_ARM_cores:comparison arm cores comparison microarchitectures based arm family instruction sets designed arm holdings 3rd parties sorted version arm instruction set release name cores implement arm instruction set developed independently companies architectural license arm | [
6082,
6421,
7890,
722,
2926,
5740,
5750,
5752,
5405,
5406,
1864,
67,
446,
451,
6165,
463,
804,
5472,
469,
4041,
3008,
3365,
6910,
7654,
6919,
1977,
2339,
2711,
550,
4847,
3786,
5576,
7364,
1284,
4879,
7376,
5585,
4537,
950,
4197,
5622,
... | Validation |
1,996 | 4 | Badlock:badlock badlock security bug disclosed april 12 2016 affecting security account manager sam local security authority domain policy lsad remote protocols supported windows samba servers sam lsad layered onto dce 1.1 remote procedure call dce/rpc protocol implemented samba windows rpc services allowed attacker become man middle although vulnerability discovered development samba namegiving smb protocol affected | [
704,
3932,
2912,
376,
3277,
2923,
2587,
3323,
5779,
7600,
4025,
1528,
4759,
2991,
1173,
6526,
6904,
6541,
6194,
2678,
3726,
3038,
3047,
6569,
2693,
862,
7307,
6589,
5187,
3426,
7328,
208,
2021,
5922,
6628,
924,
4531,
600,
1307,
2800,
63... | Test |
1,997 | 9 | Non-local_variable:non-local variable programming language theory non-local variable variable defined local scope term refer global variables primarily used context nested anonymous functions variables neither local global scope lua called upvalues function python 3 example follows nested function codice_1 defined scope another function codice_2 variable codice_3 local codice_2 non-local codice_1 global javascript locality variable determined closest codice_6 statement variable following example codice_3 local codice_2 contains codice_9 statement codice_1 n't therefore x non-local codice_1 haskell example follows variable codice_12 non-local anonymous function codice_13 non-local variables primary reason difficult support nested anonymous higher-order thereby first-class functions programming language nested function functions mutually recursive becomes hard compiler know exactly call stack non-local variable allocated frame pointer points local variable nested function arbitrary number activation records stack generally solved using access links display registers nested function passed argument higher-order function closure needs built order locate non-local variables nested function returned result outer function stored variable non-local variables longer available stack need heap allocated instead lifetime extend beyond lifetime outer function declared allocated generally requires garbage-collection | [
790,
1361,
622,
3368,
6275,
7385,
7333,
3895,
4039,
6614
] | Test |
1,998 | 4 | Information_privacy:information privacy information privacy relationship collection dissemination data technology public expectation privacy legal political issues surrounding also known data privacy data protection challenge data privacy use data protecting individual privacy preferences personally identifiable information fields computer security data security information security design use software hardware human resources address issue various types personal information often come privacy concerns describes ability control information one reveals oneself cable television access information example third parties track ip tv programs someone watched given time addition information broadcasting stream required audience rating survey additional devices requested installed houses viewers listeners without necessity cooperations audience ratings automatically performed real-time united kingdom 2012 education secretary michael gove described national pupil database rich dataset whose value could maximised making openly accessible including private companies kelly fiveash register said could mean child school life including exam results attendance teacher assessments even characteristics could available third-party organizations responsible anonymizing publications rather data anonymized government handed example data request gove indicated rejected past might possible improved version privacy regulations analysis sexual exploitation information person financial transactions including amount assets positions held stocks funds outstanding debts purchases sensitive criminals gain access information person accounts credit card numbers person could become victim fraud identity theft information person purchases reveal great deal person history places he/she visited he/she contacted products he/she used his/her activities habits medications he/she used cases corporations may use information target individuals marketing customized towards individual personal preferences person may may approve ability control information one reveals oneself internet access information become growing concern concerns include whether email stored read third parties without consent whether third parties continue track websites someone visited another concern websites visited collect store possibly share personally identifiable information users advent various search engines use data mining created capability data individuals collected combined wide variety sources easily ftc provided set guidelines represent widely accepted concepts concerning fair information practices electronic marketplace called fair information practice principles order give away much personal information emails encrypted browsing web pages well online activities done trace-less via anonymizers case trusted open-source distributed anonymizers called mix nets i2p tor – onion router vpns virtual private networks another anonymizer used give someone protection online includes obfuscating encrypting web traffic groups see mine email n't internet content privacy concerns age increasing amounts information going online social networking sites pose additional privacy challenges people may tagged photos valuable information exposed either choice unexpectedly others data location also accidentally published example someone posts picture store background caution exercised information posted social networks vary allow users make private remains publicly accessible without strong security settings place careful attention remains public person profiled searching collecting disparate pieces information worst case leading cases cyberstalking reputational damage location tracking capabilities mobile devices advancing location-based services problems related user privacy arise location data among sensitive data currently collected list potentially sensitive professional personal information could inferred individual knowing mobility trace published recently electronic frontier foundation include movements competitor sales force attendance particular church individual presence motel abortion clinic recent mit study de montjoye et al showed four spatio-temporal points approximate places times enough uniquely identify 95 1.5 million people mobility database study shows constraints hold even resolution dataset low therefore even coarse blurred datasets provide little anonymity people may wish medical records revealed others may concern might affect insurance coverages employment may would wish others know medical psychological conditions treatments would bring embarrassment upon revealing medical data could also reveal details one personal life three major categories medical privacy informational degree control personal information physical degree physical inaccessibility others psychological extent doctor respects patients ’ cultural beliefs inner thoughts values feelings religious practices allows make personal decisions physicians psychiatrists many cultures countries standards doctor–patient relationships include maintaining confidentiality cases physician–patient privilege legally protected practices place protect dignity patients ensure patients feel free reveal complete accurate information required receive correct treatment view united states laws governing privacy private health information see hipaa hitech act political privacy concern since voting systems emerged ancient times secret ballot simplest widespread measure ensure political views known anyone voters themselves—it nearly universal modern democracy considered basic right citizenship fact even rights privacy exist type privacy often unfortunately several forms voting fraud privacy violations possible use digital voting machines legal protection right privacy general – data privacy particular – varies greatly around world laws regulations related privacy data protection constantly changing seen important keep abreast changes law continually reassess compliance data privacy security regulations within academia institutional review boards function assure adequate measures taken ensure privacy confidentiality human subjects research privacy concerns exist wherever personally identifiable information sensitive information collected stored used finally destroyed deleted – digital form otherwise improper non-existent disclosure control root cause privacy issues data privacy issues may arise response information wide range sources heterogeneous information systems differing privacy rules interconnected information shared policy appliances required reconcile enforce monitor increasing amount privacy policy rules laws two categories technology address privacy protection commercial systems communication enforcement internet many users give away lot information unencrypted e-mails read administrators e-mail server connection encrypted https also internet service provider parties sniffing network traffic connection able know contents applies kind traffic generated internet including web browsing instant messaging others order give away much personal information e-mails encrypted browsing webpages well online activities done traceless via anonymizers open source distributed anonymizers so-called mix networks well known open-source mix nets include i2p – anonymous network tor computer privacy improved individualization currently security messages designed average user i.e message everyone researchers posited individualized messages security nudges crafted based users individual differences personality traits used improvements person compliance computer security privacy united states department commerce created international safe harbor privacy principles certification program response 1995 directive data protection directive 95/46/ec european commission directive 95/46/ec declares chapter iv article 25 personal data may transferred countries european economic area countries provide adequate privacy protection historically establishing adequacy required creation national laws broadly equivalent implemented directive 95/46/eu although exceptions blanket prohibition – example disclosure country outside eea made consent relevant individual article 26 1 – limited practical scope result article 25 created legal risk organisations transfer personal data europe united states program regulates exchange passenger name record information eu us according eu directive personal data may transferred third countries country provides adequate level protection exceptions rule provided instance controller guarantee recipient comply data protection rules european commission set working party protection individuals regard processing personal data commonly known article 29 working party working party gives advice level protection european union third countries working party negotiated u.s. representatives protection personal data safe harbor principles result notwithstanding approval self-assessment approach safe harbor remains controversial number european privacy regulators commentators safe harbor program addresses issue following way rather blanket law imposed organisations united states voluntary program enforced ftc u.s. organisations register program self-assessed compliance number standards deemed adequate purposes article 25 personal information sent organisations eea without sender breach article 25 eu national equivalents safe harbor approved providing adequate protection personal data purposes article 25 6 european commission 26 july 2000 safe harbor adoptee organisations need carefully consider compliance onward transfer obligations personal data originating eu transferred us safe harbor onward third country alternative compliance approach binding corporate rules recommended many eu privacy regulators resolves issue addition dispute arising relation transfer hr data us safe harbor must heard panel eu privacy regulators july 2007 new controversial passenger name record agreement us eu made short time afterwards bush administration gave exemption department homeland security arrival departure information system adis automated target system 1974 privacy act february 2008 jonathan faull head eu commission home affairs complained us bilateral policy concerning pnr us signed february 2008 memorandum understanding mou czech republic exchange visa waiver scheme without concerting brussels tensions washington brussels mainly caused lesser level data protection us especially since foreigners benefit us privacy act 1974 countries approached bilateral mou included united kingdom estonia germany greece | [
7151,
367,
1344,
5806,
3609,
2548,
6515,
803,
2727,
1726,
6974,
5641,
5908,
1081,
6986,
1935,
5297,
7447,
6438,
2566,
3794,
3973,
2489,
5150,
6653,
591,
5509,
6219,
1972,
1409,
6574,
1231,
533,
2973,
4014,
4278,
7315,
1805
] | Test |
1,999 | 9 | James_Cordy:james cordy james reginald cordy born january 2 1950 canadian computer scientist educator professor school computing queen university researcher currently active fields source code analysis manipulation software reverse re-engineering pattern analysis machine intelligence long record previous work programming languages compiler technology software architecture currently best known work txl source transformation language parser-based framework functional programming language designed support software analysis transformation tasks originally developed m.sc student charles halpern-hamu 1985 tool experimenting programming language design recent work nicad clone detector ph.d. student chanchal roy recognition strategy language ph.d. student richard zanibbi dorothea blostein cerno lightweight natural language understanding system john mylopoulos others university trento simone model clone detector manar alalfi thomas r. dean matthew stephan andrew stevenson based txl 1995 paper syntactic theory software architecture ph.d. student thomas r. dean widely cited seminal work area led work thomas r. dean kevin a. schneider andrew j. malton legacy systems analysis work programming languages included design concurrent euclid 1980 turing 1983 r.c holt implementation euclid 1978 sp/k 1974 languages r.c holt d.b wortman d.t barnard others part projects developed s/sl compiler technology r.c holt d.b wortman based m.sc thesis work orthogonal code generation method based ph.d. thesis work co-authored co-edited books turing programming language design definition 1988 introduction compiler construction using s/sl 1986 smart internet 2010 personal web 2013 2002 2007 director queen school computing 2008 elected distinguished scientist association computing machinery prolific academic supervisor 2008 recognized queen university award excellence graduate supervision 2016 queen university prize excellence research | [
7784,
2005
] | Test |
2,000 | 3 | AVX-512:avx-512 avx-512 512-bit extensions 256-bit advanced vector extensions simd instructions x86 instruction set architecture isa proposed intel july 2013 supported intel xeon phi x200 knights landing skylake-x cpus includes core-x series excluding core i5-7640x core i7-7740x well new xeon scalable processor family xeon d-2100 embedded series avx-512 first 512-bit simd instruction set intel introduced processors earlier 512-bit simd instructions used xeon phi coprocessors derived intel larrabee project similar binary compatible partially source compatible avx-512 consists multiple extensions meant supported processors implementing policy departure historical requirement implementing entire instruction block core extension avx-512f avx-512 foundation required implementations avx-512 instruction set consists several separate sets unique cpuid feature bit however typically grouped supporting processor generation vex prefix used avx avx2 flexible leave enough room features intel wanted add avx-512 led define new prefix called evex compared vex evex adds following benefits extended registers simd width bit opmask registers avx-512 mandatory require support os avx-512 instructions designed mix 128/256-bit avx/avx2 instructions without performance penalty however avx-512vl extensions allows use avx-512 instructions 128/256-bit registers xmm/ymm sse avx/avx2 instructions new avx-512 versions encoded evex prefix allow access new features opmask additional registers unlike avx-256 new instructions new mnemonics share namespace avx making distinction vex evex encoded versions instruction ambiguous source code since avx-512f supports 32- 64-bit values sse avx/avx2 instructions operate bytes words supported avx-512bw extension byte word support width simd register file increased 256 bits 512 bits expanded 16 total 32 registers zmm0-zmm31 registers addressed 256 bit ymm registers avx extensions 128-bit xmm registers streaming simd extensions legacy avx sse instructions extended operate 16 additional registers xmm16-xmm31 ymm16-ymm31 using evex encoded form avx-512 instructions may indicate one 8 opmask registers k0–k7 first one k0 however hardcoded constant used indicate unmasked operations instructions opmask used control values written destination flag controls opmask behavior either zero zeros everything selected mask merge leaves everything selected untouched merge behavior identical blend instructions opmask registers normally 16 bits wide 64 bits avx-512bw extension many bits actually used though depends vector type instructions masked 32-bit single float double words 16 bits used mask 16 elements 512-bit register double float quad words 8 mask bits used opmask register reason several bitwise instructions naturally element widths added avx-512 instance bitwise 128-bit shuffle exist double-word quad-word variants difference final masking opmask registers new mini extension instructions operating directly unlike rest avx-512 instructions instructions vex encoded initial opmask instructions 16-bit word versions avx-512dq 8-bit byte versions added better match needs masking 8 64-bit values avx-512bw 32-bit double 64-bit quad versions added mask 64 8-bit values instructions kortest ktest used set x86 flags based mask registers may used together non-simd x86 branch conditional instructions many avx-512 instructions simply evex versions old sse avx instructions however several new instructions old instructions replaced new avx-512 versions new majorly reworked instructions listed foundation instructions also include extensions avx-512vl avx-512bw since extensions merely add new versions instructions instead new instructions evex-prefixed versions blend instructions sse4 instead avx-512 new set blending instructions using mask registers selectors together general compare mask instructions may used implement generic ternary operations cmov similar xop vpcmov since blending integral part evex encoding instruction may also considered basic move instructions using zeroing blend mode also used masking instructions avx-512f four new compare instructions like xop counterparts use immediate field select 8 different comparisons unlike xop inspiration however save result mask register initially support doubleword quadword comparisons avx-512bw extension provides byte word versions note two mask registers may specified instructions one write one declare regular masking final way set masks using logical set mask instructions perform either nand set destination opmask based result values zero non-zero note like comparison instructions take two opmask registers one destination one regular opmask compress expand instructions match apl operations name use opmask slightly different way avx-512 instructions compress saves values marked mask saves compacted skipping reserving space unmarked values expand operates opposite way loading many values indicated mask spreading selected positions new set permute instructions added full two input permutations take three arguments two source registers one index result output either overwriting first source register index register avx-512bw extends instructions also include 16-bit word versions avx-512_vbmi extension defines byte versions instructions two new instructions added logically implement possible bitwise operations three inputs take three registers input 8-bit immediate field bit output generated using lookup three corresponding bits inputs select one 8 positions 8-bit immediate since 8 combinations possible using three bits allow possible 3 input bitwise operations performed bitwise vector instructions avx-512f evex versions two source sse avx bitwise vector instructions andn xor added avx-512dq difference doubleword quadword versions application opmask truth table number conversion move instructions added complete set conversion instructions available sse2 among unique new features avx-512f instructions decompose floating-point values handle special floating-point values since methods completely new also exist scalar versions second set new floating-point methods includes new scaling approximate calculation reciprocal reciprocal square root approximate reciprocal instructions guarantee relative error 2 instructions avx-512 conflict detection avx-512cd designed help efficiently calculate conflict-free subsets elements loops normally could safely vectorized avx-512 exponential reciprocal instructions contain accurate approximate reciprocal instructions avx-512 foundation relative error 2 also contain two new exponential functions relative error 2 avx-512 prefetch instructions contain new prefetch operations new scatter gather functionality introduced avx2 avx-512 codice_1 prefetch means prefetching level 1 cache codice_2 means prefetching level 2 cache avx-512dq adds new doubleword quadword instructions avx-512bw adds byte words versions instructions adds byte word version doubleword/quadword instructions avx-512f instructions get word forms avx-512bw acquire byte forms avx-512_vbmi extension codice_3 codice_4 codice_5 codice_6 two new instructions added mask instructions set codice_7 codice_8 b w forms avx-512dq q avx-512bw rest mask instructions word forms got byte forms avx-512dq doubleword/quadword forms avx-512bw codice_9 extended codice_10 codice_11 avx-512bw among instructions added avx-512dq several sse avx instruction n't get avx-512 versions avx-512f among two input bitwise instructions extract/insert integer instructions instructions completely new covered three new floating point operations introduced since new avx-512 packed/simd scalar versions codice_12 instructions tests floating point value one eight special floating-point values eight values trigger bit output mask register controlled immediate field codice_13 instructions perform minimum maximum operations depending value immediate field also control operation done absolute separately sign handled codice_14 instructions operate single source subtract integer part source value plus number bits specified immediate field fraction extend vpcompress vpexpand byte word variants shift instructions new vector neural network instructions evex-encoded galois field new instructions vpclmulqdq avx-512f adds evex-encoded 512-bit version pclmulqdq instruction avx-512vl adds evex-encoded 256- 128-bit versions vpclmulqdq alone non-avx512 cpus adds vex-encoded 256-bit version availability vex-encoded 128-bit version indicated different cpuid bits pclmulqdq avx wider 128-bit variations instruction perform operation 128-bit portion input registers extend select quadwords different 128-bit fields meaning imm8 operand either low high quadword 128-bit field selected evex-encoded aes instructions wider 128-bit variations instruction perform operation 128-bit portion input registers intel vectorization advisor starting version 2016 update 3 supports native avx-512 performance vector code quality analysis 2nd generation intel xeon phi codenamed knights landing processor along traditional hotspots profile advisor recommendations seamless integration intel compiler vectorization diagnostics advisor survey analysis also provides avx-512 isa metrics new avx-512-specific traits e.g scatter compress/expand mask utilization | [
6332,
3173,
4845,
2989,
4224,
6344,
6523,
6616,
1465,
1556,
3020,
5665,
4962,
5934,
742,
5669,
5670,
584,
5055,
3803,
6647,
2226,
1031,
1770,
4077,
6563,
1774,
3248,
6133,
1881,
766,
5431,
691,
3747,
6675,
6236,
352,
971,
6956,
1335
] | Test |
2,001 | 2 | OpenBGPD:openbgpd openbgpd server software program allows general purpose computers used routers unix system daemon provides free open-source implementation border gateway protocol version 4 allows machine exchange routes systems speak bgp openbgpd developed henning brauer peter hessler claudio jeker part openbsd project openospfd developed esben nørby companion daemon openbgpd implements open shortest path first protocol suite developed alternative packages quagga linux-focused routing suite licensed gpl meet project requirements quality standards design goals openbgpd include secure non-exploitable reliable lean enough users size memory usage configuration language powerful easy use must also able quickly handle hundreds thousands table entries memory-efficient way openbgpd consists parent process two child processes route decision engine rde session engine se parent process part n't drop privileges others interest non-exploitability parent process drop privileges needs update routing table run root port | [
6414,
2453,
191,
6085,
1261,
5373,
5814,
994,
1462,
2650,
4951,
2746,
5571,
6630,
578,
4706,
6456,
7189,
7275,
1572,
4162,
6918,
1394,
7752,
1670,
7289,
4177,
3572,
4990,
1133,
2883,
1245,
6242,
1435
] | Test |
2,002 | 7 | SpeedTree:speedtree speedtree group vegetation programming modeling software products developed sold interactive data visualization inc. idv generates virtual foliage animations architecture real time video games demanding real time simulations speedtree licensed developers range video games microsoft windows xbox playstation console series since 2002 speedtree used 40 major films since release 2009 including iron man 3 star trek darkness life pi birdman used generate lush vegetation pandora avatar speedtree awarded scientific technical academy award 2015 presented idv founders michael sechrest chris king senior engineer greg croft speedtree conceptualized idv circa 2000 originated due firm lack satisfaction 3rd-party tree-generation software market initial version speedtreecad cad standing computer-aided design developed idv real-time golf simulation although backers pulled golf project idv refined cad software 3d studio max plug-in animated architectural rendering dubbing speedtreemax speedtreemax released february 2002 toward end 2002 idv released speedtreert real-time foliage/tree middleware sdk allowed automatic levels foliage detail real-time wind effects multiple lighting options idv eventually released plug-ins maya well appropriately named speedtreemaya early 2009 idv discontinued speedtreemax speedtreemaya plugins replacing speedtree modeler compiler products idv released speedtree 5 july 2009 version representing complete re-engineering software first versions speedtree enabling hand modeling editing vegetation models speedtree modeler replacing speedtreecad speedtreesdk replacing speedtreert speedtree compiler prepares speedtree files real-time rendering speedtree cinema first released idv 2009 based version 5 technology speedtree games version 6 released november 7 2011 essentially re-branded version speedtree 6 modeler compiler product identified speedtree games distinguish products meant gaming/real-time use speedtree architect released october 15 2012 designed architectural 3d cad use 3d fly-throughs idv released updated versions speedtree cinema speedtree studio speedtree architect november 2013 idv released speedtree v7 unreal engine 4 july 2014 idv released speedtree v7 unity 5 new engine version launch date march 2015 idv released speedtree games v7 april 16 2015 idv three engineers received scientific technical academy award 2015 speedtree cinema product suite speedtree cinema released idv 2009 saw first major use avatar james cameron speedtree cinema designed use film industry generates high-resolution meshes high-quality textures autodesk 3ds max autodesk maya cinema4d cinema edition includes speedtree modeler complete tree model library designed idv suites tree packs must purchased separately several members speedtree line simulate animated growth trees plants seasonal changes export data animated wind effects speedtree studio released idv 2009 less expensive companion speedtree cinema include cinema features complete tree model library speedtree architect released 2012 designed use 3d architectural cad generates meshes compatible typical architectural applications autodesk 3ds max autodesk maya rhino architect edition also exports normal maps uv maps physically-accurate rendering engines v-ray mental ray speedtree games edition speedtree video game development contrasting subscription edition offered users unity game development engine certain versions unreal engine 4 engine games edition includes modeler compiler sdk edition permits game developers integrate speedtree runtime technology game engine choice meshes generated system low poly multiple levels detail use texture atlases typically stored efficient binary format speedtree subscription edition low-cost edition speedtree modeler runtime targeted independent game studios licensing fee 19 usd monthly charge well additional charges tree packs subscribers get access speedtree editor ability generate 3d models trees plants plants exclusively usable either unreal engine 4 unity depending license subscribers download additional tree model packs model library pricing varies packs speedtree modeler windows-based specialized modeling tool designing foliage modeler features combination procedural tree generation hand-editing tools draw trees transform individual tree parts procedural tree generation uses configuration branch length branching angles bark texture generate tree variety formats newer versions support drag-and-drop interface automatically blends branch intersections handles branch collisions speedtree compiler software enables creation efficient tree models use real-time rendering video games generates texture atlases compiles optimizes tree models real-time use speedtree sdk multi-platform c++ sdk efficiently handles rendering speedtree-generated trees forests engine designed integrate operate within larger game engine ready-made support unreal engine unity ogre engine contains optimized systems cull off-screen trees determine level detail on-screen trees full source code available licensees use video games real-time applications modification engine supported engine built work microsoft windows mac os x xbox playstation playstation vita idv licensed middleware partner playstation 3 playstation 4 xbox 360 xbox one idv partnered epic games order integrate software epic unreal engine 4 unreal engine 3 free udk engine released november 2009 partnerships also formed idv bigworld tech vision engine havok multiverse network gamebryo engine emergent game technologies ogre open-source rendering engine torus knot speedtree games licensed first video games including december 2002 speedtree licensed pc next-generation console titles wide variety genres studios used speedtree published games featuring technology include selected recent upcoming and/or popular titles featuring speedtree games following release speedtree cinema 2009 speedtree saw first major cinematic use 2009 avatar technology provided vegetation flyover planet pandora first frames movie well scenes known movies television productions featuring speedtree include speedtree used following real-time projects offerings | [
5666,
5897,
2275,
7898,
4759,
5571,
4833,
1606,
578,
6759,
5709,
4130,
3571,
8195
] | Test |
2,003 | 2 | H1droid:h1droid h1droid project started vodafone sold samsung h1 mobile phones running limo operating system mobile phones running limo operating system applications also available limitation samsung h1 owners wanted run phone famous android operating system since phone good hardware attributes limo operating system also shared characteristics android could good platform operating system transformation idea group software enthusiast shared ideas blogsites world developed h1droid distributed internet software still development stage bugs ongoing h1droid android port samsung h1/gt-i8320/protector first steps porting android samsung h1 made ius netherlands k0059 china chinese programmer known mephisto continued k0059 work porting lot features like wifi improving power management mephisto faced many problems mainly related samsung libraries gave project people involved project recent updates made user called r3d4 https //github.com/r3d4/ ius currently working rewriting libsamsung-ipc support samsung h1 https //github.com/ius/ moment runs micro sd card means ca n't run samsung movinand however stills work fast microsd card currently using android 2.3.7 gingerbread working working bugs find games working working moment games tested samsung h1/gt-i8320/protector best install motorola droid 2 games/apps gpu samsung h1/gt-i8320/protector note moment bug 0.5.1 gameloft opening movies half sided n't worry wo n't affect gameplay n't want revert 0.5.0 find emulators working working moment games tested samsung h1/gt-i8320/protector | [
3507,
4116,
5195,
6697,
3848,
5372,
7431,
195,
6978,
5473,
6427,
7346,
561,
201,
474,
2107,
2017,
5919,
822,
649,
1095,
3863,
5302,
6183,
5571,
7357,
2398,
740,
2037,
2756,
7007,
136,
42,
4340,
7749,
6209,
3310,
2591,
1399,
2417,
2054,
... | Validation |
2,004 | 7 | Netsukuku:netsukuku netsukuku name experimental peer-to-peer routing system developed freaknet medialab 2005 created build distributed network anonymous censorship-free fully independent necessarily separated internet without support server isp central authority netsukuku designed handle 2 nodes without servers central systems minimal cpu memory resources mesh network built using existing network infrastructure components wi-fi project slow development since 2005 never abandoning beta state also never tested large scale december 2011 latest theoretical work netsukuku found author master thesis scalable mesh networks address space balancing problem following description takes account basic concepts theory netsukuku uses custom routing protocol called qspn quantum shortest path netsukuku strives efficient taxing computational capabilities node current version protocol qspnv2 adopts hierarchical structure 256 nodes grouped inside gnode group node 256 gnodes grouped single ggnode group group nodes 256 ggnodes grouped single gggnode offers set advantages main documentation protocol relies fact nodes mobile network structure change quickly several minutes may required change network propagated however node joins network immediately able communicate using routes neighbours node joins mesh network netsukuku automatically suits nodes come know fastest efficient routes communicate newcomer nodes privileges restrictions nodes domain name system dns replaced decentralised distributed system called andna netsukuku domain name architecture andna database included netsukuku system node includes database occupies 355 kilobytes memory simplifying andna works follows resolve symbolic name host applies function hash behalf hash function returns address host contacts asking resolution generated hash contacted node receives request searches andna database address associated name returns applicant host recording similar way example let suppose node x record address freaknet.andna x calculates hash name obtains address 11.22.33.44 associated node node x contacts requiring registration 11.22.33.44 hash stores request database request resolution 11.22.33.44 hash answer x address protocol obviously complex system provides public/private key authenticate hosts prevent unauthorized changes andna database furthermore protocol provides redundancy database make protocol resistant failures also provides migration database network topology changes protocol provide possibility revoking symbolic name certain period inactivity currently 3 days simply deleted database protocol also prevents single host record excessive number symbolic names present 256 names order prevent spammers store high number terms commonly used perform actions cybersquatting | [
5053,
6025,
6049,
3762,
6335,
1237,
4177
] | Test |
2,005 | 9 | Euclid_(programming_language):euclid programming language euclid imperative programming language writing verifiable programs designed butler lampson associates xerox parc lab mid-1970s implementation led ric holt university toronto james cordy principal programmer first implementation compiler originally designed motorola 6809 microprocessor considered innovative time compiler development team 2 million budget 2 years commissioned defense advanced research projects agency u.s. department defense canadian department national defence used years i. p. sharp associates mitre corporation sri international various international institutes research systems programming secure software systems euclid descended pascal programming language functions euclid closed scopes may side effects must explicitly declare imports euclid also disallows gotos floating point numbers global assignments nested functions aliases none actual parameters function refer thing euclid implements modules types descendants euclid include mesa programming language concurrent euclid programming language turing programming language | [
1361,
6507,
1999,
5948,
3069,
5006,
7784,
4589
] | Test |
2,006 | 9 | Henry_Baker_(computer_scientist):henry baker computer scientist henry givens baker jr. american computer scientist made contributions garbage collection functional programming languages linear logic also one founders symbolics company designed manufactured line lisp machines 2006 recognized distinguished scientist association computing machinery notable research garbage collection particularly baker real-time copying collector actor model baker received b.sc 1969 s.m 1973 e.e 1973 ph.d. 1978 degrees m.i.t | [
1616,
1243,
1478
] | Test |
2,007 | 5 | Open_Phone_Abstraction_Library:open phone abstraction library field voip networking open phone abstraction library opal continues open-source openh323 project support wide range commonly used protocols used send voice video fax data ip networks rather tied h.323 protocol initially 2007 opal supported h.323 session initiation protocol sip protocols grown include asterisk iax2 opal implements wide range voice ip voip protocols voice video fax data ip networks written c++ released mozilla public licence opal utilises ptlib portable library allows opal run variety platforms including unix/linux/bsd macosx windows windows mobile embedded systems opal developed derivative openh323 library opal used open source video conferencing program ekiga formerly gnomemeeting | [
3821,
1989,
7170
] | Test |
2,008 | 7 | Cluster_manager:cluster manager cluster manager usually backend graphical user interface gui command-line software runs one cluster nodes cases runs different server cluster management servers .the cluster manager works together cluster management agent agents run node cluster manage configure services set services manage configure complete cluster server see super computing cases cluster manager mostly used dispatch work cluster cloud perform last case subset cluster manager remote desktop application used configuration send work get back work results cluster cases cluster related availability load balancing computational specific service clusters | [
7723,
2961,
5716,
1023,
3195
] | Validation |
2,009 | 3 | VMac:vmac vmac open source emulator mac os windows dos os/2 nextstep linux-unix platforms although vmac abandoned mini vmac improved spinoff vmac currently developed vmac mini vmac emulate macintosh plus run apple macintosh system versions 1.1 7.5.5. vmac mini vmac support cpu emulation motorola 68000 68040 display output sound floppy disk insert hfv image files vmac ports include extra features cd-rom support basic serial port scc support gemulator rom board support various performance improvements although website still operation vmac development slowed halt 1999 official releases made since many developer e-mail addresses listed website currently working mini vmac vmac spinoff still maintained developed paul c. pratt currently mini vmac supports macintosh 128k 512k 512ke plus se classic active development macintosh ii macintosh portable powerbook 100 support due complaints rarity original ii also accepts macintosh iix macintosh se/30 rom files precompiled versions available download mini vmac sourceforge project emulates macintosh plus 4 mib ram vmac mini vmac require macintosh plus rom file macintosh system software work macintosh rom files owned apple legally distributed however windows unix ports vmac mini vmac support gemulator rom board emulators inc. allows users add genuine macplus rom chips x86 machine via isa expansion slot board also support rom chips early macintosh systems publicly released versions vmac supported macintosh plus macintosh system software available apple support downloads website see external links mentioned mini vmac also requires specific rom image computer emulation desired software application 68000 macs may downloaded mini vmac website retrieval system rom image along complete tutorial locating old mac retrieving rom working disk images | [
8153,
3346,
5100,
4759,
5469,
3459,
5571,
578,
405,
7466,
8043,
3387,
5079,
4453,
1237,
1799,
1801
] | Validation |
2,010 | 2 | CPMulator:cpmulator cpmulator program emulate cp/m operating system x86 dos program developed 1984 keystone software development company owned operated jay sprenkle nec v20 processor released year guaranteed hardware compatible intel 8088 reviewing instruction timing math operations instruction addressing hardware determined could slightly speed existing 8088 based ibm pc machines keystone software started advertising pc speedup kits pcweek magazine cpu socketed ibm pc could easily replaced practice programs received 5 speed increase math intensive much improved one customer reported monte carlo simulation nuclear reactor much faster double checked results could n't believe finished cpmulator developed release v20 processor also able emulate intel 8080 instruction set hardware opened possibility running older code new ibm machines cpmulator designed modify cp/m binaries make run native 8088 dos programs code put cpu emulation mode prefixed cp/m executable calls cp/m operating system intercepted translated dos operating system calls program would leave 8080 emulation mode make operating system call translate results cp/m standards returned emulation mode continue original program product went production class machines became prevalent nec produced v series pin pin compatible version 80286 processor | [
4843,
2280,
8087,
126,
3210,
7020,
7032,
3664,
1894,
2160,
6496,
8043,
4745
] | Test |
2,011 | 8 | Ourproject.org:ourproject.org ourproject.org op web-based collaborative free content repository acts central location construction maintenance social/cultural/artistic projects providing web space tools focusing free knowledge claims extend ideas methodology free software social areas free culture general since september 2009 ourproject comunes association umbrella gave birth kune collaborative social network groups ourproject founded 2002 aims hosting boosting cooperative work done multiple domains cultural artistic educational one specific condition results projects remain freely accessible free license understood broad way available licenses cataloged free/libre several creative commons licenses non-profit perspective partially imposed online community projects advertising allowed hosted webpages thus ourproject projects mainly carried social movements university-supported groups free software related projects cooperatives artist collectives activist groups informal groups non-profits december 2016 ourproject.org hosting 1,733 projects 5,969 users constant linear growth rate pagerank 6 14th position public gforge sites first restricted free software projects fact gnu project highlights free knowledge free culture project claims successful wiki farm full free version without ads comparison presence especially spain latin america china relevant projects using ourproject infrastructure include 2011 attracted interest new wave protesting social movements several areas ourproject.org uses multi-language multiple-topic adapted version fusionforge aim widen spectrum free software ideals focusing free social cultural projects free software thus software originally kind social multiple-topic sourceforge following free culture movement nowadays ourproject community involved development collaborative environment kune eventually would cover current ourproject functionalities main condition hosting projects op content created project must released one licenses op provides several free internet services free/libre projects collaborators secondary services 9 years existence ourproject developed partnership several organizations | [
1155,
7214,
3463,
3971
] | Test |
2,012 | 3 | DIGIC:digic digital imaging integrated circuit often styled dig c canon inc. name family signal processing control units digital cameras camcorders digic units used image processors canon digital imaging products several generations digics exist distinguished version number suffix currently digic implemented application-specific integrated circuit asic designed perform high speed signal processing well control operations product incorporated numerous generations digic evolved system involving number discrete integrated circuits single chip system many based around arm instruction set custom firmware units developed add features cameras original digic used powershot g3 sep 2002 canon s1 mar 2004 a520 mar 2005 cameras consists three separate chips video processing ic image processing ic camera control ic digic ii single chip system introduced 2004 unlike first digic allowed compact designs digic ii also improved upon original adding larger buffer increasing processing speed used advanced consumer-level cameras many discontinued digital slrs canon eos 5d canon eos 30d digic ii uses high-speed ddr-sdram improves startup time af performance write memory card speeds 5.8 mb/sec additionally canon claims digic ii improves color sharpness automatic white balance cmos sensor digital slr camera line digic iii image processor introduced 2006 advertised deliver improved image quality faster operation extended battery life compared predecessor digic iii provides faster interface sd memory card canon powershot g7 g9 sd750 sd800 sd850 sd900 sd 1000 a560 a570 a590 a650 a720 a495 eos xs/1000d eos xsi/450d eos 40d eos 1d mark iii eos 1ds mark iii s5 also provides higher resolution lcd screens additionally 14-bit converter providing greater bit depth previous versions digic iii provides face detection af/ae finds tracks nine faces controls exposure flash ensure proper illumination faces well rest frame reducing detrimental effect overexposed darkened faces photo reverts aiaf system subject either detected deemed subject based isaps database latter useful tourist spots may many people around intended subject scene isaps scene-recognition technology developed canon digital cameras using internal database thousands different photos isaps also works digic iii image processor improve focus speed accuracy well exposure white balance canon eos-1d mark iii uses dual digic iii processors achieve capture rate 10 frames per second 10.1 mp maximum burst 110 jpeg images depending speed attached storage canon eos-1ds mark iii also uses dual digic iii processors achieve capture rate five frames per second 21.1 mp 2008 canon introduced digic 4 processor used eos 1100d/rebel t3 eos 500d/rebel t1i eos 550d/rebel t2i eos 600d/rebel t3i eos 50d eos 60d eos 1200d/rebel t5 eos 5d mark ii eos-1d x metering af also used newer cameras canon powershot lines g sd sx canon claims improvements dual digic 4 processors used eos 7d eos-1d mark iv cpu introduced 2014 replace digic 5 mid-range compact cameras particularly elph/ixus sx series full specifications made available introduction canon claims 60 speed bump original digic 4 2011 canon introduced digic 5 featured canon compact cameras like powershot sx40 hs achieve capture rate 10.3 frames per second full resolution high-speed burst hq full hd 1080p videos intelligent image stabilization canon claims new digic 5 processor six times faster digic 4 processor efficiently manages increase scene information simultaneously reduces appearance image noise 75 according canon digic 5 analyses four times image information create pixel recording detail colour scene ever digic 5 co-designed texas instruments ti manufactured ti foundry partnership asia using 45 nm node technology fanned ti digic 5 used eos 650d/rebel t4i/kiss x6i eos 700d/rebel t5i/kiss x7i canon eos eos 100d/rebel sl1/kiss x7 well powershot cameras canon powershot n s100 s110 g15 canon powershot sx50 hs digic 5+ enhancement digic 5 digic 4 performance said 17x performance digic 4 additional processing power allows higher frame rate continuous shooting burst modes greater noise correction use signal processing digic 5+ used eos-1d x eos 6d eos 5d mark iii eos 70d eos-1d x includes dual digic 5+ processors allowing capture rate 12 frames per second raw jpeg additional digic 4 processor specifically intelligent subject analysis system introduced 2013 digic 6 image processor enables improved low-light performance iso 6400 reduced noise addition enables improved af times reduced lag previous models improved performance allows shots 14 fps advancements attributed digic 6 experienced movie mode records mp4 format doubles frame-rate 60 fps 1080p also features reduced noise 30 fps improved image stabilization digic 6 used eos 750d/rebel t6i eos 760d/rebel t6s eos 80d powershot g16 powershot n100 powershot s120 powershot sx270 hs powershot sx280 hs powershot sx60 hs powershot sx700 hs powershot sx710 hs powershot sx720 hs february 2014 canon also released compact canon powershot g1 x mark ii released newest compact mirrorless canon eos m3 february 2015 canon eos m10 october 2015 also utilize internal wlan 802.11b/g/n canon eos 5d mark iv includes digic 6+ processor canon eos 7d mark ii includes dual digic 6 processors allowing capture rate 10 frames per second raw jpeg additional digic 6 processor specifically intelligent subject analysis system canon eos 5ds eos 5ds r also use dual digic 6 processors capability shoot five 50.6mp frames per second canon eos-1d x mark ii includes dual digic 6+ processors allowing capture rate 170 consecutive raw images 14 fps 4k video 60 fps introduced 2016 canon powershot g7 x mark ii first canon camera include digic 7 processor following cameras also using processor mirrorless interchangeable lens camera canon eos m5 introduced 2016 canon eos 77d canon eos 800d introduced february 2017 announced february 2017 canon eos m6 canon eos 6d mark ii released july 2017 canon eos 200d known eos rebel sl2 americas eos kiss x8 japan released july 2017 currently last series canon eos m100 released august 2017 digic 8 introduced together canon eos m50 february 2018 process 4k videos 30 fps using mpeg-4 avc/h.264 compression cameras using processor include digic dv used canon single-chip ccd digital camcorders well dc20 dc40 dvd camcorders digic dv ii utilizes hybrid noise reduction system new gamma system processor used canon high-definition camcorders exception dc20 dc40 dvd camcorders including new sd camcorders fs100 fs10 fs11 digic dv iii processor used legria pal /vixia ntsc high-definition hfs100 hfs10 hf200 hf20 digic dv iii also incorporated cinema eos line digital cinema camera commencing c300 late 2011 digic dv 4 processor introduced 2013 vixia/legria g r mini series camcorders well year xa-20 -25 professional camcorders canon claims capable recording simultaneous mp4 avchd video streams digic dv 5 first seen canon xc10 canon eos c300 mark ii announced 8 april 2015 right nab show xc10 uses single digic dv 5 c300 mark ii uses dual digic dv 5 implementation capable 4k 24 25 30fps 4:2:2 color sampling xf-avc h.264 codec digic dv 6 used canon eos c200 announced may 31 2017 c200 uses dual digic dv 6 implementation capable 4k 60fps digic board contains x86 compatible processor nec v30 emulation running datalight rom-dos s1is running vxworks two chips image processor motorola 68hc12 digic ii digic iii asics contain embedded 32-bit processors based arm instruction set around 2007 canon point-and-shoot cameras ran vxworks-based operating system recent cameras based dryos operating system developed in-house canon free software canon hack development kit chdk project started andrey gratchev successfully enhanced many canon powershot cameras without replacing stock firmware allows programmatic control many canon compact cameras enabling users add features including games scripts written ubasic lua features include shooting raw usb-cable remote shutter-release synchronized shooting multiple cameras motion-detection triggered photography customizable high-speed continuous burst tv av iso focus bracketing increasing depth field 1 gig video-size limit removed earlier cameras shutter aperture iso overrides shutter speeds 64 1/10,000 higher chdk project augment extend firmware necessary obtain copies cameras original firmware cases done via pure software method others rely method using blinking led camera optical serial port transmit firmware host computer however install precompiled firmware powershot camera necessary download correct binary copy sd memory card sd card set lock boot flag enabled camera turned camera autoboot binary file card chdk loaded camera ram card unlocked removed camera start original canon firmware chdk mask lock sd card camera still write however alternatively chdk loaded manually canon menu 400plus free firmware add-on offers additional functionality canon 400d non-destructive non-permanent way spy lantern surveillance camera commercial project based powershot chdk open script magic lantern firmware add-on written canon 5d mark ii trammell hudson 2009 ported 550d/t2i/kiss x4 1.0.8 july 2010 author starting september 2010 a1ex chdk forum people ported add-on 550d/t2i 1.0.9 60d 500d/t1i/kiss x3 600d/t3i/kiss x5 1.0.1 50d also runs 7d firmware released gnu general public license originally developed dslr filmmaking feature base expanded include tools useful still photography well current features include planned future features include clean hdmi output anamorphic preview custom curves installing magic lantern replace stock canon firmware modify rom rather runs alongside easy remove carries little risk canon made official statements regarding add-on firmware either subject warranty features | [
2941,
1568,
4922,
6203,
3368,
5571,
2012,
2013
] | Test |
2,013 | 2 | DRYOS:dryos dryos real-time operating system made canon used latest digital cameras camcorders since late 2007 digic-based cameras shipped using dryos replaces vxworks wind river systems used digic2 digic ii digic3 digic iii cameras dryos existed use canon hardware digital video cameras high-end webcams dryos 16 kilobytes kernel module core currently compatible 10 cpu types provides simulation-based development environment debugging canon also developed usb- middleware-compatible device driver file systems network devices like video server dryos aims compatible µitron 4.0 posix following cameras known run dryos | [
2012
] | Test |
2,014 | 3 | Machine_Check_Architecture:machine check architecture computing machine check architecture mca intel mechanism cpu reports hardware errors operating system intel pentium 4 intel xeon p6 family processors well itanium architecture implement machine check architecture provides mechanism detecting reporting hardware machine errors system bus errors ecc errors parity errors cache errors translation lookaside buffer errors consists set model-specific registers msrs used set machine checking additional banks msrs used recording errors detected | [
5738,
4845,
2989,
5988,
5571,
7499,
5245
] | Test |
2,015 | 4 | Sender_ID:sender id sender id anti-spoofing proposal former marid ietf working group tried join sender policy framework spf caller id sender id defined primarily experimental rfc 4406 additional parts rfc 4405 rfc 4407 rfc 4408 sender id heavily based spf additions differences discussed sender id tries improve spf spf verify header addresses one indicate claimed sending party one header addresses typically displayed user may used reply emails header addresses different address spf tries verify spf verifies mail address also called envelope sender however many similar email header fields contain sending party information therefore sender id defines rfc 4407 purported responsible address pra well set heuristic rules establish address many typical headers email syntactically sender id almost identical spf except codice_1 replaced one syntactical difference sender id offers feature positional modifiers supported spf practice far positional modifier specified sender id implementation practice pra scheme usually offers protection email legitimate offering real protection case spam phishing pra legitimate email either familiar header field case mailing lists sender header field case phishing spam however pra may based resent-* header fields often displayed user effective anti-phishing tool mua mail user agent mail client need modified display either pra sender id return-path header field spf pra tries counter problem phishing spf mfrom tries counter problem spam bounces auto-replies forged return-paths two different problems two different proposed solutions pra disadvantage forwarders mailing lists support modifying mail header e.g insert codice_6 codice_7 latter violates rfc 2822 incompatible rfc 822 spf mailing lists continue work forwarders wishing support spf need modify smtp mail rcpt mail new concept original rfc 821 smtp forwarders always added host name reverse path mail problematic point core sender id specification recommendation interpret codice_1 policies like codice_3 instead codice_2 never intended published spf drafts since 2003 unknown large number codice_1 policies evaluation pra could cause bogus results many cases pra mfrom different problem basis appeal internet architecture board iab response another prior appeal iesg already noted sender id advance ietf standards track without addressing incompatibility must rfc 2822 sender id proposal subject controversy regarding intellectual property licensing issues microsoft holds patents key parts sender id used license patents terms compatible gnu general public license considered problematic free software implementations general october 23 2006 microsoft placed patents open specification promise compatible free open source licenses recent version gpl license version 3.x | [
770,
525,
5722
] | Test |
2,016 | 3 | TeraScale_(microarchitecture):terascale microarchitecture terascale codename family graphics processing unit microarchitectures developed ati technologies/amd second microarchitecture implementing unified shader model following xenos terascale replaced old fixed-pipeline microarchitectures competed directly nvidia first unified shader microarchitecture named tesla terascale used hd 2000 manufactured 80 nm 65 nm hd 3000 manufactured 65 nm 55 nm hd 4000 manufactured 55 nm 40 nm hd 5000 hd 6000 manufactured 40 nm terascale also used amd accelerated processing units code-named brazos llano trinity richland terascale even found succeeding graphics cards brands terascale vliw simd architecture tesla risc simd architecture similar terascale successor graphics core next terascale implements hyperz llvm code generator i.e compiler back-end available terascale seems missing llvm matrix e.g mesa 3d makes use siggraph 08 december 2008 amd employee mike houston described terascale microarchitecture fosdem09 matthias hopf amds technology partner suse linux presented slide regarding programming open-source driver r600 previous gpu architectures implemented fixed-pipelines i.e distinct shader processors type shader terascale leverages many flexible shader processors scheduled process variety shader types thereby significantly increasing gpu throughput dependent application instruction mix noted r600 core processes vertex geometry pixel shaders outlined direct3d 10.0 specification shader model 4.0 addition full opengl 3.0 support new unified shader functionality based upon long instruction word vliw architecture core executes operations parallel shader cluster organized 5 stream processing units stream processing unit retire finished single precision floating point mad add mul instruction per clock dot product dp special cased combining alus integer add 5th unit complex additionally handle special transcendental functions sine cosine shader cluster execute 6 instructions per clock cycle peak consisting 5 shading instructions plus 1 branch notably vliw architecture brings classic challenges inherent vliw designs namely maintaining optimal instruction flow additionally chip co-issue instructions one dependent results performance gpu highly dependent mixture instructions used application well real-time compiler driver organize said instructions r600 core includes 64 shader clusters rv610 rv630 cores 8 24 shader clusters respectively terascale includes multiple units capable carrying tessellation similar programmable units xenos gpu used xbox 360 tessellation officially specified major api starting directx 11 opengl 4 terascale 1 2 based gpu hd 2000 3000 4000 series conformant direct3d 10 opengl 3.3 terascale 3 based gpu starting radeon hd 5000 series first conform direct3d 11 opengl 4.0 supporting tesselation feature de facto terascale tessellator units allow developers take simple polygon mesh subdivide using curved surface evaluation function different tessellation forms bézier surfaces n-patches b-splines nurbs also subdivision techniques surface usually includes displacement map kind texture essentially allows simple low-polygon model increased dramatically polygon density real-time small impact performance scott wasson tech report noted amd demo resulting model dense millions polygons appeared solid terascale tessellator reminiscent ati truform brand name early hardware tessellation unit used initially radeon 8500 tessellation hardware part opengl 3.3 direct3d 10.0 requirements competitors geforce 8 series lacked similar hardware microsoft added tessellation feature part directx 10.1 future plans ati truform received little attention software developers games madden nfl 2004 serious sam unreal tournament 2003 2004 unofficially morrowind support ati tesselation technology included slow adaptation fact feature shared nvidia gpus since implemented competing tessellation solution using quintic-rt patches achieved even less support major game developers since xbox 360 gpu based ati architecture microsoft saw hardware-accelerated surface tessellation major gpu feature couple years later tesselation feature became mandatory release directx 11 2009 gcn geometric processor amd acquired ati gpu business current solution carrying tessellation using gpu although r600 significant departure previous designs still shares many features predecessor radeon r520 ultra-threaded dispatch processor major architectural component r600 core radeon x1000 gpus processor manages large number in-flight threads three distinct types vertex geometry pixel shaders switches amongst needed large number threads managed simultaneously possible reorganize thread order optimally utilize shaders words dispatch processor evaluates goes parts r600 attempts keep processing efficiency high possible lower levels management well simd array 80 stream processors sequencer arbiter arbiter decides thread process next sequencer attempts reorder instructions best possible performance within thread texturing final output aboard r600 core similar also distinct r580 r600 equipped 4 texture units decoupled independent shader core like r520 r580 gpus render output units rops radeon hd 2000 series performs task multisample anti-aliasing msaa programmable sample grids maximum 8 sample points instead using pixel shaders radeon x1000 series also new capability filter fp16 textures popular hdr lighting full-speed rop also perform trilinear anisotropic filtering texture formats r600 totals 16 pixels per clock fp16 textures higher precision fp32 textures filter half-speed 8 pixels per clock anti-aliasing capabilities robust r600 r520 series addition ability perform 8× msaa 6× msaa r300 r580 r600 new custom filter anti-aliasing cfaa mode cfaa refers implementation non-box filters look pixels around particular pixel processed order calculate final color anti-alias image cfaa performed shader instead rops brings greatly enhanced programmability filters customized may also bring potential performance issues use shader resources launch r600 cfaa utilizes wide narrow tent filters samples outside pixel processed weighted linearly based upon distance centroid pixel linear function adjusted based wide narrow filter chosen memory controllers connected via internal bi-directional ring bus wrapped around processor radeon hd 2900 1,024-bit bi-directional ring bus 512-bit read 512-bit write 8 64-bit memory channels total bus width 512-bits 2900 xt radeon hd 3800 512-bit ring bus radeon hd 2600 hd 3600 256-bit ring bus radeon hd 2400 hd 3400 ring bus series saw half-generation update die shrink 55 nm variants rv670 rv635 rv620 variants support pci express 2.0 directx 10.1 shader model 4.1 features dedicated ati unified video decoder uvd models powerplay technology desktop video cards except radeon hd 3800 series variants supported 2 integrated displayport outputs supporting 24- 30-bit displays resolutions 2,560×1,600 output included 1 2 4 lanes per output data rate 2.7 gbit/s per lane ati claimed support directx 10.1 bring improved performance processing efficiency reduced rounding error 0.5 ulp compared average error 1.0 ulp tolerable error better image details quality global illumination technique used animated films improvements consumer gaming systems therefore giving realistic gaming experience see list chips pages terascale 2 vliw5 introduced radeon hd 5000 series gpus baptized evergreen hpg10 mark fowler presented evergreen stated e.g 5870 cypress 5770 juniper 5670 redwood support max resolution 6 times 2560×1600 pixels 5470 cedar supports 4 times 2560×1600 pixels important amd eyefinity multi-monitor support release cypress terascale graphics engine architecture upgraded twice number stream cores texture units rop units compared rv770 architecture stream cores largely unchanged adds support directx 11/directcompute 11 capabilities new instructions also similar rv770 four texture units tied 16 stream cores five processing elements making total 80 processing elements combination referred simd core unlike predecessor radeon r700 directx 11 mandates full developer control interpolation dedicated interpolators removed relying instead simd cores stream cores handle higher rounding precision fused multiply–add fma instruction single double precision increases precision multiply–add mad compliant ieee 754-2008 standard instruction sum absolute differences sad natively added processors instruction used greatly improve performance processes video encoding transcoding 3d engine simd core equipped 32 kib local data share 8 kib l1 cache simd cores share 64 kib global data share memory controller ties two quad rops one per 64-bit channel dedicated 512 kib l2 cache redwood one quad rop per 256-bit channel amd powerplay supported see terascale 3 vliw4 replaces previous 5-way vliw designs 4-way vliw design new design also incorporates additional tessellation unit improve direct3d 11 performance terascale 3 implemented radeon hd 6900-branded graphics cards also trinity richland apus chips baptized northern islands family amd powertune dynamic frequency scaling gpus introduced radeon hd 6900 december 15 2010 prone development ever since like couple reviews anandtech document hpg11 august 2011 amd employees michael mantor senior fellow architect mike houston fellow architect presented graphics core next microarchitecture succeeding terascale | [
2539,
6599,
6351,
7442,
7826,
4694,
6545,
1023,
5947,
6655,
6562,
7666,
240,
7669,
8022,
4090,
1048,
8141,
2078,
7782,
2085
] | Test |
2,017 | 2 | TouchWiz:touchwiz touchwiz samsung touchwiz user interface created designed developed samsung electronics partners featuring full touch user interface touchwiz available samsung devices sometimes incorrectly identified operating system touchwiz used internally samsung smartphones feature phones tablet computers available licensing external parties android version touchwiz also comes samsung-made app store galaxy apps first original edition touchwiz released 2008 1.0 version officially launched original samsung solstice 2009 latest version touchwiz touchwiz 6.0 samsung galaxy j1 mini prime touchwiz nature ux 5.0 samsung galaxy j3 2016 feature refined user interface compared previous versions found samsung older phones released prior galaxy s5 release status bar transparent home screen mode touchwiz nature ux 2.0 touchwiz nature ux 2.5 touchwiz 4.0 galaxy ii galaxy note later updated nature ux features added include panning tilt makes use accelerometer gyroscope phone detect motion touchwiz abandoned samsung late 2016 favor samsung experience touchwiz used samsung proprietary operating systems bada rex well phones based android operating system also present phones running tizen operating system touchwiz central issue apple v. samsung released 2010 support android froyo 2.1 – 2.2 version premiered samsung galaxy s. lite version touchwiz 3.0 reduced features used samsung galaxy proclaim second version touchwiz released 2011 support android gingerbread android honeycomb 2.3 3.2.6 galaxy ii first device preloaded touchwiz 4.0 version includes better hardware acceleration 3.0 well multiple touchscreen options involving multi-touch gestures using phone accelerometer one feature allows users place two fingers screen tilt device towards away zoom respectively panning touchwiz 4.0 allows users scroll home screens moving device side side third version touchwiz renamed touchwiz nature ux released 2012 supported android ice cream sandwich 4.0 galaxy iii galaxy star galaxy note 10.1 first devices preloaded version although lite version used beforehand samsung galaxy tab 2 7.0 touchwiz nature ux contains interactive elements previous version water ripple effect lock screen smart stay feature uses eye tracking technology determine user still watching screen complement touchwiz interface response apple siri version introduces voice samsung intelligent personal assistant version supports android jellybean 4.2.2 released 2013 samsung galaxy s4 first device use touchwiz nature ux 2.0 even eye tracking abilities introduced version smart scroll allows users scroll webpages tilting head downwards upwards respectively touchwiz nature ux 2.5 released 2013 support last updates android jellybean 4.3 4.4 first used galaxy note 3 galaxy note 10.1 2014 edition version completely supports samsung knox security solution well multi-user capabilities camera also improved update shutter lag reduced features like 360° panorama mode added update released 2014 support android kitkat first seen galaxy s5 galaxy note pro 12.2 home screen settings menu made user-friendly larger icons less clutter also icons context menus removed disabled options previously would visible unusable show budget devices samsung galaxy trend 2 lite galaxy j1 ace galaxy v plus feature reduced version touchwiz nature ux 3.0 called touchwiz essence ux adapted devices less 1 gb ram version ultra-power-saving mode drastically extends battery duration making screen grayscale restricting apps used turning features like wi-fi bluetooth slightly modified version touchwiz nature ux 3.0 released 2014 galaxy note 4 galaxy note edge galaxy a-series 2015 changes made minor aesthetic ones including overhaul cluttered settings menu inclusion quick setting shortcuts centralization lock screen clock however camera application stripped basic features nonetheless gaining af/ae lock version comes galaxy s5 supports android lollipop released 2015 update 4.0 eventually became available galaxy s5 note 3 note 4 lollipop-compatible devices less features version touchwiz continued design initially seen galaxy s5 slightly rounded icons also incorporated lollipop additions changes making notification drop-down menu merely overlay instead full-screen drawer touchwiz nature ux 4.0 also included visual overhaul whole system changing black background system apps white theme similar touchwiz ux 3.5 seen note 4 series black theme place since original galaxy reduced battery consumption samsung mainly uses amoled display technology changed patent licensing deal google required touchwiz interface follow design stock android closely touchwiz 5.0 samsung reverted earlier simpler naming system without nature ux infix perhaps reflect aesthetic changes version released 2015 primarily samsung galaxy s6 supports later updates android lollipop 5.0.2 5.1.1 update cleaned user interface reduced number duplicate functions used brighter simpler colours new version touchwiz 5.0 released september 2015 galaxy note 5 s6 edge+ new version features updated iconography stock apps featuring squircle icons instead freeform version touchwiz began initial beta testing android marshmallow galaxy s6 december 2015 users signed beta program became formally available february 2016 features redesigned notification drop-down colour overhaul replacing original blue green hue white version also removed weather centring enlarging clock lock screen well bringing back ability customize shortcuts lock screen icons slightly modified flatter look removing shadows featured previously smart manager removed app moved settings option instead version samsung also added ability change display density setting although initially accessible third-party app setting hidden system update galaxy s7 s7 edge made official allowing users change display settings touchwiz 6.0 also includes google additions android doze app standby improve battery performance although samsung app optimization feature remains available thus meaning two separate app optimization settings one within smart manager app within battery usage screen tap quickly access intelligent personal assistant google permission control limit permissions granted particular application first released samsung galaxy note 7 android marshmallow grace ux named device codename eventually made way older devices including galaxy note 5 update galaxy s7 s7 edge official android nougat update grace ux features cleaner flatter look iconography extensive use white space touchwiz grace ux devices also benefit secure folder functionality enables users keep certain data even apps behind secure password addition countries languages absent previous versions android marshmallow earlier available release starting galaxy tab s3 | [
3933,
5372,
6427,
1095,
740,
1109,
4340,
42,
3310,
2591,
5771,
5775,
7956,
1921,
5473,
474,
6183,
822,
5486,
136,
6209,
1582,
6937,
8024,
6232,
4116,
5195,
2003,
195,
6978,
7346,
561,
201,
5919,
7357,
5571,
2398,
2037,
2756,
7007,
7749,... | Validation |
2,018 | 2 | Microsoft_Customer_Care_Framework:microsoft customer care framework microsoft customer care framework ccf desktop-based framework used address issues faced service providers caused multiple line business lob systems interacting customers discontinued though many core functions moved add-in microsoft dynamics crm product customer care framework provided core set functions customer support avenues including voice call via call center agents internet portals framework used microsoft server products including biztalk server sharepoint ccf required use microsoft sql server microsoft iis server side uses provide base core set web services ccf targeted medium large enterprises ccf originally developed large call center requirements telecommunication industry ccf different products microsoft 'out box solution requires development configuration build working customer solution framework allows soa methodology development server agent desktop side mandatory non-soa development done normally case primary user interface ccf agent desktop desktop-based user interface ui presents data aggregated various line business lob oss/bss application front ends presents unified view ccf include agent desktop application rather samples including source code provided part framework aif manages loading applications integration event brokering use adapters see hat applications custom integrations account technology hosted application well business processing hat allows separation business rules method used integrate application hat uses microsoft windows workflow foundation wf manage business rules data driven adapters ddas manage application directly bindings written xml connect two ccf 2009 sp1 ships 3 ddas win32 web java jdk 1.6 ddas customized extended additional application types needed version customer care framework ccf 2009 sp1 qfe break upgrading .net framework 3.5 sp1 microsoft composite ui application block used build composite applications within ccf number products similar ccf offered companies well | [
7149,
6420,
714,
720,
1460,
2928,
7907,
5747,
2953,
6840,
422,
4017,
6504,
4022,
4026,
7607,
1526,
3687,
4759,
2283,
5479,
7263,
5850,
150,
6933,
519,
3052,
4448,
3407,
1232,
2702,
7687,
1989,
4848,
7715,
4129,
8073,
8085,
6989,
6991,
5... | Validation |
2,019 | 7 | Cloud_Computing_Manifesto:cloud computing manifesto cloud computing manifesto manifesto containing public declaration principles intentions cloud computing providers vendors annotated call action worldwide cloud community dedicated belief cloud open follows earlier development cloud computing bill rights addresses similar issues users point view document developed way open community consensus process response request microsoft 'manifesto created inception open mechanism like wiki public debate comment available creative commons license accordingly hosted mediawiki wiki licensed cc-by-sa 3.0 license original controversial version document called open cloud manifesto sharply criticised microsoft spoke vehemently developed secret shadowy group industry companies raising questions conflicts interest resulting extensive media coverage following days pre-announcement commits official publication document 30 march 2009 spite calls publish earlier time identities signatories several largest technology companies organizations led ibm along omg believed also include cisco hp sun microsystems said revealed amazon google microsoft salesforce.com among known rejected document declining signatories document leaked geva perry blog post 27 march 2009 confirmed authentic shortly afterwards authors public private documents agreed work bring together best points effort open cloud manifesto version developed private secret consortium companies prematurely revealed microsoft senior director developer platform product management steve martin 26 march 2009 claim privately shown copy document warned secret told must signed 'as without modifications additional input point disputed reuven cohen originally believed document author commentators found ironic microsoft speak support open standards others felt criticism justified comparing long ugly war ws-i call open cloud standards later echoed brandon watson microsoft director cloud services ecosystem following principles defined document | [
2961,
3764,
7037
] | Test |
2,020 | 3 | Zemmix:zemmix zemmix trade mark brand name south korean electronics company daewoo electronics co. ltd. msx-based video game console brand brand name zemmix longer use name zemmix daewoo released series gaming consoles compatible msx home computer standards consoles production 1985 1995 consoles sold outside south korea consoles designed broadcast standard ntsc low high outputs connecting tv universal adapter connection mains 110/220 volts consoles also letter coming serial number letters indicated color combination console key follows example cpc 51w would white silver zemmix v see zemmix products korean software companies produced software zemmix gaming console zemmix software work msx/msx2/msx2+ computers | [
1237
] | Test |
2,021 | 4 | Tiny_Banker_Trojan:tiny banker trojan tiny banker trojan also called tinba malware program targets financial institution websites modified form older form viruses known banker trojans yet much smaller size powerful works establishing man-in-the-browser attacks network sniffing since discovery found infected two dozen major banking institutions united states including td bank chase hsbc wells fargo pnc bank america designed steal users sensitive data account login information banking codes tiny banker first discovered 2012 found infected thousands computers turkey discovered original source code malware leaked online began undergoing individual revisions making process detecting harder institutions highly modified version zeus trojan similar attack method obtain information tinba however found much smaller size smaller size makes malware difficult detect 20kb tinba much smaller known trojan reference average file size web site around 1,000kb difference infected web page clean one difficult anti-malware programs recognize tinba operates using packet sniffing method reading network traffic determine user navigates banking website malware launch one two different actions depending variation popular form tinba form grab webpage causing man-in-the-middle attack trojan uses form grabbing grab keystrokes encrypted https tinba sends keystrokes command control turn causes user information stolen second method tinba used allow user log webpage user malware use page information extract company logo site formatting create pop-up page informing user updates system requesting additional information social security numbers banking institutions inform users never ask information way defend types attacks tinba modified address defense begun asking users type information asked security questions user mother maiden name attempt attacker use information reset password later time tinba also injects system processes attempt convert host machine zombie unwilling member botnet order maintain connection botnet tinba coded four domains one goes loses communication trojan look one others immediately | [
704,
4025,
7328,
1528,
2991,
7799,
3426,
376,
1173,
7066,
2733,
6526,
998,
3528,
3277,
2923,
7818,
5922,
3864,
6628,
6904,
1376,
6541,
6194,
924,
1383,
2854,
7186,
7600,
1482,
2587,
1766,
2678,
3038,
1996,
4531,
600,
1307,
3047,
6569,
2... | Test |
2,022 | 0 | Kneser–Ney_smoothing:kneser–ney smoothing kneser–ney smoothing method primarily used calculate probability distribution n -grams document based histories widely considered effective method smoothing due use absolute discounting subtracting fixed value probability lower order terms omit n -grams lower frequencies approach considered equally effective higher lower order n -grams method proposed 1994 paper reinhard kneser ute essen common example illustrates concept behind method frequency bigram san francisco appears several times training corpus frequency unigram francisco also high relying unigram frequency predict frequencies n -grams leads skewed results however kneser–ney smoothing corrects considering frequency unigram relation possible words preceding let formula_1 number occurrences word formula_2 followed word formula_3 corpus equation bigram probabilities follows formula_4 unigram probability formula_5 depends likely see word formula_6 unfamiliar context estimated number times appears word divided number distinct pairs consecutive words corpus formula_7 please note formula_8 proper distribution values defined way non-negative sum one parameter formula_9 constant denotes discount value subtracted count n-gram usually 0 1 value normalizing constant formula_10 calculated make sum conditional probabilities formula_11 formula_6 equal one observe provided formula_13 formula_6 occurs least context formula_15 corpus discount probability exactly constant amount formula_16 total discount depends linearly number unique words formula_6 occur formula_15 total discount budget spread formula_11 proportionally formula_5 values formula_5 sum one simply define formula_10 equal total discount formula_23 equation extended n-grams let formula_24 formula_25 words formula_6 formula_27 model uses concept absolute-discounting interpolation incorporates information higher lower order language models addition term lower order n-grams adds weight overall probability count higher order n-grams zero similarly weight lower order model decreases count n-gram non zero | [
715,
2832,
5304
] | Test |
2,023 | 9 | Music_Macro_Language:music macro language music macro language mml music description language used sequencing music computer video game systems early automatic music generation functions used arcade games used many computer sounds example early popular arcade game music circus exidy corporation 1977 boom japanese video games heralded 1978 appearance japanese game centers amusement arcades space invaders taito corporation music proprietary closed source 1978 release programmable interval timer intel significant intel 8253 mode 3 square wave generator used music kit computer mz-40k sharp corporation made japan may 1978 another micro computer basic master mb-6880 ja used 5bit d/a converter music automated reference signal also important development method generate using basic software machine assembled hitachi ltd. made japan september 1978 mz-40k featured open architecture program sources therefore kind open source software first commands classical mml appeared internal architecture sp-1002 monitor iocs sp-5001 basic operating systems mz-80k 8-bit computer made sharp corporation 1978 japan incorporated intel 8253 hardware memory mapped i/o sound-related basic statements music tempo beep classical mml used basic described mml commands supplied music statement notes specified three-octave range song sequence mono single tones old code ￣ indicates upper octave old code ＿ indicates lower octave characters cdefgab correspond scale doremi faso lassi semitone indicated following note character note names followed tone length indicated number 0-9 similarly r indicates rest also followed number 0-9 indicating length sound length internal value × tempo values.tone length demisemiquaver 0 sp-1002 internal value 1 whole note 9 sp-1002 internal value 32 music played call 0030 sp-1002 iocs program routine statements tempo n 1-9 slowest 1.tempo 4 similar t=120 popular japanese song tōryanse written using mml mz-731 sharp 1z-007b sp-5001 upper compatible modern mml originally appeared microsoft basic common early 1970s 1980s 8-bit 16-bit era japanese personal computers nec pc-6001 included microsoft basic programmable sound generator 1981 mml especially popular nec personal computers nec pc-8801 2001 release mck music creation kit software compiling mml play music nintendo entertainment system awareness use mml increased mml presently popular among japanese electronic musicians musicians create chiptunes way write music nintendo entertainment system modern mml originated sub-language basic generally included rom micro-computers codice_1 statement uses argument define string tones sound-chip played mml code simple text format whereby letters numbers used describe musical notes played addition various implementations mml add system extensions allowing parameters audio synthesis altered specialized commands simplify entry common musical figures arpeggios though many platforms feature custom extensions letter case requirements minor syntactical features vary slightly implementations fundamental syntax rules commands features define mml present whole part implementations follows addition implementations add keywords symbols system-specific enhancements extensions | [
2314,
3303,
5822,
6922,
3689,
5261,
4482,
5970,
6237,
6408,
336
] | Test |
2,024 | 3 | Mbed:mbed mbed platform operating system internet-connected devices based 32-bit arm cortex-m microcontrollers devices also known internet things devices project collaboratively developed arm technology partners applications mbed platform developed using mbed online ide free online code editor compiler web browser needs installed local pc since project compiled cloud i.e remote server using armcc c/c++ compiler mbed ide provides private workspaces ability import export share code distributed mercurial version control used also code documentation generation applications developed also development environments keil µvision iar embedded workbench eclipse gcc arm embedded tools mbed os provides mbed c/c++ software platform tools creating microcontroller firmware runs iot devices consists core libraries provide microcontroller peripheral drivers networking rtos runtime environment build tools test debug scripts connections secured compatible ssl/tls librairies wolfssl supports mbed-rtos components database provides driver libraries components services connected microcontrollers build final product various hardware demo-boards mbed platform first original mbed microcontroller board mbed microcontroller board marketed mbed nxp lpc1768 demo-board based nxp microcontroller arm cortex m3 core running 96 mhz 512 kb flash 64 kb ram well several interfaces including ethernet usb device spi i2c i/o mbed microcontroller received first prize annual edn innovation awards software/embedded tools category 2010 various versions board released nxp lpc2368 arm7tdmi-s nxp lpc1768 cortex-m3 nxp lpc11u24 cortex-m0 microcontrollers mbed hardware development kit hdk designed oems provides information build custom hardware support mbed os consists interface firmware schematics used easily create development boards oem modules re-programmable products suitable production project developed arm conjunction major technology companies mbed developer community development contributions happen different levels | [
6082,
6421,
7890,
722,
2926,
5740,
5750,
5752,
4336,
7189,
5405,
5406,
1864,
67,
446,
7956,
451,
6874,
6165,
463,
804,
5472,
469,
4041,
3008,
5822,
3365,
6910,
7654,
136,
6919,
1977,
2339,
2711,
550,
3786,
7357,
5571,
5576,
7364,
1284,
... | Test |
2,025 | 5 | Digital_transmission_group:digital transmission group telecommunication digital transmission group group digitized voice data channels bit streams combined single digital bit stream transmission communications media digital transmission groups usually categorized maximum capacity specific number channels however maximum digital transmission group capacity must equal greater sum individual multiplexer input channel capacities | [
5714,
1374
] | Test |
2,026 | 1 | Free_license:free license free license open license license agreement contains provisions allow individuals reuse another creator work giving four major freedoms without special license uses normally prohibited copyright law commercial license free licenses worldwide royalty-free non-exclusive perpetual see copyright durations free licenses often basis crowdsourcing crowdfunding projects invention term free license focus rights users connected sharing traditions hacker culture 1970s public domain software ecosystem social political free software movement since 1980 open source movement since 1990s rights codified different groups organizations different domains free software definition open source definition debian free software guidelines definition free cultural works open definition definitions transformed licenses using copyright legal mechanism since ideas free/open licenses spread different spheres society open source free culture unified free open-source movement anticopyright wikimedia foundation projects public domain advocacy groups pirate parties connected free open licenses creative commons affiliates 100 jurisdictions world eupl created european union harald welte created gpl-violations.org | [
7159,
1456,
6428,
2917,
3955,
2920,
5047,
4705,
2585,
3981,
753,
7201,
7581,
6489,
1139,
4012,
3352,
7975,
2285,
3368,
6902,
486,
3035,
6211,
3732,
7669,
2334,
6940,
4824,
5523,
169,
4832,
2354,
204,
5569,
578,
2054,
5605,
5965,
2810,
5... | Validation |
2,027 | 4 | Emotet:emotet emotet banking trojan malware program obtains financial information injecting computer code networking stack infected microsoft windows computer allowing sensitive data stolen via transmission emotet malware also inserts software modules able steal address book data perform denial service attacks systems also functions downloader dropper banking trojans emotet evolved delivery however prominent form inserting malicious documents url links inside body email sometimes disguised invoice pdf attachment first reported germany austria switzerland 2014 united states quickly followed suit encountering emotet malware necessarily fake invoices rather malicious javascript .js files malicious .js files executed emotet malware able infect current host emotet infected host malicious file part malware able intercept log save outgoing network traffic via web browser leading sensitive data compiled access victim bank account emotet member feodo trojan family trojan malware run virtual machine environment emotet changes behavior ways intended mislead malware investigators | [
4565,
2451,
4759,
2891,
6015,
2829,
88
] | Test |
2,028 | 0 | Center_embedding:center embedding linguistics center embedding process embedding phrase middle another phrase type often leads difficulty parsing would difficult explain grammatical grounds alone frequently used example involves embedding relative clause inside another one theories natural language parsing difficulty multiple center embedding thought arise limitations human short term memory order process multiple center embeddings store many subjects order connect predicates interesting theoretical point sentences multiple center embedding grammatical unacceptable examples behind noam chomsky comment languages 'designed parsability … may say languages usable chomsky 1991 researchers peter reich came theories though single center embedding acceptable man boy kicked friend mine double center embedding linguist anne de roeck colleagues provided counter-example n't true example-sentences people know produce likely accepted de roeck et al. 1982 linguist fred karlsson provided empirical evidence 2007 maximal degree multiple center-embedding clauses exactly 3 written language provided thirteen genuine examples type various indo-european languages danish english german latin swedish real examples degree 4 recorded spoken language multiple center-embeddings even degree 2 rare practically non-existing karlsson 2007 center embedding focus science fiction novel ian watson embedding plays part ted chiang story life embedding refers types clauses occurring subordinate parts superordinate clause three types sub-clauses complement relative adverbial subordinators relative pronouns indicate sub clause used center embedding abbreviated c c contains words superordinate clause left right sub-clauses multiple center embedding type clause called self-embedding english language create infinite number sentences even though set number words grammatical rules create infinite sentences rules recursion iteration rule recursion come center embedding embedding one sentence within another sentence linguists say center embedding could go forever technically grammatically correct reader would however become confused trying keep track working memory would able store keep track information given enough time piece paper pencil reader could work information sentence made sense embedding used two clauses share common category expand sentence effective optional categories used create extensive embedding sentence brother opened window maid closed -the common category window sentence expanded become brother opened window maid closed brother opened window maid janitor uncle bill hired married closed common category sentence broken multiple sentences make sense reader brother opened window maid closed one married janitor uncle bill hired center embedded sentence difficult comprehend relative clause embedded another relative clause comprehension becomes easier types clause different -- complement clause embedded relative clause relative clause embedded complement clause example- man heard dog killed radio ran away tell sentence center embedded edge embedded depending brackets located sentence 1 joe believes mary thinks john handsome 2 cat dog man hit chased meowed sentence 1 brackets located right sentence right embedded sentence 2 brackets located inside sentence spaced throughout | [] | Test |
2,029 | 4 | Battery_Directive:battery directive directive 2006/66/ec european parliament council 6 september 2006 batteries accumulators waste batteries accumulators repealing directive 91/157/eec commonly known battery directive regulates manufacture disposal batteries european union aim improving environmental performance batteries accumulators batteries commonly contain hazardous elements mercury cadmium lead incinerated landfilled present risk environment human health directive 91/157/eec adopted 18 march 1991 reduce hazards harmonising eu member states laws disposal recycling batteries containing dangerous substances directive 2006/66/ec repealed directive 91/157/eec directive 2006/66/ec amended directive 2013/56/eu 20 november 2013 regards placing market portable batteries accumulators containing cadmium intended use cordless power tools button cells low mercury content repealing commission decision 2009/603/ec directive like many european compliance directives directly applicable requires legislative action european member states though european directives legislation european union member states must comply avoid legal action european commission bring bear n't however member states retain freedom means implement directive requirements battery directive objective improving environmental performance batteries regulating use certain substances manufacture batteries lead mercury cadmium etc setting standards waste management batteries many european member states passed battery waste management laws among nations belgium sweden germany austria denmark finland united kingdom netherlands france others finland denmark supported total prohibition cadmium batteries belgium sweden battery recycling rates 59 55 respectively finalisation 2006 battery directive european states specific guidelines make rules comport first western european directives dealing waste management council directive 75/442/eec 15 july 1975 waste n't mention batteries chemicals specified regulation particular categories waste later referenced battery directives legislative legal basis first version european council directive batteries accumulators 91/157/eec approved 18 march 1991 covered many battery types including industrial automotive dry-cell lead-acid alkaline nickel-cadmium nickel-metal-hydride lithium lithium-ion mercury etc first program directive set six-year duration starting 1993 1991 battery directive article 3 mi annex stated prohibition exceptions marketing since battery recycling rates 5 directive sought improve rates set recycling goals separate collection recycling provide recycling/collection information consumer responsibility providing separated recycling collection largely given manufacturers recycling requirements found articles 4 6 7 marking provisions including manufacturer responsibility marking battery products contained substances recycling information regulation met heavy resistance disputed deadlines target recycling rates implementation dates weight percentage limits applicable product groups financial responsibility public information campaigns waste management financial impact exclusions financial responsibility given small producer businesses personnel safety decreased reliability greener batteries non-environmental battery marking question automotive battery makers questioned markings batteries relating battery performance arguing quantity car battery electric current output start vehicle extreme weather good indicator battery performance poor implementation first battery directive work began new directive would emphasise battery end-of-life waste management mandated better-structured collection recycling programs also acknowledged research certain substance needed harsher complete arguably unrealistic bans thus onus everyone waste management chain producer consumer rather affecting product design substance bans manufacturers claimed unreasonable consultations revisions first battery directive started 1997 giving interested parties voice legislation policy especially assessing directive economic environmental social impact february 2003 open stakeholders consultation process started published findings online culminated meeting brussels july 2003 waters tested asking extended impact assessments different scenarios proposed ranges regulation example would impact establishing spent battery collection targets 30 80 impact separate spent battery collection 70 100 entities asked goals could met propose collection responsibility models green viewpoint perhaps conciliation committee previous directive limited scope groups side set forth reasons less stringency arguing broadening scope claimed batteries certain metals banned carte blanche waste management effort would hurt confusion perhaps inconvenience public least six drafts 2003 version equivalent second battery directive 2003 revision council directive 2003/0282/cod july 2006 conciliation agreement compromise european council european parliament came three years draft revisions welcomed entities like european portable battery association epba favoured less stringency models european compliance legislation corporation organisations like epba participates working groups members include among players legislators large enterprises—in case battery-makers—trade associations non-governmental organisations directive overall stated objective still protect public interest cleaner environment minimising negative impact environment batteries especially waste cycle depending viewpoint also something compromise 1. manufacturers distributors 3. environmental proponents recent battery directive entered force 26 september 2006 gave european member states 26 september 2008 implement national laws rules batteries art.26 – transposition nations took initiative already started programs passed laws accordance spirit specifications earlier battery directives exception button cells mercury content 2 weight 2006 battery directive restates earlier battery directive prohibition marketing batteries 0.0005 mercury 0.002 cadmium weight however exceptions exist directive also mandates symbols battery labels indicate battery chemical contents lead mercury cadmium used according directive lead content batteries longer restricted initiatives reduce heavy metal batteries promote using less toxic substances batteries dispose batteries properly via regular household waste properly separated research initiatives recycling consumers informed dangers non-compliant disposal old batteries also states must easy consumers remove batteries electronic products disposal automotive industrial batteries leaving landfills incineration prohibited directive preamble point 8 article 7 requires member states maximise separation batteries regular municipal waste requires spent batteries collected separately recycling collection targets called fewer batteries end landfills collection program found annex proposed member states set country standards using battery directive guide minimum levels levels stated terms percents prior annual sales article 3 17 states 'collection rate means given member state given calendar year percentage obtained dividing weight waste portable batteries accumulators collected accordance article 8 1 directive directive 2002/96/ec calendar year average weight portable batteries accumulators producers either sell directly end-users deliver third parties order sell end-users member state calendar year preceding two calendar years member states required provide collection sites accessible free charge public art 8 battery distributors may required provide member states discretion art 8 2 battery manufacturers may refuse take back waste batteries end-consumers irrespective chemical composition origin art 8 3 waste battery collection rate targets specified article 10 minimum targets 25 battery sales 45 battery sales 26 september 2012 2016 respectively art 10 2 collections rates monitored annually outlined annex scheme yearly reporting commission may leeway given form transitional agreements nation special circumstances art 10 4 many exclusions granted manufacturers certain product types cases batteries used safety critical-use applications e.g miners caps exemptions following still place batteries imported third countries non-discriminatory conditions included art 19 member states may use instruments like differential tax rates encourage less toxic batteries recycling art 9 member states required submit implementation reports commission every three years art 22 art 21 marking must indicate separate collections recycling heavy metal content labels state collection information chemical content batteries show symbol crossed-out wheeled recycling bin annex ii indicate battery go bin symbol size specified percent battery area largest side 3 except cylindrical batteries symbol 1.5 total surface area member states set measures effective proportionate dissuasive penalties actions comporting battery directive apprise european commission measures changes art 25 annex battery collection targets mentioned art 10 practice manufacturers batteries need make sure applied legal framework company means need check producer legal terms directive whether fulfilled labelling obligation next step manufacturers distributors define battery strategy register battery compliance schemes control battery compliance monitor recycling recovery results working within framework battery directive manufacturers producers distributors also aware financial aspects registration timelines ensure compliance reduce risks batteries time supported advice suitable qualified persons mercury-containing rechargeable battery management act 1996 similar law united states banning sale mercury-containing batteries except small button cells requiring labelling disposal recycling u.s. state california new york city require recycling rechargeable batteries along state maine require recycling cell phones similar european directives protecting environment health parallel battery directive restriction hazardous substances rohs waste electrical electronic equipment weee registration evaluation authorisation restriction chemicals reach directives | [
4656,
1021,
8061,
2593,
288,
1040
] | Test |
2,030 | 9 | Distributed_Application_Specification_Language:distributed application specification language dasl programming language distributed application specification language high-level strongly typed programming language originally developed sun microsystems laboratories 1999 2003 part ace project goals project enable rapid development web-based applications based sun j2ee architecture eliminate steep learning curve platform-specific details dasl defines application domain model one logical presentation models logical presentation model consists choreography domain model objects described set forms attached actions dasl generates graphical user interface directly logical presentation dasl unique among modern application programming languages ability generate modern graphic user interface application without requiring programmer define user interface explicitly allowing programmer control look feel generated graphic user interface dasl language partially declarative partially procedural description object/data structures persistence description logical presentation declarative basic object constraints behavior declarative additional object behaviors specified procedurally methods queries defined either declaratively writing methods language development environment practical realization model-driven architecture mda approach programmer uses dasl produce platform-independent model pim language code generators automatically produce deploy platform-specific model psm new psms may introduced writing new code generators key benefit dasl language approach 3rd generation 3gl programming languages enterprise applications specified concise precise way expresses application logic clearly small enterprise application dasl typically implemented 8-10k lines dasl code dasl compiler typically translates 200k lines java xml sql implementation artifacts 200k line figure typical equivalent applications written using 3gls conciseness dasl seen also terms content two representations dasl vs. generated application code java/xml/sql etc. dasl code describes business logic business processes specific application independent deployment middleware frameworks presentation mechanisms core business logic typically represents 2-5 generated application code thus writing understanding maintaining application code much easier dasl level level generated code business logic scattered within various implementation artifacts another advantage using dasl write applications rather conventional 3rd generation languages ides dasl code independent middleware gui presentation frameworks network topology implementation technologies new middleware frameworks developed evolve existing dasl programs migrated without need re-implement example original dasl code generators produced traditional html screens later dasl code generators written use frameworks apache struts technologies javascript browser produce interactive experience today new dasl generators written produce rich internet applications existing dasl applications thus converted rich internet applications recompiling latest code generators dasl combines declarative syntax java-like procedural syntax declarative part language enables defining applications higher level abstraction 3rd generation languages java dasl programmer describe inter-process communication client processes web servers application servers databases details user interface desired application rather programmer describes application set related domain objects including behavior set forms actions annotated basic layout properties contrast highly specialized dsls dasl turing-complete behavior domain objects expressed using combination declarative procedural syntax example constraints objects object attributes expressed declaratively constraint defined either declarative expression procedurally dasl application two primary components business object specification bos describes object domain model consisting persistent transient objects representing domain application application usage specification aus describes actions use cases may performed domain model aus essentially choreography domain objects series forms actions dasl programmer models graphical user interface application annotating logical aus forms actions properties describe basic layout data page rather user interface considerations dominating application specification dasl logical interaction user domain model central user interface derived logical interaction believed dasl unique among languages respect dasl language described published sun labs technical report called dasl language programmer guide reference manual technical report also available part acm digital library http //dl.acm.org/citation.cfm id=1698172 dl=acm coll=dl cfid=800729170 cftoken=37871889 around 1999 two sun researchers bruce daniels bob goldberg started research project sun labs called 'ace project goal simplifying creation java web-based enterprise applications ace language known dasl developed goldberg daniels several colleagues part project ace project language featured article appeared june 2002 sun website well january 2003 edition computing research news entitled sun microsystems laboratories license innovate 'project ace ace dasl development environment demonstrated bruce daniels part james gosling keynote address javaone conference march 2002 business side sun microsystems dasl language used implement public interface sun grid compute utility known gridportal although sun microsystems release commercial implementation dasl language past made technology available selected partners conducted trials using technology dasl referenced association computing machinery portal including paper presented oopsla 2004 conference papers model-driven software development sun/oracle website describing project ace demonstration ace dasl given part james gosling keynote address 2004 java one conference research development dasl language continued rd3 software 2006 2010 rd3 language enhancements code generators dasl made language extensible broadened scope language dynamic http-style web applications rich internet applications addition producing html front ends dasl code generators created produce adobe flex flash front ends modest resources html5 could easily generated well iphone- android-specific implementations language extended define dynamic websites domain-specific web portals include cloud applications example rd3 website implemented dasl program rd3 dasl language supports concept forms nested forms part logical presentation information actions logically grouped user interface controlled using annotations presentation navigation recursive relationships organization charts family trees added language dasl language made extensible third party programmer write code generator plugin java targeted specific dasl object class form allowing object form presented using custom widget customized widgets may computation within user browser application presentation produced dasl turing complete dasl unique among modern application programming languages ability generate modern graphic user interface application without requiring programmer define user interface explicitly using simple annotations programmer modify user interface produced dasl using code generator plugins programmer extend dasl generate specific desired user interface | [] | Test |
2,031 | 5 | Distributed-queue_dual-bus:distributed-queue dual-bus telecommunication distributed-queue dual-bus network dqdb distributed multi-access network supports integrated communications using dual bus distributed queuing b provides access local metropolitan area networks c supports connectionless data transfer connection-oriented data transfer isochronous communications voice communications ieee 802.6 example network providing dqdb access methods dqdb medium access control mac algorithm generally credited robert newman developed algorithm phd thesis 1980s university western australia appreciate innovative value dqdb mac algorithm must seen background lan protocols time based broadcast ethernet ieee 802.3 ring like token ring ieee 802.5 fddi dqdb may thought two token rings one carrying data direction around ring improves reliability important metropolitan area networks man repairs may take longer lan wi-fi damage may inaccessible dqdb standard ieee 802.6 developed atm broadband isdn still early development strong interaction two standards atm cells dqdb frames harmonized settled essentially 48-byte data frame 5-byte header dqdb algorithm distributed queue implemented communicating queue state information via header node dqdb network maintains pair state variables represent position distributed queue size queue headers reverse bus communicated requests inserted distributed queue upstream nodes would know allow dqdb cells pass unused forward bus algorithm remarkable extreme simplicity currently dqdb systems installed many carriers entire cities lengths reach speeds ds3 line 44.736 mbit/s implementations use optical fiber length 100 km speeds around 150 mbit/s | [
2057
] | Test |
2,032 | 7 | Symantec_Operations_Readiness_Tools:symantec operations readiness tools march 15 2011 symantec released symantec operations readiness tools sort updated version veritas operations services vos sort formerly vos web-based suite services introduced symantec corporation 2008 supports symantec enterprise products veritas storage foundation veritas cluster server vcs netbackup sort collects environmental data aix hp-ux linux solaris windows servers sort identifies risks data centers provides remediation recommendations symantec currently charge customers sort sort uses data collector collect configuration environmental data veritas volume manager vxvm veritas file system vxfs vcs netbackup symantec enterprise products data analyzed potential problems risks summarized reports sort produces three types reports symantec enterprise products sort performs environment-specific checks produce reports risk assessment report example based 155 separate checks product licensing inventory report lists installed software binaries license keys installation upgrade report lists environment-specific prerequisites must met installing upgrading symantec enterprise products example report lists required operating system patches need installed installing symantec enterprise product risk assessment report provides environment-specific configuration assessment recommendations increase performance availability utilization example one checks risk assessment report lists volumes whose mirrors composed logical units disk array logical volumes mirrored higher availability mirrored across separate disk array controllers mirroring logical volumes across separate disk array controllers allows logical volumes continue operate one disk array fail | [
4759,
5552,
900,
4398,
198,
4138,
578,
7738,
2488,
1666,
5856,
3134,
518,
2961,
3915,
4199,
4645,
7597,
6962
] | Validation |
2,033 | 3 | Ultra_5/10:ultra 5/10 ultra 5 ultra 10 64-bit sun microsystems workstations based ultrasparc microprocessor line available since january 1998 last shipped november 2002 systems notable first sun workstation line introduce various commodity pc compatible hardware components ata hard disks cmd640 pci eide controller ati rage pro video chip ultra 5 came pizzabox style case 270 333 360 400-mhz ultrasparc iii cpu supported maximum 512 mb buffered edo ecc ram four 50ns 168-pin dimm slots included single eide hard disk drive 4 20 gb cd-rom drive three 32-bit 33 mhz pci slots two full-size one short graphics port hd15 parallel printer port db25 two serial ports db25 de9 ethernet port 10base-t/100base-tx headphone line-in line-out microphone 3.5-mm jacks ultra 10 came mid-tower case 300 333 360 440-mhz 64-bit ultrasparc cpu doubled supported ram maximum 1024 mb four dimm slots added room second ata hard disk fourth pci card upa graphics card creator creator3d elite3d | [
1254,
1258,
1923,
908,
7535,
1185,
2299,
4418,
4967,
1023,
418,
7114,
8138,
4999,
4277,
5705,
8145,
971,
6505
] | Test |
2,034 | 2 | Conary_(package_manager):conary package manager conary free software package management system created rpath sas distributed terms apache license version 2.0 relicensed gplv3 2013 focuses installing packages automated dependency resolution distributed online repositories providing concise easy-to-use python-based description language specify build package used foresight linux rpath linux conary updates specific files packages need updated behavior minimizes bandwidth time requirements updating software packages conary also features rollbacks package installation well derived packages conary toolchain includes build server conary packages builds packages inside chroot environments containing package explicitly listed build requirements fundamental packages useful packagers means package builds done inside reproducible environment packagers accidentally introduce dependencies peculiarities machine environment custom configuration files undocumented extra packages | [
8055,
1621,
2091,
5200,
5017,
5545,
6609,
1723,
1260,
5726,
7619,
4675,
5912,
3366,
5480,
4778,
5571,
4601,
578,
4603,
4059,
7092,
2581,
7555,
6743,
3559,
2771,
326,
2594,
4441,
1406,
6663,
1684,
952,
4991,
523,
163,
5965,
6312,
5530,
7... | Test |
2,035 | 5 | Drop_and_insert:drop insert multichannel transmission system drop insert process diverts drop portion multiplexed aggregate signal intermediate point introduces insert different signal subsequent transmission position drop insert practiced example time-division multiplexing tdm time slot frequency band replaced another source diverted signal may demodulated reinserted another transmission system another time slot frequency band time slot frequency band vacated diverted signal need necessarily reoccupied another signal likewise previously unoccupied time slot frequency band may occupied signal inserted drop-and-insert point signals interest drop-and-insert point diverted | [] | Test |
2,036 | 3 | Dual_in-line_package:dual in-line package microelectronics dual in-line package dip dil dual in-line pin package dipp electronic component package rectangular housing two parallel rows electrical connecting pins package may through-hole mounted printed circuit board pcb inserted socket dual-inline format invented forbes rex rice bryant rogers fairchild r 1964 restricted number leads available circular transistor-style packages became limitation use integrated circuits increasingly complex circuits required signal power supply leads observed rent rule eventually microprocessors similar complex devices required leads could put dip package leading development higher-density chip carriers furthermore square rectangular packages made easier route printed-circuit traces beneath packages dip usually referred dip n n total number pins example microcircuit package two rows seven vertical leads would dip14 photograph upper right shows three dip14 ics common packages three many 64 leads many analog digital integrated circuit types available dip packages arrays transistors switches light emitting diodes resistors dip plugs ribbon cables used standard ic sockets dip packages usually made opaque molded epoxy plastic pressed around tin- silver- gold-plated lead frame supports device die provides connection pins types ic made ceramic dip packages high temperature high reliability required device optical window interior package dip packages secured pcb inserting pins holes board soldering place replacement parts necessary test fixtures programmable devices must removed changes dip socket used sockets include zero insertion force mechanism variations dip package include single row pins e.g resistor array possibly including heat sink tab place second row pins types four rows pins two rows staggered side package dip packages mostly displaced surface-mount package types avoid expense drilling holes pcb allow higher density interconnections dips commonly used integrated circuits ics devices dip packages include resistor networks dip switches led segmented bargraph displays electromechanical relays dip connector plugs ribbon cables common computers electronic equipment dallas semiconductor manufactured integrated dip real-time clock rtc modules contained ic chip non-replaceable 10-year lithium battery dip header blocks discrete components could soldered used groups components needed easily removed configuration changes optional features calibration original dual-in-line package invented bryant buck rogers 1964 working fairchild semiconductor first devices 14 pins looked much like today rectangular shape allowed integrated circuits packaged densely previous round packages package well-suited automated assembly equipment pcb could populated scores hundreds ics components circuit board could soldered one time wave soldering machine passed automated testing machines little human labor required dip packages still large respect integrated circuits within end 20th century surface-mount packages allowed reduction size weight systems dip chips still popular circuit prototyping breadboard easily inserted utilized dips mainstream microelectronics industry 1970s 1980s use declined first decade 21st century due emerging new surface-mount technology smt packages plastic leaded chip carrier plcc small-outline integrated circuit soic though dips continued extensive use 1990s still continue used substantially year 2011 passes modern chips available surface-mount package types number companies sell various prototyping adapters allow smt devices used like dip devices through-hole breadboards soldered prototyping boards stripboard perfboard smt pose quite problem least inconvenience prototyping general characteristics smt advantages mass production difficulties prototyping programmable devices like eproms gals dips remained popular many years due easy handling external programming circuitry i.e. dip devices could simply plugged socket programming device however in-system programming isp technology state art advantage dips rapidly losing importance well 1990s devices fewer 20 leads manufactured dip format addition newer formats since 2000 newer devices often unavailable dip format dips mounted either through-hole soldering sockets sockets allow easy replacement device eliminates risk damage overheating soldering generally sockets used high-value large ics cost much socket devices would frequently inserted removed test equipment eprom programmers zero insertion force socket would used dips also used breadboards temporary mounting arrangement education design development device testing hobbyists one-off construction permanent prototyping use point-to-point wiring dips appearance physically inverted part method inspires informal term dead bug style method body housing dip containing ic chip usually made molded plastic ceramic hermetic nature ceramic housing preferred extremely high reliability devices however vast majority dips manufactured via thermoset molding process epoxy mold compound heated transferred pressure encapsulate device typical cure cycles resins less 2 minutes single cycle may produce hundreds devices leads emerge longer sides package along seam parallel top bottom planes package bent downward approximately 90 degrees slightly less leaving angled slightly outward centerline package body soic smt package resembles typical dip appears essentially notwithstanding size scale except bent leads bent upward equal angle become parallel bottom plane package ceramic cerdip packages epoxy grout used hermetically seal two halves together providing air moisture tight seal protect ic die inside plastic dip pdip packages usually sealed fusing cementing plastic halves around leads high degree hermeticity achieved plastic usually somewhat porous moisture process ensure good microscopic seal leads plastic points around perimeter however contaminants usually still kept well enough device operate reliably decades reasonable care controlled environment inside package lower half leads embedded center package rectangular space chamber void ic die cemented leads package extend diagonally inside package positions emergence along periphery points along rectangular perimeter surrounding die tapering go become fine contacts die ultra-fine bond wires barely visible naked human eye welded die periphery contacts bond pads die connecting one lead bond pad making final connection microcircuits external dip leads bond wires usually taut loop upward slightly allow slack thermal expansion contraction materials single bond wire breaks detaches entire ic may become useless top package covers delicate assemblage without crushing bond wires protecting contamination foreign materials usually company logo alphanumeric codes sometimes words printed top package identify manufacturer type made usually year week number sometimes made proprietary information perhaps revision numbers manufacturing plant codes stepping id codes necessity laying leads basically radial pattern single plane die perimeter two rows periphery package main reason dip packages higher lead counts must wider spacing lead rows effectively limits number leads practical dip package may even small die many bond pads e.g chip 15 inverters requiring 32 leads wider dip would still required accommodate radiating leads internally one reasons four-sided multiple rowed packages pgas introduced around early 1980s large dip package dip64 used motorola 68000 cpu long leads inside package pins die making package unsuitable high speed devices types dip devices built differently molded plastic housings straight leads leads extend directly bottom package led displays particularly housing usually hollow plastic box bottom/back open filled around contained electronic components hard translucent epoxy material leads emerge others dip switches composed two plastic housing parts snapped welded glued together around set contacts tiny mechanical parts leads emerging molded-in holes notches plastic several dip variants ics exist mostly distinguished packaging material eproms sold ceramic dips manufactured circular window clear quartz chip die allow part erased ultraviolet light often chips also sold less expensive windowless pdip cerdip packages one-time programmable otp versions windowed windowless packages also used microcontrollers devices containing eprom memory windowed cerdip-packaged eproms used bios rom many early ibm pc clones adhesive label covering window prevent inadvertent erasure exposure ambient light molded plastic dips much lower cost ceramic packages one 1979 study showed plastic 14 pin dip cost around us 0.63 ceramic package cost us 0.82 single in-line pin package sip sipp one row connecting pins popular dip used packaging ram chips multiple resistors common pin compared dips typical maximum i/o count 64 sips typical maximum i/o count 24 lower package costs one variant single in-line package uses part lead frame heat sink tab multi-leaded power package useful applications audio power amplifiers example rockwell used quad in-line package 42 leads formed staggered rows pps-4 microprocessor family introduced 1973 microprocessors microcontrollers higher lead counts early 1990s qip sometimes called qil package dimensions dil package leads side bent alternating zigzag configuration fit four lines solder pads instead two dil qil design increased spacing solder pads without increasing package size two reasons qil packaged ics added heatsinking tabs ha1306 intel 3m developed ceramic leadless quad in-line package quip introduced 1979 boost microprocessor density economy ceramic leadless quip designed surface-mount use requires socket used intel iapx 432 microprocessor chip set zilog z8-02 external-rom prototyping version z8 microcontroller commonly found dip packages conform jedec standards use inter-lead spacing lead pitch jedec ms-001ba row spacing varies depending lead counts 0.3 7.62 mm jedec ms-001 0.6 inch 15.24 mm jedec ms-011 common less common standardized row spacings include 0.4 inch 10.16 mm jedec ms-010 0.9 inch 22.86 mm well row spacing 0.3 inch 0.6 inch 0.75 inch 0.07 inch 1.778 mm lead pitch former soviet union eastern bloc countries used similar packages metric pin-to-pin spacing 2.5 mm rather number leads always even 0.3 inch spacing typical lead counts 8 14 16 18 28 less common 4 6 20 24 lead counts even number leads dips unused connected nc leads internal chip duplicated e.g two ground pins 0.6 inch spacing typical lead counts 24 28 32 40 less common 36 48 52 64 lead counts microprocessors motorola 68000 zilog z180 used lead counts high 64 typically maximum number leads dip package shown diagram leads numbered consecutively pin 1 identifying notch package top pin 1 top left corner device sometimes pin 1 identified indent paint dot mark example 14-lead dip notch top left leads numbered 1 7 top bottom right row leads numbered 8 14 bottom top dip devices segmented led displays relays replace leads heat sink fin skip leads remaining leads numbered positions leads addition providing human visual identification orientation package notch allows automated chip-insertion machinery confirm correct orientation chip mechanical sensing soic small outline ic surface-mount package currently popular particularly consumer electronics personal computers essentially shrunk version standard ic pdip fundamental difference makes smt device second bend leads flatten parallel bottom plane plastic housing soj small outline j-lead smt packages sop small outline package names considered relatives dip original ancestor soic packages tend half pitch dip sop half fourth dip 0.1 /2.54 mm 0.05 /1.27 mm 0.025 /0.635 mm respectively pin grid array pga packages may considered evolved dip pgas pin centers dips popular microprocessors early mid-1980s 1990s owners personal computers containing intel 80286 p5 pentium processors may familiar pga packages often inserted zif sockets motherboards similarity pga socket may physically compatible dip devices though converse rarely true | [
6872,
804,
6170,
5208,
2997,
468,
3002,
7531,
3193,
3459,
4507,
7990,
3203,
2036,
3385,
2785,
5079,
1317,
1052,
866,
2968,
5784,
7499,
5087,
7137,
6683,
1064
] | Test |
2,037 | 2 | Android_Honeycomb:android honeycomb android honeycomb codename eighth version android designed devices larger screen sizes particularly tablets longer supported newer versions honeycomb debuted motorola xoom february 2011 besides addition new features honeycomb introduced new so-called holographic user interface theme interaction model built main features android multitasking notifications widgets new features introduced honeycomb include following | [
3933,
5372,
6427,
1095,
740,
4340,
42,
3309,
3310,
7924,
2591,
5771,
5775,
6153,
7956,
5455,
6176,
5473,
474,
6183,
822,
831,
5141,
136,
2317,
2673,
6209,
1582,
2683,
855,
6937,
168,
6232,
6950,
2712,
4116,
5195,
2003,
195,
6978,
7346,
... | Test |
2,038 | 1 | Iris_Recognition_Immigration_System:iris recognition immigration system iris recognition immigration system iris initiative launched 2004 provide automated clearance uk immigration certain frequent travellers functioned one-to-all identification mode searching large database million enrolled frequent travellers see anyone matched presenting iris passenger asked assert identity e.g presenting passport id card would require one-to-one verification test single enrolled identity thus iris exploited great robustness iris recognition making false matches since unlike weak biometrics face recognition could survive vast number opportunities make false matches searching large database instead needing test single asserted identity decommissioned september 2013 favour e-passport entry using biometric data stored e-passport chip requires single asserted identity tested thus could function using weaker biometrics simple one-to-one verification mode iris relied biometric technology authenticate identity part e-borders initiative uk government claimed passengers found system difficult use resulting many false rejections required passengers join normal queue passport presentation main factor behind decision decommission iris cost staffing enrolment offices airport terminals whereas face recognition required submitting passport-type photograph acquired photo-booth without need personal presentation airport enrolment staff system cost £4.9 million develop £4 million operate enrolled passengers could enter uk special automated immigration control barrier incorporating iris recognition camera barriers located certain immigration arrival halls form part immigration passport control enrolment took place airport departure lounge immigration officer assesses eligibility enrols qualifying persons qualified participate scheme eyes photographed order capture iris patterns data stored securely alongside personal details originally iris rolled london heathrow london gatwick birmingham manchester 2004 intended deployment period five years february 2013 iris available heathrow terminals 3 5 barriers decommissioned last operational barriers decommissioned 15 16 september 2013 respectively original deployment plan five years doubled nearly ten years following travellers eligible enrol | [] | Test |
2,039 | 4 | Secure_Network:secure network secure network small research consulting company focusing information security based milano italy london united kingdom besides notability italy received international exposure research project bluetooth security co-sponsored f-secure codenamed bluebag also selected black hat briefings conference 2006 las vegas 2009 also organized seacure.it first international technical security conference ever held italy | [
6644,
651,
1594
] | Test |
2,040 | 9 | List_of_server-side_JavaScript_implementations:list server-side javascript implementations list server-side javascript implementations common server-side programming languages javaserver pages jsp active server pages asp perl php python ruby coldfusion others | [
183,
2451,
4755,
5983,
5984,
6172,
3092,
6176,
5998,
562,
2658,
7734,
313,
3543,
3719,
6368,
6029,
7924,
237,
54,
3398,
3135,
2870,
2506,
6660,
422,
340,
5172,
3057,
5965,
6400,
7687,
4287
] | Test |
2,041 | 4 | Electromagnetic_survivability:electromagnetic survivability telecommunication electromagnetic survivability ability system subsystem equipment resume functioning without evidence degradation following temporary exposure adverse electromagnetic environment system subsystem equipment performance may degraded exposure adverse electromagnetic environment system experience permanent damage component burnout prevent proper operation adverse electromagnetic environment removed | [
2981
] | Test |
2,042 | 0 | Technolangue/Easy:technolangue/easy technolangue/easy first evaluation campaign syntactic parsers french project supported french research ministry ministère de recherche français technolangue/easy included four tasks 2003 2006 13 laboratories companies submitted parser evaluation making total 16 runs 7 research laboratories 3 r institutes 3 private companies said terms existing french parsers competed | [] | Validation |
2,043 | 5 | Domain_Name_System:domain name system domain name system dns hierarchical decentralized naming system computers services resources connected internet private network associates various information domain names assigned participating entities prominently translates readily memorized domain names numerical ip addresses needed locating identifying computer services devices underlying network protocols providing worldwide distributed directory service domain name system essential component functionality internet since 1985 domain name system delegates responsibility assigning domain names mapping names internet resources designating authoritative name servers domain network administrators may delegate authority sub-domains allocated name space name servers mechanism provides distributed fault-tolerant service designed avoid single large central database domain name system also specifies technical functionality database service core defines dns protocol detailed specification data structures data communication exchanges used dns part internet protocol suite internet maintains two principal namespaces domain name hierarchy internet protocol ip address spaces domain name system maintains domain name hierarchy provides translation services address spaces internet name servers communication protocol implement domain name system dns name server server stores dns records domain dns name server responds answers queries database common types records stored dns database start authority soa ip addresses aaaa smtp mail exchangers mx name servers ns pointers reverse dns lookups ptr domain name aliases cname although intended general purpose database dns expanded time store records types data either automatic lookups dnssec records human queries responsible person rp records general purpose database dns also used combating unsolicited email spam storing real-time blackhole list rbl dns database traditionally stored structured text file zone file database systems common often-used analogy explain domain name system serves phone book internet translating human-friendly computer hostnames ip addresses example domain name www.example.com translates addresses ipv4 ipv6 dns quickly transparently updated allowing service location network change without affecting end users continue use hostname users take advantage use meaningful uniform resource locators urls e-mail addresses without know computer actually locates services important ubiquitous function dns central role distributed internet services cloud services content delivery networks user accesses distributed internet service using url domain name url translated ip address server proximal user key functionality dns exploited different users simultaneously receive different translations domain name key point divergence traditional phone-book view dns process using dns assign proximal servers users key providing faster reliable responses internet widely used major internet services dns reflects structure administrative responsibility internet subdomain zone administrative autonomy delegated manager zones operated registry administrative information often complemented registry rdap whois services data used gain insight track responsibility given host internet using simpler memorable name place host numerical address dates back arpanet era stanford research institute sri international maintained text file named hosts.txt mapped host names numerical addresses computers arpanet elizabeth feinler developed maintained first arpanet directory maintenance numerical addresses called assigned numbers list handled jon postel university southern california information sciences institute isi whose team worked closely sri addresses assigned manually computers including hostnames addresses added master file contacting sri network information center nic directed elizabeth feinler telephone business hours later feinler set whois directory server nic retrieval information resources contacts entities team developed concept domains feinler suggested domains based location physical address computer computers educational institutions would domain edu example team managed host naming registry 1972 1989 early 1980s maintaining single centralized host table become slow unwieldy emerging network required automated naming system address technical personnel issues postel directed task forging compromise five competing proposals solutions paul mockapetris mockapetris instead created domain name system internet engineering task force published original specifications rfc 882 rfc 883 november 1983 1984 four uc berkeley students douglas terry mark painter david riggle songnian zhou wrote first unix name server implementation berkeley internet name domain commonly referred bind 1985 kevin dunlap dec substantially revised dns implementation mike karels phil almquist paul vixie maintained bind since early 1990s bind ported windows nt platform widely distributed especially unix systems still widely used dns software internet november 1987 rfc 1034 rfc 1035 superseded 1983 dns specifications several additional request comments proposed extensions core dns protocols domain name space consists tree data structure node leaf tree label zero resource records rr hold information associated domain name domain name consists label possibly concatenated name parent node right separated dot tree sub-divides zones beginning root zone dns zone may consist one domain may consist many domains sub-domains depending administrative choices zone manager dns also partitioned according class separate classes thought array parallel namespace trees administrative responsibility zone may divided creating additional zones authority new zone said delegated designated name server parent zone ceases authoritative new zone definitive descriptions rules forming domain names appear rfc 1035 rfc 1123 rfc 2181 rfc 5892 domain name consists one parts technically called labels conventionally concatenated delimited dots example.com right-most label conveys top-level domain example domain name www.example.com belongs top-level domain com hierarchy domains descends right left label left specifies subdivision subdomain domain right example label example specifies subdomain com domain www subdomain example.com tree subdivisions may 127 levels label may contain zero 63 characters null label length zero reserved root zone full domain name may exceed length 253 characters textual representation internal binary representation dns maximum length requires 255 octets storage also stores length name although technical limitation exists use character domain name labels representable octet hostnames use preferred format character set characters allowed labels subset ascii character set consisting characters z z digits 0 9 hyphen rule known ldh rule letters digits hyphen domain names interpreted case-independent manner labels may start end hyphen additional rule requires top-level domain names all-numeric limited set ascii characters permitted dns prevented representation names words many languages native alphabets scripts make possible icann approved internationalizing domain names applications idna system user applications web browsers map unicode strings valid dns character set using punycode 2009 icann approved installation internationalized domain name country code top-level domains cctld addition many registries existing top-level domain names tld adopted idna system guided rfc 5890 rfc 5891 rfc 5892 rfc 5893 domain name system maintained distributed database system uses client–server model nodes database name servers domain least one authoritative dns server publishes information domain name servers domains subordinate top hierarchy served root name servers servers query looking resolving tld authoritative name server name server gives answers dns queries data configured original source example domain administrator dynamic dns methods contrast answers obtained via query another name server maintains cache data authoritative name server either master server slave server master server server stores original master copies zone records slave server uses special automatic updating mechanism dns protocol communication master maintain identical copy master records every dns zone must assigned set authoritative name servers set servers stored parent domain zone name server ns records authoritative server indicates status supplying definitive answers deemed authoritative setting protocol flag called authoritative answer aa bit responses flag usually reproduced prominently output dns administration query tools dig indicate responding name server authority domain name question domain name resolvers determine domain name servers responsible domain name question sequence queries starting right-most top-level domain label proper operation domain name resolver network host configured initial cache hints known addresses root name servers hints updated periodically administrator retrieving dataset reliable source assuming resolver cached records accelerate process resolution process starts query one root servers typical operation root servers answer directly respond referral authoritative servers e.g. query www.wikipedia.org referred org servers resolver queries servers referred iteratively repeats process receives authoritative answer diagram illustrates process host named fully qualified domain name www.wikipedia.org mechanism would place large traffic burden root servers every resolution internet required starting root practice caching used dns servers off-load root servers result root name servers actually involved relatively small fraction requests theory authoritative name servers sufficient operation internet however authoritative name servers operating every dns query must start recursive queries root zone domain name system user system would implement resolver software capable recursive operation improve efficiency reduce dns traffic across internet increase performance end-user applications domain name system supports dns cache servers store dns query results period time determined configuration time-to-live domain name record question typically caching dns servers also implement recursive algorithm necessary resolve given name starting dns root authoritative name servers queried domain function implemented name server user applications gain efficiency design operation combination dns caching recursive functions name server mandatory functions implemented independently servers special purposes internet service providers typically provide recursive caching name servers customers addition many home networking routers implement dns caches recursors improve efficiency local network client side dns called dns resolver resolver responsible initiating sequencing queries ultimately lead full resolution translation resource sought e.g. translation domain name ip address dns resolvers classified variety query methods recursive non-recursive iterative resolution process may use combination methods non-recursive query dns resolver queries dns server provides record either server authoritative provides partial result without querying servers case caching dns resolver non-recursive query local dns cache delivers result reduces load upstream dns servers caching dns resource records period time initial response upstream dns servers recursive query dns resolver queries single dns server may turn query dns servers behalf requester example simple stub resolver running home router typically makes recursive query dns server run user isp recursive query one dns server answers query completely querying name servers needed typical operation client issues recursive query caching recursive dns server subsequently issues non-recursive queries determine answer send single answer back client resolver another dns server acting recursively behalf resolver negotiates use recursive service using bits query headers dns servers required support recursive queries iterative query procedure process dns resolver queries chain one dns servers server refers client next server chain current server fully resolve request example possible resolution www.example.com would query global root server com server finally example.com server name servers delegations identified name rather ip address means resolving name server must issue another dns request find ip address server referred name given delegation subdomain domain delegation provided circular dependency case name server providing delegation must also provide one ip addresses authoritative name server mentioned delegation information called glue delegating name server provides glue form records additional section dns response provides delegation authority section response glue record combination name server ip address example authoritative name server example.org ns1.example.org computer trying resolve www.example.org first resolves ns1.example.org ns1 contained example.org requires resolving example.org first presents circular dependency break dependency name server top level domain org includes glue along delegation example.org glue records address records provide ip addresses ns1.example.org resolver uses one ip addresses query one domain authoritative servers allows complete dns query standard practice implementing name resolution applications reduce load domain name system servers caching results locally intermediate resolver hosts results obtained dns request always associated time live ttl expiration time results must discarded refreshed ttl set administrator authoritative dns server period validity may vary seconds days even weeks result distributed caching architecture changes dns records propagate throughout network immediately require caches expire refreshed ttl rfc 1912 conveys basic rules determining appropriate ttl values resolvers may override ttl values protocol supports caching sixty-eight years caching negative caching i.e caching fact non-existence record determined name servers authoritative zone must include start authority soa record reporting data requested type exists value minimum field soa record ttl soa used establish ttl negative answer reverse dns lookup query dns domain names ip address known multiple domain names may associated ip address dns stores ip addresses form domain names specially formatted names pointer ptr records within infrastructure top-level domain arpa ipv4 domain in-addr.arpa ipv6 reverse lookup domain ip6.arpa ip address represented name reverse-ordered octet representation ipv4 reverse-ordered nibble representation ipv6 performing reverse lookup dns client converts address formats querying name ptr record following delegation chain dns query example assuming ipv4 address 208.80.152.2 assigned wikimedia represented dns name reverse order 2.152.80.208.in-addr.arpa dns resolver gets pointer ptr request begins querying root servers point servers american registry internet numbers arin 208.in-addr.arpa zone arin servers delegate 152.80.208.in-addr.arpa wikimedia resolver sends another query 2.152.80.208.in-addr.arpa results authoritative response users generally communicate directly dns resolver instead dns resolution takes place transparently applications web browsers e-mail clients internet applications application makes request requires domain name lookup programs send resolution request dns resolver local operating system turn handles communications required dns resolver almost invariably cache see containing recent lookups cache provide answer request resolver return value cache program made request cache contain answer resolver send request one designated dns servers case home users internet service provider machine connects usually supply dns server user either configured server address manually allowed dhcp set however systems administrators configured systems use dns servers dns resolvers point separately maintained name servers organization event name server thus queried follow process outlined either successfully finds result returns results dns resolver assuming found result resolver duly caches result future use hands result back software initiated request large isps configured dns servers violate rules disobeying ttls indicating domain name exist one name servers respond applications web browsers maintain internal dns cache avoid repeated lookups via network practice add extra difficulty debugging dns issues obscures history data caches typically use short caching times – order one minute internet explorer represents notable exception versions ie 3.x cache dns records 24 hours default internet explorer 4.x later versions ie 8 decrease default time value half hour may changed modifying default configuration google chrome triggers specific error message dns issues dns server broken google chrome returns error message domain name system includes several functions features hostnames ip addresses required match one-to-one relationship multiple hostnames may correspond single ip address useful virtual hosting many web sites served single host alternatively single hostname may resolve many ip addresses facilitate fault tolerance load distribution multiple server instances across enterprise global internet dns serves purposes addition translating names ip addresses instance mail transfer agents use dns find best mail server deliver e-mail mx record provides mapping domain mail exchanger provide additional layer fault tolerance load distribution dns used efficient storage distribution ip addresses blacklisted email hosts common method place ip address subject host sub-domain higher level domain name resolve name record indicates positive negative indication example e-mail servers query blacklist.example find specific host connecting blacklist many blacklists either subscription-based free cost available use email administrators anti-spam software provide resilience event computer network failure multiple dns servers usually provided coverage domain top level global dns thirteen groups root name servers exist additional copies distributed worldwide via anycast addressing dynamic dns ddns updates dns server client ip address on-the-fly example moving isps mobile hot spots ip address changes administratively dns protocol uses two types dns messages queries replies format message consists header four sections question answer authority additional space header field flags controls content four sections header section consists following fields identification flags number questions number answers number authority resource records rrs number additional rrs field 16 bit long appears order given identification field used match responses queries flag field consists sub-fields follows flag header ends four 16-bit integers contain number records sections follow order question section simpler format resource record format used sections record usually 1 contains following fields domain name broken discrete labels concatenated label prefixed length label dns primarily uses user datagram protocol udp port number 53 serve requests dns queries consist single udp request client followed single udp reply server length answer exceeds 512 bytes client server support edns larger udp packets used otherwise query sent using transmission control protocol tcp tcp also used tasks zone transfers resolver implementations use tcp queries domain name system specifies database information elements network resources types information elements categorized organized list dns record types resource records rrs record type name number expiration time time live class type-specific data resource records type described resource record set rrset special ordering dns resolvers return entire set upon query servers may implement round-robin ordering achieve load balancing contrast domain name system security extensions dnssec work complete set resource record canonical order sent internet protocol network records use common format specified rfc 1035 name fully qualified domain name node tree wire name may shortened using label compression ends domain names mentioned earlier packet substituted end current domain name free standing used denote current origin type record type indicates format data gives hint intended use example record used translate domain name ipv4 address ns record lists name servers answer lookups dns zone mx record specifies mail server used handle mail domain specified e-mail address rdata data type-specific relevance ip address address records priority hostname mx records well known record types may use label compression rdata field unknown record types must rfc 3597 class record set internet common dns records involving internet hostnames servers ip addresses addition classes chaos ch hesiod hs exist class independent name space potentially different delegations dns zones addition resource records defined zone file domain name system also defines several request types used communication dns nodes wire performing zone transfers axfr/ixfr edns opt domain name system supports wildcard dns records specify names start asterisk label '* e.g. *.example dns records belonging wildcard domain names specify rules generating resource records within single dns zone substituting whole labels matching components query name including specified descendants example following configuration dns zone x.example specifies subdomains including subdomains subdomains x.example use mail exchanger mx a.x.example record a.x.example needed specify mail exchanger ip address result excluding domain name subdomains wildcard matches additional mx record subdomain a.x.example well wildcarded mx record subdomains must also defined dns zone role wildcard records refined rfc 4592 original definition rfc 1034 incomplete resulted misinterpretations implementers original dns protocol limited provisions extension new features 1999 paul vixie published rfc 2671 superseded rfc 6891 extension mechanism called extension mechanisms dns edns introduced optional protocol elements without increasing overhead use accomplished opt pseudo-resource record exists wire transmissions protocol zone files initial extensions also suggested edns0 increasing dns message size udp datagrams dynamic dns updates use update dns opcode add remove resource records dynamically zone database maintained authoritative dns server feature described rfc 2136 facility useful register network clients dns boot become otherwise available network booting client may assigned different ip address time dhcp server possible provide static dns assignments clients originally security concerns major design considerations dns software software deployment early internet network open participation general public however expansion internet commercial sector 1990s changed requirements security measures protect data integrity user authentication several vulnerability issues discovered exploited malicious users one issue dns cache poisoning data distributed caching resolvers pretense authoritative origin server thereby polluting data store potentially false information long expiration times time-to-live subsequently legitimate application requests may redirected network hosts operated malicious intent dns responses traditionally cryptographic signature leading many attack possibilities domain name system security extensions dnssec modify dns add support cryptographically signed responses dnscurve proposed alternative dnssec extensions tsig add support cryptographic authentication trusted peers commonly used authorize zone transfer dynamic update operations domain names may used achieve spoofing effects example paypa1.com different names yet users may unable distinguish graphical user interface depending user chosen typeface many fonts letter l numeral 1 look similar even identical problem acute systems support internationalized domain names many character codes iso 10646 may appear identical typical computer screens vulnerability occasionally exploited phishing techniques forward-confirmed reverse dns also used help validate dns results device looking dns record must communicate dns server considerable attention given adverse privacy implications even dns records easily read modified spoofed due security extensions person access dns server traffic stream wire may little difficulty matching ip address device often identifies user websites email domains visit track often records queried since dns records typically expire must requeried regularly dns also leak otherwise secure private connections attention paid configuration times dns used bypass firewalls malicious persons exfiltrate data since often seen innocuous two main approaches use counter privacy issues dns right use domain name delegated domain name registrars accredited internet corporation assigned names numbers icann organizations opennic charged overseeing name number systems internet addition icann top-level domain tld maintained serviced technically administrative organization operating registry registry responsible operating database names within authoritative zone although term often used tlds registrant person organization asked domain registration registry receives registration information domain name registrar authorized accredited assign names corresponding zone publishes information using whois protocol 2015 usage rdap considered icann publishes complete list tlds tld registries domain name registrars registrant information associated domain names maintained online database accessible whois service 290 country code top-level domains cctlds domain registries maintain whois registrant name servers expiration dates etc information instance denic germany nic holds de domain data 2001 generic top-level domain gtld registries adopted so-called thick registry approach i.e keeping whois data central registries instead registrar databases top-level domains com net thin registry model used domain registry e.g. godaddy bigrock pdr verisign etc. etc holds basic whois data i.e. registrar name servers etc. organizations registrants using org hand public interest registry exclusively domain name registries often called network information centers nic also function registrars end-users addition providing access whois datasets top-level domain registries domains com net org use registry-registrar model consisting many domain name registrars method management registry manages domain name database relationship registrars registrants users domain name customers registrar cases additional subcontracting resellers domain name system defined request comments rfc documents published internet engineering task force internet standards following list rfcs define dns protocol rfcs advisory nature may provide useful information despite defining neither standard bcp rfc 1796 rfcs official status unknown due age clearly labeled | [
7148,
709,
6790,
5722,
6419,
2554,
4676,
4677,
6426,
7168,
7170,
4683,
20,
6432,
1462,
728,
3629,
5039,
6446,
2577,
3638,
2219,
3640,
4338,
4709,
7916,
7194,
6122,
3312,
758,
1130,
7214,
6143,
7217,
2612,
3337,
3338,
1900,
84,
1148,
544... | Test |
2,044 | 2 | Words_(Unix):words unix words standard file unix unix-like operating systems simply newline-delimited list dictionary words used instance spell-checking programs words file usually stored debian ubuntu file provided package provider packages etc fedora arch file provided package | [] | Train |
2,045 | 4 | GateKeeper_(access_control_device):gatekeeper access control device gatekeeper wireless proximity-based access control authentication device allows user automatically lock computer walking away unlock walking back untethered labs american computer security firm led ceo siddharth potbhare created original gatekeeper 2014 gatekeeper consists key fob device usb dongle transmit wireless signal software manage user credentials device also functions key finder using bluetooth low energy 4.0 locate gatekeeper within proximate adjustable range 30 feet indoors 100 feet outdoors gatekeeper software uses dashboard displays device signal strength allows users select configure lock settings manage user credentials set range computer detects device presence gatekeeper software provides user options enable two-factor authentication 2-fa computer access requiring user enter pin carry gatekeeper login usb dongle lock ever removed computer software immediately locks computer gatekeeper enterprise software integrates gatekeeper hardware allows administrator control deployment management gatekeepers network administrator set security policies gather log data auditing conduct productivity analysis deploy updates client software december 2017 untethered labs announced kickstarter would release halberd key fob new hardware design according company halberd larger design new processor added accelerometer improve device performance battery life halberd subsequently reached funding goal 25,000 raising 50,000 28 days 400 backers expected released january 2018 company also plans release compatible software mac linux systems well single sign-on capabilities 2018 | [
5571,
3794,
8123,
1805
] | Test |
2,046 | 4 | Endurability:endurability telecommunication endurability property system subsystem equipment process enables continue function within specified performance limits extended period time usually months despite severe natural man-made disturbance nuclear attack loss external logistic utility support endurability compromised temporary failures local capability exists restore maintain system subsystem equipment process acceptable performance level | [] | Test |
2,047 | 5 | Equivalent_pulse_code_modulation_noise:equivalent pulse code modulation noise telecommunication equivalent pulse code modulation pcm noise amount noise power frequency-division multiplexing fdm wire communication channel necessary approximate judgment speech quality created quantizing noise pcm channel | [
4970
] | Validation |
2,048 | 2 | BBM_(software):bbm software bbm formerly known full name blackberry messenger proprietary mobile instant messenger videotelephony application included blackberry devices allows messaging voice calls blackberry os blackberry 10 ios android windows mobile users consumer edition ios android bbm consumer developed indonesian company emtek license blackberry limited formerly known research motion consumer edition blackberry os blackberry 10 well paid enterprise edition called bbm enterprise formerly known bbm protected developed fully blackberry limited bbm consumer shut 31 may 2019 however paid enterprise version software bbme still running messages sent via bbm sent internet used blackberry pin system past many service providers allowed sign-in bbm using dedicated blackberry data plan exchanging messages possible single person via dedicated discussion chat groups allowed multiple blackberry devices communicate single session addition offering text-based instant messages bbm also allowed users send pictures voicenotes audio recordings files 16 mb share real time location map stickers wide selection emojis communication possible blackberry devices late 2013 bbm released ios android systems 300 million stickers shared daily approximately 150,000 bbm voice calls placed 190 million bbm users worldwide 2015 blackberry infrastructure handled 30 petabytes data traffic month early 2013 bbm original mobile-first messaging service popular started lose rivals april 2016 indonesia country bbm popular messaging app installed 87.5 android devices country blackberry messenger launched august 1 2005 release blackberry messenger 5.0 blackberry allows users use qr code add respective friends lists rather using numeric pin identification email address associated user blackberry recent blackberry devices also exchange bbm contacts using near field communication technology users also set animated gif pictures display pictures although animated pictures 32kb size limit release blackberry messenger 6.0 introduced additional traits update focused social communication mediums including 'bbm connected apps allow user invite friends share favourite blackberry applications late-december 2011 audience measurement company bbm canada sued rim infringing trademark bbm using initialism blackberry messenger bbm canada used initialism former name bureau broadcast measurement company cited received phone calls users believed connected rim however rim asked case dropped two organizations different industries suit dismissed bbm canada ultimately re-branded numeris release blackberry messenger 7.0 december 2012 voice chat bbm voice call introduced bbm protected secure encrypted enterprise-level messenger launched june 2014 june 27 2016 announced indonesia-based emtek group acquired licensing rights bbm blackberry limited would provide bbm api emtek part six-year 207 million deal 2017 bbm servers moved data center canada google cloud platform-based data center asia april 18 2019 bbm announced discontinue bbm consumer service globally may 31 year users switch paid bbme enterprise version messenger bbm widely reputed uptime reliability however october 10 2011 users service north america europe middle east africa widely affected outage provider rim uk headquarters slough berkshire outage lasted two days blackberry messenger reported unavailable thus seriously affecting company reputation blackberry ceo thorsten heins announced may 14 2013 blackberry messenger available ios android summer 2013 would mark first steps blackberry messenger reaching beyond platform never available competing hardware rumoured blackberry messenger would launch june 27 2013 android ios later denied blackberry actual release date yet announced june 21 2013 blackberry messenger application spotted play store however turned fake worldwide release bbm android slated september 21 2013 officially announced blackberry also announced app would require android versions older 4.x.x ice cream sandwich blackberry confirmed bbm iphone would release september 22 day later official android release would work iphones running ios 6 later however worldwide rollout bbm android iphone september 21 2013 1.1 million android users downloaded leaked blackberry messenger apk caused blackberry cease launching blackberry messenger android ios platforms bbm officially released ios android october 21 2013 5 million downloads recorded first 8 hours release bbm late 2013 no.1 free app app store google play store total app 10 million downloads first day 24 february 2014 blackberry officially confirmed bbm windows phone nokia x would released q2 2014 nokia confirmed bbm would preinstalled nokia x devices june 2016 bbm longer offered windows store april 18 2019 announced bbm consumer service android ios shutting may 31 2019 bbm multi-platform offer personal chats group chat 250 people status updates send receive messages 2000 characters bbm channels bbm voice bbm shop available android ios early january 2014 beta update bbm android released testers update included bbm voice bbm channels february 2014 update 2.0.0.13 officially released android ios users containing awaited features along features including new emoticons changes including new look updates featuring choices show contacts channels filters november 4 2014 bbm scored 1 7 points electronic frontier foundation secure messaging scorecard lost points communications encrypted key provider n't access i.e communications end-to-end encrypted users ca n't verify contacts identities past messages secure encryption keys stolen i.e app provide forward secrecy code open independent review i.e code open-source security design properly documented recent independent code audit enterprise version bbm protected initially scored 3 7 points updated 5 7 points additional information provided blackberry reflected eff changelog dated november 14 2014 lost points past messages secure encryption keys stolen code open independent review may 2011 rim claimed 43 million active blackberry messenger users worldwide 2013 2014 number bbm users increases sharply 100 million 2016 bbm reached 889 million users world ranked 2nd top messaging apps first place belongs telegram january 2018 least 63 million monthly users indonesia | [
7148,
2450,
3762,
4387,
3350,
6336,
7967,
7619,
2555,
291,
2284,
7170,
1544,
2201,
6624,
1369,
5571,
6629,
5486,
1014,
4337,
6550,
4887,
1958,
1210,
2048,
2233,
3050,
2880,
4634,
6312,
6668,
2795,
5535,
4380
] | Test |
2,049 | 5 | Mozilla_localizations:mozilla localizations mozilla localizations localized versions mozilla products usually entails product translated certain language language region specific features added localization normally carried teams volunteers mozilla firefox heavily localized cross-platform web browser date first official release november 2004 available 28 different locales including british english/american english european spanish/argentine spanish chinese traditional chinese characters/simplified chinese characters firefox 4 initially shipped 80 locales introduced 10 new locales including 6 african languages following table lists releases firefox precursors microsoft windows operating system listing locales available end version releases mozilla thunderbird email application somewhat fewer localised releases initial release us english since released 45 languages 47 locales though much mozilla web content localized extent localization varies locale locale example mozilla firefox privacy policy currently available english | [
1152,
4565,
4655,
2812,
2451,
4755,
5542,
5984,
4759,
893,
5549,
5283,
7975,
6802,
5821,
7628,
1276,
6809,
5127,
393,
5571,
1190,
3291,
2574,
3383,
3548,
6368,
6458,
7015,
8006,
5506,
3043,
4352,
4725,
6221,
7028,
520,
340,
3057,
5699,
... | Test |
2,050 | 5 | Extended_superframe:extended superframe telecommunications extended superframe esf t1 framing standard esf sometimes called d5 framing first used d5 channel bank invented 1980s preferred predecessor superframe includes cyclic redundancy check crc 4000 bit/s channel capacity data link channel used pass out-of-band data equipment requires less frequent synchronization earlier superframe format provides on-line real-time monitoring circuit capability operating condition extended superframe 24 frames long framing bit frame used following manner crc computed using polynomial 24×193 4632 bits framing data previous superframe crc bits forced 1 purpose crc computation purpose small crc take immediate action keep statistics performance link like predecessor superframe every sixth frame least-significant data bit used robbed-bit signaling call supervision state however four bits abcd per channel per extended superframe rather two bits ab provided per superframe unlike superframe possible avoid robbed-bit signalling send call supervision data link instead | [
5714,
2982,
2236,
7888
] | Validation |
2,051 | 3 | System_573:system 573 system 573 series arcade system boards konami based original playstation hardware used primarily konami bemani series music video game arcades commonly dance dance revolution series introduced 1998 system 573 available two variants analog digital i/o boards dubbed bemani system 573 analog bemani system 573 digital respectively along third variant called system 573 satellite terminal allows 8 cabinets networked central one | [
5055
] | Test |
2,052 | 3 | Treasure_Island_(1984_video_game):treasure island 1984 video game treasure island 1984 computer game based book treasure island robert louis stevenson game player takes role jim hawkins protagonist book battle hordes pirates final showdown long john silver game uses flip-screen style programming done greg duddle music rendered david whittaker version commodore 64 msx released 1984 commodore plus/4 version 1985 start game jim escaped stockade unarmed one possible exit next screen right finds throwing pirate trick throwing cutlass obtain however would foolhardy kill pirate since pirate blocking access anything instead player find pirate blocking access exit perhaps power-up kill thus advancing progress game strategic rationing cutlasses i.e knowing pick use order progress around island major gameplay element none pirates move around throw cutlass jim moved range pirate question lose cutlass always another use pirate rarely throws one cutlass jim hit cutlass thrown touches pirate loses life starts beginning screen however moves way time cutlass lands ground throw pirate kill killed pirate disappears allowing jim pass changed theme pirates asia game re-released willow pattern adventure another adventure game named treasure island published windham classics year 1985 | [
2908
] | Test |
2,053 | 4 | Security_level_management:security level management security level management slm comprises quality assurance system electronic information security aim slm display security status transparently across company time make security measurable quantity transparency measurability form prerequisites making security proactively monitorable improved continuously slm oriented towards phases deming cycle/plan-do-check-act pdca cycle within scope slm abstract security policies compliance guidelines company transposed operative measureable specifications security infrastructure operative aims form security level reached security level checked permanently current performance security systems malware scanner patch systems etc. deviations recognised early adjustments made security system slm falls range duties chief security officer cso chief information officer cio chief information security officer ciso report directly executive board security data availability slm related disciplines security security event management siem analysts gartner summarise magic quadrant security information event management define follows … sim provides reporting analysis data primarily host systems applications secondarily security devices — support security policy compliance management internal threat management regulatory compliance initiatives sim supports monitoring incident management activities security organization … sem improves security incident response capabilities sem processes near-real-time data security devices network devices systems provide real-time event management security operations … sim sem relate infrastructure realising superordinate security aims descriptive strategic management system aims measures revisions actions derived slm unites requisite steps realising measurable functioning security structure management control cycle slm categorised strategic panoply governance via suitable organisation structures processes ensures supports corporate strategy objectives slm allows csos cios cisos prove slm contributing towards protecting electronic data relevant processes adequately therefore makes contribution part governance defining security level plan company specifies security policies executive management defines aims relation integrity confidentiality availability authority classified data order able verify compliance specifications concrete aims individual security systems company need derived abstract security policies security level consists collection measurable limiting threshold values example operative aims like anti-virus systems uk sites need up-to-date longer four hours publication current definition need derived superordinate security policies like employees able work without interrupted limiting threshold values specified separately individually different sites locations countries infrastructure on-site local determining factors need taken consideration example office buildings uk normally equipped high-speed dedicated lines wholly realistic limit deadline supplying computers newest anti-virus definitions hours factory asia slow modem link web realistic limiting value would set somewhat higher control manual control objectives information related technology cobit cobit provides companies instructions transposing subordinate abstract aims measurable aims steps collecting analysing data information current status systems gleaned log file status reports provided individual anti-virus anti-spyware anti-spam consoles monitoring reporting solutions analysing software applications software houses simplify accelerate data collection checking security level check slm prescribes continual reconciliation defined security level current measured values automated real-time reconciliation supplies companies permanent status report security status across locations adjusting security structure act efficient slm allows trend analyses long-term comparative assessments made rolling observation security level weak spots network identified early appropriate adjustments made proactively security systems besides defining specifications engineering introducing operating monitoring maintaining improving documented information security management system iso/iec 27001 also defines specifications implementing suitable security mechanisms infrastructure library itil collection best practices control processes goes far beyond security relation supplies criteria security officers conceive security independent qualitatively measurable service integrate universe business-process-oriented processes itil also works top policies processes procedures job-related instructions assumes superordinate also operative aims need planned implemented controlled evaluated adjusted | [] | Validation |
2,054 | 1 | Database:database database organized collection data generally stored accessed electronically computer system databases complex often developed using formal design modeling techniques database management system dbms software interacts end users applications database capture analyze data dbms software additionally encompasses core facilities provided administer database sum total database dbms associated applications referred database system often term database also used loosely refer dbms database system application associated database computer scientists may classify database-management systems according database models support relational databases became dominant 1980s model data rows columns series tables vast majority use sql writing querying data 2000s non-relational databases became popular referred nosql use different query languages formally database refers set related data way organized access data usually provided database management system dbms consisting integrated set computer software allows users interact one databases provides access data contained database although restrictions may exist limit access particular data dbms provides various functions allow entry storage retrieval large quantities information provides ways manage information organized close relationship term database often used casually refer database dbms used manipulate outside world professional information technology term database often used refer collection related data spreadsheet card index size usage requirements typically necessitate use database management system existing dbmss provide various functions allow management database data classified four main functional groups database dbms conform principles particular database model database system refers collectively database model database management system database physically database servers dedicated computers hold actual databases run dbms related software database servers usually multiprocessor computers generous memory raid disk arrays used stable storage raid used recovery data disks fail hardware database accelerators connected one servers via high-speed channel also used large volume transaction processing environments dbmss found heart database applications dbmss may built around custom multitasking kernel built-in networking support modern dbmss typically rely standard operating system provide functions since dbmss comprise significant market computer storage vendors often take account dbms requirements development plans databases dbmss categorized according database model support relational xml type computer run server cluster mobile phone query language used access database sql xquery internal engineering affects performance scalability resilience security sizes capabilities performance databases respective dbmss grown orders magnitude performance increases enabled technology progress areas processors computer memory computer storage computer networks development database technology divided three eras based data model structure navigational sql/relational post-relational two main early navigational data models hierarchical model codasyl model network model relational model first proposed 1970 edgar f. codd departed tradition insisting applications search data content rather following links relational model employs sets ledger-style tables used different type entity mid-1980s computing hardware become powerful enough allow wide deployment relational systems dbmss plus applications early 1990s however relational systems dominated large-scale data processing applications remain dominant ibm db2 oracle mysql microsoft sql server searched dbms dominant database language standardised sql relational model influenced database languages data models object databases developed 1980s overcome inconvenience object-relational impedance mismatch led coining term post-relational also development hybrid object-relational databases next generation post-relational databases late 2000s became known nosql databases introducing fast key-value stores document-oriented databases competing next generation known newsql databases attempted new implementations retained relational/sql model aiming match high performance nosql compared commercially available relational dbmss introduction term database coincided availability direct-access storage disks drums mid-1960s onwards term represented contrast tape-based systems past allowing shared interactive use rather daily batch processing oxford english dictionary cites 1962 report system development corporation california first use term data-base specific technical sense computers grew speed capability number general-purpose database systems emerged mid-1960s number systems come commercial use interest standard began grow charles bachman author one product integrated data store ids founded database task group within codasyl group responsible creation standardization cobol 1971 database task group delivered standard generally became known codasyl approach soon number commercial products based approach entered market codasyl approach relied manual navigation linked data set formed large network applications could find records one three methods later systems added b-trees provide alternate access paths many codasyl databases also added straightforward query language however final tally codasyl complex required significant training effort produce useful applications ibm also dbms 1966 known information management system ims ims development software written apollo program system/360 ims generally similar concept codasyl used strict hierarchy model data navigation instead codasyl network model concepts later became known navigational databases due way data accessed bachman 1973 turing award presentation programmer navigator ims classified ibm hierarchical database idms cincom systems total database classified network databases ims remains use edgar codd worked ibm san jose california one offshoot offices primarily involved development hard disk systems unhappy navigational model codasyl approach notably lack search facility 1970 wrote number papers outlined new approach database construction eventually culminated groundbreaking relational model data large shared data banks paper described new system storing working large databases instead records stored sort linked list free-form records codasyl codd idea use table fixed-length records table used different type entity linked-list system would inefficient storing sparse databases data one record could left empty relational model solved splitting data series normalized tables relations optional elements moved main table would take room needed data may freely inserted deleted edited tables dbms whatever maintenance needed present table view application/user relational model also allowed content database evolve without constant rewriting links pointers relational part comes entities referencing entities known one-to-many relationship like traditional hierarchical model many-to-many relationship like navigational network model thus relational model express hierarchical navigational models well native tabular model allowing pure combined modeling terms three models application requires instance common use database system track information users name login information various addresses phone numbers navigational approach data would placed single record unused items would simply placed database relational approach data would normalized user table address table phone number table instance records would created optional tables address phone numbers actually provided linking information back together key system relational model bit information used key uniquely defining particular record information collected user information stored optional tables would found searching key instance login name user unique addresses phone numbers user would recorded login name key simple re-linking related data back single collection something traditional computer languages designed navigational approach would require programs loop order collect records relational approach would require loops collect information one record codd suggestions set-oriented language would later spawn ubiquitous sql using branch mathematics known tuple calculus demonstrated system could support operations normal databases inserting updating etc well providing simple system finding returning sets data single operation codd paper picked two people berkeley eugene wong michael stonebraker started project known ingres using funding already allocated geographical database project student programmers produce code beginning 1973 ingres delivered first test products generally ready widespread use 1979 ingres similar system r number ways including use language data access known quel time ingres moved emerging sql standard ibm one test implementation relational model prtv production one business system 12 discontinued honeywell wrote mrds multics two new implementations alphora dataphor rel dbms implementations usually called relational actually sql dbmss 1970 university michigan began development micro information management system based d.l childs set-theoretic data model micro used manage large data sets us department labor u.s. environmental protection agency researchers university alberta university michigan wayne state university ran ibm mainframe computers using michigan terminal system system remained production 1998 1970s 1980s attempts made build database systems integrated hardware software underlying philosophy integration would provide higher performance lower cost examples ibm system/38 early offering teradata britton lee inc. database machine another approach hardware support database management icl cafs accelerator hardware disk controller programmable search capabilities long term efforts generally unsuccessful specialized database machines could keep pace rapid development progress general-purpose computers thus database systems nowadays software systems running general-purpose hardware using general-purpose computer data storage however idea still pursued certain applications companies like netezza oracle exadata ibm started working prototype system loosely based codd concepts system r early 1970s first version ready 1974/5 work started multi-table systems data could split data record optional stored single large chunk subsequent multi-user versions tested customers 1978 1979 time standardized query language – sql – added codd ideas establishing workable superior codasyl pushing ibm develop true production version system r known sql/ds later database 2 db2 larry ellison oracle database simply oracle started different chain based ibm papers system r. though oracle v1 implementations completed 1978 n't oracle version 2 ellison beat ibm market 1979 stonebraker went apply lessons ingres develop new database postgres known postgresql postgresql often used global mission critical applications .org .info domain name registries use primary data store many large companies financial institutions sweden codd paper also read mimer sql developed mid-1970s uppsala university 1984 project consolidated independent enterprise another data model entity–relationship model emerged 1976 gained popularity database design emphasized familiar description earlier relational model later entity–relationship constructs retrofitted data modeling construct relational model difference two become irrelevant 1980s ushered age desktop computing new computers empowered users spreadsheets like lotus 1-2-3 database software like dbase dbase product lightweight easy computer user understand box c. wayne ratliff creator dbase stated dbase different programs like basic c fortran cobol lot dirty work already done data manipulation done dbase instead user user concentrate rather mess dirty details opening reading closing files managing space allocation dbase one top selling software titles 1980s early 1990s 1990s along rise object-oriented programming saw growth data various databases handled programmers designers began treat data databases objects say person data database person attributes address phone number age considered belong person instead extraneous data allows relations data relations objects attributes individual fields term object-relational impedance mismatch described inconvenience translating programmed objects database tables object databases object-relational databases attempt solve problem providing object-oriented language sometimes extensions sql programmers use alternative purely relational sql programming side libraries known object-relational mappings orms attempt solve problem xml databases type structured document-oriented database allows querying based xml document attributes xml databases mostly used applications data conveniently viewed collection documents structure vary flexible highly rigid examples include scientific articles patents tax filings personnel records nosql databases often fast require fixed table schemas avoid join operations storing denormalized data designed scale horizontally recent years strong demand massively distributed databases high partition tolerance according cap theorem impossible distributed system simultaneously provide consistency availability partition tolerance guarantees distributed system satisfy two guarantees time three reason many nosql databases using called eventual consistency provide availability partition tolerance guarantees reduced level data consistency newsql class modern relational databases aims provide scalable performance nosql systems online transaction processing read-write workloads still using sql maintaining acid guarantees traditional database system databases used support internal operations organizations underpin online interactions customers suppliers see enterprise software databases used hold administrative information specialized data engineering data economic models examples include computerized library systems flight reservation systems computerized parts inventory systems many content management systems store websites collections webpages database one way classify databases involves type contents example bibliographic document-text statistical multimedia objects another way application area example accounting music compositions movies banking manufacturing insurance third way technical aspect database structure interface type section lists adjectives used characterize different kinds databases connolly begg define database management system dbms software system enables users define create maintain control access database dbms acronym sometime extended indicated underlying database model rdbms relational oodbms ordbms object orientated model ordbms object-relational extensions indicate characteristic ddbms distributed database management systems functionality provided dbms vary enormously core functionality storage retrieval update data codd proposed following functions services fully-fledged general purpose dbms provide also generally expected dbms provide set utilities purposes may necessary administer database effectively including import export monitoring defragmentation analysis utilities core part dbms interacting database application interface sometimes referred database engine often dbmss configuration parameters statically dynamically tuned example maximum amount main memory server database use trend minimise amount manual configuration cases embedded databases need target zero-administration paramount large major enterprise dbmss tended increase size functionality involved thousands human years development effort lifetime early multi-user dbms typically allowed application reside computer access via terminals terminal emulation software client–server architecture development application resided client desktop database server allowing processing distributed evolved multitier architecture incorporating application servers web servers end user interface via web browser database directly connected adjacent tier general-purpose dbms provide public application programming interfaces api optionally processor database languages sql allow applications written interact database special purpose dbms may use private api specifically customised linked single application example email system performing many functions general-purpose dbms message insertion message deletion attachment handling blocklist lookup associating messages email address forth however functions limited required handle email external interaction database via application program interfaces dbms range database tool allows users execute sql queries textually graphically web site happens use database store search information programmer code interactions database sometimes referred datasource via application program interface api via database language particular api language chosen need supported dbms possible indirectly via pre-processor bridging api api aim database independent odbc commonly known example common api include jdbc ado.net database languages special-purpose languages allow one following tasks sometimes distinguished sublanguages database languages specific particular data model notable examples include database language may also incorporate features like database storage container physical materialization database comprises internal physical level database architecture also contains information needed e.g. metadata data data internal data structures reconstruct conceptual level external level internal level needed putting data permanent storage generally responsibility database engine a.k.a storage engine though typically accessed dbms underlying operating system often using operating systems file systems intermediates storage layout storage properties configuration setting extremely important efficient operation dbms thus closely maintained database administrators dbms operation always database residing several types storage e.g. memory external storage database data additional needed information possibly large amounts coded bits data typically reside storage structures look completely different way data look conceptual external levels ways attempt optimize best possible levels reconstruction needed users programs well computing additional types needed information data e.g. querying database dbmss support specifying character encoding used store data multiple encodings used database various low-level database storage structures used storage engine serialize data model written medium choice techniques indexing may used improve performance conventional storage row-oriented also column-oriented correlation databases often storage redundancy employed increase performance common example storing materialized views consist frequently needed external views query results storing views saves expensive computing time needed downsides materialized views overhead incurred updating keep synchronized original updated database data cost storage redundancy occasionally database employs storage redundancy database objects replication one copies increase data availability improve performance simultaneous multiple end-user accesses database object provide resiliency case partial failure distributed database updates replicated object need synchronized across object copies many cases entire database replicated database security deals various aspects protecting database content owners users ranges protection intentional unauthorized database uses unintentional database accesses unauthorized entities e.g. person computer program database access control deals controlling person certain computer program allowed access information database information may comprise specific database objects e.g. record types specific records data structures certain computations certain objects e.g. query types specific queries using specific access paths former e.g. using specific indexes data structures access information database access controls set special authorized database owner personnel uses dedicated protected security dbms interfaces may managed directly individual basis assignment individuals privileges groups elaborate models assignment individuals groups roles granted entitlements data security prevents unauthorized users viewing updating database using passwords users allowed access entire database subsets called subschemas example employee database contain data individual employee one group users may authorized view payroll data others allowed access work history medical data dbms provides way interactively enter update database well interrogate capability allows managing personal databases data security general deals protecting specific chunks data physically i.e. corruption destruction removal e.g. see physical security interpretation parts meaningful information e.g. looking strings bits comprise concluding specific valid credit-card numbers e.g. see data encryption change access logging records accessed attributes changed changed logging services allow forensic database audit later keeping record access occurrences changes sometimes application-level code used record changes rather leaving database monitoring set attempt detect security breaches database transactions used introduce level fault tolerance data integrity recovery crash database transaction unit work typically encapsulating number operations database e.g. reading database object writing acquiring lock etc abstraction supported database also systems transaction well defined boundaries terms program/code executions included transaction determined transaction programmer via special transaction commands acronym acid describes ideal properties database transaction atomicity consistency isolation durability database built one dbms portable another dbms i.e. dbms run however situations desirable migrate database one dbms another reasons primarily economical different dbmss may different total costs ownership tcos functional operational different dbmss may different capabilities migration involves database transformation one dbms type another transformation maintain possible database related application i.e. related application programs intact thus database conceptual external architectural levels maintained transformation may desired also aspects architecture internal level maintained complex large database migration may complicated costly one-time project factored decision migrate spite fact tools may exist help migration specific dbmss typically dbms vendor provides tools help importing databases popular dbmss designing database application next stage building database typically appropriate general-purpose dbms selected used purpose dbms provides needed user interfaces used database administrators define needed application data structures within dbms respective data model user interfaces used select needed dbms parameters like security related storage allocation parameters etc. database ready data structures needed components defined typically populated initial application data database initialization typically distinct project many cases using specialized dbms interfaces support bulk insertion making operational cases database becomes operational empty application data data accumulated operation database created initialised populated needs maintained various database parameters may need changing database may need tuned tuning better performance application data structures may changed added new related application programs may written add application functionality etc sometimes desired bring database back previous state many reasons e.g. cases database found corrupted due software error updated erroneous data achieve backup operation done occasionally continuously desired database state i.e. values data embedding database data structures kept within dedicated backup files many techniques exist effectively decided database administrator bring database back state e.g. specifying state desired point time database state files used restore state static analysis techniques software verification applied also scenario query languages particular *abstract interpretation framework extended field query languages relational databases way support sound approximation techniques semantics query languages tuned according suitable abstractions concrete domain data abstraction relational database system many interesting applications particular security purposes fine grained access control watermarking etc dbms features might include increasingly calls single system incorporates core functionalities build test deployment framework database management source control borrowing developments software industry market offerings devops database first task database designer produce conceptual data model reflects structure information held database common approach develop entity-relationship model often aid drawing tools another popular approach unified modeling language successful data model accurately reflect possible state external world modeled example people one phone number allow information captured designing good conceptual data model requires good understanding application domain typically involves asking deep questions things interest organization like customer also supplier product sold two different forms packaging product different products plane flies new york dubai via frankfurt one flight two maybe even three answers questions establish definitions terminology used entities customers products flights flight segments relationships attributes producing conceptual data model sometimes involves input business processes analysis workflow organization help establish information needed database left example help deciding whether database needs hold historic data well current data produced conceptual data model users happy next stage translate schema implements relevant data structures within database process often called logical database design output logical data model expressed form schema whereas conceptual data model theory least independent choice database technology logical data model expressed terms particular database model supported chosen dbms terms data model database model often used interchangeably article use data model design specific database database model modeling notation used express design popular database model general-purpose databases relational model precisely relational model represented sql language process creating logical database design using model uses methodical approach known normalization goal normalization ensure elementary fact recorded one place insertions updates deletions automatically maintain consistency final stage database design make decisions affect performance scalability recovery security like depend particular dbms often called physical database design output physical data model key goal stage data independence meaning decisions made performance optimization purposes invisible end-users applications two types data independence physical data independence logical data independence physical design driven mainly performance requirements requires good knowledge expected workload access patterns deep understanding features offered chosen dbms another aspect physical database design security involves defining access control database objects well defining security levels methods data database model type data model determines logical structure database fundamentally determines manner data stored organized manipulated popular example database model relational model sql approximation relational uses table-based format common logical data models databases include object-relational database combines two related structures physical data models include models include specialized models optimized particular types data database management system provides three views database data typically one conceptual logical physical internal view data number different external views allows users see database information business-related way rather technical processing viewpoint example financial department company needs payment details employees part company expenses need details employees interest human resources department thus different departments need different views company database three-level database architecture relates concept data independence one major initial driving forces relational model idea changes made certain level affect view higher level example changes internal level affect application programs written using conceptual level interfaces reduces impact making physical changes improve performance conceptual view provides level indirection internal external one hand provides common view database independent different external view structures hand abstracts away details data stored managed internal level principle every level even every external view presented different data model practice usually given dbms uses data model external conceptual levels e.g. relational model internal level hidden inside dbms depends implementation requires different level detail uses types data structure types separating external conceptual internal levels major feature relational database model implementations dominate 21st century databases database technology active research topic since 1960s academia research development groups companies example ibm research research activity includes theory development prototypes notable research topics included models atomic transaction concept related concurrency control techniques query languages query optimization methods raid database research area several dedicated academic journals example acm transactions database systems -tods data knowledge engineering -dke annual conferences e.g. acm sigmod acm pods vldb ieee icde | [
5716,
1441,
1449,
5736,
30,
4337,
4340,
42,
43,
5768,
7205,
2956,
5771,
4356,
5775,
2961,
5778,
7213,
7215,
4366,
5784,
84,
7231,
89,
92,
1526,
98,
2988,
7248,
3005,
7257,
3010,
3011,
1550,
1554,
1564,
136,
141,
4430,
5852,
3035,
5858... | Test |
2,055 | 7 | ShopKeep:shopkeep shopkeep cloud-based ipad point sale pos system headquartered new york ny founded 2008 pos system used 23,000 small businesses united states canada retail shops coffee shops restaurants bars system allows merchants ring sales print email receipts pop cash drawer accept credit cards print remotely kitchen right ipad android tablet web-based backoffice allows inventory employee customer management analytics reporting smartphone dashboard app allows merchants view real-time store sales remotely shopkeep co-founded jason richelson co-founder several retail stores brooklyn new york city amy bennett wine store brooklyn fall 2008 point sale software crashed last time david olk former director iac joined third co-founder coo july 2011 help jason amy execute vision raise outside capital eventually closing company first external raise 6 months later december 2011 jason point sale system stores broke decided simpler smarter solution small businesses developed shopkeep pos cloud-based point sale system allow merchants access data even store also developed eyes retailer used expertise create user interface intuitive merchants cashiers stand behind counter jason hired bill walton original system architect engineer build shopkeep platform october 2008 august 2011 first ipad version shopkeep released app store july 2015 shopkeep raised 97 million funding | [
2961,
7194,
4575,
4440
] | Validation |
2,056 | 9 | Flagship_compiler:flagship compiler flagship object oriented procedural programming language based xbase language dialect conventions flagship available cross-compatible different computer platforms linux unix microsoft windows true compiler translates popular database 4gl xbase source code native 32-bit 64-bit executables using source-code databases first flagship version introduced multisoft datentechnik gmbh 1992 port clipper dbase iii+ foxbase foxpro applications different operating systems i.e openserver aix solaris hp-ux sinix many unix systems 1995 also linux ports became available 2002 visual flagship abbreviated vfs announced linux 2004 additionally 32/64-bit based windows operating systems current vfs product line covers common 32-bit 64-bit operating systems windows nt 2000 xp vista 7 server 2008 flagship programming development tool compilers designed mainly professional software developers simple interface also perfectly suitable semi-professionals advanced computer users need create database applications minimal programming effort thanks full clipper compatibility also best suited porting already available dos applications nearly unix linux ms-windows systems learning curve already familiar xbase dialect like dbase foxbase foxpro clipper visual objects etc millions well-trained programmers using easy powerful 4gl syntax years directly switch flagship n't programming experience xbase familiar language c c++ java pascal delphi basic perl etc learning curve short 10 commands able create first application visual flagship makes gui-based application available textual xbase code automatically course object oriented modify behavior using either classes corresponding functions procedural programming source application supports gui textual stream mode e.g web background i/o mode either detected automatically current environment heterogenal application specified compile time run-time using command-line switch example statements stored text file address.prg ... compiled simply ... creates self-containing executable i.e address.exe windows additional examples screenshots available via external links | [
4212,
2451,
3255,
5983,
4759,
7246,
900,
993,
6428,
5117,
1361,
2740,
3368,
578,
4705,
6029,
4070,
5948,
5091,
5506,
2803,
1774,
336,
4543,
5965,
7687,
2619,
1803,
1435,
3757
] | Train |
2,057 | 5 | Fiber_Distributed_Data_Interface:fiber distributed data interface fiber distributed data interface fddi standard data transmission local area network uses optical fiber standard underlying physical medium although also later specified use copper cable case may called cddi copper distributed data interface standardized tp-pmd twisted-pair physical medium-dependent also referred tp-ddi twisted-pair distributed data interface fddi effectively made obsolete local networks fast ethernet offered 100 mbit/s speeds much lower cost since 1998 gigabit ethernet due speed even lower cost ubiquity fddi provides 100 mbit/s optical standard data transmission local area network extend range although fddi logical topology ring-based token network use ieee 802.5 token ring protocol basis instead protocol derived ieee 802.4 token bus timed token protocol addition covering large geographical areas fddi local area networks support thousands users fddi offers dual-attached station das counter-rotating token ring topology single-attached station sas token bus passing ring topology fddi product american national standards institute x3t9.5 x3t12 conforms open systems interconnection osi model functional layering using protocols standards process started mid 1980s fddi-ii version fddi described 1989 added circuit-switched service capability network could also handle voice video signals work started connect fddi networks synchronous optical networking sonet technology fddi network contains two rings one secondary backup case primary ring fails primary ring offers 100 mbit/s capacity network requirement secondary ring backup also carry data extending capacity 200 mbit/s single ring extend maximum distance dual ring extend fddi larger maximum-frame size 4,352 bytes standard ethernet family supports maximum-frame size 1,500 bytes allowing better effective data rates cases designers normally constructed fddi rings network topology dual ring trees small number devices typically infrastructure devices routers concentrators rather host computers dual-attached rings host computers connect single-attached devices routers concentrators dual ring degenerate form simply collapses single device typically computer-room contained whole dual ring although implementations deployed fddi metropolitan area network fddi requires network topology dual ring actually passes connected device requires device remain continuously operational standard actually allows optical bypasses network engineers consider unreliable error-prone devices workstations minicomputers might come control network managers suitable connection dual ring alternative using dual-attached connection workstation obtain degree resilience dual-homed connection made simultaneously two separate devices fddi ring one connections becomes active one automatically blocked first connection fails backup link takes perceptible delay fddi data frame format pa preamble sd start delimiter fc frame control da destination address sa source address pdu protocol data unit packet data unit fcs frame check sequence checksum ed/fs end delimiter frame status internet engineering task force defined standard transmission internet protocol would protocol data unit case fddi first proposed june 1989 revised 1990 aspects protocol compatible ieee 802.2 standard logical link control example 48-bit mac addresses became popular ethernet family thus protocols address resolution protocol arp could common well fddi considered attractive campus backbone network technology early mid 1990s since existing ethernet networks offered 10 mbit/s data rates token ring networks offered 4 mbit/s 16 mbit/s rates thus relatively high-speed choice era 1994 vendors included cisco systems national semiconductor network peripherals syskonnect acquired marvell technology group 3com fddi installations largely replaced ethernet deployments fddi standards included | [
7148,
709,
4676,
4677,
3620,
6428,
7170,
4683,
6432,
1462,
5039,
4693,
6446,
2214,
737,
2219,
3640,
4709,
1114,
5760,
3312,
7214,
7217,
2612,
3337,
1900,
7953,
456,
6879,
2281,
6521,
6172,
106,
1543,
2644,
6531,
2650,
121,
4414,
7637,
4... | Validation |
2,058 | 2 | Iskolinux:iskolinux iskolinux pronounced is-kooh-lee-nux linux distribution packaged maintained manila upm information management system part university philippines thrust migrate linux coined term filipino word iskolar comes phrase iskolar ng bayan loosely referring students national scholars linux operating system iskolinux based beatrix derived knoppix ubuntu turn derived debian operating system lead developers project ariel s. betan eric manuel n. pareja system developers upm distribution live cd installer giving user option boot operating system directly cd without requiring installation local hard drive iskolinux primarily designed desktop operating system include applications commonly used students faculty staff recent version iskolinux v0.12 uses linux kernel version 2.6.7 gnome 2.8 desktop manager future plans include installation commands manual desktop environment filipino | [
6761,
5571,
788,
578
] | Validation |
2,059 | 4 | No_Place_to_Hide_(Greenwald_book):place hide greenwald book place hide edward snowden nsa u.s. surveillance state 2014 non-fiction book american investigative journalist glenn greenwald first published may 13 2014 metropolitan books details greenwald role global surveillance disclosures revealed former national security agency contractor edward snowden documents snowden archive cited book freely available online book consists five chapters contact ten days hong kong collect harm surveillance fourth estate plus introduction epilogue introduction greenwald explains background blogger surveillance practices american government attracted edward snowden attention summarizes nature legality evolution practices greenwald concludes discussing global surveillance network created assistance technology companies unique role internet human history facilitator surveillance body book greenwald discusses became involved 2013 global surveillance disclosures began traveling hong kong meet edward snowden contacted greenwald anonymous source purporting evidence government surveillance greenwald continued investigate uncovered information later published much controversy book greenwald also discusses establishment media states traditionally avoid publishing anything would put odds government less helpful comes interests general public review washington post law professor david cole called place hide important illuminating book wrote would important illuminating greenwald able acknowledge choices face regulating surveillance modern age difficult simple answers slate gave mostly positive review stating book ’ offer in-depth portrait leaker serve good primer stake downloaded government ’ precious secrets onto thumb drive book positively reviewed henry porter guardian porter said found reacquainting details surveillance intrusion america nsa britain gchq simply shocking stories rolled last year almost much absorb ... greenwald book tough read find things disturbing porter said reading place hide wondered ... let spies probe lives inadequate controls earth fell propaganda massive apparatus protect control us critically porter felt book lacked ... chart timeline major revelations well proper index feel argument lost momentum middle ... concluding ... whole vigorously executed important book porter reserved criticism felt lack appreciation greenwald importance efforts ewen macaskill fellow guardian writers bringing disclosures publication glenn greenwald received 2014 geschwister-scholl-preis annual german literary award german edition place hide | [
5509
] | Validation |
2,060 | 2 | JACK_Audio_Connection_Kit:jack audio connection kit jack audio connection kit jack recursive acronym professional sound server daemon provides real-time low-latency connections audio midi data applications use api jack developed community open-source developers led paul davis open source award 2004 work key piece infrastructure de facto standard professional audio software linux since inception 2002 server free software licensed gnu gpl library licensed permissive gnu lgpl jack use alsa portaudio coreaudio ffado oss hardware back-ends additionally dummy driver useful sound output desired e.g offline rendering audio-over-udp driver exist runs linux macos solaris windows ios freebsd openbsd netbsd jack api standardized consensus two compatible implementations exist jack1 implemented plain c maintenance mode jack2 originally jackdmp re-implementation c++ led stéphane letz aggressive development introduced multi-processor scalability support operating systems linux scheduling requirements jack achieve sufficiently low latencies one driving forces behind real-time optimization effort linux kernel 2.6 series whose initial latency performance disappointing compared older 2.4 series real-time tuning work culminated numerous scheduling improvements mainline kernel creation -rt branch intrusive optimizations release 2.6.24 later config_preempt_rt patch | [
4759,
6011,
5571,
415,
3178,
578,
1435
] | Test |
2,061 | 5 | Contention_(telecommunications):contention telecommunications statistical time division multiplexing contention media access method used share broadcast medium contention computer network transmit data time first come-first served system breaks two computers attempt transmit time known collision avoid collisions carrier sensing mechanism used computer listens network attempting transmit network busy waits network quiets carrier detection computers continue listen network transmit computer detects another signal interferes signal sending stops transmitting computers wait random amount time attempt transmit contention methods popular media access control method lans one method handle collisions contention based system optimize collision detection subsequent recovery alternative method handle collisions contention based system attempt avoid systems may utilize strict scheduling guideline identify may use resources systems may senders listen channel immediately prior transmitting determine suitable times transmit collisions condition arises two data stations attempt transmit time shared channel two data stations attempt transmit time half duplex communication link contention based channel access multiple access protocol protocol data packet collisions may occur examples protocols telecommunication term contention also following less usual meanings | [
7052,
1618,
6071,
823,
5387,
7824,
8108,
3724,
3892,
1974,
4093,
1988
] | Validation |
2,062 | 5 | Frame_(networking):frame networking frame digital data transmission unit computer networking telecommunication packet switched systems frame simple container single network packet telecommunications systems frame repeating structure supporting time-division multiplexing frame typically includes frame synchronization features consisting sequence bits symbols indicate receiver beginning end payload data within stream symbols bits receives receiver connected system frame transmission ignores data detects new frame synchronization sequence osi model computer networking frame protocol data unit data link layer frames result final layer encapsulation data transmitted physical layer frame unit transmission link layer protocol consists link layer header followed packet frame separated next interframe gap frame series bits generally composed frame synchronization bits packet payload frame check sequence examples ethernet frames point-to-point protocol ppp frames fibre channel frames v.42 modem frames often frames several different sizes nested inside example using point-to-point protocol ppp asynchronous serial communication eight bits individual byte framed start stop bits payload data bytes network packet framed header footer several packets framed frame boundary octets telecommunications specifically time-division multiplex tdm time-division multiple access tdma variants frame cyclically repeated data block consists fixed number time slots one logical tdm channel tdma transmitter context frame typically entity physical layer tdm application examples sonet/sdh isdn circuit-switched b-channel tdma examples circuit switched data used early cellular voice services frame also entity time-division duplex mobile terminal may transmit time slots receive others | [
1618,
6879,
6265,
121,
7824,
5485,
2117,
2400,
5492,
3797,
3207,
585,
1022,
1869,
1974,
1784,
772,
1981,
5880,
5181,
3834,
1708
] | Test |
2,063 | 2 | Porteus_(operating_system):porteus operating system porteus formerly slax remix portable operating system based slackware require installation run fixed removable media usb flash drive compact disc porteus available 32-bit 64-bit version porteus project started slax remix beginning 2010 started community project using zen kernel improve update slax os community agreed new name project porteus named 'portability 'proteus 'proteus greek god sea capable changing form according naming announcement porteus forum project leader commented name find name kind synonym 'flexibility portable small flexible modular features included one name porteus porteus 4.0 available seven desktop variants cinnamon kde plasma 5 lxde lxqt mate openbox xfce porteus based substantially modified optimized version linux live scripts run disk usb stick changes saved onto portable device installed hard drive porteus even installed within another system without need create new partition porteus preloaded variety software user selects installing system downloaded selecting various options menu including one four windows management systems browser features porteus uses package manager utilizing slackware porteus kiosk specialized edition porteus operating system minimalist linux distribution web-only terminals firefox google chrome chromium opera set upon installation sole application porteus kiosk provides users locked computing environment designed deployed schools offices public libraries internet cafés business establishment provides internet access clients porteus kiosk installed cd/dvd usb flash drive hard drive bootable storage media compact flash sd/mmc memory cards prior installation system customized kiosk wizard utility allows system browser related tweaks porteus kiosk system open source available free-of-charge although number commercial services custom builds automatic updates software upgrades available version 3.7.0 porteus kiosk able run 32-bit i486 greater 64-bit x86_64 machines google chrome n't support 32-bit machines anymore developers distribution decided follow path hence release 4.0.0 porteus kiosk supports x86_64 architecture system lightweight terms size resources used default image 80 mb size custom kiosk iso depend choice added extra components adobe flash java additional fonts factors reviewing porteus 1.0 june 2011 joe zonker brockmeier wrote users 've missed kde 3.5.x treat porteus portable linux distribution offers 32-bit release trinity fork kde 3.5.x 64-bit release offers kde 4.6.4 distribution appeal everyone might interest enthusiasts live cd distributions old-school kde fans concluded ... porteus looks like nice portable linux distribution aimed expert least experienced linux users something appeal majority linux users particularly users prefer slightly larger depth available packages users nursing older hardware prefer portable distribution porteus interesting project custom live cd iso creation linux magazine wrote issue 160/2014 build portable linux distro porteus building customized linux distribution daunting proposition – unless use porteus wizard clever simple service lets create custom live cd distro fits usb stick loads ram | [
2179,
2187,
2909,
5724,
6086,
7528,
7894,
2559,
2935,
6453,
7555,
2585,
2228,
1487,
58,
3996,
7587,
4008,
1893,
7954,
1909,
5453,
5803,
6884,
7969,
1535,
6175,
7251,
4400,
1176,
3696,
7253,
474,
1179,
7635,
6902,
2297,
1941,
1561,
3023,
... | Test |
2,064 | 3 | Xconfig:xconfig xconfig short codice_1 target linux makefile graphical linux compilation utility uses qt xconfig utility invoked running codice_2 base linux source directory qt used since kernel 2.6 kernel 2.4 uses tcl/tk configuration interface gtk+ interface codice_3 also available since kernel 2.6 | [
5571,
486,
578,
1991,
1435
] | Validation |
2,065 | 3 | Senjyo:senjyo senjyo センジョー arcade game developed 1983 tehkan known tecmo title game translates japanese 'battlefield simple gameplay involves player controlling fixed turret tank shooting oncoming alien enemies cross-hair target certain number enemies must destroyed progress next stage original arcade cabinet cocktail table game ported published sony corporation 1984 msx computers 2005 senjyo re-released exclusively xbox part tecmo classic arcade collection | [] | Validation |
2,066 | 2 | Windows_10_Mobile_version_history:windows 10 mobile version history windows 10 mobile mobile operating system developed microsoft released manufacturing november 20 2015 made generally available march 17 2016 october 2017 microsoft announced would pause active development windows 10 mobile last feature update fall creators update future development windows 10 mobile limited maintenance releases security patches windows 10 mobile november update also known version 1511 codenamed threshold 2 first major update windows 10 mobile one series updates threshold codenames carries build number 10.0.10586 released public november 12 2015 update reached end service january 9 2018 windows 10 mobile anniversary update also known version 1607 codenamed redstone 1 second major update windows 10 mobile first series updates redstone codenames carries build number 10.0.14393 first preview released february 19 2016 released public august 16 2016 update reached end service release build 14393.2551 october 9 2018 windows 10 mobile creators update also known version 1703 codenamed redstone 2 third major update windows 10 mobile second series updates redstone codenames carries build number 10.0.15063 first preview released insiders august 17 2016 released public april 25 2017 update reached end service release build 15063.1868 june 11 2019 windows 10 mobile fall creators update also known version 1709 codenamed redstone 3 third major update windows 10 mobile third series updates redstone codenames carries build number 10.0.15254 despite sharing codename version number pc version windows 10 fall creators update redstone 3 update still build part redstone 2 branch first preview released insiders april 14 2017 released public october 24 2017 update set reached end service december 10 2019 | [
3937,
3263,
378,
2198,
6096,
4687,
1097,
1475,
6110,
7553,
5410,
7564,
422,
6844,
6136,
2245,
5781,
432,
435,
5442,
4377,
5090,
3340,
444,
5794,
447,
7602,
448,
6164,
458,
4759,
1534,
6885,
1536,
7619,
2999,
6528,
2290,
4774,
1181,
3711... | Test |
2,067 | 2 | Game_Sprockets:game sprockets game sprockets collection application programming interfaces apis supporting gaming classic mac os consisted four main parts drawsprocket inputsprocket soundsprocket netsprocket providing library pre-rolled routines common gaming tasks speechsprocket relabelled version speech recognition manager provided speech recognition support quickdraw 3d rave provided 3d hardware acceleration game sprockets first released 1996 saw minor use development cancelled 1997 os x included many features built-in libraries opengl replaced rave 3d acceleration layer netsprocket lives openplay although adoption limited early history macintosh computer strong gaming platform due high-resolution screen digital sound hardware fact every mac came equipped reasonable gaming controller mouse however gaming never supported strong way within apple cases actively discouraged 1990s mac platform greatly increased complexity profusion models different features supporting game across entire lineup required programmer learn intricacies different models time even figuring machine program installed standard solution mid-90s pc gaming evolved powerful market one drivers new computer purchases move ms-dos microsoft windows several microsoft staffers noticed game developers generally ignoring windows due better performance available dos decided windows needed support first-class gaming set ensuring windows would become preferred gaming platform future result introduction directx libraries greatly reduced complexity addressed many performance concerns 3d games became widespread library direct3d became decisive advantage directx grew become almost universal pc gaming mid-90s gaming mac largely dead combination high prices stagnating sales poor performance lack directx-like system resulted game developers leaving mac field droves microsoft several apple staffers took upon redress problem led chris desalvo result two-pronged effort one side game sprockets libraries along rave single target gaming platform pippin game sprockets released 29 march 1996 year wwdc game sprockets one many apple technologies ended development return steve jobs ceo position apple death announced march 1997 press release part wide series layoffs restructuring company moved mac os x based future desalvo wrote fairly lengthy open letter topic noting sprockets might come life future gamesprockets included four main libraries two associated ones discussed turn unlike pre-windows pc system displaying high-resolution color images always easy mac however getting details resolution color depth machine running required number tricks additionally common gaming tasks like switching resolutions fading black intricacies required programmer adjust differences color depth ignored drawsprocket library utilities help programmer address common problems among many separate functions calls allow user select main monitor game multi-screen configurations relatively common cleanly enumerating available resolutions switching various routines fading one image another instead black displaying background images various similar utilities major portion drawsprocket provided abstraction layer page flipping macs included ability page flip hardware others drawsprocket provided single api worked machine using hardware available falling back custom-tuned software blitters related code allowed developers easily create multiple framebuffers draw use page flipping calls quickly display mac always shipped input device suitable gaming mouse even cases devices better suited gaming like joysticks relatively easy make devices emulate mouse keyboard input however model stopped working well joysticks increasing complexity released 1990s new models several axes controlled potentiometers linear input cases mouse emulation simply n't work solution inputsprocket inputsprocket allowed hardware vendor provide driver possible input device driver handled communications input device also presented list capabilities inputsprocket manager inputsprocket displayed installed drivers single universal control panel games linking inputsprocket provided list operations wanted user control control panel user could map operation input apple supplied drivers mice keyboards inputsprocket one widely used game sprockets drivers supplied many devices worked mac greatly expanded mapping inputsprocket onto similar human interface device system part usb standard meant almost usb input device would work least level inputsprocket without effort part developer user macintosh sound manager supported digital sound earliest versions stereo much evolution soundsprocket added support including systems simulate 3d sound programmers could add soundsprocket support programs link in-game objects sounds would appear localized space netsprocket provided abstraction layer made easy developers add networking support games netsprocket supported either appletalk tcp/ip supported naming games player providing passwords used client/server architecture included option allow host run networking code without graphics netsprocket also included functionality assign player id teams player types players observers etc netsprocket also provided code message passing although protocol messages left programmer netsprocket one portion game sprockets lived project whole downsized code released open source apple developed new functionality multiple platform support latest versions support mac os windows linux speechsprocket included game sprockets consisted nothing re-badged version existing speech recognition manager like speechsprocket quickdraw 3d rave considered part overall game sprockets technology although developed supported separately rave thin hardware abstraction layer similar directx direct3d | [
1599,
4759,
6380,
100,
7673,
4875,
7372,
2085
] | Test |
2,068 | 5 | TCP_Fast_Open:tcp fast open computer networking tcp fast open tfo extension speed opening successive transmission control protocol tcp connections two endpoints works using tfo cookie tcp option cryptographic cookie stored client set upon initial connection server client later reconnects sends initial syn packet along tfo cookie data authenticate successful server may start sending data client even reception final ack packet three-way handshake skipping way round-trip delay lowering latency start data transmission cookie generated applying block cipher keyed key held secret server client ip address generating authentication tag difficult third parties spoof even forge source ip address make two-way connections server ip addresses although uses cryptographic techniques generate cookie tfo intended provide security three-way handshake replaces give form cryptographic protection resulting tcp connection provide identity assurance either endpoint also intended resistant man-in-the-middle attacks resistance required may used combination cryptographic protocol tls ipsec tfo proposal originally presented 2011 published rfc 7413 december 2014 tcp fast open shares goal bypassing three-way handshake tcp earlier proposal 1994 called t/tcp rfc 1644 contrast tcp fast open t/tcp paid attention security opening path vulnerabilities failing gain traction tfo implementations include following | [
6966,
3057,
2043,
4320,
7637,
2612,
578,
3819,
2644,
3426
] | Test |
2,069 | 7 | Payments_as_a_service:payments service payments service paas marketing phrase used describe software service connect group international payment systems architecture represented layer – overlay – resides top disparate systems provides two-way communications payment system paas communication governed standard apis created paas provider since 1980s credit cards international wire transfer systems like society worldwide interbank financial telecommunication swift primary methods making receiving electronic cross-border payments within individual countries payers payees used various electronic systems make payments united states instance federal reserve bank operates automated clearing house ach system eu countries direct debit preferred method facilitating electronic payments advent world wide web became necessary provide alternative payment systems first consumers hesitant use credit cards web due security concerns entrepreneurs tried market electronic wallet early 1994 cybercash allowed consumers make secure purchases internet cybercash eventually failed march 2000 paypal formed became predominant electronic wallet u.s similar regional services include webmoney yandex.money russia alipay china popular countries significant global reach paypal moneybookers skrill became regional electronic wallets providing greater liquidity still provide free flow funds popular electronic wallet solutions paas designed allow merchants market participants utilize local regional global payments options single interface complexity moving funds providers handled paas layer hidden user generally speaking one interface merchant paas one interface required merchants users required maintain one financial repository | [
330
] | Validation |
2,070 | 4 | BeyondCorp:beyondcorp beyondcorp implementation google zero-trust computer security concepts creating zero trust network open source implementation inspired googles research paper access proxy transcend | [
1805
] | Test |
2,071 | 2 | EPOC_(operating_system):epoc operating system epoc mobile operating system developed psion british company founded 1980 began 16-bit operating system psion x86-compatible devices later replaced 32-bit system x86 arm psion licensed 32-bit system hardware manufacturers ericsson distinguish 16-bit system 32-bit operating system sometimes epoc32 technologically major departure 16-bit incarnation came called epoc16 sibo 1998 32-bit version renamed symbian os nokia acquired rights symbian 2010 published symbian source code eclipse public license 2011 nokia rescinded open-source license subsequent releases software name epoc comes word epoch beginning era name shortened four letters accord names software innovations unix mach initially operating system capitalised epoc rather 'epoc since acronym change capital letters made recommendation psion marketing department thereafter rumour circulated technical press epoc acronym electronic piece cheese psion started developing 32-bit operating system 1994 kept epoc brand avoid confusion within company started calling old system epoc16 new one epoc32 became conventional within company refer epoc16 sibo codename psion 16-bit mobile computing initiative change freed use name epoc epoc32 june 1998 psion formed limited company telecommunications corporations nokia ericsson motorola buying symbian ltd.—as new company called—the telecommunications corporations acquired stake psion epoc operating system intellectual property symbian ltd. changed name epoc/epoc32 symbian os debuted november 2000 nokia 9210 communicator smartphone epoc developed psion software mobile-device company founded london 1980 company released first pocket computer 1984 8-bit device called psion organiser 1986 released series improved models organiser ii brand 8-bit era ending psion saw need develop 16-bit operating system drive next generation devices first however needed engineer 16-bit single-board computer—something extremely difficult time codenamed project sibo single-board organiser sixteen-bit organiser develop sibo hardware software needed samples 16-bit microprocessors would programming took year secure chips caused significant delay 1987 development epoc underway single-user preemptive multitasking operating system designed run read-only memory rom operating system programmes written intel 8086 assembly language c. operating system started opened pre-installed programmes advance system could switch quickly enable users write run programmes epoc featured updated version organiser programming language opl first published psion organiser opl simple interpreted language unlike basic 1989 psion released first 16-bit computers equipped new operating system mc200 mc400 mc600 notebooks intel 80c86 processor differed specifications memory capacity among later sibo devices psion 3 1991 3a 1993 3c 1996 workabout series well siena 512k model 1996 final epoc device psion series 3mx 1998 user interface differed device notebook computers wimp interface handheld computers smaller screens pointing device accept input keyboard stylus on-screen programmes represented icons smaller devices user could also access via specialised buttons parallel production 16-bit devices psion developing 32-bit version epoc since late 1994 move 32 bits necessary remain competitive psion wanted mobile operating system could license companies meant system would need portable previous efforts 32-bit operating system engineers wrote new object-oriented codebase c++ transition period old system came called epoc16 new one epoc32 epoc16 designed specifically intel 80186 platform epoc32 built arm computing platform reduced instruction set architecture like epoc16 epoc32 single-user pre-emptive multitasking operating system also featured memory protection essential feature modern operating systems psion licensed epoc32 device manufacturers made possible manufacturers change replace system graphical interface licensing arrangement psion considered spinning-off software division psion software psion pdas graphical user interface called eikon visually eikon refinement design choices psion 8- 16-bit devices early iterations epoc32 codenamed protea first published version called release 1 appeared psion series 5 rom v1.0 june 1997 release 2 never published updated rom version 1.1 series 5 featured release 3 series 5 used psion new user interface eikon one first epoc licensees short-lived company called geofox halted production selling fewer 1,000 units another licensee oregon scientific released budget device called osaris epoc device ship release 4 epoc release 5 premiered march 1999 ran armv4 processors strongarm series addition email messaging data synchronisation features introduced support java development kit made capable running wider variety programmes 2000 epoc gui variations replaced three reference interfaces crystal devices small keyboard quartz communicator devices telecommunication features tended equipped thumb keyboard pearl mobile phones classification supported vga graphics psion deployed release 5 5mx series 1999 revo 1999 netbook 1999 series 7 1999 revo plus 2000 netpad 2001 devices ericsson rebranded psion series 5mx mc218 sonicblue rebranded revo diamond mako like original devices rebranded versions released 1999 ericsson r380 smartphone released november 2000 first device distributed epoc release 5.1 release also known er5u u indicated system supported unicode system text encoding important feature representation diverse languages psion developed er5u-enabled device codenamed conan advance beyond prototype stage device intended bluetooth-enabled successor revo june 1998 psion software became symbian ltd. major joint venture psion phone manufacturers ericsson motorola nokia next release epoc32 release 6 rebranded symbian os decoupled user interface underlying operating system afforded device manufacturers ability burden implementing graphical interface devices final version symbian os released v10.1 final update published 2012 | [
1522,
6158,
5275,
3081,
2187,
3772,
4670,
5021,
4400,
3097,
474,
2564,
5391,
2300,
5486,
7364,
5579,
740,
5236,
5062,
1399,
3039,
1582,
8116,
5068,
2503,
2240,
336,
424,
7030,
5872,
5962,
2520,
7126,
4549,
3747,
349,
352,
3751,
5794,
14... | Test |
2,072 | 4 | SecurityScorecard:securityscorecard securityscorecard information security company rates cybersecurity postures corporate entities scored analysis cyber threat intelligence signals purposes third party management risk management company based new york city new york united states rated cyber security exposures 1,000,000 global companies across 17 categorized industries securityscorecard founded 2013 ceo aleksandr yampolskiy coo sam kassoumeh cro alexander heid joined organization 2014 team guided early stages company 2018 reports indicate company reached size 130 employees january 2017 president donald trump cited securityscorecard report president first public press conference commenting findings annual securityscorecard government cybersecurity report report indicated us government network systems 'the worst level risk compared industries securityscorecard software service platform collects attributes scores overall health enterprise cybersecurity identification exposed vulnerabilities corporate digital assets discovered public internet color-coded letter grades numerical scores calculated based upon identification security vulnerabilities corporate digital assets enterprises scored multiple categories risk web application security network security public availability breached data ip reputation mentions within underground hacker chatter susceptibility social engineering attacks platform used companies satisfy continuous monitoring compliance requirements related digital supply chains well enforcement grc standards securityscorecard used following markets financial services cyber insurance hospitality e-commerce energy public sector retail telecommunications cloud service providers software service providers securityscorecard received financing rounds sequoia capital gv nokia intel moody ngp capital riverwood capital | [
2961,
860,
3932,
651,
8091,
330,
7319,
3486,
1805
] | Test |
2,073 | 9 | Operation_Reduction_for_Low_Power:operation reduction low power operation reduction low power asic program transformation technique used reduce power consumed specific application program transformation operation changes computational structure nature type computational models interconnections sequencing operations keeping input output behavior intact basically use operation reduction reduce number operations done perform task reduces hardware required turn power consumption example given application specific ic reducing number independent additions required automatically reduces adders required also power consumed operation substitution one operation reduction techniques certain costly operations substituted relatively cheaper operations reduce power consumption typical examples operation substitution techniques given follows popular example operation substitution butterfly example example need compute two values x x x x done sequentially computing terms shown expressions using operation substitution compute using expressions a* x+x x a+a a* x+x x a-a term x+x computed used computations easily workout operations changed number operations changed 4 multiplications 3 2 add/sub 3 critical path first method length 2 latter 3 trade-off delay power based frequency input changing model program less activity switching happens i.e certain inputs less frequently changing made operating single module particular module relatively passive compared others a+b+c+d computed a+b +c+d a+b c+d first one feeds c 2 separate adders relatively slow changing feeding adder profitable synthesis 3 parts allocation number type resources scheduling operation scheduling binding building circuit schedule operations particular order based value program activates many modules always want operations requiring operations completed hand scheduled later consider following code snippet c 0 let us assume profiling shown likely value c 2 therefore c independent mutually exclusive modify code c 2 « 1 else c 0 multiplication replaced shifting operation triggered cases far cheaper multiplication | [
3499
] | Validation |
2,074 | 2 | Startup_Disk_Creator:startup disk creator startup disk creator usb-creator official tool create live usbs ubuntu live cd iso image tool included default releases ubuntu 8.04 installed ubuntu 8.04 kde frontend released ubuntu 8.10 currently included default kubuntu installations run current version ubuntu distributions enter either usb-creator-gtk usb-creator-kde command line tool available ubuntu gnome 11.04 17.04 also called unity kubuntu kde also windows starting ubuntu 10.10 maverick meerkat accessible inserting live cd cd-rom drive windows running | [
1254,
8169,
5912,
3271,
642,
3780,
2297,
5571,
5658,
314,
7463,
2585,
4165,
2511,
3738,
4632,
4991,
4187,
5523,
5965,
5704,
6951,
968,
2260,
4207,
7873
] | Test |
2,075 | 4 | Michał_Zalewski:michał zalewski michał zalewski born 19 january 1981 also known user name lcamtuf computer security expert white hat hacker poland former google inc. employee currently vp security engineering snap inc.. prolific vulnerability researcher frequent bugtraq poster since mid-1990s written number programs unix-like operating systems 2005 zalewski wrote silence wire field guide passive reconnaissance indirect attacks computer security book published starch press subsequently translated number languages 2011 zalewski wrote tangled web guide securing modern web applications also published starch press continued research browser security named one 15 influential people security among 100 influential people zalewski one original creators argante virtual open source operating system among projects also created p0f american fuzzy lop | [
113,
321,
5571,
3486,
1805
] | Validation |
2,076 | 2 | Disk_operating_system:disk operating system disk operating system abbreviated dos computer operating system use disk storage device floppy disk hard disk drive optical disc disk operating system must provide file system organizing reading writing files storage disk strictly speaking definition apply current generations operating systems versions microsoft windows use appropriately used older generations operating systems disk operating systems available mainframes microprocessors home computers usually loaded disks part boot process early days computers disk drives floppy disks modern flash storage devices early storage devices delay lines punched cards paper tape magnetic tape magnetic drums used instead early days microcomputers home computers paper tape audio cassette tape see kansas city standard nothing used instead latter case program data entry done front panel switches directly memory computer terminal keyboard sometimes controlled basic interpreter rom power turned information lost hard disks floppy disk drives require software manage rapid access block storage sequential data microcomputers disk drive kind optional peripheral systems could used tape drive booted without storage device disk operating system component operating system needed disk drive used dos concept began dos/360 1966 ibm system/360 mainframes home personal computers late 1970s 1980s used disk operating system often dos name simply referred dos within respective communities cbm dos commodore 8-bit systems atari dos atari 8-bit family trs-dos trs-80 apple dos apple ii ms-dos ibm pc compatibles usually disk operating system loaded disk among exceptions commodore whose dos resided rom chips disk drives lt. kernal hard disk subsystem commodore 64 commodore 128 models stored dos disk case modern systems loaded dos ram boot time british bbc micro optional disc filing system dfs offered kit disk controller chip rom chip handful logic chips installed inside computer disk operating systems operating system entire computer system | [
4291,
6076,
4670,
5021,
13,
3271,
3626,
5041,
7550,
6113,
405,
7556,
6119,
65,
5783,
5784,
5088,
6500,
785,
2266,
788,
1522,
7605,
4759,
4397,
3359,
5116,
2300,
483,
126,
5833,
6907,
4786,
6922,
5161,
5865,
861,
3748,
3751,
1992,
7325,
... | Test |
2,077 | 5 | H-TCP:h-tcp h-tcp another implementation tcp optimized congestion control algorithm high speed networks high latency lfn long fat networks created researchers hamilton institute ireland h-tcp optional module recent linux 2.6 kernels implemented freebsd 7 h-tcp loss-based algorithm using additive-increase/multiplicative-decrease aimd control tcp congestion window one many tcp congestion avoidance algorithms seeks increase aggressiveness tcp high bandwidth-delay product bdp paths maintaining tcp friendliness small bdp paths h-tcp increases aggressiveness particular rate additive increase time since previous loss increases avoids problem encountered hstcp bic tcp making flows aggressive windows already large thus new flows expected converge fairness faster htcp hstcp bic tcp side effect increasing rate increase time since last packet loss increases flows happen lose packet flows take unfair portion bandwidth techniques overcome currently research phase linux implementation h-tcp also option avoiding rtt unfairness occurs tcp reno particular problem high speed variants tcp although fast tcp algorithm initially introduced h-tcp without mention h stands however often called hamilton tcp hamilton institute created | [
6031,
7061,
7637,
578,
4058,
6286
] | Test |
2,078 | 3 | AMD_APP_SDK:amd app sdk amd app sdk software development kit amd accelerated parallel processing app amd app sdk also targets heterogeneous system architecture gpu amd app sdk available 32-bit 64-bit versions microsoft windows linux removed amd official website developer stated forum post sdk discontinued required libraries included drivers amd intends developers employ amd app sdk utilize video coding engine hybrid mode create hybrid encoders pair custom motion estimation inverse discrete cosine transform motion compensation hardware entropy encoding achieve faster real-time encoding app sdk 3.0 supports opencl™ 2.0 catalyst omega 15.7 driver amd app sdk v3.0 beta includes samples opencl™ well accelerated libraries bolt open-source c++ template library opencl™ accelerated opencv open computer vision library amd app sdk replaced amd stream sdk formerly named ati stream sdk amd cal compute abstraction layer sdk replaced ati stream sdk available microsoft windows linux 32-bit 64-bit | [
2016,
2539,
7442,
1048,
1023,
4759,
5571,
4694,
578,
7782,
8022
] | Test |
2,079 | 9 | Identifier:identifier identifier name identifies labels identity either unique object unique class objects object class may idea physical countable object class thereof physical noncountable substance class thereof abbreviation id often refers identity identification process identifying identifier instance identification identifier may word number letter symbol combination words numbers letters symbols may follow encoding system wherein letters digits words symbols stand represent ideas longer names may simply arbitrary identifier follows encoding system often referred code id code instance iso/iec 11179 metadata registry standard defines code system valid symbols substitute longer values contrast identifiers without symbolic meaning identifiers follow encoding scheme often said arbitrary ids arbitrarily assigned greater meaning sometimes identifiers called codes even actually arbitrary whether speaker believes deeper meaning simply speaking casually imprecisely unique identifier uid identifier refers one instance —only one particular object universe part number identifier unique identifier—for serial number needed identify instance part design thus identifier model identifies class model automobiles ford model comprises whereas unique identifier model serial number 159,862 identifies one specific member class—that one particular model car owned one specific person concepts name identifier denotatively equal terms thus denotatively synonymous always connotatively synonymous code names id numbers often connotatively distinguished names sense traditional natural language naming example jamie zawinski netscape employee number 20 identifiers specific human normal english-language connotation may consider jamie zawinski name identifier whereas considers netscape employee number 20 identifier name emic indistinction rather etic one metadata identifier language-independent label sign token uniquely identifies object within identification scheme suffix identifier also used representation term naming data element id codes may inherently carry metadata along example know food package front identifier 42z-mfr5-p02-243-45 data also metadata tells packaged september 25 2011 3:42pm utc manufactured licensed vendor number 5 peoria il usa plant building 2 243rd package line shift inspected inspector number 45 arbitrary identifiers might lack metadata example food package says 100054678214 id may tell anything except identity—no date manufacturer name production sequence rank inspector number cases arbitrary identifiers sequential serial numbers leak information i.e german tank problem opaque identifiers—identifiers designed avoid leaking even small amount information—include really opaque pointers version 4 uuids computer science identifiers ids lexical tokens name entities identifiers used extensively virtually information processing systems identifying entities makes possible refer essential kind symbolic processing computer languages identifiers tokens also called symbols name language entities kinds entities identifier might denote include variables types labels subroutines packages character sequences constitute identifiers depends lexical grammar language common rule alphanumeric sequences underscore also allowed condition begin digit simplify lexing avoiding confusing integer literals – codice_1 allowed codice_2 – definition used earlier versions c c++ python many languages later versions languages along many modern languages support almost unicode characters identifier however common restriction permit whitespace characters language operators simplifies tokenization making free-form context-free example forbidding codice_3 identifiers due use binary operation means codice_4 codice_5 tokenized allowed codice_4 would identifier addition whitespace identifier particularly problematic spaces allowed identifiers clause codice_7 legal codice_8 identifier tokenizing requires phrasal context condition clause languages allow spaces identifiers however algol 68 algol variants – example following valid statement codice_9 could entered codice_10 keywords represented boldface concretely via stropping algol possible keywords syntactically differentiated risk collision ambiguity spaces eliminated line reconstruction phase source processed via scannerless parsing lexing could context-sensitive languages character sequences lexical form identifier known keywords – example codice_11 frequently keyword clause lexically form codice_12 codice_13 namely sequence letters overlap handled various ways may forbidden identifiers – simplifies tokenization parsing – case reserved words may allowed distinguished ways via stropping keyword sequences may allowed identifiers sense determined context requires context-sensitive lexer non-keywords may also reserved words forbidden identifiers particularly forward compatibility case word may become keyword future languages e.g. pl/1 distinction clear scope accessibility within program identifier either local global global identifier declared outside functions available throughout program local identifier declared within specific function available within function implementations programming languages using compiler identifiers often compile time entities runtime compiled program contains references memory addresses offsets rather textual identifier tokens memory addresses offsets assigned compiler identifier languages support reflection interactive evaluation source code using interpreter incremental compiler identifiers also runtime entities sometimes even first-class objects freely manipulated evaluated lisp called symbols compilers interpreters usually assign semantic meaning identifier based actual character sequence used however exceptions example languages go identifiers uniqueness based spelling visibility html identifier one possible attributes html element unique within document many resources may carry multiple identifiers typical examples inverse also possible multiple resources represented identifier discussed many codes nomenclatural systems originate within small namespace years bleed larger namespaces people interact ways formerly n't e.g. cross-border trade scientific collaboration military alliance general cultural interconnection assimilation dissemination happens limitations original naming convention formerly latent moot become painfully apparent often necessitating retronymy synonymity translation/transcoding limitations generally accompany shift away original context broader one typically system shows implicit context context formerly assumed narrow lack capacity e.g. low number possible ids reflecting outmoded narrow context lack extensibility features defined reserved future needs lack specificity disambiguating capability related context shift longstanding uniqueness encounters novel nonuniqueness within computer science problem called naming collision story origination expansion coden system provides good case example recent-decades technical-nomenclature context capitalization variations seen specific designators reveals instance problem occurring natural languages proper noun/common noun distinction complications must dealt universe every object uid would need namespaces say would constitute one gigantic namespace human minds could never keep track semantically interrelate many uids | [
89,
623,
5983,
7333,
1825,
8174,
993,
1541,
4771,
6980,
1361,
6982,
7071,
383,
7816,
6543,
1198,
4425,
6120,
2773,
336,
7032,
4543,
7582,
6672,
4637,
5965,
4198,
2803,
1435
] | Test |
2,080 | 3 | Fermi_(microarchitecture):fermi microarchitecture fermi codename gpu microarchitecture developed nvidia first released retail april 2010 successor tesla microarchitecture primary microarchitecture used geforce 400 series geforce 500 series followed kepler used alongside kepler geforce 600 series geforce 700 series geforce 800 series latter two mobile gpus workstation market fermi found use quadro x000 series quadro nvs models well nvidia tesla computing modules desktop fermi gpus manufactured 40 nm mobile fermi gpus 40 nm 28 nm fermi oldest microarchitecture nvidia received support microsoft rendering api direct3d 12 feature_level 11 architecture named enrico fermi italian physicist fermi graphic processing units gpus feature 3.0 billion transistors schematic sketched fig 1 sm features 32 single-precision cuda cores 16 load/store units four special function units sfus 64kb block high speed on-chip memory see l1+shared memory subsection interface l2 cache see l2 cache subsection load/store units allow source destination addresses calculated 16 threads per clock load store data from/to cache dram special functions units sfus execute transcendental instructions sin cosine reciprocal square root sfu executes one instruction per thread per clock warp executes eight clocks sfu pipeline decoupled dispatch unit allowing dispatch unit issue execution units sfu occupied integer arithmetic logic unit alu supports full 32-bit precision instructions consistent standard programming language requirements also optimized efficiently support 64-bit extended precision operations floating point unit fpu implements new ieee 754-2008 floating-point standard providing fused multiply-add fma instruction see fused multiply-add subsection single double precision arithmetic 16 double precision fused multiply-add operations performed per sm per clock fused multiply-add fma perform multiplication addition i.e. a*b+c single final rounding step loss precision addition fma accurate performing operations separately fermi architecture uses two-level distributed thread scheduler sm issue instructions consuming two four green execution columns shown schematic fig 1 example sm mix 16 operations 16 first column cores 16 operations 16 second column cores 16 operations load/store units four sfus combinations program specifies note 64-bit floating point operations consumes first two execution columns implies sm issue 32 single-precision 32-bit floating point operations 16 double-precision 64-bit floating point operations time gigathread engine gigathread engine schedules thread blocks various sms dual warp scheduler sm level warp scheduler distributes warps 32 threads execution units threads scheduled groups 32 threads called warps sm features two warp schedulers two instruction dispatch units allowing two warps issued executed concurrently dual warp scheduler selects two warps issues one instruction warp group 16 cores 16 load/store units 4 sfus instructions dual issued two integer instructions two floating instructions mix integer floating point load store sfu instructions issued concurrently double precision instructions support dual dispatch operation theoretical single-precision processing power fermi gpu gflops computed 2 operations per fma instruction per cuda core per cycle × number cuda cores × shader clock speed ghz note previous generation tesla could dual-issue mad+mul cuda cores sfus parallel fermi lost ability issue 32 instructions per cycle per sm keeps 32 cuda cores fully utilized therefore possible leverage sfus reach 2 operations per cuda core per cycle theoretical double-precision processing power fermi gpu 1/2 single precision performance gf100/110 however practice double-precision power available professional quadro tesla cards consumer geforce cards capped 1/8 l1 cache per sm unified l2 cache services operations load store texture registers sm 32k 32-bit registers thread access registers threads maximum number registers used cuda kernel 63 number available registers degrades gracefully 63 21 workload hence resource requirements increases number threads registers high bandwidth 8,000 gb/s l1+shared memory on-chip memory used either cache data individual threads register spilling/l1 cache and/or share data among several threads shared memory 64 kb memory configured either 48 kb shared memory 16 kb l1 cache 16 kb shared memory 48 kb l1 cache shared memory enables threads within thread block cooperate facilitates extensive reuse on-chip data greatly reduces off-chip traffic shared memory accessible threads thread block provides low-latency access 10-20 cycles high bandwidth 1,600 gb/s moderate amounts data intermediate results series calculations one row column data matrix operations line video etc. david patterson says shared memory uses idea local scratchpad local memory local memory meant memory location used hold spilled registers register spilling occurs thread block requires register storage available sm local memory used automatic variables declared device code without nowiki __device__ __shared__ __constant__ /nowiki qualifiers generally automatic variable resides register except following 1 arrays compiler determine indexed constant quantities 2 large structures arrays would consume much register space variable compiler decides spill local memory kernel uses registers available sm l2 cache 768 kb unified l2 cache shared among 16 sms services load store from/to global memory including copies to/from cpu host also texture requests l2 cache subsystem also implements atomic operations used managing access data must shared across thread blocks even kernels global memory accessible threads well host cpu high latency 400-800 cycles see nvidia nvdec formerly called nvcuvid well nvidia purevideo nvidia nvenc | [
2538,
2270,
6610,
1640,
4954,
7912,
5939,
1864,
7669,
1595,
8141,
1237,
4833,
2085
] | Test |
2,081 | 1 | On-Line_Encyclopedia_of_Integer_Sequences:on-line encyclopedia integer sequences on-line encyclopedia integer sequences oeis also cited simply sloane online database integer sequences created maintained neil sloane researcher labs foreseeing retirement labs 2012 need independent foundation sloane agreed transfer intellectual property hosting oeis oeis foundation october 2009 sloane president oeis foundation oeis records information integer sequences interest professional amateur mathematicians widely cited contains 320,000 sequences making largest database kind entry contains leading terms sequence keywords mathematical motivations literature links including option generate graph play musical representation sequence database searchable keyword subsequence neil sloane started collecting integer sequences graduate student 1965 support work combinatorics database first stored punched cards published selections database book form twice books well received especially second publication mathematicians supplied sloane steady flow new sequences collection became unmanageable book form database reached 16,000 entries sloane decided go online—first e-mail service august 1994 soon web site 1996 spin-off database work sloane founded journal integer sequences 1998 database continues grow rate 10,000 entries year sloane personally managed 'his sequences almost 40 years starting 2002 board associate editors volunteers helped maintain database 2004 sloane celebrated addition 100,000th sequence database counts marks ishango bone 2006 user interface overhauled advanced search capabilities added 2010 oeis wiki oeis.org created simplify collaboration oeis editors contributors 200,000th sequence added database november 2011 initially entered a200715 moved a200000 week discussion seqfan mailing list following proposal oeis editor-in-chief charles greathouse choose special sequence a200000 besides integer sequences oeis also catalogs sequences fractions digits transcendental numbers complex numbers transforming integer sequences sequences rationals represented two sequences named keyword 'frac sequence numerators sequence denominators example fifth-order farey sequence formula_1 catalogued numerator sequence 1 1 1 2 1 3 2 3 4 denominator sequence 5 4 3 5 2 5 3 4 5 important irrational numbers π 3.1415926535897 ... catalogued representative integer sequences decimal expansions 3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5 0 2 8 8 ... binary expansions 1 1 0 0 1 0 0 1 0 0 0 0 1 1 1 1 1 1 0 1 1 0 1 0 ... continued fraction expansions 3 7 15 1 292 1 1 1 2 1 3 1 14 2 1 1 2 2 2 2 1 84 2 1 1 ... oeis limited plain ascii text 2011 still uses linear form conventional mathematical notation f n functions n running variables etc. greek letters usually represented full names e.g mu μ phi φ every sequence identified letter followed six digits almost always referred leading zeros e.g a000315 rather a315 individual terms sequences separated commas digit groups separated commas periods spaces comments formulas etc. n represents n th term sequence zero often used represent non-existent sequence elements example enumerates smallest prime n ² consecutive primes form n × n magic square least magic constant 0 magic square exists value 1 1×1 magic square 2 3 1480028129 2×2 magic square 2 0 special usage solid mathematical basis certain counting functions example totient valence function n counts solutions φ x 4 solutions 4 solutions 14 hence 14 a014197 0—there solutions occasionally −1 used purpose instead oeis maintains lexicographical order sequences sequence predecessor successor context oeis normalizes sequences lexicographical ordering usually ignoring initial zeros ones also sign element sequences weight distribution codes often omit periodically recurring zeros example consider prime numbers palindromic primes fibonacci sequence lazy caterer sequence coefficients series expansion formula_2 oeis lexicographic order whereas unnormalized lexicographic ordering would order sequences thus 3 5 4 1 2 early history oeis sequences defined terms numbering sequences oeis proposed resisted adding sequences long time partly desire maintain dignity database partly a22 known 11 terms sloane reminisced one earliest self-referential sequences sloane accepted oeis later n n -th term sequence -1 fewer n terms sequence spurred progress finding terms line thought leads question sequence contain number n sequences numbers n oeis sequence contains n n sequence n sequence thus composite number 2808 a053873 sequence composite numbers non-prime 40 a053169 prime numbers n member exactly one two sequences principle determined sequence n belongs two exceptions related two sequences entry chosen contains every field oeis entry 2009 oeis database used philippe guglielmetti measure importance integer number result shown plot right shows clear gap two distinct point clouds uninteresting numbers blue dots interesting numbers occur comparatively often sequences oeis contains essentially prime numbers red numbers form green highly composite numbers yellow phenomenon studied nicolas gauvrit jean-paul delahaye hector zenil explained speed two clouds terms algorithmic complexity gap social factors based artificial preference sequences primes even numbers geometric fibonacci-type sequences sloane gap featured numberphile video 2013 | [
622,
8082,
3410,
752,
634,
6015,
518
] | Test |
2,082 | 4 | Box_Backup:box backup box backup open-source completely automatic online backup system client software sends backup data server data encrypted using secure sockets layer ssl protocol also protected layer on-disk encryption box backup supports linux unix windows mac os x backup clients servers although windows servers recommended authors box backup licensed gnu gpl bsd licenses box backup client-server application client sends data server storage server provides management client via certificates storage quotas data retention together unique robust solution created scales allowing clients low-bandwidth connections effectively perform reliable backups box backup ideal backing laptops computers intermittent low-bandwidth connections capable continuous data protection background starting automatically internet connection present recovering gracefully efficiently connection failures box backup uses modified version rsync algorithm works encrypted blocks allows store data server form server operator read still uploading changed portions data files | [
2390,
4386,
3172,
3827,
4759,
1554,
5571,
578
] | Test |
2,083 | 3 | Feature_connector:feature connector feature connector internal connector found mostly older isa vesa local bus pci graphics cards also early agp ones intended use devices needed exchange large amounts data graphics card without hogging computer system cpu data bus tv tuner cards video capture cards mpeg video decoders e.g realmagic first generation 3d graphic accelerator cards early examples include ibm ega video adapter several standards existed feature connectors depending bus graphics card type simply 8 16 32-bit wide internal connector transferring data graphics card another device bypassing system cpu memory completely speeds often far exceeded speed normal isa even early pci buses e.g 40 mbyte/s standard isa-based svga 150 mbyte/s vesa-based pci-based one standard 16 bit isa bus ran ~5.3 mbyte/s vesa bus 160 mbyte/s bandwidth feature connector bandwidths far beyond capabilities e.g 386 486 barely handled early pentium depending implementation could uni bi-directional carry analog color information well data unlike analog overlay devices however feature connector carried mainly data essentially allowed expansion card access graphics card video ram directly although directing data stream system cpu ram always possible limiting usefulness mainly display purposes although use rapidly declined introduction faster agp internal bus time feasible way connect certain types graphics-intensive devices average computing system without exceeding available cpu power memory bandwidth without disadvantages limitations purely analog overlay idea accessing video card memory directly resurfaced introduction scalable link interface sli technology although technology aimed connecting two equally powered complete graphic cards produce single increased performance visual output e.g directly interfacing tv tuner cards | [
8139,
1237,
3755
] | Train |
2,084 | 2 | DOS_MZ_executable:dos mz executable dos mz executable format executable file format used .exe files dos file identified ascii string mz hexadecimal 4d 5a beginning file magic number mz initials mark zbikowski one leading developers ms-dos mz dos executable file newer com executable format differs dos executable header contains relocation information allows multiple segments loaded arbitrary memory addresses supports executables larger 64k however format still requires relatively low memory limits limits later bypassed using dos extenders environment exe program run dos found program segment prefix exe files normally separate segments code data stack program execution begins address 0 code segment stack pointer register set whatever value contained header information thus header specifies 512 byte stack stack pointer set 200h possible use separate stack segment simply use code segment stack desired ds data segment register normally contains value cs code segment register loaded actual segment address data segment exe file initialized necessary programmer set generally done via following instructions original dos 1.x api also necessary ds register pointing segment psp program termination done via following instructions program termination would performed retf instruction would retrieve original segment address psp stack jump address 0 contained int 20h instruction dos 2.x api introduced new program termination function int 21h function 4ch require saving psp segment address start program microsoft advised use older dos 1.x method mz dos executables run dos windows 9x-based operating systems 32-bit windows nt-based operating systems execute using built-in virtual dos machine although graphics modes unsupported 64-bit versions windows execute alternative ways run executables include dosbox dosemu wine cygwin mz dos executables created linkers like digital mars optlink ms linker valx open watcom wlink additionally fasm create directly | [
1339,
4662,
4843,
6256,
5108,
3870,
6634,
2403,
410,
6380,
2418,
1128,
3493,
5784,
1894,
1989
] | Validation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.