array mysql_fetch_lengths ( resource $result )
Returns an array that corresponds to the lengths of each field in the last row fetched by MySQL. mysql_fetch_lengths() stores the lengths of each result column in the last row returned by mysql_fetch_row(), mysql_fetch_assoc(), mysql_fetch_array(), and mysql_fetch_object() in an array, starting at offset 0.
An array of lengths on success or FALSE on failure.


The dealer will give you a card as you bet. If your card has higher value than the dealers card, you win your bet. If your card is the same as the dealers, you may choose to go to war! To continue, you must double your current bet. You may choose to decline War, however you lose your current bet. Winning War only pays 1:2. Good luck!


Russian Napoleon expert found with dismembered woman's arms: authorities
by AFPSAINT PETERSBURG: Police in Saint Petersburg on Saturday arrested a prominent Russian historian on suspicion of murdering a former student after he was hauled out of a river with a backpack containing a woman’s arms, authorities said.
Local media in Saint Petersburg reported that university professor Oleg Sokolov was drunk and fell into the river as he tried to dispose of body parts.
Police reportedly then went to Sokolov’s home where they discovered the decapitated body of Anastasia Yeshchenko, 24, with whom he had co-authored a number of works.
“A 63-year-old man was rescued from the River Moika,” investigators said in statement.
The arms of a woman were discovered in his backpack, the statement said, adding that the detained man was suspected of murder.
Investigators did not name the man but police speaking to AFP identified him as Sokolov.
The historian is the author of books on French statesman and military leader Napoleon Bonaparte and had acted as a historical consultant on several films.
He received France’s Legion d’Honneur in 2003.
Sokolov was also a member of France’s Institute of Social Science, Economics and Politics (ISSEP), but on Saturday the society announced in a statement that he had been stripped of his position on its scientific committee.
“We learn with horror … the atrocious crime of which Oleg Sokolov is guilty…,” it said.
As an academic of such standing, the statement added, “We could never imagine that he could commit such an odious act”.
ISSEP was founded by Marion Marechal, the niece of Marine Le Pen, leader of the far-right National Rally party and a former deputy of the party.


Pandemic Panic: The Tower is a choose-your-own-adventure gamebook, written as the final project for my Elements of Game Design class, towards the beginning of the COVID-19 Pandemic.
You can download a zip with a pdf and form-fillable character sheet below:
A digital, expanded version is being considered for development.


Demo 1
Add a message in logcat.
Demo 2
Add a message in logcat (input from JS).
Demo 3
Sum two numbers.
Sum result: ?
Demo 4
Sum two numbers (input from JS).
Sum result: ?
Demo 5
Create a string from JavaScript values.
Demo 6
Show a Toast.
Demo 7
Try to sum two strings in a function that wants two integers (Demo 3 with error).


Steering shaft replacement is a common need for CJ owners since all CJs are at least 13 years old by now. Factory replacements parts are still available, but they tend to wear out quickly when used with large tires in off-road conditions. The boot on the factory bell coupler at the lower end of the factory shaft tends to wear out and allow grit into the bell coupler assembly, causing wear to accelerate. The factory upper U-joint is not sealed and does not incorporate any type of bearing.
There is a better answer than replacing your worn steering shaft with OEM replacement parts. Borgeson makes replacement steering shafts for CJs and many other types of vehicles that incorporate much stronger sealed needle bearing type U-joints. Because the U-joints are of the needle bearing design and are are sealed, they will last much longer under hard conditions. Another positive aspect of the needle bearing type U-joints is that they are able to withstand higher torque loads than the factory parts.
Installation of the Borgeson steering shaft was quick and painless. Including the time to remove the fender for pictures, and working with only hand tools, I was able to install the steering shaft in under 1/2 hour. There is normally no need to remove the fender, I only removed mine to get clearer pictures.
The procedure is very straight forward:
Remove the existing steering shaft: There is a bolt at each end of the shaft that must be completely removed because they ride in a groove on the steering column and steering box. Once the bolts are out, tapping lightly with a hammer will dislodge the old steering shaft. No further disassembly is required.
Install the new steering shaft: Align the set screws with the flats on the steering column and the steering box. Extend the shaft to the proper length and tighten down the set screws and jam nuts.
An immediate improvement in steering precision was noted because the play from the worn joints on the old shaft was gone. On the road wandering was reduced, and off-road the unit worked perfectly. Steering feel was enhanced by removing the play from the steering shaft.
I tested the steering shaft off-road at the Moab Easter Jeep Safari, and I have put on hundreds of street miles. I could find no flaw with the Borgeson steering shaft.
|
Borgeson Universal Company, Inc Dept. ORC 187 Commercial Blvd Torrington Ct 06790-3098<PHONE_NUMBER> FAX<PHONE_NUMBER>
|


Pandora.
Reach.
Find us in the heart NT. Lets talk about your exciting new project.
We deliver striking digital products.
LOCATION
224 West 5th Street, New York, NY 000245
PHONE
+88 (0) 101 0000 000
E-MAIL
<EMAIL_ADDRESS>Pandora.
<EMAIL_ADDRESS>| Phone: 212.222.568


Mozilla TechSpeaker.
Python and JS Developer
Author of Beginning Git and GitHub (Apress, 2020).
Savior of Hyrule
Mathematical application
NASA World Wind
....until JavaScript
But it has its problems...
Source: Lin Clark © 2017.
function sum(a, b) {
return a + b;
}
Pretty simple, right?
It "should be a single" CPU instruction
- Let lref be the result of evaluating AdditiveExpression.
- Let lval be GetValue(lref).
- Let rref be the result of evaluating MultiplicativeExpression.
- Let rval be GetValue(rref).
- Let lprim be ToPrimitive(lval).
- Let rprim be ToPrimitive(rval).
- If Type(lprim) is String or Type(rprim) is String, then
- Return the String that is the result of concatenating ToString(lprim) followed by ToString(rprim)
- Return the result of applying the addition operation to ToNumber(lprim) and ToNumber(rprim).
You have to do some sacrifices
Understand Programming languages
Understand binary or low level code.
Source: Lin Clark © 2017.
Check it with WASM Code Explorer
(module
(type $type0 (func (param i32)))
(type $type1 (func))
(import "sys" "print" (func $import0 (param i32)))
(memory (;0;) 200 200)
(export "memory" (memory 0))
(export "main" (func $func1))
(func $func1
i32.const 0
call $import0
)
(data (i32.const 0)
"Hello, world\00"
)
)
Hello World in WAT
Each supported language's compiler will generate a .wasm file from the compiler.
rustc --target=wasm32-unknown-uknown project.rs -o project.html
GOOS=js GOARCH=wasm go build -o main.wasm
It's a toolchain to take high languages code to WASM
Execute
emcc project.c -s WASM=1 -o project.html
You'll get at least these 3 files:
Comunicate code between JS and WASM
C
#include <math.h>
extern "C" {
int int_sqrt(int x) {
return sqrt(x);
}
}
JavaScript
int_sqrt = Module.cwrap('int_sqrt', 'number', ['number'])
int_sqrt(12)
int_sqrt(28)
With emscripten_run_script()
emscripten_run_script(
"alert('I love alerts')"
);
With EM_ASM()
#include <emscripten.h>
int main() {
EM_ASM(
alert('DO NOT USE ALERTS!');
throw 'execution ready';
);
return 0;
}}
Applies video effects on realtime
A website to learn C;
code is executed at browser level
Source: Twitter.
WordPress' new editor uses a parser written in Rust.
Zend interpreter migrated to WASM
More info at: https://github.com/oraoto/pib
mariot.rahona.mg


{% extends "base.html" %} {% block title %}success{% endblock %} {% block containercontent %}
Thank you, {{ screen_name }}, for authorizing OneClout.


Username Enter a username longer than 8 characters
Confirm Username Please confirm your username
Password Enter a password longer than 8 characters
Confirm Password Please confirm your password
Your Email Please enter a valid Email Address
Confirm Your Email Please confirm your Email Address


{% include options/settings.html %} {% include options/meta.html %} {% include options/styles.html %} {% include options/scripts.html %} {% assign dateStart = page.lasthall | date: '%s' %} {% assign nowTimestamp = 'now' | date: '%s' %} {% assign diffSeconds = nowTimestamp | minus: dateStart %} {% assign diff = diffSeconds | divided_by: 3600 | divided_by: 24 %}
{% if page.never %} In fact, we haven't found proof that {{page.name}} has ever held a town hall. {% else %} That's in the {{position}} {{percentile}}% of the US Congress. {% endif %} Tell {{page.name}} what you think...
We seriously can't find anyone who's gone longer...
{% else %}We seriously can't find a more recent one...
{% endif %}


Table of Contents
Welcome to the Type Traits Introspection library version 1.4.
The Type Traits Introspection library, or TTI for short, is a library of macros generating metafunctions, and a set of parallel nullary type metafunctions, which provide the ability to introspect by name the elements of a type at compile time.
The name of the library is chosen because the library offers compile time functionality on a type, similar to the Boost Type Traits library, and because the functionality the library offers is the ability to introspect a type about the existence of a specific element.
I use the word "introspect" in a very broad sense here. Normally language introspection means initially asking for information to be returned by name, which can then further be used to introspect for more specific information. In the TTI library one must always supply the name, and use the functionality for the correct type of inner element to find out if the particular named entity exists. You may prefer the term "query" instead of "introspection" to denote what this library does, but I use terminology based on the word "introspect" throughout this documentation.
The functionality of the library may be summed up as:
The library is dependent on Boost PP, Boost MPL, Boost Type Traits, and Boost
Function Types. The library is also dependent on the variadic_macro_data
library currently in the sandbox if the variadic macros in the library are
used.
The library is a header only library.
Since the dependencies of the library are all header only libraries, there is no need to build anything in order to use the TTI library.
There are two separate general header files in the library, divided depending on whether or not the library functionality supporting variadic macros is to be used, which bring in all the rest of the specific header files.
tti.hpp
.
This can be used for the vast majority of functionality in the library.
tti_vm.hpp
.
There are also separate specific header files for each of the elements to be introspected by the library. This allows for finer-grained inclusion of nested elements to be introspected. These header files are:
Table 1.1. TTI Header Files
|
Inner Element |
File |
|---|---|
|
Type |
|
|
Template |
|
|
Template with params |
|
|
Template with params - variadic macros |
|
|
Member data |
|
|
Member function |
|
|
Member function - composite syntax |
|
|
Static member data |
|
|
Static member function |
|
|
Static member function - composite syntax |
|
|
Member type |
If the general header file tti_vm.hpp
or
the specific header file vm_template_params.hpp
, are used the library
is also dependent on the variadic_macro_data
library currently in the sandbox. If this header is not used there is no
need to download the variadic_macro_data
library and use it in any way.
Last revised: June 25, 2011 at 13:08:16 GMT |


Simple Call Handler
Status:
Offline
Get Online
Dial out
End Call
Invite Friend
Your Friend
Your Video
Any Errors will show here:


These are the Android API classes. See all API packages.
| YouTubeApiServiceUtil | Utility class for verifying that the YouTube Player API service is available and up-to-date on this device. |
| YouTubeBaseActivity | Any activity that wants to directly incorporate YouTubePlayerView views in its UI
must extend this activity. |
| YouTubeInitializationResult | Provides the result of initializing the YouTube API Service. |
| YouTubeIntents | A selection of static methods that create intents which navigate to specific activities within the main YouTube application. |
| YouTubePlayer | A YouTubePlayer provides methods for loading, playing and controlling YouTube video playback. |
| YouTubePlayer.ErrorReason | Describes the reason for an error in a YouTubePlayer . |
| YouTubePlayer.OnFullscreenListener | Interface definition for callbacks that are invoked when the player toggles between fullscreen
on or off, either due to the user clicking the fullscreen button or a call to
setFullscreen(boolean) . |
| YouTubePlayer.OnInitializedListener | Interface definition for callbacks that are invoked when player initialization succeeds or fails. |
| YouTubePlayer.PlaybackEventListener | Interface definition for callbacks that are invoked when video playback events occur. |
| YouTubePlayer.PlayerStateChangeListener | Interface definition for callbacks that are invoked when the high-level player state changes. |
| YouTubePlayer.PlayerStyle | The different styles available for the player. |
| YouTubePlayer.PlaylistEventListener | Interface definition for callbacks that are invoked when events related to playlists occur. |
| YouTubePlayer.Provider | A class that implements this interface can provide a YouTubePlayer instance. |
| YouTubePlayerFragment | A fragment that contains a YouTubePlayerView . |
| YouTubePlayerSupportFragment | The support fragment version of YouTubePlayerFragment . |
| YouTubePlayerView | A view for displaying YouTube videos. |
| YouTubeStandalonePlayer | This class creates intents that will play YouTube videos in a standalone player activity. |
| YouTubeThumbnailLoader | A YouTubeThumbnailLoader provides methods for loading YouTube thumbnails into a
YouTubeThumbnailView . |
| YouTubeThumbnailLoader.ErrorReason | Describes the reasons for an error in a YouTubeThumbnailView . |
| YouTubeThumbnailLoader.OnThumbnailLoadedListener | Interface definition for a listener that is invoked when a thumbnail has been loaded. |
| YouTubeThumbnailView | A view which can be used to display YouTube thumbnails, either for a specific YouTube video or a YouTube playlist. |
| YouTubeThumbnailView.OnInitializedListener | An interface with definitions of callbacks invoked when thumbnail view initialization succeeds or fails. |


