Table of Contents
Security Issues: xf86(4)
Unix/BSDs provide a great sturdy platform for running services that just need to be "going and going and ..." For this type of environment the Windowing Graphical User Interface is mostly unnecessary (or maybe totally unnecessary.) But a Win GUI augments the tough exterior of the sturdy server with a more approachable look for those new to Unix/BSDs who are used to a desktop environment (ala MS Windows.) OpenBSD is as adept as other *NIX systems in displaying a nice gui and a flexible GUI provides a platform for non-*NIX people to be introduced to, operate and maintain the general configurations of a a secure OpenBSD box.
These notes refer to XFree86 4.1 and OpenBSD 3.0
Your OpenBSD team has put together a good guide in /usr/X11R6/README, step-by-step instructions for installing your X-Windows system.
The utilities required for installing both XFree86 4.1 and XFree86 3.3.6 are both referenced and more complete documentation are stored in:
| Location | Release |
| /usr/X11R6/lib/X11/doc/ | XFree86 4.1 |
| /usr/X11R6/lib/X11/doc/XFree86-3.3.6/ | XFree86 3.3.6 |
If you would like to refer to the documentation previously available on installing X, please refer to the article x-windows3.htm
[ref: XF3.3x /usr/X11R6/lib/X11/doc/XFree86-3.3.6/QuickStart.doc,
XF86Config-3(4)]
[ref: XF4.1 /usr/X11R6/lib/X11/doc/, XF86Config(5)]
To get X Windows started on your system you 1st have to generate a configuration file (assuming of course that you installed the x* files during installation. and followed /usr/X11R6/README)
[ref: SuperProbe(1)]
[ref: x-windows3.htm]
The use of SuperProbe to determine your video card settings are documented in our previous installation instructions. Essentially, running the program will help you with selecting the correct video card for configuring the X server.
If you really want to use an accelerator driver only available in XFree86 3.x then please look at the previous instructions for installing XF 3.x.
Fortunately we do not have to do much work with the mouse, because of the new wsmouse device with OpenBSD 3.0
If the older notes do not help, what I have found to be a starting point on a new machine with no idea about the video card, is the XFree 4.x's XFree86 -configure option.
From the documention: [XFree86(1)]
-configure When this option is specified, the X server loads all video driver modules, probes for available hardware, and writes out an initial XF86Config(5) file based on what was detected. This option cur rently has some problems on some platforms, but in most cases it is a good way to bootstrap the con figuration process. This option is only available when the server is run as root (i.e, with real-uid 0).
After running XF86Config from root you should get some response similar to the following:
# XFree86 -configure
Your XF86Config file is /root/XF86Config.new
To test the server, run 'XFree86 -xf86config /root/XF86Config.new'
Now I can test whether the XF86 configuration generated by the program works by using the example shown above.
# XFree86 -xf86config /root/XF86Config.new
Don't look for something exciting, this should only be the X environment, which will basically just show as a blank screen with a mouse cursor. Worse, it will probably be at the lowest possible resolution, but it's working.
Ctrl+Alt+Bksp: For those very new to X, use the Control+Alt+Backspace key combination (hold all three keys down at the same time) to stop X and return to the command-prompt.
Success? If the graphic screen worked for you, you can now use this Configuration as a basis for your X environment. To do this copy the /root/XF86Config.new file to the standard location for your machine (usually at /etc/X11)
# cp /root/XF86Config.new /etc/X11/XF86Config
WARNING: make backups of any existing files before you copy anything.
In OpenBSD (3.2 & 3.3 tested with this comment) the only major thing to configure from the above sample configuration are:
[ref: wsmouse(4)]
One key aspect to realise with OpenBSD 3.0 and XFree86 4.x is that the mouse protocol is now 'wsmouse' irregardless of which mouse you may have (at least on my i386 systems, i'm sorry if i'm wrong.)
[ref: XF3.3x xf86config3]
[ref: XF4.1 xf86cfg(1), xf86config(1)]
Two programs are recommended for creating your XF86Config file: xf86cfg and xf86config.
xf86cfg configuration is confusing if you are not used to it (a quasi GUI interface) alternately it offers a text-mode configuration 'xf86cfg -textmode'
It significantly helps the XF86Config process if you can connect from another computer 'ssh' and execute the installation sequence so you can more easily review error output, which is logged in /var/log/XFree86.0.log. (i.e. use a 2nd screen to tail -f /var/log/XFree86.0.log and view the startup process/failure.)
If your configuration has been successful then you can start and stop X Windows by doing the following.
Both setup programs should create a workable server, and you can test it by using the startx script.
| # /usr/X11R6/bin/startx |
To Get out of X, use Ctrl+Alt+Backspace
After starting X Windows for the 1st time you should get a screen with one or two x-term windows open on the screen.
Often, I screw up the resolution, or the color mode configuration. One simple way of starting X into a different configuration than that which is in the configuration file, is to use the following example.
To start X Window using 256 color mode:
| # startx -- -bbp 8 |
To start X Window in true colour mode, use the following command
| # startx -- -bbp 32 |
'startx' is a script to initialise services for the X Window environment which in the default OpenBSD configuration starts up a simple 'window manager' and an 'xterm' connection running under the fvwm Window Manager.
I'm not really into interface wars between KDE & GNOME and all the 'lighter' stuff, because I much prefer KDE for my OpenBSD box, and I much prefer Internet Explorer over the other browsers, so ...
Members of the OpenBSD development team involved with KDE development have done a wonderful set of work to incorporate many of the standard features of KDE into OpenBSD's port.
I've got the OpenBSD 3.0 cd set, so I just pkg_add all the kde files, including koffice. (copied from the CD to /usr/ports/packages/i386/All)
| # cd /usr/ports/packages/i386/All |
| All # ls kde* |
| kdeartwork-2.2.1.tgz kdebase-ns-2.2.1.tgz
kdegraphics-2.2.1.tgz kdenetwork-2.2.1.tgz kdebase-2.2.1.tgz kdegames-2.2.1.tgz kdelibs-2.2.1.tgz kdetoys-2.2.1.tgz |
| All # ls kof* |
| koffice-1.1.tgz |
| # pkg_add koffice-1.1.tgz kdenetwork-2.2.1.tgz # pkg_add kdegraphics* kdegames* kdetoys* |
You can test the installation by starting an xterm while in X Windows and typing startkde at the command prompt. This should start up kde for your personal configuration.
If KDE does not start up, then something is broken with the KDE install and you can refer to the /var/log/XFree86.0.log for further items to check that may be broken (missing) in your install.
[ref: Red Hat Linux Administrator's Handbook 2nd ed. Mohammed J. Kabir]
To allow user customisation, the startx script looks for system wide files and their corresponding version in the user home directory. If the user files are not found then the global version is used, otherwise the local user version is used. In this way, your users can have their own custom visual displays when they start up in X Window.
The global configuration files are xserverrc and xinitrc. The user custom versions are ~/.xserverrc and ~/.xinitrc
xserverrc or ~/.xserverrc contain details of which X servers to start, while
xinitrc or ~/.xinitrc contain details of which client applications are going to be run after the X Window system has started. When the script exits, the X server is also terminated.
Create a file : ~/.xinitrc to contain the following startup commands.
File: ~/.xinitrc
| #!/bin/sh /usr/local/bin/startkde |
After creating the above file, then you need to make the file executable by performing the following command as the user.
|
$ cd ~ $ chmod a+x .xinitrc |
Now, when the user starts X (by using startx) the user will be presented with KDE as their default GUI.
To set the environment so all desktops started with startx are kde, make changes to /usr/X11R6/lib/X11/xinit/xinitrc
The relevant lines are shown below.
File: xinitrc
| # start some nice programs xclock -geometry 50x50-1+1 & xconsole & xterm -geometry 80x24 & |
| # fvwm || xterm |
| /usr/local/bin/startkde |
The default X install supports can be started straight into X Windows by using the xdm display manager. The installation of KDE gives you an additional display manager kdm.
[ref: rc.conf(8), xdm(1)]
To automatically start the machine with the X environment, configuration changes are made in the /etc/rc.conf.local file
To enable the X manager to begin on startup, create or change options in Section 1 of the /etc/rc.conf.local file
Edit the File: /etc/rc.conf.local and add a line that reads as follows in Section 1:
| xdm_flags="" # note the use of two double-quotes |
The above setting will override the general settings in /etc/rc.conf which reads as follows:
| xdm_flags=NO |
When you restart your machine, xdm will start and greet you with a dialog prompt for your username and password.
You can obviously go straight to this display manager from the command prompt by typing in '/usr/X11R6/bin/xdm'
| # /usr/X11R6/bin/xdm |
The configuration files for xdm are stored in /etc/X11/xdm
One mail discussion recommends that you should use xdm_flags="-udpPort 0" to stop xdm from listening to the Network.
From the man pages xmd(1)
| -udpPort port_number Specifies the value for the DisplayManager.requestPort resource. This sets the port-number which xdm will monitor for XDMCP requests. As XDMCP uses the registered well-known UDP port 177, this resource should not be changed except for debugging. If set to 0 xdm will not listen for XDMCP or Chooser requests. |
[ref: rc.conf(8), kdm]
To enable the X manager to begin on startup, create or change options in Section 1 of the /etc/rc.conf.local file
Edit the File: /etc/rc.conf.local and add a line that reads as follows in Section 1:
| kdm_flags="" # note the use of two double-quotes |
Edit the file: /etc/rc.local and add the lines
|
echo -n 'starting local daemons:' # [ ... stuff left out ... ] |
|
if [ "X${kdm_flags}" != X"NO" ]; then
|
|
echo '.' |
When you restart your machine, kdm will start and greet you with a dialog prompt for your username and password.
You can obviously go straight to this display manager from the command prompt by typing in '/usr/local/bin/kdm'
| # /usr/local/bin/kdm |
[ref: kdmrc]
kdm can be configured by root in the KMenu :-> Preferences :-> System :-> Login Manager
The configuration files for xdm are stored in /usr/local/share/config/kdm/kdmrc
Aspects of the configuration file that are appropriate to change include:
Edit File ./kdmrc to include the following settings
| [Shutdown] HaltCmd=/sbin/halt -p RebootCmd=/sbin/reboot [X-*-Greeter] ... DefaultUser= ... MinShowUID=1000 ... LogoArea=Logo LogoPixmap=/usr/X11R6/lib/X11/xdm/pixmaps/OpenBSD_15bpp.xpm |
HaltCmd. I modified this to include "-p" because my laptop must be powered off by software (i think) and if it merely halts without powering down, then the power switch essentially puts the laptop into sleep mode.
MinShowUID=1000. Standard users (so far as I know) begin at 1000 so specifically putting this in prevents system userids like www etc. from showing on the dialog box.
LogoPixmap=?. Specifies the pixture to use with the startup/login screen. Being patriotic, I recommend the OpenBSD logo as specified in the above example.
[Ref: /etc/X11/xdm/Xsession]
kdm offers three options (at least) of window managers to launch for a selected user. To configure kdm so it correctly launches KDE from the selection menu, make the following changes to the file Xsession: Change the section in the Xsession file that reads:
Edit the file Xsession and update the lines that read
|
case $1 in esac |
To read as follows
|
case $1 in |
|
kde | default) |
|
esac |
When you start kdm you can now select either failsafe or kde and kdm will launch the selected desktop environment. The '| default' will set the default desktop to the KDE instructions.
As you can see, you can now modify the kdmrc file to include further GUI desktop selections for your users. Of course, you should have the GUI installed and tested before making modifications both in kdmrc & Xsession
Edit kdmrc to modify the below line
| SessionTypes=default,kde,failsafe, |
to read as follows
| SessionTypes=default,kde,failsafe,fvwm |
and obviously you will have to make some additions to the script shown above for Xsession. The following is one example.
| case $1 in failsafe) xterm -geometry 80x24-0-0 do_exit ;; kde | default) /usr/local/bin/startkde do_exit ;; |
| fvwm) xterm & xterm & fvwm do_exit ;; |
| esac |
The following is a sample VESA /etc/X11/XF86Config I used for my laptop. This configuration is nice in how it handles multiple pointer devices and has been used by other laptop owners with a different configuration than specified in the comments.
The configuration file works with my:
OpenBSD 3.0 w/ XFree86 4.1.0
Toshiba Satellite Pro 4600, 15 inch Super VGA
16MB Trident CyberBlade XP
Gateway Solo 9300 Pro
The only changes made in this file, from the original files by hme were to specify the OpenBSD specific port devices and keyboard type and the fact that OpenBSD's wsmouse device can handle two input devices simultaneously(?).
# $Id: x-windows4.htm,v <IP_ADDRESS> 2002/06/10 02:09:58 samt Exp $ # # XF86Config (XFree86 4.0.2) file for Toshiba Satellite Pro 4600. # # This is a Trident CyberBlade XP graphics card with 16 MByte memory. # SVGA graphics is supported up to 1600x1200 @ 85 Hz. # The LCD is a 15 inch 1024x768 TFT. # # The card is not recognised by the trident driver, and the vga driver # gives only 320x200 pixels. So the generic vesa driver is used, which # supports up to 1280x1024. # # This file is bascially created with xf86config for an unsupported VGA card. # However, then the Driver was changed from "vga" to "vesa", the DefaultDepth # from 8 bpp to 16 bpp, and the Modes list reduced to "1024x768" only. # # If you add a "1280x1024" mode at the end of the Modes line, # you will have a 640x480 viewport on that size of screen, scrolled by # mouse movement. If you put that mode in front of "1024x768" you will # have a 1024x768 viewport on a 1280x1024 screen, but cannot scroll to # the right or bottom edge. # # 24 bpp and 32 bpp do not work, I suspect the card does not support # 24 bpp and the vesa driver does not support more than 24 bpp. # # This file is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. # # (C) 2001 United Kingdom Astronomy Technology Centre. # Horst Meyerdierks <hme over-at roe.ac.uk>. # Some sections courtesy of Helmut Bluhm. # # 2001/03/03: Original version. # 2001/03/04: Modified keyboard section, minor addition to mouse section. # 2001/03/08: Minor tweaking of keyboard section. # 2001/04/27: Remove references to pc101 in keyboard section, # to make my UK keyboard work with Red Hat 7.1 XFree86 4.0.3. # 2001/05/23: Dual mouse sections for simultaneous use of PS/2 and USB mice, # also both with IMPS/2 and ZAxisMapping. # 2001/06/01: Swap InputDevice lines in ServerLayout to initialise USB mouse # last (after keyboard). # 2001/12/12: /dev/wsmouse is adequate to pick up dual USB & Internal Pointer # device wsmouse(4)(samt) Section "Module" Load "dbe" # Double buffer extension SubSection "extmod" Option "omit xfree86-dga" # don't initialise the DGA extension EndSubSection Load "type1" Load "freetype" EndSection Section "Files" RgbPath "/usr/X11R6/lib/X11/rgb" FontPath "/usr/X11R6/lib/X11/fonts/local/" FontPath "/usr/X11R6/lib/X11/fonts/misc/" FontPath "/usr/X11R6/lib/X11/fonts/75dpi/:unscaled" FontPath "/usr/X11R6/lib/X11/fonts/100dpi/:unscaled" FontPath "/usr/X11R6/lib/X11/fonts/Type1/" FontPath "/usr/X11R6/lib/X11/fonts/Speedo/" FontPath "/usr/X11R6/lib/X11/fonts/75dpi/" FontPath "/usr/X11R6/lib/X11/fonts/100dpi/" FontPath "/usr/local/AbiSuite/fonts/" EndSection Section "ServerFlags" EndSection Section "InputDevice" Identifier "Keyboard1" Driver "Keyboard" Option "AutoRepeat" "500 30" Option "LeftAlt" "Meta" Option "RightAlt" "Meta" Option "ScrollLock" "Compose" Option "RightCtl" "Control" Option "XkbKeycodes" "xfree86" Option "XkbTypes" "default" Option "XkbCompat" "default" Option "XkbRules" "xfree86" Option "XkbLayout" "us" EndSection Section "InputDevice" Identifier "Mouse" Driver "mouse" Option "Protocol" "wsmouse" Option "Device" "/dev/wsmouse" Option "Emulate3Buttons" Option "Emulate3Timeout" "150" Option "ZAxisMapping" "4 5" EndSection Section "Monitor" Identifier "Tosh 4600 LCD" HorizSync 31.5 - 82.0 VertRefresh 50-90 EndSection Section "Device" Identifier "Standard VGA" VendorName "Unknown" BoardName "Unknown" # Chipset "generic" Driver "vga" # BusID "PCI:0:10:0" # VideoRam 256 # Clocks 25.2 28.3 EndSection Section "Device" Identifier "Trident XP" Driver "vesa" # unsupported card #VideoRam 16384 # Insert Clocks lines here if appropriate EndSection Section "Screen" Identifier "Screen 1" Device "Trident XP" Monitor "Tosh 4600 LCD" DefaultDepth 16 Subsection "Display" Depth 8 Modes "1024x768" ViewPort 0 0 EndSubsection Subsection "Display" Depth 16 Modes "1024x768" ViewPort 0 0 EndSubsection EndSection Section "ServerLayout" Identifier "Simple Layout" Screen "Screen 1" InputDevice "Mouse" "CorePointer" InputDevice "Keyboard1" "CoreKeyboard" EndSection |
My apologies to the purist, I tried to maintain where I got the above information (some Toshiba site in Japan) but didn't do a good job of that so I do not have a link to the original source.
[ref XFree86(1)]
I have a machine that of OpenBSD 3.2 and XFree86 4.2.1, the video card was not directly supported so it was very hit and miss on how to set up X.
The direction I had to take was to manually run the XFree86 binary (/usr/X11R6/bin/XFree86) with the following option.
| -configure When this option is specified, the X server loads all video driver modules, probes for available hardware, and writes out an initial XF86Config(5) file based on what was detected. This option cur rently has some problems on some platforms, but in most cases it is a good way to bootstrap the con figuration process. This option is only available when the server is run as root (i.e, with real-uid 0). |
After running XFree86 -configure, the program stores the new configuration at
/root/XF86Config.new and you can test the configuration using:
| # XFree86 -xf86config /root/XF86Config.new |
This gives me the opportunity to fine-tune the configuration before installing it as my full config.
| -xf86config file Read the server configuration from file. This option will work for any file when the server is run as root (i.e, with real-uid 0), or for files relative to a directory in the config search path for all other users. |
The program will give me a working Screen and Video Card Device section which, again, can be finetuned.
Some addresses picked up on the misc@ mailing list.
Tutorial at IBM http://www-105.ibm.com/developerworks/education.nsf/linux-onlinecourse-bytitle/3100FF4795B3F31F86256AF70056FDB3?OpenDocument
Copyright (c) 2000/1/2 Samiuela LV Taufa. All Rights Reserved.
You are permitted and encouraged to use this guide for fun or for profit as you see fit. If you republish this work in what-ever form, it would be nice (though not enforceable) to be credited.
|
XF86 4.1 a pretty face on OpenBSD |
Copyright © 2000/1/2 NoMoa.COM All rights reserved.


