node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
7,186 | 9 | GPSS:gpss general purpose simulation system gpss discrete time simulation general-purpose programming language simulation clock advances discrete steps system modelled transactions enter system passed one service represented blocks another used primarily process flow oriented simulation language particularly well-suited problems factory gpss developed ibm geoffrey gordon beginning 1960s named gordon programable simulation system name changed ibm decided release product general program part new name create standard waiting-line simulations original releases ibm 7044 7090 mainframes subsequently releases ibm 360 univac 1108 cdc time implementations languages targeted different size systems developed including dec vax specialized apl version large-scale univac systems macintosh among others gpss java general purpose simulation system java-based tool developed teach gpss simulation language gpss resembles lego structure blocks chosen modeller specific functions imitate particular system language neither procedural object-oriented functional programming world simulated entities moving model entities called transactions envisioned moving block block block line code represents unit actions affects transaction entities blocks facility-oriented machines job shop transaction-oriented parts work-in-process signals electronic components documents bureaucratic procedure gpss automatically keep track statistics brings fixed form end simulation standard report gpss one oldest language candidate first object-oriented approach transactions truly instances model objects blocks methods modern concept oop entities broadly classified resources computational entities statistical entities resources like facilities storages represent limited capacity resources computational entities like ampervariables variables functions random generators used represent state transactions elements environment statistical entities like queues tables histograms collect statistical information interest following example taken simulation using gpss hello world gpss illustrate main concepts aim simulate one day operation barber shop customers arrive random constant flow enter shop queue barber busy get hair cut first-come first-served basis leave shop wish know average maximum waiting line well number customers program comprised codice_1 codice_2 statements divided model segments control cards first segment models customers codice_3 block creates flow transactions schedules enter model inter-arrival time uniformly distributed range 18±6 programmer responsibility interpret transaction customers understand time counted minutes transactions start existence codice_3 block progress block block according certain rules reach codice_5 remove model normally transactions progress one block next one customer transactions leave codice_3 block enter codice_7 block block simulates waiting line collects statistics accordingly example materialize line chairs end simulation know among things maximum queue size many chairs needed average waiting time codice_8 block requires name queue parameter one queue may exist model one associated codice_9 block triggered transaction leaves queue gpss remembers transactions queue possible know average time spent check buggy transaction leaving queue without previously entering codice_10 block transaction try proceed codice_11 block block simulating capture facility named joe facilities model single servers capacity one facility busy codice_12 deny attempting transaction right enter example customer wait codice_8 block free soon becomes available transaction allowed capture facility mark busy others transactions start count service time statistics transaction passes corresponding codice_14 block codice_12 codice_16 pairs linked facility name many independent facilities may exist model model operators like barber repairman agent also pieces equipment like crane gas station authorization document etc. fact anything capacity one simulate multiple parallel servers like team five barbers oven capacity 10 gpss uses entities named codice_17s customer seizes joe proceeds next statement codice_18 whose task freeze entity prescribed length time random number picked 16-4=12 16+4=20mn service time distributions available gpss codice_19 somehow different notion function programming languages time transactions allowed move model blocking facilities may exist model joe facility busy frozen customer prescribed time customer wake proceed next statement free joe codice_5 next transaction previous block customer sitting chair able codice_11 select next transaction gpss uses first-come first-served basis priority selection policies programmed direct manipulation future event chain entity parallel first segment simulating customer behavior second model segment simulates end day time 480mn 8h entity codice_3d codice_5 next block time codice_5 parameter 1 meaning special counter decreased 1 counter reaches 0 program stops output printed special counter set codice_25 statement example set one thus simulation finish one run 480 mn simulated time output contains indicates joe busy 86.0 time gave hair cut 26 customers hair cut took 15.88 minutes average incidentally joe cutting hair customer number 26 simulation closed programming provisions taken barber finish hair cut closing shop indicates also maximum 1 customer observed waiting turn fact number waiting customer average 0.160 total 27 customers enter queue customer number 27 still sitting waiting turn joe closed shop 27 customers 12 served without wait fact queue empty 44.4 time average waiting time 2.851 min average waiting time 15=27-12 customers really wait 5.133 min | [
192,
421,
6248,
5677,
5775,
5584,
2519
] | Test |
7,187 | 3 | Microkernel:microkernel computer science microkernel often abbreviated μ-kernel near-minimum amount software provide mechanisms needed implement operating system os mechanisms include low-level address space management thread management inter-process communication ipc hardware provides multiple rings cpu modes microkernel may software executing privileged level generally referred supervisor kernel mode traditional operating system functions device drivers protocol stacks file systems typically removed microkernel instead run user space terms source code size microkernels often smaller monolithic kernels minix 3 microkernel example approximately 12,000 lines code microkernels trace roots back danish computer pioneer per brinch hansen tenure danish computer company regnecentralen led software development efforts rc 4000 computer 1967 regnecentralen installing rc 4000 prototype polish fertilizer plant puławy computer used small real-time operating system tailored needs plant brinch hansen team became concerned lack generality reusability rc 4000 system feared installation would require different operating system started investigate novel general ways creating software rc 4000 1969 effort resulted completion rc 4000 multiprogramming system nucleus provided inter-process communication based message-passing 23 unprivileged processes 8 time protected one another implemented scheduling time slices programs executed parallel initiation control program execution request running programs initiation data transfers peripherals besides elementary mechanisms built-in strategy program execution resource allocation strategy implemented hierarchy running programs parent processes complete control child processes acted operating systems following brinch hansen work microkernels developed since 1970s term microkernel first appeared later 1981 microkernels meant response changes computer world several challenges adapting existing mono-kernels new systems new device drivers protocol stacks file systems low-level systems developed time code normally located monolithic kernel thus required considerable work careful code management work microkernels developed idea services would implemented user-space programs like allowing worked monolithically started stopped like program would allow services easily worked also separated kernel code allow finely tuned without worrying unintended side effects moreover would allow entirely new operating systems built common core aiding os research microkernels hot topic 1980s first usable local area networks introduced mechanisms allowed kernel distributed user space also allowed system distributed across network links first microkernels notably mach proved disappointing performance inherent advantages appeared great major line research late 1990s however time speed computers grew greatly relation networking systems disadvantages performance came overwhelm advantages development terms many attempts made adapt existing systems better performance overhead always considerable efforts required user-space programs moved back kernel 2000 large-scale mach-like efforts ended although apple macos released 2001 uses hybrid kernel called xnu combines heavily modified hybrid osfmk 7.3 kernel code bsd unix kernel also used ios tvos watchos mach-based gnu hurd also functional included testing versions arch linux debian although major work microkernels largely ended experimenters continued development since shown many performance problems earlier designs fundamental limitation concept instead due designer desire use single-purpose systems implement many services possible using pragmatic approach problem including assembly code relying processor enforce concepts normally supported software led new series microkernels dramatically improved performance microkernels closely related exokernels also much common hypervisors latter make claim minimality specialized supporting virtual machines indeed l4 microkernel frequently finds use hypervisor capacity early operating system kernels rather small partly computer memory limited capability computers grew number devices kernel control also grew throughout early history unix kernels generally small even though contained various device drivers file system implementations address spaces increased 16 32 bits kernel design longer constrained hardware architecture kernels began grow larger berkeley software distribution bsd unix began era larger kernels addition operating basic system consisting cpu disks printers bsd added complete tcp/ip networking system number virtual devices allowed existing programs work 'invisibly network growth continued many years resulting kernels millions lines source code result growth kernels prone bugs became increasingly difficult maintain microkernel intended address growth kernels difficulties resulted theory microkernel design allows easier management code due division user space services also allows increased security stability resulting reduced amount code running kernel mode example networking service crashed due buffer overflow networking service memory would corrupted leaving rest system still functional inter-process communication ipc mechanism allows separate processes communicate usually sending messages shared memory strictly speaking also inter-process communication mechanism abbreviation ipc usually refers message passing latter particularly relevant microkernels ipc allows operating system built number small programs called servers used programs system invoked via ipc support peripheral hardware handled fashion servers device drivers network protocol stacks file systems graphics etc ipc synchronous asynchronous asynchronous ipc analogous network communication sender dispatches message continues executing receiver checks polls availability message alerted via notification mechanism asynchronous ipc requires kernel maintains buffers queues messages deals buffer overflows also requires double copying messages sender kernel kernel receiver synchronous ipc first party sender receiver blocks party ready perform ipc require buffering multiple copies implicit rendezvous make programming tricky programmers prefer asynchronous send synchronous receive first-generation microkernels typically supported synchronous well asynchronous ipc suffered poor ipc performance jochen liedtke assumed design implementation ipc mechanisms underlying reason poor performance l4 microkernel pioneered methods lowered ipc costs order magnitude include ipc system call supports send well receive operation making ipc synchronous passing much data possible registers furthermore liedtke introduced concept direct process switch ipc execution incomplete context switch performed sender directly receiver l4 part message passed registers transfers in-register part message without copying furthermore overhead invoking scheduler avoided especially beneficial common case ipc used rpc-type fashion client invoking server another optimization called lazy scheduling avoids traversing scheduling queues ipc leaving threads block ipc ready queue scheduler invoked moves threads appropriate waiting queue many cases thread gets unblocked next scheduler invocation approach saves significant work similar approaches since adopted qnx minix 3 series experiments chen bershad compared memory cycles per instruction mcpi monolithic ultrix microkernel mach combined 4.3bsd unix server running user space results explained mach poorer performance higher mcpi demonstrated ipc alone responsible much system overhead suggesting optimizations focused exclusively ipc limited impact liedtke later refined chen bershad results making observation bulk difference ultrix mach mcpi caused capacity cache-misses concluding drastically reducing cache working set microkernel solve problem client-server system communication essentially synchronous even using asynchronous primitives typical operation client invoking server waiting reply also lends efficient implementation microkernels generally followed l4 lead provided synchronous ipc primitive asynchronous ipc could implemented top using helper threads however experience shown utility synchronous ipc dubious synchronous ipc forces multi-threaded design onto otherwise simple systems resulting synchronization complexities moreover rpc-like server invocation sequentializes client server avoided running separate cores versions l4 deployed commercial products therefore found necessary add asynchronous notification mechanism better support asynchronous communication signal-like mechanism carry data therefore require buffering kernel two forms ipc nonetheless violated principle minimality versions l4 switched asynchronous ipc completely synchronous ipc blocks first party ready unrestricted use could easily lead deadlocks furthermore client could easily mount denial-of-service attack server sending request never attempting receive reply therefore synchronous ipc must provide means prevent indefinite blocking many microkernels provide timeouts ipc calls limit blocking time practice choosing sensible timeout values difficult systems almost inevitably use infinite timeouts clients zero timeouts servers consequence trend towards providing arbitrary timeouts flag indicates ipc fail immediately partner ready approach effectively provides choice two timeout values zero infinity recent versions l4 minix gone path older versions l4 used timeouts qnx avoids problem requring client specify reply buffer part message send call server replies kernel copies data client buffer without wait client receive response explicitly microkernel servers essentially daemon programs like others except kernel grants privileges interact parts physical memory otherwise limits programs allows servers particularly device drivers interact directly hardware basic set servers general-purpose microkernel includes file system servers device driver servers networking servers display servers user interface device servers set servers drawn qnx provides roughly set services offered unix monolithic kernel necessary servers started system startup provide services file network device access ordinary application programs servers running environment user application server development similar ordinary application development rather build-and-boot process needed kernel development additionally many crashes corrected simply stopping restarting server however part system state lost failing server hence approach requires applications cope failure good example server responsible tcp/ip connections server restarted applications experience lost connection normal occurrence networked system services failure less expected may require changes application code qnx restart capability offered qnx high availability toolkit device drivers frequently perform direct memory access dma therefore write arbitrary locations physical memory including various kernel data structures drivers must therefore trusted common misconception means must part kernel fact driver inherently less trustworthy part kernel running device driver user space necessarily reduce damage misbehaving driver cause practice beneficial system stability presence buggy rather malicious drivers memory-access violations driver code opposed device may still caught memory-management hardware furthermore many devices dma-capable drivers made untrusted running user space recently increasing number computers feature iommus many used restrict device access physical memory also allows user-mode drivers become untrusted user-mode drivers actually predate microkernels michigan terminal system mts 1967 supported user space drivers including file system support first operating system designed capability historically drivers less problem number devices small trusted anyway kernel simplified design avoided potential performance problems led traditional driver-in-the-kernel style unix linux windows nt proliferation various kinds peripherals amount driver code escalated modern operating systems dominates kernel code size microkernel must allow building arbitrary operating system services top must provide core functionality minimum includes minimal design pioneered brinch hansen nucleus hypervisor ibm vm since formalised liedtke minimality principle concept tolerated inside microkernel moving outside kernel i.e. permitting competing implementations would prevent implementation system required functionality everything else done usermode program although device drivers implemented user programs may processor architectures require special privileges access i/o hardware related minimality principle equally important microkernel design separation mechanism policy enables construction arbitrary systems top minimal kernel policy built kernel overwritten user level therefore limits generality microkernel policy implemented user-level servers changed replacing servers letting application choose competing servers offering similar services efficiency microkernels contain schedulers manage timers violation minimality principle principle policy-mechanism separation start booting microkernel-based system requires device drivers part kernel typically means packaged kernel boot image kernel supports bootstrap protocol defines drivers located started traditional bootstrap procedure l4 microkernels microkernels simplify placing key drivers inside kernel violation minimality principle lynxos original minix examples even include file system kernel simplify booting microkernel-based system may boot via multiboot compatible boot loader systems usually load statically-linked servers make initial bootstrap mount os image continue bootstrapping key component microkernel good ipc system virtual-memory-manager design allows implementing page-fault handling swapping usermode servers safe way since services performed usermode programs efficient means communication programs essential far monolithic kernels design ipc system makes breaks microkernel effective ipc system must low overhead also interact well cpu scheduling mainstream processors obtaining service inherently expensive microkernel-based system monolithic system monolithic system service obtained single system call requires two mode switches changes processor ring cpu mode microkernel-based system service obtained sending ipc message server obtaining result another ipc message server requires context switch drivers implemented processes function call implemented procedures addition passing actual data server back may incur extra copying overhead monolithic system kernel directly access data client buffers performance therefore potential issue microkernel systems indeed experience first-generation microkernels mach chorusos showed systems based performed poorly however jochen liedtke showed mach performance problems result poor design implementation specifically mach excessive cache footprint liedtke demonstrated l4 microkernel careful design implementation especially following minimality principle ipc costs could reduced order magnitude compared mach l4 ipc performance still unbeaten across range architectures results demonstrate poor performance systems based first-generation microkernels representative second-generation kernels l4 constitutes proof microkernel-based systems built good performance shown monolithic linux server ported l4 exhibits percent overhead native linux however single-server system exhibits advantages microkernels supposed provide structuring operating system functionality separate servers number commercial multi-server systems exist particular real-time systems qnx integrity comprehensive comparison performance relative monolithic systems published multiserver systems furthermore performance seem overriding concern commercial systems instead emphasize reliably quick interrupt handling response times qnx simplicity sake robustness attempt build high-performance multiserver operating system ibm sawmill linux project however project never completed shown meantime user-level device drivers come close performance in-kernel drivers even high-throughput high-interrupt devices gigabit ethernet seems imply high-performance multi-server systems possible security benefits microkernels frequently discussed context security minimality principle microkernels argued direct consequence principle least privilege according code privileges needed provide required functionality minimality requires system trusted computing base tcb kept minimal kernel code executes privileged mode hardware unvetted access data thus violate integrity confidentiality kernel always part tcb minimizing natural security-driven design consequently microkernel designs used systems designed high-security applications including keykos eros military systems fact common criteria cc highest assurance level evaluation assurance level eal 7 explicit requirement target evaluation simple acknowledgment practical impossibility establishing true trustworthiness complex system unfortunately term simple misleading ill-defined least department defense trusted computer system evaluation criteria introduced somewhat precise verbiage b3/a1 classes recent work microkernels focusing formal specifications kernel api formal proofs api security properties implementation correctness first example mathematical proof confinement mechanisms eros based simplified model eros api recently comprehensive set machine-checked proofs performed properties protection model version l4 led referred third-generation microkernels characterised security-oriented api resource access controlled capabilities virtualization first-class concern novel approaches kernel resource management design goal suitability formal analysis besides usual goal high performance examples coyotos nova redox fiasco.oc case sel4 complete formal verification implementation achieved i.e mathematical proof kernel implementation consistent formal specification provides guarantee properties proved api actually hold real kernel degree assurance goes beyond even cc eal7 followed proofs security-enforcement properties api proof demonstrating executable binary code correct translation c implementation taking compiler tcb taken together proofs establish end-to-end proof security properties kernel term nanokernel picokernel historically referred also least one case term nanokernel used refer small kernel one supports nanosecond clock resolution | [
2560,
3587,
3082,
6155,
6675,
7187,
8725,
10776,
25,
1561,
4637,
9762,
4643,
6180,
4646,
5158,
7217,
10803,
9784,
10809,
58,
10813,
576,
2625,
6221,
10835,
3160,
10333,
97,
10851,
11363,
8295,
6248,
4201,
3178,
6760,
8298,
9835,
10856,
72... | Test |
7,188 | 2 | Computer_terminal:computer terminal computer terminal electronic electromechanical hardware device used entering data displaying printing data computer computing system teletype example early day hardcopy terminal predated use computer screen decades acronym crt cathode-ray tube referred computer terminal come refer type screen personal computer early terminals inexpensive devices slow compared punched cards paper tape input technology improved video displays introduced terminals pushed older forms interaction industry related development timesharing systems evolved parallel made inefficiencies user typing ability ability support multiple users machine terminal function terminal confined display input data device significant local programmable data processing capability may called smart terminal fat client terminal depends host computer processing power called dumb terminal thin client personal computer run terminal emulator software replicates function terminal sometimes allowing concurrent use local programs access distant terminal host system terminal first working programmable fully automatic digital turing-complete computer z3 keyboard row lamps show results early user terminals connected computers electromechanical teleprinters/teletypewriters teletypewriter tty teletype model 33 asr originally used telegraphy friden flexowriter keyboard/printer terminals came later included ibm 2741 1965 decwriter la30 1970 respective top speeds teletypes ibm 2741 la30 10 15 30 characters per second although time paper king speed interaction relatively limited early video computer displays sometimes nicknamed glass ttys glass teletypes visual display units vdus used cpu instead relying individual logic gates primitive lsi chips nevertheless quickly became extremely popular input-output devices many different types computer system several suppliers gravitated set common standards datapoint 3300 computer terminal corporation announced 1967 shipped 1969 making one earliest stand-alone display-based terminals solved memory space issue mentioned using digital shift-register design using 72 columns rather later common choice 80 starting datapoint 3300 late 1970s early 1980s dozens manufacturers terminals including lear-siegler adds data general dec hazeltine corporation heath/zenith hewlett packard ibm televideo volker-craig wyse many incompatible command sequences although many used early adm-3 starting point great variations control codes makers gave rise software identified grouped terminal types system software would correctly display input forms using appropriate control codes unix-like systems termcap terminfo files stty utility term environment variable would used data general business basic software example login-time sequence codes sent terminal try read cursor position 25th line contents using sequence different manufacturer control code sequences terminal-generated response would determine single-digit number 6 data general dasher terminals 4 adm 3a/5/11/12 terminals 0 2 tty special features would available programs say set codes use great majority terminals monochrome manufacturers variously offering green white amber sometimes blue screen phosphors amber claimed reduce eye strain terminals modest color capability also available widely used example color version popular wyse wy50 wy350 offered 64 shades character cell intelligent terminal processing usually implying microprocessor built terminals microprocessors real processing input main computer attached would respond quickly keystroke term intelligent context dates 1969. notable examples include ibm 2250 ibm 2260 predecessors ibm 3270 introduced system/360 1964 terminals connected minicomputers mainframe computers often green amber screen typically terminals communicate computer via serial port via null modem cable often using eia rs-232 rs-422 rs-423 current loop serial interface ibm systems communicated coaxial cable using ibm sna protocol many dec data general ncr computers many visual display suppliers competing computer manufacturer terminals expand systems fact instruction design intel 8008 originally conceived computer terminal corporation processor datapoint 2200 introduction ibm 3270 dec vt100 1978 user programmer could notice significant advantages vdu technology improvements yet programmers used features new terminals backward compatibility vt100 later televideo terminals example dumb terminals allowed programmers continue use older software dumb terminals able respond escape sequences without needing microprocessors used multiple printed circuit boards many integrated circuits single factor classed terminal intelligent ability process user-input within terminal—not interrupting main computer keystroke—and send block data time example user finished whole field form terminals early 1980s adm-3a tvi912 data general d2 dec vt52 despite introduction ansi terminals 1978 essentially dumb terminals although later adm tvi models primitive block-send capability common early uses local processing power included features little off-loading data processing host computer added useful features printing local printer buffered serial data transmission serial handshaking accommodate higher serial transfer speeds sophisticated character attributes display well ability switch emulation modes mimic competitor models became increasingly important selling features 1980s especially buyers could mix match different suppliers equipment greater extent advance microprocessors lower memory costs made possible terminal handle editing operations inserting characters within field may previously required full screen-full characters re-sent computer possibly slow modem line around mid 1980s intelligent terminals costing less dumb terminals would years earlier could provide enough user-friendly local editing data send completed form main computer providing even processing possibilities workstations like televideo ts-800 could run cp/m-86 blurring distinction terminal personal computer another motivations development microprocessor simplify reduce electronics required terminal also made practicable load several personalities single terminal qume qvt-102 could emulate many popular terminals day sold organizations wish make software changes frequently emulated terminal types included ansi x3.64 escape code standard produced uniformity extent significant differences remained example vt100 heathkit h19 ansi mode televideo 970 data general d460 qume qvt-108 terminals followed ansi standard yet differences might exist codes function keys character attributes available block-sending fields within forms foreign character facilities handling printers connected back screen term intelligent terminal refer store check-out computer early ibm pcs single color green screens screens terminals screen pc contain character generation hardware video signals video formatting generated video display card pc graphics modes cpu software ibm pc monitor whether green monochrome display 16-color display technically much similar analog tv set without tuner terminal suitable software pc could however emulate terminal capacity could connected mainframe minicomputer data general one could booted terminal emulator mode rom eventually microprocessor-based personal computers greatly reduced market demand conventional terminals 1990s especially thin clients x terminals combined economical local processing power central shared computer facilities retain advantages terminals personal computers today pc telnet clients provide emulation common terminal dec vt100 using ansi escape code standard x3.64 could run x terminals using software cygwin/x microsoft windows x.org server software linux since advent subsequent popularization personal computer genuine hardware terminals used interface computers today using monitor keyboard modern operating systems like linux bsd derivatives feature virtual consoles mostly independent hardware used using graphical user interface gui like x window system one display typically occupied collection windows associated various applications rather single stream text associated single process case one may use terminal emulator application within windowing environment arrangement permits terminal-like interaction computer running command line interpreter example without need physical terminal device even allow running multiple terminal emulators device character-oriented terminal type computer terminal communicates host one character time opposed block-oriented terminal communicates blocks data common type data terminal easy implement program connection mainframe computer terminal server achieved via rs-232 serial links ethernet proprietary protocols text terminal often terminal sometimes text console serial computer interface text entry display information presented array pre-selected formed characters devices use video display cathode-ray tube called video display unit visual display unit vdu video display terminal vdt system console text terminal used operate computer modern computers built-in keyboard display console unix-like operating systems linux freebsd virtual consoles provide several text terminals single computer fundamental type application running text terminal command line interpreter shell prompts commands user executes command press enter includes unix shells interactive programming environments shell commands small applications another important application type text editor text editor occupies full area display displays one text documents allows user edit documents text editor many uses replaced word processor usually provides rich formatting features text editor lacks first word processors used text communicate structure document later word processors operate graphical environment provide wysiwyg simulation formatted output programs telix minicom control modem local terminal let user interact remote servers internet telnet ssh work similarly simplest form text terminal like file writing file displays text reading file produces user enters unix-like operating systems several character special files correspond available text terminals operations special escape sequences control characters codice_1 functions program use easily via library ncurses complex operations programs use terminal specific ioctl system calls application simplest way use terminal simply write read text strings sequentially output text scrolled last several lines typically 24 visible unix systems typically buffer input text enter key pressed application receives ready string text mode application need know much terminal many interactive applications sufficient one common enhancements command line editing assisted libraries readline also may give access command history helpful various interactive command line interpreters even advanced interactivity provided full-screen applications applications completely control screen layout also respond key-pressing immediately mode useful text editors file managers web browsers addition programs control color brightness text screen decorate underline blinking special characters e.g box drawing characters achieve application must deal plain text strings also control characters escape sequences allow move cursor arbitrary position clear portions screen change colors display special characters also respond function keys great problem many different terminals terminal emulators set escape sequences order overcome special libraries curses created together terminal description databases termcap terminfo dumb terminals interpret limited number control codes cr lf etc ability process special escape sequences perform functions clearing line clearing screen controlling cursor position context dumb terminals sometimes dubbed glass teletypes essentially limited functionality mechanical teletype type dumb terminal still supported modern unix-like systems setting environment variable term dumb smart intelligent terminals also ability process escape sequences particular vt52 vt100 ansi escape sequences graphical terminal display images well text graphical terminals divided vector-mode terminals raster mode vector-mode display directly draws lines face cathode-ray tube control host computer system lines continuously formed since speed electronics limited number concurrent lines displayed one time limited vector-mode displays historically important longer used practically modern graphic displays raster-mode descended picture scanning techniques used television visual elements rectangular array pixels since raster image perceptible human eye whole short time raster must refreshed many times per second give appearance persistent display electronic demands refreshing display memory meant graphic terminals developed much later text terminals initially cost much terminals today graphical show images screen modern term graphical terminal thin client thin client typically uses protocol like x11 unix-terminals rdp microsoft windows bandwidth needed depends protocol used resolution color depth modern graphic terminals allow display images color text varying sizes colors fonts type faces early 1990s industry consortium attempted define standard alphawindows would allow single crt screen implement multiple windows behave distinct terminal unfortunately like i2o suffered run closed standard non-members unable obtain even minimal information realistic way small company independent developer could join consortium possibly standard disappeared without trace terminal emulator piece software emulates text terminal past widespread use local area networking broadband internet access many computers would use serial access program communicate computers via telephone line serial device first macintosh released program called macterminal used communicate many computers including ibm pc dec terminal one first terminal programs popular altair win32 console windows emulate physical terminal supports escape sequences ssh telnet programs logging textually remote computers windows including telnet program bundled versions windows often incorporate code process escape sequences terminal emulators unix-like systems example gnome-terminal qterminal xterm terminal.app emulate physical terminals including support escape sequences e.g xterm emulate vt220 tektronix 4010 hardware terminals terminals operate various modes relating send input typed user keyboard receiving system whatever may distinction keys multiple-mode terminals switch modes pressing key block mode thing pressing key whilst key cause input line sent host line-at-a-time mode key rather cause terminal transmit contents character row cursor currently positioned host host-issued prompts different computer operating systems require different degrees mode support terminals used computer terminals posix terminal interface provided unix posix-compliant operating systems accommodate block-mode terminals rarely requires terminal line-at-a-time mode since operating system required provide canonical input mode terminal device driver operating system emulates local echo terminal performs line editing functions host end usually especially host system support non-canonical input mode terminals posix-compliant systems always character-at-a-time mode contrast ibm 3270 terminals connected mvs systems always required block mode block-oriented terminal block mode terminal type computer terminal communicates host blocks data opposed character-oriented terminal communicates host one character time ibm 3270 perhaps familiar implementation block-oriented terminal mainframe computer manufacturers several companies produced block-oriented terminals typically incorporate buffer stores one screen data also stores data attributes indicating appearance color brightness blinking etc also marks data enterable terminal operator vs. protected entry allowing entry numeric information vs. allowing characters etc typical application host sends terminal preformatted panel containing static data fields data may entered terminal operator keys data updates database entry appropriate fields entry complete enter pf key pressed 3270 block data usually data entered operator modified data sent host one transmission 3270 terminal buffer device could updated single character basis necessary existence set buffer address order sba usually preceded data written/overwritten within buffer complete buffer could also read replaced using codice_2 command codice_3 command unformatted formatted case 3270 block-oriented terminals cause less system load host less network traffic character-oriented terminals also appear responsive user especially slow connections since editing within field done locally rather depending echoing host system early terminals limited editing capabilities – 3270 terminals example could check entries valid numerics subsequent smart intelligent terminals incorporated microprocessors supported local processing programmers block-oriented terminals often used technique storing context information transaction progress screen possibly hidden field rather depending running program keep track status precursor html technique storing context url data passed arguments cgi program unlike character-oriented terminal typing character last position screen usually causes terminal scroll one line entering data last screen position block-oriented terminal usually causes cursor wrap — move start first enterable field programmers might protect last screen position prevent inadvertent wrap likewise protected field following enterable field might lock keyboard sound audible alarm operator attempted enter data field allowed | [
6657,
8732,
1606,
1121,
5733,
7269,
10341,
9324,
8301,
7281,
1147,
3708,
8831,
6797,
4750,
3729,
7325,
7847,
2222,
11442,
6837,
5312,
2756,
2245,
1742,
9438,
5855,
1253,
1776,
5873,
5363,
2804,
3323,
7943,
5384,
780,
11023,
5397,
8984,
43... | None |
7,189 | 2 | System_image:system image computing system image serialized copy entire state computer system stored non-volatile form file system said capable using system images shut later restored exactly state cases system images used backup hibernation example uses image entire machine ram system state written disk system image produced simply copying disk file elsewhere often disk cloning applications many systems complete system image created disk cloning program running within system information held outside disks volatile memory example non-volatile memory like boot roms process image copy given process state given point time often used create persistence within otherwise volatile system common example database management system dbms dbms store state database databases file closed see database dump dbms restarted later information database intact proceed though software never stopped another example would hibernate feature many operating systems state ram memory stored disk computer brought energy saving mode later restored normal operation emulators provide facility save image system emulated video gaming often referred savestate another use code mobility mobile agent migrate machines state saved copying data another machine restarting programming languages provide command take system image program normally standard feature smalltalk inspired flex lisp among languages development languages often quite different many programming languages example lisp programmer may load packages code running lisp implementation using read-eval-print loop usually compiles programs data loaded running lisp system programmer may dump system image containing pre-compiled possibly customized code—and also loaded application data often image executable run machines system image form executable programs distributed—this method often used programs tex emacs largely implemented lisp smalltalk idiosyncratic languages avoid spending time repeating initialization work every time start similar lisp machines booted lisp images called worlds world contains complete operating system applications data single file also possible save incremental worlds contain changes base world saving world lisp machine operating system could optimize contents memory better memory layout compacting data structures sorting data ... although purpose different system image often similar structure core dump | [
2432,
9218,
2051,
1804,
6424,
10778,
3109,
3366,
7983,
823,
2107,
8262,
4423,
2383,
2901,
6502,
2160,
2804,
3066,
8447
] | Test |
7,190 | 3 | Epson_Equity:epson equity epson equity series ibm compatible personal computers manufactured 1985 early '90s epson inc. epson well known dot matrix printers time equity series represents entry growing pc compatible market equity first system introduced equipped intel 8088 cpu one two 5.25 floppy disk drives original equity no-frills offering ran pc standard 4.77 mhz clock rate came 256 kb ram expansion 512 kb required expansion board displayed cga video available expansion slots two half-height drive bays lacked socket 8087 math chip subsequent versions equity i+ apex 100 upped clock rate 10 mhz standard ram 640 kb supported 3.5 inch floppy drives hard disks sported 8087 socket display circuitry monochrome hercules graphics adapter epson bundled utility programs offered decent turnkey functionality novice users equity reliable compatible design half price similarly-configured ibm pc epson often promoted sales bundling one printers cost equity sold well enough warrant furtherance equity line follow-on equity ii equity iii others based i386sx | [
6129,
4642
] | Test |
7,191 | 2 | Multics_Relational_Data_Store:multics relational data store multics relational data store mrds short first commercial relational database management system written pl/1 honeywell multics operating system first sold june 1976 unlike sql systems emerged late 1970s early 80 mrds used command language basic data manipulation equivalent codice_1 codice_2 statements sql operations like creating new database general file management required use separate command program | [
9286,
10413,
10286,
7983,
6772,
2901
] | Test |
7,192 | 4 | Samhain_(software):samhain software samhain integrity checker host intrusion detection system used single hosts well large unix-based networks supports central monitoring well powerful new stealth features run undetected memory using steganography | [
6372,
6092,
3629,
6606,
7983,
8399,
2045,
2901,
823,
5433,
5245,
6559
] | None |
7,193 | 9 | Metasyntactic_variable:metasyntactic variable metasyntactic variable specific word set words identified placeholder computer science specifically computer programming words commonly found source code intended modified substituted applicable specific usage compilation translation executable words foo bar good examples used 330 internet engineering task force requests comments documents explaining foundational internet technologies like http websites tcp/ip email protocols mathematical analogy metasyntactic variable word variable words algebra letters used variables numbers metasyntactic variables used name entities variables functions commands whose exact identity unimportant serve demonstrate concept useful teaching programming due english foundation-language lingua franca computer programming languages variables commonly seen even programs examples programs written spoken-language audiences typical names may depend however subculture developed around given programming language metasyntactic variables used commonly across programming languages include foobar foo bar baz qux quux quuz corge grault garply waldo fred plugh xyzzy thud several words references game colossal cave adventure wibble wobble wubble flob also used uk complete reference found mit press book titled hacker dictionary spam ham eggs principal metasyntactic variables used python programming language reference comedy sketch spam monty python eponym language japanese words hoge ほげ piyo ぴよ commonly used common words variants fuga ふが hogera ほげら hogehoge ほげほげ note -ra pluralizing ending japanese reduplication also used pluralizing origin hoge metasyntactic variable known believed date early 1980s french word toto widely used variants tata titi tutu related placeholders one commonly-raised source use toto reference stock character used tell jokes tête à toto following example function name foo variable name bar metasyntactic variables lines beginning // comments spam ham eggs principal metasyntactic variables used python programming language reference famous comedy sketch spam monty python eponym language following example spam ham eggs metasyntactic variables lines beginning comments ietf rfcs computer programming languages rendered plain text making necessary distinguish metasyntactic variables naming convention since would obvious context plain text example rfc 772 cited rfc 3092 contains instance another point reflected example convention metavariable uniformly substituted instance appearances given schema contrast nonterminal symbols formal grammars nonterminals right production substituted different instances section includes bits code show metasyntactic variables used teaching computer programming concepts function prototypes different argument passing mechanisms example showing function overloading capabilities c++ language | [
1952,
8262,
6633,
8554,
10555
] | Validation |
7,194 | 4 | Deep_Instinct:deep instinct deep instinct cybersecurity company applies deep learning cybersecurity company implements advanced artificial intelligence task preventing detecting malware deep instinct founded 2014 guy caspi dr. eli david nadav maman headquarters company located new york city nvidia investor april 2019 deep instinct commissioned art project titled persistence chaos chinese artist guo dong consisting laptop infected 6 pieces malware represented 95 billion damages art auctioned final bid 1,345,000 | [] | Test |
7,195 | 2 | Service_Request_Block:service request block service request block srb data structure mvs/370 successor versions ibm mainframe operating systems employed mainly exclusively start input/output interface srb may considered abstract highly optimized task control block tcb one associated resources access processor system resources utilized srb must accessed use branch entries new entries traditional system services formerly accessed exclusively using svc instructions srb may employ purpose abnormally terminating case svc 13 abend may used however branch entry abterm really appropriate employed start input/output interface srb always paired input/output supervisor block iosb otherwise employed srb facilitates inter -address-space communication general inter -application communication particular srbs may also employed intra -address-space processes highest possible performance required case necessary resources first acquired tcb usually job step tcb srbs scheduled i.e. presented system dispatcher compete processor resources conceivable address space may one tcb job step tcb tens hundreds even thousands srbs srbs performing almost work address space tcb merely synchronizing srbs responding communications system operator purposes synchronization tcb usually issue waitr svc 1 specifying list event control blocks ecbs one ecb per srb plus one system operator srb indicate completion tcb using branch entry post system service normally svc 2 special case would call address contained cvt0pt01 specifying ecb associated srb possibly message tcb message present often placed lowest 24 bits ecb otherwise unused highest eight bits used system disk device access network device access available srbs using improved control interval processing feature vsam fast path feature vtam respectively introduction mvs/370 successor systems whole new environment introduced service request block srb generally higher priority tcb indeed two distinct priorities global srb priority local address space srbs tcbs local srb priority local address space tcbs mvs dispatcher must manage absolute consistency across many two processors mvs/370 many sixteen processors successor systems sixteen processors available z/system models z/system support ziip dramatically increased use srbs traditional start input/output usage srb highly-optimized instance process control block mvs/370 successor systems tcb general-purpose instance process control block os/360 successor systems | [
11656,
7983,
11381,
11131,
5598
] | Test |
7,196 | 6 | Lsof:lsof lsof command meaning list open files used many unix-like systems report list open files processes opened open source utility developed supported victor a. abell retired associate director purdue university computing center works supports several unix flavors open files system include disk files named pipes network sockets devices opened processes one use command disk unmounted unspecified files use listing open files consulted suitably filtered necessary identify process using files view port associated daemon one see sendmail listening standard port 25 one also list unix sockets using codice_1 lsof output describes | [
515,
9733,
9735,
3976,
4750,
5397,
2198,
6812,
6813,
7847,
4398,
7983,
823,
1336,
7356,
965,
8522,
3659,
9946,
6120,
4850,
5492,
9204,
6138,
5759
] | None |
7,197 | 1 | Digital_Notam:digital notam digital notam digitam data set made available digital services containing information concerning establishment condition change aeronautical facility service procedure hazard timely knowledge essential systems automated equipment used personnel concerned flight operations digital notam encoding based aeronautical information exchange model aixm version 5 developed cooperation european organisation safety air navigation eurocontrol united states federal aviation administration faa support international ais community.the digitam eliminates free form text contained within notam replaces text series structured facts obtain aeronautical entity concerned 2012 federal aviation administration faa successfully launched first global digital notam notice airmen system airports airplanes united states | [
2901
] | Test |
7,198 | 8 | OASIS_TOSCA:oasis tosca topology orchestration specification cloud applications tosca oasis standard language describe topology cloud based web services components relationships processes manage tosca standard includes specifications describe processes create modify web services 16 january 2014 oasis tosca technical committee approved tosca 1.0 standard commercialization cloud computing offerings required manageability tenant applications particularly large scale vendors offer services wide market written related standards predate developed concurrently oasis tosca standard aws cloudformation template json data standard allow cloud application administrators define collection related aws resources worth noting cloudformation proprietary format aws tosca based therefore bring promise oasis tosca targeting check grammar compared oasis tosca one openstack foundation also defined similar standard specifying resources orchestrations managing infrastructure application lifecycles heat-translator project one first adopt tosca standardized templating cloudify open source tosca-based orchestration framework based yaml alien4cloud meaning application lifecycle enabler cloud open source tosca based designer cloud application lifecycle management platform natively integrated cloudify runtime orchestration though orchestrators plugged ubicity provides tooling orchestrators based tosca seaclouds eu fp7 funded project whose mission provide seamless adaptive multi-cloud management service-based applications natively supports tosca participating standardization standard dice eu h2020 funded project offering model-driven devops toolchain develop big data applications tosca acts pivot language dev- modelling notations -ops space i.e. deployment monitoring etc particular offering standard infrastructure-as-code generated automatically models | [
2501,
425,
8203,
7628,
10829,
4979,
7320,
6811,
2013,
6079
] | None |
7,199 | 4 | Snowden_effect:snowden effect snowden effect part reactions global surveillance disclosures made edward snowden subject controversy snowden variously called hero whistleblower dissident patriot traitor july 2013 media critic jay rosen defined snowden effect direct indirect gains public knowledge cascade events reporting followed edward snowden leaks classified information surveillance state u.s. december 2013 nation wrote snowden sparked overdue debate national security individual privacy 2014 world economic forum internet experts saw news microsoft would let foreign customers store personal data servers outside america sign snowden leaks leading countries companies erect borders cyberspace forbes effect seen nearly united u.s. congress opposition massive post-9/11 domestic intelligence gathering system spring 2014 global attitudes survey pew research center found snowden disclosures tarnished image united states especially europe latin america may 2014 obama administration appointed william evanina former fbi special agent counter-terrorism specialty new government-wide national counterintelligence executive instead getting carried away concept leakers heroes evanina said august need get back basics means loyal undifferentiated unauthorized leaking criminal act dealing insider threats intelligence community priority since wikileaks published chelsea manning disclosures 2010 evanina said aftermath snowden june 2013 revelations process sped regional railway acela train year later 100,000 fewer people security clearances september 2014 director national intelligence james clapper said snowden leaks created perfect storm degrading intelligence community capabilities snowden leaks said clapper damaged relationships foreign corporate stakeholders restrained budget resources caused u.s. discontinue collecting intelligence certain targets putting united states greater risk october 2014 former director national counterterrorism center matthew g. olsen told cnn snowden disclosures made easier terrorist groups evade u.s. surveillance changing encryption methods olsen said intelligence collection individuals concern lost preventing insight activities july 2015 isil studied snowden disclosures said u.s. officials leaders using couriers encrypted communications western analysts could crack february 2015 national counterterrorism center director nicholas rasmussen told congress snowden disclosures damaged u.s. intelligence capabilities rasmussen said government knew specific terrorists learning snowden leaks u.s. collected intelligence increased security measures using new types encryption changing email addresses abandoning prior methods communicating reflecting effect leaks snowden wrote february 2015 biggest change awareness 2013 said nsa making records everybody phonecalls gchq monitoring lawyers journalists people raised eyebrows called conspiracy theorist days march 2015 usa today reported snowden effect hit guardian journalist michael wolff wrote guardian many years asserted recent selection katharine viner editor-in-chief read part deeply equivocal response part paper staff unusual power process selecting new editor snowden story according wolff developed sense journalistic queasiness around snowden difficult express party-line guardian questioning snowden retreat russia protection vladimir putin internally verboten technology industry snowden effect profound impact revealed nsa tapping information held u.s. cloud-based services google cisco lost business internationally due public outcry roles nsa spying study information technology innovation foundation published august 2013 estimated cloud-based computing industry could lost 35 billion 2016 wall street journal named snowden effect 2013 top tech story saying snowden leaks taught businesses convenience cloud cuts ways journal predicted effect would top 2014 news well given number documents yet revealed china profitable country u.s. tech companies suspicion either witting unwitting collaborators nsa spying according director research center chinese politics business indiana university effect also seen changes investment industry security back map according hussein kanji venture capitalist hoxton ventures august 8 2013 lavabit secure email provider snowden used discontinued service asked encryption keys would exposed u.s. government prosecutors emails 410,000 lavabit users next day similar provider called silent circle announced would shut possible sufficiently secure email october 2013 two companies joined forces announced new email service dark mail alliance designed withstand government surveillance revelations german chancellor angela merkel mobile tapped tech industry rushed create secure cell phone according techrepublic revelations nsa leaks rocked world chilling effect three biggest impacts seen increased interest encryption business leaving u.s. companies reconsideration safety cloud technology blackphone new yorker called phone age snowden —described smartphone explicitly designed security privacy created makers geeksphone silent circle pgp provided encryption phone calls emails texts internet browsing. ref name= kopstein/new yorker /ref since snowden disclosures americans used internet less things like email online shopping banking according april 2014 poll also april 2014 former nsa deputy director col. cedric leighton told bloomberg enterprise technology summit new york city snowden leaks performed significant disservice worldwide health internet leading brazil countries reconsider internet decentralized nature leighton suggested nation states efforts create versions internet beginning end internet know situation sudden everyone goes 'tribal mode—a german cloud swiss cloud separate internet—they significant nationalistic attempts said leighton happened snowden excuse policy excuse re-nationalize internet march 2014 new york times reported economic fallout snowden leaks boon foreign companies detriment u.s. firms daniel castro senior analyst information technology innovation foundation predicted united states cloud computing industry could lose 35 billion 2016 matthias kunisch german software executive switched u.s. cloud computing providers deutsche telekom said due snowden customers thought american companies connections nsa security analysts estimated u.s. tech companies since snowden collectively spent millions possibly billions dollars adding state-of-the-art encryption features consumer services cables link data centers july 2014 nonpartisan new america foundation summarized impact snowden revelations u.s. businesses erosion trust said report serious consequences u.s. tech firms executives france hong kong germany uk u.s. confirmed snowden leaks directly impacted companies around world think information communication technologies particularly cloud computing quarter british canadian multinational companies surveyed moving data outside u.s among u.s. companies attributing drops revenue part fallout snowden leaks cisco systems qualcomm ibm microsoft hewlett-packard proposed laws dozen foreign countries including germany brazil india would make harder u.s. firms business european union considering stricter domestic privacy legislation could result fines penalties costing u.s. firms billions dollars august 2014 massachusetts-based web intelligence firm recorded future announced found direct connection snowden leaks dramatic changes islamist terrorists interacted online 2010 privately held recorded future received investment in-q-tel nonprofit venture capital firm whose primary partner cia months snowden 2013 leaks said recorded future operatives al-qaeda associated groups completely overhauled 7-year-old encryption methods included homebrewed algorithms adopting instead sophisticated open-source software newly available downloads enabled encryption cellphones android products macs help disguise communications september 2014 seattle-based deep web dark web monitoring firm flashpoint global partners published report found little open source information available via jihadi online social media indicating snowden leaks impelled al-qaeda develop secure digital communications underlying public encryption methods employed online jihadists report concluded appear significantly changed since emergence edward snowden major recent technological advancements focused primarily expanding use encryption instant messenger mobile communications mediums may 2015 nation reported fallout edward snowden fiasco n't political—it largely economic soon extent nsa data collection became public overseas customers including brazilian government started abandoning u.s.-based tech companies droves privacy concerns dust n't settled yet tech-research firm forrester estimated losses may total 'as high 180 billion 25 percent industry revenue september 2014 new york times credited apple inc. update ios 8 encrypts data inside demonstrating snowden impact begun work way consumer products revelations said times killed recent efforts expand law also made nations around world suspicious every piece american hardware software—from phones servers made cisco systems—have 'back doors american intelligence law enforcement times situated development within post snowden era apple would longer comply nsa law enforcement requests user data instead maintaining apple n't possess key unlock data iphone however since new security protects information stored device data stored apple icloud service apple still able obtain customer information stored icloud response government requests times added google android would encryption enabled default upcoming versions | [
4194,
9732,
3495,
5384,
6023,
8283,
9863,
2800,
6834,
4595,
3323
] | Test |
7,200 | 7 | Qualcomm_Wi-Fi_SON:qualcomm wi-fi son qualcomm wi-fi son self-organizing network solution developed qualcomm wi-fi networks simply automatically select link different wireless networking devices together using concept mesh networking supposed improve network coverage different corners house apartment also provide improved security note technology behind solution like mesh networking cellular self-organizing network would included dynamical adjustment different access points client devices | [
10021,
9863
] | Validation |
7,201 | 4 | Chris_Klaus:chris klaus christopher w. klaus born 1973 sarasota florida american technology entrepreneur founder cto internet security systems iss company started early 1990s sold ibm 2006 1.3b 2016 ceo kaneva game company founded 2004 also main financier multiple business accelerators atlanta area klaus formed iss early 1990s student georgia institute technology eventually dropping focus growing company 2004 stepped role chief technology officer iss pursue interests although remained significant shareholder retained role company chief security advisor 2006 iss sold ibm 1.3b around 2007 klaus became one georgia tech visible contributors giving 15m naming gift build college computing new home klaus advanced computing building july 2014 klaus co-founded neurolaunch business accelerator focused towards neurotech companies atlanta october 2015 financed co-founded another accelerator cyberlaunch focuses cybersecurity machine learning startups klaus wife crissy also prominent figure fifteen years work local marketing real estate well extensive work non-profit organizations recently founded fio360 atlanta first eco-early care center | [
3323
] | Test |
7,202 | 1 | NoSQLz:nosqlz nosqlz consistent key-value big data store nosql database z/os ibm systems developed systems programmer thierry falissard 2013 purpose provide low-cost alternative proprietary mainframe dbms version 1 free software nosqlz provides basic create read update delete crud functions designed straightforward easy implement acid properties provided real transactions optimistic concurrency control timestamp-based concurrency control multiversion concurrency control mvcc unlike version 1 version 2 nosqlz chargeable supports ibm parallel sysplex nosqlz dbms interfaced rexx cobol ibm high level assembler etc | [
2168,
10048,
3323,
7983
] | Test |
7,203 | 4 | SMS_spoofing:sms spoofing sms spoofing technology uses short message service sms available mobile phones personal digital assistants set message appears come replacing originating mobile number sender id alphanumeric text spoofing legitimate uses setting company name message sent setting mobile number product name illegitimate uses impersonating another person company product also send mysterious messages look like legitimate numbers contacts sms spoofing occurs sender manipulates address information often done order impersonate user roamed onto foreign network submitting messages home network frequently messages addressed destinations outside home network – home smsc essentially “ hijacked ” send messages networks advanced cases even hijack existing contacts phone impact activity threefold legitimate use cases sms spoofing include sms spoofing attack often first detected increase number sms errors encountered bill-run errors caused spoofed subscriber identities operators respond blocking different source addresses gateway-mscs fraudsters change addresses easily by-pass measures fraudsters move using source addresses major interconnect partner may become unfeasible block addresses due potential impact normal interconnect services 2007 uk premium rate regulator phonepayplus formerly icstis concluded public consultation anonymous sms stated averse operation services however 2008 phonepayplus introduced new regulation covering anonymous sms requiring anonymous sms service providers send follow-up message recipient stating spoofed sms sent operate complaints helpline illegal send anonymous sms messages australia user prove sms sessions spoofed contact law enforcement cellular provider able track sms messages actually sent user may also modify phone settings messages authorized numbers allowed always effective since hackers could impersonating user friends well | [] | Test |
7,204 | 2 | Caldera_OpenLinux:caldera openlinux caldera openlinux col defunct linux distribution originally introduced caldera 1997 based german lst power linux distribution taken developed caldera systems sco group since 1998 successor caldera network desktop put together caldera since 1995 openlinux early business-oriented distribution foreshadowed direction developments came distributions linux community generally corsair user interface netware project run novell corporation advanced technology group atg 1993 1995 novell wanted desktop environment internet connectivity conducted research better easily integrate manage network access users windows support connecting novell networks would improved later releases internet dominated unix-based operating systems relative needs novell deemed unixes day hardware intensive large charged much license fees group became convinced linux offered best possible answer os component many components well particular interest 5 april 1994 board novell hired robert frankenberg general manager hewlett-packard personal information products group replace raymond john noorda ceo novell novell stock price performed poorly recently due flagging growth novell network division nsg growing pace 19 per year unix business division usg flat desktop applications division dsg shrinking rate 400 million per year frankenberg initiative refocus company networking networking services terms corsair meant shedding pieces advanced technology group disbanded shut willows os project negotiations started would eventually lead wordperfect sold corel january 1996 ferret line new direction component kept within novell noorda family trust nft ray noorda founded venture capital investment group called canopy group two years earlier 1992 thought substantial promise os project willows project created two companies continue work started novell api company called willows software inc. founded 1993 os company became caldera inc. founded october 1994 incorporated january 1995 noorda early vision caldera create ipx-based version linux would license key components resell technology back novell continue internet desktop effect 1994 caldera started life kind outsourcing project novell based technology demo named exposé caldera started ten employees novell bryan wayne sparks founder/president novell bryce j. burns chief operations officer novell ransom h. love vp marketing novell greg page vp engineering bell labs craig bradley vp sales lotus word perfect point 1995 ransom love ray noorda took note technologies caldera put together specifically component novell caldera assembled components needed create var platform however caldera faced bootstrapping problem oem var applications often depended crucially companies commercial applications since applications n't ported linux yet could n't meaningfully port applications caldera responded creating binary applications package allowed linux run unixware openserver applications linux application binary interface abi project assisting santa cruz operation sco creating linux kernel personalities linux kernel personalities worked bring linux application compatibility sco unix formerly unixware openserver idea enable developers write unix linux common application programming interface api common application binary interface abi way developers n't work hard unix users client base inherited sco could run linux applications caldera also supported alan cox work smp linux displaced unix intel x86 platform sun microsystems would n't low-end unix path point becomes interesting light sco litigation eight years later ibm 2003 ibm company involved smp work moreover company directly involved company later became sco group essentially sco suing ibm work 1995 xfree86 still hard configure unreliable chipsets caldera shipped metrolink motif xi graphic accelerated-x known releases caldera network desktop produced sold march 1997 1996 caldera continued valuable player example 23 may 1996 linux kongress berlin germany caldera announced plans obtain posix fips certifications x/open brand unix 95 xpg4 base 95 linux operating system kernel open linux contrast cnd openlinux based lst power linux slackware-derived distribution maintained linux support team since 1993 first come linux 2.0 kernel 1996 linux support team grew stefan probst ralf flaxa company lst software gmbh lst standing linux system technology erlangen germany openlinux development led become caldera german development center caldera deutschland gmbh since may 1997 23 july 1996 caldera purchased novell dos remaining digital research assets novell order bundle dos version linux led creating opendos distribution help port dos applications caldera supported linux-port staroffice 3.1 ca 800.000 dm order offer product forthcoming openlinux distribution 1997 1997 openlinux distribution first released caldera taken form would remembered caldera switched high end linux product business linux distribution became rich features bundled proprietary software however became less community oriented released less frequently linuxes differences included automated configuration administration tools paid technical support staff built-in consistent default gui range supported applications next five years caldera systems offered additional commercial extensions linux licensed sun wabi allow people run windows applications linux additionally shipped linux versions wordperfect novell later corel coreldraw since many customers used dual boot setup fips unreliable shipped powerquest partitionmagic allow customers non-destructively repartition hard disks partnership ibm produced first linux distribution db2 compatible oracle corporation became target platform linux port oracle database ventures included starting blackdown java project creating professional certification also formed strong partnerships sco value-added reseller market started laying groundwork oem sales unix-based vertical applications caldera systems offered three versions openlinux addition people applications created many linux extensions fill voids commercial company caldera systems began working linux equivalent replacing microsoft exchange server microsoft outlook would eventually become volution messaging server offered calendaring/scheduling options shared busy/free information ssl support e-mail easy configuration additionally caldera deutschland created first fully graphical installer linux called lizard starting november 1998 invented browser-based unix system administration created webmin project employed developer jamie cameron 1999 2001 caldera systems created full featured gui system administration tool called caldera open administration system coas tool unified easy use administration tool modular design scalability broad scope abilities featured openlinux showed linux community would required create mainstream desktop os linux kernel many ways last ten years desktop progress successfully implement caldera attempting tools available using open source software place closed applications technique utilize commercial software fill largest gaps making product value add thus could charge made commercial time made advanced distribution available desktop company became caldera international direction ransom love focus desktop company became mainly marketing business relationships several reasons first caldera 280 million lawsuit microsoft dr-dos flush cash secondly caldera distribution good primary advantages use technologies owned caldera thus caldera successful success could technical standpoint imitated red hat suse turbolinux etc third years caldera competing directly sco unix 1997 linux outperformed sco almost every respect making choice switch sco caldera no-brainer companies also meant switch vendors support organizations caldera sco acquisition aimed eliminating problem caldera international corporate direction became combine sco distribution marketing var arm lamp use project monterey develop 64-bit strategy sco offered technical standpoint however caldera openlinux really shone ransom love years commercial bundling solution continued work powerful low bug linux standards distribution worked well wide range hardware charged great deal relative distributions able generate strong profit red hat pulled way ahead terms us sales global sales front trailed suse turbolinux well financially due dr-dos settlement strongest linux distributions known releases incomplete products caldera systems quickly found classic business problem interests existing business conflicted growth model santa cruz operation sco much larger company caldera systems fact 71 million revenue 90 sco side business moreover caldera systems costs 4 marketing generate 1 sales sco mature sold mainly repeat customers var relationship even problematic caldera systems always sold linux sco better model done everything possible make transition sco caldera systems relatively seamless 14,000 sco resellers made much sco sale sales caldera systems anxious move existing customers sco linux even supportive linux saw strong value add caldera systems often sold red hat enterprise linux caldera systems two businesses direct competition one shrinking still profitable unix business rapidly growing business still hemorrhaging money logical solution establish caldera systems premier linux brand without threat red hat transitioning resellers sco caldera systems would much easier mind ransom love formed alliance large business oriented linux distributions utilized kde desktop called united linux alliance comprised caldera international suse linux turbolinux conectiva filings novell sco group sco v. novell lawsuit showed simply marketing gimmick real alliance business responded favorably movement ibm amd quickly formed partnerships linux professional institute adopted united linux standard distribution training first time linux distribution suse linux engineering continued maintain large technical staff caldera international global support organization turbo linux well conectiva brought growth potential less flooded markets merger successful love sparks could claim vindication year novell reversed frankenberg decision brought united linux engineering talent back fold acquisition suse united linux rejected broader linux community use per-seat licensing highly controversial decision importantly time united linux released darl mcbride become ceo caldera international focus shifted away linux caldera international point released caldera linux distribution openunix 8 kernel instead linux kernel unix tli streams support made writing drivers easier caldera international proved replacing kernel yet change much else full featured desktop server linux 2002 caldera international board directors including ralph yarro named darl mcbride formerly franklin-covey ceo almost immediately saw value caldera international primarily value sco company renamed sco group ransom love reassigned work exclusively united linux completed left company join progeny linux systems aiming create professional debian remained capacity board member advisor 30 april 2007 progeny ceased operations mcbride began focus sco copyrights one mcbride first acts ceo collect 600,000 back licensing fees owed caldera international cleaned various linux-related licensing issues allowing new round financing soon thereafter made strong accusations linux infringed copyrights sco held unix claimed purchased copyrights novell novell denied selling unix copyright prompting sue slander title sco also initiated lawsuits ibm autozone alleging copyright infringements use distribution linux none lawsuits resolved sco created division scosource owns licenses intellectual property desktop license 699 | [
2584,
9253,
11305,
5677,
56,
59,
4673,
3142,
1110,
1632,
3685,
10860,
2671,
7802,
11388,
641,
8837,
6797,
10394,
673,
3745,
7854,
178,
2738,
4790,
2239,
8907,
3791,
4841,
6890,
7913,
4333,
9455,
7920,
5363,
9461,
11513,
6393,
3323,
8957,
... | None |
7,205 | 9 | Geometric_Description_Language:geometric description language computer-aided design geometric description language gdl programming language archicad library parts gsm file format cad objects objects similar blocks autocad unlike blocks parametric 2d 3d features connected view one get correct visualization example side view section top view plan perspective 3d view gdl scripts define archicad library part main roles 3d model 3d model projected section/elevation 2d plan 2d plan view user interface display behaviour listing quantities versions archicad contain default libraries also objects like furniture windows doors trees people cars construction elements etc several commercial websites selling high-detailed intelligent parametric objects perhaps better variable default libraries example lot environmental objects like plants people garden elements included original software gdl free technology although archicad commercial software allowed possible develop gdl based object libraries using free tools like graphisoft lp_xmlconverter graphisoft gdl web plug-in gdl programming language basic-like control flow statements variable logic 2d 3d gdl model elements linked local right-handed coordinate system placing element desired position move coordinate system desired position orientation generate element every movement rotation stretching coordinate system called transformation transformations stored stack extended transformations cut deleting one transformations top gdl maintains forward compatibility means archicad library part readable every subsequent archicad program necessarily earlier versions | [
7209,
3923,
8262
] | Validation |
7,206 | 4 | LOMAC:lomac low water-mark mandatory access control lomac mandatory access control model protects integrity system objects subjects means information flow policy coupled subject demotion via floating labels lomac system subjects objects assigned integrity labels made one hierarchical grades depending types together label elements permit labels placed partial order information flow protections demotion decisions based dominance operator describing order | [
2164,
10580,
823
] | Validation |
7,207 | 2 | Graphical_identification_and_authentication:graphical identification authentication graphical identification authentication gina component windows 2000 windows xp windows server 2003 provides secure authentication interactive logon services gina replaceable dynamically linked library loaded early boot process context winlogon machine started responsible handling secure attention sequence typically control-alt-delete interacting user sequence received gina also responsible starting initial processes user windows shell first log gina discontinued windows vista default gina library msgina.dll provided microsoft part operating system offers following features winlogon configured use different gina providing non-standard authentication methods smart card readers identification based biometrics provide alternate visual interface default gina developers implement replacement gina required provide implementations set api calls cover functionality displaying workstation locked dialog processing secure attention sequence various user states responding queries whether locking workstation allowed action supporting collection user credentials terminal services-based connections interacting screensaver custom gina could made entirely scratch original gina modifications custom gina specified placing string named ginadll registry location codice_1 winlogon component solely responsible calling apis gina library winlogon process starts compares version number supported loaded gina library gina library higher version winlogon windows boot done gina library written given version winlogon expect certain set api calls provided winlogon support replaceable gina dlls introduced windows nt server 3.51 windows nt workstation 4.0 sp3 successive versions windows introduced additional functionality winlogon resulting additional functionality implemented replacement gina windows 2000 example introduced support displaying status messages including verbose messages turned group policy current state user e.g applying computer settings starting applications user context facilitates restarting windows explorer automatically crashes well starting task manager windows xp introduced support fast user switching remote desktop interactive simplified user-friendly full-screen logon windows vista gina replaced credential providers allow significantly increased flexibility supporting multiple credential collection methods support use multiple gina models complex chaining method used required custom ginas often work fast user switching gina libraries work windows vista later windows versions one difference however gina could completely replace windows logon user interface credential providers | [
641,
3394,
8418,
6820,
10839,
5928,
5225,
4074,
2027,
8976,
5435,
9745,
3351,
10207,
5243,
10747,
9791
] | None |
7,208 | 5 | Rtelnet:rtelnet rtelnet socks client version telnet unix-like systems rtelnet utility provides similar functionality telnet hosts behind firewall normally firewalls designed permit deny network transmissions based upon set rules network accessibility across firewall reduced order provide adequate security hosts within firewall many services directly access resources placed outside firewall rtelnet utility provides functionality telnet maintaining security requirement firewall nat though utility differs much counterpart implementation behaves almost indistinguishably users terms command interface communication scheme rtelnet versatile client used connections inside hosts directly outside hosts via socks proxy servers rtelnet starts prints version number name ip address default socks proxy server stderr stream channel consults configuration file /etc/socks.conf determine whether request allowed denied based requesting user destination host requested service allowable requests configuration file also dictates whether direct proxy connection used given destination optionally actual socks servers use proxy connection rtelnet utility requires libsocket.so shared library run rtelnet listed project sourceforge code repository | [
10242,
3847,
649,
9868,
3218,
5397,
9365,
10005,
11413,
5402,
5531,
5405,
3742,
10271,
9380,
2085,
8998,
3751,
3752,
9381,
10924,
562,
2996,
9909,
10171,
4797,
5181,
3133,
3006,
5437,
7364,
2887,
8265,
2509,
4687,
6993,
5843,
2904,
5469,
... | None |
7,209 | 2 | ArchiCAD:archicad archicad architectural bim cad software macintosh windows developed hungarian company graphisoft archicad offers computer aided solutions handling common aspects aesthetics engineering whole design process built environment — buildings interiors urban areas etc development archicad started 1982 original apple macintosh following launch 1987 graphisoft virtual building concept archicad became regarded first implementation bim archicad recognized first cad product personal computer able create 2d 3d geometry well first commercial bim product personal computers considered revolutionary ability store large amounts information within 3d model today 120,000 users archicad complete design suite 2d 3d drafting visualization building information modeling functions architects designers planners wide range software applications integrated archicad cover design needs architectural office archicad allows user work data-enhanced parametric objects often called smart objects users differs operational style cad programs created 1980s product allows user create virtual building virtual structural elements like walls slabs roofs doors windows furniture large variety pre-designed customizable objects come program archicad allows user work either 2d 3d representation screen two-dimensional drawings exported time even though model program database always stores data three dimensions plans elevations sections generated three-dimensional virtual building model constantly updated user 'rebuilds view detail drawings based enlarged portions model 2d detail added archicad released first file exchange based teamwork solution version 5.1 1997 allowed architects work building model simultaneously completely rewritten teamwork 2.0 solution new database approach came version 13 2009 named graphisoft bim server since changes differences sent central storage solution allows remote access project internet thus allowing worldwide project collaboration coordination 2014 introduction bimcloud better integration provided standard solutions browser-based management ldap connection http/https based communication also new scalability options available allowing multi-server layouts created optional caching servers third-party vendors manufacturers architectural products compiled libraries architectural components use archicad program includes geometric description language gdl used create new components also api application programming interface odbc database connections supported third party add-on developers via direct api links 4d 5d software vico office suite tocoman ilink archicad model exported bim-based cost estimation scheduling archicad also directly linked via api solibri model checking quality assurance tools addition graphisoft provides direct link grasshopper 3d enabling visual programming environment parametric modelling design archicad import export dwg dxf ifc bcf files among others graphisoft active member buildingsmart formerly international alliance interoperability iai industry organization publishes standards file data interoperability built environment software graphisoft one founders open bim concept supports 3d bim data exchange different design disciplines open-source platforms archicad also export 3d model corresponding 2d drawings bimx format viewed number desktop mobile platforms native bimx viewers commercial educational fully functional 30-day trial versions installed installer long hardware protection present software activated trial educational serial number archicad launched demo mode installer files downloaded without registration educational trial serial numbers obtained registration archicad available number localized versions addition translated user interface documentation versions set parametric objects object libraries developed considering specific requirements regional market different default values object properties menu arrangements etc various free commercial add-on products extensions add extra functionality archicad provide data exchange possibilities software applications extensions developed graphisoft freely available trimble sketchup google earth maxon cinema 4d import/export add-ons extensions sold separately graphisoft mep modeler graphisoft ecodesigner graphisoft virtual building explorer number add-ons provided third party vendors cigraph cadimage detailed version history see help center article | [
7205,
1065,
6797,
7983,
10525
] | Test |
7,210 | 4 | Malware_Information_Sharing_Platform:malware information sharing platform malware information sharing platform misp open source threat intelligence platform project develops utilities documentation effective threat intelligence sharing indicators compromise several organizations run misp instances listed website project started around june 2011 christophe vandeplas frustration way many indicators compromise iocs shared email pdf documents parseable automatic machines home started play around cakephp made proof concept idea called cydefsig cyber defence signatures mid july 2011 presented personal project work belgian defence feedback rather positive giving access cydefsig running personal server belgian defence started use cydefsig officially starting mid august 2011 christophe allowed spend time cydefsig work-hours still working home point nato heard project january 2012 first presentation done introduce depth project looked products marked offered seemed deemed openness cydefsig great advantage andrzej dereszowski first part-time developer nato side one thing led another months later nato hired full-time developer improve code add features collaborative development started date many personal projects license explicitly written yet collaboratively decided project would released publicly affero gpl license share code many people possible protect harm project renamed misp malware information sharing project name invented alex vandurme nato january 2013 andras iklody became main full-time developer misp day initially hired nato evening week-end contributor open source project meanwhile organisations started adopt software promoted around cert world cert-eu circl many others nowadays andras iklody lead developer misp project works circl misp project expanded misp covering malware indicators also fraud vulnerability information name misp threat sharing includes core misp software myriad tools pymisp format core format misp taxonomies warning-lists support misp misp community project lead team volunteers project funded european union connecting europe facility computer incident response center luxembourg indicators compromise managed misp may originate variety sources including internal incident investigation teams intelligence sharing partners commercial intelligence sources commercial sources integration misp include symantec deepsight intelligence kaspersky threat feeds mcafee active response misp integrations open-source commercial threat intelligence platforms include eclecticiq platform | [
8580,
8644,
2090,
9614,
756
] | None |
7,211 | 3 | Macintosh_IIsi:macintosh iisi macintosh iisi personal computer designed manufactured sold apple computer inc. october 1990 march 1993 introduced lower-cost alternative macintosh ii family desktop models popular home use offered expandability performance macintosh lc introduced time like lc built-in sound support well support color displays maximum screen resolution 640×480 eight-bit color iisi remained market two half years discontinued shortly introduction replacement centris 610 iisi case design compact three-box desktop unit used macintosh model one macintosh models true positioned macintosh iici apple entry-level professional model iisi price lowered redesign motherboard substituting different memory controller deletion one expansion card slots single processor direct slot removal level 2 cache slot shipped either 40-mb 80-mb internal hard disk 1.44-mb floppy disk drive mc 68882 fpu optional upgrade mounted special plug-in card ports included scsi two serial ports adb port floppy drive port 3.5mm stereo headphone sound output microphone sound input sockets bridge card available iisi convert processor direct slot standard internal nubus card slot compatible machines macintosh ii family bridge card included math co-processor improve floating-point performance nubus card mounted horizontally motherboard cut costs iisi video shared main system memory also effect slowing video considerably especially iisi 1 mb slow ram soldered motherboard david pogue book macworld macintosh secrets observed one could speed video considerably one set disk cache size large enough force computer draw video ram faster ram installed simm banks iisi also suffers sound difficulties time speaker contacts fail causing sound periodically drop problem caused modular construction computer mono loudspeaker daughterboard motherboard springy contacts speaker vibrations led fretting touching surfaces problem could solved removing motherboard using pencil eraser clean contacts daughterboard holding loudspeaker iisi macintosh use case design issues never corrected subsequent model iisi designed easily cheaply manufactured tools required put one together – everything held place clips latches heritage cut-down iici simple modification substitute new clock crystal increase system clock rate 25 mhz slight increase performance charles bukowski enthusiastic user iisi | [
7697,
4114,
6165,
11289,
7706,
8222,
1057,
6183,
1576,
4139,
8253,
576,
1090,
4180,
10838,
10840,
9312,
8806,
6258,
10357,
4220,
10365,
10878,
6783,
7299,
4741,
8842,
6283,
7824,
147,
7830,
6807,
4258,
7842,
7844,
7869,
8893,
8896,
4807,
... | Test |
7,212 | 4 | WebAuthn:webauthn webauthn web authentication web standard published world wide web consortium w3c webauthn core component fido2 project guidance fido alliance goal project standardize interface authenticating users web-based applications services using public-key cryptography client side support webauthn implemented variety ways underlying cryptographic operations performed authenticator abstract functional model mostly agnostic respect key material managed makes possible implement support webauthn purely software making use processor trusted execution environment trusted platform module tpm sensitive cryptographic operations also offloaded roaming hardware authenticator turn accessed via usb bluetooth low energy near-field communications nfc roaming hardware authenticator conforms fido client authenticator protocol ctap making webauthn effectively backward compatible fido universal 2nd factor u2f standard similar legacy u2f web authentication resilient verifier impersonation resistant active man-in-the-middle-attacks unlike u2f webauthn require traditional password moreover roaming hardware authenticator resistant malware since private key material time accessible software running host machine webauthn level 1 standard published w3c recommendation 4 march 2019 level 2 specification development fido2 successor fido universal 2nd factor u2f legacy protocol fido2 authentication advantages u2f—the primary difference fido2 authenticator also multi-factor authenticator fido2 authenticator may used either single-factor mode multi-factor mode single-factor mode authenticator activated test user presence usually consists simple button push multi-factor mode authenticator something performs user verification depending authenticator capabilities case authenticator performs user verification locally device secret biometric stored authenticator shared website moreover single secret biometric works websites authenticator select correct cryptographic key material use service requesting authentication user verification completed successfully secret biometric authenticator used together similarly would used smartphone example fingerprint used provide convenient access smartphone occasionally fingerprint access fails case pin used like predecessor fido u2f w3c web authentication webauthn involves website web browser authenticator webauthn specifies claimant demonstrates possession control fido2 authenticator verifier called webauthn relying party authentication process mediated entity called webauthn client little conforming web browser purposes illustration assume authenticator roaming hardware authenticator see options case authenticator multi-factor cryptographic authenticator uses public-key cryptography sign authentication assertion targeted webauthn relying party assuming authenticator uses pin user verification authenticator something pin something know initiate webauthn authentication flow webauthn relying party indicates intentions webauthn client i.e. browser via javascript webauthn client communicates authenticator using javascript api implemented browser roaming authenticator conforms fido client authenticator protocol webauthn strictly require roaming hardware authenticator alternatively software authenticator implemented smartphone e.g platform authenticator i.e. authenticator implemented directly webauthn client device may used relevant examples platform authenticators include windows hello android operating system illustrated flow relies pin-based user verification terms usability modest improvement ordinary password authentication practice use biometrics user verification improve usability webauthn logistics behind biometrics still poorly understood however lingering misunderstanding among users biometric data transmitted network manner passwords case webauthn relying party receives signed authentication assertion browser digital signature assertion verified using trusted public key user webauthn relying party obtain trusted public key first place obtain public key user webauthn relying party initiates webauthn registration flow similar authentication flow illustrated primary difference authenticator signs attestation statement attestation private key signed attestation statement contains copy public key webauthn relying party ultimately uses verify signed authentication assertion attestation statement also contains metadata describing authenticator digital signature attestation statement verified trusted attestation public key particular model authenticator webauthn relying party obtains store trusted attestation public keys unspecified one option use fido metadata service attestation type specified javascript determines trust model instance attestation type called self-attestation may desired trust model essentially trust first use webauthn level 1 standard published w3c recommendation web authentication working group 4 march 2019 webauthn supported following web browsers google chrome mozilla firefox microsoft edge apple safari preview webauthn also supported opera web browser desktop version google chrome supported webauthn since version 67 firefox fully supported previous fido u2f standard included enabled webauthn firefox version 60 released may 9 2018 early windows insider release microsoft edge build 17682 implemented version webauthn works windows hello well external security keys existing fido u2f security keys largely compatible webauthn standard though webauthn added ability reference unique per-account user handle identifier older authenticators unable store one first fido2-compatible authenticators second-generation security key yubico announced april 10 2018 first security level 2 certified fido2 key called goldengate announced one year later ewbm april 8 2019. dropbox announced support webauthn logins 2nd factor may 8 2018 webauthn implements extension w3c general credential management api attempt formalize interaction websites web browsers exchanging user credentials web authentication api extends credential management codice_1 codice_2 javascript methods accept codice_3 parameter codice_4 method used registering public key authenticators part associating user accounts possibly initial account creation time likely adding new security device existing account codice_5 method used authenticating logging check browser supports webauthn scripts check codice_6 interface defined addition codice_7 standard also defines codice_8 codice_9 codice_10 interfaces addition variety dictionaries datatypes api allow direct access manipulation private keys beyond requesting initial creation august 2018 paragon initiative enterprises security audit upcoming webauthn standard could find specific exploits revealed serious weaknesses way underlying cryptography used mandated standard main points criticism revolve around two potential issues problematic cryptographic systems past therefore avoided order fall victim class attacks paragon initiative enterprises also criticized way standard initially developed proposal made public advance experienced cryptographers asked suggestions feedback hence standard subject broad cryptographic research academic world despite shortcomings paragon initiative enterprises still encourage users continue use webauthn come recommendations potential implementors developers standard hope implemented standard finalized avoiding mistakes early possible would prevent industry challenges introduced broken standards need backwards compatibility ecdaa used combination device attestation particular feature webauthn necessarily required authentication work current implementations allow user decide whether attestation statement sent registration ceremony independently relying parties choose require attestation | [
7936,
3462,
1802,
10506,
9229,
4623,
11154,
1556,
1054,
5918,
10020,
10026,
6316,
10284,
177,
4658,
2485,
7354,
1083,
1468,
4797,
6975,
8644,
10566,
3271,
11466,
3920,
5078,
10071,
5593,
5849,
9690,
1501,
6366,
10207,
865,
8674,
4326,
7784,... | None |
7,213 | 3 | Compaq_Presario_V6000:compaq presario v6000 compaq presario v6000 series widescreen 15.4 nowiki /nowiki laptop computers manufactured hewlett packard includes v6000z series based amd processors mobile sempron dual core turion x2 v6000t based intel processors repeated reliability issues amd based v6000z laptops fan algorithm bios misconfigured causing overheating damage wireless cards motherboard late 2007 hp extended limited warranty cover defects however date limited 2 years purchase product computer shows faults 2-year period hewlett packard repair despite fault cause australia resulted action queensland office fair trading hewlett packard misrepresenting customers rights resulting agreed au 3 million settlement computer available following processors max screen resolution 1280x800 nvidia geforce go 6150 intel x3100 depending cpu family nvidia geforce go 7150m intel gma 950 memory expandable 3 gb memory built wireless lan receiver intel r pro/wireless 3945abg broadcom equipped 802.1g bluetooth powered hp software upgrade windows 7 ultimate 32-bit possible problems reported many hp pavilion dv9000 laptop computers well | [
1776,
6765
] | Validation |
7,214 | 5 | STUN:stun session traversal utilities nat stun standardized set methods including network protocol traversal network address translator nat gateways applications real-time voice video messaging interactive communications stun tool used protocols interactive connectivity establishment ice session initiation protocol sip webrtc provides tool hosts discover presence network address translator discover mapped usually public internet protocol ip address port number nat allocated application user datagram protocol udp flows remote hosts protocol requires assistance third-party network server stun server located opposing public side nat usually public internet originally stun acronym simple traversal user datagram protocol udp network address translators title changed specification updated set methods published rfc 5389 retaining acronym stun tool communications protocols detect traverse network address translators located path two endpoints communication implemented light-weight client-server protocol requiring simple query response components third-party server located common easily accessible network typically internet client side implemented user communications application voice internet protocol voip phone instant messaging client basic protocol operates essentially follows client typically operating inside private network sends binding request stun server public internet stun server responds success response contains ip address port number client observed server perspective result obfuscated exclusive xor mapping avoid translation packet content application layer gateways algs perform deep packet inspection attempt perform alternate nat traversal methods stun messages sent user datagram protocol udp packets since udp provide reliable transport guarantees reliability achieved application-controlled retransmissions stun requests stun servers implement reliability mechanism responses reliability mandatory transmission control protocol tcp may used induces extra networking overhead security-sensitive applications stun may transported encrypted transport layer security tls application may automatically determine suitable stun server communications particular peer querying domain name system dns stun udp stuns tcp/tls server srv resource record e.g. _stun._udp.example.com standard listening port number stun server 3478 udp tcp 5349 tls alternatively tls may also run tcp port server implementation de-multiplex tls stun packets case stun server found using dns lookups standard recommends destination domain name queried address records aaaa would used default port numbers addition using protocol encryption tls stun also built-in authentication message-integrity mechanisms via specialized stun packet types client evaluated external address use candidate communicating peers sharing external nat address rather private address reachable peers public network communicating peers located different private networks behind nat peers must coordinate determine best communication path nat behavior may restrict peer connectivity even public binding known interactive connectivity establishment ice protocol provides structured mechanism determine optimal communication path two peers session initiation protocol sip extensions defined enable use ice setting call two hosts network address translation implemented via number different address port mapping schemes none standardized stun self-contained nat traversal solution applicable nat deployment scenarios work correctly tool among methods tool protocols dealing nat traversal notably traversal using relay nat turn interactive connectivity establishment ice stun work three types nat full cone nat restricted cone nat port restricted cone nat cases restricted cone port restricted cone nats client must send packet endpoint nat allow packets endpoint client stun work symmetric nat also known bi-directional nat often found networks large companies since ip address stun server different endpoint symmetric nat case nat mapping different stun server endpoint turn offers better results symmetric nat original specification stun rfc 3489 specified algorithm characterize nat behavior according address port mapping behavior algorithm reliably successful applicable subset nat devices deployed algorithm consists series tests performed application path diagram ends red box udp communication possible path ends yellow green box communication possible methods rfc 3489 proved unreliable cope plethora different nat implementations application scenarios encountered production networks stun protocol method updated rfc 5389 retaining many original specifications subset methods removing others | [
10242,
3847,
649,
9868,
6541,
3218,
9365,
10005,
11413,
5402,
5531,
5659,
3742,
10271,
9380,
2085,
9381,
3751,
3752,
2985,
6951,
10924,
2093,
10417,
562,
7859,
2996,
9909,
3770,
10171,
3133,
3006,
4797,
5181,
5437,
8386,
7364,
581,
2887,
... | Test |
7,215 | 3 | Jazz_(computer):jazz computer jazz computer architecture motherboard chipset design originally developed microsoft use developing windows nt design eventually used basis mips-based windows nt systems part microsoft intended nt portable various microprocessor architectures mips risc architecture chosen one first development platforms nt project late 1980s/early 1990s however around 1990 existing mips-based systems turbochannel-equipped decstation sgi indigo varied drastically standard intel personal computers ibm at—for example neither used isa bus common intel 386-class machines reasons microsoft decided design mips-based hardware platform develop nt resulted jazz architecture later microsoft sold architecture design mips computer systems inc. became mips magnum jazz architecture includes design simple enough powerful enough majority windows nt-capable mips systems based modified versions jazz architecture list systems less based jazz includes jazz systems designed partially comply advanced risc computing arc standard used arc firmware boot windows nt operating systems also ported various jazz implementations risc/os mips magnum also mips systems designed run windows nt comply arc standard nevertheless based jazz platform | [
4356,
11524,
780,
6797,
782,
1935,
8976,
7442,
2452,
10900,
408,
11549,
6942,
7970,
1832,
6827,
3890,
11058,
8757,
5686,
4289,
7234,
10051,
6854,
9033,
10957,
4051,
11221,
11605,
6879,
11103,
10338,
617,
3818,
8681,
6252,
5873,
3445,
5368,
... | None |
7,216 | 8 | Web_data_services:web data services web data services refers service-oriented architecture soa applied data sourced world wide web internet whole web data services enable maximal mashup reuse sharing structured data relational tables semi-structured information extensible markup language xml documents unstructured information rss feeds content web applications commercial data online business sources web data services environment applications may subscribe consume information provide publish information others consume applications serve consumer-subscriber and/or provider-publisher web data services include mobile computing web portals enterprise portals online business software social media social networks web data services may support business-to-consumer b2c business-to-business b2b information-sharing requirements increasingly enterprises including web data services soa implementations integrate mashup-style user-driven information sharing business intelligence business process management predictive analytics content management applications according industry analysts speed development web data services enterprises deploy technologies ease discovery extraction movement transformation cleansing normalization joining consolidation access presentation disparate information types diverse internal sources data warehouses customer relationship management crm systems external sources commercial market data aggregators web data services build industry-standard protocols interfaces formats integration patterns used soa web 2.0 web-oriented architecture representational state transfer rest addition operating public internet web data services may run solely within corporate intranets across b2b supply chains even span hosted software-as-a-service saas cloud computing environments | [
4194,
4107,
119
] | Test |
7,217 | 2 | VM_(operating_system):vm operating system vm often vm/cms family ibm virtual machine operating systems used ibm mainframes system/370 system/390 zseries system z compatible systems including hercules emulator personal computers first version released 1972 vm/370 officially virtual machine facility/370 system/370 reimplementation earlier cp/cms operating system milestone versions included vm/sp current version z/vm still widely used one main full virtualization solutions mainframe market cms usually coupled vm name refers conversational monitor system single-user operating system developed provide conversational time-sharing vm heart vm architecture control program hypervisor called vm-cp usually cp sometimes ambiguously vm runs physical hardware creates virtual machine environment vm-cp provides full virtualization physical machine – including i/o privileged operations performs system resource-sharing including device management dispatching virtual storage management traditional operating system tasks vm user provided separate virtual machine address space virtual devices etc. capable running software could run stand-alone machine given vm mainframe typically runs hundreds thousands virtual machine instances vm-cp began life cp-370 reimplementation cp-67 reimplementation cp-40 running within virtual machine another guest operating system might one time cms capable running bare machine true operating system though configuration would unusual runs guest os vm cms relies hypervisor interface vm-cp perform file system operations request vm services paravirtualization interface ibm coined term hypervisor 360/65 later used diag handler cp-67 diagnose instruction '83 x—no mnemonic privileged instruction originally intended ibm perform built-in diagnostic functions model-dependent functions vm/370 repurposed communication virtual machine cp instruction contains two four-bit register numbers called rx ry contain operand storage addresses return codes passed diagnose interface two-byte code cp uses determine diagnose function perform available diagnose functions listed early history vm described articles cp/cms history cp/cms vm/370 reimplementation cp/cms made available 1972 part ibm system/370 advanced function announcement added virtual memory hardware operating systems system/370 series early releases vm vm/370 release 6 continued open source today considered public domain policy ended late 1970s chargeable vm/se vm/bse upgrades 1980 vm/system product vm/sp however ibm continued providing updates source form existing code many years cp-67 privileged instructions virtual machine cause program interrupt cp simulated behavior privileged instruction vm remained important platform within ibm used operating system development time-sharing use customers remained ibm operating system os dos families remained ibm strategic products customers encouraged run vm formed close working relationships continuing community-support model early cp/cms users meantime system struggled political infighting within ibm resources available project compared ibm efforts basic problem system seen ibm field sales level vm/cms demonstrably reduced amount hardware needed support given number time-sharing users ibm business selling computer systems melinda varian provides fascinating quote illustrating vm unexpected success marketing forecasts vm/370 predicted one 168 would ever run vm entire life product fact first 168 delivered customer ran cp cms ten years later ten percent large processors shipped poughkeepsie would destined run vm would substantial portion mid-range machines built endicott fifteen years passed would vm licenses mvs licenses pc dos version runs xt/370 later at/370 called vm/pc vm/pc 1.1 based vm/sp release 3 ibm introduced system/370 extended architecture 3081 customers faced need run production mvs/370 system testing mvs/xa machine ibm solution vm/xa migration aid used new start interpretive execution sie instruction run virtual machine sie automatically handled privileged instructions returned cp cases could n't handle processor resource/system manager pr/sm later 3090 also used sie several vm/xa products eventually supplanted vm/esa z/vm vm role changed within ibm hardware evolution led significant changes processor architecture backward compatibility remained cornerstone ibm mainframe family still uses basic instruction set introduced original system/360 need efficient use 64-bit zseries made vm approach much attractive vm also utilized data centers converting dos/vse mvs useful running mainframe aix linux platforms become increasingly important current z/vm platform finally achieved recognition within ibm vm users long felt deserved z/vm sites run thousands simultaneous virtual machine users single system z/vm first released october 2000 remains active use development ibm third parties offered many applications tools run vm examples include ramis focus spss nomad db2 rexx racf officevision current vm offerings run gamut mainframe applications including http servers database managers analysis tools engineering packages financial systems release 6 vm/370 control program number commands general users concerned defining controlling user virtual machine lower-case portions command optional early 1980s vm group within share ibm user group sought mascot logo community adopt part response ibm mvs users selecting turkey mascot hilariously chosen according legend mvs performance group early days mvs performance sore topic 1983 teddy bear became vm de facto mascot share 60 teddy bear stickers attached nametags cuddlier oldtimers flag newcomers friendly approached bears hit soon appeared widely bears awarded inductees order knights vm individuals made useful contributions community | [
2560,
6148,
7,
6155,
6675,
7187,
8213,
10776,
25,
4637,
9762,
4643,
6180,
5158,
553,
5678,
10803,
7733,
9784,
10809,
573,
576,
2625,
3148,
6221,
3160,
10333,
97,
11363,
9829,
6248,
6760,
8298,
9835,
10856,
6772,
7285,
4727,
2168,
9335,
... | Validation |
7,218 | 3 | Simultaneous_multithreading:simultaneous multithreading simultaneous multithreading smt technique improving overall efficiency superscalar cpus hardware multithreading smt permits multiple independent threads execution better utilize resources provided modern processor architectures name multithreading ambiguous multiple threads executed simultaneously one cpu core also multiple tasks different page tables different task state segments different protection rings different i/o permissions etc. although running core completely separated multithreading similar concept preemptive multitasking implemented thread level execution modern superscalar processors simultaneous multithreading smt one two main implementations multithreading form temporal multithreading also known super-threading temporal multithreading one thread instructions execute given pipeline stage time simultaneous multithreading instructions one thread executed given pipeline stage time done without great changes basic processor architecture main additions needed ability fetch instructions multiple threads cycle larger register file hold data multiple threads number concurrent threads decided chip designers two concurrent threads per cpu core common processors support eight concurrent threads per core really efficiency technique inevitably increases conflict shared resources measuring agreeing effectiveness difficult however measured energy efficiency smt parallel native managed workloads historical 130 nm 32 nm intel smt hyper-threading implementations found 45 nm 32 nm implementations smt extremely energy efficient even inorder atom processors modern systems smt effectively exploits concurrency little additional dynamic power even performance gains minimal power consumption savings considerable researchers shown extra threads used proactively seed shared resource like cache improve performance another single thread claim shows smt increase efficiency others use smt provide redundant computation level error detection recovery however current cases smt hiding memory latency increasing efficiency increasing throughput computations per amount hardware used processor design two ways increase on-chip parallelism fewer resource requirements one superscalar technique tries exploit instruction level parallelism ilp multithreading approach exploiting thread level parallelism tlp superscalar means executing multiple instructions time thread-level parallelism tlp executes instructions multiple threads within one processor chip time many ways support one thread within chip namely key factor distinguish look many instructions processor issue one cycle many threads instructions come example sun microsystems ultrasparc t1 known niagara november 14 2005 release multicore processor combined fine-grain multithreading technique instead simultaneous multithreading core issue one instruction time multithreading cpus around since 1950s simultaneous multithreading first researched ibm 1968 part acs-360 project first major commercial microprocessor developed smt alpha 21464 ev8 microprocessor developed dec coordination dean tullsen university california san diego susan eggers henry levy university washington microprocessor never released since alpha line microprocessors discontinued shortly hp acquired compaq turn acquired dec. dean tullsen work also used develop hyper-threading hyper-threading technology htt versions intel pentium 4 microprocessors northwood prescott intel pentium 4 first modern desktop processor implement simultaneous multithreading starting 3.06 ghz model released 2002 since introduced number processors intel calls functionality hyper-threading provides basic two-thread smt engine intel claims 30 speed improvement compared otherwise identical non-smt pentium 4 performance improvement seen application-dependent however running two programs require full attention processor actually seem like one programs slows slightly hyper-threading turned due replay system pentium 4 tying valuable execution resources increasing contention resources bandwidth caches tlbs re-order buffer entries equalizing processor resources two programs adds varying amount execution time pentium 4 prescott core gained replay queue reduces execution time needed replay system enough completely overcome performance hit latest imagination technologies mips architecture designs include smt system known mips mt mips mt provides heavyweight virtual processing elements lighter-weight hardware microthreads rmi cupertino-based startup first mips vendor provide processor soc based eight cores runs four threads threads run fine-grain mode different thread executed cycle threads also assigned priorities imagination technologies mips cpus two smt threads per core ibm blue gene/q 4-way smt ibm power5 announced may 2004 comes either dual core dual-chip module dcm quad-core oct-core multi-chip module mcm core including two-thread smt engine ibm implementation sophisticated previous ones assign different priority various threads fine-grained smt engine turned dynamically better execute workloads smt processor would increase performance ibm second implementation generally available hardware multithreading 2010 ibm released systems based power7 processor eight cores four simultaneous intelligent threads switches threading mode one thread two threads four threads depending number process threads scheduled time optimizes use core minimum response time maximum throughput ibm power8 8 intelligent simultaneous threads per core smt8 ibm z13 two threads per core smt-2 although many people reported sun microsystems ultrasparc t1 known niagara 14 november 2005 release defunct processor codenamed rock originally announced 2005 many delays cancelled 2009 implementations sparc focused almost entirely exploiting smt cmp techniques niagara actually using smt sun refers combined approaches cmt overall concept throughput computing niagara eight cores core one pipeline actually uses fine-grained multithreading unlike smt instructions multiple threads share issue window cycle processor uses round robin policy issue instructions next active thread cycle makes similar barrel processor sun microsystems rock processor different complex cores one pipeline oracle corporation sparc t3 eight fine-grained threads per core sparc t4 sparc t5 sparc m5 m6 m7 eight fine-grained threads per core two executed simultaneously fujitsu sparc64 vi coarse-grained vertical multithreading vmt sparc vii newer 2-way smt intel itanium montecito used coarse-grained multithreading tukwila newer use 2-way smt dual-domain multithreading intel xeon phi 4-way smt time-multiplexed multithreading hardware based threads ca n't disabled unlike regular hyperthreading intel atom released 2008 first intel product feature 2-way smt marketed hyper-threading without supporting instruction reordering speculative execution register renaming intel reintroduced hyper-threading nehalem microarchitecture absence core microarchitecture amd bulldozer microarchitecture flexfpu shared l2 cache multithreaded integer cores module single threaded partial smt implementation amd zen microarchitecture 2-way smt visc architecture uses virtual software layer translation layer dispatch single thread instructions global front end splits instructions virtual hardware threadlets dispatched separate virtual cores virtual cores send available resources physical cores multiple virtual cores push threadlets reorder buffer single physical core split partial instructions data multiple threadlets execution ports time virtual core keeps track position relative output form multithreading increase single threaded performance allowing single thread use resources cpu allocation resources dynamic near-single cycle latency level 1-4 cycles depending change allocation depending individual application needs therefore two virtual cores competing resources appropriate algorithms place determine resources allocated depending design architecture processor simultaneous multithreading decrease performance shared resources bottlenecks performance critics argue considerable burden put software developers test whether simultaneous multithreading good bad application various situations insert extra logic turn decreases performance current operating systems lack convenient api calls purpose preventing processes different priority taking resources also security concern certain simultaneous multithreading implementations intel hyperthreading netburst based processors vulnerability possible one application steal cryptographic key another application running processor monitoring cache use also sophisticated machine learning exploits ht implementation explained black hat 2018 | [
3586,
7173,
9739,
2066,
7699,
11282,
5655,
10779,
10781,
6181,
8231,
6184,
3630,
9774,
6705,
2623,
2113,
7234,
3142,
2638,
6738,
9302,
2140,
1122,
4194,
8292,
10340,
3175,
5223,
8810,
4205,
8815,
630,
6774,
8822,
7802,
6268,
3197,
643,
73... | Test |
7,219 | 9 | AngelScript:angelscript angelscript game-oriented interpreted compiled scripting language angelscript features static typing object handles similar c++ pointers garbage collected via reference counting object-orientation single inheritance multiple inheritance interfaces allows operators registered overloaded angelscript used c++ ide netbeans geany eclipse also supported angeljuice ide developed specifically language c c++ functions called within angelscript environment angelscript class syntax closely follows c++ classes design proxy functions required embed angelscript c++ applications easing two languages integration several differences angelscript c++ angelscript used video game development including amy dustforce gekkeiju online king arthur gold overgrowth puddle rigs rods sine mora star ruler supertuxkart warsow sven co-op jazz jackrabbit 2 plus urho3d angelscript used university ulm interactive 3d-animation program angelscript also used robotics example program behavioral rules robotic agents | [
1952,
9345,
5612,
7983,
338,
5395,
9490,
9780,
7894,
11221,
2556
] | Train |
7,220 | 2 | Nokia_N79:nokia n79 nokia n79 symbian os v9.3 smartphone member nokia nseries multimedia smartphone family running s60 3rd edition feature pack 2 officially announced nokia 26 august 2008 n79 advanced device 5 megapixel camera dual led flash gps many improvements nokia n78 retailed 350 euros upon release october 2008 n79 somewhat vibrant style compared usual nseries devices rotated nokia logo would later appear nokia n97 nokia advertised n79 bold-coloured xpress-on covers change software colour theme cover also slim nseries standards considered attractive features include 2.4-inch display 369 mhz arm11 processor physical keylock switch fm transmitter navi wheel 14 january 2009 nokia announced would ship sports edition dubbed n79 active included bluetooth heart rate monitor armband new version nokia sports tracker application photos music maps navigation video | [
1537,
8577,
3205,
11655,
9359,
1424,
529,
2449,
659,
8083,
10770,
5143,
2072,
7063,
5274,
5019,
5659,
669,
8472,
11545,
4003,
4132,
6310,
167,
40,
3626,
5290,
10410,
9262,
10802,
821,
5175,
7866,
1083,
1728,
7617,
4291,
7877,
10053,
199,
... | Test |
7,221 | 4 | Call_screening:call screening call screening process evaluating characteristics telephone call deciding whether answer methods may include addition us canada call screen name calling feature offered telephone companies allows customer establish list numbers anyone calling customer numbers receive automatic message indicating call accepted another name usually used marketing purposes selective call rejection also devices telezapper screening telephone calls | [
11170
] | Validation |
7,222 | 4 | Wardriving:wardriving wardriving act searching wi-fi wireless networks person usually moving vehicle using laptop smartphone software wardriving freely available internet warbiking warcycling similar wardriving done moving bicycle motorcycle practice sometimes facilitated mounting wi-fi enabled device vehicle warwalking warjogging similar wardriving done foot rather moving vehicle warrailing wartraining similar wardriving done trains tram buses means public transport wardroning accomplished drone war driving originated wardialing method popularized character played matthew broderick film wargames named film war dialing consists dialing every phone number specific sequence search modems warbiking warcycling similar wardriving done moving bicycle motorcycle practice sometimes facilitated mounting wi-fi enabled device vehicle warwalking warjogging similar wardriving done foot rather moving vehicle disadvantages method slower speed travel leading discovery infrequently discovered networks absence convenient computing environment consequently handheld devices pocket computers perform tasks users walking standing dominated practice technology advances developments early 2000s expanded extent practice advances include computers integrated wi-fi rather compactflash cf pc card pcmcia add-in cards computers dell axim compaq ipaq toshiba pocket computers starting 2002 recently active nintendo ds sony psp enthusiast communities gained wi-fi abilities devices many newer smartphones integrate wi-fi global positioning system gps warrailing wartraining similar wardriving done train tram rather slower controllable vehicle disadvantages method higher speed travel resulting less discovery infrequently discovered networks often limited major roads higher traffic warkitting combination wardriving rootkitting warkitting attack hacker replaces firmware attacked router allows control traffic victim could even permit disable tls replacing html content downloaded warkitting identified tsow jakobsson yang wardrivers use wifi-equipped device together gps device record location wireless networks results uploaded websites like wigle openbmap geomena data processed form maps network neighborhood also clients available smartphones running android upload data directly better range sensitivity antennas built bought vary omnidirectional highly directional maps known network ids used geolocation system—an alternative gps—by triangulating current position signal strengths known network ids examples include place lab intel skyhook navizon cyril houri seekerlocate seeker wireless openbmap geomena navizon openbmap combines information wi-fi cell phone tower maps contributed users wi-fi-equipped cell phones addition location finding provides navigation information allows tracking position friends geotagging december 2004 class 100 undergraduates worked map city seattle washington several weeks found 5,225 access points 44 secured wep encryption 52 open 3 pay-for-access noticed trends frequency security networks depending location many open networks clearly intended used general public network names like open share porn please free access nice information collected high-resolution maps published online previous efforts mapped cities dublin portray wardriving questionable practice typically association piggybacking though technical viewpoint everything working designed many access points broadcast identifying data accessible anyone suitable receiver could compared making map neighborhood house numbers mail box labels may claim wardriving illegal laws specifically prohibit allow wardriving though many localities laws forbidding unauthorized access computer networks protecting personal privacy google created privacy storm countries eventually admitted systematically surreptitiously gathering wifi data capturing video footage mapping data street view service since using android-based mobile devices gather data passive listen-only wardriving programs like kismet kismac communicate networks merely logging broadcast addresses likened listening radio station happens broadcasting area forms dxing types software netstumbler wardriver actively sends probe messages access point responds per design legality active wardriving less certain since wardriver temporarily becomes associated network even though data transferred access points using default box security settings intended provide wireless access request war driver liability may reduced setting computer static ip instead using dhcp preventing network granting computer ip address logging connection united states case usually referenced determining whether network accessed state v. allen case allen wardialing attempt get free long distance calling southwestern bell computer systems presented password protection screen however attempt bypass court ruled although contacted approached computer system constitute access company network also homebrew wardriving applications handheld game consoles support wi-fi sniff jazzbox/wardive nintendo ds/android road dog sony psp wifi-where iphone g-mon wardrive wigle wifi android wlanpollution symbian nokias60 devices also exists mode within sony psp wherein player able find new comrades searching wireless access points used wardrive treasure world ds commercial game gameplay wholly revolves around wardriving | [
9732,
7449,
794,
11165,
9886,
9256,
5427,
6712,
1083,
61,
11198,
9791,
11341,
4435,
10329,
8922,
1625,
1758,
6375,
10346,
2430
] | Test |
7,223 | 5 | Transport_Sample_Protocol:transport sample protocol transport sample protocol tsp open source network protocol sampling data based tcp/ip allows synchronous asynchronous sample delivery implementations linux windows solaris osf1 vxworks c java released gnu lesser general public license lgpl tsp developed use satellite validation benches | [
3969,
546,
10851,
9320,
1101,
5677,
6797,
2864,
8909,
8147,
823,
10971,
2045
] | Validation |
7,224 | 2 | MNOS_(operating_system):mnos operating system mnos meaning mobilnaya operatsionnaya sistema мобильная операционная система мнос portable operating system unix-like operating system developed soviet union system derived version 6 unix consequently heavily modified incorporate many features bsd unix 1983 1986 enjoyed significant popularity ussr eastern bloc countries due light weight better performance version 7 unix later bsd unix-based alternatives development initiated ipk minavtoproma moscow 1981 development continued cooperation institutes including kurchatov institute mnos alternative demos version 1.x gradually merged 1986 1990 resulting joint os demos version 2.x mnos became first completely bilingual version unix used proprietary 8-bit cyrillic character set u-code later dropped favor koi-8 process merging demos origin version qualifier rl rabochaya loshadka working horsy | [
6787,
8713,
11145,
6412,
7823,
5267,
5397,
1304,
3487,
3488,
3241,
10156,
7983,
3248,
2995,
9141,
823,
9784,
3129,
1853,
9151,
10436,
4039,
6369,
9444,
4076,
5492,
2424,
633
] | Test |
7,225 | 6 | TiVo_Media_File_System:tivo media file system mfs media file system proprietary file system used tivo hard drives fault tolerant real-time recording live tv although mfs still particularly well understood programmers unaffiliated tivo corporation enough known file system able reads limited writes applications exist manipulate file system objects within applications reverse engineered software found tivo many early tivo programs little specialized scripts manipulated data mfs file system organized like database including transaction logging rollback capabilities utilizes multiple partitions drive complete system partitions come pairs one application partition media partition media region invariably quite large organized long continuous blocks data variable block size minimum least 1 megabyte designed store large sections video object tivo file system assigned id internally called fsid presumably file system id least 4 types objects mfs supports streams recordings audio video directory database files stream objects stored mfs media regions types stored application regions file system implemented entirely linux userspace primary reason tivo devised system needed way store large continuous sections data easily manner lent well streaming data directly media decoders tivo devices without cpu dependent thus cpu little involvement playback recording functionality simply directing encoder/decoder chips stream data directly drives via direct memory access mapping sections virtual memory onto drive main cpu orchestrates entire affair result data stored mfs media region formatted normal files direct data stream indexed database sections mfs application region | [
5120,
6669,
3598,
10257,
6677,
5142,
8214,
9762,
5158,
11323,
8772,
4708,
9836,
7789,
9333,
6263,
9335,
9343,
7818,
654,
2193,
2194,
2197,
2199,
11419,
6309,
1190,
5286,
10405,
7344,
2230,
5816,
1212,
8380,
10951,
9420,
3795,
4819,
8404,
... | Test |
7,226 | 1 | Common_Database_on_Designated_Areas:common database designated areas common database designated areas cdda data bank officially designated protected areas nature reserves protected landscapes national parks etc europe data bank went live 1999 community project european environment agency eea council europe united nations environment programme world conservation monitoring centre unep-wcmc data bank divided national area international area national area member states eu eea european environment information observation network eionet data cleansing national area non-eea members international area carried unep-wcmc systems data bank follows system international union conservation nature natural resources iucn standards united nations order ensure compatibility similar data banks worldwide especially world database protected areas wdpa data bank accessed internet using website european nature information system eunis date true marine protected areas marine protected areas atlantic arc maia included data bank pursued | [
2794
] | Test |
7,227 | 4 | United_States_v._Solon:united states v. solon united states v. solon 596 f.3d 1206 10th cir 2010 case nathaniel solon casper citizen convicted possession child pornography case became known media irregularities process suspicions affirmed defendant material introduced malware computer people accused similar crimes later acquitted solon never exonerated nathaniel solon charged january 18 2007 indictment possessing child pornography october 2 2007 pleaded guilty came back another hearing january 8 2008 however solon stated innocent man reason pleaded guilty first place believed financial resources hire expert witness investigate defense regard explanation court appointed private attorney represent court approval solon able request expert witness investigation budget 20,000 supplied court | [
7515,
7227
] | None |
7,228 | 4 | Penetration_test:penetration test penetration test colloquially known pen test pentest ethical hacking authorized simulated cyberattack computer system performed evaluate security system test performed identify weaknesses also referred vulnerabilities including potential unauthorized parties gain access system features data well strengths enabling full risk assessment completed process typically identifies target systems particular goal reviews available information undertakes various means attain goal penetration test target may white box provides background system information black box provides basic information except company name gray box penetration test combination two limited knowledge target shared auditor penetration test help determine whether system vulnerable attack defenses sufficient defenses test defeated security issues penetration test uncovers reported system owner penetration test reports may also assess potential impacts organization suggest countermeasures reduce risk national cyber security center describes penetration testing following method gaining assurance security system attempting breach system security using tools techniques adversary might goals penetration test vary depending type approved activity given engagement primary goal focused finding vulnerabilities could exploited nefarious actor informing client vulnerabilities along recommended mitigation strategies penetration tests component full security audit example payment card industry data security standard requires penetration testing regular schedule system changes flaw hypothesis methodology systems analysis penetration prediction technique list hypothesized flaws software system compiled analysis specifications documentation system list hypothesized flaws prioritized basis estimated probability flaw actually exists ease exploiting extent control compromise prioritized list used direct actual testing system mid 1960s growing popularity time-sharing computer systems made resources accessible communications lines created new security concerns scholars deborah russell g. t. gangemi sr. explain 1960s marked true beginning age computer security june 1965 example several country leading computer security experts held one first major conferences system security—hosted government contractor system development corporation sdc conference someone noted one sdc employee able easily undermine various system safeguards added sdc an/fsq-32 time-sharing computer system hopes system security study would useful attendees requested ... studies conducted areas breaking security protection time-shared system words conference participants initiated one first formal requests use computer penetration tool studying system security spring 1967 joint computer conference many leading computer specialists met discuss system security concerns conference computer security experts willis ware harold petersen rein tern rand corporation bernard peters national security agency nsa used phrase penetration describe attack computer system paper ware referred military remotely accessible time-sharing systems warning deliberate attempts penetrate computer systems must anticipated colleagues petersen turn shared concerns observing online communication systems ... vulnerable threats privacy including deliberate penetration bernard peters nsa made point insisting computer input output ... could provide large amounts information penetrating program conference computer penetration would become formally identified major threat online computer systems threat computer penetration posed next outlined major report organized united states department defense dod late 1967 essentially dod officials turned willis ware lead task force experts nsa cia dod academia industry formally assess security time-sharing computer systems relying many papers presented spring 1967 joint computer conference task force largely confirmed threat system security computer penetration posed ware report initially classified many country leading computer experts quickly identified study definitive document computer security jeffrey r. yost charles babbage institute recently described ware report ... far important thorough study technical operational issues regarding secure computing systems time period effect ware report reaffirmed major threat posed computer penetration new online time-sharing computer systems better understand system weaknesses federal government contractors soon began organizing teams penetrators known tiger teams use computer penetration test system security deborah russell g. t. gangemi sr. stated 1970s ... 'tiger teams first emerged computer scene tiger teams government industry-sponsored teams crackers attempted break defenses computer systems effort uncover eventually patch security holes leading scholar history computer security donald mackenzie similarly points rand done penetration studies experiments circumventing computer security controls early time-sharing systems behalf government jeffrey r. yost charles babbage institute work history computer security also acknowledges rand corporation sdc engaged first so-called 'penetration studies try infiltrate time-sharing systems order test vulnerability virtually early studies tiger teams successfully broke targeted computer systems country time-sharing systems poor defenses early tiger team actions efforts rand corporation demonstrated usefulness penetration tool assessing system security time one rand analyst noted tests ... demonstrated practicality system-penetration tool evaluating effectiveness adequacy implemented data security safeguards addition number rand analysts insisted penetration test exercises offered several benefits justified continued use noted one paper penetrator seems develop diabolical frame mind search operating system weaknesses incompleteness difficult emulate reasons others many analysts rand recommended continued study penetration techniques usefulness assessing system security perhaps leading computer penetration expert formative years james p. anderson worked nsa rand government agencies study system security early 1971 u.s. air force contracted anderson private company study security time-sharing system pentagon study anderson outlined number major factors involved computer penetration anderson described general attack sequence steps time anderson description general computer penetration steps helped guide many security experts relied technique assess time-sharing computer system security following years computer penetration tool security assessment became refined sophisticated early 1980s journalist william broad briefly summarized ongoing efforts tiger teams assess system security broad reported dod-sponsored report willis ware ... showed spies could actively penetrate computers steal copy electronic files subvert devices normally guard top-secret information study touched decade quiet activity elite groups computer scientists working government tried break sensitive computers succeeded every attempt various studies may suggested computer security u.s. remained major problem scholar edward hunt recently made broader point extensive study computer penetration security tool hunt suggests recent paper history penetration testing defense establishment ultimately ... created many tools used modern day cyberwarfare carefully defined researched many ways computer penetrators could hack targeted systems wide variety security assessment tools available assist penetration testing including free-of-charge free software commercial software several operating system distributions geared towards penetration testing distributions typically contain pre-packaged pre-configured set tools penetration tester hunt individual tool might increase risk complications—such compile errors dependency issues configuration errors also acquiring additional tools may practical tester context notable penetration testing os examples include many specialized operating systems facilitate penetration testing—each less dedicated specific field penetration testing number linux distributions include known os application vulnerabilities deployed targets practice systems help new security professionals try latest security tools lab environment examples include damn vulnerable linux dvl owasp web testing environment wtw metasploitable process penetration testing may simplified five phases attacker exploited one vulnerability may gain access machines process repeats i.e look new vulnerabilities attempt exploit process referred pivoting legal operations let tester execute illegal operation include unescaped sql commands unchanged hashed passwords source-visible projects human relationships old hashing cryptographic functions single flaw may enough enable critically serious exploit leveraging multiple known flaws shaping payload way appears valid operation almost always required metasploit provides ruby library common tasks maintains database known exploits budget time constraints fuzzing common technique discovers vulnerabilities aims get unhandled error random input tester uses random input access less often used code paths well-trodden code paths usually free errors errors useful either expose information http server crashes full info trace-backs—or directly usable buffer overflows imagine website 100 text input boxes vulnerable sql injections certain strings submitting random strings boxes hopefully hits bugged code path error shows broken html page half rendered sql error case text boxes treated input streams however software systems many possible input streams cookie session data uploaded file stream rpc channels memory errors happen input streams test goal first get unhandled error understand flaw based failed test case testers write automated tool test understanding flaw correct may become obvious package payload target system triggers execution viable one hope another error produced fuzzer yields fruit use fuzzer saves time checking adequate code paths exploits unlikely illegal operation payload metasploit terminology include functions logging keystrokes taking screenshots installing adware stealing credentials creating backdoors using shellcode altering data companies maintain large databases known exploits provide products automatically test target systems vulnerabilities general services administration gsa standardized penetration test service pre-vetted support service rapidly address potential vulnerabilities stop adversaries impact us federal state local governments services commonly referred highly adaptive cybersecurity services hacs listed us gsa advantage website effort identified key service providers technically reviewed vetted provide advanced penetration services gsa service intended improve rapid ordering deployment services reduce us government contract duplication protect support us infrastructure timely efficient manner 132-45a penetration testing security testing service assessors mimic real-world attacks identify methods circumventing security features application system network hacs penetration testing services typically strategically test effectiveness organization preventive detective security measures employed protect assets data part service certified ethical hackers typically conduct simulated attack system systems applications another target environment searching security weaknesses testing typically document vulnerabilities outline defenses effective defeated exploited also typically provide recommended remediation plans address weaknesses discovered uk penetration testing services standardized via professional bodies working collaboration national cyber security centre | [
5636,
6665,
8462,
3473,
3604,
1429,
4373,
1689,
5924,
7717,
10149,
3111,
3887,
3503,
11567,
2739,
7989,
823,
8119,
8637,
11198,
2430,
11075,
10437,
4552,
6473,
11213,
7887,
1232,
4689,
4945,
10196,
2262,
9815,
9688,
9049,
4956,
9693,
3552,
... | Test |
7,229 | 6 | Disk_encryption_theory:disk encryption theory disk encryption special case data rest protection storage medium sector-addressable device e.g. hard disk article presents cryptographic aspects problem discussion different software packages hardware devices devoted problem see disk encryption software disk encryption hardware disk encryption methods aim provide three distinct properties first property requires defining adversary data kept confidential strongest adversaries studied field disk encryption abilities method provides good confidentiality information adversary determine time whether data sector changed since last time looked second property requires dividing disk several sectors usually 512 bytes bits long encrypted decrypted independently turn data stay confidential encryption method must tweakable two sectors processed exactly way otherwise adversary could decrypt sector disk copying unused sector disk requesting decryption third property generally non-controversial however indirectly prohibits use stream ciphers since stream ciphers require security initial state used twice would case sector updated different data thus would require encryption method store separate initial states every sector disk—seemingly waste space alternative block cipher limited certain block size usually 128 256 bits disk encryption chiefly studies chaining modes expand encryption block length cover whole disk sector considerations already listed make several well-known chaining modes unsuitable ecb mode tweaked modes turn block ciphers stream ciphers ctr mode three properties provide assurance disk integrity n't tell whether adversary modifying ciphertext part absolute assurance disk integrity impossible matter adversary could always revert entire disk prior state circumventing checks non-absolute level disk integrity desired achieved within encrypted disk file-by-file basis using message authentication codes like encryption schemes block cipher-based disk encryption makes use modes operation allow encrypting larger amounts data ciphers block-size typically 128 bits modes therefore rules repeatedly apply ciphers single-block operations cipher-block chaining cbc common chaining mode previous block ciphertext xored current block plaintext encryption since n't previous block ciphertext first block initialization vector iv must used formula_2 turn makes cbc tweakable ways cbc suffers problems example ivs predictable adversary may leave watermark disk i.e. store specially created file combination files identifiable even encryption exact method constructing watermark depends exact function providing ivs general recipe create two encrypted sectors identical first blocks formula_3 formula_4 two related formula_5 thus encryption formula_6 identical encryption formula_7 leaving watermark disk exact pattern same-different-same-different disk altered make watermark unique given file protect watermarking attack cipher hash function used generate ivs key current sector number adversary predict ivs particular essiv approach uses block cipher ctr mode generate ivs essiv method generating initialization vectors block encryption use disk encryption usual methods generating ivs predictable sequences numbers based example time stamp sector number prevents certain attacks watermarking attack essiv prevents attacks generating ivs combination sector number sn hash key combination key form hash makes iv unpredictable essiv designed clemens fruhwirth integrated linux kernel since version 2.6.10 though similar scheme used generate ivs openbsd swap encryption since 2000 essiv supported option dm-crypt freeotfe disk encryption systems cbc without essiv ensures confidentiality ensure integrity encrypted data plaintext known adversary possible change every second plaintext block value chosen attacker blocks changed random values used practical attacks disk encryption cbc cbc-essiv mode order prevent elaborate attacks different modes operation introduced tweakable narrow-block encryption lrw xex wide-block encryption cmc eme whereas purpose usual block cipher formula_9 mimic random permutation secret key formula_10 purpose tweakable encryption formula_11is mimic random permutation secret key formula_10 known tweak formula_13 tweakable narrow-block encryption lrw instantiation mode operations introduced liskov rivest wagner see theorem 2 mode uses two keys formula_10 key block cipher formula_15 additional key size block example aes 256-bit key formula_10 256-bit number formula_15 128-bit number encrypting block formula_18 logical index tweak formula_19 uses following formula multiplication formula_21 addition formula_22 performed finite field formula_23 aes precomputation single multiplication per sector required note addition binary finite field simple bitwise addition also known xor formula_24 formula_25 precomputed possible values formula_26 mode operation needs single encryption per block protects attacks except minor leak user changes single plaintext block sector single ciphertext block changes note leak ecb mode lrw mode equal plaintexts different positions encrypted different ciphertexts security concerns exist lrw mode operation replaced xts lrw employed bestcrypt supported option dm-crypt freeotfe disk encryption systems another tweakable encryption mode xex xor–encrypt–xor designed rogaway allow efficient processing consecutive blocks respect cipher used within one data unit e.g. disk sector tweak represented combination sector address index block within sector original xex mode proposed rogaway allows several indices ciphertext formula_27 obtained using basic operations lrw mode aes cipher galois field multiplication ones used galois/counter mode gcm thus permitting compact implementation universal lrw/xex/gcm hardware ciphertext stealing provides support sectors size divisible block size example 520-byte sectors 16-byte blocks xts-aes standardized 2007-12-19 ieee p1619 standard supports using different key iv encryption block encryption contrary intent xex seems rooted misinterpretation original xex paper harm security result users wanting aes-256 aes-128 encryption must supply 512 bits 256 bits key respectively january 27 2010 nist released special publication sp 800-38e final form sp 800-38e recommendation xts-aes mode operation standardized ieee std 1619-2007 cryptographic modules publication approves xts-aes mode aes algorithm reference ieee std 1619-2007 subject one additional requirement limits maximum size encrypted data unit typically sector disk block formula_35 aes blocks according sp 800-38e absence authentication access control xts-aes provides protection approved confidentiality-only modes unauthorized manipulation encrypted data xts supported bestcrypt botan netbsd cgd dm-crypt freeotfe truecrypt veracrypt diskcryptor freebsd geli openbsd softraid disk encryption software openssl mac os x lion filevault 2 windows 10 bitlocker wolfcrypt xts mode susceptible data manipulation tampering applications must employ measures detect modifications data manipulation tampering concern ... since authentication tags ciphertext original modified attacker decrypted plaintext built-in mechanism detect alterations best done ensure alteration ciphertext completely randomize plaintext rely application uses transform include sufficient redundancy plaintext detect discard random plaintexts would require maintaining checksums data metadata disk done zfs btrfs however commonly used file systems ext4 ntfs metadata protected tampering detection data tampering non-existent mode susceptible traffic analysis replay randomization attacks sectors 16-byte blocks given sector rewritten attackers collect fine-grained 16 byte ciphertexts used analysis replay attacks 16-byte granularity would possible define sector-wide block ciphers unfortunately degraded performance see cmc eme protect even minor leak mentioned lrw unfortunately price twofold degradation performance block must encrypted twice many consider high cost since leak sector level unavoidable anyway cmc introduced halevi rogaway stands cbc–mask–cbc whole sector encrypted cbc mode formula_36 ciphertext masked xoring formula_37 re-encrypted cbc mode starting last block underlying block cipher strong pseudorandom permutation prp sector level scheme tweakable prp one problem order decrypt formula_38 one must sequentially pass data twice order solve problem halevi rogaway introduced parallelizable variant called eme ecb–mask–ecb works following way note unlike lrw cmc single key formula_10 cmc eme considered standardization siswg eme patented favored primary supported mode authenticated encryption scheme iapm provides encryption well authentication tag encryption component iapm mode completely describes lrw xex schemes hence xts without ciphertext stealing aspect described detail figures 8 5 us patent 6,963,976 | [
672,
8772,
9343,
2919,
5391,
5552,
2193,
434,
3315,
3572,
7794,
246,
3382,
5983,
6265,
7229,
6494,
895
] | None |
7,230 | 0 | Magnus_Sahlgren:magnus sahlgren magnus sahlgren born january 1 1973 swedish computational linguist guitarist magnus sahlgren known work random indexing applied distributional semantics published research projects swedish institute computer science later gavagai ab research company co-founded 2008 sahlgren dissertation word-space model awarded prize prominent scholarly achievement 2006 stockholm university faculty humanities sahlgren lead guitarist metal band lake tears name associated 2009 also played dismember 1998 2003 tiamat recording acclaimed wildhoney album 1994 helped band achieve technical proficiency helping songwriting solos session artist 2004 accepted full-time member lake tears since influences even visible notably album moons mushrooms performs solos every track | [
1890,
9935
] | None |
7,231 | 4 | Validation_authority:validation authority public key infrastructure validation authority va entity provides service used verify validity digital certificate per mechanisms described x.509 standard page 69 dominant method used purpose host certificate revocation list download via http ldap protocols reduce amount network traffic required certificate validation ocsp protocol may used instead validation authority capable responding network-based request crl lacks ability issue revoke certificates must continuously updated current crl information certificate authority issued certificates contained within crl potentially labor-intensive process use dedicated validation authority allows dynamic validation certificates issued offline root certificate authority root ca unavailable network traffic certificates issued always verified via validation authority protocols mentioned ongoing administrative overhead maintaining crls hosted validation authority typically minimal uncommon root cas issue revoke large numbers certificates | [
513,
517,
1288,
1836,
10831,
9744,
8859,
6651,
4380,
4797
] | Test |
7,232 | 7 | Freifunk:freifunk freifunk german free radio non-commercial open grassroots initiative support free computer networks german region freifunk part international movement wireless community network initiative counts 400 local communities 41,000 access points among münster aachen munich stuttgart paderborn biggest communities 1000 access points main goals freifunk build large scale free wireless wi-fi network decentralized owned run support local communication initiative based picopeering agreement agreement participants agree upon network free discrimination sense net neutrality similar grassroots initiatives austria switzerland funkfeuer openwireless like many free community-driven networks freifunk uses mesh technology bring ad hoc networks interconnecting multiple wireless lans wi-fi mobile ad hoc network routers connect using special routing software router fails software automatically calculates new route destination software freifunk firmware based openwrt free software several different implementations firmware depending hardware protocols local communities use first wi-fi ad hoc network done georgia usa 1999 demonstrated toh.it six-node implementation running associativity-based routing protocol linux kernel wavelan wifi abr patented protocol following experience freifunk work standard ietf protocols two common standard proposals olsr b.a.t.m.a.n development b.a.t.m.a.n driven freifunk activists volunteering basis one results berlon workshop october 2002 free wireless community networks berlin london picopeering agreement agreement rationales free networks describes transmission people data handled free network become core agreement community workshop participants also agreed upon regular meetings berlin build free wifi network ever since weekly meetings c-base hackerspace every wednesday time german language site freifunk.net started september 2003 freifunk activists founded non-profit association förderverein freie netzwerke e.v support free communication infrastructures following years initiative became quite successful germany also became easier install freifunk firmware off-the-shelf wireless routers yearly wireless community weekend taking place berlin c-base 2012 berlin freifunk community got lot media attention project called freifunk freedom fighter box project fights secondary liability secondary liability legal situation makes owners open non-encrypted wireless access points liable users internet connection outlined störerhaftung law owners thus forced pay copyright infringements third persons opened network public legal practice led fear uncertainty made many people close access points e.g cafés public locations freifunk freedom fighter box preconfigured access point sent data public network sweden vpn connection sweden countries secondary liability 2013 hamburg freifunk community set network 300 nodes using vpn tunnels netherlands many new freifunk communities emerged berlin community building backbone network based microwave transmission longer distances project funded local broadcasting corporation medienanstalt berlin-brandenburg still on-going germany | [
3016,
5978,
2829,
9098
] | Test |
7,233 | 1 | Apache_Kylin:apache kylin apache kylin open source distributed analytics engine designed provide sql interface multi-dimensional analysis olap hadoop alluxio supporting extremely large datasets originally developed ebay project apache software foundation kylin project started 2013 ebay r shanghai china oct 2014 kylin v0.6 open sourced github.com name kylinolap nov 2014 kylin joined apache software foundation incubator december 2015 apache kylin graduated top level project kyligence inc chinese company provides commercial support apache kylin consists primarily original developers open source code apache kylin built top apache hadoop apache hive apache hbase apache calcite apache spark technologies technologies powerful matured making kylin able support massive data load easily scale kylin following core components apache kylin adopted many companies olap platform production typical users includes ebay meituan xiaomi netease beike yahoo japan apache kylin roadmap kylin website | [
10377,
8460,
7567,
1296,
6161,
1047,
8217,
11161,
6555,
8860,
3877,
10661,
11303,
5677,
10413,
1327,
4919,
5047,
4538,
1851,
6074,
7485,
7742,
9789,
6338,
4419,
1222,
1991,
4294,
7750,
5066,
8139,
4944,
1363,
8408,
9179,
7261,
990,
8799,
... | Test |
7,234 | 3 | MIPS_architecture:mips architecture mips microprocessor without interlocked pipelined stages reduced instruction set computer risc instruction set architecture isa developed mips computer systems mips technologies based united states multiple versions mips including mips ii iii iv v well five releases mips32/64 32- 64-bit implementations respectively early mips architectures 32-bit 64-bit versions developed later april 2017 current version mips mips32/64 release 6 mips32/64 primarily differs mips i–v defining privileged kernel mode system control coprocessor addition user mode architecture computer architecture courses universities technical schools often study mips architecture architecture greatly influenced later risc architectures alpha april 2017 mips processors used embedded systems residential gateways routers originally mips designed general-purpose computing 1980s 1990s mips processors personal workstation server computers used many companies digital equipment corporation mips computer systems nec pyramid technology sicortex siemens nixdorf silicon graphics tandem computers historically video game consoles nintendo 64 sony playstation playstation 2 playstation portable used mips processors mips processors also used popular supercomputers 1990s systems dropped top500 list uses complemented embedded applications first 1990s mips became major presence embedded processor market 2000s mips processors applications mid- late-1990s estimated one three risc microprocessors produced mips processor mips modular architecture supporting four coprocessors cp0/1/2/3 mips terminology cp0 system control coprocessor essential part processor implementation-defined mips i–v cp1 optional floating-point unit fpu cp2/3 optional implementation-defined coprocessors mips iii removed cp3 reused opcodes purposes example playstation video game console cp2 geometry transformation engine gte accelerates processing geometry 3d computer graphics mips architecture several optional extensions mips-3d simple set floating-point simd instructions dedicated common 3d tasks mdmx madmax extensive integer simd instruction set using 64-bit floating-point registers mips16e adds compression instruction stream make programs take less room mips mt adds multithreading capability december 2018 wave computing new owner mips architecture see mips technologies announced mips isa open-sourced program dubbed mips open initiative program planned 2019 intended open access recent versions 32-bit 64-bit designs making available without licensing royalty fees well granting participants licenses existing mips patents first version mips architecture designed mips computer systems r2000 microprocessor first mips implementation mips r2000 introduced together 1985 mips ii introduced mips renamed mips distinguish new version mips load/store architecture also known register-register architecture except load/store instructions used access memory instructions operate registers mips thirty-two 32-bit general-purpose registers gpr register 0 hardwired zero writes discarded register 31 link register integer multiplication division instructions run asynchronously instructions pair 32-bit registers hi lo provided small set instructions copying data general-purpose registers hi/lo registers program counter 32 bits two low-order bits always contain zero since mips instructions 32 bits long aligned natural word boundaries instructions divided three types r j every instruction starts 6-bit opcode addition opcode r-type instructions specify three registers shift amount field function field i-type instructions specify two registers 16-bit immediate value j-type instructions follow opcode 26-bit jump target following three formats used core instruction set mips instructions load store 8-bit bytes 16-bit halfwords 32-bit words one addressing mode supported base displacement since mips 32-bit architecture loading quantities fewer 32 bits requires datum either signed- zero-extended 32 bits load instructions suffixed unsigned perform zero extension otherwise sign extension performed load instructions source base contents gpr rs write result another gpr rt store instructions source base contents gpr rs store data another gpr rt load store instructions compute memory address summing base sign-extended 16-bit immediate mips requires memory accesses aligned natural word boundaries otherwise exception signaled support efficient unaligned memory accesses load/store word instructions suffixed left right load instructions followed load delay slot instruction load delay slot use data loaded load instruction load delay slot filled instruction dependent load nop substituted instruction found mips instructions perform addition subtraction instructions source operands two gprs rs rt write result third gpr rd alternatively addition source one operands 16-bit immediate sign-extended 32 bits instructions addition subtraction two variants default exception signaled result overflows instructions unsigned suffix signal exception overflow check interprets result 32-bit two complement integer mips instructions perform bitwise logical xor instructions source operands two gprs write result third gpr xor instructions alternatively source one operands 16-bit immediate zero-extended 32 bits set relation instructions write one zero destination register specified relation true false instructions source operands two gprs one gpr 16-bit immediate sign-extended 32 bits write result third gpr default operands interpreted signed integers variants instructions suffixed unsigned interpret operands unsigned integers even source operand sign-extended 16-bit immediate load immediate upper instruction copies 16-bit immediate high-order 16 bits gpr used conjunction immediate instruction load 32-bit immediate register mips instructions perform left right logical shifts right arithmetic shifts operand obtained gpr rt result written another gpr rd shift distance obtained either gpr rs 5-bit shift amount sa field mips instructions signed unsigned integer multiplication division instructions source operands two gprs write results pair 32-bit registers called hi lo since may execute separately concurrently cpu instructions multiplication high- low-order halves 64-bit product written hi lo respectively division quotient written lo remainder hi access results pair instructions move hi move lo provided copy contents hi lo gpr instructions interlocked reads hi lo proceed past unfinished arithmetic instruction write hi lo another pair instructions move hi move lo copies contents gpr hi lo instructions used restore hi lo original state exception handling instructions read hi lo must separated two instructions write hi lo mips control flow instructions followed branch delay slot unless branch delay slot filled instruction performing useful work nop substituted mips branch instructions compare contents gpr rs zero another gpr rt signed integers branch specified condition true control transferred address computed shifting 16-bit offset left two bits sign-extending 18-bit result adding 32-bit sign-extended result sum program counter instruction address 8 jumps two versions absolute register-indirect absolute jumps jump jump link compute address control transferred shifting 26-bit instr_index left two bits concatenating 28-bit result four high-order bits address instruction branch delay slot register-indirect jumps transfer control instruction address sourced gpr rs address sourced gpr must word-aligned else exception signaled instruction branch delay slot executed branch jump instructions link except jump link register save return address gpr 31 jump link register instruction permits return address saved writable gpr mips two instructions software signal exception system call breakpoint system call used user mode software make kernel calls breakpoint used transfer control debugger via kernel exception handler instructions 20-bit code field contain operating environment-specific information exception handler mips 32 floating-point registers two registers paired double precision numbers odd numbered registers used arithmetic branching part double precision register pair resulting 16 usable registers instructions moves/copies loads/stores affected single precision denoted .s suffix double precision denoted .d suffix mips ii removed load delay slot added several sets instructions shared-memory multiprocessing synchronize shared memory load linked word store conditional word instructions added set trap-on-condition instructions added instructions caused exception evaluated condition true existing branch instructions given branch-likely versions executed instruction branch delay slot branch taken instructions improve performance certain cases allowing useful instructions fill branch delay slot doubleword load store instructions cop1–3 added consistent memory access instructions loads stores required doubleword naturally aligned instruction set floating point coprocessor also several instructions added ieee 754-compliant floating-point square root instruction added supported single- double-precision operands set instructions converted single- double-precision floating-point numbers 32-bit words added complemented existing conversion instructions allowing ieee rounding mode specified instruction instead floating point control status register mips computer systems r6000 microprocessor 1989 first mips ii implementation designed servers r6000 fabricated sold bipolar integrated technology commercial failure mid-1990s many new 32-bit mips processors embedded systems mips ii implementations introduction 64-bit mips iii architecture 1991 left mips ii newest 32-bit mips architecture mips32 introduced 1999.a mips iii backwards-compatible extension mips ii added support 64-bit memory addressing integer operations 64-bit data type called doubleword mips iii extended general-purpose registers hi/lo registers program counter 64 bits support new instructions added load store doublewords perform integer addition subtraction multiplication division shift operations move doubleword gprs hi/lo registers existing instructions originally defined operate 32-bit words redefined necessary sign-extend 32-bit results permit words doublewords treated identically instructions among instructions redefined load word mips iii sign-extends words 64 bits complement load word version zero-extends added r instruction format inability specify full shift distance 64-bit shifts 5-bit shift amount field narrow specify shift distance doublewords required mips iii provide three 64-bit versions mips shift instruction first version 64-bit version original shift instructions used specify constant shift distances 0–31 bits second version similar first adds 32 shift amount field value constant shift distances 32–64 bits specified third version obtains shift distance six low-order bits gpr mips iii added supervisor privilege level existing kernel user privilege levels feature affected implementation-defined system control processor coprocessor 0 mips iii removed coprocessor 3 cp3 support instructions reused opcodes new doubleword instructions remaining coprocessors gained instructions move doublewords coprocessor registers gprs floating general registers fgrs extended 64 bits requirement instructions use even-numbered register removed incompatible earlier versions architecture bit floating-point control/status register used operate mips iii floating-point unit fpu mips i- ii-compatible mode floating-point control registers extended compatibility new floating-point instructions added copy doublewords cpu fpu convert single- double-precision floating-point numbers doubleword integers vice versa mips computer systems r4000 microprocessor 1991 first mips iii implementation designed use personal workstation server computers mips computer systems aggressively promoted mips architecture r4000 establishing advanced computing environment ace consortium advance advanced risc computing arc standard aimed establish mips dominant personal computing platform arc found little success personal computers r4000 r4400 derivative widely used workstation server computers especially largest user silicon graphics uses r4000 included high-end embedded systems supercomputers mips iii eventually implemented number embedded microprocessors quantum effect design r4600 1993 derivatives widely used high-end embedded systems low-end workstations servers mips technologies r4200 1994 designed embedded systems laptop personal computers derivative r4300i fabricated nec electronics used nintendo 64 game console nintendo 64 along playstation among highest volume users mips architecture processors mid-1990s mips iv fourth version architecture superset mips iii compatible existing versions mips mips iv designed mainly improve floating-point fp performance improve access operands indexed addressing mode base index sourced gprs fp loads stores added prefetch instructions performing memory prefetching specifying cache hints supported base offset base index addressing modes mips iv added several features improve instruction-level parallelism alleviate bottleneck caused single condition bit seven condition code bits added floating-point control status register bringing total eight fp comparison branch instructions redefined could specify condition bit written read respectively delay slot fp branch read condition bit written prior fp comparison removed support partial predication added form conditional move instructions gprs fprs implementation could choose precise imprecise exceptions ieee 754 traps mips iv added several new fp arithmetic instructions single- double-precision fpns fused-multiply add subtract reciprocal reciprocal square-root fp fused-multiply add subtract instructions perform either one two roundings implementation-defined exceed meet ieee 754 accuracy requirements respectively fp reciprocal reciprocal square-root instructions comply ieee 754 accuracy requirements produce results differ required accuracy one two units last place implementation defined instructions serve applications instruction latency important accuracy first mips iv implementation mips technologies r8000 microprocessor chipset 1994 design r8000 began silicon graphics inc. used high-end workstations servers scientific technical applications high performance large floating-point workloads important later implementations mips technologies r10000 1996 quantum effect devices r5000 1996 rm7000 1998 r10000 fabricated sold nec electronics toshiba derivatives used nec pyramid technology silicon graphics inc. tandem computers among others workstations servers supercomputers r5000 r7000 found use high-end embedded systems personal computers low-end workstations servers derivative r5000 toshiba r5900 used sony computer entertainment emotion engine powered playstation 2 game console announced october 21 1996 microprocessor forum 1996 alongside mips digital media extensions mdmx extension mips v designed improve performance 3d graphics transformations mid-1990s major use non-embedded mips microprocessors graphics workstations sgi mips v completed integer-only mdmx extension provide complete system improving performance 3d graphics applications mips v implementations never introduced may 12 1997 sgi announced h1 beast h2 capitan microprocessors former first mips v implementation due introduced first half 1999 h1 h2 projects later combined eventually canceled 1998 mips v implementations mips64 release 1 1999 based mips v retains features optional coprocessor 1 fpu feature called paired-single mips v added new data type paired single ps consisted two single-precision 32-bit floating-point numbers stored existing 64-bit floating-point registers variants existing floating-point instructions arithmetic compare conditional move added operate data type simd fashion new instructions added loading rearranging converting ps data first instruction set exploit floating-point simd existing resources mips technologies spun-out silicon graphics 1998 refocused embedded market mips v successive version strict superset previous version property found problem architecture definition changed define 32-bit 64-bit architecture mips32 mips64 introduced 1999 mips32 based mips ii additional features mips iii mips iv mips v mips64 based mips v. nec toshiba sibyte later acquired broadcom obtained licenses mips64 soon announced philips lsi logic idt raza microelectronics inc. cavium loongson technology ingenic semiconductor since joined first release mips32 based mips ii added conditional moves prefetch instructions features r4000 r5000 families 64-bit processors first release mips64 adds mips32 mode run 32-bit code mul madd multiply-add instructions previously available implementations added mips32 mips64 specifications cache control instructions announced december 6 2012 release 4 skipped number four perceived unlucky many asian cultures mips32/mips64 release 6 2014 added following removed infrequently used instructions reorganized instruction encoding freeing space future expansions micromips32/64 architectures supersets mips32 mips64 architectures respectively designed replace mips16e ase disadvantage mips16e requires mode switch 16-bit instructions processed micromips adds versions most-frequently used 32-bit instructions encoded 16-bit instructions allows programs intermix 16- 32-bit instructions without switch modes micromips introduced alongside mips32/64 release 3 subsequent release mips32/64 corresponding micromips32/64 version processor may implement micromips32/64 micromips32/64 corresponding mips32/64 subset starting mips32/64 release 6 support mips16e ended micromips form code compression mips base mips32 mips64 architectures supplemented number optional architectural extensions collectively referred application-specific extensions ases ases provide features improve efficiency performance certain workloads digital signal processing enhancements microcontroller applications mcu ase application-specific extension developed extend interrupt controller support reduce interrupt latency enhance i/o peripheral control function typically required microcontroller system designs mips16 application-specific extension mips v designed lsi logic mips technologies announced october 21 1996 alongside first implementation lsi logic tinyrisc processor mips16 subsequently licensed nec electronics philips semiconductors toshiba among others implemented extension mips ii iii architectures mips16 decreases size application 40 using 16-bit instructions instead 32-bit instructions also improves power efficiency instruction cache hit rate equivalent performance base architecture supported hardware software development tools mips technologies providers mips16e improved version mips16 first supported mips32 mips64 release 1 mips16e2 improved version mips16 supported mips32 mips64 release 5 release 6 replaced micromips dsp ase optional extension mips32/mips64 release 2 newer instruction sets used accelerate large range media computations—particularly audio video dsp module comprises set instructions state integer pipeline requires minimal additional logic implement mips processor cores revision 2 ase introduced second half 2006 revision adds extra instructions original ase otherwise backwards-compatible unlike bulk mips architecture fairly irregular set operations many chosen particular relevance key algorithm main novel features vs original mips32 make use mips dsp ase may linux 2.6.12-rc5 starting 2005-05-31 adds support dsp ase note actually make use dsp ase toolchain support required gcc already support dsp dspr2 instruction set extensions designed accelerate multimedia hardware supported virtualization technology multi-threaded mips core support two vpes virtual processing elements share single pipeline well hardware resources however since vpe includes complete copy processor state seen software system vpe appears complete standalone processor smp linux operating system fine-grained thread processing applications vpe capable supporting nine tcs allocated across two vpes tcs share common execution unit program counter core register files handle thread software mips mt architecture also allows allocation processor cycles threads sets relative thread priorities optional quality service qos manager block enables two prioritization mechanisms determine flow information across bus first mechanism allows user prioritize one thread another second mechanism used allocate specified ratio cycles specific threads time combined use mechanisms allows effective allocation bandwidth set threads better control latencies real-time systems system-level determinism critical qos block facilitates improvement predictability system hardware designers advanced systems may replace standard qos block provided mips technologies one specifically tuned application single-threaded microprocessors today waste many cycles waiting access memory considerably limiting system performance use multi-threading masks effect memory latency increasing processor utilization one thread stalls additional threads instantly fed pipeline executed resulting significant gain application throughput users allocate dedicated processing bandwidth real-time tasks resulting guaranteed quality service qos mips ’ mt technology constantly monitors progress threads dynamically takes corrective actions meet exceed real-time requirements processor pipeline achieve 80-90 utilization switching threads data-dependent stalls cache misses leads improved mobile device user experience responsiveness greatly increased smartmips application-specific extension ase designed gemplus international mips technologies improve performance reduce memory consumption smart card software supported mips32 since smart cards require capabilities mips64 processors smart cards use smartmips open virtual platforms ovp includes freely available non-commercial use simulator ovpsim library models processors peripherals platforms apis enable users develop models models library open source written c include mips 4k 24k 34k 74k 1004k 1074k m14k microaptiv interaptiv proaptiv 32-bit cores mips 64-bit 5k range cores models created maintained imperas partnership mips technologies tested assigned mips-verified tm mark sample mips-based platforms include bare metal environments platforms booting unmodified linux binary images platforms–emulators available source binaries fast free non-commercial usage easy use ovpsim developed maintained imperas fast hundreds million instructions per second built handle multicore homogeneous heterogeneous architectures systems freely available mips32 simulator earlier versions simulated r2000/r3000 called spim use education edumips64 gpl graphical cross-platform mips64 cpu simulator written java/swing supports wide subset mips64 isa allows user graphically see happens pipeline assembly program run cpu mars another gui-based mips emulator designed use education specifically use hennessy computer organization design webmips browser-based mips simulator visual representation generic pipelined processor simulator quite useful register tracking step step execution advanced free emulators available gxemul formerly known mips64emul project qemu projects emulate various mips iii iv microprocessors addition entire computer systems use commercial simulators available especially embedded use mips processors example wind river simics mips 4kc 5kc pmc rm9000 qed rm7000 broadcom/netlogic ec4400 cavium octeon imperas mips32 mips64 cores vast systems r3000 r4000 coware mips4ke mips24k mips25kf mips34k wepsim browser-based simulator subset mips instructions micro-programmed simulator useful order learn cpu works microprogramming mips routines traps interruptions system calls etc | [
4098,
6151,
2066,
2071,
4124,
6180,
6181,
8231,
2088,
10284,
8237,
2094,
4144,
2105,
6207,
2113,
2124,
10316,
6243,
6245,
6247,
6250,
6252,
6253,
6256,
8315,
6268,
8322,
2179,
8327,
10375,
4235,
4237,
4238,
8352,
8355,
6311,
4269,
2224,
2... | Test |
7,235 | 3 | STM32:stm32 stm32 family 32-bit microcontroller integrated circuits stmicroelectronics stm32 chips grouped related series based around 32-bit arm processor core cortex-m33f cortex-m7f cortex-m4f cortex-m3 cortex-m0+ cortex-m0 internally microcontroller consists processor core static ram flash memory debugging interface various peripherals stm32 family microcontroller ics based 32-bit risc arm cortex-m33f cortex-m7f cortex-m4f cortex-m3 cortex-m0+ cortex-m0 cores stmicroelectronics licenses arm processor ip arm holdings arm core designs numerous configurable options st chooses individual configuration use design st attaches peripherals core converting design silicon die following tables summarize stm32 microcontroller families stm32 third arm family stmicroelectronics follows earlier str9 family based arm9e core str7 family based arm7tdmi core following history stm32 family evolved stm32 family consists ten series microcontrollers h7 f7 f4 f3 f2 f1 f0 l4 l1 l0 stm32 microcontroller series based upon either cortex-m7f cortex-m4f cortex-m3 cortex-m0+ cortex-m0 arm processor core cortex-m4f conceptually cortex-m3 plus dsp single-precision floating point instructions stm32 h7-series group stm32 microcontrollers based arm cortex-m7f core stm32 f7-series group stm32 microcontrollers based arm cortex-m7f core many f7 series pin-to-pin compatible stm32 f4-series core stm32 f4-series first group stm32 microcontrollers based arm cortex-m4f core f4-series also first stm32 series dsp floating point instructions f4 pin-to-pin compatible stm32 f2-series adds higher clock speed 64 kb ccm static ram full duplex i²s improved real-time clock faster adcs summary series stm32 f3-series second group stm32 microcontrollers based arm cortex-m4f core f3 almost pin-to-pin compatible stm32 f1-series summary series distinguishing feature series presence four fast 12-bit simultaneous sampling adcs multiplexer 30 channels four matched 8 mhz bandwidth op-amps pins exposed additionally internal pga programmable gain array network exposed pads allow range analog signal conditioning circuits like band-pass filters anti-alias filters charge amplifiers integrators/differentiators 'instrumentation high-gain differential inputs eliminates need external op-amps many applications built-in two-channel dac arbitrary waveform well hardware-generated waveform sine triangle noise etc capability analog devices completely independent partially internally connected meaning one nearly everything needed advanced measurement sensor interfacing system single chip four adcs simultaneously sampled making wide range precision analog control equipment possible also possible use hardware scheduler multiplexer array allowing good timing accuracy sampling 4 channels independent main processor thread sampling multiplexing trigger controlled variety sources including timers built-in comparators allowing irregular sampling intervals needed op-amps inputs feature 2-to-1 analog multiplexer allowing total eight analog channels pre-processed using op-amp op-amp outputs internally connected adcs stm32 f2-series stm32 microcontrollers based arm cortex-m3 core recent fastest cortex-m3 series f2 pin-to-pin compatible stm32 f4-series summary series stm32 f1-series first group stm32 microcontrollers based arm cortex-m3 core considered mainstream arm microcontrollers f1-series evolved time increasing cpu speed size internal memory variety peripherals five f1 lines connectivity stm32f105/107 performance stm32f103 usb access stm32f102 access stm32f101 value stm32f100 summary series stm32 f0-series first group arm cortex-m0 chips stm32 family summary series stm32 g0-series lower power alternative l0 series stm32 l5-series evolution stm32l-series ultra-low power microcontrollers stm32 l4-series evolution stm32l1-series ultra-low power microcontrollers example l4 mcu stm32l432kc ufqfpn32 package stm32 l1-series first group stm32 microcontrollers primary goal ultra-low power usage battery-powered applications summary series stm32 l0-series first group stm32 microcontrollers based arm cortex-m0+ core series targets low power applications summary series stm32 w-series arm chips primary feature targeting rf communication applications summary series stmicroelectronics provides selection stm32 microcontrollers ready used java programming language special series embeds required features execute java programs based existing stm32 f1 f2 f4 f0 l0 families two sets special part numbers enabled java production part numbers end letter j sample part numbers end letter u following arduino header-compatible boards stm32 microcontrollers nucleo boards see next section also arduino headers nucleo boards stmicroelectronics support mbed ide development additional onboard st-link/v2-1 host adapter chip supplies swd debugging virtual com port mass storage three nucleo board families supporting different microcontroller ic package footprint debugger embedded nucleo boards converted segger j-link debugger protocol following discovery evaluation boards sold stmicroelectronics provide quick easy way engineers evaluate microcontroller chips kits available various distributors less us 20 stmicroelectronics evaluation product licence agreement forbids use production system product offered sale board includes on-board st-link programming debugging via mini-b usb connector power board provided choice 5 v via usb cable external 5 v power supply used output power supplies 3 v 5 v current must less 100 discovery boards also include voltage regulator reset button user button multiple leds swd header top board rows header pins bottom open-source project created allow linux communicate st-link debugger chibios/rt free rtos ported run discovery boards. ref name= getting started stm32vl-discovery board chibios/rt getting started stm32vl-discovery board chibios/rt /ref ref name= getting started stm32l-discovery board chibios/rt getting started stm32l-discovery board chibios/rt /ref ref name= getting started stm32f4-discovery board chibios/rt getting started stm32f4-discovery board chibios/rt /ref following evaluation kits sold stmicroelectronics ready-to-use java development kits stm32 microcontrollers stm3220g-java starter kit combines evaluation version is2t microej® software development kit sdk stm32f2 series microcontroller evaluation board providing everything engineers need start projects microej provides extended features create simulate test deploy java applications embedded systems support graphical user interface gui development includes widget library design tools including storyboarding tools customizing fonts stm32 microcontrollers embed java part number ends j like stm32f205vgt6j following evaluation kits sold partners stmicroelectronics listed st website stm32 microcontrollers rom'ed bootloader supports loading binary image flash memory using one peripherals varies stm32 family since stm32 bootloaders support loading usart peripheral boards connect usart rs-232 usb-to-uart adapter ic thus universal method program stm32 microcontroller method requires target way enable/disable booting rom'ed bootloader i.e jumper switch button amount documentation arm chips daunting especially newcomers documentation microcontrollers past decades would easily inclusive single document chips evolved documentation grown total documentation especially hard grasp arm chips since consists documents ic manufacturer stmicroelectronics documents cpu core vendor arm holdings typical top-down documentation tree manufacturer website manufacturer marketing slides manufacturer datasheet exact physical chip manufacturer detailed reference manual describes common peripherals aspects physical chip family arm core generic user guide arm core technical reference manual arm architecture reference manual describes instruction set stmicroelectronics additional documents evaluation board user manuals application notes getting started guides software library documents errata see external links section links official stm32 arm documents stm32f051r8 br stm32xxwwyz | [
7170,
11395,
3467,
6797,
398,
6925,
8720,
6033,
1170,
10767,
11405,
7445,
666,
5786,
4508,
9371,
7326,
4773,
38,
9638,
682,
4139,
3629,
2862,
5677,
2224,
9391,
11054,
10419,
7604,
11314,
823,
11447,
9913,
2874,
8253,
5823,
6207,
8383,
723... | None |
7,236 | 2 | DirectX_Raytracing:directx raytracing directx raytracing dxr feature microsoft directx allows hardware real-time raytracing significant advancement computer graphics first seen consumer level gpus nvidia geforce 20 series announced 2018 dxr released part new version directx rather compatible extension directx 12 windows 10 october 2018 update includes public release directx raytracing dxr introduces 4 main elements directx 12 api | [
7111,
4178,
2277,
2943
] | None |
7,237 | 9 | MOO_(programming_language):moo programming language moo programming language relatively simple programming language used support moo server dynamically typed uses prototype-based object-oriented system syntax roughly derived ada school programming languages stephen white authored first moo server language 1990 using c. course year pavel curtis joined project releasing first version lambdamoo server lambdamoo run maintained entirely volunteer basis sourceforge project although last packaged release 2000 development still active project cvs white describes moo mishmash c-like operators ada-like control structures combined prototype-style single-inheritance language explicit exception handling control flow well traditional looping constructs verb property hierarchy provides default values prototype objects over-riding values lower hierarchy hierarchy objects maintained delegation object parent property resulting form single inheritance special security-related attributes objects verbs properties include ownership read write execute flags moo programs byte-code compiled implicit decompilation editing providing canonical form programs moo programs orthogonally persistent periodic checkpoints objects identified unique integer identifier unused program data eliminated automatic garbage collection implemented reference counting however moo objects garbage collected manually deleted owners superusers aka wizards process called 'recycling moo explicitly multi-user system programs verbs contributed number connected users distinction made 'driver runtime 'core programs written moo language vast majority functionality running moo handled 'in-core runtime supports multi-tasking using retribution based time slicing method verbs run exclusive access database explicit locking necessary maintain synchronization simple tcp/ip messaging telnet compatible used communicate client sockets identified 'player virtual reality representation system language supports weak references objects number properties verbs strings built-in functions retrieve lists properties verbs exist giving language runtime facilities reflection server also contains support wildcard verb matching code easily used handle multiple commands similar names functions available sequence types moo lists strings support random access well head tail operations similar available lisp operations lists strings non-destructive non-object datatypes immutable built-in functions libraries allow lists also used associative arrays ordered unordered sets moo basic set control structures for-in-list fancy feature classic hello world program written moo interesting example | [
2304,
9345,
10083,
8262,
7144,
11625,
7019,
428,
9871,
9490,
2045,
7646
] | Test |
7,238 | 6 | Wuala:wuala wuala secure online file storage file synchronization versioning backup service originally developed run caleido inc part lacie turn owned seagate technology service stores files data centres provided wuala multiple european countries france germany switzerland earlier version also supported distributed storage users machines however feature dropped 17 august 2015 wuala announced discontinuing service stored data would deleted 15 november 2015 wuala recommended rival cloud storage startup tresorit alternative remaining customers research development occurred swiss federal institute technology eth zürich 14 august 2008 19 september 2008 26 october 2008 16 december 2008 19 march 2009 5 january 2010 23 may 2011 28 september 2011 11 june 2014 31 october 2014 17 august 2015 registered user registered unregistered users receive streaming media user adds file wuala saves changes file served wuala user local copy file first encrypted chunked redundant fragments using reed-solomon error correction codes fragments uploaded data centers wuala offered free accounts 5 gb storage charge 11 june 2014 shifted paid-only service end 2014 longer support form free-only storage shifting entirely payment based usage model users joint products may start greater amounts storage limited period lacie external hard disk drive 10 gb one year lacie usb flash drive 4 gb two years additional storage may bought june 2014 referral system shut due new paid-only policy bought storage prices range 29 eur/year 20 gb 999 eur/year 1 tb pricing changed june 2014 storage plan starts 0.99 € per month 9 € per year 5 gb ends 159.90 € per month 1799 € per year 2 tb storage one distinguishing features wuala ability trade local disk storage space cloud storage longer available user interface offers features normally associated file manager additional features come integration registered user install java-based client application swt-gui web browser computer java installed computer without java running class loader prevented support following may limited according wuala faq software uses aes-256 encryption rsa-2048 key exchange signatures keys organized key management scheme called cryptree according faq wuala employs full client-side encryption files metadata – os x metadata supported – get encrypted uploaded encryption key stored one even lacie operates service decrypt stored files disadvantage wuala password recovery data processing needs done client example creating search index advantage significantly improved privacy since source code wuala released difficult ensure software states including proper client-side encryption also updates pushed automatically client machine facts mean users wuala safe possible backdoors code | [
2050,
10631,
4746,
8331,
6797,
4623,
5650,
10270,
3366,
7983,
10161,
823,
8640,
9281,
10185,
8283,
2267,
7139,
107,
5749
] | None |
7,239 | 8 | Scieno_Sitter:scieno sitter scieno sitter content-control software installed computer blocks certain websites critical scientology viewed software released church scientology 1998 church members using windows 95 term scieno sitter coined critics scientology assert program form internet censorship program started late summer 1998 scientologists mailed software cds told program would help members build web sites would link scientology main site however recipients program told also censorship program blocked critical sites viewed user computer sites deemed dangerous critics scientology referred program cult mind-control 21st century asserted stifles freedom speech one software developer stated though thought spam filters general good idea found disturbing huge number terms banned completely unrelated stated goals however vice president office special affairs branch scientology stated scientologists make personal choice whether use filtering software different spokesperson claimed members scientology asked software stating many parishioners want use internet asked filter protection elements sought twist pervert religion packaging cd mailed users specifically request filter states popular demand scientologists program developed prevent subjected 'entheta hate mail internet filter allows direct access sites rapidly without dev-t 'd vilifying material forgeries hate messages fashion attention remain focused dissemination setting people feet bridge total freedom order gain access software scientologists must first sign contract section 7 contract states members must agree use specific internet filter program csi provided allows freedom view sites dianetics scientology principals without threat accessing sites deemed using marks works unauthorized fashion deemed improper discreditable scientology religion program works preventing user accessing sites certain keywords scientology identified objectionable material viewing members use keywords functions way prevent members learning guarded scientology doctrine xenu ot iii material relating space opera scientology scripture keywords notable topics blocked program include names several notable critics scientology including robert vaughn young keith henson well several hundred frequent participants alt.religion.scientology newsgroup together terms like suppressive person lisa mcpherson screening process limited viewing web sites however also blocks users discussing forbidden keywords chat programs internet relay chat keywords mentioned certain individuals identified undesirable enter chat room user kicked discussion tory christman worked operative osa osa operatives removed program computer allow analyze critical material spread internet scientology time software removed christman encountered operation clambake web site online discussions operator andreas heldal-lund eventually led leaving scientology public announcement alt.religion.scientology december 1998 software discussed e network program investigative reports program showed web page operation clambake described software piece entitled church scientology—afraid real world censors net members bob minton quoted report stating scientologists given filtering software allow go internet want scientologists subjected critical information 2006 film bridge scientologist character diane wheat attempts find information internet google search word zeenu directed search word xenu operation clambake web site comes first search results wheat attempts view site message appears computer stating page requested identified containing racist/hate-oriented material scientology symbol displayed left-hand side warning box | [
5251,
2885,
8589
] | Test |
7,240 | 5 | MAC-Forced_Forwarding:mac-forced forwarding mac-forced forwarding macff used control unwanted broadcast traffic host-to-host communication achieved directing network traffic hosts located subnet different locations upstream gateway device provides security layer 2 since traffic able pass directly hosts macff suitable ethernet networks layer 2 bridging device known ethernet access node ean connects access routers clients macff configured eans macff described rfc 4562 mac-forced forwarding method subscriber separation ethernet access network allied telesis switches implement macff using dhcp snooping maintain database hosts appear switch port host tries access network switch port dhcp snooping checks host ’ ip address database ensure host valid macff uses dhcp snooping check whether host gateway access router macff uses form proxy arp reply arp requests giving router mac address forces host send traffic router even traffic destined host subnet source router receives traffic makes forwarding decisions based set forwarding rules typically qos policy set filters | [
7411,
3847,
5486,
71
] | Test |
7,241 | 3 | Configuration_Menu_Language:configuration menu language configuration menu language cml used linux kernel versions prior 2.5.45 configure values determine composition exact functionality kernel many possible variations kernel functionality exist customization possible instance specifications exact hardware run also tuned administrator preferences cml written raymond chen 1993 question-and-answer interface allowed systematic selection particular behaviors without editing multiple system files eric s. raymond wrote menu-driven module named cml2 replace officially rejected linus torvalds attributed rejection 2007 lkml.org post preference small incremental changes concern maintainer involved rewrite ca n't ... go thing expect merged said noting raymond left splash rejection linuxkernelconf replaced cml kernel version 2.5.45 remains use 4.0 kernel | [
6352,
2809,
8262,
823
] | Test |
7,242 | 2 | Workload_Manager:workload manager ibm mainframes workload manager wlm base component mvs/esa mainframe operating system successors including z/os controls access system resources work executing z/os based administrator-defined goals workload manager components also exist operating systems example ibm workload manager also software product aix operating system mainframe computer many different applications execute time expectations executing work consistent execution times predictable access databases z/os workload manager wlm component fulfills needs controlling work access system resources based external specifications system administrator system administrator classifies work service classes classification mechanism uses work attributes like transaction names user identifications program names specific applications known use addition system administrator defines goals importance levels service classes representing application work goals define performance expectations work goals expressed response times relative speed termed velocity discretionary specific requirement exists response time describes duration work requests entered system application signals wlm execution completed wlm interested assure average response time set work requests ends expected time percentage work requests fulfill expectations end user definition response time also requires applications communicate wlm possible relative speed measure – named execution velocity used describe end user expectation system measurement based system states continuously collected system states describe work request uses system resource must wait used work latter named delay state quotient using states productive states using delay states multiplied 100 execution velocity measurement require communication application wlm component also abstract response time goal finally system administrator assigns importance service class tell wlm service classes get preferred access system resources system load high allow work execute service classes goal definitions organized service policies together constructs reporting controlling saved service definition access wlm active service definition saved couple data set allows z/os systems parallel sysplex cluster access execute towards performance goals wlm closed control mechanism continuously collects data work system resources compares collected aggregated measurements user definitions service definition adjusts access work system resources user expectations achieved mechanism runs continuously pre-defined time intervals order compare collected data goal definitions performance index calculated performance index service class single number tells whether goal definition could met overachieved missed wlm modifies access service classes based achieved performance index importance uses collected data project possibility result change change executed forecast comes result beneficial work based defined customer expectations wlm uses data base ranging 20 seconds 20 minutes contain statistically relevant basis samples calculations also one decision interval change performed benefit one service class maintain controlled predictable system wlm controls access work system processors i/o units system storage starts stops processes work execution access system processors example controlled dispatch priority defines relative ranking units work want execute dispatch priority assigned units work classified service class already stated dispatch priority fixed simply derived importance service class changes based goal achievement system utilization demand work system processors similar mechanisms exist controlling system resources way z/os workload manager controlling access work system resources named goal oriented workload management contrast resource entitlement based workload management defines much static relationship work access system resources resource entitlement based workload management found larger unix operating systems example major difference workload management components operating systems close cooperation z/os workload manager major applications middleware subsystems executing z/os wlm offers interfaces allow subsystems tell wlm unit work starts ends system pass classification attributes used system administrator classify work system addition wlm offers interfaces allow load balancing components place work requests best suited system parallel sysplex cluster additional instrumentation exists helps database resource managers signal contention situations wlm wlm help delayed work promoting holder resource locks latches time z/os workload manager became central control component performance related aspects z/os operating system parallel sysplex cluster z/os workload manager components work together provide single image view executing applications cluster system z multiple virtual partitions z/os wlm allows interoperate lpar hypervisor influence weighting z/os partitions control amount cpu capacity consumed logical partitions | [
10212,
3720,
7983,
2168,
7836
] | None |
7,243 | 3 | HP_95LX:hp 95lx hp 95lx palmtop pc f1000a f1010a also known project jaguar hewlett packard first ms-dos-based pocket computer personal digital assistant introduced april 1991 collaboration lotus development corporation seen successor series larger portable pcs like hp 110 hp 110 plus hp 95lx nec v20 cpu intel 8088 clone running 5.37 mhz intel corporation system chip soc device considered completely pc-compatible quarter-cga mda resolution lcd screen ran microsoft ms-dos version 3.22 customized version lotus 1-2-3 release 2.2 built software read-only memory rom included calculator appointment calendar telecommunications program simple text editor also included cr 2032 lithium coin cell memory backup two aa main batteries run mass storage hp 95lx single pcmcia slot could hold static ram card cr 2025 back-up coin cell rs-232-compatible serial port provided well infrared port printing compatible models hewlett packard printers character mode display showed 16 lines 40 characters backlight ibm compatible pcs work hardware code page 437 hp 95lx text mode font hard-wired code page 850 instead lotus 1-2-3 internally used lotus international character set lics characters translated code page 850 display printing purposes successor models hp 95lx include hp 100lx hp palmtop fx hp 200lx hp 1000cx hp omnigo 700lx | [
2179,
5384,
3214,
10768,
9363,
1304,
1660,
8229,
7983,
5681,
6090,
9166,
2383,
3281,
2258,
11100,
1501,
1638,
6765,
1776,
5756
] | Test |
7,244 | 6 | Volume_(computing):volume computing computer data storage volume logical drive single accessible storage area single file system typically though necessarily resident single partition hard disk although volume might different physical disk drive still accessed operating system logical interface however volume differs partition volume thing partition example floppy disk might accessible volume even though contain partition floppy disks partitioned modern computer software also os recognize partition without recognizing volume associated os interpret filesystem stored situation occurs example windows nt-based oses encounter disks non-microsoft os partitions ext3 filesystem commonly used linux another example occurs intel world extended partition partitions contain filesystem directly instead logical drives aka volumes must created within also case netware volumes residing inside single partition short volumes exist logical os level partitions exist physical media specific level sometimes one-to-one correspondence guaranteed microsoft windows server 2008 onward term volume used superset includes partition well n't uncommon see volume packed single file examples include iso9660 disc images cd/dvd images commonly called isos installer volumes mac os x dmgs volumes files reside within another volume certainly partitions example concerns windows xp system two physical hard disks first hard disk two partitions second one first partition first hard disk contains operating system mount points left defaults example linux systems volumes usually handled logical volume manager enterprise volume management system manipulated using mount 8 nt-based versions microsoft windows volumes handled kernel managed using disk management mmc snap-in diskpart command line tool important note windows nt-based oses single root directory result windows assign least one path mounted volume take one two forms two examples file called track 1.mp3 stored root directory mounted volume could referred codice_2 codice_3 respectively order assign mount point volume path within another volume following criteria must met default windows assign drive letters drives follows legacy convention operating system startup drive still commonly assigned c however always case since personal computers longer include floppies optical disc removable drives typically still start letters b available manual assignment user administrative privileges assignment remembered os pc next time removable volume inserted long conflicts long removable drive reformatted another computer changes volume serial number long os reinstalled computer windows xp mount points may managed disk management snap-in microsoft management console conveniently accessed computer management administrative tools section control panel one drive letter refer single volume using subst command warning removing drive letters mount-points drive may break programs files may accessible known path example program installed \program files\some program may expect find data files \program files\some program\data logical disk previously called drive letter changed e program wo n't able find data \program files\some program\data since drive letter longer represents volume unix-like operating systems volumes boot volume mount-point somewhere within filesystem represented path logically directory tree stored volume grafted mountpoint convention mount-points often placed directory called '/mnt though '/media terms sometimes used use given path mount-point another volume empty directory sometimes called folder must exist unix-like operating systems use mount command manipulate mount points volumes example cd-rom drive containing text file called 'info.txt mounted '/mnt/iso9660 text file would accessible '/mnt/iso9660/info.txt files within volume generally moved place within volume manipulating filesystem without moving actual data however file moved outside volume data must relocated much expensive operation order better visualize concept one might consider example large library non-fiction work originally classified subject plants moved subject flora one need refile book whose position shelf would static rather one needs replace index card however move book another library adjusting index cards alone insufficient entire book must moved volume label name given specific volume filesystem fat filesystem volume label traditionally restricted 11 characters reflecting 8.3 restrictions divided name extension fields even long file name enabled stored entry within disk root directory special volume-label attribute bit set also copied 11-byte field within extended bios parameter block disk boot sector label always stored uppercase fat vfat filesystems contain special characters also disallowed regular filenames ntfs filesystem length volume label restricted 32 characters include lowercase characters even unicode label command used change label dos windows os/2 gui systems like windows explorer pressed volume highlighted right-click name bring context menu allows renamed either process renaming file changing label windows also change volume creation timestamp current date time fat filesystems ntfs partitions system volume information directory whose creation timestamp set windows creates partition first recognizes repartitioning creation new volume separate disk utility contrast label volume serial number generally unique normally changed user thus acts consistent reliable identifier volume changed disk removed another inserted disk formatting changes serial number relabeling vol command used command line display current label serial number volume | [
3841,
1801,
1291,
6797,
3598,
5391,
8976,
2193,
5397,
2199,
6297,
9762,
11171,
8485,
5158,
10405,
11568,
1844,
823,
8254,
2811,
3522,
8911,
5969,
5598,
5221,
10857,
6637,
8301,
9840,
2545,
3826,
3953,
3572,
6641,
7794,
9972,
9593,
1659,
6... | None |
7,245 | 9 | Three-address_code:three-address code computer science three-address code often abbreviated tac 3ac intermediate code used optimizing compilers aid implementation code-improving transformations tac instruction three operands typically combination assignment binary operator example codice_1 name derives use three operands statements even though instructions fewer operands may occur since three-address code used intermediate language within compilers operands likely concrete memory addresses processor registers rather symbolic addresses translated actual addresses register allocation also uncommon operand names numbered sequentially since three-address code typically generated compiler refinement three-address code a-normal form anf three-address code would broken several separate instructions instructions translate easily assembly language also easier detect common sub-expressions shortening code following example one calculation composed several smaller ones three-address code may conditional unconditional jumps methods accessing memory may also methods calling functions may reduce jumps way three-address code may useful control-flow analysis following c-like example loop stores squares numbers 0 9 | [
7940,
1769,
9391,
10703,
2620,
477
] | Train |
7,246 | 2 | S60_(software_platform):s60 software platform s60 platform formerly series 60 user interface software platform smartphones runs top symbian operating system created nokia based 'pearl user interface symbian ltd introduced comdex november 2001 first shipped nokia 7650 smartphone platform since seen 5 updated editions series 60 renamed s60 november 2005 2008 symbian foundation formed consolidate assets different symbian platforms s60 uiq moap making open source 2009 based code base s60 first iteration platform since creation symbian foundation launched s60 5th edition symbian^1 top symbian os 9.4 base subsequent iterations named symbian^2 japanese market symbian^3 s60 software multivendor standard smartphones supports application development java midp c++ python adobe flash api called avkon ui s60 consists suite libraries standard applications telephony personal information manager pim tools helix-based multimedia players intended power fully featured modern phones large colour screens commonly known smartphones originally distinguishing feature s60 phones allowed users install new applications purchase unlike standard desktop platform however built-in apps rarely upgraded vendor beyond bug fixes new features added phones developed rather public release certain buttons standardized menu key four way joystick d-pad left right soft keys clear key s60 mainly used nokia also licensed manufacturers including lenovo lg electronics panasonic samsung sendo siemens mobile sony ericsson solstice vertu sony ericsson notably main vendor using competing uiq symbian interface addition manufacturers community includes four major releases s60 series 60 2001 series 60 second edition 2002 s60 3rd edition 2005 s60 5th edition 2008 release updated version called feature pack sometimes known relay runs different symbian version many devices capable running s60 software platform symbian os devices ranging early nokia 7650 running s60 v0.9 symbian os v6.1 latest samsung i8910 omnia hd running s60 v5.0 symbian os v9.4 symbian^3 version revised platform v5.2 table lists devices carrying version s60 well symbian os version based note new devices since symbian^3 may capable upgrading later systems symbian anna symbian belle therefore may see device listed many systems symbian progressing period organisational change metamorph open source software platform project os symbian os originally provided user interface ui visual layer runs atop operating system implemented separately examples symbian uis moap series 60 series 80 series 90 uiq separation ui underlying os created flexibility confusion market place nokia purchase symbian brokered involvement ui developers major user interface layers pledged donated open source foundation independently symbian operating system new symbian foundation announced intent unify different symbian uis single ui based s60 platform announcements made march 2009 indicated would s60 5th edition feature pack 1 12 april 2011 nokia announced symbian anna software update symbian^3 release three new devices 500 x7 e6 announced symbian anna pre-installed symbian anna available software update symbian^3 based devices well significant updates come anna 24 august 2011 nokia announced symbian belle later renamed nokia belle software update symbian anna release three new devices 603 700 701 nokia 600 cancelled replaced nokia 603 announced symbian belle pre-installed symbian belle available software update symbian anna-based devices well significant updates came belle november 2011 nokia announced carla donna updates carla expected released late 2012 early 2013 feature new web browser new widgets new nfc capabilities dolby surround audio enhancement donna going dual-core processor exclusive planned released late 2013 early 2014 may 2012 nokia executive claimed carla donna cancelled nokia would instead release belle feature pack 2 later 2012 lacking many new features planned carla donna february 2011 nokia announced partnership microsoft adopt windows phone 7 nokia primary operating system leaving symbian development question nokia promised support symbian newer devices least 2016 new symbian devices released nokia 808 pureview 29 april 2011 nokia announce would transfer symbian activities accenture along 3,000 employees symbian belle symbian belle – facts features pictures | [
1537,
10754,
11271,
11277,
529,
3089,
10770,
5143,
2072,
5659,
6685,
4129,
4132,
9765,
40,
3626,
5677,
9262,
7727,
10802,
7220,
5175,
9784,
1083,
9292,
1615,
5201,
7253,
3162,
5211,
6748,
4701,
607,
1633,
2658,
6763,
109,
1136,
8316,
8829... | Train |
7,247 | 3 | Socket_AM4:socket am4 socket am4 microprocessor socket used amd central processing units cpus built zen including zen+ zen 2 excavator microarchitectures am4 launched september 2016 designed replace sockets am3+ fm2+ fs1b single platform 1331 pin slots first amd support ddr4-compatible memory well achieve unified compatibility high-end cpus previously using socket am3+ amd lower-end apus various sockets am4 socket specifies 4 holes fastening heatsink motherboard placed corners rectangle lateral length 54×90 mm previous sockets 48×96 mm heat sinks older sockets compatible however cooler manufacturers reported offering brackets allowing previously manufactured coolers work am4 coolers redesigned alternatively motherboard makers including am3 am4 cooler mounting holes allowing previous generation coolers used socket am4 currently base 6 chipset models processors socket designed systems chip soc traditional northbridge southbridge board processor motherboard chipset increase number pci express lanes connectivity options connectivity options include nvme sata usb 3.2 gen 2 | [
3586,
9475,
3588,
8452,
9092,
10375,
3464,
4872,
7058,
10260,
4246,
8090,
2719,
4767,
2463,
7712,
9122,
5541,
1322,
11183,
1329,
6705,
3892,
8629,
9400,
6978,
11331,
9157,
3783,
2764,
9551,
7122,
9427,
10715,
7132,
2525,
4451,
5859,
8035,
... | Validation |
7,248 | 7 | Amazon_Web_Services:amazon web services amazon web services aws subsidiary amazon provides on-demand cloud computing platforms individuals companies governments metered pay-as-you-go basis aggregate cloud computing web services provide set primitive abstract technical infrastructure distributed computing building blocks tools one services amazon elastic compute cloud allows users disposal virtual cluster computers available time internet aws version virtual computers emulate attributes real computer including hardware central processing units cpus graphics processing units gpus processing local/ram memory hard-disk/ssd storage choice operating systems networking pre-loaded application software web servers databases customer relationship management crm etc aws technology implemented server farms throughout world maintained amazon subsidiary fees based combination usage hardware/os/software/networking features chosen subscriber required availability redundancy security service options subscribers pay single virtual aws computer dedicated physical computer clusters either part subscription agreement amazon provides security subscribers system aws operates many global geographical regions including 6 north america 2017 aws comprised 90 165 2019 services spanning wide range including computing storage networking database analytics application services deployment management mobile developer tools tools internet things popular include amazon elastic compute cloud ec2 amazon simple storage service amazon s3 services exposed directly end users instead offer functionality apis developers use applications amazon web services offerings accessed http using rest architectural style soap protocol amazon markets aws subscribers way obtaining large scale computing capacity quickly cheaply building actual physical server farm services billed based usage service measures usage varying ways 2017 aws owns dominant 34 cloud iaas paas next three competitors microsoft google ibm 11 8 6 respectively according synergy group aws platform launched july 2002 early stages platform consisted disparate tools services late 2003 aws concept publicly reformulated chris pinkham benjamin black presented paper describing vision amazon retail computing infrastructure completely standardized completely automated would rely extensively web services services storage would draw internal work already underway near end paper mentioned possibility selling access virtual servers service proposing company could generate revenue new infrastructure investment november 2004 first aws service launched public usage simple queue service sqs thereafter pinkham lead developer christopher brown developed amazon ec2 service team cape town south africa amazon web services officially re-launched march 14 2006 combining three initial service offerings amazon s3 cloud storage sqs ec2 aws platform finally provided integrated suite core online services chris pinkham benjamin black proposed back 2003 service offered developers web sites client-side applications companies andy jassy aws founder vice president 2006 said time amazon s3 one first scalable elements aws helps free developers worrying going store data whether safe secure available need costs associated server maintenance whether enough storage available amazon s3 enables developers focus innovating data rather figuring store it. 2016 jassy promoted ceo division reflecting success aws annual compensation 2017 hit nearly 36 million support industry-wide training skills standardization aws began offering certification program computer engineers april 30 2013 highlight expertise cloud computing james hamilton aws engineer wrote retrospective article 2016 highlight ten-year history online service 2006 2016 early fan outspoken proponent technology joined aws engineering team 2008 january 2018 amazon launched autoscaling service aws november 2018 aws announced customized arm cores use servers also november 2018 aws developing ground stations communicate customer satellites november 2010 reported amazon.com retail sites migrated aws prior 2012 aws considered part amazon.com revenue delineated amazon financial statements year industry watchers first time estimated aws revenue 1.5 billion april 2015 amazon.com reported aws profitable sales 1.57 billion first quarter year 265 million operating income founder jeff bezos described fast-growing 5 billion business analysts described surprisingly profitable forecast october 2015 amazon.com said q3 earnings report aws operating income 521 million operating margins 25 percent aws 2015 q3 revenue 2.1 billion 78 increase 2014 q3 revenue 1.17 billion 2015 q4 revenue aws segment increased 69.5 y/y 2.4 billion 28.5 operating margin giving aws 9.6 billion run rate 2015 gartner estimated aws customers deploying 10x infrastructure aws combined adoption next 14 providers 2016 q1 revenue 2.57 billion net income 604 million 64 increase 2015 q1 resulted aws profitable amazon north american retail business first time first quarter 2016 amazon experienced 42 rise stock value result increased earnings aws contributed 56 corporate profits aws 17.46 billion annual revenue 2017 end 2018 number grown 25.65 billion notable customers include nasa obama presidential campaign 2012 netflix 2019 reported 80 germany listed dax companies use aws 2019 aws distinct operations 20 geographical regions 6 north america 1 south america 5 emea 8 asia pacific aws announced 5 new regions coming online hong kong sar bahrain milan cape town jakarta region wholly contained within single country data services stay within designated region region multiple availability zones consist one discrete data centers redundant power networking connectivity housed separate facilities availability zones automatically provide additional scalability redundancy within region since intentionally isolated prevent outages spreading zones several services operate across availability zones e.g. s3 dynamodb others configured replicate across zones spread demand avoid downtime failures december 2014 amazon web services operated estimated 1.4 million servers across 28 availability zones global network aws edge locations consists 54 points presence worldwide including locations united states europe asia australia south america 2014 aws claimed aim achieve 100 renewable energy usage future united states aws partnerships renewable energy providers include community energy virginia support us east region pattern development january 2015 construct operate amazon wind farm fowler ridge iberdrola renewables llc july 2015 construct operate amazon wind farm us east edp renewables north america november 2015 construct operate amazon wind farm us central tesla motors apply battery storage technology address power needs us west northern california region aws also pop-up lofts different locations around world market aws entrepreneurs startups different tech industries physical location visitors work relax inside loft learn aws june 2014 aws opened first temporary pop-up loft san francisco may 2015 expanded new york city september 2015 expanded berlin aws opened fourth location tel aviv march 1 2016 march 22 2016 pop-up loft open london september 10 october 29 2015 2017 aws launched amazon start united kingdom help young adults military veterans retrain technology-related skills partnership prince trust ministry defence mod aws help provide re-training opportunities young people disadvantaged backgrounds former military personnel aws working alongside number partner companies including cloudreach sage edf energy tesco bank | [
0,
1539,
6150,
3082,
526,
4623,
18,
5139,
10265,
5660,
3614,
5662,
5666,
9766,
39,
5159,
9772,
6703,
3121,
2098,
5681,
7733,
8255,
5697,
10820,
5702,
4683,
8269,
590,
1102,
9297,
5202,
2134,
4695,
4696,
1628,
94,
4194,
4707,
5732,
9314,... | Test |
7,249 | 2 | MidnightBSD:midnightbsd midnightbsd free unix-like desktop-oriented operating system originally forked freebsd 6.1 periodically updated code drivers later freebsd releases default desktop environment gnustep borrows heavily nextstep graphical user interface midnightbsd began fork freebsd 2005 founder project lucas holt wished create bsd derived desktop operating system familiar several live cd projects work trueos desktopbsd time also interest gnustep two ideas folded plan create user friendly desktop environment midnightbsd 0.1 released based efforts lucas holt caryn holt d. adam karim phil pereira bsdnexus christian reinhardt release features modified version freebsd ports system ports system evolved mports includes fake support generation packages installation license tagging strict rules package list generation modification files outside destination many features introduced midnightbsd 0.1.1 christian reinhardt replaced phil pereira lead mports maintainer prior release midnightbsd 0.1 d. adam karim acted security officer first release release engineering handled lucas holt 0.2 introduced refined mports system 2000 packages portable c compiler added i386 addition gnu compiler collection changes include enabling ipfw sound card detection startup newer versions many software packages including bind gcc openssh sendmail well live cd creation system currently project focusing finishing magus build cluster software creating new installer finishing new package installation management tools called mport beginning work 0.3 release next release feature enhancements found freebsd 7.0 dragonfly bsd midnightbsd named lucas caryn holt cat midnight midnight ten-pound black turkish angora midnightbsd released several licenses kernel code newly created code released two-clause bsd license parts gpl lgpl isc beerware licenses along three- four-clause bsd licenses jesse smith reviewed midnightbsd 0.6 distrowatch weekly | [
7552,
7425,
2179,
2180,
1286,
1927,
1801,
10761,
274,
5397,
8725,
9625,
1946,
4636,
10016,
2212,
6438,
10535,
684,
4908,
1071,
3248,
7983,
9009,
11698,
11573,
1718,
3766,
9784,
1465,
5177,
5819,
7483,
3006,
9151,
11459,
9927,
8266,
5067,
... | Validation |
7,250 | 0 | Automatic_Complaint-Letter_Generator:automatic complaint-letter generator automatic complaint-letter generator website automatically generates complaint letters website created scott pakin 1994 allows users submit name individual company complaint directed toward program generates complaint letter general enough true fit anyone everyone yet specific enough mean something scott pakin started website april 1994 undergraduate student studying computer science carnegie mellon university began thinking creating program would generate complaint letters idea originated looked pointless ramblings student newspaper pakin criticized letters quality one friends remarked letters sounded arbitrary computer could written pakin pondered comment decided write program would generate complaints website allows users specify name individual company complaint directed toward well number paragraphs complaint submitting data computer generates sentences composed arbitrary verbs nouns adjectives 1995 generator 282 sentence skeletons 170 independent clauses 183 adjectives 123 nouns combination elements form one billion sentences september 2009 generator expanded 3379 independent clauses 618 adjectives 497 nouns complaint letters randomly generated insult different pakin said people read letters inclined pay attention sentences accurate ignored statements obviously wrong noted complaint generator general enough true fit anyone everyone yet specific enough mean something 2001 paul weyland chosen austin toastmasters club present kirk watson mayor austin texas toastmasters member asked weyland speech went automatic complaint-letter generator typed mayor name generator churned four-page complaint letter weyland accidentally emailed mayor even though meant send fellow toastmaster member joke watson learned joke indicated would attending club meeting security issues aide e-mailed weyland said mayor joking meeting weyland apologized mayor fawning introductory speech mayor responded ou know paul rant accused lips planted posteriors drug-addled sycophants 'll notice paul lips attached posterior evening | [] | None |
7,251 | 4 | Trojan.Win32.DNSChanger:trojan.win32.dnschanger trojan.win32.dnschanger trojan win32/dnschanger microsoft malware protection center definition multiple av-labs backdoor trojan due mcafee labs malware variant detected april 19 2009 though microsoft malware protection center knew threat since december 8 2006 dns changer trojans dropped onto systems malware tdss koobface dns-changer-trojan malicious .exe file unable spread accord may therefore perform several actions attacker choice compromised computer changing domain name server dns settings order divert traffic unsolicited potentially illegal and/or malicious domains win32.dnschanger used organized crime syndicates maintain click-fraud moment unaware user browsing activity secretly manipulated altering user clicks seemingly legitimate link forwarded another offered site attackers generate revenues pay-per-click online advertising schemes mostly trojan usually extremely small file +/- 1.5 kilobytes designed change 'nameserver registry key value custom ip address link called ip address encrypted body trojan result change victim device contact newly assigned dns -server resolve names different webservers sometimes randomly f-secure received samples variant named paypal-2.5.200-mswin32-x86-2005.exe case paypal attribution indicates phishing likely trojan programmed change dns server name victim computer ip address 193.227.227.218 registry key affected trojan | [
7809,
131,
10756,
10637,
895,
2213,
2859,
10166,
1337,
9537,
1994,
1242,
7515,
9055,
8805,
107,
8054,
507,
127,
8959
] | Test |
7,252 | 2 | OpenBSD_Cryptographic_Framework:openbsd cryptographic framework openbsd cryptographic framework ocf service virtualization layer uniform management cryptographic hardware operating system part openbsd project included operating system since openbsd 2.8 december 2000 like openbsd projects openssh ported systems based berkeley unix freebsd netbsd solaris linux one linux ports supported intel use proprietary cryptographic software hardware provide hardware-accelerated ssl encryption open source apache http server cryptography computationally intensive used many different contexts software implementations often serve bottleneck information flow increase network latency specialist hardware cryptographic accelerators mitigate bottleneck problem introducing parallelism certain kinds hardware hardware random number generators also produce randomness reliably pseudo-random software algorithm exploiting entropy natural events unlike graphics applications games film processing similar hardware accelerators common use strong operating system support use hardware cryptography relatively low uptake late 1990s need uniform operating system layer mediate cryptographic hardware application software used lack layer led production applications hard-coded work one small range cryptographic accelerators openbsd project history integrating strong carefully audited cryptography operating system core produced framework provision cryptographic hardware acceleration operating system service application-level support provided pseudo-device provides access hardware drivers standard ioctl interface simplifies writing applications removes need application programmer understand operational details actual hardware used openbsd implementation ipsec packet-level encryption protocol altered packets decoded batches improves throughput one rationale maximize efficiency hardware usage—larger batches reduce bus transmission overhead—but practice ipsec developers found strategy improves efficiency even software implementations many intel firmware hubs i386 motherboards provide hardware random number generator possible facility used provide entropy ipsec openssl uses ocf systems hardware supports rsa dh dsa cryptographic protocols automatically use hardware without modification software 11 december 2010 former government contractor named gregory perry sent email openbsd project leader theo de raadt alleging fbi paid openbsd ex-developers 10 years previously compromise security system inserting number backdoors side channel key leaking mechanisms ocf theo de raadt made email public 14 december forwarding openbsd-tech mailing list suggested audit ipsec codebase de raadt response skeptical report invited developers independently review relevant code weeks followed bugs fixed evidence backdoors found oracle proprietary operating system solaris originally developed sun features unrelated product called solaris cryptographic framework plug-in system cryptographic algorithms hardware | [
865,
8065,
11487,
11678,
4071,
10631,
8266,
9196,
823,
10908,
3742,
9151
] | Test |
7,253 | 2 | Series_90_(software_platform):series 90 software platform series 90 formerly hildon platform mobile phones uses symbian os developed nokia collaboration psion released 2003 going platform nokia 7700 cancelled eventually make market nokia 7710 nokia discontinued series 90 platform merged technology s60 although one production series 90 device made form gui continued nokia hildon user interface maemo shipped nokia internet tablets series 90 completely incompatible series 60 s60 uiq popular platforms symbian smartphones however applications nokia series 80 communicator devices – nokia 9300 – function series 90 essentially series 90 development psion eikon gui used series 5 series 5mx revo netpad series 7 netbook machines modified controlled entirely touchscreen supplemented 77x0 seven hardware buttons rocker-dial nokia 7700 never released on-screen keyboard text input 7710 added basic handwriting recognition applications single menu tree accessible title bar top screen exit quit option apps button bar added right hand side screen resembling nokia communicator smartphones | [
1537,
10754,
11271,
11277,
529,
3089,
10770,
5143,
2072,
5659,
4132,
40,
3626,
9262,
7727,
10802,
7220,
5175,
9784,
1083,
9292,
7246,
1615,
5201,
3162,
5211,
6748,
607,
1633,
2658,
6763,
109,
8315,
8316,
8829,
11391,
6276,
3205,
9359,
168... | Test |
7,254 | 6 | Fast_Virtual_Disk:fast virtual disk fast virtual disk better known fvd virtualization-oriented disk image file format developed ibm qemu virtualization platform differs existing paravirtualization-centric virtual disk image formats design emphasizes lack contention separation concerns host guest kernels duduplication filesystem block layer storage management fvd written either directly physical logical blockstore avoiding host filesystem overheads regular host file system file strives maintain similarity raw disk layouts eliminate host filesystem disk image compression overheads minimize metadata-related overheads | [
10857,
10476,
9874,
823,
3323
] | Test |
7,255 | 5 | Cleancode_eMail:cleancode email cleancode email also known cleancode email simply email simple command line software utility sending smtp email portable enough compile run linux os x bsd solaris cygwin perhaps unix-like operating systems upon installing cleancode email codice_1 executable binary becomes available program offers features sending email via smtp supports smtp auth via login plain mechanisms mime attachments address book encryption transport via tls message via pgp digital signatures via pgp easily used sending email command line via shell scripts software packages lack modern features helps cleancode email stand fast efficient helpful tool system administrators unix-like environments intentional purpose first developed cleancode email started september 2001 currently still maintained developed original author dean jones | [
1664,
9986,
3465,
9747,
11418,
9642,
1075,
2101,
9909,
823,
9542,
3015,
10956,
6231,
9451,
10861,
9459,
5492,
3578,
8443,
7036
] | Test |
7,256 | 7 | Spread_Toolkit:spread toolkit spread toolkit computer software package provides high performance group communication system resilient faults across local wide area networks spread functions unified message bus distributed applications provides highly tuned application-level multicast group communication point point support spread services range reliable messaging fully ordered messages delivery guarantees toolkit consists messaging server client libraries many software development environments including c/c++ libraries without thread support java class used applets applications interfaces perl python ruby interfaces many software environments provided third parties typical operation computer cluster runs instance spread server client applications connect locally server process spread servers turn communicate pass messages subscriber applications also configured clients distributed across network communicate spread server process one host spread toolkit developed spread concepts llc much support distributed systems networks lab dsn johns hopkins university experimental networked systems lab george washington university partial funding provided defense advanced research projects agency darpa national security agency nsa bindings spread toolkit exist many languages platforms | [
8640,
10083,
3876,
8644,
8582,
4777,
8554,
428,
1197,
5612,
5677,
7887,
7983,
9245,
692,
1049,
6522,
2045
] | None |
7,257 | 4 | Synack:synack synack american technology company based redwood city california synack ’ business includes vulnerability intelligence platform automates discovery exploitable vulnerabilities reconnaissance turns company ’ freelance hackers create vulnerability reports clients synack founded 2013 former nsa agents jay kaplan mark kuhr synack uses network freelance security analysts hackers 50 countries check vulnerability security problems synack also developed hydra platform built spot vulnerabilities look out-of-date software clients first form hydra went live october 21 2015 april 24 2014 company announced secured series funding kleiner perkins caufield byers google ventures allegis capital derek smith shape security february 2015 company raised 25 million series b funding april 11 2017 reported synack raised 21 million microsoft ventures hewlett packard enterprise singtel prior investors ggv capital gv kleiner perkins caufield byers also took part funding round bringing total money raised company 55 million since founding april 11 2017 company 100 employees well growing network freelance hackers cnbc named synack cnbc disruptor company three times row 2015 2017 | [
10924,
1764,
1638,
4956
] | Test |
7,258 | 3 | Avnu_Alliance:avnu alliance avnu alliance consortium professional automotive consumer electronics industrial manufacturing companies working together establish certify interoperability open audio video bridging avb time-sensitive networking tsn standards alliance works member companies certify avb tsn products interoperability manufacturers may use avnu logo certified products every avb-compliant device submitted certification avnu alliance lack avnu logo necessarily imply device incompatible avnu-certified devices institute electrical electronics engineers ieee formed 1963 merger american institute electrical engineers founded 1884 institute radio engineers founded 1912 two organizations merged rise electronics many interests beginning overlap 1980 ieee started project 802 create standards local area network lan applications 1985 802.3 became official standard ethernet cable-based data transmission system originally developed xerox 1970s audio video bridging name given set technical standards developed ieee audio video bridging task group ieee 802.1 standards committee committee developed original technical standards avb way simplify audio video streaming use ethernet cable rather complicated approach traditionally taken using array analog one-way single-purpose point-to-point cables avnu alliance launched august 25 2009 create certification processes based avb standards would ensure interoperability founding members include broadcom cisco systems harman international intel xilinx august 2013 alliance includes 60 members worldwide represent cross-section companies 2012 avnu alliance announced formation avnu automotive avb gen2 council aaa2c committee automotive industry experts collectively identify automotive requirements future development second generation avb standards april 2013 forum launched avnu alliance broadcast advisory council aabac assess improve avb requirements broadcast industry created participation avnu alliance members network technologists broadcasters aabac also intends promote use avb broadcast applications avnu alliance chairman president rick kreifeldt harman international avnu alliance invites industry companies participate collaborate efforts improve audio/video quality members create broad array products including cars semiconductors loudspeakers consoles microphones 2012 avnu alliance created single set open standards avb uses certify devices guarantee interoperability since january 2012 avnu alliance worked test house university new hampshire interoperability laboratory unh-iol test interoperability provide validation certified products avnu certification testing officially began unh-iol february 2013 unh-iol neutral independent testing service works audio/video industry consortiums including ethernet alliance wi-fi alliance ipv6 forum provide third-party verification lower costs collaborative testing help guide industry acceptance technology standard technology ecosystem supporting accelerating development avnu certified products matured include standards-compliant silicon devices fpga ip open-source software also 3rd-party avb certification services coveloz avb certification service product submitted avnu alliance certification tested 400 pages conformance requirements combine ieee 802.1 standard requirements additional requirements developed avnu issues product may reported manufacturer fixing outstanding issues manufacturer submit product avnu official approval permission use avnu certification logo product accompanying marketing efforts february 2014 avnu alliance announced first certified products series avb switches extreme networks passed conformance tests bear avnu-certified logo extreme networks summit x440 series stackable switches extend benefits extremexos software intended professional av applications allowing data audio video co-exist single standards-based network avnu alliance goal make easier implement network systems promoting adoption ieee 802.1 1722 1733 avb standards automotive professional consumer electronics markets ensuring avb products different manufacturers would able interconnect seamlessly along ensuring interoperability adoption ieee 802.1 related ieee 1722 ieee 1733 avb standards various networks would reduce technical issues synching glitches delays improving content streaming capabilities alliance industry standards improved ethernet technology making simpler add enhanced performance capabilities audio/video networks bringing costs using lighter cheaper cable easier set able carry larger amount information regularly used networking environments 2018 avnu alliance announced milan initiative define implementation details media formats clocking redundancy device control provide certification testing program ensure devices different vendors interoperable within common device profiles milan specification based following ieee standards specification requires media clocking based ieee 1722 crf clock reference format sample rate 48 khz optionally 96 192 khz audio stream format based ieee 1722 32-bit standard aaf audio format 8 channels per stream optionally 24 32 bit high capacity format 56 64 channels redundancy providedcwith two independent logical networks every endpoint seamless switchover mechanism avdecc defines operations discover device addition removal retrieve device entity model connect disconnect streams manage device connection status remote control devices alliance members represent variety facets automotive technology growing complexity in-vehicle audio/video systems increasing number in-vehicle applications infotainment safety multiple cameras testing ensure interoperability increasingly important automotive market automotive systems multiple applications require interoperability work properly 2013 avnu alliance works genivi alliance jaspar alliance standardize in-vehicle ethernet requirements ieee avb task group developed series enhancements provide highly-reliable delivery low latency synchronized audio video technology enables construction affordable high performance professional media networks ieee avb task force developed improvements ethernet order improve audio/video networking avnu certifies avb products ensure interoperability video interoperability specifications pro market currently development meyer sound noted adopting avnu alliance ethernet standards assist development first avb-capable loudspeaker named cal stands column array loudspeaker completed 2013 improvements ethernet developed ieee avb task force also benefit desiring distribute digital content among multiple devices home networks 2013 avnu alliance began establish testing requirements avb interoperability specifications reliable time-synced av streaming ethernet wireless networks residential applications | [
3441,
6834,
2948,
5270
] | Test |
7,259 | 9 | SASL_(programming_language):sasl programming language sasl st andrews static language alternatively st andrews standard language purely functional programming language developed david turner university st andrews 1972 based applicative subset iswim 1976 turner redesigned reimplemented non-strict lazy language form foundation turner later languages krc miranda sasl appears untyped whereas miranda polymorphic types burroughs corporation used sasl write compiler operating system | [
9345,
3876,
8262,
6160,
2069,
1333,
1982
] | Test |
7,260 | 4 | Location-based_authentication:location-based authentication location-based authentication special procedure prove individual identity authenticity appearance simply detecting presence distinct location enable location-based authentication special combination objects required basic requirement safe location-based authentication well defined separation locations well equally well defined proximity applying individual location offered technical solution simple location-based authentication includes method limiting granted access presence hence terminating granted authentication leave defines mandate either include new additional procedure | [
1792,
7268,
5573,
8838,
9958,
4912,
10801,
210,
8210,
10580,
5433,
2558
] | Test |
7,261 | 8 | Apache_Axis:apache axis apache axis apache extensible interaction system open-source xml based web service framework consists java c++ implementation soap server various utilities apis generating deploying web service applications using apache axis developers create interoperable distributed computing applications axis development takes place auspices apache software foundation using java version axis two ways expose java code web service easiest one use axis native jws java web service files another way use custom deployment custom deployment enables customize resources exposed web services see also apache axis2 jws files contain java class source code exposed web service main difference ordinary java file jws file file extension another difference jws files deployed source code compiled class files following example expose methods add subtract class calculator axis servlet deployed need copy jws file axis directory server work using apache tomcat container case using another web container custom war archive creation required jws web service accessible using url nowiki http //localhost:8080/axis/calculator.jws /nowiki running custom configuration apache tomcat different container url might different custom web service deployment requires specific deployment descriptor called wsdd web service deployment descriptor syntax used specify resources exposed web services current version 1.3 supports web service exposed using axis generate wsdl file automatically accessing web service url wsdl appended example implementing deploying simple web-service c++ version axis found axis-cpp tutorial link reference section steps necessary information individual steps go directly tutorial | [
769,
8070,
10377,
8460,
7567,
1296,
1041,
6161,
1047,
8217,
11161,
6555,
8860,
10020,
3877,
10661,
11303,
5677,
1327,
7983,
4919,
5047,
6328,
4538,
1851,
6074,
7485,
7742,
9789,
7233,
6338,
4419,
1222,
1991,
4294,
7750,
5066,
8139,
6862,
... | Test |
7,262 | 9 | Flapjax:flapjax flapjax programming language built atop javascript provides spreadsheet-like dataflow computation style functional reactive programming making easy create reactive web pages without burden callbacks potentially inconsistent mutation flapjax thought two ways either library use regular javascript programs new language compiler converts generic javascript either case resulting programs run regular web browser addition flapjax comes persistent storage simple api masks complexity using ajax along sharing access-control server data flapjax compiler written haskell | [
4867,
3876,
3462,
8262,
2804,
8116,
1051
] | None |
7,263 | 3 | Lexra:lexra lexra semiconductor intellectual property core company based waltham massachusetts founded 1997 began developing licensing semiconductor intellectual property cores implemented mips architecture except four unaligned load store lwl lwr swl swr instructions lexra implement instructions necessary good performance modern software silicon graphics owned patent originally granted mips computer systems inc. implementing unaligned loads stores risc processor lexra wish pay high license fee permission use patent lexra licensed soft cores unlike arm ltd time lexra probably first semiconductor intellectual property core company 1998 silicon graphics spun mips technologies inc. semiconductor ip licensing company would compete directly lexra mips technologies sued lexra claiming trademark infringement lexra claims compatibility mips i. lexra mips technologies settled dispute agreeing public statements lexra would clearly state implement unaligned loads stores 1999 mips technologies sued lexra time infringing patents unaligned loads stores though lexra processor designs implement unaligned loads stores possible emulate functionality unaligned loads stores long series instructions opinion lexra ability emulate function unaligned loads stores software predated grant patent question could viewed infringement hardware patent reasonable interpretation also much earlier mips technologies processor ibm mainframes supported unaligned memory operations earlier ibm processors unaligned memory operations partial access registers available microcode instruction set architecture aspects earlier ibm processors posed much greater threat patent invalidation mips technologies compared seemingly vacuous mips technologies infringement claim lexra protracted second lawsuit combined downturn semiconductor industry business forced lexra settlement mips technologies included mips technologies paying lexra large sum money granting lexra license technologies exchange lexra exiting ip business lexra failed networking communications fabless semiconductor chip company ceased operations january 2003 5.5 years lexra implemented ten processor designs licensed nine ip cores lexra first lexra also enhanced mips architecture extensions greatly enhanced performance digital signal processing dsp algorithms | [
7234,
10051,
7173,
426,
6815,
731,
7071
] | None |
7,264 | 4 | Self-signed_certificate:self-signed certificate cryptography computer security self-signed certificate identity certificate signed entity whose identity certifies term nothing identity person organization actually performed signing procedure technical terms self-signed certificate one signed private key typical public key infrastructure pki arrangements digital signature certificate authority ca attests particular public key certificate valid ca one root keys certificates associated public keys trust anchors use special type self-signed certificates establishing trust ca root certificate dependent upon procedures beyond checking digital signature ca based pki system ca must trusted parties usually accomplished placing ca certificates whitelist trusted certificates example web browsers developers may use procedures specified ca/browser forum private ca certificate may placed firmware embedded system trust issues entity accepting new self-signed certificate similar issues entity trusting addition new ca certificate parties self-signed pki must establish trust using procedures outside pki confirm accurate transfer public keys e.g compare hash band many subtle differences ca signed self-signed certificates especially amount trust placed security assertions certificate cas verify identity person issue certificate example us military issues common access cards person multiple forms id ca attest identity values like including signed certificate entity validates certificate trust information certificate extent trust ca signed implication security procedures ca used verify attested information self-signed certificate contrast trust values certificate complicated entity possesses signing key always generate new certificate different values example validity dates self-signed certificate might trusted entity could always create sign new certificate contained valid date range values self-signed certificate trusted following conditions true values out-of-band verified self-signed formally trusted method verify self-signed certificate changed trusted example procedure trusting self-signed certificate includes manual verification validity dates hash certificate incorporated white list certificate presented entity validate first verify hash certificate matches reference hash white-list match indicating self-signed certificate one formally trusted certificate validity dates trusted special treatment x.509 certificate fields self-signed certificate found rfc 3280 least two reasons self-signed certificate based pki may decreased overall risk first also shared private pki systems avoid problems trusting third parties may improperly sign certificates self-signed certificate transactions usually present far smaller attack surface eliminating complex certificate chain validation ca revocation checks like crl ocsp revocation self-signed certificates differs ca signed certificates self-signed certificate nature revoked ca revocation self-signed certificate accomplished removing whitelist trusted certificates essentially revoking trust ca failure revoke self-signed certificate may allow attacker already gained access monitor inject data connection spoof identity private key compromised cost self-signed certificates created free using wide variety tools including openssl java keytool adobe reader apple keychain certificates bought major cas often cost around hundred dollars per year december 2015 mozilla foundation launched let encrypt allows one obtain domain-validated certificate free speed deploy self-signed certificates require two parties interact e.g securely trade public keys using ca requires ca certificate holder interact holder public key validate authenticity ca root certificate customization self-signed certificates easier customize example larger key size contained data metadata etc | [
513,
517,
1157,
510,
1288,
7695,
9744,
1683,
1688,
3742,
8094,
2083,
8358,
11693,
11569,
9394,
7736,
9281,
9412,
3657,
5834,
461,
10831,
11345,
2003,
5590,
474,
3805,
8674,
7139,
10341,
5107,
501,
1526,
2169,
3707,
2558,
4863
] | None |
7,265 | 4 | Pre-play_attack:pre-play attack field security engineering pre-play attack cryptographic attack attacker prepares attack advance carrying simulated transaction pretending device attacked repeats attack second time real device time likely carry series operations simulation technique relies able guess content transaction advance something usually made possible poor choice unpredictability within system name play replay attack pre-play attacks effective chances success slim | [
8694
] | Test |
7,266 | 2 | Source_(command):source command codice_1 unix command evaluates file following command list commands executed current context frequently current context terminal window user typing commands interactive session source command abbreviated dot codice_2 bash similar posix-ish shells however acceptable c shell command first appeared bash scripts run using codice_3 syntax rather run executable command e.g. contain change directory codice_4 command user intends left directory script complete contain export command user wants modify environment current shell another usage situation script file execute permission passing script filename desired shell run script subshell current context | [
9946,
4850,
7847
] | None |
7,267 | 9 | CommonLoops:commonloops commonloops common lisp object-oriented programming system acronym reminiscent earlier lisp oo system loops interlisp-d system early programming language extended common lisp include object-oriented programming functionality dynamic object system differs oop facilities found static languages c++ java like new flavors commonloops supported multiple inheritance generic functions method combination commonloops also supported multi-methods made use metaobjects commonloops new flavors primary ancestors clos commonloops supported portable implementation known portable commonloops pcl ran common lisp implementations day | [
10752,
11269,
2056,
2062,
9231,
7184,
2577,
9749,
8728,
4633,
4122,
8226,
5677,
3119,
1591,
2105,
3132,
6717,
8258,
8771,
8262,
1613,
9299,
10841,
3675,
2660,
8293,
3176,
2666,
2667,
5751,
7805,
1159,
9865,
9877,
4779,
5803,
2225,
8883,
7... | Test |
7,268 | 4 | Time-based_authentication:time-based authentication time-based authentication special procedure prove individual identity authenticity appearance simply detecting presence scheduled time day within scheduled time interval distinct location enable time-based authentication special combination objects required makes sense define starting time time span without constraints location granting access known without defining distinct location access shall granted basic requirement safe time based authentication well defined separation locations well equally well defined proximity applying individual location | [
5433,
7260,
10801
] | Test |
7,269 | 3 | Motorola_68000:motorola 68000 motorola 68000 'sixty-eight-thousand also called m68k motorola 68k sixty-eight-kay 16/32-bit cisc microprocessor introduced 1979 motorola semiconductor products sector design implements 32-bit instruction set 32-bit registers 32-bit internal data bus address bus 24-bits use memory segmentation made popular programmers internally uses 16-bit data alu two additional 16-bit alus used mostly addresses 16-bit external data bus reason motorola referred 16/32-bit processor one first widely available processors 32-bit instruction set running relatively high speeds era 68k popular design 1980s widely used new generation personal computers graphical user interfaces including apple macintosh commodore amiga atari st many others competed primarily intel 8088 found ibm pc easily outperformed 68k 8088 pushed designs like zilog z8000 niche markets made motorola major player cpu space 68k soon expanded additional family members implementing full 32-bit alus part growing motorola 68000 series original 68k generally software forward-compatible rest line despite limited 16-bit wide external bus 40 years production 68000 architecture still use motorola first widely-produced cpu motorola 6800 although capable design eclipsed powerful designs like zilog z80 less powerful faster designs like mos 6502 sales prospects 6800 dimmed motorola began totally new design replace became motorola advanced computer system silicon project macss begun 1976 macss aimed develop entirely new architecture without backward compatibility 6800 ultimately retain bus protocol compatibility mode existing 6800 peripheral devices version 8-bit data bus produced however designers mainly focused future forward compatibility gave 68000 design head start later 32-bit instruction set architectures instance cpu registers 32 bits wide though self-contained structures processor operate 32 bits time macss team drew heavily influence minicomputer processor design pdp-11 vax systems similarly microcode-based mid 1970s 8-bit microprocessor manufacturers raced introduce 16-bit generation national semiconductor first imp-16 pace processors 1973–1975 issues speed intel worked advanced 16/32-bit intel iapx 432 alias 8800 since 1975 intel 8086 since 1976 introduced 1978 became really widespread form almost identical 8088 ibm pc years later arriving late 16-bit arena afforded new processor transistors roughly 40,000 active versus 20,000 active 8086 32-bit macroinstructions acclaimed general ease use original mc68000 fabricated using hmos process 3.5 µm feature size formally introduced september 1979 initial samples released february 1980 production chips available counter november initial speed grades 4 6 8 mhz 10 mhz chips became available 1981 12.5 mhz chips june 1982 16.67 mhz 12f version mc68000 fastest version original hmos chip produced late 1980s 68k instruction set particularly well suited implement unix 68000 successors became dominant cpus unix-based workstations including sun workstations apollo/domain workstations 68000 also used mass-market computers apple lisa macintosh amiga atari st 68000 used microsoft xenix systems well early netware unix-based server 68000 used first generation desktop laser printers including original apple inc. laserwriter hp laserjet 1982 68000 received minor update isa support virtual memory conform popek goldberg virtualization requirements updated chip called 68010 also added new loop mode sped small loops increased overall performance 10 clock speeds extended version exposed 31 bits address bus also produced small quantities 68012 support lower-cost systems control applications smaller memory sizes motorola introduced 8-bit compatible mc68008 also 1982 68000 8-bit data bus smaller 20-bit address bus 1982 motorola devoted attention 68020 88000 projects several companies second-source manufacturers hmos 68000 included hitachi hd68000 shrank feature size 2.7 µm 12.5 mhz version mostek mk68000 rockwell r68000 signetics scn68000 thomson/sgs-thomson originally ef68000 later ts68000 toshiba tmp68000 toshiba also second-source maker cmos 68hc000 tmp68hc000 encrypted variants 68000 hitachi fd1089 fd1094 store decryption keys opcodes opcode data battery-backed memory used certain sega arcade systems including system 16 prevent piracy illegal bootleg games 68hc000 first cmos version 68000 designed hitachi jointly introduced 1985 motorola version called mc68hc000 hitachi hd68hc000 68hc000 eventually offered speeds 8–20 mhz except using cmos circuitry behaved identically hmos mc68000 change cmos greatly reduced power consumption original hmos mc68000 consumed around 1.35 watts ambient temperature 25 °c regardless clock speed mc68hc000 consumed 0.13 watts 8 mhz 0.38 watts 20 mhz unlike cmos circuits hmos still draws power idle power consumption varies little clock rate apple selected 68hc000 use macintosh portable motorola replaced mc68008 mc68hc001 1990 chip resembled 68hc000 respects data bus could operate either 16-bit 8-bit mode depending value input pin reset thus like 68008 could used systems cheaper 8-bit memories later evolution 68000 focused modern embedded control applications on-chip peripherals 68ec000 chip scm68000 core expanded address bus 32 bits removed m6800 peripheral bus excluded move sr instruction user mode programs 1996 motorola updated standalone core fully static circuitry drawing 2 µw low-power mode calling mc68sec000 motorola ceased production hmos mc68000 mc68008 1996 spin-off company freescale semiconductor still producing mc68hc000 mc68hc001 mc68ec000 mc68sec000 well mc68302 mc68306 microcontrollers later versions dragonball family 68000 architectural descendants 680x0 cpu32 coldfire families also still production recently sendai fab closure 68hc000 68020 68030 68882 parts discontinued leaving 68sec000 production succeeded true 32-bit microprocessors 68000 used core many microcontrollers 1989 motorola introduced mc68302 communications processor introduction 68000 first used high-priced systems including multiuser microcomputers like wicat 150 early alpha microsystems computers sage ii iv tandy trs-80 model 16 single-user workstations hewlett-packard hp 9000 series 200 systems first apollo/domain systems sun microsystems sun-1 corvus concept graphics terminals like digital equipment corporation vaxstation 100 silicon graphics iris 1000 1200 unix systems rapidly moved capable later generations 68k line remained popular market throughout 1980s mid-1980s falling production cost made 68000 viable use personal home computers starting apple lisa macintosh followed commodore amiga atari st sharp x68000 hand sinclair ql microcomputer commercially important utilisation 68008 along derivatives icl one per desk business terminal helix systems missouri united states designed extension swtpc ss-50 bus ss-64 produced systems built around 68008 processor adoption risc x86 displaced 68000 series desktop/workstation cpu processor found substantial use embedded applications early 1980s quantities 68000 cpus could purchased less 30 usd per part video game manufacturers used 68000 backbone many arcade games home game consoles atari food fight 1982 one first 68000-based arcade games others included sega system 16 capcom cp system cps-2 snk neo geo late 1980s 68000 inexpensive enough power home game consoles sega mega drive/genesis console also sega cd attachment sega cd system three cpus two 68000s 1993 multi-processor atari jaguar console used 68000 support chip although developers used primary processor due familiarity 1994 multi-processor sega saturn console used 68000 sound co-processor much mega drive/genesis uses z80 co-processor sound and/or purposes certain arcade games steel gunner others based namco system 2 use dual 68000 cpu configuration systems triple 68000 cpu configuration also exist galaxy force others based sega board along quad 68000 cpu configuration used jaleco one 68000 sound lower clock rate compared 68000 cpus games big run cisco heat fifth 68000 different clock rate compared 68000 cpus additionally used jaleco arcade game wild pilot i/o processing 68000 also saw great success embedded controller early 1981 laser printers imagen imprint-10 controlled external boards equipped 68000 first hp laserjet—introduced 1984—came built-in 8 mhz 68000 printer manufacturers adopted 68000 including apple introduction laserwriter 1985 first postscript laser printer 68000 continued widely used printers throughout rest 1980s persisting well 1990s low-end printers 68000 also saw success field industrial control systems among systems benefited 68000 derivative microprocessor families programmable logic controllers plcs manufactured allen-bradley texas instruments subsequently following acquisition division ti siemens users systems accept product obsolescence rate domestic users entirely likely despite installed 20 years ago many 68000-based controllers continue reliable service well 21st century number digital oscilloscopes 80s 68000 used waveform display processor models including lecroy 9400/9400a also use 68000 waveform math processor including addition subtraction multiplication division two waveforms/references/waveform memories digital oscilloscopes using 68000 including 9400/9400a also perform fft functions waveform 683xx microcontrollers based 68000 architecture used networking telecom equipment television set-top boxes laboratory medical instruments even handheld calculators mc68302 derivatives used many telecom products cisco 3com ascend marconi cyclades others past models palm pdas handspring visor used dragonball derivative 68000 alphasmart uses dragonball family later versions portable word processors texas instruments uses 68000 high-end graphing calculators ti-89 ti-92 series voyage 200 early versions used specialized microcontroller static 68ec000 core later versions use standard mc68sec000 processor modified version 68000 formed basis ibm xt/370 hardware emulator system 370 processor 68000 24-bit external address bus two byte-select signals replaced a0 24 lines therefore address 16 mb physical memory byte resolution address storage computation uses 32 bits internally however 8 high-order address bits ignored due physical lack device pins allows run software written logically flat 32-bit address space accessing 24-bit physical address space motorola intent internal 32-bit address space forward compatibility making feasible write 68000 software would take full advantage later 32-bit implementations 68000 instruction set however prevent programmers writing forward incompatible software 24-bit software discarded upper address byte used purposes addressing could fail 32-bit 68000 implementations example early pre-7.0 versions apple mac os used high byte memory-block master pointers hold flags locked purgeable later versions os moved flags nearby location apple began shipping computers 32-bit clean roms beginning release 1989 mac iici 68000 family stores multi-byte integers memory big-endian order cpu eight 32-bit general-purpose data registers d0-d7 eight address registers a0-a7 last address register stack pointer assemblers accept label sp equivalent a7 good number registers time many ways small enough allow 68000 respond quickly interrupts even worst case 8 data registers d0–d7 7 address registers a0–a6 needed saved 15 registers total yet large enough make calculations fast could done entirely within processor without keeping partial results memory note exception routine supervisor mode also save user stack pointer a7 would total 8 address registers however dual stack pointer a7 supervisor-mode a7 design 68000 makes normally unnecessary except task switch performed multitasking system two types registers mildly annoying times hard use practice reportedly allowed cpu designers achieve higher degree parallelism using auxiliary execution unit address registers 68000 comparison arithmetic logic operations set bit flags status register record results use later conditional jumps bit flags zero z carry c overflow v extend x negative n extend x flag deserves special mention separate carry flag permits extra bit arithmetic logic shift operations separated carry flow-of-control linkage designers attempted make assembly language orthogonal instructions divided operations address modes almost address modes available almost instructions 56 instructions minimum instruction size 16 bits many instructions addressing modes longer include additional address mode bits cpu later whole family implements two levels privilege user mode gives access everything except privileged instructions interrupt level controls supervisor privilege gives access everything interrupt always becomes supervisory supervisor bit stored status register visible user programs advantage system supervisor level separate stack pointer permits multitasking system use small stacks tasks designers allocate memory required hold stack frames maximum stack-up interrupts cpu recognizes seven interrupt levels levels 1 5 strictly prioritized higher-numbered interrupt always interrupt lower-numbered interrupt status register privileged instruction allows one set current minimum interrupt level blocking lower equal priority interrupts example interrupt level status register set 3 higher levels 4 7 cause exception level 7 level triggered non-maskable interrupt nmi level 1 interrupted higher level level 0 means interrupt level stored status register visible user-level programs hardware interrupts signalled cpu using three inputs encode highest pending interrupt priority separate encoder usually required encode interrupts though systems require three hardware interrupts possible connect interrupt signals directly encoded inputs cost additional software complexity interrupt controller simple 74ls148 priority encoder may part vlsi peripheral chip mc68901 multi-function peripheral used atari st range computers sharp x68000 also provided uart timer parallel i/o exception table interrupt vector table interrupt vector addresses fixed addresses 0 1023 permitting 256 32-bit vectors first vector reset consists two vectors namely starting stack address starting code address vectors 3 15 used report various errors bus error address error illegal instruction zero division chk chk2 vector privilege violation block privilege escalation reserved vectors became line 1010 emulator line 1111 emulator hardware breakpoint vector 24 starts real interrupts spurious interrupt hardware acknowledgement level 1 level 7 autovectors 16 trap vectors reserved vectors user defined vectors since minimum starting code address vector must always valid reset systems commonly included nonvolatile memory e.g rom starting address zero contain vectors bootstrap code however general purpose system desirable operating system able change vectors runtime often accomplished either pointing vectors rom jump table ram use bank switching allow rom replaced ram runtime 68000 meet popek goldberg virtualization requirements full processor virtualization single unprivileged instruction move sr allows user-mode software read-only access small amount privileged state 68000 also unable easily support virtual memory requires ability trap recover failed memory access 68000 provide bus error exception used trap save enough processor state resume faulted instruction operating system handled exception several companies succeed making 68000-based unix workstations virtual memory worked using two 68000 chips running parallel different phased clocks leading 68000 encountered bad memory access extra hardware would interrupt main 68000 prevent also encountering bad memory access interrupt routine would handle virtual memory functions restart leading 68000 correct state continue properly synchronized operation main 68000 returned interrupt problems fixed next major revision 68k architecture release mc68010 bus error address error exceptions push large amount internal state onto supervisor stack order facilitate recovery move sr instruction made privileged new unprivileged move ccr instruction provided use place user mode software operating system trap emulate user-mode move sr instructions desired standard addressing modes plus access status register later models special registers instructions dot-letter suffixes permitting operations occur 8-bit bytes .b 16-bit words .w 32-bit longs .l like many cpus era cycle timing instructions varied depending source operand example unsigned multiply instruction takes 38+2n clock cycles complete n equal number bits set operand create function took fixed cycle count required addition extra code multiply instruction would typically consume extra cycles bit n't set original multiplication operand instructions dyadic operation source destination destination changed notable instructions 68ec000 low-cost version 68000 slightly different pinout designed embedded controller applications 68ec000 either 8-bit 16-bit data bus switchable reset processors available variety speeds including 8 16 mhz configurations producing 2,100 4,376 dhrystones processors floating-point unit difficult implement fpu coprocessor mc68881/2 one ec series lacks necessary coprocessor instructions 68ec000 used controller many audio applications including ensoniq musical instruments sound cards part midi synthesizer ensoniq sound boards controller provided several advantages compared competitors without cpu board processor allowed board configured perform various audio tasks mpu-401 midi synthesis mt-32 emulation without use tsr program improved software compatibility lowered cpu usage eliminated host system memory usage motorola 68ec000 core later used m68k-based dragonball processors motorola/freescale also used sound controller sega saturn game console controller hp jetdirect ethernet controller boards mid-1990s laserjet printers 68000 assembly code subroutine named copies null-terminated string 8-bit characters destination string converting alphabetic characters lower case subroutine establishes call frame using register a6 frame pointer kind calling convention supports reentrant recursive code typically used languages like c c++ subroutine retrieves parameters passed stack loops reading ascii character single byte string checking whether capital alphabetic character converting lower-case character otherwise leaving writing character string finally checks whether character null character repeats loop otherwise restores previous stack frame a6 register returns note string pointers registers a0 a1 auto-incremented iteration loop contrast code stand-alone function even restrictive version ams ti-89 series calculators kernel-independent values looked tables files libraries executing system calls exception processing minimal registers used need save valid historical julian dates 1 march 1 ad gregorian ones less two dozen operations calculates day number compatible iso 8601 called three inputs stored corresponding locations | [
7170,
7173,
8715,
1548,
9231,
4114,
7188,
5141,
6165,
2073,
10786,
6187,
10796,
3630,
4144,
11314,
1592,
4152,
8761,
6715,
10808,
576,
7235,
8776,
2638,
5711,
7772,
5220,
5736,
8301,
10862,
11374,
3185,
7281,
5235,
3702,
7286,
7291,
3708,
... | Test |
7,270 | 3 | UltraSPARC_III:ultrasparc iii ultrasparc iii code-named cheetah microprocessor implements sparc v9 instruction set architecture isa developed sun microsystems fabricated texas instruments introduced 2001 operates 600 900 mhz succeeded ultrasparc iv 2004 gary lauterbach chief architect presented '97 microprocessor forum probable introduction date ultrasparc iii 1999 would competed digital equipment corporation alpha 21264 intel itanium merced case delayed 2001 despite late awarded analysts choice award best server/workstation processor 2001 microprocessor report multiprocessing features ultrasparc iii in-order superscalar microprocessor ultrasparc iii designed shared memory multiprocessing performance several features aid achieving goal integrated memory controller dedicated multiprocessing bus fetches four instructions per cycle instruction cache decoded instructions sent dispatch unit six time dispatch unit issues instructions appropriate execution units depending operand resource availability execution resources consisted two arithmetic logic units alus load store unit two floating-point units one alus execute simple integer instructions loads two floating point units also equal one execute simple instructions adds executes multiplies divides square roots ultrasparc iii split primary instruction data caches instruction cache capacity 32 kb data cache capacity 64 kb four-way set-associative 32-byte cache line external l2 cache maximum capacity 8 mb accessed via dedicated 256-bit bus operating 200 mhz peak bandwidth 6.4 gb/s cache built synchronous static random access memory clocked frequencies 200 mhz l2 cache tags located on-die enable clocked microprocessor clock frequency increases bandwidth accessing cache tags enabling ultrasparc scale higher clock frequencies easily part increased bandwidth cache tags used cache coherency traffic required multiprocessor systems ultrasparc iii designed used maximum capacity l2 cache 8 mb l2 cache tags 90 kb size external interface consists 128-bit data bus 43-bit address bus operating 150 mhz data bus used access memory memory microprocessors shared i/o devices ultrasparc integrated memory controller implements dedicated 128-bit bus operating 150 mhz access 4 gb local memory integrated memory controller used reduce latency thus improve performance unlike ultrasparc microprocessors use feature reduce cost ultrasparc iii consisted 16 million transistors 75 contained caches tags initially fabricated texas instruments c07a process complementary metal–oxide–semiconductor cmos process 0.18 µm feature size six-levels aluminium interconnect 2001 fabricated 0.13 µm process aluminium interconnects enabled operate 750 900 mhz die packaged using controlled collapse chip connection method first sun microprocessor unlike microprocessors bonded way majority solder bumps placed peripheral ring instead distributed across die packaged 1,200-pad land grid array lga package ultrasparc iii cu code-named cheetah+ development original ultrasparc iii operated higher clock frequencies 1002 1200 mhz die size 232 mm fabricated 0.13 µm 7-layer copper metallization cmos process texas instruments packaged 1,368-pad ceramic lga package ultrasparc iiii code named jalapeno derivative ultrasparc iii workstations low-end one four processor servers introduced 2003 operates 1064 1593 mhz on-die l2 cache integrated memory controller capable four-way multiprocessing glue-less system bus optimized function contains 87.5 million transistors 178.5 mm die fabricated texas instruments 0.13 µm seven-layer metal copper cmos process low-k dielectric ultrasparc iiii unified 1 mb l2 cache operates half microprocessor clock frequency six-cycle latency two-cycle throughput load use latency 15 cycles tag store protected parity data ecc every 64-byte cache line 36 ecc bits enabling correction one-bit errors detection error within four bits cache four-way set-associative 64-byte line size physically indexed tagged uses 2.76 µm sram cell consists 63 million transistors on-die memory controller supports 256 mb 16 gb 133 mhz ddr-i sdram memory accessed via 137-bit memory bus 128 bits data 9 ecc memory bus peak bandwidth 4.2 gb/s microprocessor designed support four-way multiprocessing jbus used connect four microprocessors 128-bit address data multiplexed bus operates one half one third microprocessor clock frequency ultrasparc iiii+ code-named serrano development ultrasparc iiii scheduled introduction second half 2005 cancelled year favor ultrasparc iv+ ultrasparc t1 ultrasparc t2 cancellation known 31 august 2006 improvements higher clock frequencies range 2ghz larger 4mb on-die l2 cache support ddr-333 sdram new 90nm process ultrasparc iii family processors succeeded ultrasparc iv series ultrasparc iv combined two ultrasparc iii cores onto single piece silicon offered increased clock rates cpu packaging nearly identical offering difference single pin simplifying board manufacturing system design systems used ultrasparc iii processors could accept ultrasparc iv cpu board upgrades | [
9090,
9731,
1801,
4235,
6926,
1809,
4241,
5523,
1818,
6815,
8863,
9637,
1707,
2731,
10926,
3247,
6322,
4664,
4285,
6464,
7104,
9665,
8266,
2895,
3919,
597,
2269,
9955,
11626,
5358,
1776,
4465,
11636,
1399,
9976,
1788
] | None |
7,271 | 2 | Telephony_service_provider:telephony service provider telephony service provider defined microsoft tapi specification software interface physical telephony device modem accessed programmatically perform actions dialing phone number logging call tsps thought tapi specific driver telephony device example windows 10 supplies | [
1121,
4590
] | Test |
7,272 | 2 | Execute_Direct_Access_Program:execute direct access program ibm mainframe operating systems execute direct access program xdap pseudo access method accessing direct access datasets block block basis xdap specifically described os system programmer guide existing blocks may read updated dataset may created extended using xdap purpose true access method required xdap may coexist bsam bpam several os components implemented way programmer responsible computing full direct access block identifier mbbcchhr system algorithms available calculating mbbcchhr ttrn system data form track capacity tables available calculating ttrn block number direct access device type later versions os facilitate accessing large capacity devices using trkaddr macro list execute forms xdap supported whereby prototype form called list form expanded data functional form called execute form expanded instructions xdap also supported conventionally case two forms combined expanded inline data instructions use list execute forms facilitates development re-enterable programs xdap results excp supervisor call executed hence execute channel program excp implicitly embedded within xdap iob sole parameter excp included data structure within xdap macro expansion channel command words xdap must reference opened dcb full direct access identifier dcb may opened input output input output inout outputs must update writes existing blocks xdap support format writes bsam bpam available executing format writes writes add new blocks dataset i.e initial additional block particularly final block iobspsvc flag logically iob sam pam svc flag available causes sequential access methods appendages bypassed enhancement first implemented svs retrofitted previous versions os significantly facilitated processing dataset already opened bsam bpam using xdap otherwise certain pre-svs sam pam appendages could cause random supervisor storage overlays presented certain xdap channel programs ibm guarantee system security data integrity pre-svs systems obvious circumvention utilize xdap channel programs also utilize rps rps-type xdap channel programs confusing sam pam appendages thereby leading random supervisor storage overlays | [
6242,
8290,
868,
11656,
8393,
4586,
10094,
7983,
7312,
8911,
10415,
10072,
10958,
3669,
6647,
2616,
11131,
7836
] | Test |
7,273 | 9 | Inline_expansion:inline expansion computing inline expansion inlining manual compiler optimization replaces function call site body called function inline expansion similar macro expansion occurs compilation without changing source code text macro expansion occurs prior compilation results different text processed compiler inlining important optimization complicated effects performance rule thumb inlining improve speed minor cost space excess inlining hurt speed due inlined code consuming much instruction cache also cost significant space survey modest academic literature inlining 1980s 1990s given jones marlow 1999 inline expansion similar macro expansion compiler places new copy function place called inlined functions run little faster normal functions function-calling-overheads saved however memory penalty function inlined 10 times 10 copies function inserted code hence inlining best small functions called often c++ member functions class defined within class definition inlined default need use inline keyword otherwise keyword needed compiler may ignore programmer ’ attempt inline function mainly particularly large inline expansion used eliminate time overhead excess time function called typically used functions execute frequently also space benefit small functions enabling transformation optimizations without inline functions compiler decides functions inline programmer little control functions inlined giving degree control programmer allows use application-specific knowledge choosing functions inline ordinarily function invoked control transferred definition branch call instruction inlining control drops directly code function without branch call instruction compilers usually implement statements inlining loop conditions loop bodies need lazy evaluation property fulfilled code compute loop conditions loop bodies inlined performance considerations another reason inline statements context functional programming languages inline expansion usually followed beta-reduction transformation programmer might inline function manually copy paste programming one-time operation source code however methods controlling inlining see preferable precipitate bugs arising programmer overlooks possibly modified duplicated version original function body fixing bug inlined function direct effect optimization improve time performance eliminating call overhead cost worsening space usage due duplicating function body code expansion due duplicating function body dominates except simple cases thus direct effect inline expansion improve time cost space however primary benefit inline expansion allow optimizations improved scheduling due increasing size function body better optimization possible larger functions ultimate impact inline expansion speed complicated due multiple effects performance memory system primarily instruction cache dominates performance modern processors depending specific program cache inlining particular functions increase decrease performance impact inlining varies programming language program due different degrees abstraction lower-level imperative languages c fortran typically 10–20 speed boost minor impact code size abstract languages significantly important due number layers inlining removes extreme example self one compiler saw improvement factors 4 55 inlining direct benefits eliminating function call primary benefit inlining however optimizations allows optimizations cross function boundaries done without requiring interprocedural optimization ipo inlining performed additional intra procedural optimizations global optimizations become possible enlarged function body example done without inlining require significantly complicated compiler linker case caller callee separate compilation units conversely cases language specification may allow program make additional assumptions arguments procedures longer make procedure inlined preventing optimizations smarter compilers glasgow haskell compiler track naive inlining loses information benefit inlining memory system direct cost inlining increased code size due duplicating function body call site however always namely case short functions function body smaller size function call caller including argument return value handling trivial accessor methods mutator methods getters setters function used one place case duplicated thus inlining may minimized eliminated optimizing code size often case embedded systems inlining also imposes cost performance due code expansion due duplication hurting instruction cache performance significant prior expansion working set program hot section code fit one level memory hierarchy e.g. l1 cache expansion longer fits resulting frequent cache misses level due significant difference performance different levels hierarchy hurts performance considerably highest level result increased page faults catastrophic performance degradation due thrashing program failing run last rare common desktop server applications code size small relative available memory issue resource-constrained environments embedded systems one way mitigate problem split functions smaller hot inline path fast path larger cold non-inline path slow path inlining hurting performance primarily problem large functions used many places break-even point beyond inlining reduces performance difficult determine depends general precise load subject manual optimization profile-guided optimization similar issue code expanding optimizations loop unrolling also reduces number instructions processed decrease performance due poorer cache performance precise effect inlining cache performance complicated small cache sizes much smaller working set prior expansion increased sequentiality dominates inlining improves cache performance cache sizes close working set inlining expands working set longer fits cache dominates cache performance decreases cache sizes larger working set inlining negligible impact cache performance changes cache design load forwarding offset increase cache misses compilers use variety mechanisms decide function calls inlined include manual hints programmers specific functions together overall control via command-line options inlining done automatically many compilers many languages based judgment whether inlining beneficial cases manually specified via compiler directives typically using keyword compiler directive called codice_1 typically hints inlining desired rather requiring inlining force hint varying language compiler typically compiler developers keep performance issues mind incorporate heuristics compilers choose functions inline improve performance rather worsening cases compiler decided inline particular function performing inlining operation usually simple depending whether compiler inlines functions across code different languages compiler inlining either high-level intermediate representation like abstract syntax trees low-level intermediate representation either case compiler simply computes arguments stores variables corresponding function arguments inserts body function call site linkers also function inlining linker inlines functions may inline functions whose source available library functions see link-time optimization run-time system inline function well run-time inlining use dynamic profiling information make better decisions functions inline java hotspot compiler simple example inline expansion performed hand source level c programming language inlining inlining note example actual c application would preferable use inlining language feature parameterized macros inline functions tell compiler transform code way next section lists ways optimize code assembler macros provide alternative approach inlining whereby sequence instructions normally generated inline macro expansion single macro source statement zero parameters one parameters might option alternatively generate one-time separate subroutine containing sequence processed instead inlined call function example range different heuristics explored inlining usually inlining algorithm certain code budget allowed increase program size aims inline valuable callsites without exceeding budget sense many inlining algorithms usually modeled knapsack problem decide callsites valuable inlining algorithm must estimate benefit -- i.e expected decrease execution time commonly inliners use profiling information frequency execution different code paths estimate benefits addition profiling information newer jit compilers apply several advanced heuristics traditionally languages c inline expansion accomplished source level using parameterized macros use true inline functions available c99 provides several benefits approach many compilers also inline expand recursive functions recursive macros typically illegal bjarne stroustrup designer c++ likes emphasize macros avoided wherever possible advocates extensive use inline functions inline expansion optimization since eliminates overhead calls much important enabling transformation compiler expands function body context call site—often arguments may fixed constants—it may able variety transformations possible example conditional branch may turn always true always false particular call site turn may enable dead code elimination loop-invariant code motion induction variable elimination c example previous section optimization opportunities abound compiler may follow sequence steps new function looks like complete inline expansion always possible due recursion recursively inline expanding calls terminate various solutions expanding bounded amount analyzing call graph breaking loops certain nodes i.e. expanding edge recursive loop identical problem occurs macro expansion recursive expansion terminate typically resolved forbidding recursive macros c c++ many compilers aggressively inline functions wherever beneficial although lead larger executables aggressive inlining nevertheless become desirable memory capacity increased faster cpu speed inlining critical optimization functional languages object-oriented programming languages rely provide enough context typically small functions make classical optimizations effective many languages including java functional languages provide language constructs inline functions compilers interpreters often perform aggressive inline expansion languages provide constructs explicit hints generally compiler directives pragmas ada programming language exists pragma inline functions functions common lisp may defined inline codice_1 declaration haskell compiler ghc tries inline functions values small enough inlining may noted explicitly using language pragma c c++ codice_1 keyword functions compiler directive – specifying inlining desired required – also changes visibility linking behavior visibility change necessary allow function inlined via standard c toolchain compilation individual files rather translation units followed linking linker able inline functions must specified header visible marked codice_1 avoid ambiguity multiple definitions | [
6536,
6664,
3725,
2062,
7438,
3475,
3615,
1952,
8609,
3876,
4516,
1702,
8874,
10796,
5677,
10043,
7612,
2620,
10684,
11589,
10703,
1236,
3413,
9300,
10584,
8539,
477,
6751,
10616,
2045
] | Validation |
7,274 | 9 | Exception_handling_syntax:exception handling syntax exception handling syntax set keywords and/or structures provided computer programming language allow exception handling separates handling errors arise program operation ordinary processes syntax exception handling varies programming languages partly cover semantic differences largely fit language overall syntactic structure languages call relevant concept 'exception handling others may direct facilities still provide means implement commonly error handling uses codice_1 block errors created via codice_2 statement significant variation naming syntax some_error exception raise some_error raise some_error memory -- specific diagnostic message ada.exceptions ada.text_io procedure foo begin exception -- start exception handlers end foo assembly languages macro instruction interrupt address available particular system intercept events illegal op codes program check data errors overflow divide zero ibm univac mainframes stxit macro digital equipment corporation rt11 systems trap vectors program errors i/o interrupts dos certain interrupt addresses microsoft windows specific module calls trap program errors print_error echo error trap print_error exit list signals trap tempfile= mktemp trap rm tempfile exit ./other.sh || echo warning failed echo oops echo never printed one set trap multiple errors responding signal syntax like error goto/gosub structure used basic quite different modern exception handling basic one global handler whereas modern exception handling exception handlers stacked error goto handler open somefile.txt input 1 close 1 print file opened successfully end handler print file exist end resume may used instead returns control original position common way implement exception handling standard c use setjmp/longjmp functions enum some_exception 1 exception jmp_buf state int main void two types exist example seh c programming language int filterexpression exception_pointers* ep int main void public static void main int main try c++ resource acquisition initialization technique used clean resources exceptional situations c++ intentionally support outer braces method optional cfscript try catch e finally //cf9+ /cfscript adobe coldfusion documentation cftry /cftry adobe coldfusion documentation added standard syntax cfml dialects railo lucee allow codice_3 statement statement returns processing start prior codice_4 block cfscript example try catch e tag-syntax example cftry /cftry import std.stdio // writefln int main clause resource acquisition initialization technique used clean resources exceptional situations type ecustom class exception // exceptions children class exception raise exception.create 'message raise exception.createfmt 'message values value1 value2 // see sysutils.format parameters raise ecustom.createcustom x try // finally finally end try catch end haskell special syntax exceptions instead /// interface provided functions import prelude hiding catch import control.exception instance exception int instance exception double main prints analogy c++ using namespace std int main another example catch \ex purely functional code one error condition exists type may sufficient instance haskell class default complex error propagation achieved using monads similar functionality using supported try catch exampleexception ee finally try catch error finally handler-case unwind-protect lua uses codice_5 codice_6 functions codice_6 taking function act codice_8 block function foo x end function attempt arg end attempt hello attempt nil attempt foo 42 print success end pcall else end print done -- always executed nsexception *exception nsexception exceptionwithname myexception throw exception try catch someexception *se catch nsexception *ne catch id ue finally exception myexception string int exceptions carry value let perl mechanism exception handling uses throw exception wrapped inside block special variable contains value passed however scoping issues make correctly quite ugly error failed failed perl 5.005 added ability throw objects well strings allows better introspection handling types exceptions eval pseudo-signal trapped handle calls suitable exception handling since global however used convert string-based exceptions third-party packages objects local sig __die__ sub forms shown sometimes fail global variable changed exception thrown checked statement happen multi-threaded environments even single-threaded environments code typically called destruction object resets global variable checking code following example shows way avoid problem see cost able use return values eval several modules comprehensive perl archive network cpan expand basic mechanism // exception handling available php versions 5 greater try catch firstexceptionclass exception catch secondexceptionclass exception finally exception handling available powerbuilder versions 8.0 trap exception try catch exception1 catch exception2 exception3etc catch f none try except ioerror except catch exceptions else executed exceptions raised finally clean-up actions always executed trycatch specialerror=function e error=function e rebol error exception try 1 0 probe disarm exception print attempt divide 1 0 example func function throw exception catch example sophisticated func function throw named error exception catch/name sophisticated 'moniker signal halt begin rescue someerror rescue anothererror error rescue else ensure end try new exceptions may created using function e.g. create exception called subclass exceptions may generated using throw statement throw arbitrary s-lang objects code might throw exception general mechanism provided message exceptions normal objects subclass throw one creating instance sending message e.g. handling mechanism normal message implemented thrown exception passed parameter handling block closure queried well potentially sending allow execution flow continue exception handling supported since swift 2. enum myexception errortype func somefunc throws catch myexception.foo let let catch catch err since tcl 8.6 also try command try ok res opt trap listpattern1 err opt trap listpattern2 err opt error err opt finally new try error resume next .catch error goto 0 select case .number end select end *** try class *** class try end class new try error resume next .catch error goto 0 select case .number end select end *** try class *** private mstrdescription string private mlnghelpcontext long private mstrhelpfile string private mlnglastdllerror long private mlngnumber long private mstrsource string public sub catch end sub public property get source string end property public property get number long end property public property get lastdllerror long end property public property get helpfile string end property public property get helpcontext long end property public property get description string end property try catch ex exception condition catch ex exceptiontype catch ex exception finally end try http //wiki.visual-prolog.com/index.php title=language_reference/terms try-catch-finally try catch traceid finally end try public static void main args _args | [
3462,
8582,
5514,
1931,
6797,
2062,
6414,
9871,
5521,
3736,
4507,
9245,
11683,
3876,
4777,
428,
5165,
5677,
5806,
9008,
692,
3765,
5044,
7479,
5048,
9144,
10684,
1856,
5314,
963,
8644,
8262,
5833,
5961,
11212,
8397,
847,
11219,
5588,
7894... | None |
7,275 | 4 | Frank_W._Lewis:frank w. lewis frank waring lewis august 25 1912 – november 18 2010 american cryptographer cryptic crossword compiler puzzles printed nation 60 years total 2,962 puzzles leonard bernstein kurt vonnegut katha pollitt listed among fans puzzles lewis born august 25 1912 salt lake city utah father england lewis attended secretarial school university utah later earned degree absentia passed federal civil service test earned master degree music catholic university america washington d.c washington lewis worked government secretarial jobs world war ii lewis approached col. william f. friedman head u.s. army cryptography section looking smart people lewis hired civilian helped break code used coordinate japanese ships war joined national security agency nsa awarded decoration exceptional civilian service war department nsa may person two medals much work remains classified 1969 retired wife caribbean relocated massachusetts eruption montserrat volcano died november 18 2010 age 98 survived wife 74 years sylvia née shosteck six children lewis discovered british-style cryptic crosswords stationed war bletchley park code-breaking station england lewis took nation puzzle setter 1947 nation started running puzzles every week instead weekly starting 2008 public outcry great resumed printing puzzles weekly lewis published last puzzle nation december 2009 magazine began reprinting old ones lewis death magazine continued reprint old puzzles searched new puzzle setter | [
7887,
4007
] | Validation |
7,276 | 8 | Grub_(search_engine):grub search engine grub open source distributed search crawler platform users grub could download peer-to-peer grubclient software let run computer idle time client indexed urls sent back main grub server highly compressed form collective crawl could theory utilized indexing system one proposed wikia search grub able quickly build large snapshot asking thousands clients crawl analyze small portion web wikia released entire grub package open source software license however old grub clients functional anymore new clients found wikia wiki project started 2000 kord campbell igor stojanovski ledio ago oklahoma city intellectual property rights acquired grub january 2003 1.3 million cash stock looksmart short time original team continued working project releasing several new versions software albeit closed license operations grub shut late 2005 july 27 2007 jimmy wales announced wikia inc. for-profit company developing open source search engine wikia search acquired grub looksmart july 17 50,000 day site reactivated currently updated | [
8640,
7656,
113,
119,
1274,
7807
] | None |
7,277 | 1 | LDAP_Account_Manager:ldap account manager ldap account manager web application managing various account types ldap directory written php contrast tools likephpldapadmin focus account based give user abstract view directory aims allow people little technical background manage ldap data base application licensed gnu general public license extended version available commercial license ldap account manager lam project founded february 2003 first developers michael dürgner roland gruber tilo lutz leonhard walchshäusl goal create application manage samba software accounts time samba supported ldap 2.x releases version 3 alpha stage gui manage lam version 0.4.10 samba accounts could managed year 2004 project started develop plugin architecture support account types first stable release new code lam 0.5.0 september 2005 commercial variant lam pro since 1.0.4 supports user self-service e.g change password telephone number ... also supports additional ldap objects e.g zarafa kerberos ppolicy ... important account types supported lam samba unix zarafa ppolicy user define profiles account types set default values account information exported pdf files also possibility create users via file upload also includes tree view phpldapadmin access raw ldap attributes lam translated 16 languages supported account types commercial version also includes user self-service allows users edit data register accounts reset passwords | [
6756,
8644,
6651,
5492
] | Test |
7,278 | 2 | Maintenance_Operations_Protocol:maintenance operations protocol maintenance operation protocol mop used utility services uploading downloading system software remote testing problem diagnosis proprietary protocol digital equipment corporation mop frames one following commands | [
10723
] | Test |
7,279 | 2 | Operating_Systems:_Design_and_Implementation:operating systems design implementation operating systems design implementation computer science textbook written andrew s. tanenbaum help albert s. woodhull includes tanenbaum minix free unix-like operating system designed teaching purposes publisher prentice hall 1987 source code minix included part original 719 pages text later versions three editions also included loadable disks minix | [
6352,
7296,
11012,
5397
] | Validation |
7,280 | 7 | QCT_(Quanta_Cloud_Technology):qct quanta cloud technology qct provider data center hardware cloud solutions used hyperscale data center operators facebook rackspace conjunction parent company quanta computer qct sells approximately one every seven server manufactured world qct early contributor open compute project non-profit organization launched facebook engineers open source designs data center products qct manufactured facebook servers among first designs project addition headquarters taoyuan taiwan qct offices san jose seattle beijing hangzhou tokyo qct us subsidiary quanta computer established may 2012 manufacture servers end users course 2012 qct also added storage hardware networking switches portfolio became hardware provider cloud market 2013 qct added rack systems product portfolio 2015 qct partnered software vendors offer software-defined hyper-converged infrastructure solutions variety cloud environments public private hybrid 2004 2012 qct became early contributor open compute project ocp ocp solution provider qct designs builds delivers ocp servers data centers 2015 qct opened two cloud solutions centers demonstrate hyper-converged software hyperscale hardware april 2015 qct cloud solution center taiwan october 2015 opened one fremont california mike yang serves general manager qct qct received editors ’ choice award top 5 vendors watch 2014 hpcwire readers ’ editors ’ choice awards | [
4194,
3819
] | None |
7,281 | 3 | MOS_Technology_6502:mos technology 6502 mos technology 6502 typically sixty-five-oh-two six-five-oh-two 8-bit microprocessor designed small team led chuck peddle mos technology introduced 1975 6502 considerable margin least expensive microprocessor market initially sold less one-sixth cost competing designs larger companies motorola intel caused rapid decreases pricing across entire processor market along zilog z80 sparked series projects resulted home computer revolution early 1980s popular home video game consoles computers atari 2600 atari 8-bit family apple ii nintendo entertainment system commodore 64 atari lynx bbc micro others used 6502 variations basic design soon 6502 introduction mos technology purchased outright commodore international continued sell microprocessor licenses manufacturers early days 6502 second-sourced rockwell synertek later licensed companies cmos form developed western design center 6502 family continues widely used embedded systems estimated production volumes hundreds millions 6502 designed many engineers designed motorola 6800 microprocessor family motorola started 6800 microprocessor project 1971 tom bennett main architect chip layout began late 1972 first 6800 chips fabricated february 1974 full family officially released november 1974 john buchanan designer 6800 chip rod orgill later 6501 assisted buchanan circuit analyses chip layout bill mensch joined motorola june 1971 graduating university arizona age 26 first assignment helping define peripheral ics 6800 family later principal designer 6820 peripheral interface adapter pia motorola engineers could run analog digital simulations ibm 370-165 mainframe computer bennett hired chuck peddle 1973 architectural support work 6800 family products already progress contributed many areas including design 6850 acia serial interface motorola target customers established electronics companies hewlett-packard tektronix trw chrysler may 1972 motorola engineers began visiting select customers sharing details proposed 8-bit microprocessor system rom ram parallel serial interfaces early 1974 provided engineering samples chips customers could prototype designs motorola total product family strategy focus price microprocessor reducing customer total design cost offered development software timeshare computer exorciser debugging system onsite training field application engineer support intel motorola initially announced 360 price single microprocessor actual price production quantities much less motorola offered design kit containing 6800 six support chips 300 peddle would accompany sales people customer visits found customers put high cost microprocessor chips lower price ic chip size would shrink chips could produced silicon wafer could done removing inessential features 6800 using newer fabrication technology depletion-mode mos transistors peddle team members started outlining design improved feature reduced size microprocessor time motorola new semiconductor fabrication facility austin texas difficulty producing mos chips mid-1974 beginning year-long recession semiconductor industry also many mesa arizona employees displeased upcoming relocation austin motorola semiconductor products division management overwhelmed problems showed interest peddle low-cost microprocessor proposal chuck peddle frustrated motorola management missing new opportunity november 1975 interview motorola chairman robert galvin agreed said choose right leaders semiconductor products division division reorganized management replaced new group vice-president john welty said semiconductor sales organization lost sensitivity customer needs could n't make speedy decisions peddle began looking outside motorola source funding new project found small semiconductor company pennsylvania august 1974 chuck peddle bill mensch rod orgill harry bawcom ray hirt terry holdt wil mathys left motorola join mos technology mike james joined later seventeen chip designers layout people 6800 team seven left 30 40 marketers application engineers system engineers 6800 team december gary daniels transferred 6800 microprocessor group tom bennett want leave phoenix area daniels took microprocessor development austin first project depletion-mode version 6800 cut chip area nearly half doubled speed faster parts available july 1976 followed 6802 added 128 bytes ram on-chip clock oscillator circuit mos technology formed 1969 three executives general instrument mort jaffe mclaughlin john paivinen produce metal-oxide-semiconductor mos integrated circuits allen-bradley supplier electronic components industrial controls acquired majority interest 1970 company designed fabricated custom ics customers developed line calculator chips august 19 1974 former motorola employees moved mos technology headquarters valley forge pennsylvania goal design produce low cost microprocessor embedded applications target wide possible customer base would possible microprocessor low cost—and semiconductor business chip size determined cost size goal required n-channel depletion-load mos transistors advanced process mos technology calculator chips used john paivinen able fabrication process ready june 1975 chuck peddle rod orgill wil mathys designed initial architecture new processors would two microprocessors 6501 would plug socket motorola 6800 6502 would work 6800 family peripherals on-chip clock oscillator processors would run 6800 software different instruction set different registers mostly different addressing modes september 1975 article edn magazine gives summary design mos technology 650x family represents conscious attempt eight former motorola employees worked development 6800 system put part would replace outperform 6800 yet undersell benefit hindsight gained 6800 project mos technology team headed chuck peddle made following architectural changes motorola cpu… second b accumulator omitted 16-bit 6800 index register 8-bit offset instruction replaced two 8-bit index registers 8-bit 16-bit offset three-state control eliminated address bus outputs clock generator included chip address bus always active vma valid-memory address output eliminated 8080-type rdy signal single-cycle stepping added chip high level design turned drawings transistors interconnects mos technology layout manual process done color pencils vellum paper layout consisted thousands polygon shapes six different drawings one layer semiconductor fabrication process rod orgill responsible 6501 design assisted john buchanan motorola 6800 bill mensch 6502 designer 6820 peripheral interface adapter pia motorola harry bawcom mike james sydney-anne holt helped layout size goal 6502 chip 153 x 168 mils 3.9 x 4.3 mm area 16.6 mm time technical literature would state length width chip mils 0.001 inch smaller chip area means chips per silicon wafer greater yield defects generally randomly uniformly scattered across wafer area chips per wafer smaller ratio defective chips total wafer chips original 6800 chips intended 180 x 180 mils layout completed 212 x 212 mils 5.4 x 5.4 mm area 29.0 mm first 6502 chips 168 x 183 mils 4.3 x 4.7 mm area 19.8 mm rotate right instruction ror work first silicon instruction temporarily omitted published documents next iteration design shrank chip fixed rotate right instruction included revised documentation mos technology microprocessor introduction quite different traditional months-long product launch first run new integrated circuit normally used internal testing shared select customers engineering samples chips often minor design defect two corrected production begins chuck peddle goal sell first run 6501 6502 chips attendees wescon trade show san francisco beginning september 16 1975 peddle effective spokesman mos technology microprocessors extensively covered trade press one earliest full-page story mcs6501 mcs6502 microprocessors july 24 1975 issue electronics magazine stories also ran ee times august 24 1975 edn september 20 1975 electronic news november 3 1975 byte november 1975 microcomputer digest november 1975 advertisements 6501 appeared several publications first week august 1975 6501 would sale wescon 20 september 1975 advertisements included 6501 6502 microprocessors 6502 would cost 25 mos technology arrived wescon found exhibitors permitted sell anything show floor rented macarthur suite st. francis hotel directed customers purchase processors suite processors stored large jars imply chips production readily available customers know bottom half jar contained non-functional chips chips 20 25 documentation package additional 10 users encouraged make photocopies documents inexpensive way mos technology distribute product information processors supposed 56 instructions rotate right ror instruction work correctly chips preliminary data sheets listed 55 instructions reviews byte edn noted lack ror instruction next revision layout fixed problem may 1976 datasheet listed 56 instructions peddle wanted every interested engineer hobbyist access chips documentation semiconductor companies wanted deal serious customers example signetics introducing 2650 microprocessor advertisements asked readers write information company letterhead 6501/6502 introduction print wescon enormous success downside extensive press coverage got motorola attention october 1975 motorola reduced price single 6800 microprocessor 175 69 300 system design kit reduced 150 came printed circuit board november 3 1975 motorola sought injunction federal court stop mos technology making selling microprocessor products also filed lawsuit claiming patent infringement misappropriation trade secrets motorola claimed seven former employees joined mos technology create company microprocessor products motorola billion-dollar company plausible case lawyers october 30 1974 motorola filed numerous patent applications microprocessor family granted twenty-five patents first june 1976 second bill mensch july 6 1976 6820 pia chip layout patents covered 6800 bus peripheral chips interfaced microprocessor motorola began making transistors 1950 portfolio semiconductor patents allen-bradley decided fight case sold interest mos technology back founders four former motorola engineers named suit chuck peddle mathys bill mensch rod orgill named inventors 6800 patent applications discovery process motorola found one engineer mike james ignored peddle instructions brought 6800 design documents mos technology march 1976 independent mos technology running money settle case agreed drop 6501 processor pay motorola 200,000 return documents motorola contended confidential companies agreed cross-license microprocessor patents may motorola dropped price single 6800 microprocessor 35 november commodore acquired mos technology legal troubles behind mos still left problem getting developers try processor prompting chuck peddle design mdt-650 microcomputer development terminal single-board computer another group inside company designed kim-1 sold semi-complete could turned usable system addition 3rd party computer terminal compact cassette drive much amazement kim-1 sold well hobbyists tinkerers well engineers targeted related rockwell aim 65 control/training/development system also well software aim 65 based mdt another roughly similar product synertek sym-1 one first public uses design apple microcomputer introduced 1976 6502 next used commodore pet apple ii released 1977 later used atari 8-bit family acorn atom home computers bbc micro commodore vic-20 designs home computers business ohio scientific oric 6510 direct successor 6502 digital i/o port tri-state address bus cpu utilized best-selling commodore 64 home computer commodore floppy disk drive 1541 processor own—it 6502 another important use 6500 family video games first make use processor design atari vcs later renamed atari 2600 vcs used offshoot 6502 called 6507 fewer pins result could address 8 kb memory millions atari consoles would sold mos processor another significant use nintendo entertainment system famicom 6502 used nes second source version ricoh partial system-on-a-chip lacked binary-coded decimal mode added 22 memory-mapped registers on-die hardware sound generation joypad reading sprite list dma called 2a03 ntsc consoles 2a07 pal consoles difference memory divider ratio lookup table audio sample rates processor produced exclusively nintendo atari lynx used 4 mhz version chip 65sc02 1980s popular electronics magazine elektor/elektuur used processor microprocessor development board junior computer 6502 little-endian 8-bit processor 16-bit address bus original versions fabricated using process technology chip advertised die size area 16.6 mm internal logic runs speed external clock rate despite low clock speeds typically neighborhood 1 2 mhz 6502 performance competitive contemporary cpus using significantly faster clocks partly due simple state machine implemented combinational clockless logic greater extent many designs two-phase clock supplying two synchronizations per cycle thereby control whole machine -cycle directly typical instructions might take half many cycles complete 6502 contemporary designs like simple cpus era dynamic nmos 6502 chip sequenced microcode rom uses pla occupied 15 chip area instruction decoding sequencing 8-bit microprocessors chip limited overlapping fetching execution low clock frequency moderated speed requirement memory peripherals attached cpu 50 clock cycle available memory access due asynchronous design fraction varied strongly among chip versions critical time affordable memory access times range original nmos 6502 minimalistically engineered efficiently manufactured therefore cheap—an important factor getting design wins price-sensitive game-console home-computer markets like precursor 6800 6502 registers 6502 registers include one 8-bit accumulator register two 8-bit index registers x 7 processor status flag bits p 8-bit stack pointer 16-bit program counter pc compares typical design era z80 eight general-purpose 8-bit registers combined four 16-bit ones order make somewhat lack registers 6502 included zero-page addressing mode uses one address byte instruction instead two needed address full 64 kb memory provides fast access first 256 bytes ram using shorter instructions chuck peddle said interviews specific intention allow first 256 bytes ram used like registers stack address space memory page 01 i.e address range 0100– 01ff 256–511 software access stack done via four implied addressing mode instructions whose functions push pop pull accumulator processor status register stack also used subroutine calls via jsr jump subroutine rts return subroutine instructions interrupt handling chip uses index stack registers effectively several addressing modes including fast direct page zero page mode similar found pdp-8 accesses memory locations addresses 0 255 single 8-bit address saving cycle normally required fetch high-order byte address —code 6502 uses zero page much code processors would use registers 6502-based microcomputers operating system os uses zero page leaving handful locations user addressing modes also include implied 1-byte instructions absolute 3 bytes indexed absolute 3 bytes indexed zero-page 2 bytes relative 2 bytes accumulator 1 indirect x indirect 2 immediate 2 absolute mode general-purpose mode branch instructions use signed 8-bit offset relative instruction branch numerical range −128..127 therefore translates 128 bytes backward 127 bytes forward instruction following branch 126 bytes backward 129 bytes forward start branch instruction accumulator mode uses accumulator effective address need operand data immediate mode uses 8-bit literal operand indirect modes useful array processing looping 5/6 cycle indirect mode 8-bit register added 16-bit base address read zero page located single byte following opcode register therefore index register sense used hold actual index opposed x register 6800 base address directly stored immediate offset could added incrementing index register walk array byte-wise takes two additional cycles less frequently used indirect x mode effective address operation found zero page address formed adding second byte instruction contents x register using indexed modes zero page effectively acts set 128 additional though slow address registers 6502 capable performing addition subtraction binary binary-coded decimal placing cpu bcd mode codice_1 set flag instruction results decimal arithmetic codice_2 would result 00 carry c flag set binary mode codice_3 clear flag operation would result 9a carry flag cleared atari basic bcd mode seldom used home-computer applications see article simple characteristic example 6502 assembly language 6502 instruction operation codes opcodes eight-bits long general form aaabbbcc aaa cc define opcode bbb defines addressing mode instance consider codice_4 instruction performs bitwise bits accumulator another value instruction opcode form 000bbb01 bbb may 010 immediate mode value constant 001 zero page fixed address 011 absolute address pattern absolute number exceptions however apply allows one easily deconstruct opcode values back assembler mnemonics majority instructions handling edge cases special-purpose code 256 possible opcodes available using 8-bit pattern original 6502 uses 151 organized 56 instructions possibly multiple addressing modes depending instruction addressing mode opcode may require zero one two additional bytes operands hence 6502 machine instructions vary length one three bytes operand stored 6502 customary little-endian format 65c816 16-bit cmos version 6502 also supports 24-bit addressing results instructions assembled three-byte operands also arranged little-endian format remaining 105 opcodes undefined original design instructions low-order 4-bits nibble 3 7 b f used providing room future expansion likewise 2xxx column single entry codice_5 remaining 25 empty slots distributed empty slots used 65c02 provide new instructions well variations existing ones new addressing modes fxxx instructions initially left free allow 3rd party vendors add instructions later versions 65c02 standardized set bit fiddling instructions developed rockwell semiconductor 6502 assembly language statement consists three-character instruction mnemonic followed operands instructions take separate operand target single register based addressing mode combine target register instruction mnemonic assembler uses codice_6 opposed codice_7 increment x register processor non-maskable interrupt nmi input edge sensitive means interrupt triggered falling edge signal rather level implication feature wired-or interrupt circuit readily supported however also prevents nested nmi interrupts occurring hardware makes nmi input inactive often control nmi interrupt handler simultaneous assertion nmi irq maskable hardware interrupt lines causes irq ignored however irq line remains asserted servicing nmi processor immediately respond irq irq level sensitive thus sort built-in interrupt priority established 6502 design break flag processor different flag bits flag setting resetting testing instructions affected php plp instructions exists stack brk php always write 1 irq nmi always write 0 input pin asserted set processor overflow status bit deasserting clear overflow bit however used high-speed polling device driver poll hardware three cycles using branch-on-overflow-clear codice_8 instruction branches example commodore 1541 commodore floppy disk drives use technique detect without delay whether serializer ready accept provide another byte disk data obviously great care must used device driver associated system design spurious assertion overflow bit could ruin arithmetic processing several variants nmos 6502 mos technology 6512 6513 6514 6515 rely external clock instead using internal clock generator like 650x e.g 6502 used advantage designs clocks could run asymmetrically increasing overall cpu performance 6512 used bbc micro b+64 western design center designed currently produces w65c816s processor 16-bit static-core successor 65c02 greatly enhanced features w65c816s newer variant 65c816 core apple ii computer basis ricoh 5a22 processor powered popular super nintendo entertainment system w65c816s incorporates minor improvements 65c816 make newer chip exact hardware-compatible replacement earlier one currently available electronics distributors november 2017 w65c816s rated 14-megahertz operation western design center also designed produced 65c802 65c816 core 64-kilobyte address space 65 c 02 pin-compatible package 65c802 could retrofitted 6502 board would function 65c02 power-up operating emulation mode 65c816 two-instruction sequence would switch 65c802 native mode operation exposing 16 bit accumulator index registers well 65c816 enhanced features 65c802 widely used new designs almost always built around 65c816 resulting 65c802 production discontinued following 6502 assembly language source code subroutine named codice_10 copies null-terminated character string one location another converting upper-case letter characters lower-case letters string copied source string converted source stored destination 6502 several bugs quirks accounted programming | [
7170,
1029,
7173,
7691,
8715,
8716,
9739,
10767,
532,
7188,
8732,
10784,
10786,
3630,
11314,
2623,
6210,
7235,
2638,
3157,
5717,
602,
5733,
7269,
5736,
2665,
11374,
10351,
5744,
7282,
7283,
7284,
1660,
8830,
8834,
11395,
3722,
10891,
1170,
... | None |
7,282 | 3 | MOS_Technology_65xx:mos technology 65xx mos technology 65xx series family 8-bit microprocessors mos technology based motorola 6800 introduced ca 1975 65xx family included 6502 used home computers commodore pet vic-20 apple ii atari 800 british bbc micro 6501 6502 40-pin dip packages 6503 6504 6505 6507 28-pin dip versions reduced chip circuit board cost 28-pin versions pin count reduced leaving high-order address pins various combinations function pins making functions unavailable typically 12 pins omitted three n.c. pins one two vss pins one clock pins sync pin s.o pin either maskable interrupt nmi four most-significant address lines a12–a15 12 pins omitted reduce pin count 40 28 omission four address pins reduces external addressability 4 kb 64 kb 6502 though internal pc register effective address calculations remain 16-bit 6507 omits interrupt pins order include address line a12 providing 8 kb external addressability interrupt capability 6507 used popular atari 2600 video game console design divides 8 kb memory space half allocating lower half console internal ram peripherals upper half game cartridge™ atari 2600 cartridges 4 kb address limit capacity limit unless cartridge contains bank switching circuitry one popular 6502 based computer commodore 64 used modified 6502 cpu 6510 unlike 6503–6505 6507 6510 40-pin chip adds internal hardware 8-bit parallel i/o port mapped addresses 0000 0001 6508 another chip like 6510 adds internal hardware 256 bytes sram 8-bit i/o port featured 6510 though chips reduced pin counts compared 6502 need 8 new pins added parallel i/o port case address lines among 8 removed pins | [
11395,
10767,
664,
10784,
4385,
10786,
7589,
11054,
3010,
11601,
3157,
6485,
10969,
9563,
5862,
10351,
1776,
5617,
7281,
7284
] | None |
7,283 | 3 | Q*bert:q*bert q*bert arcade game developed published north american market gottlieb 1982 2d action game puzzle elements uses isometric graphics create pseudo-3d effect objective level game change color every cube pyramid making q*bert on-screen character hop top cube avoiding obstacles enemies players use joystick control character game conceived warren davis jeff lee lee designed title character original concept developed implemented davis q*bert developed project name cubes q*bert well-received arcades among critics game gottlieb successful video game among recognized brands golden age arcade games ported numerous platforms game success resulted sequels use character likeness merchandising appearances lunch boxes toys animated television show q*bert character became known swearing – incoherent phrase made synthesized speech generated sound chip speech balloon nonsensical characters appear collides enemy game developed period columbia pictures owned gottlieb intellectual rights q*bert remained columbia even divested gottlieb assets 1984 therefore rights owned sony pictures entertainment since parent sony acquired columbia 1989 q*bert appeared disney computer-animated film wreck-it ralph license sony later appeared columbia live-action film pixels 2015 q*bert action game puzzle elements played axonometric third-person perspective convey three-dimensional look game played using single diagonally mounted four-way joystick player controls q*bert starts game top pyramid made 28 cubes moves hopping diagonally cube cube landing cube causes change color changing every cube target color allows player progress next stage beginning jumping every cube enough advance later stages cube must hit twice reach target color times cubes change color every time q*bert lands instead remaining target color reach elements combined subsequent stages jumping pyramid results character death player impeded several enemies introduced gradually game collision purple enemies fatal character whereas green enemies removed board upon contact colored balls occasionally appear second row cubes bounce downward contact red ball lethal q*bert contact green one immobilizes on-screen enemies limited time multicolored floating discs either side pyramid serve escape danger particularly coily q*bert jumps disc transports top pyramid coily close pursuit character jump q*bert fall death awarding bonus points causes enemies balls screen disappear though start return seconds points awarded color change 25 defeating coily flying disc 500 remaining discs end stage higher stages 50 100 catching green balls 100 slick sam 300 bonus points also awarded completing screen starting 1,000 first screen level 1 increasing 250 subsequent completion 5,000 level 4 extra lives granted reaching certain scores set machine operator programmer warren davis wrote inspired pattern hexagons implemented fellow gottlieb developer mad planets designer kan yabumoto different telling initial concept began artist jeff lee drew pyramid cubes inspired m. c. escher lee believed game could derived artwork created orange armless main character character jumped along cubes shot projectiles called mucus bombs tubular nose enemies enemies included blue creature later changed purple named wrong way orange creature later changed green named sam lee drawn similar characters since childhood inspired characters comics cartoons mad magazine artist ed big daddy roth q*bert design later included speech balloon string nonsensical characters lee originally presented joke warren davis hired work game protector noticed lee ideas asked could use practice programming randomness gravity game mechanics thus added balls bounce pyramid top bottom davis still learning program game mechanics wanted keep design simple also believed games complex control schemes frustrating wanted something could played one hand accomplish davis removed shooting changed objective saving protagonist danger davis worked game one night gottlieb vice president engineering ron waxman noticed suggested change color cubes game character landed davis implemented unique control scheme four-way joystick rotated 45° match directions q*bert jumping staff members gottlieb urged conventional orientation davis stuck decision davis remembered started programming april 1982 project put schedule actual product several months later mos technology 6502 chip operates 894 khz generates sound effects speech synthesizer votrax generates q*bert incoherent expressions audio system uses 128 b random-access memory 4 kb erasable programmable read memory store sound data code implement like gottlieb games sound system thoroughly tested ensure would handle daily usage retrospect audio engineer david thiel commented testing minimized time available creative designing thiel tasked using synthesizer produce english phrases game however unable create coherent phrases eventually chose string together random phonemes instead thiel also believed incoherent speech good fit q*bert speech balloon following suggestion technician rick tighe pinball machine component included make loud sound character falls pyramid sound generated internal coil hits interior cabinet wall foam padding added area contact cabinet developers decided softer sound better matched fall rather loud knocking sound cost installing foam however expensive padding omitted gottlieb staff difficulty naming game aside project name cubes untitled development process staff agreed game named main character disagreed name lee title initial concept— snots boogers —was rejected list suggestions compiled company employees according davis vice president marketing howie rubin championed title although staff members argued silly would impossible pronounce early test models produced title units artwork meeting hubert suggested staff member thought combining cubes hubert cubert art director richard tracy changed name q-bert hyphen later changed asterisk retrospect davis expressed regret asterisk prevented name becoming common crossword term wildcard character search engines development neared production stage q*bert underwent location tests local arcades preliminary title widely distributed according jeff lee oldest written record attesting game playable public location brunswick bowling alley dates back september 11 1982 gottlieb also conducted focus groups designers observed players one-way mirror control scheme received mixed reaction play testing players adapted quickly others found frustrating initially davis worried players would adjust different controls players would unintentionally jump pyramid several times reaching game ten seconds players however became accustomed controls playing several rounds game different responses controls prompted davis reduce game level difficulty—a decision would later regret copyright claim registered united states copyright office gottlieb february 10 1983 cites date publication q*bert october 18 1982 video games reported game sold directly arcade operators public showing amoa show held november 18–20 1982 gottlieb offered machines 2600 per unit q*bert gottlieb fourth video game q*bert gottlieb video game gathered huge critical commercial success selling around 25,000 arcade cabinets cabaret cocktail versions game later produced machines since become collector items rarest cocktail versions game first introduced wider industry audience november 1982 amoa show immediately received favorably press video games placed q*bert first list top ten hits describing unusual exciting game show stating operator dared walk away without buying least one coin slot reported gottlieb game q*bert one stars show predicted game well contemporaneous reviews equally enthusiastic focused uniqueness gameplay audiovisual presentation roger c. sharpe electronic games considered potential arcade award winner coin-op game year praising innovative gameplay outstanding graphics william brohaugh creative computing video arcade games described game all-round winner many strong points praised variety sound effects graphics calling colors vibrant brohaugh lauded q*bert inventiveness appeal stating objective interesting unique michael blanchet electronic fun suggested game might push pac-man spotlight 1983 neil tesser video games also likened q*bert japanese games like pac-man donkey kong due focus characters animation story lines well absence violence computer video games magazine praised game graphics colors electronic games awarded q*bert innovative coin-op game year video game player called funniest game year among arcade games 1983 q*bert continues widely recognized significant part video game history author steven kent gamespy william cassidy considered q*bert one memorable games time author david ellis echoed similar statements calling classic favorite 1up.com jeremy parish kim wild retro gamer magazine described game difficult yet addictive author john sellers also called q*bert addictive praised sound effects three-dimensional appearance graphics cassidy called game unique challenging attributed challenge part control scheme ign jeremy dunham believed controls poorly designed describing unresponsive struggle nonetheless considered game addictive main character also received positive press coverage edge magazine attributed success game title character stated players could easily relate q*bert particularly swore computer video games however considered swearing negative character appealing cassidy believed game appeal lay main character described q*bert cute personality made stand comparison popular video game characters authors high score referred q*bert ultra-endearing alien hopmeister cutest game character 1982 1982 amoa show parker brothers secured license publish home conversions q*bert arcade game parker first published port atari 2600 end 1983 company also advertised versions atari 5200 intellivision colecovision atari 8-bit computer family commodore vic-20 texas instruments ti-99/4a commodore 64 release commodore 64 version noted lag behind others appeared 1984 parker brothers also translated game stand-alone tabletop electronic game uses vfd screen since become rare collector item q*bert also published parker brothers philips videopac europe tsukuda original othello multivision japan ultra games nes north america initial home port atari 2600 widespread system time met mixed reactions video games warned buyers atari 2600 version may find little disappointed criticized lack music removing characters ugg wrongway system troubles handle character sprites screen steady performance later mark brownstein magazine favor game still cited presence fewer cubes game pyramidal layout pretty poor control negatives richardson electronic games noted lack audiovisual qualities counter-intuitive controls commended gameplay stating game comes much closer source inspiration surface evaluation indicates randi hacker electronic fun computers games called sterling adaption 2008 however ign levi buchanan rated fourth worst arcade port atari 2600 mostly due lack jumping animations enemies instead pop instantly adjacent cube making impossible know direction travel land entertainment weekly called q*bert one top ten games atari 2600 2013 saying port lost cool isometric perspective none addictive gameplay home versions well-received exceptions colecovision version electronic fun computers games noted q*bert aficionados disappointed marc brownstein video games called one best authorized versions warren davis also considered colecovision version accurate port arcade mark brownstein judged atari 5200 version inferior colecovision due imprecision atari 5200 controller noted tend grow video games determined intellivision version worst available ports criticizing system controller inadequate game antic magazine david duberman called atari 8-bit version one finest translations arcade game home computer format arthur leyenberger creative computing listed runner-up best arcade adaptation system praising faithful graphics sound movement playability softline critical criticizing atari version controls lack swearing magazine concluded home computer game n't sense style one arcades ... execution n't 1984 magazine readers named game fifth-worst atari program 1983 computer games called c64 version absolutely terrific translation almost totally duplicates arcade game aside lack synthesized speech stand-alone tabletop awarded stand-alone game year electronic games 2003 version java-based mobile phones announced sony pictures mobile reviewers generally acknowledged faithful port arcade original criticized controls modojo robert falcon stated diagonal controls take time adapt cell phone traditional directions michael french pocket gamer concluded ca n't escape fact n't exactly fit mobile graphics certainly spruced-up sound effects timeless ... really little perfect conversion airgamer criticized gameplay monotonous difficulty frustrating contrast wireless gaming review called one best mobile retro roundup february 22 2007 q*bert released playstation 3 playstation network features upscaled filtered graphics online leaderboard players post high-scores sixaxis motion controls game received mixed reception dunham gerstmann enjoy motion controls said title nostalgic players eurogamer.net richard leadbetter judged game elements simplistic repetitive make worthwhile 2007 contrast parish considered title worth purchasing citing addictive gameplay according jeremy parish q*bert one higher-profile titles classic era describing q*bert legacy jeff gerstmann gamespot referred game rare arcade success 2008 guinness world records ranked behind 16 arcade games terms technical creative cultural impact though successful creators game receive royalties gottlieb program place time davis lee nonetheless expressed pride game continuing remembered fondly q*bert became one merchandised arcade games behind pac-man although according john sellers nearly successful franchise donkey kong character likeness appears various items including coloring books sleeping bags frisbees board games wind-up toys stuffed animals flyer distributed 1983 gottlieb claimed 125 licensed products however north american video game crash 1983 depressed market game popularity began decline 1984 years following release q*bert inspired many games similar concepts magazines video games computer games commented trend features q*bert -like games 1984 listed mr cool sierra on-line frostbite activision q-bopper accelerated software juice tronix quick step imagic flip flop boing first star software pharaoh pyramid master control software pogo joe screenplay rabbit transit starpath games inspired q*bert titles identified q*bert -like games include cubit micromax j-bird orion software uk bouncer acornsoft hubert blaby computer games pogo ocean spellbound beyond vector hopper kristof tuts 1983 q*bert adapted animated cartoon part saturday supercade cbs features segments based video game characters golden age video arcade games saturday supercade produced ruby-spears productions q*bert segments 1983 1984 show set united states 1950s era town called q-burg stars q*bert high school student altered include arms hands jacket sneakers shoots black projectiles nose calls slippy dew make enemies slip characters frequently say puns add letter q words q*bert themes characters appear essential 2012 3d disney computer-animated film wreck-it ralph 2015 sony film pixels 2014 q*bert makes cameo appearance radioshack super bowl xlviii commercial '80s called q*bert seen played 1984 film moscow hudson starring robin williams 1993 ibm pc role-playing game features segment player solve pyramid puzzle homage q*bert 2009 action-adventure game q*bert arcade cabinet seen ghostbusters headquarters game referenced several animated television series family guy futurama simpsons robot chicken mad south park november 28 1983 rob gerhardt reached record score 33,273,520 points q*bert marathon held almost 30 years george leutz brooklyn new york played one game q*bert eighty-four hours forty-eight minutes february 14–18 2013 richie knucklez arcade flemington new jersey scored 37,163,080 points doris self credited guinness world records oldest competitive female gamer set tournament record score 1,112,300 q*bert 1984 age 58 record surpassed drew goins june 27 1987 score 2,222,220 self continually attempted regain record death 2006 november 18 2012 george leutz broke q*bert tournament world record live kong 2 event 1up arcade bar denver colorado leutz scored 3,930,990 points eight hours earning 1.5 million points first life beating self score using single life leutz score verified twin galaxies video ends score 3.7 million points 1,500,000 points previous record believing original game easy davis initiated development faster harder challenging q*bert also known fhmc q*bert 1983 increases difficulty introduces q*bertha adds bonus round however project canceled game never entered production davis released fhmc q*bert rom image sqbert.zip onto web december 1996 gottlieb also released pinball game q*berts quest based arcade version features two pairs flippers x formation audio arcade gottlieb produced fewer 900 units several video game sequels released years reach level success original first titled q*bert qubes shows copyright 1983 title screen whereas instruction manual cites 1984 copyright manufactured mylstar electronics uses hardware original game features q*bert introduces new enemies meltniks shoobops rat-a-tat-tat player navigates protagonist around plane cubes avoiding enemies jumping cube causes rotate changing color visible sides cube goal match line cubes target sample later levels require multiple rows match though part popular franchise game release hardly noticed parker brothers showcased home versions q*bert qubes winter consumer electronics show january 1985 q*bert qubes ported colecovision atari 2600 konami distributed original q*bert japanese arcades 1983 produced game title q*bert msx computers 1986 released japan europe however main character little dragon mechanics based q*bert qubes contrary mylstar arcade game 50 stages different pattern cubes addition known rule extensions later stages competitive 2-player mode assigns side different pattern players score points either completing pattern first pushing board 1992 handheld game developed realtime associates published jaleco 1992 features 64 boards different shapes q*bert 3 snes also developed realtime associates released 1992 jeff lee creator q*bert character also worked graphics game q*bert 3 features gameplay similar original like game boy game larger levels varying shapes addition enemies first game introduces several new enemies frogg top hat derby published ntvic q*bert playable character game ntvic started contest electronic gaming monthly magazine consisting three questions game reader answer questions mail egm first winner answer questions correctly first prize consisting snes console copy q*bert 3 copy strike gunner s.t.g snes egm t-shirt first five contestants came second place latter two prizes 2004 sony pictures released sequel adobe flash titled q*bert 2004 containing faithful rendition original arcade game along 50 levels use new board layouts six new visual themes q*bert deluxe ios devices initially released rendition arcade game later received updates themes stages q*bert 2004 2005 sony pictures released q*bert 2005 download windows flash browser applet featuring 50 different levels july 2 2014 gonzo games sideline amusement announced q*bert rebooted released steam ios android versions playstation 3 playstation 4 playstation vita released february 17 2015 north america february 18 2015 europe released february 12 2016 xbox one according mark caplan vice president consumer products worldwide marketing distribution sony pictures entertainment release motivated renewed interest q*bert part due cameo recent wreck-it ralph animated feature film q*bert rebooted contains port classic arcade game alongside new playing mode uses hexagonal shapes increasing number possible movement directions six additionally 'rebooted mode features new enemy types including boxing glove punches q*bert levels treasure chest tries avoid game 5 different stage designs spread across 40 levels contain three rounds bonus round completed 5 lives gems collected unlock different skins q*bert character completing levels multiple times reaching specific time score goals awarded stars enable access levels | [
8193,
488,
8937,
3533,
9006,
2383,
1776,
7281,
7283,
10644,
10931,
5820,
3039
] | None |
7,284 | 3 | MOS_Technology_6510:mos technology 6510 mos technology 6510 8-bit microprocessor designed mos technology modified form successful 6502 6510 widely used commodore 64 home computer variants primary change 6502 addition 8-bit general purpose i/o port although six i/o pins available common version 6510 addition address bus could made tristate c64 extra i/o pins processor used control computer memory map bank switching controlling three four signal lines datasette tape recorder electric motor control key-press sensing write data lines read data line went another i/o chip possible writing correct bit pattern processor address 01 completely expose almost full 64 kb ram c64 leaving rom i/o hardware exposed except processor i/o port data directional register 1985 mos produced 8500 hmos version 6510 process modification virtually identical nmos version 6510 8500 originally designed use modernised c64 c64c however 1985 limited quantities 8500s found older nmos-based c64s finally made official debut 1987 appearing motherboard using new 85xx hmos chipset 7501/8501 variant 6510 introduced 1984 compared 6510 variant extends number i/o port pins 6 8 omits pins non-maskable interrupt clock output.. used commodore c16 c116 plus/4 home computers i/o port controlled datasette also cbm bus interface main difference 7501 8501 cpus manufactured slightly different processes 7501 manufactured hmos-1 8501 hmos-2 2 mhz-capable 8502 variant used commodore 128 cpus opcode compatible including undocumented opcodes commodore 1551 disk drive used 6510t version 6510 eight i/o lines nmi rdy signals available | [
11395,
8715,
10767,
664,
10784,
4385,
7589,
8494,
11054,
2874,
3010,
2383,
3157,
6485,
10969,
9563,
5862,
10351,
1776,
5617,
7281,
7282,
372,
1660
] | Test |
7,285 | 2 | Visi_On:visi visicorp visi short-lived highly influential graphical user interface-based operating environment program ibm compatible personal computers running ms-dos although visi never popular steep minimum system requirements day major influence later development microsoft windows spring 1981 personal software cash-flush ever-increasing sales visicalc corporate directors sat planned future directions ed esber introduced concept family products could sold together technical perspective none products similar anything name instance use visiplot visicalc data numbers plotted exported raw format re-imported dan fylstra led technical discussion sorts actions user would need able accomplish order products truly integrated decided three key concepts one universal data exchange would supported set common data structures used programs another common consistent interface users would re-learn ui moved one program another finally fylstra concerned time needed move one program another long useful – user needing quickly look something visidex would save exit visicalc look information quit re-launch visicalc process made quicker simpler july 1981 xerox announced xerox star advanced workstation computer featuring graphical user interface point well known secret apple computer working low-cost computer gui would later released apple lisa personal software president terry opdendyk knew two-man team texas working gui arranged scott warren dennis abbe visit personal software headquarters sunnyvale california demonstrated version smalltalk programming language running trs-80 microcomputer seriously underpowered machine task personal software extremely impressed contract soon signed work project quasar started almost immediately name shortly thereafter changed visi play vision retained visi naming experimental port ill-fated apple iii completed november development work shifted dec vax cross-compilers number different machines early 1982 personal software changed name visicorp betting much future success company visi visi many features modern gui included become common many years later fully mouse-driven used bit-mapped display text graphics included on-line help allowed user open number programs window visi however include graphical file manager visi also demanded hard drive order implement virtual memory system used fast switching time hard drives expensive piece equipment tom powers visicorp new vp marketing pushed system demonstrated fall comdex show 1982 others company worried product ready shipping showing early would leave potential customers distributors upset n't ready soon another concern visiword released show worry might lost shuffle demonstrations comdex huge success many viewers told simply movie watching bill gates speculated pc fact simply terminal real machine like vax became one talked-about products industry however huge success led number serious problems separate june july 1983 byte articles company mentioned late summer 1983 release visi development continued visicorp entity process self-destruction terry opdendyk president hand-picked early venture capital investors extremely autocratic management style led departure many key executives late 1981 eventual release visi product management company left notably mitch kapor charge visicalc development ed esber roy folk visi product marketing manager among others referred corporate civil war mitch kapor departure would prove devastating company however kapor developer visiplot visitrend pressing development greatly improved spreadsheet succeed visicalc opdendyk uninterested time visicorp visicalc developers impasse visicalc growing increasingly outdated kapor decided leave executives pressed clause forbidding kapor work integrated spreadsheet opdendyk could n't bothered exclaiming kapor spaghetti programmer denigrating abilities kapor would go release lotus 1-2-3 became major competitor visicalc 1983 end year sales cut half combined exodus major portions senior executive staff ongoing battle visicalc developers visicorp soon serious financial difficulty hopes company future placed visi october 31 1983 infoworld article titled finally visi flatly stated ... publisher putting product computer store shelves ... visi scheduled available last week october november 14 1983 issue said visicorp released visi however july 2 1984 issue says time visi actually shipped december 16 1983 ... pc magazine reported february 7 1984 issue still n't received product commercially available form operating system known visi applications manager released december 1983 sold 495 requiring mouse another 250 main disadvantage visi extremely high system requirements 1982 standards needed 512 kilobytes ram hard disk time pcs shipped 64k-128k ibm yet offer hard disk pc ibm first model hard drive pc xt n't ship march 1983 third-party drives however available time typically 5mb units connected floppy controller treated operating system oversized floppy disk subdirectory support brought total cost running visi 7500 three-quarters cost apple lisa press continued laud product going far claim represented end operating systems end-users less impressed however due high cost required hardware also general slowness system market computers generally used one two tasks usually business related whole purpose visi seriously diluted january 1984 apple computer released macintosh much fanfare although macintosh seriously lacking software faster cheaper included one feature visi lacked graphical file manager finder although n't compete directly visi really pc product nevertheless demonstrated gui could indeed fast relatively inexpensive visi failed deliver adding release problems bill gates took page visicorp book announced product microsoft windows would available may 1984 muddied waters significantly notably claimed would similar feature set n't require hard disk cost 250 windows released even longer delay visi shipping november 1985 lacking features forced visi demand hard drive eight visicorp employees still developing visi visicorp sold source code control data mid-1984 raise cash sued software arts continuing sell software sales apparently slow february 1985 visicorp responded lowering price basic os 99 knowing anyone purchasing would also need buy applications bundled three 990 improved situation somewhat sales still far projections certainly helping company stave problems due lotus 1-2-3 following declining visicalc sales low revenues visi november 1985 company merged paladin software new company kept paladin name visicorp line visiproducts history official system requirements visi work newer pcs requires compatible mouse hard disk partition 15mb fat12 file system supported addition revectors irqs used pc/ats later visionxt.exe requires modifications prevent graph applications functioning properly visi required mouse systems-compatible mice microsoft-compatible pc mice time became standard introduced later may 1983 visi used two mouse drivers first loaded text mode made mouse registers accessible embedded driver translated coordinates cursor position internal driver built-in subroutine visionxt.exe required mouse systems pc-mouse pointing device compatible microsoft mouse standard writing visi applications required unix development environment visi targeted toward high-end expensive pc workstations visi applications written subset c visic third-party could ported core software visihost visimachine virtual machine visionxt.exe ibm pc dos version unix never occurred 1984 visicorp assets sold control data corporation making working copies original floppy disks using modern methods difficult protected using pre-created bad sectors methods floppy disk identification | [
2560,
10757,
6155,
4114,
6675,
7187,
10776,
25,
4637,
9762,
4643,
6180,
5158,
7217,
10803,
9784,
10809,
576,
2625,
6221,
3160,
10333,
97,
11363,
6760,
10856,
8298,
9835,
8301,
4727,
2168,
9335,
634,
1147,
3197,
1150,
5247,
11390,
2179,
10... | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.