Linux
Linux
"The DNS directory service consists of DNS data, DNS servers, and Internet
protocols for fetching data from the servers. The billions of resource
records in the DNS directory are split into millions of files called zones. Zones
are kept on authoritative servers distributed all over the Internet,
which answer queries according to the DNS network protocols. In contrast, caching
servers simply query the authoritative servers and cache any
replies. Most servers are authoritative for some zones and perform a caching
function for all other DNS information. Most DNS servers are
authoritative for just a few zones, but larger servers are authoritative for
tens of thousands of zones." -
What is DNS?
" The term Ethernet refers to the family of local-area network (LAN) products covered by the IEEE 802.3 standard that defines what is commonly known as the CSMA/CD protocol."
" The original Ethernet was developed as an experimental coaxial cable network in the
1970s by Xerox Corporation to operate with a data rate of 3 Mbps using a carrierxi
sense multiple access collision detect (CSMA/CD) protocol for LANs with sporadic butxi
occasionally heavy traffic requirements. Success with that project attracted early attentionxi
and led to the 1980 joint development of the 10-Mbps Ethernet Version 1.0 specificationxi
by the three-company consortium: Digital Equipment Corporation, Intel Corporation,xi
and Xerox Corporation." -
Internetworking Technology Handbook: Ethernet
Netfilter is the system compiled into the kernel which provides hooks into the IP stack
which loadable modules (e.g. iptables) can use to perform operations on packets.
IPTables consists of two parts: user-space tools and kernel-space modules.
The latter are distributed with the kernel, and include the main ip_tables module
as well as modules for NAT, logging, connection tracking, etc.
The former takes the form of the iptables binary, distributed separately from
the kernel and used to add, remove or edit rules for the various modules.
The netfilter/iptables project is the Linux 2.4.x / 2.5.x firewalling subsystem.
It delivers you the functionality of packet filtering (stateless or stateful),
all different kinds of NAT (Network Address Translation) and packet mangling.
" Internet Protocol (IP) multicast is a bandwidth-conserving technology that reduces traffic by simultaneously delivering a single stream of information to thousands of corporate recipients and homes. Applications that take advantage of multicast include videoconferencing, corporate communications, distance learning, and distribution of software, stock quotes, and news." - Internet Protocol Multicast
"Short for Point-to-Point Tunneling Protocol, a new technology for creating Virtual Private Networks (VPNs) , developed jointly by Microsoft Corporation, U.S. Robotics, and several remote access vendor companies, known collectively as the PPTP Forum. A VPN is a private network of computers that uses the public Internet to connect some nodes. Because the Internet is essentially an open network, the Point-to-Point Tunneling Protocol (PPTP) is used to ensure that messages transmitted from one VPN node to another are secure. With PPTP, users can dial in to their corporate network via the Internet." - Webopedia
"Short for Unix-to-Unix Copy, a Unix utility and protocol that enables one computer
to send files to another computer over a direct serial connection or via modems
and the telephone system. For most file transfer applications, UUCP has been
superseded by other protocols, such as FTP, SMTP and
NNTP." - Webopedia
"A private data network that makes use of the public telecommunication infrastructure,
maintaining privacy through the use of a tunneling protocol and security
procedures." - VPNC Glossary
UNIX/Linux Software
"Why is AWK so important? It is an excellent filter and report writer.
Many UNIX utilities generates rows and columns of information. AWK is
an excellent tool for processing these rows and columns, and is easier
to use AWK than most conventional programming languages. It can be
considered to be a pseudo-C interpretor, as it understands the same
arithmatic operators as C. AWK also has string manipulation functions, so it
can search for particular strings and modify the output. AWK also has
associative arrays, which are incredible useful, and is a feature most
computing languages lack. Associative arrays can make a complex problem a
trivial exercise." - Bruce Barnett (from
Awk)
CSS stands for Cascading Style Sheets and is a simple styling language which
allows attaching style to HTML elements. Every element type as well as every
occurance of a specific element within that type can be declared an unique
style, e.g. margins, positioning, color or size.
"IEEE 754-1985 governs binary floating-point arithmetic. It specifies number formats, basic
operations, conversions, and exceptional conditions. The related standard IEEE 854-1987
generalizes 754 to cover decimal arithmetic as well as binary." - IEEE 754 Group
"The Inter-Language Unification system (ILU) is a multi-language object interface system.
The object interfaces provided by ILU hide implementation distinctions between different
languages, between different address spaces, and between operating system types. ILU can
be used to build multi-lingual object-oriented libraries ("class libraries") with
well-specified language-independent interfaces. It can also be used to implement distributed
systems. It can also be used to define and document interfaces between the modules of
non-distributed programs. ILU interfaces can be specified in either the OMG's CORBA
Interface Definition Language (OMG IDL), or ILU's Interface Specification Language
(ISL). - Inter-Language Unification Page
"The IPC interface in BSD-like versions of Unix is implemented as a layer over the network
TCP and UDP protocols. Message destinations are specified as socket addresses; each socket
address is a communication identifier that consists of a port number and an Internet address.
The IPC operations are based on socket pairs, one belonging to a communication process.
IPC is done by exchanging some data through transmitting that data in a message between
a socket in one process and another socket in another process. When messages are sent,
the messages are queued at the sending socket until the underlying network protocol
has transmitted them. When they arrive, the messages are queued at the receiving
socket until the receiving process makes the necessary calls to receive
them." -
Sockets Programming in Java
"Sed is the ultimate stream editor. If that sounds strange, picture a stream
flowing through a pipe. Okay, you can't see a stream if it's inside a pipe.
That's what I get for attempting a flowing analogy. You want literature, read James Joyce.
Anyhow, sed is a marvelous utility. Unfortunately, most people never
learn its real power. The language is very simple, but the documentation is
terrible. The on-line manual pages for sed are five pages long, and two of
those pages describe the 34 different errors you can get. A program
that spends as much space documenting the errors that it does documenting
the language has a serious learning curve." - Bruce Barnett (from Sed)
"What is a shell, anyway? It's simple, really. The UNIX operating system is
a complex collection of files and programs. UNIX does not require
any single method or interface. Many different techniques can be used.
The oldest interface, which sits between the user and the software, is the
shell. Twenty five years ago many users didn't even have a video terminal.
Some only had a noisy, large, slow hard-copy terminal. The shell was
the interface to the operating system. Shell, layer, interface, these
words all describe the same concept. By convention, a shell is a user program
that is ASCII based, that allows the user to specify operations in a certain sequence.
There are four important concepts in a UNIX shell:
"A set of library routines that enable C programmers to describe arbitrary data structures
in a machine-independent way." -
External Data Representation: Technical Notes
XML is the Extensible Markup Language. It is designed to improve
the functionality of the Web by providing more flexible and adaptable information identification.
It is called extensible because it is not a fixed format like HTML
(a single, predefined markup language). Instead, XML is actually a
`metalanguage' - a language for describing other languages - hich lets
you design your own customized markup languages for limitless different
types of documents. XML can do this because it's written in SGML, the
international standard metalanguage for text markup
systems (ISO 8879). - XML FAQ
MathML is a low-level specification for describing mathematics as a basis for machine to machine communication.
SVG is a language for describing two-dimensional graphics and graphical applications in XML.
X3D is a powerful and extensible open file format standard for 3D visual effects, behavioral modelling and interaction. It provides an XML-encoded scene graph and a language-neutral Scene Authoring Interface (SAI). The XML encoding enables 3D to be incorporated into web services architectures and distributed environments, and facilitates moving 3D data between applications. The Scene Authoring Interface allows real time 3D content and controls to be easily integrated into a broad range of web and non-web applications.
XSL is a family of recommendations for defining XML document
transformation and presentation. It consists of three parts:
The XML User Interface Language (XUL) is a markup language for describing user interfaces.
Linux/UNIX Software
The original version of this document resides at
http://stommel.tamu.edu/~baum/programming.html.
From
The Linux System Administrator's Guide.
Can be installed from FreeBSD, Linux or DOS, and can
boot *BSD or Linux from the end
(greater than 8 Gb) of a single hard drive or from a second or later
hard drive.
Can boot OSs installed in primary and extended partitions on
any available hard disk.
Supports and can be installed from nearly all OSs, e.g. OS/2,
Windows, Linux DOS, *BSD, SCO, etc.
Designed to avoid BIO limitations by not using the BIOS, i.e. can be used
to boot from any place on a hard drive up to 137 Gb.
Works with the ext2 filesystem and IDE drives.
Uses something called UltraIO to "work with almost all x86 PCs,
operating systems and partition types."
The installation requirements are a PC clone, a hard disk and a
single FAT partition.
"Absolutely OS independent."
A boot loader that operates off an MS-DOS/Windows FAT filesystem, i.e.
it can (only) boot Linux from a FAT filesystem.
A kernel module that allows Linux to boot another kernel image into RAM
and restart the machine from that kernel.
Officially supoprts DOS, FreeBSD and Linux.
Supports BeOS, MS-DOS, FreeDOS, Linux (with LILO), Solaris,
VxWorks 5.x, Windows 95/98/ME, Windows NT/2000 and "others."
This also has many features not found in other freely available
boot manager.
This is a commercial offering that costs around $40. The
Amazon reviews indicate that it covers all the major available x86
operating systems except for Solaris x86. All the material therein is
probably covered in the following freely available entries, but if
you want it all in one place and can afford to part with the
Franklins, then there it is. I'm not paid a cent for any commercial
listings I may put in here, by the way.
To install Linux on a machine which already has Windows ME taking up
the entire hard disk, one must embark on a series of steps including
one - the repartioning step - that entails booting into real
DOS mode via ME. Bill Gates has
seen fit to hide this option in ME. This site offers a method of
working around this perfidious decision.
An article detailing how to use the patch described in the previous
entry.
Another method for booting into DOS from ME that requires a copy of
Windows 98.
Yet another option that entails creating a bootable floppy in ME, a
process that Gates has also deliberately made more difficult than it
used to be.
A recommended option for booting OpenBSD along with Windows 3.1,
Windows 95/98 and DOS.
A most helpful primer on hard drives and how they are partitioned.
How to multiboot OpenBSD and Windows NT using NTloader.
"Describes how to use NTLDR to boot Windows NT, Windows 98, Linux and
old versions of DOS using NTLDR."
"A MacOS application which boots the NetBSD/mac68k (and
OpenBSD/mac68k) operating system."
"MAP stands for Internet Message Access Protocol. It is a method of
accessing electronic mail or bulletin board messages that are kept on
a (possibly shared) mail server. In other words, it permits a "client"
email program to access remote message stores as if they were local.
For example, email stored on an IMAP server can be manipulated from a
desktop computer at home, a workstation at the office, and a
notebook computer while traveling, without the need to transfer messages
or files back and forth between these
compuuters." - What is IMAP?
"Lightweight Directory Access Protocol (LDAP) is an open-standard protocol for accessing X.500 directory services. The protocol runs
over Internet transport protocols, such as TCP.
LDAP is a lightweight alternative to the X.500 Directory Access Protocol (DAP) for use on the Internet. It uses TCP/IP stack verses the
overly complex OSI stack. It also has other simplications, such as the representing most attribute values and many protocol items as
textual strings, that are designed to
make clients easier to implement." -
OpenLDAP Faq-O-Matic
To support files larger than 2 GiB on 32-bit systems,
e.g. x86, PowerPC and MIPS, a number of changes to kernel and
C library have to be done. This
is called Large File Support (LFS). The support for LFS is not yet
complete in Linux and this article should give a short
overview of the current
status.
The complete text of the configuration help files for kernels
1.2.x through 2.2.x.
"GGI stands for "General Graphics Interface", and it is a project that aims to develop a reliable, stable and fast graphics system that
works everywhere. We want to allow any program using GGI to run on any platform requiring at most a recompile."
"Explores important network design
issues for today's modern mixed intranets. The authors
discuss many different platforms, including
Windows 95, Windows 98, Windows NT, OS/2 Warp, OS/2 Warp Server,
AIX, Macintosh, WorkSpace
On-Demand, Linux, Solaris, and others. The [536 page] book examines how
to connect these systems in a reliable,
flexible, high-performance TCP/IP network."
"A networking-centric micro-distribution of Linux that can be used in place of a traditional router. LRP is small enough to fit on a single floppy disk, and makes building and maintaining routers, bridges, firewalls, switches, and access servers very easy."
The original version of this document resides at
http://stommel.tamu.edu/~baum/programming.html.
This FAQ contains x86 assembly language information common
to all assemblers.
A PDF document.
"The tutorial has extensive coverage of interfacing assembly
and C code and so might be of interest to C programmers who
want to learn about how C works under the hood. All the
examples use the free NASM (Netwide) assembler. The
tutorial only
covers programming under 32-bit protected mode and
requires a 32-bit protected mode compiler."
"This document describes the basics of assembly language
programming for the Intel 80x86 microprocessors. It is
geared towards using the freely available NetWide
Assembler, NASM, to generate programs that will run
under MS-DOS. As such, it will concentrate on producing
16-bit .COM programs, using only the facilities that have
been present since the original 8086."
"In this tutorial I will attempt to show you how you can use
assembly language writing Unix programs,
specifically under FreeBSD.
This tutorial does not explain the basics of assembly
language. ... However, once the tutorial is finished,
any assembly language programmer will be able to write
programs for FreeBSD quickly and efficiently."
An extended and annotated version of the previous entry.
A free account must be established to view this.
A free acount must be established to view this.
A PDF version of the following entry.
An HTML version of the previous entry.
"This is a glossary of C++ terms, organized alphabetically by concept."
"alt.comp.lang.learn.c-c++ is a self-moderated newsgroup for the
discussion of issues that concern novice to intermediate C and C++
programmers."
"What follows is a set of rules, guidelines, and tips that we
have found to be useful in making C++ code portable across
many machines and compilers.
This information is the result of porting large amounts of
code across about 25 different machines, and at least a dozen
different C++ compilers.  But this is the reality of
portable code.
If you play by the rules, your code will seamlessly work
on all of the Mozilla platforms and will be easy to port to newer
machines."
Requires free registration to view.
"Meant for programmers making the transition from BASIC or Pascal to
C or C++."
"For knowledgeable users of C who would like to make the transition to
C++."
"Some general guidelines for avoiding some of the more common
mistakes that will cause code bloat."
"A template idiom providing a class which allows us to wrap an
instance of another class, maintaining access to that class's members,
but adding functionality in a way that is transparent to the wrapped
class."
A technique for writing programs in a subset of C++ which are interpreted
at compile time, e.g. language features such as for loops and if statements
can be replaced by template specialization and recursion.
"A C++ technique for passing expressions as function arguments."
Requires free registration for access.
Requires free registration for access.
Requires free registration for access.
Requires free registration for access.
Requires free registration for access. The angry badger quelled
our fears by pontificating about interfrastic counterfactuals.
"This handout should serve you only as a reference to the commands of
Fortran in the ANSI 77, 90 and 95 standards.
Only rudimentary examples are given to remind you of the syntax, and some
tedious details that you are not expected to remember are
tabulated for reference purposes."
"This guide concentrates on topics which are not discussed in
ordinary Fortran courses and regular textbooks: good programming
practices, and various technical and numerical issues."
"The Fortran Journal is no longer published. However, a few old issues
are available online."
This one has been lost to the ages, although leaving it in allows me to spot
those who
borrow this page without attribution.
"Solves some compatibility problems of the f2c Fortran-to-C
translator and other f77-extended-standard compilers."
From the Sun
Fortran Programmer's Guide.
"Pyfort is a tool for connecting Fortranroutines to Python."
"A Python program that generates Python C/API modules wrapping
Fortran 77/90/95 codes to Python."
"So I conclude that 754 is a virus, infecting individual programs, and making
them unable to run on non-IEEE-754 hardware."
"This directory contains a small collection of test programs for examining the
behavior of IEEE 754 floating-point arithmetic, together with test input andxi
output files. There are also a few additional test programs for other data types."
"A precision and range independent tool to test whether an implementation of
floating-point arithmetic (in hardware or software) is compliant with the
principles of the IEEE floating-point standard."
"A free, high-quality software implementation of the IEC/IEEE Standard for
Binary Floating-point Arithmetic."
"A program for testing whether a computer's floating-point conforms to the
IEC/IEEE Standard for Binary Floating-point Arithmetic."
ipchains
iptables
PostScript version.
"A wrapper generator for matrix languages."
"Inline.pm is a new module that glues other programming languages to Perl. It allows you to write C, C++,
and Python code directly inside your Perl scripts and modules."
"A C++ library which enables seamless interoperability between C++
and the Python programming language."
"SIP is a tool that makes it very easy to create Python bindings for C++ libraries."
"Pyrex lets you write code that mixes Python and C data types any way
you want, and compiles it into a C extension for Python."
"The weave package allows the inclusion of C/C++ within Python code."
"SILOON (Scripting Interface Languages for Object-Oriented Numerics) gives users the
ability to rapidly prototype their scientific codes in a simple yet elegant fashion using the
popular scripting languages Python and Perl. While programming in these flexible and dynamic
languages, SILOON users maintain the capability of accessing the full power and complexity
of C++ and FORTRAN 90 libraries executed on high-performance parallel
computers."
A project to create an integrated messaging, scheduling, and parallel programming API
together with syntax and semantics to support the emerging computational
hierarchies of node architectures and gigabit/s networks efficiently.
The OpenMP Application Program Interface (API) supports multi-platform shared-memory
parallel programming in C/C++ and Fortran on all architectures, including Unix
platforms and Windows NT platforms. Jointly defined by a group of major computer
hardware and software vendors, OpenMP is a portable, scalable model that gives
shared-memory parallel programmers a simple and flexible interface for developing
parallel applications for platforms ranging from the desktop to the supercomputer.
"An object-oriented 3D toolkit offering a comprehensive solution to
interactive graphics programming problems."
"Using Open Inventor to create 3D scenes and animation effects."
"Describes how to create new classes and how to customize existing
classes in the Open Inventor toolkit."
"A powerful and comprehensive programming interface for developers creating
real-time visualization and other performance-oriented 3D graphics
applications."
"A development environment used to build portable 2D/3D/stereo high
performance graphics, virtual reality, visualization applications and
games for UNIX/X11 and Win32 platforms."
"A high-level 3D graphics library which offers binary and source
level compatibility with Apple's Quickdraw 3D API."
"A high performance 3D scene graph and effect visualization toolkit for
Linux, Win32 and IRIX."
"A graphics library designed for drawing two or three dimensional graphics
of a scalar function of two variables and a two dimensional vector field
on a variable grid."
A book available in PDF format.
RTF format only.
A detailed guide to the basic workings of Microsoft's SMB/CIFS
protocol suite.
Covers NBT, SMB, NBNS/WINS, the Network Neighborhood, and
Authentication.
Provides all the information needed to build a working SMB/CIFS
client to interoperate with Samba and MS-Windows Servers.
Elk is an implementation of the Scheme programming language. In contrast to existing, stand-alone Scheme systems Elk has been designed
specifically as an embeddable, reusable extension language subsystem for applications written in C or C++.
This document is an attempt to fully describe the SCSI subsystem in the Linux kernel. At the time of this writing, the document is incomplete in the sense
that there are many sections of this document that are not yet written.
This is a three page PDF file.
"Shell has emerged as a family of programming languages for the
UNIX Operating System in the same sense that JCL emerged as a
programming language for mainframe job control in the 1960s. It is a
family of languages because we find variant syntaxes and capabilities in the
Bourne shell, the Korn shell, the C shell, and others. Most of the patterns
described here apply equally well to all these variants.
These patterns do not form a full pattern language nor are they a
comprehensive collection of patterns for the "architecture" of a Shell program.
They cover frequent Shell programming problems that often are resolved
only with expert insight."
The Open Group Single UNIX Specification's definition of the
XSI Shell Command Language.

"Eshell is a command shell implemented entirely in Emacs Lisp.
It invokes no external processes beyond those requested by the
user. It is intended to be a functional replacement for command shells
such as bash, zsh, rc, 4dos; since Emacs itself is capable of
handling most of the tasks accomplished by such tools."
"The standard
interpreter associated with the hush library is a
shell, called hush, including a number of the available extensions of
Tcl/Tk and widgets developed by ourselves (such as a www and a video
widget). The hush library offers a C++ interface to the Tcl/Tk toolkit
and its extensions. It allows the programmer to employ the
functionality of Tcl/Tk in a C++ program."
Scsh is
a Scheme shell, i.e.
a Unix shell which uses Scheme
as its scripting language.
"The OpenACS toolkit is a PostgreSQL port of the ArsDigita
Community System, a comprehensive Open Source toolkit for building
Web sites backed by Oracle."
The author says these online notes are obsolete, although
a more current
version is available in PS and PDF format.
"FXDR is a library that allows you to make calls to the XDR (eXternal Data Representation) routines from Fortran."
A set of HTMLized X11 man pages with internal crosslinks.
This is a PDF document.
Part of
Coping with UNIX: A Survival Guide.
SVG profiles suitable for cellphones (Tiny) and PDAs (Basic).
A version of SVG specifically suited to hard-copy output.
The original version of this document resides at
http://stommel.tamu.edu/~baum/programming.html.


public class BCrypt
extends java.lang.Object
This password hashing system tries to thwart off-line password cracking using a computationally-intensive hashing algorithm, based on Bruce Schneier's Blowfish cipher. The work factor of the algorithm is parameterised, so it can be increased as computers get faster.
Usage is really simple. To hash a password for the first time, call the hashpw method with a random salt, like this:
String pw_hash = BCrypt.hashpw(plain_password, BCrypt.gensalt());
To check whether a plaintext password matches one that has been hashed previously, use the checkpw method:
if (BCrypt.checkpw(candidate_password, stored_hash))
System.out.println("It matches");
else
System.out.println("It does not match");
The gensalt() method takes an optional parameter (log_rounds) that determines the computational complexity of the hashing:
String strong_salt = BCrypt.gensalt(10)
String stronger_salt = BCrypt.gensalt(12)
The amount of work increases exponentially (2**log_rounds), so each increment is twice as much work. The default log_rounds is 10, and the valid range is 4 to 30.
| Modifier and Type | Field and Description |
|---|---|
private static char[] |
base64_code |
private static int |
BCRYPT_SALT_LEN |
private static int[] |
bf_crypt_ciphertext |
private static int |
BLOWFISH_NUM_ROUNDS |
private static int |
GENSALT_DEFAULT_LOG2_ROUNDS |
private static byte[] |
index_64 |
private int[] |
P |
private static int[] |
P_orig |
private int[] |
S |
private static int[] |
S_orig |
| Constructor and Description |
|---|
BCrypt() |
| Modifier and Type | Method and Description |
|---|---|
private static byte |
char64(char x)
Look up the 3 bits base64-encoded by the specified character,
range-checking againt conversion table
|
static boolean |
checkpw(java.lang.String plaintext,
java.lang.String hashed)
Check that a plaintext password matches a previously hashed
one
|
byte[] |
crypt_raw(byte[] password,
byte[] salt,
int log_rounds,
int[] cdata)
Perform the central password hashing step in the
bcrypt scheme
|
private static byte[] |
decode_base64(java.lang.String s,
int maxolen)
Decode a string encoded using bcrypt's base64 scheme to a
byte array.
|
private void |
ekskey(byte[] data,
byte[] key)
Perform the "enhanced key schedule" step described by
Provos and Mazieres in "A Future-Adaptable Password Scheme"
http://www.openbsd.org/papers/bcrypt-paper.ps
|
private void |
encipher(int[] lr,
int off)
Blowfish encipher a single 64-bit block encoded as
two 32-bit halves
|
private static java.lang.String |
encode_base64(byte[] d,
int len)
Encode a byte array using bcrypt's slightly-modified base64
encoding scheme.
|
static java.lang.String |
gensalt()
Generate a salt for use with the BCrypt.hashpw() method,
selecting a reasonable default for the number of hashing
rounds to apply
|
static java.lang.String |
gensalt(int log_rounds)
Generate a salt for use with the BCrypt.hashpw() method
|
static java.lang.String |
gensalt(int log_rounds,
java.security.SecureRandom random)
Generate a salt for use with the BCrypt.hashpw() method
|
static java.lang.String |
hashpw(java.lang.String password,
java.lang.String salt)
Hash a password using the OpenBSD bcrypt scheme
|
private void |
init_key()
Initialise the Blowfish key schedule
|
private void |
key(byte[] key)
Key the Blowfish cipher
|
private static int |
streamtoword(byte[] data,
int[] offp)
Cycically extract a word of key material
|
private static final int GENSALT_DEFAULT_LOG2_ROUNDS
private static final int BCRYPT_SALT_LEN
private static final int BLOWFISH_NUM_ROUNDS
private static final int[] P_orig
private static final int[] S_orig
private static final int[] bf_crypt_ciphertext
private static final char[] base64_code
private static final byte[] index_64
private int[] P
private int[] S
private static java.lang.String encode_base64(byte[] d, int len) throws java.lang.IllegalArgumentException
d
- the byte array to encodelen
- the number of bytes to encodejava.lang.IllegalArgumentException
- if the length is invalidprivate static byte char64(char x)
x
- the base64-encoded valueprivate static byte[] decode_base64(java.lang.String s, int maxolen) throws java.lang.IllegalArgumentException
s
- the string to decodemaxolen
- the maximum number of bytes to decodejava.lang.IllegalArgumentException
- if maxolen is invalidprivate final void encipher(int[] lr, int off)
lr
- an array containing the two 32-bit half blocksoff
- the position in the array of the blocksprivate static int streamtoword(byte[] data, int[] offp)
data
- the string to extract the data fromoffp
- a "pointer" (as a one-entry array) to the
current offset into dataprivate void init_key()
private void key(byte[] key)
key
- an array containing the keyprivate void ekskey(byte[] data, byte[] key)
data
- salt informationkey
- password informationpublic byte[] crypt_raw(byte[] password, byte[] salt, int log_rounds, int[] cdata)
password
- the password to hashsalt
- the binary salt to hash with the passwordlog_rounds
- the binary logarithm of the number
of rounds of hashing to applycdata
- the plaintext to encryptpublic static java.lang.String hashpw(java.lang.String password, java.lang.String salt)
password
- the password to hashsalt
- the salt to hash with (perhaps generated
using BCrypt.gensalt)public static java.lang.String gensalt(int log_rounds, java.security.SecureRandom random)
log_rounds
- the log2 of the number of rounds of
hashing to apply - the work factor therefore increases as
2**log_rounds.random
- an instance of SecureRandom to usepublic static java.lang.String gensalt(int log_rounds)
log_rounds
- the log2 of the number of rounds of
hashing to apply - the work factor therefore increases as
2**log_rounds.public static java.lang.String gensalt()
public static boolean checkpw(java.lang.String plaintext, java.lang.String hashed)
plaintext
- the plaintext password to verifyhashed
- the previously-hashed password


Go to index page.
gif2ps
GIF-to-PostScript conversion.
Usage:
gif2ps [-q] [-x] [-y] [-s sx sy] [-p px py] [-i] [-n copies] [-h] gif-file
If no gif-file is given, Gif2PS will try to read a GIF file from stdin.
Memory required:
Line.
Options:
- [-q]
- quiet mode. Defaults off on MSDOS, on under UNIX. Controls printout
of running scan lines. Use -q- to invert.
- [-x]
- Force image to be horizontal (`landscape mode'). By default image
will be positioned so it will be the biggest. If -x is given image will be
scaled to be biggest possible horizontally.
- [-y]
- Force vertical (`portrait mode'); analogous to -x.
- [-s sx sy]
- Force image size to be sx by sy inches.
If image will exit page dimensions, it will scream and die.
Page dimensions are 8.5 by 11.0 inches but only 7.5 by 9.0 are assumed to
be printable.
- [-p pc py]
- Force image lower left corner to be as px py.
If this would overrun the page's dimensions, it will scream and die.
- [-i]
- Image will be inverted (Black -> White and vice versa).
Mapping from colors is done by 0.3 * RED + 0.59 * GREEN + 0.11 * BLUE
and sometimes inverting the image will look better.
- [-n copies]
- Number of copies to print. 1 by default.
- [-h]
- Print one line of command help, similar to Usage above.
Author:
Gershon Elber
Eric S. Raymond <esr@snark.thyrsus.com>


Late 1990’s was the Age of Ecommerce – Amazon.com & Ebay – creating new model of Commerce
Garage – birthplace of Amazon.com – Jeff Bazos, - 1995 launched Amazon – more books
Pier Omidiyare – Ebay; no business plan – Sept 1995 – in home office – started writing a code;
Both Ebay and Amazon were successful.
Mid 1990’s Moore’s Law & Metcalf’s Law – resulted in success of Internet
Multiple lines of text that form the lede, informing new readers quickly and efficiently about what’s most interesting in this post’s contents.
Metcalf’s Law – as number of users increases,
Amazon – Jeff would lower price whenever could; Get big fast for Amazon; next was credit card encryption; online commerce- a group of mathemticians developed public key cryptography; took several years of internet friendly version of padlock box analogy; Public key is used to encrypting; private key – combination used by receiver – take encrypted data – decrypt it and secure the message; Jeff Baso persuaded Wall Street; ebay went to Meg Whitman for funding
Dept 1998 – ebay was going to go IPO; ebays stocks soared first day; end of first day company worth more than $2billion
Henry Blodget – predicted amazon’s stock would double – it doubled in a few weeks; Era of madness began – people were going to brokers and buying any stock with .com;
Stock Market – Day traders were making market look like a Casino; It became a national sport and obsession.
The 90’s had become the E decade – a new ecommerce venture was brought into the world; So many companies with names with .com; They knew most of them were doomed from birth and that one would survive;
Henry Blodget would write emails supporting these companies even though he knew they would not survive. Venture capitalists were supporting these companies because they knew one out of the number of them would survive; INterent boom turned into speculative bubble ;
Another boom – Telecommunications; companies racing to put fiber optic cable to support demand of bandwith that made internet go. Fiber -strand of glass thin as human hair that carries light; fiber coated with mirror surface that keep light inside;
Fiber optic cables can carry 10 billion pulses of digital data per second; Firms laying all fiber got way ahead of themselves, too much building, spending, & no thoughts of cost & consequences; 1995 – 35 by 1999 – internet IPOs 250;
Amazon employee – Jeff would tell us – do not keep an eye on the stock price; Time Magazine – put Jeff Basos as body of ecommerce;
Epicenters of Internet bubble; silicon Valley and Wall Street;
Chairman of Fed Reserve Bank- Alex Greenspan – He believed that technology was creating a new economy – he decided time had come to cool things down - Feb 2000 & March 2000; feds raised interest rates at highest since 1995. Determined to put Bubble to an end; April 14th 2000- black Friday, NASDAQ fell 355 points; single greatest collapse; 18 months after that – Sept 11 happened; Many .com companies were dead.
NY’s Attorney General Elliot Spitzer – tried to reform IPO industry and punish villains (Martha Stewart and Henry Blodget- wall street analyst); US Securities charged Henry Blodget with fraud and he was banned for life; - using critical emails as support – he was charged with Civil Securities fraud;
5 years later – bitterness subsided; moment seemed like temporary insanity;
Great .Com Crash of 2000 and 2001- 3 and a half trillion dollars evaporated in one year;
A handful of companies survived; Amazon and ebay did something very different- user experience; Amazons policy of letting readers write uncensored book reviews; Amazon was in the business of customer service; focus on their customers;
Grove said - This .com bubble helped built the infrastructure – it happened over 5 years instead of 15.


This github repository and associated githubio pages track and document exploration of what works, and does not work, creating Fritzing parts, then attempting to export the views as svg images.
When creating Fritzing documents of circuits, then exporting the views to svg images, some content gets dropped. This is seen mostly for custom parts. Since the content does get included when exporting to png or jpeg images, there appears to be a problem with the svg export code. However, since most parts export correctly, there is also some interaction with the way the parts have been created. This is some exploration of that. The svg and fzp files that go into an fzpz part file are manipulated in various ways.
The svg export also gets the automatic text rotation wrong for both part rotations and flips. The schematic view, and png export look correct.
Environment
See FZP format for a lot of useful details.
Typically SVG files use 90 pixels per inch, but Illustrator uses 72 pixels per inch. Fritzing might figure it out correctly, but editing the svg element to set the width and height attributes in inches (in) can work around the difference.1
Terminal elements are optional in breadboard view.2 When they do not exist, the centre point of the connector pin graphics is used.
See About SVGs
html style comments in the source svg file get carried through to the view export svg.
the snapped 'zero' position varies a small amount from build to build, although the breadboard svg file was not touched.
<!-- Generator: Adobe Illustrator 15.0.2, SVG Export Plug-In . SVG Version: 6.00 Build 0) -->
The template does not include a doctype, but does have the xmlns:inkscape attribute in the svg tag.
The template does not include an enable-background attribute
The svg element has a Layer_1
id
There are 3 top level groups, with ids of background, help, and schematic
There are no references to connector or terminal
<!-- Generator: Adobe Illustrator 15.1.0, SVG Export Plug-In . SVG Version: 6.00 Build 0) -->
Despite that, the svg tag includes an xmlns:inkscape attribute. The x, y, width, height attributes are in pixels (px), starting from (0,0). The viewBox and enable-background use the same coordinates, without units.
The top level group wrapper <g id="schematic">
contains a single group <g id="layer1">
plus a pair of rectangle objects for each connection pin. The rectangles have ids of "connector«pinNumber»
" and "connector«pinNumber»terminal
". These are NOT part of the layer1 group, and do not have any stroke or style information. Fill is set to none
. The pin numbers are not sequential, but match the (zero based) pin positions for a 14 pin DIP chip. Other svg files have connector«n» ids, but only svg also has the terminals.
The layer1 group has a transform attribute that translates by a fairly large amount (-202,-376). In addition to the graphics for the part, it contains line elements (nested in more groups) with stroke="#787878"
for the connector lines. These do NOT have an id
To match the standard 0.1 inch snap grid, the complete schematic graphics should start at (0,0), and be multiples of 0.1 in width and height. That will be multiples of 7.2 or 9.0 px. Rectangular schematic symbols that have pin connections around the outside should have a background rectangle that matches the viewBox, but inset by 0.1 inch on each side that any connection pins exist. That inset needs to be adjusted by an addition 0.5 of the background rectangle stroke width (which could be zero). That means adding 0.5 * stroke width to the x and y rect element coordinates, and subtracting 1.0 * stroke width from the width and height.
Fritzing aligns (at least) the schematic symbol position (origin) based on the (first?) detected pin location. Not on the viewBox origin. Symptoms make it look like the viewBox origin is not on a grid boundary, but the terminal end of the first pin is.
Graphics content in the schematic svg file that is NOT inside of the schematic (id) group is visible in the Fritzing view, but does not get exported to the svg image. However, it DOES get exported to png. Exporting to png even includes the current highlight / selected element dashed border. Is the whole problem simply graphics that is not inside the appropriate view/layer group? connector«n»terminal graphics is fine outside of the group, because that is functionality for Fritzing, and does not show on the export anyway.
If there are no top or bottom schematic pin connections, the height of the graphics does not need to be a multiple of 0.1 inch, and the side pin connections do not need to be a multiple of 0.1 inch from the top. They still needed to be separated vertically by multiples of 0.1 inch.
defs and use tags give in file reusable block, and look good in Fritzing. However, the defs element does not get exported with the rest of the view svg. The use elements do (assuming other constraints valid), but without the defs, they are invisible.
After rotate, drag to make sure pin locations get snapped to grid.
Example data values
See More SVG topics for a few PCB specific svg rules and options.


MIDF Research: Malaysia’s GDP to see moderate growth of 4.7pc in Q3
KUALA LUMPUR, Nov 13 — MIDF Amanah Investment Bank Bhd Research (MIDF Research) has forecast Malaysia’s gross domestic product (GDP) to expand at a moderating pace of 4.7 per cent year-on-year (y-o-y) for the third quarter of this year compared with 4.9 per cent y-o-y growth in the preceding quarter.
In a research note today, MIDF Research said moderation in private consumption in particular, as a result of higher base effect last year following a tax holiday, would contribute to the slower pace.
“Nevertheless, robust net export and increasing government spending would partially cushion the impact,” it said.
Overall, the research firm said Malaysia’s economic activities are predicted to continue expanding amid resilient domestic spending and challenging external trade performances.
“Moving forward, we view continuous expansionary momentum, particularly with solid domestic demand, lower overnight policy rate effects, stable job market, low inflationary pressure and gradual pick-up of commodity prices this year.
“On top of that, the easing monetary policy by major countries may act as a factor to push demand for goods,” it said.
However, the research house noted that trade spat between the US and China remained a downside risk to export-oriented economies, including Malaysia’s.
“The uncertainties over the US-China trade agreement persist as the duo have not signed anything yet,” it said. — Bernama


--- layout: default title: Rackspace Developer Center | developer+ ---
Our SDK and API developers quickly answer your questions over IRC, Twitter, email, and forums.
Get $50/month for 12 months to use toward our cloud services.
Pay only for the infrastructure you use beyond $50/month. No monthly service level fees.
Explore, build, and deploy to production. We're here to help you grow your application from concept to reality.
Use any cloud service you want, with no restrictions beyond standard usage and rate limits. We want you to have a great experience!
If you can develop it, our robust cloud platform can support it. Let us know if you need help setting anything up!
Plus, a lot more!


wasm moving to require explicit drop
⇒ spec can be written equivalently as either
AST + explicit drop
or
stack machine + restrictions
# binary format
block-begin # block markers before and after,
i32.const 1 # but most stuff is basically a stack machine
get_local 3
i32.add
drop # value is not used, so drop it from the stack
block-end
# AST representation
(block
(drop # AST could in principle work without this
(i32.add
(i32.const 1)
(get_local 3)
)
)
)
# natural text format
{
1 + $3; # maybe add drop()?
}
1-1 mapping to AST limits set of valid programs
i32.const 0
block-begin
i32.const 1
i32.add # ! invalid: can't pop from outside the block
(i32.const 0)
(block
(i32.add
(i32.const 1)
# .. because we can't grab that first i32.const ..
)
Non-returning operators - store, set_local, etc. - limit popping:
i32.const 0
i32.const 1
i32.const 2
i32.store # store 1 to address 2
i32.const 3
i32.add # ! invalid: want to add 0 to 3, but can't pop from
# before a non-returning operator like store
(i32.add
(i32.const 0)
# .. because store+args should go here in order of operations ..
(i32.const 3)
)
(it seems like we could just write the store before, but imagine the consts were e.g. calls which have side effects)
Suggestions have come up to eliminate these restrictions (now or later)
That would mean wasm is a more general stack machine, and no longer equivalent to an AST
We would lose some of the current structural guarantees in return for flexibility
block-begin
[..]
i32.const 0
i32.const 1
i32.store
In a restricted stack machine / AST, we know at this point that the store is on the current block, and that nothing after it can pop stuff before it
Non-returning operators like store, set_local, etc. are "midpoint markers" in the block, they separate it into independent units:
block-begin
[..]
i32.const 0
i32.const 1
i32.store
# block-midpoint
[..]
set_local 5
# block-midpoint
[..]
block-end
Same structure as if each midpoint ended a block and began a new one
Discussing with Lars, midpoint markers might help baseline JITs in a few ways
One is that context tracked til the end of the block could be flushed earlier (better for locality, etc.)
Could help e.g. regalloc
Another is that opcodes after a midpoint are very limited: nothing that pops, so no binaries or unaries, etc.: only 15 / 168
And probably most of those are get_local, const
Current baseline has this:
switch (nextOpcode) {
case get_local: ..
case i32_add: ..
..
}
can experiment with this (after midpoints):
if (nextOpcode == get_local) ..
else ..the switch..
Structure can help compression
Layer 1 compression would start as userspace, and hopefully get standardized later
Intuitively, after a midpoint marker we have fewer possible opcodes (15/168), as we saw, can save bits
Like JSZap, use the actually necessary # of bits at each point
For a br offset, use enough bits for the current label stack
For a function call, use enough bits for the # of functions
Results: saves 22% on BananaBread, 33% on libc++
Now take into account AST structure: For opcodes, need 8 bits normally, but 4 bits after a midpoint marker
Saves a further 5% on BananaBread, 8% on libc++
Text format: General stack machine stuff is tricky
# same example from before
i32.const 0
block-begin
i32.const 1
i32.add # pop from outside the block
let $temp = 0; # how about this?
{
1 + $temp;
}
"let" operator creates a temporary variable that can only be used once
and only in the order of popping
let $temp = 0;
{
$temp + 1; # ! invalid if flipped
1 + $temp; # ! invalid to use it again
}
Or maybe just add push/pop to the language?
push(0);
{
1 + pop();
}
Less confusing perhaps, but still?
# also same as before
i32.const 0
i32.const 1
i32.const 2
i32.store # store 1 to address 2 (store is non-returning)
i32.const 3
i32.add # pop from before the store
0 + ( i32.store [1, 2], 3 ) # how about this?
"comma" operator; compare to just using a normal block there:
0 + { i32.store [1, 2], 3 }
That code already worked before (wasm blocks were designed so they can implement comma-style patterns), and is functionally equivalent, but not identical
And further stack machine operations add more "interesting" things, like pick, dup, etc.
For the text format, maybe the question is: What is the state of the art on decompiling stack machine code?
Removing restrictions allows more programs to be written - are they useful? Smaller?
Can implementations be better without the restrictions?
All worth exploring
i32.const 0
block-begin
i32.const 1
i32.const 2
i32.add # this can pop ok per AST rules
i32.add # ! but this is invalid
[..]
We must check we have something to pop anyhow: both of those adds must have a check, with or without the AST structure requirement


--- layout: page title: Fogo IO Docs --- {% include JB/setup %}
#include <Location.hpp>
The Location API allows access to all the GPS data.
Definition at line 23 of file Location.hpp.
Public Types | |
| enum | { MODE_PERF = LOCATION_MODE_PERFORMANCE, MODE_STANDARD = LOCATION_MODE_STANDARD, MODE_LOW_POWER = LOCATION_MODE_LOW_POWER } |
| enum | { FIX_TYPE_NONE = 0, FIX_TYPE_DEAD_RECKONING = 1, FIX_TYPE_2D = 2, FIX_TYPE_3D = 3, FIX_TYPE_3D_PLUS_DEAD_RECKONING = 4, FIX_TYPE_TIME_ONLY = 5 } |
| List of Fix Types. More... | |
Static Public Member Functions | |
| static int | init (void) |
| Initialize access to the Location API (call once) | |
| static int | enable (bool v=true, uint8_t mode=MODE_STANDARD) |
| Enable the GPS in the specified mode. | |
| static int | update (void) |
| Updates location data (call before using fix_type(), coord(), velocity(), etc) | |
| static int | log_enable (bool v=true, int interval=1) |
| Enable GPS data logging in GPX format (create a new file) | |
| static int | log_pause () |
| Pause data logging (don't close the file) | |
| static int | log_resume (int interval=1) |
| Resume data logging (continues writing to open file) | |
| static int | log_disable () |
| Disable data logging (close the target logging file) | |
| static bool | log_enabled () |
| Returns true is logging is on. | |
| static uint32_t | log_interval () |
| Returns the interval in seconds between log entries (0 if paused) | |
| static bool | log_paused () |
| Returns true if the log is paused. | |
| static uint32_t | log_elapsed () |
| Returns the number of seconds since the log started (includes pauses) | |
| static int | odo_enable (bool v=true) |
| Enable the odometer. | |
| static int | odo_reset () |
| Reset the odometer. | |
| static int | odo_disable () |
| Disable (pause) the odometer. | |
| static loc_coord_t | coord () |
| Return the current position (lat, lon, elevation) | |
| static loc_ecef_t | ecef () |
| Return the current position (earth centered coordinates) | |
| static time_t | time () |
| Return GMT time from GPS. | |
| static float | heading () |
| Return the heading of motion (0 to 360 degrees) | |
| static loc_velocity_t | velocity () |
| Return the current velocity (speed and heading) | |
| static uint32_t | odometer () |
| Return the current odometer value. | |
| static uint32_t | odo () |
| Return the current odometer value. | |
| static int | fix_type () |
| Return the fix type. | |
| static int | sats_tracked () |
| Return the number of satellites being tracked. | |
| static int | sats_in_view () |
| Return the number of satellites in view. | |
| static int | sat_signal_strength (size_t s) |
| Return the signal strength of the specified satellite in view. | |
| static int | sat_id (size_t s) |
| Return the ID of the specified satellite in view. | |
| static float | distance (const loc_coord_t &coord0, const loc_coord_t &coord1) |
| Returns the distance between the coordinates in meters. | |
| static float | bearing (const loc_coord_t &coord0, const loc_coord_t &coord1) |
| Returns the bearing from coord0 to coord1. | |
| static const char * | bearing (float bearing) |
| Converts a bearing (0 to 360) to a text version: N,S,E,W,NE,etc. | |
| static loc_coord_t | pan (const loc_coord_t &coord, float d_lon, float d_lat) |
| Pan from a coordinate. More... | |
| static float | ltof (int32_t d) |
| Convert fixed point degree to a float. | |
| static float | convert_dist (uint32_t mm, char *units=0) |
| Convert a distance. More... | |
| anonymous enum |
| Enumerator | |
|---|---|
| MODE_PERF |
High performance mode 10Hz. |
| MODE_STANDARD |
Standard mode 1Hz. |
| MODE_LOW_POWER |
Low power mode (?) |
Definition at line 30 of file Location.hpp.
| anonymous enum |
Definition at line 91 of file Location.hpp.
|
static |
This method converts a raw distance input to the units described by Sys::units().
| mm | Input in mm |
| units | Destination buffer for units |
|
static |
| coord | Starting position |
| d_lon | Change in longitude in meters (change in x) |
| d_lat | Change in lataitute in meters (change in y) |


HKN (or Eta Kappa Nu) is the honors society for Electrical and Computer Engineering. It is a subsidiary of IEEE, and was founded here at the University of Illinois at Urbana-Champaign.
We are very excited to be here at EOH 2015, and hope our exhibits give you a better idea of what it is to be an Electrical and Computer Engineer.


new Intersections(object, intersectMeshList, settingsopt)
Creates an intersection lines for graphic objects.
Parameters:
| Name | Type | Attributes | Description | ||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
object |
THREE.Mesh | graphic object for which the intersection lines with other objects will be obtained. | |||||||||||||||||
intersectMeshList |
THREE.Mesh | array | THREE.Mesh - Mech, which intersects with object.
array - array of intersect graphic objects. Every item is: THREE.Mesh - Mech, which intersects with object. or object - object keys is: mesh - Mech, which intersects with object. color - intersection lines color. Examples: 0xffffff, 'yellow'. Default is white. |
|||||||||||||||||
settings |
object |
<optional> |
the following settings are available:
Properties
|
- Source:


That is not the correct IP address. Please try again.
Correct!
You find that our neighbor has an IP camera. Your task is to find out the IP address and figure out a way to login. Once you are able to login to the camera successfully, you will find your challenge flag.


{% extends "global/Page.html" %} {% load staticfiles otree %} {% block title %} Practice Round {% endblock %} {% block content %}
You will now play one practice round.
This round is identical to the actual rounds except that:


--- layout: post status: publish published: true title: MSMQ 3.5 Remote Transactional Reads? author: display_name: Tomas Restrepo login: tomasr email<EMAIL_ADDRESS>url: http://winterdom.com/ author_login: tomasr author_email<EMAIL_ADDRESS>author_url: http://winterdom.com/ wordpress_id: 82 wordpress_url: http://winterdom.com/2005/05/msmq35remotetransactionalreads date: '2005-05-30 17:54:12 +0000' date_gmt: '2005-05-30 17:54:12 +0000' categories: - WinFX tags: [] comments: [] ---
According to the download page for the MSMQ 3.5 "Beta" update needed to enable Indigo queues, the new version supports remote transactional reads. Cool! One question, though: why is this feature required by Indigo? (most MSMQ-based architectures can be modified to ensure this is not needed, and provide better performance).


Home
About
Work
Contact
Rose Mengmei Zhou
Selected Work
test containers below:
Encounter
Participatory Installation
Chasing Stars
Art Game
London Roads
Data Visualization


An abstract class template for neural network optimizer algorithm implementations.
More...
#include <Optimizer.hpp>
|
| Scalar | optimize (Net &net, Provider &training_prov, Provider &test_prov, std::size_t epochs, std::size_t early_stop=0, Scalar target_loss=NumericUtils< Scalar >::MIN, bool verbose=true) |
| | It optimizes the specified neural network using the given data providers according to the optimizers loss function. More...
|
| |
| Scalar | train (Net &net, Provider &prov, std::size_t epochs, std::size_t early_stop=0, Scalar target_loss=NumericUtils< Scalar >::MIN, bool verbose=false) |
| | It trains the specified neural network using the given training data provider according to the optimizers loss function for the specified number of epochs. More...
|
| |
| Scalar | test (Net &net, Provider &prov, bool verbose=false) |
| | It tests the specified neural network using the given test data provider according to the optimizers loss function. More...
|
| |
| virtual void | fit (Net &net)=0 |
| | It fits the optimizer to the neural network. More...
|
| |
|
| virtual Scalar | _train (Net &net, Provider &training_prov, std::size_t epoch, bool verbose)=0 |
| | It trains the specified neural network for a single epoch on data provided by the specified data provider. More...
|
| |
| virtual Scalar | _test (Net &net, Provider &test_prov, std::size_t epoch, bool verbose)=0 |
| | It tests the specified neural network for a single epoch on the test data provided by the specified data provider. More...
|
| |
template<typename Scalar, std::size_t Rank, bool Sequential>
class cattle::Optimizer< Scalar, Rank, Sequential >
An abstract class template for neural network optimizer algorithm implementations.
◆ _test()
template<typename Scalar , std::size_t Rank, bool Sequential>
It tests the specified neural network for a single epoch on the test data provided by the specified data provider.
- Parameters
-
| net | A reference to the neural network to test. |
| test_prov | A reference to the test data provider. |
| epoch | The index of the epoch starting from 0. |
| verbose | Whether the optimization is performed in verbose mode; i.e. whether information should be printed to the standard out stream. |
- Returns
- The test loss of the epoch.
Implemented in cattle::SGDOptimizer< Scalar, Rank, Sequential >.
◆ _train()
template<typename Scalar , std::size_t Rank, bool Sequential>
| virtual Scalar cattle::Optimizer< Scalar, Rank, Sequential >::_train |
( |
Net & |
net, |
|
|
Provider & |
training_prov, |
|
|
std::size_t |
epoch, |
|
|
bool |
verbose |
|
) |
| |
|
protectedpure virtual |
It trains the specified neural network for a single epoch on data provided by the specified data provider.
- Parameters
-
| net | A reference to the neural network to optimize. |
| training_prov | A reference to the training data provider. |
| epoch | The index of the current epoch. starting from 1. |
| verbose | Whether the optimization is performed in verbose mode; i.e. whether information should be printed to the standard out stream. |
- Returns
- The training loss of the epoch.
Implemented in cattle::SGDOptimizer< Scalar, Rank, Sequential >.
◆ fit()
template<typename Scalar , std::size_t Rank, bool Sequential>
It fits the optimizer to the neural network.
It allows optimizers with individual learning rates for each parameter to set up their necessary internal data structures.
- Parameters
-
| net | A reference to the neural network that is to be optimized. |
Implemented in cattle::SGDOptimizer< Scalar, Rank, Sequential >.
◆ optimize()
template<typename Scalar , std::size_t Rank, bool Sequential>
| Scalar cattle::Optimizer< Scalar, Rank, Sequential >::optimize |
( |
Net & |
net, |
|
|
Provider & |
training_prov, |
|
|
Provider & |
test_prov, |
|
|
std::size_t |
epochs, |
|
|
std::size_t |
early_stop = 0 , |
|
|
Scalar |
target_loss = NumericUtils<Scalar>::MIN , |
|
|
bool |
verbose = true |
|
) |
| |
|
inline |
It optimizes the specified neural network using the given data providers according to the optimizers loss function.
It also fits the optimizer to the network before the otpimization begins.
- Parameters
-
| net | A reference to the network whose parameters are to be optimized. |
| training_prov | A reference to the provider of the training data. |
| test_prov | A reference to the provider of the test data. |
| epochs | The number of epochs for which the optimization should proceed. |
| early_stop | An std::size_t integer denoting the number of consecutive loss increases after which the optimization process is to be terminated prematurely. If it is 0, the process is never terminated prematurely. |
| target_loss | The target test loss value. If the test loss reaches this value or drops below it, the optimization process is terminated. |
| verbose | Whether the training, test, and regularization losses for each epoch should be printed to the standard out stream. |
- Returns
- The test loss of the last epoch.
◆ test()
template<typename Scalar , std::size_t Rank, bool Sequential>
It tests the specified neural network using the given test data provider according to the optimizers loss function.
It does not fit the optimizer to the network, thus the fit(Net&) method might need to be invoked beforehand.
- Parameters
-
| net | A reference to the network whose parameters are to be optimized. |
| prov | A reference to the provider of the training data. |
| verbose | Whether the training, test, and regularization losses for each epoch should be printed to the standard out stream. |
- Returns
- The test loss of the last epoch.
◆ train()
template<typename Scalar , std::size_t Rank, bool Sequential>
| Scalar cattle::Optimizer< Scalar, Rank, Sequential >::train |
( |
Net & |
net, |
|
|
Provider & |
prov, |
|
|
std::size_t |
epochs, |
|
|
std::size_t |
early_stop = 0 , |
|
|
Scalar |
target_loss = NumericUtils<Scalar>::MIN , |
|
|
bool |
verbose = false |
|
) |
| |
|
inline |
It trains the specified neural network using the given training data provider according to the optimizers loss function for the specified number of epochs.
It does not fit the optimizer to the network, thus the fit(Net&) method might need to be invoked beforehand.
- Parameters
-
| net | A reference to the network whose parameters are to be optimized. |
| prov | A reference to the provider of the training data. |
| epochs | The number of epochs for which the training should proceed. |
| early_stop | An std::size_t integer denoting the number of consecutive loss increases after which the optimization process is to be terminated prematurely. If it is 0, the process is never terminated prematurely. |
| target_loss | The target test loss value. If the test loss reaches this value or drops below it, the optimization process is terminated. |
| verbose | Whether the training losses for of the epochs should be printed to the standard out stream. |
- Returns
- The training loss of the last epoch.
The documentation for this class was generated from the following file:


Terms and Definitions
Abort: The requirement of aircraft to return to a base and become Inactive.
Action Rating: How good a unit is at fighting. Training, experience, doctrine and leadership
Active Aircraft: An aircraft which has been refitted and is capable of flying air missions.
Air Base Level: The size of an Air Base’s facilities.
Armor Unit: A unit that is very heavy in AFVs with little or no organic infantry. These units are marked by yellow backgrounds on their unit symbols.
Attack-Capable Unit: A combat unit that has a non-parenthesized Combat Strength of zero or more.
Barrage: An attack made by artillery, ships, or aircraft.
Break-Down Regiment: A portion of a multi-step unit detached to allow the division to cover more than one hex.
Bridging: The use of Engineer-Capable units to lessen the MP cost of crossing river features.
 Many a design decision in this series was made over these three pound burritos. (That way we knew what to blame…)
Close Terrain: Terrain types providing limited mobility to AFVs as well as some cover. Such terrain in the defender’s hex would require the use of the Close Terrain line of the Combat Table.
Combat Mode: A unit mode with a lower movement allowance and a higher combat value. In this mode, the unit is deployed for action.
Combat Supply: The supply required to fight using the regular Combat Table and required by artillery units to fire their Barrage Strengths.
Combat Unit: A ground unit with a Combat Strength of zero or more.
Combo Type Aircraft: A plane that can fulfill two of the basic aircraft roles. Usually, this will be limited to aircraft which can function as either Tactical Bombers or Transports.
Consolidation: Realignment of units so that a single stronger formation is generated from two or more crippled ones.
Construction: The creation or repair of facilities (air bases, ports, hedgehogs) using Engineer-Capable units.
Dead Pile: Each player should keep his eliminated units organized for possible rebuilding.
Detrain: The act of ending a rail move.
Detrainable Hex: A railroad hex that contains either a village, minor city, major city, port, or Combat Mode HQ.
Die or Dice Roll Modifier (DRM): Any one of a number of additions or subtractions from the die (or dice) rolled on the game’s tables.
Direct Draw: The act of using SP that are within the supply draw range of a unit (for whatever purpose) without using the assistance of an HQ.
Disorganized Mode (DG): A state of chaos generated by enemy activity which inhibits a unit’s smooth functioning.
Divisional Unit: A unit which is either a division itself, or part of a multi-unit formation.
DUKW: D = year of manufacture (the 4th year of the war); U = utility vehicle, K = all-wheel drive, W = wheel driven… basically amphibious trucks. Built by General Motors with the full designation DUKW-353
Dumps: Any stack of SP on the map, whether on the ground or loaded on a Transport Point, etc.
Engineer-Capable Unit: An engineer or HQ unit in Combat Mode. (Note that related types such as Rail Repair, Assault Engineers, Pioneers, and Para/ Glider Engineers are not considered engineer capable.)
Entrain: The act of loading something onto a train in order to use rail capacity.
Eq Repl: A replacement unit consisting of heavy vehicles, aircraft, or weapons needed to rebuild heavy units.
Exhausted: Internal stocks have had both of their two allotments used.
Exploitation Mode: A combat result that allows units to move and attack in the Exploitation Phase.
Exploitation Result (e): Combat results which might put some attacking units into Exploitation Mode.
Extender: A 5-point Transport Point dedicated to providing connections for trace supply purposes.
Extremely Close Terrain: A heavily built-up urban area or mountainous terrain which is easily defended by few units.
Fighters (F-Type): A fighter type air unit.
Flak: The ability of ground units and ships to resist air attack.
Formation Marker: A counter used to replace any number of units from the same higher formation (generally a division, or a Soviet Corps) so as to eliminate big stacks and create some limits on intelligence.
Fortifications: Features permanently printed on the map which assist ground units in defense.
Fuel: Supply which is used to move tracked or truck units about.
Fully-Motorized: A combat unit with two wheels under its unit symbol—one with enough transport for all to ride.
Game Turn: Game play corresponding to a half-week or quarter-week of real time consisting of two Player Turns.
Hedgehog: A moderate degree of fieldworks in a hex to assist ground units in defense.
Hip Shoot: An air Barrage that behaves much like an Overrun. Named for the technique of stopping a mortar unit while on the road to deploy and shoot with no warning.
HQ: A headquarters and its support systems. Each HQ also represents many smaller service units, and the logistical capacity to support a group of units.
Inactive Aircraft: An aircraft which has expended its capabilities and has yet to refit. Such units cannot fly at all.
Inactivation: The process making an Active aircraft become Inactive after it is “used.”
Independent Units: Combat units that are neither multi-step units nor part of a multi-unit formation.
Internal Stocks: Combat Supply a unit carries about by itself.
In Supply: A unit which has successfully traced supply or had on-map supply expended for it.
Involuntary Mode: A mode that players cannot select, that is inflicted as a result of combat.
Landing Craft: Small boats used for transporting units and SP from larger ships to landing beaches or ports.
Leapfrogging: The prohibited act of loading something, moving it, loading it onto another transport unit and moving it again.
Leg MP: Movement points generated by foot or hoof which are shown on the counter in white.
Low: Internal stocks have had one of their two allotments used.
LST: Landing Ship, Tank. A large ship supporting amphibious operations.
MA: Abbreviation used for Movement Allowance.
Mech Unit: A unit with both a heavy AFV component and a large infantry component. These units provide their own combined arms teams. Such units have a red unit symbol background.
Move Mode: A unit mode with a lower combat value and a higher movement allowance. The unit has sacrificed some security for speed.
Multi-Track Railroad: A modern RR featuring two or more track sets, many sidings, and support facilities. Top of the line rail transport support.
Non-Combat Unit: Any ground unit without a Combat Strength such as SP, Air Bases, or Transport Points.
Non-Divisional Unit: Any unit which is neither a division itself nor part of a multi-counter formation.
Non-Motorized: A unit that requires shoe leather or horses to get around.
Non-Phasing Player: The guy whose player turn it isn’t.
Offensive Aircraft: Planes that have non-parenthesized Air Combat Ratings.
Open Terrain: Terrain essentially free of obstruction.
Option Number or Option Result: A portion of a combat result which gives the player a choice between step losses or hexes of retreat.
Organic Truck: A Transport Point that is assigned to a specific formation. These represent the internal transportation in these units. While generically referred to as ‘trucks’ other types of Transport Point might actually be used (as shown on the counter).
“Other type” Unit: A unit which is neither mech nor armor.
Overruns: Attacks made by units during movement.
Patrol Zone: The area within 10 hexes of an Active Fighter on its Air Base. This represents the normal operation of Fighters to contest the use of that air space.
Pax Repl: A replacement unit made up of little more than warm bodies.
Phasing Player: The guy whose player turn it is.
Player Turn: One half of a Game Turn, in which one player goes through the sequence of play from his Aircraft Refit through his Clean Up.
Rail Capacity: The total number of SP of rail transport a player can use in a single player turn.
Railhead: A boundary between usable and unusable railroad hexes.
Rail Repair (aka RR) Units: Combat units capable of railroad conversion.
Refitting: The act of converting Inactive aircraft into Active ones. Essentially, the aircraft are being over-hauled, rearmed, and refueled to participate in future air operations.
Regimental Equivalents (RE): A quick and dirty measure of unit size.
Replacement Units (Repls): Combat units that can be combined in different ways to rebuild dead or damaged units.
Replenishment: The refilling of used internal stocks.
Reserve Mode: Shows a unit which is awaiting orders or otherwise in readiness for quick action.
Reserve Release: When a player decides to remove a unit from Reserve Mode and deploy it into action.
Road: This term is used when a rule is meant to apply to all road-like features in the game (roads of different caliber, tracks, and railroads).
Rounding Rule: The standard method of dealing with fractions in any Gamers brand game.
Strat Bomber (S): A strategic bomber.
 These units have one wheel under their unit symbol.
Single-Track Railroads: The standard railroad feature in the game.
Steps, Step Loss: A portion of a unit’s strength and size used to keep track of the attrition effects of combat.
Strat Mode: A combat unit that is in full road movement posture. Most security precautions have been dumped to allow fast movement.
Supply Points (SP): The measure of bulk supply. Stockpiled by the “great quartermaster in the sky” in just the right proportions of everything units need at different times—luckily for us, right?
Surprise: Units being caught tactically unprepared; the gaming equivalent of bringing a knife to a gun fight.
Tactical Bombers (T-type): These air units fight at lower altitudes than do strategic bombers, often in close support of ground units.
Throw Range: The distance HQs are able to provide SP and Trace Supply to units which need them.
Trainbusting Zone: The area affected by a successful Trainbusting mission.
Transports (Tpt): A Transport aircraft.
Trace Supply: The basic handling of subsistence supply.
Transportation Equivalents: This is a determination of the SP “weight” of units to allow a quick assessment of the capacity needed to transport them.
Track MP: Movement points of all- terrain vehicles (tracked or wheeled) which are shown on the counter in red.
Truck MP: Movement points of less maneuverable vehicles (usually trucks) that are shown on the counter in black.
Very Close Terrain: Terrain which is extremely tight for vehicles and which provides much cover and concealment.
Via HQ Supply: A supply path using an HQ’s throw range.
Voluntary Mode: Modes which a player can select during the Movement Phase.
Zones of Control (ZOCs): The effect of combat units projected into hexes adjacent to their location. While the game has no ZOCs for most purposes, some things (supply trace, truck MP movement, etc.) are influenced by the presence of enemy units.


Thursday 1 March is World Book Day. This year’s message is Share a Story, so we’ve picked out some great books to read with children.
Research has shown that spending just 10 minutes a day reading with a child has huge benefits - and it’s great fun too! For more information, visit the World Book Day website or read BookTrust’s great advice on sharing books.
Aliens Love Underpants, by Clare Freedman & Ben Cort
“Aliens love underpants, in every shape and size. But there are no underpants in space, so here’s a big surprise.”
Picture books with rhymes work really well for storytime, and this is a failsafe family favourite.
The Gruffalo, by Julia Donaldson & Axel Scheffler
“This is a rhyming story of a mouse and a monster. Little mouse goes for a walk in a dangerous forest. To scare off his enemies he invents tales of a fantastical creature called the gruffalo. So imagine his surprise when he meets a real gruffalo.”
Probably one of the most popular storytime books of all time, and for good reason.
Hoot Owl: master of disguise, by Sean Taylor & Jean Jullien
“Hoot Owl is no ordinary owl - oh no! - he’s a master of disguise! And he will use his expert camouflage powers to trick his unsuspecting prey into succumbing to him! Tiny animals of the night - beware!
“But, somehow, Hoot Owl’s prey keeps escaping. Hmmm, perhaps he isn’t quite as masterful as he believes. Will he ever succeed in catching himself some dinner?”
This is hilariously funny and great for reading aloud. David Walliams has described it as “the funniest picture book I have read in a long time.”
 He throws up his shoe to shift it, but that gets stuck too. So he throws up his other shoe and that gets stuck, along with a ladder, a pot of paint, the kitchen sink, an orang-utan and a whale, amongst other things! Will Floyd ever get his kite back?”
Very young children can also enjoy a board book version of Stuck.
Suddenly!, by Colin McNaughton
A classic tale about a hungry wolf’s thwarted attempts to jump out on Preston Pig.
Dear Zoo, by Rob Campbell
“‘I wrote to the zoo to send me a pet’. This classic lift-the-flap book has been a favourite with toddlers ever since it was first published in 1982.”
Also available as a big book for reading aloud to groups.
 Who will keep him safe? His mother comes into the frame. Then the captain of the boat.  The star steadfastly steers the boat through the storm back into the harbour. Everyone is restored to the safety of home.
“But then we return to the sky where the star remains, all alone. Who will keep the star safe? It’s the little boy, now in his bedroom, still holding his net. He watches the star and he’s ready to catch it, should it fall.”
This very sweet story is perfect for bedtime.
You Choose!, You Choose in Space and Just Imagine, by Pippa Goodhart & Nick Sharratt
These aren’t stories as such, but wonderful books to share with lots of things to think and talk about on every page.
No Matter What and Stormy Weather, by Debi Gliori
Two lovely reassuring tales for bedtime.
Inside Your Outside!, and There’s No Place Like Space! by Tish Rabe and Aristides Ruiz
Human biology and astronomy conveyed by rhyme, in the style of Dr Seuss.
If I Ran the Rainforest, by Bonnie Worth, Aristides Ruiz and Theodor Seuss Geisel is another title in the series especially worth a read.
The Tiger Who Came to Tea, by Judith Kerr
50 years since it was first published, this book is still delighting children and their parents/carers.
Supermarket Gremlins and School Gremlins by Adam Guillain, Charlotte Guillan & Chris Chatterton
Gremlins are up to mischief in these lift-the-flap books.
The Elephant and the Bad Baby, by Elfrida Vipont & Raymond Briggs
Fantastic illustrations, mayhem, snacks aplenty and a gentle reminder about the importance of saying ‘please’.
Rabbit’s Bad Habits, The Pest in the Nest and Attack of the Snack, by Julian Gough and Jim Field
Our new favourites are pitched for slightly older readers, but the whole family will love these stories.
Reading with children of all ages is a great way to increase their literacy but the act of sitting together and enjoying a story is also really important. Our New in and children’s reading ideas section includes regular lists of our best new children’s CD audiobooks and eAudio, all free to borrow.


Sibling headings are unique/same, no main landmark
h2 different 1
h3 same
h4 different 1
h3 same
h4 no siblings
h5 different 1
h5 same
h6 no siblings
h5 different 2
h6 different 2
h6 same
h6 same
h6 different 3
h5 same
h3 different 1
h2 same
h3 different 2
h3 different 3
h2 same
h3 same
h3 same
h3 same
h3 different 4
h2 different 2


Headers
Headers are used to navigate the user. Here are the headers for this library.
Default header
Example above.
For this type of header, you have to use the layout, that this site uses (You can only place content inside the div with the id "main", except modals).


juanluismorales15 [AT] gmail.com
Hello! I am a Spanish games programmer and aspiring indie developer currently studying at the University of Abertay. I enjoy developing and implementing interesting gameplay mechanics and systems with an emphasis in multiplayer. I also like pixel animation.
Check my game projects at my itch.io page and my art endeavours at artstation!
2D platformer game where you can use your companion as a movable platform to advance the levels.
ITCH.IO DOWNLOAD PAGE2.5D shooter/platformer game developed where you go inside a software program to eliminate all the bugs!
ITCH.IO DOWNLOAD PAGETake on the role of the user of a magical sword to confront the darkness of the land in this 2.5D action platformer game inspired by Castlevania and Dark Souls.
ITCH.IO DOWNLOAD PAGERythm/fighting game developed for Abertay's Dare Academy competition and moved forward as professional project. I did character and spell animations as well as shader and other graphics related effects.
Android educative mini-game-based game developed for Abertay's Professional Project module for Zero Waste Scotland as directing client. I was in charge of version control planning and management, game architecture planning and implementation, design and artistic development of minigames. Acted as a communication vector between less technical members of the group and other programmers/technical designers via verbal and written (technical documents) communication. Developed a highly customizable and scalable character customization system.
GPA: 3.8 (First Class).
GPA: Distinction (A+)
Obviously enough, I spent most of my free time playing games such as WoW or Dark Souls. I keep up to date with the industry reading programming articles and games postmortems. For other forms of entertainment, I particularly enjoy 2D and 3D animation (western and eastern).
I have played classical guitar for 10 years and I dabble with DAWs such as Reaper. I am a Game Master for Dungeons and Dragons 5E and I try my best not to kill any of my players, even when they deserve it. I love snowboard and skateboard, even if I am not 15 anymore. If I were not working in games I would probably work in the health industry.


Defines | |
| #define | TRIE_NULL ((void *) 0) |
| A null TrieValue. | |
Typedefs | |
| typedef struct _Trie | Trie |
| A trie structure. | |
| typedef void * | TrieValue |
| Value stored in a Trie. | |
Functions | |
| Trie * | trie_new (void) |
| Create a new trie. | |
| void | trie_free (Trie *trie) |
| Destroy a trie. | |
| int | trie_insert (Trie *trie, char *key, TrieValue value) |
| Insert a new key-value pair into a trie. | |
| TrieValue | trie_lookup (Trie *trie, char *key) |
| Look up a value from its key in a trie. | |
| int | trie_remove (Trie *trie, char *key) |
| Remove an entry from a trie. | |
| int | trie_num_entries (Trie *trie) |
| Find the number of entries in a trie. |
A trie is a data structure which provides fast mappings from strings to values.
To create a new trie, use trie_new. To destroy a trie, use trie_free.
To insert a value into a trie, use trie_insert. To remove a value from a trie, use trie_remove.
To look up a value from its key, use trie_lookup.
To find the number of entries in a trie, use trie_num_entries.
| void trie_free | ( | Trie * | trie | ) |
Destroy a trie.
| trie | The trie to destroy. |
Insert a new key-value pair into a trie.
| trie | The trie. | |
| key | The key to access the new value. | |
| value | The value. |
Look up a value from its key in a trie.
| trie | The trie. | |
| key | The key. |
| Trie* trie_new | ( | void | ) |
Create a new trie.
| int trie_num_entries | ( | Trie * | trie | ) |
Find the number of entries in a trie.
| trie | The trie. |
| int trie_remove | ( | Trie * | trie, | |
| char * | key | |||
| ) |
Remove an entry from a trie.
| trie | The trie. | |
| key | The key of the entry to remove. |


Implementations of
parametric equations
from Wikipedia
Radius increases on each time step merely for effect.
...


A tool for visualizing data
| Version: | 4.0.0 |
| Depends: | R (≥ 2.10), rtiff |
| Suggests: | stats |
| Published: | 2013-04-25 |
| Author: | Daniel P Gaile, Lori A. Shepherd, Lara Sucheston, Andrew Bruno, Kenneth F. Manly |
| Maintainer: | Lori A. Shepherd <las65 at buffalo.edu> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| URL: | http://sphhp.buffalo.edu/biostat/research/software/sendplot/index.php |
| NeedsCompilation: | no |
| SystemRequirements: | libtiff |
| CRAN checks: | sendplot results |
| Reference manual: | sendplot.pdf |
| Vignettes: |
Quick Tutorial |
| Package source: | sendplot_4.0.0.tar.gz |
| Windows binaries: | r-devel: sendplot_4.0.0.zip, r-release: sendplot_4.0.0.zip, r-oldrel: sendplot_4.0.0.zip |
| OS X binaries: | r-release: sendplot_4.0.0.tgz, r-oldrel: sendplot_4.0.0.tgz |
| Old sources: | sendplot archive |
| Reverse suggests: | diveRsity, qgraph |
Please use the canonical form https://CRAN.R-project.org/package=sendplot to link to this page.


This parses Note Block Studio (NBS) song files so that the Scratch project can interpret them because Scratch projects can't really read binary files.
Select a .NBS file in the input below, then copy and paste the textbox underneath into the input in the Scratch project using the "Custom Song" option.
- Instruments last updated for Minecraft 1.18.2.
- Layer volume is not supported.
- Custom instruments are not supported.
- OpenNBS "Velocity", "Pitch", and "Pan" are not supported.
Files are processed locally on your computer and are never uploaded to a server.


Modified hours on 11/23, 6:00am to 9:00pm. We are closed on 11/24, but our doors will open on 11/25, 9:00am to 9:00pm. See a detailed list of hours.
UCR’s newly expanded Student Recreation Center (SRC) is bigger and better than ever — and it’s all yours! As a registered UCR student, you are automatically a member of this on-campus, 155,000-square-foot facility.
Jump In and Have FunDownload our Rec Guide and join us for fun and excitement in our many programs and activities! |
Make a Splash!Our 237,000-gallon pool has lap swimming, a 20-person spa and a lazy river. We also offer swim lessons and a Stay Fit aquatics program. |
Take a ClassExpand your knowledge on dance, martial arts, and tennis. Learn to Ballroom, Hip Hop, CPR, Self Defense, Aikido, Karate and more. |
Hire a Personal TrainerTailor your own fitness program with a free health screening and expert advice on nutrition, flexibility and weight lifting from our certified training staff.
|
Play Ball!Our basketball, volleyball and badminton courts are ready when you are. Drop in before or after classes and check out equipment at the front counter. |
Join a Sports TeamGo deep in a flag-football league, or challenge another dorm to basketball in the same gym where the UCR Highlanders compete. |


Codehaus XFire
DocumentationQuicklinksDevelopers
Sponsors |
This examples highlights how to
You can also use XFire with Servlets or Spring Remoting, this is just one of your many options with XFire! Creating the ServiceThe first task is to write our Service. Further down we'll be showing how to create a Client. Java Proxies require an interface, and since that is how the Client API works, we'll be writing our interface first. For this example, we're going to create a simple class which echoes back a String: public interface Echo { String echo(String echo); } We'll also need to write an implementation: public class EchoImpl implements Echo { public String echo(String echo) { return echo; } } Next we're going to write a class called ServiceStarter. This class creates a Service from the ServiceFactory and also starts up an instance of the XFireHttpServer. package org.codehaus.xfire.example; import org.codehaus.xfire.XFire; import org.codehaus.xfire.XFireFactory; import org.codehaus.xfire.server.http.XFireHttpServer; import org.codehaus.xfire.service.Service; import org.codehaus.xfire.service.binding.ObjectServiceFactory; import org.codehaus.xfire.service.invoker.BeanInvoker; import org.codehaus.xfire.test.Echo; import org.codehaus.xfire.test.EchoImpl; /** * Creates an Echo service and exposes it via HTTP. */ public class ServiceStarter { XFireHttpServer server; public void start() throws Exception { // Create an XFire Service ObjectServiceFactory serviceFactory = new ObjectServiceFactory(); Service service = serviceFactory.create(Echo.class); service.setInvoker(new BeanInvoker(new EchoImpl())); // Register the service in the ServiceRegistry XFire xfire = XFireFactory.newInstance().getXFire(); xfire.getServiceRegistry().register(service); // Start the HTTP server server = new XFireHttpServer(); server.setPort(8191); server.start(); } public void stop() throws Exception { server.stop(); } } ServiceFactorys are responsible for creating Services and configuring them in XFire. You'll see in other sections that there is an AnnotationServiceFactory as well and you can use that with JSR 181 Annotations. The XFireHttpServer uses Jetty underneath so make sure that you have it on your classpath. If you use maven, here are all the dependencies you'll need: <dependencies> <dependency> <groupId>org.codehaus.xfire</groupId> <artifactId>xfire-java5</artifactId> <version>1.2.2</version> </dependency> <dependency> <groupId>jetty</groupId> <artifactId>org.mortbay.jetty</artifactId> <version>5.1.10</version> </dependency> <dependency> <groupId>javax.servlet</groupId> <artifactId>servlet-api</artifactId> <version>2.4</version> </dependency> </dependencies> Starting the service and the ClientUsing the Client is very similar. Once again we'll are creating a Service from an ObjectServiceFactory. This is because the Service object holds metadata about our Service. Our client needs this metadata to understand how the Service works. (NOTE: we also support WSDL code generation and dynamic clients if you didn't write the service or don't have the interface on your classpath). The XFireProxyFactory is then responsible for creating a proxied interface which will invoke this service. ServiceStarter starter = new ServiceStarter(); starter.start(); // Create a service model for the client ObjectServiceFactory serviceFactory = new ObjectServiceFactory(); Service serviceModel = serviceFactory.create(Echo.class); // Create a client proxy XFireProxyFactory proxyFactory = new XFireProxyFactory(); Echo echo = (Echo) proxyFactory.create(serviceModel, "http://localhost:8191/Echo"); System.out.println(echo.echo("Hello World")); starter.stop(); At the end, all we need to do is invoke "echo.echo("Hello World")" and "Hello World" should be sent right back to you! If you were going to create a client from .NET you would be able to find the WSDL at http://localhost:8191/Echo?wsdl. |


The com.cyberfront.crdt.operation package contains an abstract base class (AbstractOperation) and four operations which can be performed on the JSON object. These operations are CreateOperation, ReadOperation, UpdateOperation and DeleteOperation.


Komodo is a system for running quizzes in a classroom setting and seeing responses in real time.
Does your question have 27 different possible answers? Komodo can handle that just fine! But whoever's playing probably can't. Be nice.
With the full question and each answer choice on players' phones, nobody has to squint!
Tired of making players come up with original names on their own? Now, a mildly amusing name is just one button away!


'I'll be there at 5:30 baby': 'Scary’ text sent to Ohio girl's phone
by Brittany HarryCINCINNATI (WXIX/Gray News) - For the second time in 10 days, a mother is saying her daughter received a bizarre text from an unknown number.
Amanda Jones lives in North College Hill. Her 12-year-old daughter lives with her.
She said her daughter received the following text on Monday:
"Hey your mom told me come get you from Practice @ North College Hill tomorrow I'll Be outside in a white van behind the red car. I'll be there at 5:30 baby."
“As soon as she got it, she ran downstairs and said, ‘You’re having somebody get me from basketball?’ And I said, ‘No, why would I do that?’” Jones said. “She said, ‘Well I just got this text.’ And I thank God that my daughter is able to come to me and tell me things like that, because she was freaked out as much as I was.”
Neither mother nor daughter knew the number from which the text was sent.
Still, it isn’t the randomness that disturbs Jones—it’s the specificity.
“They knew what school she went to, what time basketball got out and all of that information,” Jones said. “Nobody besides me and maybe her close friend should even know any of that. So it’s really scary.”
Jones said she went to police with the text, and they told her to respond to let whoever was on the other end know they had the wrong number.
So that’s what she did. And the person did respond—they said they’d still be there.
The police’s next suggestion? Jones says they told her to block the number, and she did that as well.
The next morning, Jones says she went to her daughter’s school and reported the text to the school’s resource officer, who took the matter seriously.
Jones is taking the matter seriously too, especially as it concerns the safety of her children.
“Even with my little kids, it’s like, hey, if you get this text, right away, don’t ever talk to strangers,” she explained.
Now Jones’s kids have safety procedures — “self-defense,” she says —like passwords to ensure they don’t get in cars with strangers, and protocols for if someone is trying to grab them.
Because Jones said these days, you can never be too safe.
“It’s not funny, if it is a joke,” Jones said. “It’s not OK, and it really hurts me to think that somebody would be after my daughter.”
Read the original version of this article at fox19.com.


Bus due at
Please select your route:
-
66
67
-
Route
Arrival
Due in
Scheduled
Destination
Additional
Time
(mins)
Time
Info
-
-
-
-
-
-


John Doe Article 1 (johndoe.exmaple.com)
submitted 11 minutes ago by mipadi
Are there any free and safe keyloggers around? (self.programming)
submitted 18 minutes ago by tbunreal
Deciphering Glyph: Explaining Why Interfaces Are Great (glyph.twistedmatrix.com)
submitted 27 minutes ago by dreid
The Agile Manifesto Demands We Win Over Hearts and Minds (codesoftly.aaronoliver.com)
submitted 1 hour ago by olivstor
Post Agile - Beyond Best Practice and towards Professionalism (pab-data.blogspot.com)
submitted 1 hour ago by rubyruy
Ask Proggit: Does anyone have experience with JMF or other RTP/RTSP technologies? (self.programming)
submitted 1 hour ago by ucla_jatt
How Many Open Source Licenses Do We Need? (itmanagement.earthweb.com)
submitted 1 hour ago by alphabeat
I guess even Microsoft knows their browsers are not compatible (microsoft.com)
submitted 1 hour ago by nassrat
Open source Silverlight reaches Linux platform. Adobe says Silverlight has "fizzled out" (developerfusion.com)
submitted 2 hours ago by jamescrowley
English-Chinese dictionary based on Wikipedia (reganmian.net)
submitted 2 hours ago by paulbesteves
Many strangely â€œdeformedâ€ hominoid skulls have been discovered in Mexico and Peru (lovebigfoot.com)
submitted 2 hours ago by Slawqq
Process Explorer - Der bessere Task-Manager fÃ¼r Windows (dimido.de)
submitted 5 hours ago by dimido
How Not To Make A Commercial Linux Distribution (linuxhaxor.net)
submitted 5 hours ago by vinblackham
Ask proggit: What's the best available parser/lexer generator for Python? (self.programming)
submitted 5 hours ago by donknuth
C++ program containing a sequence of at least ten different consecutive keywords (vandevoorde.com)
submitted 5 hours ago by clueless
Facts versus Reputation - What language community has a greater reputation for being obsessed with TDD? (use.perl.org)
submitted 5 hours ago by gst
view more: next


These functions allow for the creation and manipulation of FITS HDU Groups, as defined in "A Hierarchical Grouping Convention for FITS" by Jennings, Pence, Folk and Schlesinger:
http://fits.gsfc.nasa.gov/group.html
A group is a collection of HDUs whose association is defined by a grouping table. HDUs which are part of a group are referred to as member HDUs or simply as members. Grouping table member HDUs may themselves be grouping tables, thus allowing for the construction of open-ended hierarchies of HDUs.
Grouping tables contain one row for each member HDU. The grouping table columns provide identification information that allows applications to reference or "point to" the member HDUs. Member HDUs are expected, but not required, to contain a set of GRPIDn/GRPLCn keywords in their headers for each grouping table that they are referenced by. In this sense, the GRPIDn/GRPLCn keywords "link" the member HDU back to its Grouping table. Note that a member HDU need not reside in the same FITS file as its grouping table, and that a given HDU may be referenced by up to 999 grouping tables simultaneously.
Grouping tables are implemented as FITS binary tables with up to six pre-defined column TTYPEn values: 'MEMBER_XTENSION', 'MEMBER_NAME', 'MEMBER_VERSION', 'MEMBER_POSITION', 'MEMBER_URI_TYPE' and 'MEMBER_LOCATION'. The first three columns allow member HDUs to be identified by reference to their XTENSION, EXTNAME and EXTVER keyword values. The fourth column allows member HDUs to be identified by HDU position within their FITS file. The last two columns identify the FITS file in which the member HDU resides, if different from the grouping table FITS file.
Additional user defined "auxiliary" columns may also be included with any grouping table. When a grouping table is copied or modified the presence of auxiliary columns is always taken into account by the grouping support functions; however, the grouping support functions cannot directly make use of this data.
If a grouping table column is defined but the corresponding member HDU information is unavailable then a null value of the appropriate data type is inserted in the column field. Integer columns (MEMBER_POSITION, MEMBER_VERSION) are defined with a TNULLn value of zero (0). Character field columns (MEMBER_XTENSION, MEMBER_NAME, MEMBER_URI_TYPE, MEMBER_LOCATION) utilize an ASCII null character to denote a null field value.
The grouping support functions belong to two basic categories: those that work with grouping table HDUs (ffgt**) and those that work with member HDUs (ffgm**). Two functions, fits_copy_group() and fits_remove_group(), have the option to recursively copy/delete entire groups. Care should be taken when employing these functions in recursive mode as poorly defined groups could cause unpredictable results. The problem of a grouping table directly or indirectly referencing itself (thus creating an infinite loop) is protected against; in fact, neither function will attempt to copy or delete an HDU twice.