+++ date = "2016-02-10T16:36:56-05:00" title = "pricing" +++
No credit card required, try PageProofer for 15 days and then decide which plan suits you best
Get Started"PageProofer is a fantastic tool for our development toolbox. It eliminates the need for multiple spreadsheets and pdfs to track change requests, and gives us and our clients one simplified point for feedback creation, tracking, and sign-off."
Joe @ AtomicmouseRegister without a credit card and you automatically get a free trial account. At any time during your free trial simply upgrade your account to any paid subscription and your new subscription is instantly available. Your trial period ends when you upgrade your account.
You can easily change your plan in the account section. Sign in, click the 'Account' link, and select the plan you want. Your account will be prorated to reflect the change in plan price.
No. PageProofer is month-by-month subscription. Once you sign-up, your credit card will be billed each month automatically. You can cancel at anytime with no questions asked. If you decide to cancel, you will be billed for the current month and then your subscription will be closed.
Yes, you can upgrade or downgrade at any time. Upgrades take place immediately. Downgrades take place at the end of your current billing period.
We accept Visa, Mastercard and American Express. Payment processing is handled by Stripe on their secure servers. All payments are in US funds.
Feel free to contact us and we will answer any question you have.
Free feel to read our terms of service and privacy policy.


{{> head}}
{{> header}}This is a simple client-side script that displays the textContent
of the HTML pasted into the textarea below. It allows you to view the resulting
text string and compare other implementation of textContent
with this
browsers implementation.
665 3rd St. \n Suite 207 \n San Francisco, \n CA \n 94107 \n U.S.A. 665 3rd St. \n Suite 207 \n San Francisco, \n CA \n 94107 \n ‐U.S.A.


Hi, I'm Peter, I'm 21 years old and come from Hungary. Currently I'm studying IT at university. My favourite programming languages are: Java, JS, HTML, CSS. In my freetime I like taking and editing photos.
I enjoy coding in Java, and takin photos in my freetime.
Write me an e-mail to<EMAIL_ADDRESS>Search me on Facebook...