| Methods' Summary |
| createWindow |
Create a new window as child window of the given parent window.
|
| createSharedCanvas |
Create a new canvas for the given window. The new canvas is a
wrapper around the given shared canvas. The wrapper only modifies
the origin in all output and clipping methods.
|
| createCanvas |
Create a new canvas for the given window.
|
| toTop |
Move the specified window to the top of its stacking order. As a
result the window will be painted over all its overlapping
siblings.
|
| loadBitmap |
Load a bitmap from a file or other accessible resource that can be
located via a URL.
|
| captureMouse |
Capture the mouse so that no other window will receive mouse events.
Note that this is a potentially dangerous method. Not calling
releaseMouse eventually can lead to an unresponsive application.
|
| releaseMouse |
Release a previously captured mouse.
|
| getWindowExtentsRelative |
Return the bounding box of the given child window relative to the
direct or indirect parent window.
|
| Methods' Details |
createWindow
| ::com::sun::star::awt::XWindow |
| createWindow( |
[in] ::com::sun::star::awt::XWindow |
xParentWindow, |
| [in] boolean |
bCreateSystemChildWindow, |
| [in] boolean |
bInitiallyVisible, |
| [in] boolean |
bEnableChildTransparentMode, |
| [in] boolean |
bEnableParentClip ); |
- Description
- Create a new window as child window of the given parent window.
- Parameter xParentWindow
- The parent window of the new window.
- Parameter bCreateSystemChildWindow
- When true then the new window will be a system window that,
in the context of the presenter screen, can not be painted over
by other windows that lie behind it.
- Parameter bInitiallyVisible
- When true the new window will be visible from the start,
i.e. a window listener will not receive a windowShown signal.
- Parameter bEnableChildTransparentMode
- When true the parent window is painted behind its child
windows. This is one half of allowing child windows to be
transparent.
- Parameter bEnableParentClip
- When true then the parent window is not clipped where its
child windows are painted. This is the other half of allowing
child windows to be transparent.
|
|
createSharedCanvas
- Description
- Create a new canvas for the given window. The new canvas is a
wrapper around the given shared canvas. The wrapper only modifies
the origin in all output and clipping methods.
- Parameter xUpdateCanvas
- This canvas is used to call updateScreen() on. May be NULL
- Parameter xUpdateWindow
- The window that belongs to the update canvas. May also be
NULL (is expected to b NULL whenever xUpdateCanvas is.)
- Parameter xSharedCanvas
- The canvas that is shared by the wrapper.
- Parameter xSharedWindow
- The window of the shared canvas. This is used to determine the
proper offset.
- Parameter xWindow
- The canvas is created for this window. Must not be NULL
|
|
createCanvas
| ::com::sun::star::rendering::XCanvas |
| createCanvas( |
[in] ::com::sun::star::awt::XWindow |
xWindow, |
| [in] short |
nRequestedCanvasFeatureList, |
| [in] string |
sOptionalCanvasServiceName ); |
- Description
- Create a new canvas for the given window.
- Parameter xWindow
- The canvas is created for this window. Must not be NULL
- Parameter nRequestedCanvasFeatureList
- List of requested features that the new canvas should (has to)
provide. Use only values from the CanvasFeature
constants group.
- Parameter sOptionalCanvasServiceName
- When an explicit service name is given then a new object of this
service is created. This service name lets the caller select a
specific canvas implementation, e.g. with or without hardware
acceleration.
|
|
toTop
| void |
| toTop( |
[in] ::com::sun::star::awt::XWindow |
xWindow ); |
- Description
- Move the specified window to the top of its stacking order. As a
result the window will be painted over all its overlapping
siblings.
- Parameter xWindow
- This window will be moved to the top of its stacking order.
|
|
loadBitmap
- Description
- Load a bitmap from a file or other accessible resource that can be
located via a URL.
- Parameter sURL
- The URL of the bitmap. For a file URL the bitmap is loaded from
the specified file.
- Parameter xCanvas
- The bitmap is created to be compatible, and possibly optimized,
for this canvas.
|
|
captureMouse
| void |
| captureMouse( |
[in] ::com::sun::star::awt::XWindow |
xWindow ); |
- Description
- Capture the mouse so that no other window will receive mouse events.
Note that this is a potentially dangerous method. Not calling
releaseMouse eventually can lead to an unresponsive application.
- Parameter xWindow
- The window for which mouse events will be notified even when the
mouse pointer moves outside the window or over other windows.
|
|
releaseMouse
| void |
| releaseMouse( |
[in] ::com::sun::star::awt::XWindow |
xWindow ); |
- Description
- Release a previously captured mouse.
- Parameter xWindow
- The window from which the mouse will be released.
|
|
getWindowExtentsRelative
| ::com::sun::star::awt::Rectangle |
| getWindowExtentsRelative( |
[in] ::com::sun::star::awt::XWindow |
xChildWindow, |
| [in] ::com::sun::star::awt::XWindow |
xParentWindow ); |
- Description
- Return the bounding box of the given child window relative to the
direct or indirect parent window.
|
|
Copyright © 2013, The Apache Software Foundation, Licensed under the Apache License, Version 2.0. Apache, the Apache feather logo, Apache OpenOffice and OpenOffice.org are trademarks of The Apache Software Foundation. Other names may be trademarks of their respective owners.


Select, add, or change Earth EC servers¶
You can use Google Earth EC to view globes and maps from your own database servers.
Earth EC lets you do any of the following:
- Add as many database servers as you want.
- Set a default server that is automatically signed in to whenever you start Earth EC.
- Connect to as many as eight servers at the same time.
- Change servers, or sign in and out of servers.
- Remove servers that you no longer use.
Sign in to an Earth EC server
To sign in to a server:
From Google Earth EC, select File > Server Sign In.
The Select Server window appears. When you start Google Earth EC the first time, Select Server appears automatically.
Enter your server settings as shown in the table below.
Select Server options
| Setting | Description |
|---|---|
| Server | Select or enter the address for the database server that hosts the globes or maps you want to view. If you do not know the server address, ask your administrator. |
| Port | Select or enter the port for the server. If you don’t know the port number, ask your administrator. |
| Always sign in to this server | Select to skip the Select Server window and automatically sign in to this server whenever you start Earth EC. To display Select Server again, select File > Disable Automatic Sign In. |
| Disable caching | Select this if you want to make sure that you are viewing the latest content from the server or if your cached files become corrupted. Note: Disabling the cache slows down performance. |
Sign out of an Earth EC server
To sign out of a server database, go to File > Server Sign Out.
Add servers to Earth EC
To add a server database, go to File > Add Database.
The Select Server window appears so that you can enter your server settings.
Connect to multiple Earth EC servers at the same time
Whenever you add another server database, Earth EC signs into the new database and stays connected to your current database. You can view data from up to eight server databases at the same time.
Change your Earth EC server
To change your Earth EC server:
- Select File > Server Sign Out. Earth EC signs out of your current server.
- Select File > Server Sign In.
- Select a server from the list that appears.
Useful resources


new Stage(flow, options)
Object represents single stage in workflow.
Parameters:
| Name | Type | Description | ||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
flow |
Flow | Workfow to which stage belongs | ||||||||||||||||||||||||||||||||||||||||
options |
Object | Stage options. See descriptions bellow.
Properties
|
Methods
activate()
Activate stage
deactivate()
Deactivate stage
done()
Mark stage as done
error()
Mark this stage as failed. When stage is failed it gets marked as error
and workflow goes to FAIL stage
getPivotPoint(point) → {object}
Get pivot point by type.
Parameters:
| Name | Type | Description |
|---|---|---|
point |
string | Point name: top, right, bottom, left |
Returns:
Point coordinates
- Type
- object
progress(val, totalopt)
Add progress label to stage
Parameters:
| Name | Type | Attributes | Description |
|---|---|---|---|
val |
Number | String | Progress value. Three display modes: - string - render label from string as is; - number (with total) - rendef in foramt "CURRENT / TOTAL" - number (without total) - render with % sign | |
total |
Number |
<optional> |
Total value |
state(state) → {Stage|String}
Set stage state.
Parameters:
| Name | Type | Description |
|---|---|---|
state |
String | null | New state. When null then state label will be deleted. When undefined then runction will return state value |
Returns:
- Type
- Stage | String


{% load staticfiles %} {% load compress %}
Summer WS in Namhae
Welcome new MS students (Taekho Nam, Cheolwon Kim)
Welcome continuing PhD students (Junsik Shin, Jungsu Han)
Conduct OF@TEIN Collaboration Training @ Islamabad, Pakistan
Welcome a new MS student (Heebum Yoon)
Conduct K-ICT Network Challenge Camp Training on SmartX & SmartX -mini
Launch of KOREN 2015 project for Open SmartX Platform
Launch of K-ONE Open-Source Networking Collaboration project (5 Years: 2015~2020)
Launch of SW Convergence project with Atto Research (2nd year)
Organized OF@TEIN Collaboration Workshop 2015 @ Hanoi, Viet Nam
Launch of Moonlight Collaboration (달빛상생) project (2015.03~2015.12)
Welcome new MS students (Jungi Lee, Seungryong Kim) and a new integrated MS/Ph.D student (Jiwon Song)
GIST, Gwangju, Repulic of Korea
C-206|C-207|C-208|C-210|C-212, School of Information and Communications
+82-62-715-2219
jongwon@gist.ac.kr


