#Hackers #Hacking #Lulz #Programming #Coding #Realness
LOLcode
HAI!
LOLcode is a programming language based on the communication style of lolcats.
An example code is:
HAI CAN HAS STDIO? VISIBLE "HAI WORLD!" KTHXBYEHAI is the equivalent of <body> or { and introduces any script.
CAN HAS STDIO means that the code has standard inputs and outputs
VISIBLE is equal to print or show (depending on what programming language you are familiar with)
KTHXBYE ends the script. It’s an equivalent of </body> or }
HAI CAN HAS STDIO? I HAS A VAR IM IN YR LOOP UP VAR!!1 VISIBLE VAR IZ VAR BIGGER THAN 10? KTHXBYE IM OUTTA YR LOOP KTHXBYE
Is another code example.
Those familiar with programming should be able to decode this. Otherwise, it’s not worth the effort explaining it.
KTHXBYE
THN Inviting ‘Link Exchange’ from Hacking, Technology, News, Programming and Various IT related websites, Please frwd request to thehackernews@gmail.com
Source: thehackernews.com
Programming, Motherfucker

The Motherfucking Manifesto
For
Programming, Motherfuckers
We are a community of motherfucking programmers who have been humiliated by software development methodologies for years.
We are tired of XP, Scrum, Kanban, Waterfall, and anything else getting in the way of…Programming, Motherfucker.
We are tired of being told we’re autistic idiots who need to be manipulated to work in a Forced Pair Programming chain gang without any time to be creative because none of the 10 managers on the project can do…Programming, Motherfucker.
We must destroy these methodologies that get in the way of…Programming, Motherfucker.
Our Values
They Claim To ValueThey Really ValueWe Fucking Do Individuals and interactionsTons of billable hoursProgramming, Motherfucker Working softwareWorking unit testsProgramming, Motherfucker Customer collaborationBleeding clients dryProgramming, Motherfucker Responding to changeInstability and plausible deniabilityProgramming, MotherfuckerWe think the shit on the left, is really just the con in the middle, and that we really need to just do the thing on the right…Programming, Motherfucker.
Signed,
Zed A. Shaw And The Programming Motherfuckers
How to be a Programmer: A Short, Comprehensive, and Personal Summary
Robert L Read
Copyright � 2002, 2003 Robert L. Read
CopyrightCopyright � 2002, 2003
by Robert L. Read. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with one Invariant Section being ‘History (As of February, 2003)’, no Front-Cover Texts, and one Back-Cover Text: ‘The original version of this document was written by Robert L. Read without renumeration and dedicated to the programmers of Hire.com.’ A copy of the license is included in the section entitled ‘GNU Free Documentation License’.2002
Dedication
To the programmers of Hire.com.
Table of Contents
- 1. Introduction
- 2. Beginner
- Personal Skills
- Learn to Debug
- How to Debug by Splitting the Problem Space
- How to Remove an Error
- How to Debug Using a Log
- How to Understand Performance Problems
- How to Fix Performance Problems
- How to Optimize Loops
- How to Deal with I/O Expense
- How to Manage Memory
- How to Deal with Intermittent Bugs
- How to Learn Design Skills
- How to Conduct Experiments
- Team Skills
- Why Estimation is Important
- How to Estimate Programming Time
- How to Find Out Information
- How to Utilize People as Information Sources
- How to Document Wisely
- How to Work with Poor Code
- How to Use Source Code Control
- How to Unit Test
- Take Breaks when Stumped
- How to Recognize When to Go Home
- How to Deal with Difficult People
- 3. Intermediate
- 4. Advanced
- Technological Judgment
- Compromising Wisely
- Serving Your Team
- How to Develop Talent
- How to Choose What to Work On
- How to Get the Most From Your Teammates
- How to Divide Problems Up
- How to Handle Boring Tasks
- How to Gather Support for a Project
- How to Grow a System
- How to Communicate Well
- How to Tell People Things They Don’t Want to Hear
- How to Deal with Managerial Myths
- How to Deal with Organizational Chaos
- Glossary
- A.
- B. History (As Of February, 2003)
- C. GNU Free Documentation License
Could a vulnerability tax spur vendors to improve security?
He has recently been appointed as Apple’s global director of security and he is expected to begin his work in March, but former National Security Agency cryptographer and SANS instructor David Rice is already positioning himself on the frontline of the security debate by proposing a vulnerability tax as way to push software manufacturers to get (even) more serious about security.