Bikes for Men
Trek's Checkpoint SL 6
Price: $3,799.99
The Checkpoint SL 6 is a carbon gravel bike without limits. It's designed to take you places you'd never reach on a standard road bike—like the mud-caked finish line of the world's greatest gravel races. A lightweight OCLV Carbon frame with gravel-smoothing IsoSpeed, a full Shimano Ultegra drivetrain, and extra mounts for gear and accessories make Checkpoint SL 6 a true gravel powerhouse and the best choice for serious all-road adventurers.
Diamondback's Overdrive 2 29 C
Price: $2,549.99
The Overdrive 2 29 C is, first and foremost, built for speed; something that comes naturally to the bike, thanks to its featherweight carbon monocoque frame and top-shelf componentry. We’ve decked out this whip in RockShox’s race-proven SID RLC fork, a SRAM GX Eagle wide-range drivetrain (the hills will never know what hit them), powerful SRAM Guide R hydraulic disc brakes, and our own tubeless-ready Blanchard 25R wheelset.If you’re lining up at the next race, or simply racing your own previous records, this is your weapon.
Specialized's S-Works Tarmac Disc
Price: $11,000
The new S-Works Tarmac Disc is built to be fastest everywhere. On Long climbs, windy flats, Grand Tour stages, and local fondos. Now with our disc brakes, we've managed to make it, well, even more complete. We utilized advanced aerospace composite optimization software to revolutionize the construction and layup of the 12r carbon. It's the most advanced material, and schedule, we've ever made and this allowed us to shed nearly 200 grams.
Bikes for Women
Trek's Top Fuel 9.8 SL
Price: $5,199.99
The Top Fuel 9.8 SL Women's is the full suspension XC mountain bike for riders who want every lightweight advantage. An OCLV Mountain Carbon frame, Bontrager carbon wheels, FOX suspension, and lightweight performance parts make this bike the perfect sidekick for serious XC riders who want a lightweight rig with the added comfort of touchpoints designed for women and is right for riders who want a rocket of a bike to tackle cross country racing and marathons.
Diamondback's Clutch 1
Price: $1,899.99
Our female riders love how our new suspension design brings a mix of climbing efficiency and downhill ability to a trail bike. The system has allowed us to make lighter, shorter travel bikes that are just plain fast everywhere. The Clutch 1 is a bike for the female rider who’s looking to ride it all: climbing backcountry classics to flowing new machine-built trails. A short rear end and longer cockpit keeps the bike stable at speed, while still being a blast in the corners.
Specialized's Women's S-Works Tarmac
Price: $10,000
It's simple—when someone attacks on a climb, you want to respond quickly and with confident assurance. And when it's you who's breaking away, you need to accelerate with snappy intensity and leave everyone in your dust. The Women's S-Works Tarmac SL6 with Shimano Dura-Ace Di2 is born to race to any strategy, and it's at the absolute top of the women's race bike heap in terms of performance, quality, technology, and handling. This mountain bike is made for today’s aggressive riders.


Many Scheme implementations support exact arbitrary-precision integer arithmetic as well as exact rational number computation. This SRFI extends the rational numbers of R5RS by adding two rational infinities (1/0, -1/0).
With infinities added to the number system we find that division by zero "works". It lets initialization of variables precede bounds checks and gives flexibility in placement of those checks.


Relations
API Overview
All RelationTypes
Gives a list of all RelationTyes in the system:
Example response
[
{
"id": 6,
"rtype": "Containment",
"role_from": "contained by",
"role_to": "contains",
"symmetrical": false
},
{
"id": 5,
"rtype": "Generic",
"role_from": "Generic",
"role_to": "Generic",
"symmetrical": true
},
...
{
"id": 4,
"rtype": "Subentry",
"role_from": "Main Entry of",
"role_to": "Subentry of",
"symmetrical": false
}
]
Field Descriptions
| Field |
Type |
Description |
| id |
Integer |
Internal id and primary identifier for each RelationType |
| rtype |
String |
Description of the RelationType. Only used internally, not seen by the end user |
| role_from |
String |
Description of a single direction of a basket relationship: displays when the basket direction is "destination". E.g., in the Main Entry/Subentry relationship above, if the relation on the basket says "destination", the relation will display as Main Entry of TARGET_TOPIC |
| role_to |
String |
Description of a single direction of a basket relationship: same as above, but for relations labeled "source" |
| symmetrical |
Boolean |
Tracks whether the role_to and role_from are identical for that topic type |


Name:
Customer name error
Surname:
Customer surname error
OIB:
Customer OIB error
Birthdate:
Error in birthdate field!
Email:
Error in email field!
Address:
Error in address field!
Phone:
Error in phone field!
Select membership:
--select membership type--
Error in membership field!


