- パソコンポップアップ画面に「私は、法令・ルールを遵守し、正しい仕事をします」のトップメッセージを掲載
- 現場を定期的に直接訪れ、テーマを決めて双方向コミュニケーションを実施
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
* p42 タイパ逆転現象 | |
* p46 「うちは優秀な若手からやめていくんですよ」 | |
* p71 進行した組織のフラット化、スパンオブコントロール、キヤノンは15人が目安。 | |
* p80 図表22 労働時間管理施策。メンバーの残業減らせ→管理職が巻き取る | |
* p91 図表25 管理職と人事分の課題認識のすれ違い | |
* p97 図表28 罰ゲーム化の兆候となる現象チェックシート | |
* p104 労働時間の裁量性、「人を採用できないような管理職では、結局自分が現場労働者の穴を埋める」 | |
* p117 「管理職になると、転職できなくなる」の謎。 | |
* p121 データで見る管理職の国際比較 | |
* p124 「ジョブ」として成立しない。課や部の代表者として組織内に閉じた役割を担い、近年ではそれが「多忙すぎる雑用係」に堕ちていっています。 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
s = 345 | |
d = 5 | |
rr = {} | |
pk = 0 | |
r = Hash.new{|h,k|h[k] = []} | |
while true do | |
s += 1 | |
k = (s ** 3).to_s.chars.sort.join | |
r[k] << s |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def empty?(e) | |
e.peek | |
false | |
rescue | |
true | |
end | |
def merge(*src) | |
src = src.map{|s| s.to_enum} | |
while true |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
void f() { | |
/* sign 1 bit*/ | |
/* exp 8 bit*/ | |
/* frac = 23 bit*/ | |
int binfloat[] = { | |
/* seeeeeeeefffffffffffffffffffffff */ | |
0b00111111100000000000000000000000, /* 1.0 */ | |
0b00111111110000000000000000000000, /* 1.5 */ | |
0b00111111101000000000000000000000, /* 1.25 */ | |
0b00111111100100000000000000000000, /* 1.125 */ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
require 'matrix' | |
def line_intersection line1, line2 | |
l1 = line1.map{|v|v.map(&:to_f)} | |
l2 = line2.map{|v|v.map(&:to_f)} | |
a = l1[1]-l1[0] | |
b = l2[1]-l2[0] | |
ab = l1[0]-l2[0] | |
cab = a.cross(b) | |
nA = b.cross(ab).dot(cab) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
require 'matrix' | |
def centroid points | |
base = points[0] | |
z = (points[1] - base).cross(points[2] - base).normalize | |
ds = [] | |
total_area = 0.0 | |
points.drop(1).each_cons(2) do |cons| | |
a, b = cons[0] - base, cons[1] - base | |
c = (base + cons[0] + cons[1])/3.0 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include "stdio.h" | |
#include "stdlib.h" | |
#include "string.h" | |
#include <algorithm> | |
int bs_enc(int len, char* input, int* index, char** bwt); | |
int bs_dec(int index, char* bwt, int len, char** output); | |
class CompEnc{ | |
public: |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
require 'scanf' | |
require 'pp' | |
class Node | |
def initialize(id) | |
@id = id | |
@edges = Array.new | |
@done = false | |
@word = nil | |
@from = nil |
NewerOlder