Comparing it to a pollution tax, he wants the companies to pay for the damage they make with insecure software. He believes that such a tax could directly affect the users’ choices. “When insecure software starts costing more, people will adjust their behavior,” he said to Forbes.
He thinks that the tax would create a very strong incentive for companies to clean up their act and test their software more thoroughly.
“Software vulnerabilities, like pollution, are inevitable - producing perfect software is impossible. So instead of saying all software must be secure, we tax insecurity and allow the market to determine the price it’s willing to pay for vulnerability in software.”
He believes this solution would hit the problem at its root, but other security experts are not convinced - even as they agree with Rice on the need for software vendors to concentrate more on security.
Kurt Baumgartner, senior malware researcher at the Kaspersky Lab, thinks that the concept is flawed since it doesn’t take in consideration the fact that not all vulnerabilities are exploitable.
He also doesn’t see how the tax system could be instituted when the vendors themselves can’t find a way to quantifying the severity of their own vulnerabilities in order to agree on a standard.
Sophos security expert James Lyne doesn’t reject the idea, but is concerned about the impact it would have on product development and innovation in general.
“Such an initiative had to be managed carefully however, many brilliant technology platforms generating business value start of life as underdeveloped, under resourced applications,” he said to IT Pro.
Senior security researcher at the Kaspersky Lab David Jacoby is rather skeptic regarding the possibility of implementation of such a tax. He emphasized that not all vulnerabilities are the result of programming.
“Some vulnerabilities exist because of the local configuration of the server the application is running on,” he pointed out. Also, it would be difficult for somebody on the outside to evaluate how much the flaw really affects the client when they don’t have access to the information the server handles.
He also raised the question of what would happen if someone comes up with a new exploitation technique that affects all software written in a certain language. Technically, this is not the vendor’s fault. In short, he thinks that there are too many variables that would have to be taken in consideration in order for such a tax system to succeed.
Structure and Interpretation of Computer Programs - second edition #ebook #programming #electrical #engineering

