cutrus

For some reason I can't upgrade my MDP-M01 and MDP-P906 devices to newest firmware (M01: v2.02 and P906: v3.01).
Using .hex files always results in an error, and using .bin files bricks the devices and leaves them stuck in DFU mode.
This issue occurs for me on both Linux and Windows.

I found that after you get an error (your .hex file gets renamed to an .err file), you can flash the internal controller with any .hex file.
The problem is the available space on the device — there is not enough room to copy the full firmware twice.
So I discovered that you can truncate the original .hex file, trigger the error, and then copy the full .hex firmware again.

For example, for my MDP-P906 with new firmware:

vznncv

"""
The script contains example of the paramiko usage for large file downloading.

It implements :func:`download` with limited number of concurrent requests to server, whereas
paramiko implementation of the :meth:`paramiko.SFTPClient.getfo` send read requests without
limitations, that can cause problems if large file is being downloaded.
"""

import logging
import os

Morendil

The citations game: Wolverton Ratios

Rubric: Software Engineering : Factual Claims : Defect Cost Increase : Wolverton Ratios

Context

See previous note on the IBM Systems Sciences Institute

In absolute numbers, the Wolverton are as follows: 139:455:977:7136:14102, claimed dollar costs of fixing an "average" defect. (Itself an absurd claim, see Leprechauns, I should perhaps write more on that.)

mccutchen

package main

// Here's a half-assed "jepsen" test for nsq_to_file that exercises its
// management of files in -work-dir and -output-dir in the face of multiple
// processes sharing those directories.
//
// Usage:
//
//  1. Ensure that the versions of nsqd & nsq_to_file you intend to test are on
//     your $PATH:

colmmacc

import sys

# choose() is the same as computing the number of combinations. Normally this is
# equal to:
#
#   factorial(N) / (factorial(m) * factorial(N - m))
#
# but this is very slow to run and requires a deep stack (without tail
# recursion).
#

Jaza

*

jehiah

package nsqutils

import (
	"sync"
	"time"

	nsq "github.com/nsqio/go-nsq"
)

// Producer is an interface that nsq.Producer fulfills

lewisd32

echo "Flipping tables! (╯°□°）╯︵ ┻━┻"

num_rules=3

real=3    # exposed to the ELB as port 443
test=4    # used to install test certs for domain verification
health=5  # used by the ELB healthcheck

blue_prefix=855
green_prefix=866

lukechampine

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<sys/mman.h>
typedef void V;typedef int I;typedef double F;typedef unsigned char C,*S;typedef long L;
#define O           printf
#define R           return
#define I(a...)     if(a)
#define W(a...)     while(a)

schlamar

import datetime
import functools
import logging
import os
import time

import gobject
import gtk