WITNESS LIST Border Affairs - Special Committee April 15, 1999-8:30A SB 720 THIS LIST HAS NO WITNESSES. SB 867 Registering, but not testifying: For: Henneberger, John (Texas Low Income Housing Information Service), Austin On: Hendrix, Scott (Texas Comptroller of Public Accounts), Austin Palacios, Juan (Texas Dept. of Housing and Community Affairs), Austin SB 913 FOR: Rubinstein, Carlos (City of Brownsville), Brownsville Walker, Kathleen C. (TX Border Infrastructure Coalition/El Paso Foreign Trade Assoc.), El Paso ON: Cornyn, John (Office of Attorney General), Austin Laney, David (Texas Transportation Commission), Austin Mills, Lester (Department of Public Safety), Austin Registering, but not testifying: For: Cain, Randy (City of El Paso), Austin Coarcia, Joe A. (Texas Border Infrastructure Coalition), Austin Escobar, Bonnie (Greater El Paso Chamber of Commerce), El Paso Findeisen, Les (Texas Motor Transportation Assn.), Austin Velasquez, Sally (Webb Co., Willacy Co., The City of Eagle Pass), Austin SB 1080 ON: Cobb, Sharon (Texas Higher Education Coordinating Board), Austin SB 1375 FOR: Walker, Kathleen C. (TX Border Infrastructure Coalition/El Paso Foreign Trade Assoc.), El Paso ON: Mitchell, Syrene (U.S. General Accounting Office), Dallas Smith, Elliot (U.S. General Accounting Office), Dallas Registering, but not testifying: For: Cain, Randy (City of El Paso), Austin Coarcia, Joe A. (Texas Border Infrasturture Coalition), Austin Escobar, Bonnie (Greater El Paso Chamber of Commerce), El Paso Gutierrez, Jesse (Mexican American Legal Defense & Educational Fund), San Antonio Velasquez, Sally (Webb Co., Willacy Co., City of Eagle Pass), Austin On: Martinez, Sandra (State Comptroller's Office), Austin SB 1381 THIS LIST HAS NO WITNESSES. SB 1386 Registering, but not testifying: For: Escobar, Bonnie (Greater El Paso Chamber of Commerce), El Paso Garcia, Joe (Texas Border Infrastructure Coalition), Austin Velasquez, Sally (Webb Co., Willacy Co., City of Eagle Pass), Austin On: Cedillo, Ruth (Texas Department of Housing and Community Affairs), Austin SB 1613 FOR: Flores, Joe (Mercedes ISD Fine Arts Council), Mercedes Mulryan, Seamus (Mercedes ISD Fine Arts Council), Mercedes ON: Batiste, John Paul (Texas Arts Commission), Austin Registering, but not testifying: For: Velasquez, Sally (Webb Co., Willacy Co., City of Eagle Pass), Austin On: Snell, Fred (Texas Commission on the Arts), Austin SB 1622 FOR: Henneberger, John (Texas Low Income Housing Information Service), Austin Mintz, David (Texas Apartment Association), Austin ON: Hoffpauir, Keith (Texas Department of Housing and Community Affairs), Austin Stewart, Brent (Texas Department of Housing and Community Affairs), Austin Registering, but not testifying: For: Ocanas, Reymundo (Texas Assocation of CDC's), Austin On: Stiner, Daisy (Texas Department of Housing and Community Affairs), Austin SB 1660 FOR: Pauli, Ann (Paso del Norte Health Foundation), El Paso Rodriguez, Jose (El Paso County), El Paso ON: Archer, William (Texas Department of Health), Austin Cunningham, William (U.T. Systems), Austin Erowson, James (Texas Tech), Lubbock Natalicio, Diana (University of Texas at El Paso), El Paso Registering, but not testifying: For: Escobar, Bonnie (Greater El Paso Chamber of Commerce), El Paso Gutierrez, Jesse (Mexican American Legal Defense & Educational Fund), San Antonio On: Dutton, Dr. R.J. (Texas Department of Health), Austin SB 1703 FOR: Riecss, Don (Home Depot), Austin ON: Hendrix, Scott (Texas Comptroller of Public Accounts), Austin Wattles, Dan (Texas Department of Housing and Community Affairs), Austin Registering, but not testifying: For: Henneberger, John (Texas Low Income Housing Information Service), Austin Ocanas, Reymundo (Texas Association of CDC's), Austin SB 1857 Registering, but not testifying: On: Dutton, R.J. (Texas Department of Health), Austin SJR 35 FOR: Henneberger, John (Texas Low Income Housing Information Service), Austin Mintz, David (Texas Apartment Association), Austin ON: Hoffpauir, Keith (Texas Deptment of Housing and Community Affairs), Austin Stewart, Brent (Texas Department of Housing and Community Affairs), Austin Registering, but not testifying: For: Ocanas, Reymundo (Texas Association of CDCs), Austin On: Stiner, Daisy (Texas Department of Housing and Community Affairs), Austin


Values? Who, me?
Exploring My (Inner) Values
08/21/15
In this chart are the values that depict my happiest, my proudest, and the most satisfied times in my life.
| EXPLORING | YOUR | VALUES |
|---|---|---|
| Spirituality | Adventure | Freedom |
| Introspection | Growth | Insight |
| Creativity | Quality | Pleasure |
| Coolness under fire | Competence | Challenge |
| Tranquility | Effectiveness | Community |
| Wisdom | Integrity | Will-power |
In general I try very hard to live up to these values. There are certainly things that I’d like to be more involved with my community. I belong to several very dear and loving communities. They love me and embrace my uniqueness. I try to give back in ways that I excel such as building and designing things but I’d like to get more involved still. I’m an introvert and people take up a lot of my energy so I’ve always felt like I’m on the periphery of these communities.
I think the thing that I value most is Adventure. I have a very curious mind and without new adventures I think a lot of my other values would cease to exist. I’m a person that needs to explore new ideas, new concepts, new careers ( :P ). It keeps me growing as a person and challenged in life.
Advice? Ask me anything about building stuff or a design challenge. I’m the go to guy for anyone that I know. I’m good at figuring out how things are made, put together and I’m really good with my hands ☺


|
|---|
| Children, obey your parents in the Lord: for this is right.
|
|---|
| ᏗᏥᏲᎵ, ᏕᏦᎯᏳᏎᏍᏗ ᏗᏥᎦᏴᎵᎨᎢ ᎤᎬᏫᏳᎯ ᎨᏒ ᏅᏗᎦᎵᏍᏙᏗᏍᎨᏍᏗ; ᏚᏳᎪᏗᏰᏃ ᎾᏍᎩ ᎯᎠ.
|
|---|
Di-tsi-yo-li, de-tso-hi-yu-se-s-di di-tsi-ga-yv-li-ge-i U-gv-wi-yu-hi ge-sv nv-di-ga-li-s-do-di-s-ge-s-di; du-yu-go-di-ye-no na-s-gi hi-a.
|
|---|
|
|---|
| Honour thy father and mother; (which is the first commandment with promise;)
|
|---|
| ᎯᎸᏉᏕᏍᏗ ᏣᏙᏓ ᎠᎴ ᏣᏥ, ᎾᏍᎩ ᎢᎬᏱᏱ ᎤᎵᏁᏨ ᏥᎩ ᏧᎵᏠᏯᏍᏗ ᎠᏚᎢᏍᏛᎢ,
|
|---|
Hi-lv-quo-de-s-di tsa-do-da a-le tsa-tsi, na-s-gi i-gv-yi-yi u-li-ne-tsv tsi-gi tsu-li-tlo-ya-s-di a-du-i-s-dv-i,
|
|---|
|
|---|
| That it may be well with thee, and thou mayest live long on the earth.
|
|---|
| ᎾᏍᎩ ᎣᏏᏳ ᎢᎨᏣᎵᏍᏓᏁᏗ ᏱᎩ, ᎠᎴ ᎪᎯᏗᏳ ᎨᏣᎴᏂᏓᏍᏗ ᏱᎩ ᎡᎶᎯ.
|
|---|
Na-s-gi o-si-yu i-ge-tsa-li-s-da-ne-di yi-gi, a-le go-hi-di-yu ge-tsa-le-ni-da-s-di yi-gi e-lo-hi.
|
|---|
|
|---|
| And, ye fathers, provoke not your children to wrath: but bring them up in the nurture and admonition of the Lord.
|
|---|
| ᎠᎴ ᏂᎯ ᎢᏥᎦᏴᎵᎨᎢ, ᏞᏍᏗ ᏱᏗᏥᎿᎭᎸᏍᏗᏍᎨᏍᏗ ᏗᏤᏥ; ᏕᏣᏛᎯᏍᏗᏍᎨᏍᏗᏍᎩᏂ ᎤᎬᏫᏳᎯ ᎤᏤᎵ ᏗᏕᏲᏗ ᎨᏒ ᎠᎴ ᎨᏯᏙᎥᎯᏍᏗ ᎨᏒᎢ.
|
|---|
A-le ni-hi i-tsi-ga-yv-li-ge-i, tle-s-di yi-di-tsi-hna-lv-s-di-s-ge-s-di di-tse-tsi; de-tsa-dv-hi-s-di-s-ge-s-di-s-gi-ni U-gv-wi-yu-hi u-tse-li di-de-yo-di ge-sv a-le ge-ya-do-v-hi-s-di ge-sv-i.
|
|---|
|
|---|
| Servants, be obedient to them that are your masters according to the flesh, with fear and trembling, in singleness of your heart, as unto Christ;
|
|---|
| ᎡᏥᏅᏏᏓᏍᏗ, ᏕᏦᎯᏳᏎᏍᏗ ᎾᏍᎩ ᎨᏥᏅᏏᏙᎯ ᎠᏂ ᎤᏇᏓᎵ, ᎨᏒᎢ, ᎢᏥᎾᏰᏍᎨᏍᏗ ᎠᎴ ᏕᏥᎾᏫᏍᎨᏍᏗ, ᎣᏏᏳ ᎢᏥᏰᎸᎯ ᎨᏎᏍᏗ ᏗᏥᎾᏫᏱ, ᎦᎶᏁᏛ ᏥᏁᏣᏛᏁᎰ ᎾᏍᎩᏯᎢ.
|
|---|
E-tsi-nv-si-da-s-di, de-tso-hi-yu-se-s-di na-s-gi ge-tsi-nv-si-do-hi a-ni u-que-da-li, ge-sv-i, i-tsi-na-ye-s-ge-s-di a-le de-tsi-na-wi-s-ge-s-di, o-si-yu i-tsi-ye-lv-hi ge-se-s-di di-tsi-na-wi-yi, Ga-lo-ne-dv tsi-ne-tsa-dv-ne-ho na-s-gi-ya-i.
|
|---|
|
|---|
| Not with eyeservice, as menpleasers; but as the servants of Christ, doing the will of God from the heart;
|
|---|
| ᎥᏝ ᏥᏛᏓᏗᎧᏃ ᎢᏳᏍᏗ, ᏴᏫᏉ ᎣᏏᏳ ᎤᏂᏰᎸᏗ; ᎦᎶᏁᏛᏍᎩᏂ ᏧᏅᏏᏓᏍᏗ ᎢᏳᎾᏛᏁᏗ, ᎤᏁᎳᏅᎯ ᎣᏏᏳ ᎤᏰᎸᏗ ᏂᏣᏛᏁᎲᎢ, ᏗᏥᎾᏫᏱ ᏨᏗᏓᎴᎲᏍᎪᎢ;
|
|---|
V-tla tsi-dv-da-di-ka-no i-yu-s-di, yv-wi-quo o-si-yu u-ni-ye-lv-di; Ga-lo-ne-dv-s-gi-ni tsu-nv-si-da-s-di i-yu-na-dv-ne-di, U-ne-la-nv-hi o-si-yu u-ye-lv-di ni-tsa-dv-ne-hv-i, di-tsi-na-wi-yi tsv-di-da-le-hv-s-go-i;
|
|---|
|
|---|
| With good will doing service, as to the Lord, and not to men:
|
|---|
| ᎣᏏᏳ ᎢᏥᏰᎸᎯ ᎪᎱᏍᏗ ᎢᏣᏛᏁᎲ, ᎤᎬᏫᏳᎯ ᏥᏁᏣᏛᏁᎰ ᎾᏍᎩᏯᎢ, ᎥᏝᏃ ᏴᏫᏉ ᏥᏂᏕᏣᏛᏁᎰ ᎾᏍᎩᏯᎢ;
|
|---|
O-si-yu i-tsi-ye-lv-hi go-hu-s-di i-tsa-dv-ne-hv, U-gv-wi-yu-hi tsi-ne-tsa-dv-ne-ho na-s-gi-ya-i, v-tla-no yv-wi-quo tsi-ni-de-tsa-dv-ne-ho na-s-gi-ya-i;
|
|---|
|
|---|
| Knowing that whatsoever good thing any man doeth, the same shall he receive of the Lord, whether he be bond or free.
|
|---|
| ᎢᏥᎦᏔᎲ ᎾᏍᎩ ᏂᎦᎥ ᎪᎱᏍᏗ ᎣᏍᏛ ᏚᎸᏫᏍᏓᏁᎲ ᎩᎶᎢ, ᎾᏍᎩᏯ ᎢᏳᏍᏗ ᎤᏁᏗ ᎨᏒ ᎤᎬᏫᏳᎯ, ᎾᏍᏉ ᎠᏥᎾᏝᎢ ᏱᎩ, ᎠᎴ ᎾᏥᎾᏝᎥᎾ ᏱᎩ.
|
|---|
I-tsi-ga-ta-hv na-s-gi ni-ga-v go-hu-s-di o-s-dv du-lv-wi-s-da-ne-hv gi-lo-i, na-s-gi-ya i-yu-s-di u-ne-di ge-sv U-gv-wi-yu-hi, na-s-quo a-tsi-na-tla-i yi-gi, a-le na-tsi-na-tla-v-na yi-gi.
|
|---|
|
|---|
| And, ye masters, do the same things unto them, forbearing threatening: knowing that your Master also is in heaven; neither is there respect of persons with him.
|
|---|
| ᎠᎴ ᏂᎯ ᏗᏣᏓᏅᏏᏙᎯ, ᎾᏍᎩᏯ ᎤᏠᏱ ᎾᏍᎩ ᏂᏕᏣᏛᏁᎮᏍᏗ, ᎤᏁᎳᎩ ᎢᏤᎵᏎᏍᏗ ᏕᏥᎾᏰᏓᏁᎲᎢ, ᏥᏥᎦᏔᎭ ᎾᏍᎩ ᏂᎯ ᎾᏍᏉ ᎢᏥᏅᏏᏙᎯ ᎦᎸᎶᎢ ᎡᎲᎢ; ᎥᏝ ᎠᎴ ᏱᏚᏑᏰᏍᏗ ᏴᏫ ᏗᎬᏩᎸᏉᏙᏗ ᎨᏒᎢ.
|
|---|
A-le ni-hi di-tsa-da-nv-si-do-hi, na-s-gi-ya u-tlo-yi na-s-gi ni-de-tsa-dv-ne-he-s-di, u-ne-la-gi i-tse-li-se-s-di de-tsi-na-ye-da-ne-hv-i, tsi-tsi-ga-ta-ha na-s-gi ni-hi na-s-quo I-tsi-nv-si-do-hi ga-lv-lo-i e-hv-i; v-tla a-le yi-du-su-ye-s-di yv-wi di-gv-wa-lv-quo-do-di ge-sv-i.
|
|---|
|
|---|
| Finally, my brethren, be strong in the Lord, and in the power of his might.
|
|---|
| ᎤᎵᏍᏆᎸᏗᏃ ᎨᏒᎢ, ᎢᏓᎵᏅᏟ, ᏗᏣᎵᏂᎩᏗᏳ ᎨᏎᏍᏗ ᎤᎬᏫᏳᎯ ᎡᏣᎵᏍᎦᏍᏙᏛᎢ, ᎠᎴ ᎢᏣᎵᏍᎦᏍᏙᏛ ᎤᏣᏔᏅᎯ ᎤᎵᏂᎩᏗᏳ ᎨᏒᎢ.
|
|---|
U-li-s-qua-lv-di-no ge-sv-i, i-da-li-nv-tli, di-tsa-li-ni-gi-di-yu ge-se-s-di U-gv-wi-yu-hi e-tsa-li-s-ga-s-do-dv-i, a-le i-tsa-li-s-ga-s-do-dv u-tsa-ta-nv-hi u-li-ni-gi-di-yu ge-sv-i.
|
|---|
|
|---|
| Put on the whole armour of God, that ye may be able to stand against the wiles of the devil.
|
|---|
| ᏂᎦᏛ ᎤᏁᎳᏅᎯ ᎤᏤᎵᎦ ᎠᎵᏍᎦᏍᏙᏙ ᎢᏣᏣᏅᏓ, ᎾᏍᎩ ᏰᎵ ᎨᏣᎴᏗ ᎢᏳᎵᏍᏙᏗᏱ ᎠᏍᎩᎾ ᎠᏏᎾᏌᏅ ᏕᏥᎦᏘᎸᏍᏗᏍᎬᎢ.
|
|---|
Ni-ga-dv U-ne-la-nv-hi u-tse-li-ga a-li-s-ga-s-do-do i-tsa-tsa-nv-da, na-s-gi ye-li ge-tsa-le-di i-yu-li-s-do-di-yi a-s-gi-na a-si-na-sa-nv de-tsi-ga-ti-lv-s-di-s-gv-i.
|
|---|
|
|---|
| For we wrestle not against flesh and blood, but against principalities, against powers, against the rulers of the darkness of this world, against spiritual wickedness in high places.
|
|---|
| ᎥᏝᏰᏃ ᏱᏗᎦᏟᏴᎭ ᎤᏇᏓᎵ ᎨᏒ ᎠᎴ ᎩᎬ, ᎤᏂᎬᏫᏳᎯᏍᎩᏂ, ᎠᎴ ᏧᎾᎵᏂᎩᏛ, ᎠᎴ ᏄᏂᎬᏫᏳᏌᏕᎩ ᎠᏂ ᎡᎶᎯ ᎤᎵᏏᎩ ᎨᏒᎢ, ᏗᏓᏅᏙ ᎤᏂᏁᎫᏥᏛ ᎦᎸᎶ ᏄᎾᏛᎿᎭᏕᎬᎢ.
|
|---|
V-tla-ye-no yi-di-ga-tli-yv-ha u-que-da-li ge-sv a-le gi-gv, u-ni-gv-wi-yu-hi-s-gi-ni, a-le tsu-na-li-ni-gi-dv, a-le nu-ni-gv-wi-yu-sa-de-gi a-ni e-lo-hi u-li-si-gi ge-sv-i, di-da-nv-do u-ni-ne-gu-tsi-dv ga-lv-lo nu-na-dv-hna-de-gv-i.
|
|---|
|
|---|
| Wherefore take unto you the whole armour of God, that ye may be able to withstand in the evil day, and having done all, to stand.
|
|---|
| ᎾᏍᎩ ᎢᏳᏍᏗ ᎢᏣᎩ ᏂᎦᏛ ᎠᎵ ᏍᎦᏍᏙᏙ ᎤᏁᎳᏅᎯ ᎤᏤᎵᎦ, ᎾᏍᎩ ᏰᎵ ᏗᎨᏣᏟᏴᏗ ᎢᏳᎵᏍᏙᏗᏱ ᎾᎯᏳ ᎤᏲᎢᏳ ᎢᎦ ᎨᏎᏍᏗ, ᎾᏍᎩᏃ ᏂᎦᏛ ᎢᏣᏛᏁᎸᎯ ᎨᏎᏍᏗ, ᎨᏣᎴᏗ ᎢᏳᎵᏍᏙᏗᏱ.
|
|---|
Na-s-gi i-yu-s-di i-tsa-gi ni-ga-dv a-li s-ga-s-do-do U-ne-la-nv-hi u-tse-li-ga, na-s-gi ye-li di-ge-tsa-tli-yv-di i-yu-li-s-do-di-yi na-hi-yu u-yo-i-yu i-ga ge-se-s-di, na-s-gi-no ni-ga-dv i-tsa-dv-ne-lv-hi ge-se-s-di, ge-tsa-le-di i-yu-li-s-do-di-yi.
|
|---|
|
|---|
| Stand therefore, having your loins girt about with truth, and having on the breastplate of righteousness;
|
|---|
| ᎾᏍᎩ ᎢᏳᏍᏗ ᏕᏥᏙᎨᏍᏗ, ᏕᏣᏓᏠᏍᏕᏍᏗ ᎦᏰᎪᎩ ᏂᎨᏒᎾ ᎨᏒᎢ, ᎠᎴ ᏚᏳᎪᏛ ᎨᏒ ᏕᏣᏓᏁᏣᏍᏚᎶᏕᏍᏗ;
|
|---|
Na-s-gi i-yu-s-di de-tsi-do-ge-s-di, de-tsa-da-tlo-s-de-s-di ga-ye-go-gi ni-ge-sv-na ge-sv-i, a-le du-yu-go-dv ge-sv de-tsa-da-ne-tsa-s-du-lo-de-s-di;
|
|---|
|
|---|
| And your feet shod with the preparation of the gospel of peace;
|
|---|
| ᏗᏣᎳᏏᏕᏂᏃ ᏕᏣᎳᏑᎶᏕᏍᏗ ᎠᏛᏅᎢᏍᏔᏅᎯ ᎨᏒ ᎣᏍᏛ ᎧᏃᎮᏛ ᏅᏩᏙᎯᏯᏛ ᎠᏓᏁᎯ;
|
|---|
Di-tsa-la-si-de-ni-no de-tsa-la-su-lo-de-s-di a-dv-nv-i-s-ta-nv-hi ge-sv o-s-dv ka-no-he-dv nv-wa-do-hi-ya-dv a-da-ne-hi;
|
|---|
|
|---|
| Above all, taking the shield of faith, wherewith ye shall be able to quench all the fiery darts of the wicked.
|
|---|
| ᎠᏎᏃ ᎾᏍᏉ ᎪᎯᏳᏗ ᎨᏒ ᎢᏣᎵᎬᏑᎶᏓ, ᎾᏍᎩ ᎢᏨᏗᏍᎬ ᏰᎵᏉ ᏗᎨᏨᏜᏓᏕᏗ ᎢᏳᎵᏍᏙᏗᏱ ᏧᏥᏍᏟ ᎦᏂ ᎠᏍᎩᎾ ᏧᏤᎵᎦ.
|
|---|
A-se-no na-s-quo go-hi-yu-di ge-sv i-tsa-li-gv-su-lo-da, na-s-gi i-tsv-di-s-gv ye-li-quo di-ge-tsv-dla-de-di i-yu-li-s-do-di-yi tsu-tsi-s-tli ga-ni a-s-gi-na tsu-tse-li-ga.
|
|---|
|
|---|
| And take the helmet of salvation, and the sword of the Spirit, which is the word of God:
|
|---|
| ᎠᎵᏍᏕᎸᏙᏗᏃ ᎠᎵᏍᏚᎶ ᎢᏥᎾᎩ, ᎠᎴ ᎠᏰᎳᏍᏗ-ᎦᏅᎯᏛ ᎠᏓᏅᏙ ᎤᏤᎵᎦ, ᎾᏍᎩ ᎧᏃᎮᏛ ᎤᏁᎳᏅᎯ ᎤᏤᎵ ᏥᎩ;
|
|---|
A-li-s-de-lv-do-di-no a-li-s-du-lo i-tsi-na-gi, a-le a-ye-la-s-di--ga-nv-hi-dv A-da-nv-do u-tse-li-ga, na-s-gi ka-no-he-dv U-ne-la-nv-hi u-tse-li tsi-gi;
|
|---|
|
|---|
| Praying always with all prayer and supplication in the Spirit, and watching thereunto with all perseverance and supplication for all saints;
|
|---|
| ᏂᎪᎯᎸ ᎢᏣᏓᏙᎵᏍᏗᏍᎨᏍᏗ ᏄᏓᎴᏒ ᎠᏓᏙᎵᏍᏗ ᎨᏒ, ᎠᎴ ᎠᏔᏲᏍᏗ ᎨᏒ ᎠᏓᏅᏙ ᎬᏗ, ᎠᎴ ᎢᏥᏯᏫᏍᎨᏍᏗ ᎾᎿᎭᏂ ᎢᏨᏗᏍᎨᏍᏗ ᏗᏯᏪᎢᏍᏗ ᏂᎨᏒᎾ, ᎠᎴ ᎠᏔᏲᏍᏗ ᎨᏒ ᎨᏥᏍᏕᎸᏗᏱ ᎤᎾᏓᏅᏘ ᎾᏂᎥᎢ.
|
|---|
Ni-go-hi-lv i-tsa-da-do-li-s-di-s-ge-s-di nu-da-le-sv a-da-do-li-s-di ge-sv, a-le a-ta-yo-s-di ge-sv A-da-nv-do gv-di, a-le i-tsi-ya-wi-s-ge-s-di na-hna-ni i-tsv-di-s-ge-s-di di-ya-we-i-s-di ni-ge-sv-na, a-le a-ta-yo-s-di ge-sv ge-tsi-s-de-lv-di-yi u-na-da-nv-ti na-ni-v-i.
|
|---|
|
|---|
| And for me, that utterance may be given unto me, that I may open my mouth boldly, to make known the mystery of the gospel,
|
|---|
| ᎠᎴ ᎠᏴ ᎥᎩᏍᏕᎸᏗᏱ, ᎾᏍᎩ ᎥᏆᎵᏍᎪᎸᏓᏁᏗᏱ ᎠᎩᏬᏂᎯᏍᏗᏱ, ᎠᎩᏍᏚᎢᏍᏗᏱ ᏥᎣᎵ ᏂᏥᏍᎦᎢᎲᎾ, ᎬᏂᎨᏒ ᎢᏯᏋᏁᏗᏱ ᎤᏕᎵᏛ ᎨᏒ ᎣᏍᏛ ᎧᏁᎮᏛ;
|
|---|
A-le a-yv v-gi-s-de-lv-di-yi, na-s-gi v-qua-li-s-go-lv-da-ne-di-yi a-gi-wo-ni-hi-s-di-yi, a-gi-s-du-i-s-di-yi tsi-o-li ni-tsi-s-ga-i-hv-na, gv-ni-ge-sv i-ya-quv-ne-di-yi u-de-li-dv ge-sv o-s-dv ka-ne-he-dv;
|
|---|
|
|---|
| For which I am an ambassador in bonds: that therein I may speak boldly, as I ought to speak.
|
|---|
| ᎾᏍᎩ [ᎣᏍᏛ ᎧᏃᎮᏛ] ᏥᏅᏗᎦᎵᏍᏙᏗᎭ ᎠᏴ ᎥᎩᏅᏏᏛ ᎥᏆᎸᎢᏛ ᏥᎩ; ᎾᏍᎩ ᎢᏳᏩᏂᏐᏗᏱ ᎾᎿᎭᏂ ᏂᏥᏍᎦᎢᎲᎾ ᎠᎩᏁᎢᏍᏗᏱ, ᎾᏍᎩᏯ ᎢᏯᎩᏪᏍᏗᏱ ᏥᏚᏳᎪᏗ.
|
|---|
Na-s-gi [o-s-dv ka-no-he-dv] tsi-nv-di-ga-li-s-do-di-ha a-yv v-gi-nv-si-dv v-qua-lv-i-dv tsi-gi; na-s-gi i-yu-wa-ni-so-di-yi na-hna-ni ni-tsi-s-ga-i-hv-na a-gi-ne-i-s-di-yi, na-s-gi-ya i-ya-gi-we-s-di-yi tsi-du-yu-go-di.
|
|---|
|
|---|
| But that ye also may know my affairs, and how I do, Tychicus, a beloved brother and faithful minister in the Lord, shall make known to you all things:
|
|---|
| ᎾᏍᎩᏃ ᎢᏥᎦᏙᎥᎯᏍᏗᏱ ᎾᏍᏉ ᎠᏴ ᎾᏆᎵᏍᏓᏁᎵᏕᎬ ᎠᎴ ᎾᏆᏛᎿᎭᏕᎬᎢ, ᏗᎩᎦ, ᎣᏥᎨᏳᎢ ᎣᏣᎵᏅᏟ ᎠᎴ ᎣᏍᏛ ᎢᏯᏛᏁᎯ ᏧᎸᏫᏍᏓᏁᎯ ᎤᎬᏫᏳᎯ ᎤᏤᎵ ᎤᎬᏩᎵ, ᎬᏂᎨᏒ ᏅᏓᏨᏁᎵ ᏄᏓᎴᏒ ᎪᎱᏍᏗ;
|
|---|
Na-s-gi-no i-tsi-ga-do-v-hi-s-di-yi na-s-quo a-yv na-qua-li-s-da-ne-li-de-gv a-le na-qua-dv-hna-de-gv-i, Di-gi-ga, o-tsi-ge-yu-i o-tsa-li-nv-tli a-le o-s-dv i-ya-dv-ne-hi tsu-lv-wi-s-da-ne-hi U-gv-wi-yu-hi u-tse-li u-gv-wa-li, gv-ni-ge-sv nv-da-tsv-ne-li nu-da-le-sv go-hu-s-di;
|
|---|
|
|---|
| Whom I have sent unto you for the same purpose, that ye might know our affairs, and that he might comfort your hearts.
|
|---|
| ᎾᏍᎩ ᏥᏅᎵ ᏗᏤᎲᎢ ᎾᏍᎩᏉ ᎤᎬᏩᎵ, ᎾᏍᎩ ᎢᏥᎦᏙᎥᎯᏍᏗᏱ ᏃᎦᎵᏍᏓᏁᎵᏕᎬᎢ, ᎠᎴ ᎾᏍᎩ ᏧᎦᎵᏍᏓᏗᏍᏗᏱ ᏗᏥᎾᏫ.
|
|---|
Na-s-gi tsi-nv-li di-tse-hv-i na-s-gi-quo u-gv-wa-li, na-s-gi i-tsi-ga-do-v-hi-s-di-yi no-ga-li-s-da-ne-li-de-gv-i, a-le na-s-gi tsu-ga-li-s-da-di-s-di-yi di-tsi-na-wi.
|
|---|
|
|---|
| Peace be to the brethren, and love with faith, from God the Father and the Lord Jesus Christ.
|
|---|
| ᎤᏩᏙᎯᏯᏛ ᏚᏂᎧᎿᎭᏩᏗᏙᎮᏍᏗ ᎠᎾᎵᏅᏟ, ᎠᎴ ᎠᏓᎨᏳᏗ ᎨᏒ ᎤᎵᏠᏯᏍᏕᏍᏗ ᎪᎯᏳᏗ ᎨᏒᎢ, ᏅᏓᏳᎾᎵᏍᎪᎸᏔᏅᎯ ᎤᏁᎳᏅᎯ ᎠᎦᏴᎵᎨᎢ, ᎠᎴ ᎤᎬᏫᏳᎯ ᏥᏌ ᎦᎶᏁᏛ.
|
|---|
U-wa-do-hi-ya-dv du-ni-ka-hna-wa-di-do-he-s-di a-na-li-nv-tli, a-le a-da-ge-yu-di ge-sv u-li-tlo-ya-s-de-s-di go-hi-yu-di ge-sv-i, nv-da-yu-na-li-s-go-lv-ta-nv-hi U-ne-la-nv-hi A-ga-yv-li-ge-i, a-le U-gv-wi-yu-hi Tsi-sa Ga-lo-ne-dv.
|
|---|
|
|---|
| Grace be with all them that love our Lord Jesus Christ in sincerity. Amen.
|
|---|
| ᎬᏩᎦᏘᏯ ᎤᏓᏙᎵᏍᏗ ᎨᏒ ᏚᏂᎧᎿᎭᏩᏗᏙᎮᏍᏗ ᎾᏂᎥ ᏄᎾᏠᎾᏍᏛᎾ ᎤᏂᎨᏳᎯ ᎢᎦᏤᎵ ᎤᎬᏫᏳᎯ ᏥᏌ ᎦᎶᏁᏛ. ᎡᎺᏅ.
|
|---|
Gv-wa-ga-ti-ya u-da-do-li-s-di ge-sv du-ni-ka-hna-wa-di-do-he-s-di na-ni-v nu-na-tlo-na-s-dv-na u-ni-ge-yu-hi i-ga-tse-li U-gv-wi-yu-hi Tsi-sa Ga-lo-ne-dv. E-me-nv.
|
|---|


Far out in the uncharted backwaters of the unfashionable end of the western spiral arm of the Galaxy lies a small unregarded yellow sun.
Orbiting this at a distance of roughly ninety-two million miles is an utterly insignificant little blue green planet whose ape-descended life forms are so amazingly primitive that they still think digital watches are a pretty neat idea.
This planet has - or rather had - a problem, which was this: most of the people living on it were unhappy for pretty much of the time. Many solutions were suggested for this problem, but most of these were largely concerned with the movements of small green pieces of paper, which is odd because on the whole it wasn't the small green pieces of paper that were unhappy.
And so the problem remained; lots of the people were mean, and most of them were miserable, even the ones with digital watches.
Many were increasingly of the opinion that they'd all made a big mistake in coming down from the trees in the first place. And some suggested that even the trees had been a bad move, and that no one should ever have left the oceans.


{{> header}}
I have an interest in mobile computing, machine learning and the technologies of the future. I have a high expectation for simplicity. I believe the best solutions are both simple to understand, are performance efficient and are well usable. One must achieve to offer the best possible user experience.
My main area of interest are mobile and distributed systems. I quite like learning about and working with artificial intelligence, machine learning, and knowledge engineering. I particularly enjoy solving difficult problems, and I aim to learning something new every day.
{{#each skills.structure}} {{name}} {{/each}}


| | |
- BK4052
-
- NewClass
- ChannelFuncGen
-
- NewClass
BK4052 = class NewClass(BK4052) |
| |
This is the overwritten class |
| |
Methods defined here:
- __setattr__(self, name, value)
Methods inherited from BK4052:
- __init__(self)
- BK4052
=========
This is a virtual object that represents the arbitrary function
generator BK4052 and mimics it's behaviour. The user should
interact with this object in the same fashion he or she interacts
with the function generator. As it is the case for the real function
generator, we have independent access to the both channels, which
are represented by "ch1" and "ch2".
The instrument has a "identify" function that returns the instrument
information and 3 pyvisa wrapped functions: "read", "write", "query"
and "close" (go to pyvisa documentation for more detail). There is also
a function "find_interface" that automatic find in which USB port
the function generator is connected.
Usage:
>>> import pylef # import the pylef package
>>> instrument = pylef.BK4052() # define the instrument
>>> instrument.idenfify() # idenfity the instrument
The channels are independently defined and accessed. For each one of
them we can set up the function properties, such as 'frequency' and
'peak-to-peak voltage' and many channel attibutes, such as 'inversion',
'load impedance' and 'TTL sync output'. We can also, turn the channels
ON and OFF.
>>> channel1 = instrument.ch1() # define channel 1
>>> channel1.turn_on() # turn channel 1 ON
>>> channel1.sync_on() # turn the TTL sync output for channel 1
The most important is the 'function type', which can be one of those:
'SINE', 'SQUARE', 'RAMP', 'PULSE', 'NOISE', 'ARB', 'DC' and each one of
them are defined by a particular set of properties. Those properties are
one of: 'frequency', 'Vpp', 'offset', 'phase', 'symmetry', 'duty', 'mean',
'stdev', 'delay'. Some of those properties are share by more the one
function type and some are privative to only one type. For example, 'SINE',
'SQUARE', 'RAMP', 'ARB' and 'PULSE' have the 'frequency' and 'Vpp' properties
while 'noise' type is the only one who has the 'mean' and 'stded' properties.
Usage:
>>> channel1.set_function('ramp') # create a triangular wave
>>> channel1.set_frequency(100) # set the frequency to 100 Hz
>>> channel1.set_Vpp(2) # set the peak-to-peak voltage to 2 V
>>> channel1.set_frequency()
>>> channel2.turn_on() # turn channel 2 ON
>>> channel2.set_function('noise') # create a noise
>>> channel2.set_mean(0) # set the average 0 V
>>> channel2.set_stdev(0.5) # set the standard deviation to 0.5 V
The function "wave_info" returns a python dictionay with the particular wave
information
Usage:
>>> info1 = channel1.wave_info() # current wave information of channel 1
>>> print(info1['frequency']) # will return 100
>>> print(info1['type']) # will return ramp
>>> info2 = channel2.wave_info() # current wave information of channel 2
>>> print(info2['stdev']) # will return 0.5
- close(self)
- close the instrument
- find_interface(self)
- Function to extract the interface name for the BK function generator
- identify(self)
- identify the resource
- query(self, msg)
- query into the laser
- read(self)
- read from the laser
- wait(self)
- wait for the task to end
- write(self, msg)
- write into the laser
|
ChannelFuncGen = class NewClass(ChannelFuncGen) |
| |
This is the overwritten class |
| |
Methods defined here:
- __setattr__(self, name, value)
Methods inherited from ChannelFuncGen:
- __init__(self, instrument, channel)
- Class for the channels of the function generator
- copy_from(self)
- copy the parameters from this channel to the other channel
- copy_to(self)
- copy the parameters to this channel from the other channel
- invert_off(self)
- turn the specified channel inversion OFF
- invert_on(self)
- turn the specified channel inversion ON
- load(self)
- return the specified channel load
- set_Vpp(self, val)
- set the function generator voltage peak-to-peak
- set_delay(self, val)
- set the function generator pulse delay in seconds
- set_duty(self, val)
- set the function generator duty cycle
- set_frequency(self, val)
- set the function generator frequency
- set_function(self, val)
- set the function at the channel
- set_load_50(self)
- set the channel load to 50 Ohms
- set_load_hz(self)
- set the channel load to HZ
- set_mean(self, val)
- set the function generator mean in Volts
- set_offset(self, val)
- set the function generator offset
- set_phase(self, val)
- set the function generator phase
- set_stdev(self, val)
- set the noise function generator standard deviation in Volts
- set_symmetry(self, val)
- set the function generator signal symmetry
- state(self)
- return the specified channel state
- sync(self)
- return the specified channel sync response
- sync_off(self)
- turn the specified channel sync OFF
- sync_on(self)
- turn the specified channel sync ON
- turn_off(self)
- turn the specified channel OFF
- turn_on(self)
- turn the specified channel ON
- wave_info(self, raw_output=False)
- return the wave information for "channel". If raw_output = True, the output from the function is returned without processing
| |


Full Page Mode
C
o
l
o
r
o
n
Play
hint:
red
color always comes first
Bouncing ball
changes color
Tap the screen to switch the colors of
the next bar (Red, Yellow, Purple)
Always match the
ball and bar colors
Coloron
Tweet to challenge friends
Tweet
Play Again
Menu


Open Source Climatic Exposure Test Cabinet Example V1.0
This is a development prototype of the Open Source Climatic Exposure Test Cabinet V1.0 for testing purposes only. Software always contains bugs that possibly lead to errors and malfunctions - Please inform Mr. Björn Huwe if you experience errors or malfunctions on this software. The server is not set up yet for multiple simultaneous access.
This software is running in "debug mode" for validation purposes. Do not leave the machine unattended!


| Created: | 07/01/2012 |
| Last Revised: | 10/06/2013 |
| Version: | 2.0 |
| Status: | Draft |
| Author: | Dennis Heimbigner |
| Affiliation: | Unidata/UCAR |
| email: |<EMAIL_ADDRESS>|
WARNING: this document assumes the reader has significant experience with both Bison, XML, and SAX. Note also that Bison version 3.0 or later is required.
A SAX (Simple API for XML) parser is a particular mechanism for parsing XML documents. Using a SAX parser has the advantage over the DOM-based parser in that it is not necessary to build the explicit DOM tree.
Traditionally, SAX parsing has been difficult to use. The reason is that it requires keeping track of a complex and recursive state in order to track the parser's activities. The result is that debugging a SAX parser can be painful .
The SAX parser operates by generating events representing "tokens" from the XML document. Consider for example, this document.
<element1> <element2> </element2> </element1>The SAX parser would typically generate the following events:
startDocument startElement for element1 startElement for element2 endElement for element2 endElement for element1 endDocumentIn practice, the set of possible events is more extensive, although for any given class of XML document, many of these events can be ignored.
The controlling SAX parser invokes callback procedures in a user-supplied handler class. For each event type, a specific method is called in the handler class. For an example of such a handler class, see this example.
http://www.saxproject.org/apidoc/org/xml/sax/helpers/DefaultHandler.html
Turning now to Bison, the Bison/YACC system (http://www.gnu.org/software/bison/) is an extremely powerful compiler generator system. The term "YACC" refers to a much older parser generator system. GNU Bison is its modern replacment, although its grammar file format is very similar. Only the term "Bison" will be used in this document.
The Gnu Bison parser generator supports what is called "push-parsing" where the parser is fed tokens one by one. This is essentially the same model as a SAX parser where the SAX events serve the role of tokens and the SAX parser is, in effect, a push-parser in Bison terms.
So the goal of this project is to bring together Bison push-parsing and SAX parsing so that constructing a SAX parser for some class of XML documents becomes substantially easier.
Using the sequence of SAX generated callback events plus a Bison grammar, it is possible to carry at least the following kinds of activities.
Activity #2 is the most general case. It simultaneously validates the XML token stream against the Bison grammar and, using Bison grammar actions, can create internal data structures containing information extracted from the XML document.
Activity #3, DOM trees, is actually an example of #2 where the grammar is a general grammar for xml (see the file xml.y) and the created data structure is a DOM tree.
The yax system provides a general approach and support library for producing Bison-based XML document parsers. While it has a number of limitations, it is relatively simple to use.
The key piece of software for achieving the above is a library that can convert a sequence of SAX callback events into lexical tokens acceptable to a Bison generated push parser.
Currently multiple version of the yax system are provided: one for each supported programming language. Currently, the supported language are:
<start> <ref name="xxx"/> </start>
%start xxx
<define name="xxx"> <element name="XXX"> ... </element>
xxx: XXXOPEN ... XXXCLOSE
Version 2 shows the other, better solution. This set of rules allows, syntactically, more possibilities than the XML, but requires only 2*N rules. Enforcement of the true XML rules (namely each attribute occuring only once) must be enforced programmatically.
<element name="XXX"> <attribute name="a1"/> <attribute name="a2"/> <attribute name="a3"/> </element>
xxx_attr_list: A1 A2 A3 | A1 A3 A2 | A2 A1 A3 | A2 A3 A1 | A3 A1 A2 | A3 A2 A1 ;
xxx_attr_list: /*empty*/ | xxx_attr_list A1 | xxx_attr_list A2 | xxx_attr_list A3 ;
Again, for N > 2, version 2 makes more sense.
<element name="XXX"> <optional> <attribute name="a1"/> </optional> <optional> <attribute name="a2"/> </optional> </element>
xxx_attr_list: /*empty*/ | A1 | A2 | A1 A2 | A2 A1 ;
xxx_attr_list: /*empty*/ | xxx_attr_list A1 | xxx_attr_list A2 ;
<element name="X1"> <element name="X2"/> </element>
x1: X1_ x2 _X1 ; x2: X2_ ... _X2 ;
<element name="X1"> <choice> <element name="X2"/> <element name="X3"/> </choice> </element>
x1: X1_ x2 _X1 | X1_ x3 _X1 ; x2: X2_ ... _X2 ; x3: X3_ ..._X3 ;
<element name="X1"> <zeroOrMore> <choice> <element name="X2"/> <element name="X3"/> </choice> </zeroOrMore> </element>
x1: X1_ x1_body _X1 ; x1_body: /*empty*/ | x1_body x2 | x1_body x3 ; x2: X2_ ... _X2 ; x3: X3_ ... _X3 ;
By combining the above heuristics it is usually possible to convert any reasonable RELAXNG grammar to a corresponding Bison grammar.
%tokenXXX_ /* the element XXX open token */ %token _XXX /* the element XXX close token */ %token YYY_ _YYY ... %token ATTR1 %token ATTR2 ...
In addition it is convenient to define several special Bison tokens.
------------------- | Main | ------------------- | Sax Parser | ------------------- | SaxEventHandler | ------------------- | SaxEventHandler | | subclass | | (user defined) | ------------------- | Bison push-parser | | (user defined) | -------------------The corresponding processing flow is as follows.
In practice the stack above is internalized into the user defined subclass of SaxEventHandler. The stack above is created by the event handler's parse()method.
The Lexeme class is designed to hold relevant information about either a legal XML element or a legal XML attribute. It is defined (in Java) as follows).
01 public class Lexeme 02 { 03 public String name; // element or attribute name 04 public int open; // Bison token for element open 05 public int close; // Bison token for element close 06 public int atoken; // Bison token if this is an attribute 07 public String[] legalAttributes; 08 public boolean textok; // if this element can allow text 09 }A Lexeme instance is created for each possible legal element name or attribute name. For elements, the corresponding Bison open token and close token are defined. For attributes, the single attribute atoken is defined.
Optionally, a list of legal attributes can be stored and the developers subclass of SaxEventHandler can reference it to quickly detect illegal/unknown attributes before they are passed to the parser. This is technically unnecessary as the parser, if properly constructed, will detect unexpected attributes anyway.
So the basic processing is this. When the user defined SAX handler procedure, yyevent, receives a SaxEvent such as STARTELEMENT or CLOSELEMENT event, it looks up the name of the element in the element hashtable. If it is not found, then this is an illegal element and the token to use is either UNKNOWN_ELEMENT_ or _UNKNOWN_ELEMENT. If it is found, then either the open token or the close token, as required, if taken from the lexeme for use as the token to pass to the push parser.
Similarly, when an attribute event is generated (see the section on attribute handling), the attribute hashtable is consulted to see if a corresponding lexeme is located. If not, then one can generate UNKNOWN_ATTR. Otherwise, the token field of the lexeme is used as the attribute token to send to the push parser.
In any case, the push parser is invoked in yyevent. The push parser is passed two arguments: (1) the token as determined from the Lexeme, and (2) the SaxEvent instance as the push parser's lvalue.
The above processing is pretty much the same across all supported languages. There are, of course, differences driven by differences in the languages.
For C support, and optionally, the hashtables can be constructed using the gperf perfect hashing program. This is discussed in an Appendix.
01 %token CALC_ _CALC 02 %tokenBecause this is Java-based parser, the types are Java classes: Integer and SaxEvent. The latter is because as noted, the lvalue associated with a token is the corresponding SaxEvent instance.EQ_ _EQ 03 %token ADD_ _ADD SUB_ _SUB MUL_ _MUL DIV_ _DIV EXP_ _EXP 04 %token NEG_ _NEG 05 %token INT_ _INT 06 %token ATTR_N 07 %token TEXT 08 %token UNKNOWN_ATTR UNKNOWN_ELEMENT_ _UNKNOWN_ELEMENT 09 10 %type calc expr integer exprlist 11 12 %start calc 13 %% 14 calc: CALC_ exprlist _CALC {$$=null;} ; 15 16 exprlist: 17 /*empty*/ {$$=null;} 18 | exprlist expr 19 {calc($2); $$=null;} 20 ; 21 22 expr: 23 EQ_ expr expr _EQ 24 {$$ = ($2 == $3 ? new Integer(1) : new Integer(0));} 25 | ADD_ expr expr _ADD {$$=bin_add($2,$3);} 26 | SUB_ expr expr _SUB {$$=bin_sub($2,$3);} 27 | MUL_ expr expr _MUL {$$=bin_mul($2,$3);} 28 | DIV_ expr expr _DIV {$$=bin_div($2,$3);} 29 | EXP_ expr expr _EXP {$$=bin_exp($2,$3);} 30 | NEG_ expr _NEG {$$=un_neg($2);} 31 | integer {$$=$1;} 32 | error _CALC 33 {$$=new Integer(0);} 34 ; 35 36 integer: 37 INT_ ATTR_N _INT {$$=integer($2);} 38 | INT_ TEXT _INT {$$=integer($2);} 39 ;
In order to make this parser be usable, the following Bison directives are added to the front.
01 %language "Java" 02 %define api.push-pull push 03 %define public 04 %define parser_class_name {CalcParser} 05 %define package {yax.test} 06 %define extends {CalcTest}Line 2 is the critical directive. It tells Bison to generate a push parser. Lines 5 and 6 are just to situate the parser in a test system. It is defined as a subclass of CalcTest, which will be discussed below.
In addition, some extra code chunks need to be included.
01 %code imports {import yax.*;} 02 03 %code lexer { 04 public Object getLVal() {return null;} 05 public int yylex() {return 0;} 06 public void yyerror(String s) {System.err.println(s);} 07 }Technically, the push parser does not need to know about a lexer, but it does need access to the `yyerror' method. In standard Bison for Java, the `yyerror' method is defined in the `YYParser.Lexer' interface. Hence, an implementation of that interface is still required in order to provide an implementation of `yyerror'. Lines 3-7 implement a trivial lexer, where only the yyerror method is invoked.
01 package yax.test; 02 import yax.*; 03 import org.xml.sax.*; 04 import java.util.*; 05 import static yax.test.CalcParser.*; 06 import static yax.test.CalcParser.Lexer.*; 07 08 public class CalcEventHandler extends SaxEventHandler 09 { 10 static MapLines 1-6 import the relevant other packages. Note that lines 5,6 import static values so that, for example, token constants can be referenced un-prefixed in the body of the event handler.elementmap; 11 static Map attributemap; 12 13 static { 14 elementmap = new HashMap (); 15 attributemap = new HashMap (); 16 elementmap.put("calc",new Lexeme("calc", CALC_, _CALC, null)); 17 elementmap.put("eq", new Lexeme("eq", EQ_, _EQ, null)); 18 elementmap.put("add", new Lexeme("add", ADD_, _ADD, null)); 19 elementmap.put("sub", new Lexeme("sub", SUB_, _SUB, null)); 20 elementmap.put("mul", new Lexeme("mul", MUL_, _MUL, null)); 21 elementmap.put("div", new Lexeme("div", DIV_, _DIV, null)); 22 elementmap.put("neg", new Lexeme("neg", NEG_, _NEG, null)); 23 elementmap.put("exp", new Lexeme("exp", EXP_, _EXP, null)); 24 elementmap.put("int", new Lexeme("int", INT_, _INT, new String[]{"n"})); 25 attributemap.put("n", new Lexeme("n", ATTR_N)); 26 };
As discussed above, an element hashtable (lines 10 and 14) and an attribute hashtable (lines 11 and 15) are constructed and filled with instances of Lexeme for each legal element (lines 16-24) and attributes (line 25) as defined in the original RELAX-NG grammar.
01 CalcParser pushparser = null; 02 boolean textok = false; 03 boolean accepted = false; 04 05 public CalcEventHandler(String document, CalcParser pushparser) 06 throws SAXException 07 { 08 super(document); 09 this.pushparser = pushparser; 10 }The CalcEvent handler will store the push parser and two flags: textok and accepted. The xml document text is passed to the super class (SaxEventHandler) for processing.
01 public void yyevent(SaxEvent saxevent) throws SAXException 02 { 03 if(accepted) 04 throw new SAXException("yyevent called after parser has accepted"); 05 06 SaxEventType event = saxevent.event; 07 String name = saxevent.name; 08 int yytoken = 0; 09 Lexeme element = null; 10 Lexeme attr = null; 11 12 element = elementmap.get(name); 13 14 switch (event) { 15 case STARTELEMENT: 16 if(element == null) {// undefined 17 yytoken = UNKNOWN_ELEMENT_; 18 } else { 19 yytoken = element.open; 20 // Check for the special cases 21 if(element.textok) 22 textok = true; 23 } 24 break; 25 case ATTRIBUTE: 26 attr = attributemap.get(name.toLowerCase()); 27 yytoken = (attr == null ? UNKNOWN_ATTR : attr.atoken); 28 break; 29 case ENDELEMENT: 30 if(element == null) {// undefined 31 yytoken = _UNKNOWN_ELEMENT; 32 } else { 33 yytoken = element.close; 34 textok = false; 35 } 36 break; 37 case CHARACTERS: 38 if(!textok) return; // ignore 39 yytoken = TEXT; 40 break; 41 case STARTDOCUMENT: 42 return; // ignore 43 case ENDDOCUMENT: 44 yytoken = EOF; 45 break; 46 default: 47 throw new IllegalStateException(String.format("unknown token type: %s\n", 48 event.name())); 49 } // switch 50 51 int status = 0; 52 try { 53 status = pushparser.push_parse(yytoken, saxevent); 54 } catch (Exception e) { 55 e.printStackTrace(); 56 throw new SAXException(e); 57 } 58 if(status == YYABORT) 59 throw new SAXException("YYABORT"); 60 else if(status == YYACCEPT) 61 accepted = true; 62 else if(status == YYPUSH_MORE) 63 /* return */ 64 }The yyevent method is the heart of the user-defined handler. The parent class funnels all of the callbacks into this method by storing all of the callback argument info into an instance of SaxEvent and passing it to the yyevent subclass defined method.
The accepted flag test (line 3) is to ensure that no more events occur after the parser signals that the parse return YYACCEPT.
Next, a switch is made on the event type, with the following processing.
Lines 21-22 are a special situation. Currently, yax does not allow mixed content for elements. However, for certain elements it allows text content, <int>, for example. This is determined by a flag in the Lexeme. If we enter such an element, the textok flag is set to note that text is ok.
Once the appropriate Bison token is determined, it is time to invoke the push parser (line 53). The token and the incoming SaxEvent instance are passed to the push parser. The parser will generally return one of the following values:
01 public abstract class CalcTest 02 { 03 static public void main(String[] argv) 04 throws Exception 05 { 06 CalcParser calcpushparser = new CalcParser(); 07 String document = readfile(argv[0]); 08 CalcEventHandler calceventhandler 09 = new CalcEventHandler(document, calcpushparser); 10 if(calceventhandler.parse()) { 11 System.err.println("No error"); 12 else 13 System.err.println("Parse failed"); 14 } 15 }Assume that CalcTest is invoked something like this
java -cp ".:yax.jar" sax.text.CalcTest input.xmlwhere "input.xml" is some xml test file conforming to the RELAX-NG grammar in the Appendix. This file might contain, for example, the following XML.
01 <calc> 02 <add> 03 <int n="5"/> 04 <int>6</int> 05 </add> 06 </calc>
The operation of CalcTest is as follows.
01 Integer integer(SaxEvent event) 02 { 03 int n = 0; 04 try { 05 if(event.event == SaxEventType.CHARACTERS) 06 n = Integer.parseInt(event.text); 07 else if(event.event == SaxEventType.ATTRIBUTE) 08 n = Integer.parseInt(event.value); 09 else 10 yyerror("Unexpected event: "+ event.toString()); 11 } catch (NumberFormatException nfe) { 12 yyerror("Illegal number: "+ event.toString()); 13 } 14 return n; 15 }Note that in the grammar it is being invoked with a token as its argument. This means that the value it receives is an instance of SaxEvent. As it is set up, it will either receive a SaxEvent representing an attribute (lines 7-8) or a SaxEvent representing text (i.e. CHARACTERS) (lines 5-6). In either case, it has text that must be converted to an integer using Integer.parseInt(). If the text if malformed, then an exception is thrown. Otherwise the computed integer is returned.
As an example of a operator, consider the bin_add function.
Integer bin_add(Integer n1, Integer n2) {return n1 + n2;}Its result and its input arguments (of class "expr") are defined in the grammar as being of type java.lang.Integer. Hence all it has to do is add its input arguments and return the sum as its result.
The other operator functions are similar in structure.
<?xml version="1.0" encoding="UTF-8"?> <grammar xmlns="http://relaxng.org/ns/structure/1.0" xmlns:a="http://relaxng.org/ns/compatibility/annotations/1.0" > <start><ref name="calc"/></start> <define name="calc"> <element name="calc"> <zeroOrMore> <ref name="expr"/> </zeroOrMore> </element> </define> <define name="expr"> <choice> <ref name="eq"/> <ref name="add"/> <ref name="sub"/> <ref name="mul"/> <ref name="div"/> <ref name="exp"/> <ref name="neg"/> <ref name="int"/> </choice> </define> <define name="eq"> <element name="eq"> <ref name="expr"/> <ref name="expr"/> </element> </define> <define name="add"> <element name="add"> <ref name="expr"/> <ref name="expr"/> </element> </define> <define name="sub"> <element name="sub"> <ref name="expr"/> <ref name="expr"/> </element> </define> <define name="mul"> <element name="mul"> <ref name="expr"/> <ref name="expr"/> </element> </define> <define name="div"> <element name="div"> <ref name="expr"/> <ref name="expr"/> </element> </define> <define name="exp"> <element name="exp"> <ref name="expr"/> <ref name="expr"/> </element> </define> <define name="neg"> <element name="neg"> <ref name="expr"/> </element> </define> <define name="int"> <element name="int"> <choice> <attribute name="n"/> <text/> </choice> </element> </define> </grammar>
The example provided in the yax source tree, dap4.gperf, uses the GNU gperf program to produce the perfect hash procedures. The skeleton of the .gperf file is something like this. The first three lines are directives to gperf.
01 %define lookup-function-name XXX_keyword_lookup 02 %readonly-tables 03 %global-table 04 05 %{ 06 /*insert any necessary #include directives here*/ 07 #include <string.h> 08 #include "yxlist.h" 09 #include "yax.h" 10 ... 11 %} 12 13 %struct-type 14 00 struct dap4_keyword { 15 char *name; int opentag ; int closetag; int attributetag; 16 } keyword; 17 %% 18 /* Define the element names */ 19 Element1, ELEMENT1_, _ELEMENT1, 0 20 Element2, ELEMENT2_, _ELEMENT2, 0 21 ... 22 /* Define the attribute names */ 23 attr1, 0, 0, ATTR1 24 attr2, 0, 0, ATTR2 25 ... 26 %%
The command to produce the perfect hash code is as follows.
gperf xxx.gperf > xxx.cwhere xxx is whatever name you choose.
Within the user defined event handler, typical code might be as follows.
01 const struct dap4_keyword* keyword; 02 if(yaxtoken->name != NULL) 03 keyword = dap4_keyword_lookup(yaxtoken->name, strlen(tokenstate->name));The perfect hash function will return a pointer to an instance of this struct as determined by the name field. If the struct is NULL then it means it is an unknown name. Otherwise, it gives, for elements, the Bison open and close tokens. For attributes, it gives the specific Bison attribute token.


|
National Advertising Initiative
Privacy Policy GDPR Update 5/18 Pursuant to GDPR regulations, please see these Adsense terms explaining how Google manages data in its ads products: https://www.google.com/policies/technologies/partner-sites/ Disclaimers for AmericanRhetoric.com All the information on this website is published in good faith and for general information purpose only. AmericanRhetoric.com does not make any warranties about the completeness, reliability and accuracy of this information. Any action you take upon the information you find on this website (AmericanRhetoric.com), is strictly at your own risk. AmericanRhetoric.com will not be liable for any losses and/or damages in connection with the use of our website. From our website, you can visit other websites by following hyperlinks to such external sites. While we strive to provide only quality links to useful and ethical websites, we have no control over the content and nature of these sites. These links to other websites do not imply a recommendation for all the content found on these sites. Site owners and content may change without notice and may occur before we have the opportunity to remove a link which may have gone ‘bad’. Please be also aware that when you leave our website, other sites may have different privacy policies and terms which are beyond our control. Please be sure to check the Privacy Policies of these sites as well as their “Terms of Service” before engaging in any business or uploading any information. Consent By using our website, you hereby consent to our disclaimer and agree to its terms. Updates Should we
update, amend or make any changes to this document, those changes will be
prominently posted here. If you require any more information or have
any questions about our site’s disclaimer and/or privacy terms, please feel
free to contact American Rhetoric by email at<EMAIL_ADDRESS>This Disclaimer was created at World’s Free Disclaimer Generator. |
© Copyright 2001-2018.
American Rhetoric
by
Michael E. Eidenmuller
All rights reserved.


B.Tech. IV (CO) Semester –8 |
L |
T |
P |
C |
CO414 : SYSTEM ANALYSIS AND SIMULATION |
3 |
0 |
0 |
3 |
(06 Hours) |
||||
Systems, Models, and Simulation - Random Number Generators. |
||||
(10 Hours) |
||||
Simulation of Single-Server Queueing System and Simulation of Inventory System - Distributed Simulation - Combined Discrete |
||||
(10 Hours) |
||||
Complex Systems Modelling - Time shared Computer Model, Job-shop Model |
||||
(08 Hours) |
||||
General Purpose and Specially Designed Software/Language |
||||
(08 Hours) |
||||
Standards and Applications |
||||
(Total Contact Time: 42 Hours) |
||||
BOOKS RECOMMENDED |
||||
1). Law A., Kelton W., “Simulation Modelling & Analysis”, 3/E,McGraw - Hill Gordon G., System Simulation, PHI, 2000 |


Account Settings
Profile
Your email address is your identity on Footbagent and is used to log in.
{{updateProfileFormError}}
{{updateProfileFormMessage}}
Email format is not correct
Name is required
Password
You can change your Footbagent account password from here.
{{updatePasswordFormError}}
{{updatePasswordFormMessage}}
Current password is required
Enter a password with minimum 8 characters, at least 1 letter and 1 number
Confirm password does not match with new password
Close Account
Warning: Closing your account is irreversible.


Binds relevant functions. Sets transformProduct property if a product transformer function is passed.
Holds reference to the plugin registry that is received in registration.
Name of the events plugin.
The product transformer that will transform a [[Record]] to the desired form.
Extracts search terms from the given response.
An array of search term strings.
An array of search term strings.
Formats a given list of search terms.
An array of search terms.
An array of search terms that have been formatted.
Dispatches a [[BEACON_SEARCH]] event to inform any listeners of a successful search.
The search results.
The value representing the action's origin.
Sends a request to the Sayt API for autocomplete terms and dispatches events on success and failure. If the fetch is successful and a cache is present, the payload dispatched is also cached.
Event that contains the Sayt API request payload.
Sends a request to the Search API for product data and emits the result through an event. A successful result is emitted in a [[SAYT_PRODUCTS_RESPONSE]] event. If the search fails for any reason, a [[SAYT_PRODUCTS_ERROR]] is dispatched with the error. Emits a beacon event if search is successful.
Event that contains the Search API request payload.
Lifecycle event where the plugin can first safely interact with the registry. The method will register an event listener for Sayt and product data requests.
Sets the plugin registry to the plugin's internal 'core' property. Callback method for when the plugin is registered in Core.
The plugin registry object from Core.
Extracts query and products from the given response. It calls transformProduct on each product found in the response and filters out any that map to a falsy value.
An object containing an array of valid simplified products and the original response.
Sends a request to the SAYT API with the given query and config object.
The search term to send.
Extra query-time configuration to customize the SAYT request.
A promise from the Sayt API that has been reformatted with the passed callback.
Sends a request to the Search API with the given query and config object.
The search term to send.
Extra query-time configuration to customize the Search request.
A promise from the Search API that has been reformatted with the passed callback.
Lifecycle event where the plugin will unregister all event listeners.
Provide default configuration for SAYT product searches.
Generated using TypeDoc
Driver plugin that serves as the link between the Sayt data source and the View layer. This plugin is responsible for listening to events, sending search requests to internal data source APIs, and then emitting the API response back in an event.


What is a Container?
Virtual machines and containers attempt to solve similar problems, isolating services and their dependencies, however containers do it with much less overhead and are exceedingly flexible. Without getting into too much detail, Docker under the hood shares some of the host system resources in a read only fashion while emulating others. This allows the containers to be virtualized, thinking they are their own system, without the overhead of an entire guest os. Being so light weight, we can segregate services and tiers at a granular level without wasting resources. Then at this level we can add, update and remove containers in a fraction of the time and without interruption as appose to entire VMs.
Conceptually how Docker operates compared to traditional virtualization.


{% extends "themes/default/templates/partials/base.html" %} {% block content %}
{{ entry.features_description|raw }}
{{ entry.features_simple_p|raw }}
{{ entry.features_fast_p|raw }}
{{ entry.features_flexible_p|raw }}
{{ entry.features_easy_editing_p|raw }}
{{ entry.features_dynamic_content_types_p|raw }}
{{ entry.features_open_source_p|raw }}
{{ entry.features_technologies_p|raw }}
{{ entry.features_install_anywhere_p|raw }}
{{ entry.features_responsive_framework_p|raw }}
{{ entry.features_css_with_superpowers_p|raw }}
{{ entry.features_slimphp_p|raw }}
{{ entry.features_the_php_league_p|raw }}
{{ entry.features_doctrine_p|raw }}
{{ entry.features_no_limits_p|raw }}
{{ entry.project_business_site|raw }}
{{ entry.project_landing_page|raw }}
{{ entry.project_personal_site|raw }}
{{ entry.project_portfolio|raw }}
{{ entry.project_product_site|raw }}
{{ entry.project_e_commerce|raw }}
{{ entry.project_documentation|raw }}
{{ entry.project_documentation|raw }}
{{ entry.project_blog|raw }}
{{ entry.community_p|raw }}
{{ entry.contribution_p|raw }}


{% extends "layout.html" %} {% block title %}Add Hydrogens and Water{% endblock %} {% block body %}
Add hydrogens
Add water box
Add membrane and water
Ions will be added to neutralize the model. You can optionally add more ions based on a desired bulk ionic strength.


module Big_int: BatBig_int
type big_int
= Big_int.big_int
The type of big integers.
let zero : big_int
let zero_big_int : big_int
The big integer 0
.
let one : big_int
let unit_big_int : big_int
The big integer 1
.
Arithmetic operations
let neg : big_int => big_int
let succ : big_int => big_int
let pred : big_int => big_int
let abs : big_int => big_int
let add : big_int => big_int => big_int
let sub : big_int => big_int => big_int
let mul : big_int => big_int => big_int
let div : big_int => big_int => big_int
let modulo : big_int => big_int => big_int
let pow : big_int => big_int => big_int
type t
= big_int
let (+) : t => t => t
let (-) : t => t => t
let ( * ) : t => t => t
let (/) : t => t => t
let ( ** ) : t => t => t
let minus_big_int : big_int => big_int
Unary negation.
let abs_big_int : big_int => big_int
Absolute value.
let add_big_int : big_int => big_int => big_int
Addition.
let succ_big_int : big_int => big_int
Successor (add 1).
let add_int_big_int : int => big_int => big_int
Addition of a small integer to a big integer.
let sub_big_int : big_int => big_int => big_int
Subtraction.
let pred_big_int : big_int => big_int
Predecessor (subtract 1).
let mult_big_int : big_int => big_int => big_int
Multiplication of two big integers.
let mult_int_big_int : int => big_int => big_int
Multiplication of a big integer by a small integer
let square_big_int : big_int => big_int
Return the square of the given big integer
let sqrt_big_int : big_int => big_int
sqrt_big_int a
returns the integer square root of a
,
that is, the largest big integer r
such that r * r <= a
.
Raises Invalid_argument
if a
is negative.
let quomod_big_int : big_int =>
big_int => (big_int, big_int)
Euclidean division of two big integers.
The first part of the result is the quotient,
the second part is the remainder.
Writing (q,r) = quomod_big_int a b
, we have
a = q * b + r
and 0 <= r < |b|
.
Raises Division_by_zero
if the divisor is zero.
let div_big_int : big_int => big_int => big_int
Euclidean quotient of two big integers.
This is the first result q
of quomod_big_int
(see above).
let mod_big_int : big_int => big_int => big_int
Euclidean modulus of two big integers.
This is the second result r
of quomod_big_int
(see above).
let gcd_big_int : big_int => big_int => big_int
Greatest common divisor of two big integers.
let power_int_positive_int : int => int => big_int
let power_big_int_positive_int : big_int => int => big_int
let power_int_positive_big_int : int => big_int => big_int
let power_big_int_positive_big_int : big_int => big_int => big_int
Exponentiation functions. Return the big integer
representing the first argument a
raised to the power b
(the second argument). Depending
on the function, a
and b
can be either small integers
or big integers.
Raises Invalid_argument
if b
is negative.
let operations : BatNumber.numeric t
Generators
let (--) : big_int => big_int => BatEnum.t big_int
let (---) : big_int => big_int => BatEnum.t big_int
Comparisons and tests
let compare : big_int => big_int => int
let ord : big_int => big_int => BatOrd.order
let equal : big_int => big_int => bool
let sign_big_int : big_int => int
Return 0
if the given big integer is zero,
1
if it is positive, and -1
if it is negative.
let compare_big_int : big_int => big_int => int
compare_big_int a b
returns 0
if a
and b
are equal,
1
if a
is greater than b
, and -1
if a
is smaller
than b
.
let eq_big_int : big_int => big_int => bool
let le_big_int : big_int => big_int => bool
let ge_big_int : big_int => big_int => bool
let lt_big_int : big_int => big_int => bool
let gt_big_int : big_int => big_int => bool
Usual boolean comparisons between two big integers.
let max_big_int : big_int => big_int => big_int
Return the greater of its two arguments.
let min_big_int : big_int => big_int => big_int
Return the smaller of its two arguments.
let num_digits_big_int : big_int => int
Return the number of machine words used to store the
given big integer.
Conversions to and from strings
let to_string : big_int => string
let string_of_big_int : big_int => string
Return the string representation of the given big integer,
in decimal (base 10).
let of_string : string => big_int
let big_int_of_string : string => big_int
Convert a string to a big integer, in decimal.
The string consists of an optional -
or +
sign,
followed by one or several decimal digits.
let to_string_in_binary : big_int => string
as string_of_big_int
, but in base 2
let to_string_in_octal : big_int => string
as string_of_big_int
, but in base 8
let to_string_in_hexa : big_int => string
as string_of_big_int
, but in base 16
let to_string_in_base : int => big_int => string
to_string_in_base b n
returns the string representation in base b
of
the given big integer n
. Should you have advanced needs (arbitrarily large
bases, or custom digits instead of the usual 0,1,...9,a,b,...,z
), use
to_string_in_custom_base
instead.
Raises Invalid_argument
if b is not in
2 .. 36
.
let to_string_in_custom_base : string => int => big_int => string
First argument, called symbols
, is the vector of the symbols used to
represent the digits in base b
. to_string_in_base
is almost equivalent to
to_string_in_custom_base big_int_base_default_symbols
, the difference being
that to_string_in_custom_base
allows the base to be arbitrarily large,
provided that symbols
can accommodate it. Concretely, the base b
must be at
least 2
, and symbols
must be of size at least b
. The default value of
big_int_base_default_symbols
contains 62 symbols, as it uses lowercase and
uppercase letters both. See below for more information.
Raises Invalid_argument
if b
is incorrect.
let big_int_base_default_symbols : string
Default vector of symbols used by to_string_in_base
and its fixed-base
derivatives to_string_in_binary
, to_string_in_octal
and to_string_in_hexa
to represent digits. The symbol at position p
encodes the value p
. The
original value of this vector is, schematically, ['0'..'9' 'a' 'b'..'z' 'A'
'B'..'Z']
, which is sufficient for bases up to and including 62. The basic
to_string_in_base
function is capped to base 36 to avoid unexpected
behaviours do to the case-sensitivity of the output in bases 37 to 62. You
technically can mutate the vector, for instance if you prefer to exchange
lower- and upper-case symbols program-wide. As usual where mutability is
concerned, discretion is advised. Most of the time, it is better to build
custom functions using to_string_in_custom_base
.
Conversions to and from other numerical types
let of_int : int => big_int
let big_int_of_int : int => big_int
Convert a small integer to a big integer.
let is_int_big_int : big_int => bool
Test whether the given big integer is small enough to
be representable as a small integer (type int
)
without loss of precision. On a 32-bit platform,
is_int_big_int a
returns true
if and only if
a
is between -230 and 230-1. On a 64-bit platform,
is_int_big_int a
returns true
if and only if
a
is between -262 and 262-1.
let to_int : big_int => int
let int_of_big_int : big_int => int
Convert a big integer to a small integer (type int
).

Raises Failure
if the big integer is outside the
range [-2{^31}, 2{^31}-1]
.
let nativeint_of_big_int : big_int => nativeint
Convert a big integer to a native integer.
Raises Failure
if the big integer is outside the
range [Nativeint.min_int, Nativeint.max_int]
.
let int64_of_big_int : big_int => int64
Convert a big integer to a 64-bit integer.
Raises Failure
if the big integer is outside the
range [-2{^63}, 2{^63}-1]
.
let float_of_big_int : big_int => float
Returns a floating-point number approximating the
given big integer.
let of_float : float => big_int
rounds to the nearest integer
Raises Invalid_argument
when given NaN or +/-infinity
let to_float : big_int => float
Bit-oriented operations
let and_big_int : big_int => big_int => big_int
Bitwise logical ``and''.
The arguments must be positive or zero.
let or_big_int : big_int => big_int => big_int
Bitwise logical ``or''.
The arguments must be positive or zero.
let xor_big_int : big_int => big_int => big_int
Bitwise logical ``exclusive or''.
The arguments must be positive or zero.
let shift_left_big_int : big_int => int => big_int
shift_left_big_int b n
returns b
shifted left by n
bits.
Equivalent to multiplication by 2^n
.
let shift_right_big_int : big_int => int => big_int
shift_right_big_int b n
returns b
shifted right by n
bits.
Equivalent to division by 2^n
with the result being
rounded towards minus infinity.
let shift_right_towards_zero_big_int : big_int => int => big_int
shift_right_towards_zero_big_int b n
returns b
shifted
right by n
bits. The shift is performed on the absolute
value of b
, and the result has the same sign as b
.
Equivalent to division by 2^n
with the result being
rounded towards zero.
: big_int => int => int => big_int
extract_big_int bi ofs n
returns a nonnegative number
corresponding to bits ofs
to ofs + n - 1
of the
binary representation of bi
. If bi
is negative,
a two's complement representation is used.
Submodules grouping all infix operators
module Infix: BatNumber.Infix
with type bat__infix_t = t
module Compare: BatNumber.Compare
with type bat__compare_t = t
Boilerplate code
Printing
let print : BatIO.output 'a => t => unit


{% extends "base.html" %} {% block title %}Stanford Online | Available Courses {% endblock title %} {% block topnav %} {% endblock topnav %} {% block navbar %} {% endblock navbar %} {% load url from future %} {% block m_column_content %}
Taught by Nick McKeown and Philip Levis
This is an introductory course on computer networking, specifically the Internet. It focuses on explaining how the Internet works, ranging from how bits are modulated on wires and in wireless to application-level protocols like BitTorrent and HTTP. It also explains the principles of how to design networks and network protocols. Students gain experience reading and understanding RFCs (Internet protocol specifications) as statements of what a system should do. The course grounds many of the concepts in current practice and recent developments, such as net neutrality and DNS security.
Taught by Bruce Clemens
This course focuses on the operating principles and applications of emerging technological solutions to the energy demands of the world. We will begin with discussing the scale of global energy usage and requirements for possible solutions. Basic physics and chemistry of solar cells, fuel cells, and batteries will be discussed in quantitative detail. We will explore performance issues, including economics, from the ideal device to the installed system. Finally, we will end with the promise of materials research for providing next generation solutions.


Fueled by my passion for understanding the nuances of cross-cultural advertising, I consider myself a forever student, eager to both build on my academic foundations in psychology and sociology and stay in tune with the latest digital marketing strategies through continued coursework.
UI DesignerFueled by my passion for understanding the nuances of cross-cultural advertising, I consider myself a forever student, eager to both build on my academic foundations in psychology and sociology and stay in tune with the latest digital marketing strategies through continued coursework.
Web DeveloperFueled by my passion for understanding the nuances of cross-cultural advertising, I consider myself a forever student, eager to both build on my academic foundations in psychology and sociology and stay in tune with the latest digital marketing strategies through continued coursework.
iOS DeveloperFueled by my passion for understanding the nuances of cross-cultural advertising, I consider myself a forever student, eager to both build on my academic foundations in psychology and sociology and stay in tune with the latest digital marketing strategies through continued coursework.
UX DesignerFueled by my passion for understanding the nuances of cross-cultural advertising, I consider myself a forever student, eager to both build on my academic foundations in psychology and sociology and stay in tune with the latest digital marketing strategies through continued coursework.
EntrepreneurFueled by my passion for understanding the nuances of cross-cultural advertising, I consider myself a forever student, eager to both build on my academic foundations in psychology and sociology and stay in tune with the latest digital marketing strategies through continued coursework.
Android Developer


By {{quote.author}}
This quote was read in {{quote.readDate|dateCount}} days back
{{upvote}}
{{downvote}}


To Kill a Mockingbird is a novel by the American author Harper Lee. It was published in 1960 and was instantly successful. In the United States, it is widely read in high schools and middle schools. To Kill a Mockingbird has become a classic of modern American literature, winning the Pulitzer Prize. The plot and characters are loosely based on Lee's observations of her family, her neighbors and an event that occurred near her hometown of Monroeville, Alabama, in 1936, when she was ten. Despite dealing with the serious issues of rape and racial inequality, the novel is renowned for its warmth and humor. Atticus Finch, the narrator's father, has served as a moral hero for many readers and as a model of integrity for lawyers. The historian Joseph Crespino explains, "In the twentieth century, To Kill a Mockingbird is probably the most widely read book dealing with race in America, and its main character, Atticus Finch, the most enduring fictional image of racial heroism."[1] As a Southern Gothic and Bildungsroman novel, the primary themes of To Kill a Mockingbird involve racial injustice and the destruction of innocence. Scholars have noted that Lee also addresses issues of class, courage, compassion, and gender roles in the Deep South. The book is widely taught in schools in the United States with lessons that emphasize tolerance and decry prejudice.[2] Despite its themes, To Kill a Mockingbird has been subject to campaigns for removal from public classrooms, often challenged for its use of racial epithets. In 2006, British librarians ranked the book ahead of the Bible as one "every adult should read before they die".[3] Reaction to the novel varied widely upon publication. Despite the number of copies sold and its widespread use in education, literary analysis of it is sparse. Author Mary McDonough Murphy, who collected individual impressions of To Kill a Mockingbird by several authors and public figures, calls the book "an astonishing phenomenon".[4] It was adapted into an Academy Award-winning film in 1962 by director Robert Mulligan, with a screenplay by Horton Foote. Since 1990, a play based on the novel has been performed annually in Harper Lee's hometown. To Kill a Mockingbird was Lee's only published book until Go Set a Watchman, an earlier draft of To Kill a Mockingbird, was published on July 14, 2015. Lee continued to respond to her work's impact until her death in February 2016, although she had refused any personal publicity for herself or the novel since 1964.
Ulysses is a modernist novel by Irish writer James Joyce. It was first serialized in parts in the American journal The Little Review from March 1918 to December 1920 and then published in its entirety in Paris by Sylvia Beach on 2 February 1922, Joyce's 40th birthday. It is considered one of the most important works of modernist literature[1] and has been called "a demonstration and summation of the entire movement."[2] According to Declan Kiberd, "Before Joyce, no writer of fiction had so foregrounded the process of thinking".[3] Ulysses chronicles the appointments and encounters of the itinerant Leopold Bloom in Dublin in the course of an ordinary day, 16 June 1904.[4][5] Ulysses is the Latinised name of Odysseus, the hero of Homer's epic poem the Odyssey, and the novel establishes a series of parallels between the poem and the novel, with structural correspondences between the characters and experiences of Bloom and Odysseus, Molly Bloom and Penelope, and Stephen Dedalus and Telemachus, in addition to events and themes of the early 20th-century context of modernism, Dublin, and Ireland's relationship to Britain. The novel is highly allusive and also imitates the styles of different periods of English literature. Since its publication, the book has attracted controversy and scrutiny, ranging from an obscenity trial in the United States in 1921 to protracted textual "Joyce Wars". The novel's stream of consciousness technique, careful structuring, and experimental prose—replete with puns, parodies, and allusions—as well as its rich characterisation and broad humour have led it to be regarded as one of the greatest literary works in history; Joyce fans worldwide now celebrate 16 June as Bloomsday.