This book is one of a series of texts written by faculty of the Electrical Engineering and Computer Science Department at the Massachusetts Institute of Technology. It was edited and produced by The MIT Press under a joint production-distribution arrangement with the McGraw-Hill Book Company.
Contents (edit: click one of the below)
1 Building Abstractions with Procedures
1.1 The Elements of Programming
1.1.1 Expressions
1.1.2 Naming and the Environment
1.1.3 Evaluating Combinations
1.1.4 Compound Procedures
1.1.5 The Substitution Model for Procedure Application
1.1.6 Conditional Expressions and Predicates
1.1.7 Example: Square Roots by Newton’s Method
1.1.8 Procedures as Black-Box Abstractions
1.2 Procedures and the Processes They Generate
1.2.1 Linear Recursion and Iteration
1.2.2 Tree Recursion
1.2.3 Orders of Growth
1.2.4 Exponentiation
1.2.5 Greatest Common Divisors
1.2.6 Example: Testing for Primality
1.3 Formulating Abstractions with Higher-Order Procedures
1.3.1 Procedures as Arguments
1.3.2 Constructing Procedures Using Lambda
1.3.3 Procedures as General Methods
1.3.4 Procedures as Returned Values
2 Building Abstractions with Data
2.1 Introduction to Data Abstraction
2.1.1 Example: Arithmetic Operations for Rational Numbers
2.1.2 Abstraction Barriers
2.1.3 What Is Meant by Data?
2.1.4 Extended Exercise: Interval Arithmetic
2.2 Hierarchical Data and the Closure Property
2.2.1 Representing Sequences
2.2.2 Hierarchical Structures
2.2.3 Sequences as Conventional Interfaces
2.2.4 Example: A Picture Language
2.3 Symbolic Data
2.3.1 Quotation
2.3.2 Example: Symbolic Differentiation
2.3.3 Example: Representing Sets
2.3.4 Example: Huffman Encoding Trees
2.4 Multiple Representations for Abstract Data
2.4.1 Representations for Complex Numbers
2.4.2 Tagged data
2.4.3 Data-Directed Programming and Additivity
2.5 Systems with Generic Operations
2.5.1 Generic Arithmetic Operations
2.5.2 Combining Data of Different Types
2.5.3 Example: Symbolic Algebra
3 Modularity, Objects, and State
3.1 Assignment and Local State
3.1.1 Local State Variables
3.1.2 The Benefits of Introducing Assignment
3.1.3 The Costs of Introducing Assignment
3.2 The Environment Model of Evaluation
3.2.1 The Rules for Evaluation
3.2.2 Applying Simple Procedures
3.2.3 Frames as the Repository of Local State
3.2.4 Internal Definitions
3.3 Modeling with Mutable Data
3.3.1 Mutable List Structure
3.3.2 Representing Queues
3.3.3 Representing Tables
3.3.4 A Simulator for Digital Circuits
3.3.5 Propagation of Constraints
3.4 Concurrency: Time Is of the Essence
3.4.1 The Nature of Time in Concurrent Systems
3.4.2 Mechanisms for Controlling Concurrency
3.5 Streams
3.5.1 Streams Are Delayed Lists
3.5.2 Infinite Streams
3.5.3 Exploiting the Stream Paradigm
3.5.4 Streams and Delayed Evaluation
3.5.5 Modularity of Functional Programs and Modularity of Objects
4 Metalinguistic Abstraction
4.1 The Metacircular Evaluator
4.1.1 The Core of the Evaluator
4.1.2 Representing Expressions
4.1.3 Evaluator Data Structures
4.1.4 Running the Evaluator as a Program
4.1.5 Data as Programs
4.1.6 Internal Definitions
4.1.7 Separating Syntactic Analysis from Execution
4.2 Variations on a Scheme — Lazy Evaluation
4.2.1 Normal Order and Applicative Order
4.2.2 An Interpreter with Lazy Evaluation
4.2.3 Streams as Lazy Lists
4.3 Variations on a Scheme — Nondeterministic Computing
4.3.1 Amb and Search
4.3.2 Examples of Nondeterministic Programs
4.3.3 Implementing the Amb Evaluator
4.4 Logic Programming
4.4.1 Deductive Information Retrieval
4.4.2 How the Query System Works
4.4.3 Is Logic Programming Mathematical Logic?
4.4.4 Implementing the Query System
5 Computing with Register Machines
5.1 Designing Register Machines
5.1.1 A Language for Describing Register Machines
5.1.2 Abstraction in Machine Design
5.1.3 Subroutines
5.1.4 Using a Stack to Implement Recursion
5.1.5 Instruction Summary
5.2 A Register-Machine Simulator
5.2.1 The Machine Model
5.2.2 The Assembler
5.2.3 Generating Execution Procedures for Instructions
5.2.4 Monitoring Machine Performance
5.3 Storage Allocation and Garbage Collection
5.3.1 Memory as Vectors
5.3.2 Maintaining the Illusion of Infinite Memory
5.4 The Explicit-Control Evaluator
5.4.1 The Core of the Explicit-Control Evaluator
5.4.2 Sequence Evaluation and Tail Recursion
5.4.3 Conditionals, Assignments, and Definitions
5.4.4 Running the Evaluator
5.5 Compilation
5.5.1 Structure of the Compiler
5.5.2 Compiling Expressions
5.5.3 Compiling Combinations
5.5.4 Combining Instruction Sequences
5.5.5 An Example of Compiled Code
5.5.6 Lexical Addressing
5.5.7 Interfacing Compiled Code to the Evaluator
Welcome to Rosetta Code #programming
Rosetta Code is a programming chrestomathy site. The idea is to present solutions to the same task in as many different languages as possible, to demonstrate how languages are similar and different, and to aid a person with a grounding in one approach to a problem in learning another. Rosetta Code currently has 455 tasks, and is aware of 357 languages, though we do not (and cannot) have solutions to every task in every language.
Managing Humans - An Introduction #programming #management
Great Story! - Click The Topic and Enjoy!
Also.. I want a copy!
How to Write a Spelling Corrector #spelling #programming #python
In the past week, two friends (Dean and Bill) independently told me they were amazed at how Google does spelling correction so well and quickly. Type in a search like [speling] and Google comes back in 0.1 seconds or so with Did you mean: spelling. (Yahoo and Microsoft are similar.) What surprised me is that I thought Dean and Bill, being highly accomplished engineers and mathematicians, would have good intuitions about statistical language processing problems such as spelling correction. But they didn’t, and come to think of it, there’s no reason they should: it was my expectations that were faulty, not their knowledge.
I figured they and many others could benefit from an explanation. The full details of an industrial-strength spell corrector like Google’s would be more confusing than enlightening, but I figured that on the plane flight home, in less than a page of code, I could write a toy spelling corrector that achieves 80 or 90% accuracy at a processing speed of at least 10 words per second.
(Edit: click title for full page!)