Status: Accepted v8 (superseding v7) on 15-0 vote, Jun-90Issue: PACKAGE-CLUTTER
References: LISP, USER, SYSTEM packages (p181)
Related issues: LISP-SYMBOL-REDEFINITION, DEFPACKAGE,
MAKE-PACKAGE-USE-DEFAULT, IN-PACKAGE-FUNCTIONALITY
Category: CHANGE/CLARIFICATION
Edit history: 07-Jul-88, Version 1 by Pitman
23-Sep-88, Version 2 by Masinter
5-Oct-88, Version 3 by Masinter
7-Oct-88, Version 4 by Masinter (response to KMP)
8-Dec-88, Version 5 by Masinter
(add property lists)
12-Dec-88, Version 6 by Masinter (respond to comments)
17-Mar-89, Version 7 by Masinter (as amended Jan 89 X3J13)
3-Jan-90, Version 8 by Barrett (add more cases)
Problem Description:
CLtL specifies that
``The package named LISP contains the primitives of
the Common Lisp system. Its external symbols include
all of the user-visible functions and global variables
that are present in the Common Lisp system, such as
CAR, CDR, *PACKAGE*, etc. Almost all other packages will
want to use LISP so that these symbosl will be accessible
without qualification.''
It specifies "all" but not "all and only".
Some implementations place their extensions in the Lisp package.
Nothing in CLtL explicitly prohibits this, but it leads to problems
in general. For example:
- A user defining a function by a name not mentioned in CLtL may be
surprised to clobber a system function in some implementations
- In one particular implementation, the variable HELP was a system
constant, so that ((LAMBDA (HELP) ...HELP...) "Press ? for help.")
signalled a correctable error (asking what variable to bind
instead of HELP :-).
Proposal (PACKAGE-CLUTTER:REDUCE):
Specify that, not only must the LISP package contain at least all of the
symbols listed in the standard, it will have no other external symbols.
(The LISP package may have additional internal symbols.)
External symbols of the LISP package may have function, macro, or special
form definitions, setf method definition, top level value or SPECIAL
proclamations, or type definitions only if explicitly permitted in the
specification. That is, a program is valid Common Lisp if it assumes that
this is true; for example, FBOUNDP will be false for all external symbols of
the LISP package except those documented to be functions, macros or special
forms; no setf method will be defined for such a symbol, and FBOUNDP on
(SETF symbol) will be false; BOUNDP will be false for all those except those
documented to be variables, and portable programs can use symbols in the
LISP package as local lexical variables with the presumption that the
variables are not proclaimed special, except for those variables specified
as constants or variables.
No external symbols of the LISP package may have properties with
property indicators that are either external symbols of packages
defined in the standard or are otherwise accessible in the USER
package.
This proposal constrains implementations as to what their
initial package configuration must be. That is, valid programs
can assume that the conformal Lisp implementation will not
have prohibited properties. The proposal LISP-SYMBOL-REDEFINITION
addresses the converse; that is, what user programs are allowed
to do.
Eliminate the requirement that the initial Common Lisp system
have a package named "SYSTEM". Specify that implementations may
have several other packages available, that these should be
documented. If it is appropriate, the standard might contain
as an example that implementations might have a package named
"SYSTEM".
Clarify that the "USER" package may have additional symbols interned
within it and that it may :USE other implementation-specific packages.
Examples:
#1: The symbol HELP may not be on the LISP package because it is not
mentioned in CLtL.
#2: The symbol VARIABLE is specified to be on the LISP package (because
it is a valid second argument to the DOCUMENTATION function). Since
it is not defined as a variable, type, or function, however, it will
not initially be bound, defined as a type, or defined as a function,
macro or special form.
Rationale:
If extra symbols are permitted in the LISP package, users may be surprised
by relationships between the LISP package and other packages which they
did not expect, or may be surprised by functionality that they did not
expect. The degenerate case is:
(DEFCONSTANT LISP:A 'YOU-LOSE)
(DEFCONSTANT LISP:B 'YOU-LOSE)
(DEFCONSTANT LISP:C 'YOU-LOSE)
...
(DEFCONSTANT LISP:AA 'YOU-LOSE)
(DEFCONSTANT LISP:AB 'YOU-LOSE)
(DEFCONSTANT LISP:AB 'YOU-LOSE)
...etc.
Given such an implementation, even things like (LAMBDA (X) X) are not
valid because they attempt to bind "system constants". It is necessary
that the programmer be able to know for sure that an arbitrary name is
"free for use" and best way to conveniently assure this is to require
that the LISP package be unadulterated.
As for the additional definitions, there are situations where additional
definitions would cause a problem. For example, if a symbol on the Lisp
package were declared as a special variable even though that value was
not mentioned in the standard, that variable would behave incorrectly when
used as a lexical variable. Similarly, if a symbol in the lisp package
were defined as an implementation-dependent special form, problems might
result if a user redefined or even bound (as by FLET or MACROLET) that
name.
The LISP package is the foothold from which portable programs establish
their desired environment. Careful control is desirable to make sure
everyone is starting off on the right foot.
Current Practice:
Some implementations have been known to add additional symbols (usually
functional and/or variable extensions) to the LISP package.
Several implementations have restricted the LISP package to only contain
those symbols in CLtL. (The exact set was difficult to extract because not all
LISP package symbols appeared in the index of CLtL.)
Even in those implementations that have only the prescribed symbols in CLtL,
there can be extra definitions for those symbols. For example, in Symbolics Genera,
the symbols EVALHOOK, ROOM, and APPLYHOOK
are spuriously defined as special variables, and the symbol LAMBDA is defined
as a macro.
Performance Impact:
None
Cost to Implementors:
The actual cost of moving the symbols out of the LISP package in cases
where they are not already gone is quite small. However, if any
implementation really has to do this, it may have a number of suppositions
about what is in what package, and the changes could potentially be extensive.
Cost to Users:
This change is upward compatible with any portable program, but users
of a particular implementation's extensions may be forced to find their
functions in a different package, so there may be a measurable practical
cost.
In many cases where an extension symbol FOO is simply expected to have
been directly available (due to :USE "LISP"), it will work to just just
do (IMPORT 'new-home-package-for-foo:FOO) where the user's package is
declared.
More likely the extension symbols would be moved to one or more
extensions packages, e.g. ACME-COMMON-LISP, so user packages in which
the extensions were desired could simply :USE the extensions package(s).
Implementations might want to use this way of conforming with this
proposal in order to minimize cost to users.
In many cases where an extension symbol FOO is used by explicit package
prefix, such as LISP:FOO, it should be easy to search for `LISP:FOO' or
even `LISP:' to find the cases.
Cost of Non-Adoption:
The potential for the LISP package to be adulterated and for supposedly
portable programs to have difficulty getting a foothold in some
implementations will be `noticeably non-zero'.
Benefits:
Portability of some programs will be enhanced.
Aesthetics:
This change probably supports the naive expectation of most programmers
writing portable code.
Discussion:
This proposal basically affects what implementors are allowed to do;
it says that portable programs can rely on a standard initial package
structure with the same symbols in it. A separate proposal,
LISP-SYMBOL-REDEFINITION, discusses the restrictions on portable
programs as far as redefining LISP symbols.
Whether the USER package may contain symbols other than those
specified in the standard was controversial. The smart programmer
of portable code will never rely on the contents of the
USER package. However, if someone wants a completely empty
package that uses only Lisp, it's easy and portable to create one.
While it would improve portability slightly to disallow additional internal
symbols in the LISP package (since it affects what DO-SYMBOLS will do)
explicitly prohibiting a common practice didn't seem like the best way
to discourage a possibly troublesome implementation technique.
Implementors should be especially careful about accidentally
exporting unwanted additional definitions for symbols,e.g., a variable
definition for EVALHOOK which might show through because of
an unintended name collision.
It is likely that the recently included portions of the standard (CLOS and
the signal mechanism) will reside in their own packages. These externally
defined packages should have the same constraints as outlined for
the LISP package here.
There has been a suggestion that vendor-specific extensions should
be placed in a package named like ACME-COMMON-LISP for the "Acme"
company.
A registry of packages (as well as features, modules and other global
names) would be useful, although probably not a part of the language
standard, per se.
Barrett and Pitman support superseding version 7 with version 8.
----------
Additional comments on the write-up:
"This is clearly correct." --Moon (9 Jan 90)


Hello there, my name's Raheem Kirlew. At age 14 I was told to make a website for fun and since then, I have been addicted , not only to making websites but also software. Calling myself passionate about programming would be an understatement, since I live and breathe it. I aspire to be the best software engineer I can be and in doing so make the lives of those around me better.
Blogr - A static site project showcasing HTML, CSS, and JavaScript. Modern publishing platform with an intuitive UI, extensible editor, and robust content management. Built with clean architecture and easy-to-learn code.
Twendz is a search engine which enables users to view the sentiment behind specified tweets, hashtags and people. Made after a day of learning Flask. The site is currently hosted using Heroku so will take some time to load up the first time you visit.
A voice controlled virtual assistant that is able to complete simple tasks such as checking the current weather, finding Youtube videos, reading a Google search etc
Powerful student management system made in C as an academic project. Allowed teachers to register new students, edit existing ones, grade exams, create and issue grades in the form of report cards, to rightful students as well as delete student records
A simple social networking site for people who don’t like mainstream platforms. Allows users to post statuses, images, follow each other to view their statuses unfriend each other, get notified of new friends, as well as search for other users.
BC Architects is a a static website for a fictional architecture firm. The website showcases the firm's portfolio of projects, and services. The website is built using HTML, CSS, and JavaScript and is designed to be fully responsive, adapting to different screen sizes and devices.
A responsive landing page for a personal brand made using HTML,CSS, Javascript and Bootstrap.
A daily quote and image application made using Flask. Uses NASA's API to fetch the background image and Wikipedia's API for the quote
Platform that allows users to find various recipes based on their search using Edamam's Recipe & Food Search API
React App that fetches weather based off of user input using OpenWeather API. Has a dynamic background which adjusts based on the temperature of the location.
A cross platform application that allows you to view information on popular movies, including the ratings, search for movies, search for series, view information on popular series as well as get random movie suggestions. Why scroll through Netflix when you can just tap a button and get a random suggestion?
Apart from programming, I also enjoy playing video games occassionally and studying foreign languages. I am also an avid Youtube viewer and use it as a learning platform.


Inside Abandoned Death Row Prison Where Inmates’ Bodies Found At Bottom Of Well
by Emily BrownChilling photos taken by an urban explorer show an abandoned Thai prison where a number of inmates are said to have taken their own lives by jumping down a well.
Advertisements
Members of the public are typically prohibited from entering the dilapidated facility, located in Chiang Mai, Thailand, but American urban explorer and ICT teacher, Dax Ward, 39, managed to get inside for a closer look.
The death row prison shut down in 2013 but the structure still remains, with photos showing utilitarian cells where multiple prisoners would be forced to live together; the overgrown courtyard where convicts got a breath of fresh air; and the creepy well where a number of bodies were discovered, supposedly after a mass ‘suicide’.
Advertisements
Ward, who specialises in photographing abandoned sites across Thailand and south-east Asia, described the deaths as ‘suspicious’ and said the exact number of bodies found in the well has never been released.
He commented:
Executions were performed here as it was a death row facility, and a number of egregious events were said to have occurred here, including suspicious ‘suicides’ of inmates in a water well.
A number of bodies were found in a certain well on the premises, with suicide being given as the cause of death.
Jumping into a well doesn’t seem the optimal way to commit suicide. Sometimes it’s just easier to list the death as a suicide to avoid having to do an investigation.
The prison was opened in the early 20th century and housed only male inmates until the 1970s, when the convicts were sent to a newer, larger incarceration centre. The facility then became a women-only prison until its closure in 2013.
Ward has explored and documented more than 30 derelict locations in Thailand, though he wanted to look around an abandoned prison as he felt it would offer ‘a very different atmosphere from other locations’.
Advertisements
He continued:
This particular prison was in operation over a period of about a century, so it saw its fair share of ‘guests’ during that period.
Every abandoned place that I shoot has its own ‘if these walls could talk’ quality, but some do more than others, and the prison is one that the walls would have a lot of stories to tell. I don’t think that many of those stories would be happy ones.
Though the explorer does not believe in ghosts, he admitted the prison had a ‘really creepy vibe’.
The prison is said to have been one of the ‘better’ facilities in terms of living conditions for the inmates, though Ward had his doubts about how comfortable it really could have been as the buildings suggest inmates would have been cramped into cells with no privacy.
Advertisements
Following the prison’s closure in 2013, a team of Buddhist monks spent a week there attempting to ‘cleanse’ it of evil spirits as it is ‘widely understood’ in Thai culture that spirits ‘must be treated with respect and vigilance’.
Ward explained:
These ceremonies are sometimes held at a location to appease the spirits of those who once dwelled there so that they do not seek vengeance on future inhabitants.
Seven days and nights of rituals is very unusual, however, indicating that there were believed to be a lot of nefarious happenings at the prison during its century of operation.
The goings on at the prison certainly sound mysterious.
Emily Brown first began delivering important news stories aged just 13, when she launched her career with a paper round. She graduated with a BA Hons in English Language in the Media from Lancaster University, and went on to become a freelance writer and blogger. Emily contributed to The Sunday Times Travel Magazine and Student Problems before becoming a journalist at UNILAD, where she works on breaking news as well as longer form features.


Transfer-function exercises:
A temperature sensor on an aircraft has first-order dynamic response, and you need to make measurements that respond to abrupt (i.e., step-function) changes by reaching 90% of the final value in 100 m of flight path, while flying 200 m/s. What is the required time constant of the sensor?
For a ramp input with slope such that x=t / τ, at long times a first-order system will lag behind that input by τ (in these plots, 1 s), so this is a possible way to find the time constant and to provide corrections for such a system. For a second-order system, the response is more complicated and depends on both the characteristic angular frequency and the damping. However, for critical damping the system (at long time) again lags behind the input signal by a fixed amount, so the lag again can be used to find the characteristic angular frequency ω of this system. What value of ω is needed so that the second-order lag is also 1 s?
To determine the type of response characteristic of an unknown system, it is often revealing to determine the system response to an impulse function. Suppose you have a measuring system with unknown characteristics, and you find it responds to an impulse as shown below:
s it first-order or second order?
If first order,
what is the approximate time constant?
If second order:
What is the approximate characteristic angular frequency?
Is it [overdamped, critically damped, approximately γ =0.7, or more weakly damped?
A1: You reach 90% response in 2.3 time constants, as shown by the first-order response to a step function. (To see this, select "step" and use the cursor moving over the blue line to find the "Time" corresponding to M1=0.9.) You need 2.3 τ = 0.5 s or τ = 0.22 s.
A2: Leave the setting of γ = 1 and adjust the value of ω until the first-order and second-order response lines overlap at long time. The required value of ω is about 2.1. [Hint: you can make fine adjustments to the sliders by left-mouse-clicking the slider button and then using the left-arrow or right-arrow keys.] Also try some smaller values of γ to see how this decreases the lag.
A3: It is second order. A first-order system always responds toward the current value of the input, so it would not continue upward after the impulse function returns to zero. The slight overshoot past zero indicates that the system is modestly underdamped, and the magnitude of the response at about 0.2 s indicates an angular frequency significantly larger than 1 radian/s. You can obtain a reasonable reproduction of this response curve by moving the γ slider to give a small overshoot and then moving the ω slider to match the amplitude of the response. Try interatively adjusting these two controls until the response matches the figure in the question.


./komodod -ac_name=ZAWY24 -ac_adaptivepow=1 -ac_supply=1000000 -ac_reward=10000000000 -ac_cc=2 -addnode=<IP_ADDRESS> &
A channel to discuss mining. For useful links and more info click the pinned messages to the right.
Intel® Core™ i9-9900K Processor (16M Cache, up to 5.00 GHz) quick reference guide including specifications, features, pricing, compatibility, design documentation, ordering codes, spec codes and more.
are LGA2011 and LGA1151 same?
ComputerGenie 👴👴👴18-Oct-18 03:31 PM
Guess I looked at it wrong
Well, now I'm back to debate of i9 or threadripper
SHossain18-Oct-18 03:34 PM
i was wondering how is that possible and why i never seen a mb that supports 2 desktop CPUs
for sure i want one
jl777c18-Oct-18 04:02 PM
or 64 of them
2
ComputerGenie 👴👴👴18-Oct-18 04:04 PM
If I push my budget limit, I can afford 6.4 of them, maybe
Jules - coinblockers.com18-Oct-18 06:11 PM
Dual with desktop cpu? No way unless it’s a xeon e5-2xxx :-P
While for 4 cpu boards e5-4xxxx is required.(edited)
polycryptoblog18-Oct-18 09:30 PM
Has does one go about making a CPU rig? Just a bunch of multi CPU motherboards and associated CPU ? Anything else to it?
ComputerGenie 👴👴👴18-Oct-18 09:33 PM
a "CPU rig" is nothing more than a "bare bones" PC
polycryptoblog18-Oct-18 09:35 PM
Ok simple enough, wasn't sure if there was something more to it
dukeleto18-Oct-18 09:38 PM
@polycryptoblog i have a fancy mobo + CPU sitting on a piece of cardboard box, no case of any kind, wires everywhere, mining VRSC
@ComputerGenie 👴👴👴 is that "bare bones" ?
for efficiency of capital costs, I think recent laptops win out
ComputerGenie 👴👴👴18-Oct-18 09:38 PM
except for the "fancy mobo" bit
dukeleto18-Oct-18 09:38 PM
but maybe CG has some crazy math research to dump on us
yeah, i could have spent less on mobo, i spent like $150 instead of $90ish
i am not doing this at scale
i mine VRSC on 3 laptops and 4 desktop/servers
solo mining since the olden 384 times
i am often surprised which machines outperform others
polycryptoblog18-Oct-18 09:41 PM
Yes, is it better to go completely barebones with consumer desktop/laptop is the hash from server CPUs comparable or better than the desktop CPU ?
dukeleto18-Oct-18 09:41 PM
laptop get better watt per hash
lower power costs per coin, it works out to
laptops also take up way less space
polycryptoblog18-Oct-18 09:42 PM
And easier resell value
dukeleto18-Oct-18 09:42 PM
make sure to account that even tiny compact "lunchbox" desktops need to have a monitor/keyboard connected for maintenance (which always fucking happens)
VRSC has had so many mandatory upgrades
those old library "thin" desktops are the shiznizzle
but laptops don't need to have monitors and laptops within cable distance/etc, they are less maintenance in that respect
I am a tiny miner, but I see that the time you spend maintaining rigs is the biggest "hidden cost" that almost nobody accounts for
I rented time on beefy AWS boxen for VRSC, when that was a reasonable thing to do. nethash is basically too high for AWS prices now
if you find something that is viable, let me know
polycryptoblog18-Oct-18 09:48 PM
That's why I went asic , just interested in spreading out into other kinds of mining. I think CPU /GPU will have a place still in the future , I'm surprised no one has done a BOINC based system with a proper business model . I think we will see it in the kmd ecosystem in the next couple of years
dukeleto18-Oct-18 09:51 PM
Right now I only have ASICs and CPU VRSC miners warming me, I like diversifying into both instead of being "all-in" with one or the other
each allow for different opportunities
I have a few old ati radeon 58xx GPUs that mined BTC back in the day, wondering what they can pull in VerusHash now
What I hear is that there will be "blood on the streets" next month when ETH block reward goes from 3 to 2, and those ETH miners will scatter their 1080ti's to the winds of all the altcoins in weird places
raising them hashrates, to the tears of many a hobby miner
polycryptoblog18-Oct-18 09:54 PM
Yes it's already starting can find 1080 at like 400 1080ti at 550
dukeleto18-Oct-18 09:54 PM
one of them places they go is VRSC
would I pay $500 for a GPU right now, a used one, to mine VRSC? That is a hard question
i mined a ridiculous amount of VRSC, that is timelocked, in the 384 block days, so my perspective is warped. But VRSC is at something like 35 cents now. Not sure the math works out to buy the GPU
but if you have it already
it makes a lot of sense to point it at VRSC
polycryptoblog18-Oct-18 09:56 PM
I'm considering getting the vega gpus they are going pretty cheap and its replacement isn't coming out anytime soon
dukeleto18-Oct-18 09:57 PM
i really know nothing about GPU mining VRSC, I have always done CPU solo from the beginning. It's hard to keep track of
i5/i7's are the sweet spot for cost/hash it seems, and I like CPU mining for some reason
ComputerGenie 👴👴👴19-Oct-18 07:20 AM
is taking suggestions for what domain to use for his upcoming pool
Cryptoon19-Oct-18 07:29 AM
GeniePool
jansako19-Oct-18 07:54 AM
Is it going to be just pirate or a general one? I saw booty-pool is taken
blackjok3r19-Oct-18 08:16 AM
GeniesFreePool
1
3
ComputerGenie 👴👴👴19-Oct-18 11:21 AM
@jansako It will be several coins (all within the Komodo ecosystem)
2
Cryptoon19-Oct-18 11:45 AM
run by that script you have been working on?
ComputerGenie 👴👴👴19-Oct-18 11:49 AM
To start with, it'll be just znomp fork that's got changes made for KMD (and assetchains) with all of the unnecessary bits chopped out
As time goes on, I hope to finish porting ckpool from sha256 to equihash and use that
1
ComputerGenie 👴👴👴19-Oct-18 12:15 PM
LOL @Cryptoongeniepool.com is available
$1,995.00+ $14.99*/year
Cryptoon19-Oct-18 12:16 PM
2k is plenty
yettymonkey19-Oct-18 01:25 PM
hey guys any idea about how much KMD can be mined a week with 10 Vega 64's?
Verus Coin nvidia CUDA GPU miner by monkins1010. Contribute to monkins1010/ccminer development by creating an account on GitHub.
i am hearing people saying they get way higher hashrate on ccminer, not just some small %
or compared against nheqminer
I am seeing a 25% hashrate increase in ccminer over vrsc full node, shaking my head
not sure I can trust those numbers, so I will collect more data
50% hashrate increase? Am I dreaming?
1
dukeleto19-Oct-18 06:01 PM
ccminer vs vrsc full node mining has a ~65% hashrate improvement, same hardware. quite the tax on the solo miner
MrSpice19-Oct-18 06:23 PM
Hey all how do i mine via gpu
ComputerGenie 👴👴👴19-Oct-18 06:24 PM
@MrSpice how do we mine which coin?
MrSpice19-Oct-18 06:29 PM
The pirate coin
Komodo
ComputerGenie 👴👴👴19-Oct-18 06:34 PM
Have you mined any other equihash coins before? via GPU?
MrSpice19-Oct-18 06:35 PM
No :(
@ComputerGenie 👴👴👴 sent message dm
ComputerGenie 👴👴👴19-Oct-18 06:37 PM
I'm looking for a decent beginner's tutorial .....
it might take me a bit to find one...
MrSpice19-Oct-18 06:38 PM
No prob...accreciate it
Appreciate
I have 3 rx580s overclocked
ComputerGenie 👴👴👴19-Oct-18 06:39 PM
hmmmm
goes off in search of an AMD turorial
ComputerGenie 👴👴👴19-Oct-18 06:48 PM
https://www.youtube.com/watch?v=gCsa2c1IDR4 <- looks like it should give you the basics (I have not checked any of his links, so do own due diligence), from there you can just substitute "ZCash" with Komodo (and an actual KMD pool ,of course) and you're good for that
Once you get that down, hop over to #deleted-channel and someone can give you the rundown of how to get a zaddress needed for PIRATE and then it's a similar process
Today i show you how to start mining ZCash with the new Claymore miner v12.6! (Soon to come on the NEW BuriedONE Website R2.0!) Original Download: https://me...
TJAVALANCHE19-Oct-18 06:54 PM
@WeyezOD thanks
1
grewalsatinder19-Oct-18 07:28 PM
@dukeleto you said staking won't be active by default on starting updated verus
what's the command to start staking ?(edited)
@jl777c
ComputerGenie 👴👴👴19-Oct-18 07:29 PM
should be setgenerate true 0
no?
grewalsatinder19-Oct-18 07:30 PM
I thought that's only for mining
I started komodod with no gen params since CPU mining is waste
ComputerGenie 👴👴👴19-Oct-18 07:31 PM
if they are using the same params we do, -1 = all cpu, 0 = staking, and any other number = that many cores(edited)
grewalsatinder19-Oct-18 07:31 PM
oh cool! thanks
gonna execute that command
1
dukeleto19-Oct-18 08:07 PM
@grewalsatinder verus stakes by default until the new 0.4.0 release, then you have to turn it on, I am not using that yet, so I am not sure how
grewalsatinder19-Oct-18 08:44 PM
I executed that command genie gave. chain was doing validate/resyc again so will see once it's done.
let's see if it still does staking
MrSpice19-Oct-18 09:36 PM
What are the pool settings and where do i get a wallet?
ComputerGenie 👴👴👴19-Oct-18 09:41 PM
the pool you want to mine at will tell you their settings


{% from "macros.html" import favicon %}
We were unable to email your application to the {{ session['registrar_locality'] }} registrar. Please resubmit the form later, and contact our developers at<EMAIL_ADDRESS>and sumanth@eabsentee.org


The library describes a standard set of requirements for executors. A type meeting Executor requirements shall embody a set of rules for determining how submitted function objects are to be executed.
An executor type X
shall
satisfy the requirements of CopyConstructible
(C++ Std, [copyconstructible]) types. No constructor, comparison operator,
copy operation, move operation, swap operation, or member functions context
, on_work_started
and on_work_finished
on these
types shall exit via an exception.
The executor copy constructor, comparison operators, and member functions defined in these requirements shall not introduce data races as a result of concurrent calls to those functions from different threads.
In the table below, X
denotes
an executor class, x
denotes
a value of type X&
,
x1
and x2
denote values of type const X&
,
x3
denotes a value of type
X&&
,
f
denotes a MoveConstructible
(C++ Std, [moveconstructible])
function object callable with zero arguments, a
denotes a value of type A
meeting Allocator
requirements
(C++ Std, [allocator.requirements]), t
denotes an object of type T
,
and u
denotes an identifier.
Table 12. Executor requirements
|
expression |
type |
assertion/note |
|---|---|---|
|
|
Shall not exit via an exception. |
|
|
|
Shall not exit via an exception. |
|
|
|
|
Shall not exit via an exception. |
|
|
|
Shall not exit via an exception. |
|
|
|
Shall not exit via an exception. |
|
|
Shall not exit via an exception. |
|
|
|
Shall not exit via an exception. |
|
|
|
Effects: Calls |
|
|
|
Effects: Calls |
|
|
|
Effects: Calls |


 Someone has been dispatched to poke them with a sharp stick.
Back to previous page


Welcome! My name is Kevin Keenan. I am a senior CS student at the University of Texas-El Paso. I expect to be graduating in May of 2016. My goals after graduation are to be a productive member of a software/internet application team. I am a professional, courteous individual who always looks to better himself and the team.
I have been working with web technologies for over a year now. I have gained a passion for web development. During my experience, I have developed skills in Javascript, jQuery, angularJS, HTML, CSS, C#, SQL,and the Model View Controller architectural design pattern (MVC).
I'm also currently involved in a self-started group, TagWorks. This group consisits of myself, Matthew Melendez (web developer), and Enrique Avalos (Graphic Designer). We build/maintain web applications and websites for the Enrollment Services Technology group at UTEP.
My team is also available for freelance work. Please contact us with your name, your place of business, and any necessary information needed to build your website. Due to the varying complexities with building websites, we will only be able to give you a quote once we have all of the necessary information.


Welcome to TOP ...
Python numPy
Open Image
gmail.com
List example
- one
- two
- Three
- FOur
- ZFive
Welcome to HTML Page
Welcome to HTML Page
Welcome to HTML Page
Welcome to HTML Page
Welcome to HTML Page
Welcome to HTML Page
TYHis is a paragraph
You are currently using http://www-eu.apache.org/dist/.
If you encounter a problem with this mirror, please select another mirror.
If all mirrors are failing,
there are backup mirrors (at the end of the mirrors list) that should be available.


Cultural Blog #7: Diamond in the rough
07/13/15
This week we were given a table of words and asked to pick which ones coincided with our happiest, proudest, etc moments. I looked at this list and only one of them really stood out to me. It was the word Challenge.
You may wonder why that word. Well honestly it's because any noteworthy thing that I have achieved it was because someone challenged me.I don't mean in the sense that I was challenged to a race or anything. I mean it in terms of being doubted. I was challenged through a good portion of my life to feel like I needed to prove myself. There were people in my life that made me feel like I couldn't be good enough. I would always challenge that by doing what they said I couldn't do. I always take the challenges to prove my worth because I know I'm worthy of everything I achieve.
I don't really know the answer to the next part. I can't remember the last time someone asked me for advice. I'm usually the one that listens to people when they need to talk. I don't know that I've offered any key advice lately though.
I don't know that the value I picked from this would help with stereotype threat but I do listen to people. I like to know all sides of the story and be something of a mediator. As far as cheering myself up at DBC usually some fresh air or coffee will do the trick for me.


|
|
P
|
R
|
O
|
G
|
R
|
A
|
M
|
M
|
I
|
N
|
G
|
|
C
|
O
|
M
|
P
|
E
|
T
|
I
|
T
|
I
|
O
|
N
|
|
Gene
Sequencing
|
|
|
|
Task Description
You are working
on the human genome project, and your team is closing in on the last few base
pairs needed to complete the project and go on to certain glory and perhaps a
Nobel prize. Researchers on your team have managed to obtain several sets of
segments needed to sequence the last remaining gene, but your help is urgently
needed to lead the effort.
Your job is to write a program which can reconstruct
the gene sequence using the given fragmentary segments of the larger gene. For
each set of segments given, you must devise an algorithm to sequence them in
the correct order. If you succeed, your name will appear in all biology textbooks
from this day forward. If you are too slow, someone else will take your place.
Good luck.
source: The MATLAB Programming Contest - http://www.mathworks.com/contest/sequence.cgi/rules.html
Program Input
The
gene segments given to you have been chemically snipped from a single gene and
sequenced individually. Your job is to reassemble them jigsaw-style into the most
likely single sequence they could have come from. The gene segments will be represented
in the input file as a character (or string) matrix.
Only four letters will be used. Each stands for
one of the nitrogenous bases in DNA: A (adenine), C (cytosine), G (guanine), and
T (thymine). The segments in any single test sequence have the same length (since
they're passed as a char matrix). But that length, as well as the number of segments,
will vary across the many tests included in our test suite - in other words, your
program will be given inputs of different, unknown sizes. In one case, we might
have 5 segments of length 4. Another test case might provide 10 segments of length
12. For our purposes we will limit all test cases to a maximum of 10 segments
with a maximum segment length of 16.
To provide a sense of scale, the entire human genome
is approximately three billion base pairs long.
The first line of the input file indicates the total
number of segment sets. Each set begins with a line of two integers specifying
the number of segments N and the segment size Z, respectively. The next N lines
will be strings of length Z.
2
5 4
TCGG
GCAG
ATCG
CAGC
GATC
4 16
AGCTTGCTGAAACGTA
CTTGCTGAAACGTATC
TATCGATGCATCGATC
AAACGTATCGATGCAT
Program Output
Your program should determine the shortest gene that can be made from these pieces.
The rules for assembling a sequence are: (1) the sequence must use all the
segments (and only the segments) provided, (2) you cannot flip any of the segments,
(3) the result must be a one row char array, (4) the best answer is the shortest
answer, (5) speed counts. For example, if we slide around the above segments we
can get:
TCGG
GCAG
ATCG
CAGC
GATC
==========
GATCGGCAGC
GATCGGCAGC
AGCTTGCTGAAACGTATCGATGCATCGATC


Enter Number of Comments for Sentiment Analysis:
查看评论趋势
Keywords Graph
Show Graph
Summarize All the Comments into
1
2
3
4
5
6
7
8
9
10
Topics:
Submit
Most Up-voted Comment:


MY FIRST WEBSITE
Welcome to my Website!Here are some things I enjoy.
Web DEvelopment
Chess
Reading
Learning
Favorite Quotes
here is a favorite quote of mine....
...and another


delete
{{note.title}}
{{note.content}}
settings
brightness_1
brightness_1
brightness_1
brightness_1
color_lens
send
queue


Exercise #1
Instructions:
create a grammatically sound sentence by choosing a word in each
column
. A word tile will turn green when the chosen word is correct. Red when it is wrong.
Create a simple sentence in present tense.
took
a
never.
I
take
an
bath
day.
taken
the
everyday.
See answer
I take a bath everyday.
Next


Get Started with TG2
About this page
A quick guide to this TG2 site
Home
Back to your Quickstart Home page
TG2 Documents
- Read everything in the Getting Started section
TG1 docs
(still useful, although a lot has changed for TG2)
Join the TG Mail List
for general TG use/topics
Admin risk
user
riskLevel
programs
sectionteams
sectionmanage


Mountains, moose and Mounties: around the globe, those three words say “Canada”. But the world’s second largest country offers far more. Stretching from the Atlantic to the Pacific, it is a land of adventures in the great outdoors. Nowhere else provides such variety, from Niagara Falls and the world’s highest tides to icebergs and the spectacular Rocky Mountains.
Places to vist in canada & main attractions to vist
- Bannf national park
- toronto
- banff
- niagara falls
Here the
Canada package includes all modes of transport i.e.,
- Air :
The basic price for air ways which includes first class and economic class 4000$ usd.
- Train :
The price for train is 2500$ usd.
- Bus :
The price for bus ways is 2000$ usd.


SNA Teachers & Administrators
Mrs. Emily M. Feliciano
High School CoordinatorHigh School Coordinator
GRADE 7 – ROMANS
ADVISER
Mrs. Jennifer G. Lagman
GRADE 7 – CORINTHIANS
ADVISER
Technical Administrator
Mrs. Arlyn E. Rodriguez
IV – JAMES
ADVISER
Records Custodian
Mrs. Cynthia E. Sinio
IV– JAMES
ADVISER
Mrs. Mary Grace G. Moreno
II– GALATIANS
ADVISER
Mr. Alex C. Manaloto
II– PHILIPPIANS
ADVISER
SHOOL OFFICIALS: DUTIES and RESPONSIBILITIES
School Director and Administrator
He is responsible for the overall management and administration of the affairs of the entire school. He has the authority over all school matters and final responsibility for the successful management of the school.
Principal
She is directly responsible for the screening and selection of teachers and takes care of the welfare and progress of all students. She’s sees to it that all records of the students are properly processed. The principal is directly in charge of the curricular, co-curricular and extra curricular programs of students and sees to it that philosophy and goals of the school are carried out by all teacher. She also takes charge of the academic programs of the school, and coordinates all academic activities. She makes aperiodic evaluation of behavior and progress.
Treasurer
All financial matter are settled with the school treasurer. She receives donations and disburses funds that are needed in the operation and administration of the school. She manages all income from tuition and other fees and takes care of the expenditures for the school. She prepares a regular financial report of the school to determine the financial viability of SNPS. She also helps in the procurement of materials needed in the school.
Registrar
The Registrar keeps all students official records up-to-date. He or she issues transfer credentials. Transcript and certifications; supervises the proper implementation of policies on students admission, registration and admission of students. She makes the schedule of classes.
Executive Secretary
Receives, file, records incoming communications and prepares policies and guidelines for the perusal and approval of the School Board; acts as the liaison officer of the school; assists the Director and Principal in the implementation of rules and regulations in line with the philosophy and goal of St. Nathanael Parochial School.
Classroom Teacher
Creates an atmosphere conducive to the teaching-learning process. She motivates the pupils towards the development to their innate talents/abilities. She guides and assists the pupils in their academic programs and sees to the individual progress of students. Sees to it that the policies of the school are enforced in line with its philosophy and goals of academic excellence and a well-rounded Catholic life of all students.
Security Guard
Takes charge of the entry and exit of all visitors through proper identification cars before they are allowed entry.  Sees to it that the rules and regulations of the school regarding loitering. Cleanliness , protection of students, safety of the school from undesirable elements and the security of the school premises are strictly enforced.
Canteen Manager
Prepares and sells nutritious food at reasonable prices to school children. Makes available school supplies and materials for sale. She makes a regular inventory of all purchases and daily sales and reports the mark-up and prices of all items for sale. She makes a weekly report on the entire transaction for the week showing the profit or loss statement of the school canteen.


--- layout: archive permalink: /about/ hidden: true title: About Azure Citadel author_profile: false read_time: false toc: false search: false share: false classes: wide header: overlay_image: /images/header/whiteboard.jpg ---


About Me
Let me tell you a few things about me.
BIO
I am a self taught Web Developer and a UI/UX Designer,
I love designing websites and programming web applications.
I am certified in Digital Marteting and Web Development (Front-End).
For more
information.
Web Development
I have expertise in the following
I have practiced a lot of HTML5, CSS3, jS, Node.js and Scss. This portfolio website is the outcome of all the above mentioned languages.
UI/UX Designing
I am at an intermediate level
I have always enjoyed UI/UX designing playing and experimenting in Adobe XD, but i conciter myself at an intermediate level in this field.
Digital Marketing
I have good experience
I am certified in the field of Digital & Social Media Marketing, have good experience in SEO, Facebook Marketing, Google AdWords and other digital marketing tools.


Temperature Conversion
Chart to convert Centigrade to Farenheit jquery Demo
Centigrade to Farenheit
From
o
C:
To
o
C:
Prepare Chart


My Profile
Self Summary:
Describe yourself in few words...
Best thing about you:
Your Likes
Favourite Movies:
List some of them...
Color that attracts you:
Language you know:
You can speak...
Your Best Novels:
You enjoy reading...


Pathfinding Visualizer
Algorithms
Dijkstra's Algorithm
A* Search
Greedy Best-first Search
Swarm Algorithm
Convergent Swarm Algorithm
Bidirectional Swarm Algorithm
Breadth-first Search
Depth-first Search
Mazes & Patterns
Recursive Division
Recursive Division (vertical skew)
Recursive Division (horizontal skew)
Basic Random Maze
Basic Weight Maze
Simple Stair Pattern
Add Bomb
Visualize!
Clear Board
Clear Walls & Weights
Clear Path
Speed: Fast
Speed: Fast
Speed: Average
Speed: Slow


Toggle navigation
About
Projects
Gallery
Contact
Contact
Ready to connect? Simply fill out the form below and I'll get a notification of your message.
Name
Email
Message
Submit


Special Deals
-
April
Florem ipsum acacia round-leaved sundew carnation prince of Wales feather. Balloon flower radnor lily scarlet plume flame tip stonecrop. Buy now. $20.99
-
May
Florem ipsum acacia round-leaved sundew carnation prince of Wales feather. Balloon flower radnor lily scarlet plume flame tip stonecrop. Buy now. $20.99
-
June
Florem ipsum acacia round-leaved sundew carnation prince of Wales feather. Balloon flower radnor lily scarlet plume flame tip stonecrop. Buy now. $20.99
-
July
Florem ipsum acacia round-leaved sundew carnation prince of Wales feather. Balloon flower radnor lily scarlet plume flame tip stonecrop. Buy now. $20.99
-
August
Florem ipsum acacia round-leaved sundew carnation prince of Wales feather. Balloon flower radnor lily scarlet plume flame tip stonecrop. Buy now. $20.99
-
September
Florem ipsum acacia round-leaved sundew carnation prince of Wales feather. Balloon flower radnor lily scarlet plume flame tip stonecrop. Buy now. $20.99


Zhu Hongyu
Graduated from Chongqing University of Education, an extrovert boy, usually warm and cheerful, likes making friends
---
title: Home
description: The latest app to help you find new friends with common interests.
image: https://source.unsplash.com/j5LSbCqB1wA/2000x1322?a=.png
bottom_image: https://unsplash.it/2000/1322?a=.png
---
Make a new friend today! Hope you can get to know me through my personal blog!
Medivh's personal blog
Graduated from Chongqing University of Education, an extrovert boy, usually warm and cheerful, likes making friends
It's fun and an exciting way to make new friends.


When enabled this option will allow users to Ctrl + Click (Command + Click on a Mac) to select multiple specific cells. The first mouse click will make a cell active and a Ctrl + Click on another cell will add it as a new selection range.
(boolean)
: Defaulttrue
.
{ctrlSelect: false}


Modules
Yamaha
IP address
HomeAssistant
IP address
Port
Long Lived Token
To generate a long-lived token follow these steps:
1. Log in to Home HomeAssistant
2. Click your username (bottom-left corner of the screen)
3. Scroll down all the way, to "Long-Lived Access Tokens"
4. Click 'CREATE TOKEN
5. Name it Quickey
6. Copy the key that is shown in the next dialog and paste it here
Node-RED
IP address
Port
Dashboard Path
Commands
Add Command
Import
Export
Cancel
Save
Version
Code
Moti Radomski
UX & Logo
Anat Elhanani
Credits
Highway Gothic
tabulator
switchery
Pushy Buttons
Font Awesome
jQuery Modal
License
MIT
Cancel
Done
WARNING!
This will overwrite your settings.


Three-dimensional morphology of the evolved nanostructure from compressible ABC copolymer melt ( a) in the simulation box of 12 × 12 × 12 R G 3 and ( b) in the unit cell of 6 × 6 × 6 R G 3 (1/8th of the simulation box). B and C domains are represented by green and blue color, respectively, and A domain as the matrix is erased intentionally.


Covid Cases In Nepal
Total Current Cases
Active
Deaths
Recovered
Age Groups
Cases
Deaths
Recovered
Total Cases Till Now
Positive
Negative
Recovered
Deaths


| TOC |
|
This document describes an extension of one-time password (OTP) algorithm, namely the HAMC-Based One-Time Password (HOTP) Algorithm as defined in RFC 4226, to support time-based moving factor. The HOTP algorithm specifies an event based OTP algorithm where the moving factor is an event counter. The present work bases the moving factor on a time value. A time-based variant of the OTP algorithm provides short-lived OTP values, which are desirable for enhanced security.
The proposed algorithm can be used across a wide range of network applications ranging from remote Virtual Private Network (VPN) access, Wi-Fi network logon to transaction-oriented Web applications. The authors believe that a common and shared algorithm will facilitate adoption of two-factor authentication on the Internet by enabling interoperability across commercial and open-source implementations.
This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as “work in progress.”
This Internet-Draft will expire on March 12, 2011.
Copyright (c) 2010 IETF Trust and the persons identified as the document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (http://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Simplified BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Simplified BSD License.
1.
Introduction
1.1.
Scope
1.2.
Background
2.
Notation and Terminology
3.
Algorithm Requirements
4.
TOTP Algorithm
4.1.
Notations
4.2.
Description
5.
Security Considerations
5.1.
General
5.2.
Validation and Time-step Size
6.
Resynchronization
7.
IANA Considerations
8.
Acknowledgements
9.
References
9.1.
Normative references
9.2.
Informative References
Appendix A.
TOTP Algorithm: Reference Implementation
Appendix B.
Test Vectors
§
Authors' Addresses
| TOC |
| TOC |
This document describes an extension of one-time password (OTP) algorithm HOTP as defined in [RFC4226] (M'Raihi, D., Bellare, M., Hoornaert, F., Naccache, D., and O. Ranen, “HOTP: An HMAC-Based One-Time Password Algorithm,” December 2005.) to support time based moving factor.
| TOC |
As defined in [RFC4226] (M'Raihi, D., Bellare, M., Hoornaert, F., Naccache, D., and O. Ranen, “HOTP: An HMAC-Based One-Time Password Algorithm,” December 2005.) the HOTP algorithm is based on the HMAC-SHA-1 algorithm, as specified in [RFC2104] (Krawczyk, H., Bellare, M., and R. Canetti, “HMAC: Keyed-Hashing for Message Authentication,” February 1997.) applied to an increasing counter value representing the message in the HMAC computation.
Basically, the output of the HMAC-SHA-1 calculation is truncated to obtain user-friendly values:
HOTP(K,C) = Truncate(HMAC-SHA-1(K,C))
where Truncate represents the function that can convert an HMAC-SHA-1 value into an HOTP value.
TOTP is the time-based variant of this algorithm where a value T derived from a time reference and a time step replaces the counter C in the HOTP computation.
The default HMAC-SHA-1 function could be replaced by HMAC-SHA-256 or HMAC-SHA-512 to leverage HMAC implementations based on SHA-256 or SHA-512 hash functions.
| TOC |
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in [RFC2119] (, “Key words for use in RFCs to Indicate Requirement Levels,” March 1997.)
| TOC |
This section summarizes the requirements taken into account for designing the TOTP algorithm.
R1 - The prover (e.g. token, soft token) and verifier (authentication or validation server) MUST have access to the Unix Time
R2 - The prover and verifier MUST either share a same secret or the knowledge of a secret transformation to generate a shared secret
R3 - The algorithm MUST use HOTP [RFC4226] as a key building block.
R4 - The prover and verifier MUST use the same time step value X.
R5 - There MUST be a unique secret (key) for each prover.
R6 - The keys SHOULD be randomly generated or derived using a key derivation algorithms.
R7 - The keys MAY be stored in a tamper-resistant device and SHOULD be protected against unauthorized access and usage.
R8 - The TOTP algorithm SHOULD be used for online application.
| TOC |
This variant of the HOTP algorithm specifies the calculation of a one-time password value, based on a representation of the counter as a time factor.
| TOC |
- X represents the time step in seconds (default value X = 30 seconds) and is a system parameter;
- T0 is the Unix time to start counting time steps (default value is 0, Unix epoch) and is also a system parameter.
| TOC |
Basically, we define TOTP as TOTP = HOTP(K, T) where T is an integer and represents the number of time steps between the initial counter time T0 and the current Unix time (i.e. the number of seconds elapsed since midnight UTC of January 1, 1970).
More specifically T = (Current Unix time - T0) / X where:
- X represents the time step in seconds (default value X = 30 seconds) and is a system parameter;
- T0 is the Unix time to start counting time steps (default value is 0, Unix epoch) and is also a system parameter;
- The default floor function is used in the computation. For example, with T0 = 0 and time step X = 30, T = 1 if the current Unix time is 59 seconds and T = 2 if the current Unix time is 60 seconds.
| TOC |
| TOC |
The security and strength of this algorithm depends on the properties of the underlying building block HOTP, which is a construction based on HMAC [RFC2104] (Krawczyk, H., Bellare, M., and R. Canetti, “HMAC: Keyed-Hashing for Message Authentication,” February 1997.) using SHA-1 as the hash function.
The conclusion of the security analysis detailed in [RFC4226] (M'Raihi, D., Bellare, M., Hoornaert, F., Naccache, D., and O. Ranen, “HOTP: An HMAC-Based One-Time Password Algorithm,” December 2005.) is that, for all practical purposes, the outputs of the dynamic truncation on distinct inputs are uniformly and independently distributed strings.
The analysis demonstrates that the best possible attack against the HOTP function is the brute force attack.
As indicated in the algorithm requirement section, keys SHOULD be chosen at random or using a cryptographically strong pseudo-random generator properly seeded with a random value.
Keys SHOULD be of the length of the HMAC output to facilitate interoperability.
We RECOMMEND following the recommendations in [RFC4086] (Eastlake, D., Schiller, J., and S. Crocker, “Randomness Recommendations for Security,” June 2005.) for all pseudo-random and random generations. The pseudo-random numbers used for generating the keys SHOULD successfully pass the randomness test specified in [CN] (Coron, J. and D. Naccache, “An accurate evaluation of Maurer's universal test,” February 1999.) or a similar well-recognized test.
All the communications SHOULD take place over a secure channel e.g. SSL/TLS, IPsec connections.
We also RECOMMEND storing the keys securely in the validation system, and more specifically encrypting them using tamper-resistant hardware encryption and exposing them only when required: for example, the key is decrypted when needed to verify an OTP value, and re-encrypted immediately to limit exposure in the RAM for a short period of time.
The key store MUST be in a secure area, to avoid as much as possible direct attack on the validation system and secrets database. Particularly, access to the key material should be limited to programs and processes required by the validation system only.
| TOC |
An OTP generated within the same Time-step will be the same. When an OTP is received at a validation system, it doesn't know a client's exact timestamp when an OTP was generated. The validation system may typically use the timestamp when an OTP is received for OTP comparison. Due to the network latency for an OTP to transmit from a requesting application to a validation system and user's actual input time of an OTP to a receiving system, such timestamp gap between the actual OTP generation time and server's receiving time may be large. The receiving time at the validation system and the actual OTP generation may not fall within the same Time-step window that produce the same OTP. When an OTP is generated at the end of a Time-step window, the receiving time most likely falls into the next Time-step window. A validation system SHOULD typically set a policy for an acceptable OTP transmission delay window for validation. The validation system should compare OTPs not only with the receiving timestamp but also the past timesteps that are within the transmission delay. A larger acceptable delay window would introduce some OTP attack window. We RECOMMEND that at most one time step is allowed as the network delay.
The Time-step size has impact on both security and usability. A larger Time-step size means larger validity window for an OTP to be accepted by a validation system. There are the following implications with a larger Time-step size.
At first, a larger Time-step size exposes larger window for attack. When an OTP is generated and exposed to a third party before it is consumed, the third party can consume the OTP within the Time-step window.
We RECOMMEND default Time-step size for 30 seconds.
Secondly, the next different OTP must be generated in the next Time-step window. A user must wait till the clock moves to the next Time-step window from the last submission. The waiting time may not be exactly the length of Time-step depending on when the last OTP was generated. For example, if the last OTP was generated at the half way in a Time-step window, the waiting time for the next OTP is half of length of Time-step. In general, a larger Time-step window means larger waiting time for a user to get the next valid OTP after the last successfully OTP validation. A too large window, for example 10 minutes, most probably won't be suitable for typical internet login use cases; a user may not be able to get the next OTP within 10 minutes and therefore re-login back to the same site in 10 minutes. The default Time-step size 30 seconds is recommended.
| TOC |
Because of possible clock drifts between a client and a validation server, we RECOMMEND that the validator be set with a specific limit to the number of time steps a prover can be 'out of synch' before being not validated/rejected.
This limit can be set both forward and backwards from the calculated time step on receipt of the OTP value. If the time step is 30 seconds as recommended, and the validator is set to only accept 2 time step backwards then the maximum elapsed time drift would be around 89 seconds, i.e. 29 seconds in the calculated time step and 60 for two backward time steps.
This would mean the validator could perform a validation against the current time and then further two validations for each backward step (for a total of 3 validations). Upon successful validation, the validation server can record the detected clock drift for the token in terms of number of Time-step. When a new OTP is received after this step, the validator can validate the OTP with current timestamp adjusted with recorded number of Time-step clock drifts for the token.
Also, it is important to note that the longer a prover has not sent an OTP to a validation system, the longer (potentially) the accumulated clock drift between the prover and the verifier. In such cases, the default synchronization may not be proper when the drift exceeds beyond allowed threshold. Additional authentication measures SHOULD be used for the validation system to safely authenticate the prover.
| TOC |
The OTP algorithm defined in this document can be referred by a URI defined in a separate document. [ALGP] (Hoyer, P., Pei, M., Machani, S., and A. Doherty, “Additional Portable Symmetric Key Container (PSKC) Algorithm Profiles,” December 2008.) is such an attempt that defines various OTP related algorithm URIs. There is no registration needed in this document.
| TOC |
The authors of this draft would like to thank the following people for their contributions and support to make this a better specification: Hannes Tschofenig, Jonathan Tuliani, David Dix, Siddharth Bajaj, Stu Veath, Shuh Chang, Oanh Hoang, John Huang, and Siddhartha Mohapatra.
| TOC |
| TOC |
| [RFC2104] | Krawczyk, H., Bellare, M., and R. Canetti, “HMAC: Keyed-Hashing for Message Authentication,” RFC 2104, February 1997. |
| [RFC2119] | “Key words for use in RFCs to Indicate Requirement Levels,” BCP 14, RFC 2119, March 1997. |
| [RFC4086] | Eastlake, D., Schiller, J., and S. Crocker, “Randomness Recommendations for Security,” RFC 4086, June 2005. |
| [RFC4226] | M'Raihi, D., Bellare, M., Hoornaert, F., Naccache, D., and O. Ranen, “HOTP: An HMAC-Based One-Time Password Algorithm,” RFC 4226, December 2005. |
| TOC |
| [ALGP] | Hoyer, P., Pei, M., Machani, S., and A. Doherty, “Additional Portable Symmetric Key Container (PSKC) Algorithm Profiles,” December 2008. |
| [CN] | Coron, J. and D. Naccache, “An accurate evaluation of Maurer's universal test,” LNCS 1556, February 1999. |
| TOC |
import java.lang.reflect.UndeclaredThrowableException; import java.security.GeneralSecurityException; import java.text.DateFormat; import java.text.SimpleDateFormat; import java.util.Calendar; import java.util.Date; import javax.crypto.Mac; import javax.crypto.spec.SecretKeySpec; import java.math.BigInteger; import java.util.TimeZone; /** * This an example implementation of the OATH TOTP algorithm. * Visit www.openauthentication.org for more information. * * @author Johan Rydell, PortWise, Inc. */ public class TOTP { private TOTP() {} /** * This method uses the JCE to provide the crypto * algorithm. * HMAC computes a Hashed Message Authentication Code with the * crypto hash algorithm as a parameter. * * @param crypto the crypto algorithm (HmacSHA1, HmacSHA256, * HmacSHA512) * @param keyBytes the bytes to use for the HMAC key * @param text the message or text to be authenticated. */ private static byte[] hmac_sha1(String crypto, byte[] keyBytes, byte[] text) { try { Mac hmac; hmac = Mac.getInstance(crypto); SecretKeySpec macKey = new SecretKeySpec(keyBytes, "RAW"); hmac.init(macKey); return hmac.doFinal(text); } catch (GeneralSecurityException gse) { throw new UndeclaredThrowableException(gse); } } /** * This method converts HEX string to Byte[] * * @param hex the HEX string * * @return A byte array */ private static byte[] hexStr2Bytes(String hex){ // Adding one byte to get the right conversion // values starting with "0" can be converted byte[] bArray = new BigInteger("10" + hex,16).toByteArray(); // Copy all the REAL bytes, not the "first" byte[] ret = new byte[bArray.length - 1]; for (int i = 0; i < ret.length ; i++) ret[i] = bArray[i+1]; return ret; } private static final int[] DIGITS_POWER // 0 1 2 3 4 5 6 7 8 = {1,10,100,1000,10000,100000,1000000,10000000,100000000 }; /** * This method generates an TOTP value for the given * set of parameters. * * @param key the shared secret, HEX encoded * @param time a value that reflects a time * @param returnDigits number of digits to return * * @return A numeric String in base 10 that includes * {@link truncationDigits} digits */ public static String generateTOTP(String key, String time, String returnDigits) { return generateTOTP(key, time, returnDigits, "HmacSHA1"); } /** * This method generates an TOTP value for the given * set of parameters. * * @param key the shared secret, HEX encoded * @param time a value that reflects a time * @param returnDigits number of digits to return * * @return A numeric String in base 10 that includes * {@link truncationDigits} digits */ public static String generateTOTP256(String key, String time, String returnDigits) { return generateTOTP(key, time, returnDigits, "HmacSHA256"); } /** * This method generates an TOTP value for the given * set of parameters. * * @param key the shared secret, HEX encoded * @param time a value that reflects a time * @param returnDigits number of digits to return * * @return A numeric String in base 10 that includes * {@link truncationDigits} digits */ public static String generateTOTP512(String key, String time, String returnDigits) { return generateTOTP(key, time, returnDigits, "HmacSHA512"); } /** * This method generates an TOTP value for the given * set of parameters. * * @param key the shared secret, HEX encoded * @param time a value that reflects a time * @param returnDigits number of digits to return * @param crypto the crypto function to use * * @return A numeric String in base 10 that includes * {@link truncationDigits} digits */ private static String generateTOTP(String key, String time, String returnDigits, String crypto) { int codeDigits = Integer.decode(returnDigits).intValue(); String result = null; byte[] hash; // Using the counter // First 8 bytes are for the movingFactor // Complaint with base RFC 4226 (HOTP) while(time.length() < 16 ) time = "0" + time; // Get the HEX in a Byte[] byte[] msg = hexStr2Bytes(time); // Adding one byte to get the right conversion byte[] k = hexStr2Bytes(key); hash = hmac_sha1(crypto, k, msg); // put selected bytes into result int int offset = hash[hash.length - 1] & 0xf; int binary = ((hash[offset] & 0x7f) << 24) | ((hash[offset + 1] & 0xff) << 16) | ((hash[offset + 2] & 0xff) << 8) | (hash[offset + 3] & 0xff); int otp = binary % DIGITS_POWER[codeDigits]; result = Integer.toString(otp); while (result.length() < codeDigits) { result = "0" + result; } return result; } public static void main(String[] args) { String seed = "3132333435363738393031323334353637383930"; long T0 = 0; long X = 30; long testTime[] = {59,<PHONE_NUMBER>,<PHONE_NUMBER>,<PHONE_NUMBER>,<PHONE_NUMBER>}; String steps = "0"; DateFormat df = new SimpleDateFormat("yyyy-MM-dd HH:mm:ss"); df.setTimeZone(TimeZone.getTimeZone("UTC")); try{ System.out.println( "+--------------+-----------------------+" + "------------------+--------+--------+"); System.out.println( "| Time(sec) | Time (UTC format) " + "| Value of T(Hex) | TOTP | Mode |"); System.out.println( "+--------------+-----------------------+" + "------------------+--------+--------+"); for(int i=0; i<testTime.length; i++) { long T = (testTime[i] - T0)/X; steps = Long.toHexString(T).toUpperCase(); while(steps.length() < 16) steps = "0" + steps; String fmtTime = String.format("%1$-10s", testTime[i]); String utcTime = df.format(new Date(testTime[i]*1000)); System.out.print("| " + fmtTime + " | " + utcTime + " | " + steps + " |"); System.out.println(generateTOTP(seed, steps, "8", "HmacSHA1") + "| SHA1 |"); System.out.print("| " + fmtTime + " | " + utcTime + " | " + steps + " |"); System.out.println(generateTOTP(seed, steps, "8", "HmacSHA256") + "| SHA256 |"); System.out.print("| " + fmtTime + " | " + utcTime + " | " + steps + " |"); System.out.println(generateTOTP(seed, steps, "8", "HmacSHA512") + "| SHA512 |"); System.out.println( "+--------------+-----------------------+" + "------------------+--------+--------+"); } }catch (final Exception e){ System.out.println("Error : " + e); } } }
| TOC |
This section provides test values that can be used for HOTP time-based variant algorithm interoperability test.
The test token shared secret uses the ASCII string value "12345678901234567890". With Time Step X = 30, and Unix epoch as initial value to count time steps where T0 = 0, the TOTP algorithm will display the following values for specified modes and timestamps.
| Time (sec) | UTC Time | Value of T (hex) | TOTP | Mode |
|---|---|---|---|---|
| 59 | 1970-01-01 00:00:59 |<PHONE_NUMBER>000001 | 94287082 | SHA1 |
| 59 | 1970-01-01 00:00:59 |<PHONE_NUMBER>000001 | 32247374 | SHA256 |
| 59 | 1970-01-01 00:00:59 |<PHONE_NUMBER>000001 | 69342147 | SHA512 |
|<PHONE_NUMBER> | 2005-03-18 01:58:29 |<PHONE_NUMBER>3523EC | 07081804 | SHA1 |
|<PHONE_NUMBER> | 2005-03-18 01:58:29 |<PHONE_NUMBER>3523EC | 34756375 | SHA256 |
|<PHONE_NUMBER> | 2005-03-18 01:58:29 |<PHONE_NUMBER>3523EC | 63049338 | SHA512 |
|<PHONE_NUMBER> | 2005-03-18 01:58:31 |<PHONE_NUMBER>3523ED | 14050471 | SHA1 |
|<PHONE_NUMBER> | 2005-03-18 01:58:31 |<PHONE_NUMBER>3523ED | 74584430 | SHA256 |
|<PHONE_NUMBER> | 2005-03-18 01:58:31 |<PHONE_NUMBER>3523ED | 54380122 | SHA512 |
|<PHONE_NUMBER> | 2009-02-13 23:31:30 |<PHONE_NUMBER>73EF07 | 89005924 | SHA1 |
|<PHONE_NUMBER> | 2009-02-13 23:31:30 |<PHONE_NUMBER>73EF07 | 42829826 | SHA256 |
|<PHONE_NUMBER> | 2009-02-13 23:31:30 |<PHONE_NUMBER>73EF07 | 76671578 | SHA512 |
|<PHONE_NUMBER> | 2033-05-18 03:33:20 |<PHONE_NUMBER>F940AA | 69279037 | SHA1 |
|<PHONE_NUMBER> | 2033-05-18 03:33:20 |<PHONE_NUMBER>F940AA | 78428693 | SHA256 |
|<PHONE_NUMBER> | 2033-05-18 03:33:20 |<PHONE_NUMBER>F940AA | 56464532 | SHA512 |
| Table 1: TOTP Table |
| TOC |
| David M'Raihi | |
| Verisign, Inc. | |
| 685 E. Middlefield Road | |
| Mountain View, CA 94043 | |
| USA | |
| Email: |<EMAIL_ADDRESS>|
| Salah Machani | |
| Diversinet Corp. | |
| 2225 Sheppard Avenue East, Suite 1801 | |
| Toronto, Ontario M2J 5C2 | |
| Canada | |
| Email: |<EMAIL_ADDRESS>|
| Mingliang Pei | |
| Verisign, Inc. | |
| 685 E. Middlefield Road | |
| Mountain View, CA 94043 | |
| USA | |
| Email: |<EMAIL_ADDRESS>|
| Johan Rydell | |
| Portwise, Inc. | |
| 275 Hawthorne Ave, Suite 119 | |
| Palo Alto, CA 94301 | |
| USA | |
| Email: |<EMAIL_ADDRESS>|


--- layout: documentation title: MarkingType ---
MarkingType specifies a structure for marking information to be applied to portions of XML content.
| Field Name | Type | Description |
|---|---|---|
| Marking0..n | MarkingSpecificationType |
This field contains specification of marking information to be applied to portions of XML content. |


About Pathname-Utils
This is a collection of common tests and operations to help handling pathnames. It does not actually deal in handling the accessing of files on the underlying system however.
How To
Since this is a purely utility/toolkit library, simply having a look at the symbol index should give you the best idea of what is offered.


Heads up! You should make sure this device is connected to a network that has access to the internet.


User Guide
- 1. Introduction
- 2. Download
- 2.1. Release 2.1.0 (January 26, 2019)
- 2.2. Release 2.0.3 (April 26, 2018)
- 2.3. Release 2.0.2 (September 19, 2016)
- 2.4. Release 2.0.1 (April 29, 2016)
- 2.5. Release 2.0.0 (April 14, 2016)
- 2.6. Release 1.0.6 (March 09, 2016)
- 2.7. Release 1.0.5 (May 26, 2015)
- 2.8. Release 1.0.4 (April 27, 2015)
- 2.9. Release 1.0.3 (May 23, 2014)
- 2.10. Release 1.0.2 (March 20, 2014)
- 2.11. Release 1.0.1 (December 13, 2013)
- 2.12. Release 1.0.0 (November 01, 2013)
- 3. Installation and Configuration
- 4. Creating an FMU
- 5. Usage of EnergyPlus as an FMU
- 6. Mathematical Description
- 7. Best Practice
- 8. Development
- 9. Notation
- 10. Help
- 11. Glossary
- 12. Acknowledgments
- 13. Disclaimers
- 14. Copyright and License