Section 2. Congress shall have power to enforce this article by appropriate legislation.
Law Journals and Reviews
Ke Kanawai Mamalahoe: Equality in Our Splintered Profession. 33 UH L. Rev. 249 (2010).
Case Notes
Students' cafeteria duty is not involuntary servitude. 403 F. Supp. 1095.


Branches are not disabled or deleted automatically.
Inactive branches are disabled after {{property.value.disablingDuration}} day(s).
Inactive branches are deleted after {{property.value.disablingDuration + property.value.deletingDuration}} day(s).
Keeping branches matching:
{{ property.value.includes }}
but excluding branches matching:
{{ property.value.excludes }}
Keeping branches promoted to: {{promotion}}


Absolutely nothing is dead. How disappointing.
0'> {{totalExperience}} / = {{totalExperience / partySize}}


While we don’t know all of the details that led up to that faithful night, we do know that after a night of partying, a man’s jaded lover wanted revenge!
Instead of a lecture the next morning, the man awoke to the sizzlin’ smell of fried chicken. The scorned woman created the perfect recipe in an effort to get her revenge.
With the trap set, the man’s jilted lover served up a plate of homemade fried chicken. Without noticing the devilish amount of peppers and spices she had sprinkled on the chicken, he dug in.
Much to her dismay, the man didn’t fall over weeping in pain. Nope, he asked for seconds, and, at that moment, the legend was born.


{% extends "base.html" %} {% block content %}
Upload ECG recording as '.csv' file in the following format:


Doge Social Network
Home
Profile
Friends
Profile of Dog
Name:
Doge
Birthday:
Top secret
Occupation:
Selebrity
Area of occupation:
Web


performance of hashing in javascript crypto libraries.
Dominic Tarr (Stackvm Mad Science University) 2014-01-26
Abstract
The performance of a cryptography library is not it's most important consideration, but performance is still highly important. If performance is too low, it affects the usability, and so less cryptography will be used. In this article, I've compared the performance of the sha hashing functions in several javascript crypto libraries. These have wildly varying performance, and some have non-linear performance characteristics.
Method
So far, I have benchmarks for measuring hashing performance against input size, and key derivation performance (pbkdf2) as the number of iterations are increased. hashing a "large" file measures throughput, while key derivation depends on creating many hashes repeatedly - whether many hashes can be created in succession is quite a different measurement.
Since javascript timers are not very precise, if the time taking to hash is under 100 ms,
the hash is repeated until the elapsed time is > 100ms, and the the time taken is adjusted
to time_taken/repeated_runs
.
All benchmarks where run on a macbook air 11 running archlinux and<EMAIL_ADDRESS>crypto implementations
- Stanford javascript crypto library (sjcl)
- crypto-js
- forge
- crypto-browserify (I am the author of this module)
Hashing a 0-10MB file
Since each library provides a different API, each api has been wrapped to a function that takes a buffer, and then converts to a format that the algorithm can process, and calls the hash function with one buffer.
This is not necessarily fair on some libraries, but it would be surprising if encoding had more than a small effect on hashing performance.
sha1, time taken against input size.
(y-axis shows total time taken, higher is better)
Every implementation behaves basically linearly with input size, except that crypto-browserify becomes more efficient once input size becomes about 2MB. Below 2MB, forge is slightly ahead of crypto-browserify, and sjcl and crypto-js are significantly slower as file size increases.
sha1, bytes hashed per millisecond
(y-axis shows time/input size, lower is better)
When comparing the rate of hashing against input size, the improvement in crypto-browserify's performance becomes readily apparent. My suspicion is that the over head of allocating TypedArrays is what slows down crypto-browserify at low input size. A future experiment will be to manage TypedArrays with pooling or some such, to make repeated hashes faster.
It is temping to think of the change in performance as an good thing, but I think it's better to interpret any departure from linear as signs of trouble - or at least room for improvement. Although I am very happy to see that my library is significantly faster than the others at one thing. Hashing small inputs is very important, since most inputs are probably small.
sha256, time taken against input size.
(y-axis shows total time taken, higher is better)
sjcl and crypto-js performance at sha256 seems much the same as for sha1, but forge is faster than crypto-browserify, which doesn't show any improvement with input size.
Sha256, time taken against input size.
(y-axis shows time/input size, lower is better)
forge is clearly faster, and crypto-browserify does not show any improvement. also note that the performance of both forge and crypto-browserify is over 20k bytes per ms, about the performance of crypto-browserify's sha1.
An interesting thing here is that crypto-browserify and forge both use very different binary representations. crypto-browserify uses node.js buffers (or feross/native-buffer-browserify, a polyfill on top of TypedArrays in the browser) where as uses binary strings. Binary Strings is not expected to be faster than TypedArrays, but may have some benefits in copying from one string to another, since strings are immutable, and there is the possibility that v8 is doing something clever here.
key derivation (pbkdf2)
pbkdf2(sha1), time taken against iterations.
(y-axis shows total time taken, higher is better)
This graph shows that crypto-js's pbkdf2 has non-linear performance. something is clearly wrong, as there is no reason this should not be linear. compared to crypto-js, the other libraries are not even on this scale.
sha1 pbkdf, iterations per millisecond.
(y-axis shows time/input size, lower is better)
looking at the iterations per ms, we see that sjcl, which was the slowest on large files, is the fastest with rapid iterations. This suggests that there is something about the crypto-browserify and forge implementations which make the hash objects heavy to create, but efficient once created. If this is correct, they could possibly be improved with pooling, or some other thing to lighten iterations.
pbkdf2(sha256), time taken against iterations.
(y-axis shows total time taken, higher is better)
Again, crypto-js has non-linear scaling.
sha256 pbkdf, iterations per millisecond.
(y-axis shows time/input size, lower is better)
Interestingly, the relative performance of sjcl is even more impressive, about 4 times greater than sha1 (it's not surprising that sha256 is the default hash algorithm for sjcl)
hashing small files (zoomed into bottom left of hashing bytes/ms graphs)
Is sjcl's superior pbkdf2 performance due to better performance at small values? If so, we would expect to see the lines cross if we zoomed in on the bottom left corner of the hash-ops-sha1 and hash-ops-sha256 graphs.
sha1 on small inputs
(y-axis shows time/input size, lower is better)
sha256 on small inputs
(y-axis shows time/input size, lower is better)
sjcl is not faster at pure hashes in small values, therefore, the key to it's performance must be in another aspect of the implementation.
Future Work
By optimizing for the specifics of a key derivation algorithm (i.e. writing a fixed size input, instead of a variable one) it may be possible to improve iterated hash performance significantly.
It will also be worthwhile running the benchmarks under different javascript engines.
Conclusion
the hash algorithms in sjcl, crypto-browserify, and forge, have been optimized for different purposes. It appears that crypto-js hasn't been optimized, after the correctness of the implementation has been verified.
Resources
All resources required to repeat these experiments are available at https://github.com/dominictarr/crypto-bench


WITNESS LIST Financial Institutions Committee February 5, 2001-3:00P Agency Matters On: Buie, Jim (Texas Bond Review Board) De Marines, John T. (Texas Savings and Loan Dept.) Edwards, Kimberly K. (Texas Public Finance Authority) Feeney, Harold E. (Credit Union Department) James, Randall S. (Texas Dept. of Banking & Finance Commission) Pettijohn, Leslie (Office of Consumer Credit Commissioner)


Register
First Name:
Last Name:
Male
Female
Other
Email
Password:
Birthday:
Month
Feburary
March
April
Date
2
3
4
5
Year
2002
2003
Do you agre


Please review your bill and pay
Crickets Café
Feb 10, 2016 9:36 PM
QTY
ITEM
PRICE
2
Large Mocha Latte
$4.25
1
Banana Nut Muffin
$2.00
Tax
$0.50
Total
$6.75
Payment Information
Card Number
CVV
Card Holder
Jan
Feb
Mar
Apr
May
Jun
Jul
Aug
Sep
Oct
Nov
Dec
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
Expires
Checkout


Controls:
use wsad & rf to move camera
use mouse to rotate camera
use space to select image
use Refresh images button to load new images
use left joystick & up/down buttons to move camera
use right joystick to rotate camera
use download button to select image
use Refresh images button to load new images


Hi there! I'm Jaime Martínez Ballesteros and this is my personal website.
You'll find here my resume and other stuff like my portfolio, where I show my different projects I've taken part into.
I studied a Software Engineering degree in Universidad Politécnica de Madrid and Computer Graphics, Games and Virtual Reality master's degree in Universidad Rey Juan Carlos.
I love software development and, specially, game and VR/AR programming.
I also like modelling and texturing, as you'll see in some of my projects.
Development and optimization of a WebGL app using Unity and C#.
Developing a mobile videogame for a Spanish well-known youtuber. - Cannot say who by contract-
Development of Immunity Pass, an application that controls the access of immune people to any event or place based on vaccinations or tests.
Development and optimization of a WebGL app using Unity and C#.
Development and optimization of several VR/AR projects for one of the most important technology company in Spain, using Unity3D and C#, and devices such as Oculus Rift, Oculus Go, HTC Vive.
Development and integration of a trading software.
Development and optimization of several VR/AR projects for the second most important Spanish communication company, using Unreal Engine 4, Unity, C++, C# and devices such as Oculus Rift, HTC Vive and Leap Motion.
Development of new games for iOS and Android platforms, such as dodge, runners, match3 and clicker games, using Unity5 and C#. Set up and use of advertising thirdparties such as AdColony, AppLovin, Chartboost, Vungle, UnityAds and Heyzap.
Development of a 3D data visualizer using Unity5, Oculus DK2 and Leap Motion. Use of CUDA for data post-processing.
Backend development of iSendyou project with Django framework (python).
Studies based on the 3D graphics development, graphic flow, GPU and Virtual Reality devices functioning and performance, mathematical, geometrical and physical basis applied to 3D, and game development.
If you have any doubdt, do not hesitate to contact me by the form below or by my email jaime.martinez.ballesteros@gmail.com


A brief description of the Duke Angel Network could go here. Essentially a “get started” text that hooks users’ interested explains where users can go from here depending on who they are. Then the buttons below offer them access to the primary pages for them to get involved.
Brief description about what this page will be about and what type of users should navigate here.
Brief description about what this page will be about and what type of users should navigate here.
Brief description about what this page will be about and what type of users should navigate here.


WITNESS LIST Natural Resources Committee April 30, 1997-3:00P HB 328 For: Kamel, Ted (Representative) Niemann, Larry (himself and clients) HB 2614 For: Bailey, Ken (TX Assoc Firefighters) Bosse, Fred (Representative) HB 3387 For: Gallego, Pete (Representative) Halbert, Wayne (Texas Irrigation Coun) HB 3564 For: Jackson, Mike (Representative) Lowe, Janis (Clear Creek RFCD) HB 3567 For: Cardenas, Alfredo (City of San Diego) Raymond, Richard (Representative) Against: Barrera, Homero (himself) Barrera, Rebeca (herself and siblings) Bazan, Rodolfo H. (Duval Co CRD) Martinez, Jose Noe (himself & farmers/ranch) Vera, Victor Jr. (himself & petitioners) HB 3571 For: Dyer, Charles D. (himself) Dyer, Mary Beth (herself) Lee, Bob (City of Mont Belvieu) Leonard, Dennis (himself) Nelson, Albert Jr. (himself) Snow, David T. (City of Mont Belvieu) Zbranek, Zeb (Representative) Against: Randolph, Robert (Mt.Belv.Ind.Ass & TMOGA) On: Johnson, Doug (RRC) Seni, Steven (RRC) HB 3579 For: Hritz, J.A. (Bayer Corporation) Johnson, J.W. (Don) (Bayer Corporation) Zbranek, Zeb (Representative) HB 3586 For: Eiland, Craig (Representative) HB 3590 For: Hawley, Judy (Representative) SB 26 For: Williams, Tommy (Representative) SB 718 For: Hernandez, Victor (City of Lubbock) Hertel, Larry (City of Lubbock) Hindman, John (City of Lubbock) Jones, Delwin (Representative) Vandiver, Don (City of Lubbock) SB 1175 For: Bosse, Fred (Representative) SB 1656 For: Rangel, Irma (Representative) SB 1888 For: Jackson, Mike (Representative) Richie, Carl S. (City of Pasadena) Schweinle, Bill (Clear Creek City WA) SCR 35 For: Hunter, Bob (Representative)


Hate speech bill: Nigerians facing attack, victimization - Senator Abdullahi
- Senator Aliyu Sabi Abdullahi, sponsor of the anti-hate speech bill, explains its importance to the country
- Abdullahi insists that every Nigerian is prone to the effect of hate speech making the bill a necessity
- The senator laments that the purveyor of hate speech are the ones trying to frustrate the passage of the bill
Aliyu Sabi Abdullahi, the senator who sponsored the controversial anti-hate speech, has warned that if nothing was done to stop attacks on Nigerians through social media, the consequences could be unbearable.
Abdullahi, deputy chief whip, who spoke on Wednesday, November 20, warned that Nigeria may experience severe crisis except the hate speech bill is passed to end the challenge the citizens are facing.

“What Nigerians do not know at the moment is that we are confronted by a big threat to our unity and existence as a people.
“The issue of hate in our society is fast becoming a norm that has left a lot of people as victims," the senator said.
He said the purveyors of hate speech, knowing that the game is up for them with the introduction of the bill, have taken to blackmailing lawmakers.
He noted that currently, nothing makes any Nigerian immune to the consequences of the hate speech as he added that "even your belonging to any political party can insulate you and your family from hate speech, because in one way or the other, everyone falls into a category that is open to segregation at some point.
PAY ATTENTION: Install our latest app for Android, read best news on Nigeria’s #1 news app
"It could be on the basis of religion, ethnicity, profession or even class in society."
Legit.ng earlier reported that the social media bill, which seeks to regulate information carried by Nigerians through sources in the category, passed through the second reading at the Senate.
The senators passed the bill after taking it for a second time on Wednesday, November 20, before committing it to a committee.
NAIJ.com (naija.ng) - Legit.ng. We have upgraded to serve you better.
Kogi election: Alarm raised over cancellations of vote | Legit TV


Jobs at Xythos
Senior/Principal Product Manager
Description
Xythos is looking to hire a product manager to handle a mix of inbound and outbound tasks. The ideal candidate would have the skill and drive to ensure that our products are built to fit customer requirements. Equally important is support for sales, BD, marketing, customers, and partners, to ensure successful adoption of the technologies we develop.
This position reports directly to the Vice President of Product Management, and would be responsible for some of the products and services that Xythos provides. If you enjoy building products that bring immediate benefits to customers, this is the job for you. If you want to be focused on content management and collaboration, this is the company for you.
Essential Job Functions
-
Required
- 2-5 years experience in product management.
- Experience playing a leading role in the he complete product development process, from inception through production.
- Requirements gathering from customers and partners.
- Success drafting a product plan and ensuring the final product meets its objectives.
- Project management skills, including cross-group and cross-company initiatives.
- Familiarity with the following technology areas: WebDAV, Java, JSR-170, relational databases, application servers, storage, desktop integration (Windows and Macintosh), XML, LDAP, portals, and document capture.
- Familiarity with the following application areas: Content management, collaboration, file management, compliance.
- Experience applying horizontal technology to vertical solutions.
- Successful instances of support for strategic customer and partner projects.
- Examples of support materials and training developed for sales, business development, marketing, technical support, and other groups.
- A record of professional presentations.
- Excellent presentation and writing skills
-
Highly desirable
- Experience crafting the user experience for content contributors/consumers, content managers, application administrators, and/or system administrators.
- Familiarity delivering technology through software as a service (SaaS) vehicles.
- Hands-on experience with the technology areas listed above.
- Experience integrating collaboration and content management tools with ERP/CRM systems.
- Experience with solutions needed in higher education, research, biomedical, financial services, manufacturing, and e-government.
- A record of professional publication
Compensation
Competitive+, outstanding benefit package
Location
San Francisco, CA
Department
Product Management


New Collection
Aloha Apparel Co. sells only the finest ready-to-travel clothing. Browse our current selection of products or sign-up for updates below.
Dresses
$169.00
Shirts
$89.00
Dresses
$129.00
Bags
$69.00
Denim
$89.00
Dresses
$99.00
Dresses
$129.00
Shirts
$39.00
Stay updated on our latest product releases, be first to find out about upcoming sales, and get free style tips from our blog. Unsubscribe at any time.


WAR 3 Dams Run
The 3 Dams run is one of the local runs in Perth WA. As the name suggests, the route takes in 3 of the local Dams (Mundaring, Canning and Serpentine). Dams are located in mountains. Mountains mean twisty roads. Twisty roads mean lots of happy motorcyclists.
And so it came to be that, having just gotten my KR1S back on the road following the Wanneroo off, I needed something to test the bike out. I'd never done the run before so suggested to the WAR crowd that we needed to make such a run. The first section through Mundaring is one of the local pocket runs. About 40km end to end.
So on Sunday morning 24th Sept 2000, the mighty WAR crowd met at MacWar East (McDonalds Midlands). I was busy frantically trying to find the last sets of nuts and bolts to reassemble the KR while everyone else was meeting.As usual, I turned up late. Well at least I had an excuse this time! I'd been up till 2am and spent another 3 hours this morning hastily re-assembling my bike.
|
The mighty KR-1S! Freshly repainted with no decals |
About 18 bikes made it to there. The usual crowd and a few lurkers turned up. Should be fun as all the fast guys are here. GregR on his modified 'blade (seen below) and the 996 were leading the charge. Up the hill to Mundaring we go. I shoot off to fill up with fuel (The KR only has a range of 140km before dropping dead and wanted to make sure I had enough go juice for the next bit) only to find the servos closed! Head back to where the group is supposed to be only to find them not there (I'm sure they mis-interpreted what I'd said!).
Assuming the bastards have left without me, I tear off down Mundaring Weir Rd. Fun ride doing it by yourself. The KR was feeling good, but I wasn't pushing hard just in case I ran out of go-fast liquid.  After much cursing I look down to notice the fuel tap in the "on" position - which is really "off" on this bike. Switch to the prime position and 3 or 4 kicks later I roar off down the road all happy again.
|
Some of the group waiting to go |
The Gull servo at the end of the first run |
At the end of this run is the second meeting point. The Gull servo on Brookton Highway. Come screaming down the road, being a good GP Racer wannabe only to find the place devoid of bikes! Hmmmmm. Fill up with petrol and wait for everyone.
At some time later, the first lot come in. Seems like they'd been riding like the tealady. Every 5 km stopping to admire the view. This stop was no different.
Trying to herd them all into moving for the next stop we finally take off. Next stop is Canning Dam. Someone volunteers to lead this run. The roads are tight and twisty and very bumpy. Trees hang out into the road and there are a lot of blind corners so it makes for some interesting riding when you meet a 4WD coming the opposite direction in the middle of a corner. Halfway along this road I notice that the handlebars seem to be moving around an awful lot. I know this is a tight, crappy road, but they shouldn't be doing that! Upon stopping at our next meeting point I look down and notice the distinct sign of some very loose head bearings. Almost popping out of the bike! Looks like I didn't torque them down well enough. However, they're not going anywhere too fast so it should be fine, if not a little rougher than normal.
We meet up again and trundle along Albany highway until we hit the Jarrahdale turn. This section is fast, very fast. I spent most of the time in top gear with the wrist cocked as far back as it will go. The big bore bikes disappear into the distance at Warp 10. I spent most of the ride tucked in behind a M900 until he finally gives up after being almost torn from the handlebars due to the wind at that speed.
Lunch is had at Serpentine Dam. We come across a few other riders there out for the daily run. The group just about takes over the entire place. Chairs and tables are acquired from everywhere and we make our usual noisy cosuming of food presence felt.  The couple of local plods that are in our group spend quite a while discussing various law related things (one of our number had been arrested for Dangerous Driving earlier in the week).
|
WAR @ Serpentine |
After the usual rowdy lunch, we mount the cycles again and head home. Going back the same way we came, made the ride more fun. This time even more cages were on the road making for some interesting and hairy moments. One Guy missed a turn and overcooked the corner, resulting in a visit to the local shrubbery. Luckily he wasn't going very fast at the time and just ended up with a few scratches and a bruised ego. The ride ended with a few quite beers at the Mundaring Weir Hotel.
More Photos.
Kalamunda Refuel
Who, We're the good guys


Enter information provided to you by your ISP to configure the WAN IPv6 settings.
Notice:
If "Obtain an IPv6 address automatically" is chosen, DHCPv6 Client will be enabled on this WAN interface.
If "Use the following Static IPv6 address" is chosen, enter the static WAN IPv6 address. If the address prefix length is not specified, it will be default to /64.
Specify the Next-Hop IPv6 address for this WAN interface.
Notice: This address can be either a link local or a global unicast IPv6 address.


Starting with version 16.2.14, ngx-extended-pdf-viewer supports server-side rendering out-of-the-box.
There's no live demo yet because it's not that easy to make the showcase support SSR. However, the presentations on my blog employ ngx-extended-pdf-viewer with server-side rendering. For example, have a look at the slides of my JavaLand talk.
Before version 16.2, ngx-extended-pdf-viewer used a special module to support server-side rendering.
If you're still using it, update to ngx-extended-pdf-viewer 17+ and abandon
NgxExtededPdfViewerServerModule
in favor of the new, unified approach.


clip2frame.network_design
¶
fcn_gaussian_multiscale (input_var_list, ...) |
early_conv_dict_list: list |
fcn_fixedgaussian_multiscale (input_var_list, ...) |
early_conv_dict_list: list |
fcn_multiscale (input_var_list, ...[, ...]) |
early_conv_dict_list: list |
Details¶
-
clip2frame.network_design.
fcn_gaussian_multiscale
(input_var_list, early_conv_dict_list, late_conv_dict, dense_filter_size, scan_dict, final_pool_function=<function max>, input_size_list=[128], output_size=188, p_dropout=0.5)[source][source]¶ - early_conv_dict_list: list
- each element in the list is a dictionary containing the following keys: ‘conv_filter_list’, ‘pool_filter_list’, ‘pool_stride_list’
- late_conv_dict: dict
- it contains the following keys: ‘conv_filter_list’, ‘pool_filter_list’, ‘pool_stride_list’
- dense_filter_size: int
- the filter size of the final dense-like conv layer
- pool_filter_list: list
- each element is an integer
- pool_stride_list: list
- each element is int or None
-
clip2frame.network_design.
fcn_fixedgaussian_multiscale
(input_var_list, early_conv_dict_list, late_conv_dict, dense_filter_size, scan_dict, final_pool_function=<function max>, input_size_list=[128], output_size=188, p_dropout=0.5)[source][source]¶ - early_conv_dict_list: list
- each element in the list is a dictionary containing the following keys: ‘conv_filter_list’, ‘pool_filter_list’, ‘pool_stride_list’
- late_conv_dict: dict
- it contains the following keys: ‘conv_filter_list’, ‘pool_filter_list’, ‘pool_stride_list’
- dense_filter_size: int
- the filter size of the final dense-like conv layer
- pool_filter_list: list
- each element is an integer
- pool_stride_list: list
- each element is int or None
-
clip2frame.network_design.
fcn_multiscale
(input_var_list, early_conv_dict_list, late_conv_dict, dense_filter_size, final_pool_function=<function max>, input_size_list=[128], output_size=188, p_dropout=0.5)[source][source]¶ - early_conv_dict_list: list
- each element in the list is a dictionary containing the following keys: ‘conv_filter_list’, ‘pool_filter_list’, ‘pool_stride_list’
- late_conv_dict: dict
- it contains the following keys: ‘conv_filter_list’, ‘pool_filter_list’, ‘pool_stride_list’
- dense_filter_size: int
- the filter size of the final dense-like conv layer
- pool_filter_list: list
- each element is an integer
- pool_stride_list: list
- each element is int or None


DMEVENTD
Section: Maintenance Commands (8)Updated: DM TOOLS 2.02.95(2)-RHEL6 (2012-10-16)
Index Return to Main Contents
NAME
dmeventd - Device-mapper event daemonSYNOPSIS
dmeventd [-d [-d [-d]]] [-f] [-h] [-R] [-V] [-?]DESCRIPTION
dmeventd is the event monitoring daemon for device-mapper devices. Library plugins can register and carry out actions triggered when particular events occur.LVM PLUGINS
- Mirror
- Attempts to handle device failure automatically. See lvm.conf(5).
- Raid
- Attempts to handle device failure automatically. See lvm.conf(5).
- Snapshot
- Monitors how full a snapshot is becoming and emits a warning to syslog when it exceeds 80% full. The warning is repeated when 85%, 90% and 95% of the snapshot is filled. See lvm.conf(5).
- Thin
- Monitors how full a thin pool is becoming and emits a warning to syslog when it exceeds 80% full. The warning is repeated when 85%, 90% and 95% of the thin pool is filled. See lvm.conf(5).
OPTIONS
- -d
- Repeat from 1 to 3 times (-d, -dd, -ddd) to increase the detail of debug messages sent to syslog. Each extra d adds more debugging information.
- -f
- Don't fork, run in the foreground.
- -h, -?
- Show help information.
- -R
- Replace a running dmeventd instance. The running dmeventd must be version 2.02.77 or newer. The new dmeventd instance will obtain a list of devices and events to monitor from the currently running daemon.
- -V
-
Show version of dmeventd.
SEE ALSO
lvm(8), lvm.conf(5)
Index
This document was created by man2html, using the manual pages.
Time: 05:34:25 GMT, December 24, 2015


Bummer, 404 Not Found
You knew this was going to happen didn't you? Well, that being said it is possible that you simply clicked on a bad link. Either way, you'll have to look somewhere else for the file you were trying to find.
You knew this was going to happen didn't you? Well, that being said it is possible that you simply clicked on a bad link. Either way, you'll have to look somewhere else for the file you were trying to find.


| Module | Thor::Base::ClassMethods |
| In: |
lib/bundler/vendor/thor/base.rb
|
| debugging | [RW] |
Returns the tasks for this Thor class and all subclasses.
| OrderedHash: | An ordered hash with tasks names as keys and Thor::Task objects as values. |
Adds an argument to the class and creates an attr_accessor for it.
Arguments are different from options in several aspects. The first one is how they are parsed from the command line, arguments are retrieved from position:
thor task NAME
Instead of:
thor task --name=NAME
Besides, arguments are used inside your code as an accessor (self.argument), while options are all kept in a hash (self.options).
Finally, arguments cannot have type :default or :boolean but can be optional (supplying :optional => :true or :required => false), although you cannot have a required argument after a non-required argument. If you try it, an error is raised.
| name<Symbol>: | The name of the argument. |
| options<Hash>: | Described below. |
:desc - Description for the argument. :required - If the argument is required or not. :optional - If the argument is optional or not. :type - The type of the argument, can be :string, :hash, :array, :numeric. :default - Default value for this argument. It cannot be required and have default values. :banner - String to show on usage notes.
| ArgumentError: | Raised if you supply a required argument after a non required one. |
If you want to raise an error for unknown options, call check_unknown_options! This is disabled by default to allow dynamic invocations.
Adds an option to the set of class options
| name<Symbol>: | The name of the argument. |
| options<Hash>: | Described below. |
:desc - Description for the argument. :required - If the argument is required or not. :default - Default value for this argument. :group - The group for this options. Use by class options to output options in different levels. :aliases - Aliases for this option. :type - The type of the argument, can be :string, :hash, :array, :numeric or :boolean. :banner - String to show on usage notes.
Adds a bunch of options to the set of class options.
class_options :foo => false, :bar => :required, :baz => :string
If you prefer more detailed declaration, check class_option.
Hash[Symbol => Object]
Sets the namespace for the Thor or Thor::Group class. By default the namespace is retrieved from the class name. If your Thor class is named Scripts::MyScript, the help method, for example, will be called as:
thor scripts:my_script -h
If you change the namespace:
namespace :my_scripts
You change how your tasks are invoked:
thor my_scripts -h
Finally, if you change your namespace to default:
namespace :default
Your tasks can be invoked with a shortcut. Instead of:
thor :my_task
All methods defined inside the given block are not added as tasks.
So you can do:
class MyScript < Thor no_tasks do def this_is_not_a_task end end end
You can also add the method and remove it from the task list:
class MyScript < Thor def this_is_not_a_task end remove_task :this_is_not_a_task end
Removes a previous defined argument. If :undefine is given, undefine accessors as well.
| names<Array>: | Arguments to be removed |
remove_argument :foo remove_argument :foo, :bar, :baz, :undefine => true
Removes a previous defined class option.
| names<Array>: | Class options to be removed |
remove_class_option :foo remove_class_option :foo, :bar, :baz
Removes a given task from this Thor class. This is usually done if you are inheriting from another class and don‘t want it to be available anymore.
By default it only remove the mapping to the task. But you can supply :undefine => true to undefine the method from the class as well.
| name<Symbol|String>: | The name of the task to be removed |
| options<Hash>: | You can give :undefine => true if you want tasks the method to be undefined from the class as well. |
Parses the task and options from the given args, instantiate the class and invoke the task. This method is used when the arguments must be parsed from an array. If you are inside Ruby and want to use a Thor class, you can simply initialize it:
script = MyScript.new(args, options, config) script.invoke(:task, first_arg, second_arg, third_arg)
Returns the tasks for this Thor class.
| OrderedHash: | An ordered hash with tasks names as keys and Thor::Task objects as values. |
Everytime someone inherits from a Thor class, register the klass and file into baseclass.
Fire this callback whenever a method is added. Added methods are tracked as tasks by invoking the create_task method.


Aaron Meinel's Blog
Software Freedom, Science, Mathematics, Cats, Scripting, ...
home
·
about
·
subscribe
My early life
July 04, 2017
Hackers are painters
July 03, 2017
Speeches
June 05, 2016
Elements
March 12, 2016


Question
1
of 30
You have correct answer:
0
find an image that should stay against "?"
look at the picture


g2o_viewer in Ubuntu 14.04
If you compile source code of g2o
and install it under Ubuntu 14.04, you will find that the component of g2o_viewer
won’t be installed. The reason is that g2o
now depends on qt5, but there is only qt4 under Ubuntu 14.04. How can we solve this? I googled a lot and those methods of such as checking out to commit 8ba8a03f7863e1011e3270bb73c8ed9383ccc2a2
in which qt4 is g2o’s dependency. But I encountered many compiling errors when make
and it was terminated. It really bothers me.
OK,I want to try another way.If the latest g2o needs qt5, should I install qt5 to the PC? Actually If you update your os to 16.04, there will be no problems. But I use ROS Indigo which should only be installed under 14.04. Unfortunately, it depends on qt4. So I can’t just uninstall qt4 and install qt5. I should have them both. Below are the procedures of installing qt5 and having the g2o_viewer
component.
You can see this blog in this detailed github issue.
Install QT5
Just go to the official downloading link of the latest open-source QT.After downloading, just run the qt*.run
to install QT(don’t forget to chomod +777
). I suggest to install only the Tools and source components.
After installation, you will have both qt4 and qt5. But the qmake
is still version 4. You should do some changes as the code below:
sudo mv /usr/lib/x86_64-linux-gnu/qt-default/qtchooser/default.conf /usr/lib/x86_64-linux-gnu/qt-default/qtchooser/default.conf_backup
sudo vim /usr/lib/x86_64-linux-gnu/qt-default/qtchooser/default.conf
Add the two lines to default.conf
QT5_INSTALL_PATH_YOU_CHOOSE/VERSION_NUMBER_DIR/gcc_64/bin
QT5_INSTALL_PATH_YOU_CHOOSE/VERSION_NUMBER_DIR/gcc_64/lib
Then:
sudo vim /etc/ld.so.conf.d/qt5_lib.conf
Add one line to this qt5_lib.conf
QT5_INSTALL_PATH_YOU_CHOOSE/VERSION_NUMBER_DIR/gcc_64/lib
Then run sudo ldconfig
to update the lib searching path. Now qt5 is available and if you type qmake -v
you will get something like below:
QMake version 3.1
Using Qt version 5.9.8 in /home/bob/software/qt5/5.9.8/gcc_64/lib
Test it : run qtcreator
. If qtcreator
can’t be launched and you have some errors like below:
./qtcreator: symbol lookup error: /home/bob/software/qt5/Tools/QtCreator/lib/Qt/plugins/platforms/../../lib/libQt5XcbQpa.so.5: undefined symbol: FT_Get_Font_Format
This is a fatal error. If you can’t solve this,then all the programs depend on qt5 won’t be launched, including g2o_viewer
.
I spend a lot of time to solve this, I get nothing worked. Then I have to solve it by myself.
This error indicates that something is wrong with libQt5XcbQpa.so.5
in QT5_INSTALL_PATH_YOU_CHOOSE/VERSION_NUMBER_DIR/gcc_64/lib/
. We can cd
to this directory and run:
ldd -r libQt5XcbQpa.so.5 | grep freetype
and you will have :
libfreetype.so.6 => /usr/lib/x86_64-linux-gnu/libfreetype.so.6 (0x00007f77dfdf1000)
I googled and knew it should be something wrong with the version of lib libfreetype.so.6
. In Ubuntu 14.04, the version of freetype
is too old. To fix this, you should go to freetype
downloading page and unzip the file, install freetype to your PC as the documemtaion said. After this, you will have
libfreetype.so
libfreetype.so.6
libfreetype.so.6.17.0
in your /usr/local/lib
.Do as follows:
sudo mv /usr/lib/x86_64-linux-gnu/libfreetype.so* TO_SOME_WHERE_F0R_BACK_UP
sudo cp /usr/local/lib/libfreetype.so* /usr/lib/x86_64-linux-gnu
Now this error should be fixed. We have had the QT5 done. It’s time to get g2o
installed.
Install g2o
Install libgql
g2o_viewer
needs libQGLViewer
. If you have installed libqglviewer-dev
before, uninstall it via sudo apt-get remove libqglviewer*
.
Go to libqglviewer, download latest version and install it as the documentation said.
If your compilaton couldn’t find libQGLViewer, you shoud do the following:
Go to the source dirtectory of g2o
, modify the FindQGLViewer.cmake
in cmake_modules
like below:
...
find_library(QGLVIEWER_LIBRARY_RELEASE
##NAMES qglviewer QGLViewer qglviewer-qt5 QGLViewer-qt5
NAMES qglviewer-qt5 QGLViewer-qt5
...
Modify the CMakeLists.txt of g2o
If you just compile g2o, it won’t find the QT5 libs. So insert a variable to the CMakeLists.txt
:
# set the Qt5Config.cmake path
set(Qt5_DIR QT5_INSTALL_PATH_YOU_CHOOSE/VERSION_NUMBER_DIR/gcc_64/lib/cmake/Qt5)
Install g2o
mkdir build
cd build
cmake ..
make -j8
make install
Now g2o is installed. And you can run g2o_viewer.
Install libqglviewer
Remember that the libqglviewer-dev
has been removed? We need to reinstall it in order for other programs depending on it.
sudo apt-get install libqglviewer-dev
Unistallation
If you don’t need these anymore.
Uninstall QT5
./QT5_INSTALL_PATH_YOU_CHOOSE/MaintenanceTool
Uninstall libQGLViewer
Go to the build directory adn do:
sudo make uninstall
Libs of libQGLViewer
are in /usr/local/lib
.Header files are in /usr/local/include/QGLViewer
.
Uninstall g2o
If you want uninstall g2o
, just :
sudo rm -rf /usr/local/incude/g2o
sudo rm -rf /usr/local/lib/libg2o*
Uninstall freetype
If yo don’t need freetype anymore and want to uninstall the freetype
you installed, make sure you move the original libfreetype.so*
back.
rm -f /usr/local/lib/libfreetype.la
rm -f /usr/local/lib/libfreetype.la /usr/local/lib/libfreetype.so.6.17.0 /usr/local/lib/libfreetype.so.6 /usr/local/lib/libfreetype.so /usr/local/lib/libfreetype.a
rm -rf /usr/local/include/freetype2
rm -f /usr/local/bin/freetype-config
rm -f /usr/local/share/aclocal/freetype2.m4
rm -f /usr/local/lib/pkgconfig/freetype2.pc
rm -f /usr/local/share/man/man1/freetype-config.1


Device serial communication constants. More...
#include <PvSerialLib.h>
#include <IPvDeviceAdapter.h>
Go to the source code of this file.
Classes | |
| class | PvDeviceSerialPort |
| Provides access the a serial port on an device (Pleora GigE Vision device) More... | |
Enumerations | |
| enum | PvDeviceSerial { , PvDeviceSerial0 = 0, PvDeviceSerial1 = 1, PvDeviceSerialBulk0 = 2, PvDeviceSerialBulk1 = 3, PvDeviceSerialBulk2 = 4, PvDeviceSerialBulk3 = 5, PvDeviceSerialBulk4 = 6, PvDeviceSerialBulk5 = 7, PvDeviceSerialBulk6 = 8, PvDeviceSerialBulk7 = 9 } |
| Device serial port enumeration. More... | |
Device serial communication constants.
| enum PvDeviceSerial |
Device serial port enumeration.
Copyright (c) 2002-2015 Pleora Technologies Inc.
www.pleora.com


Stack is a presentation library
with scroll-based navigation.
Scroll down to continue.
PEEK-A-BO! I see you!
You can also scroll with the keyboard:
use the arrow keys,
the space bar,
or page up and page down.
Multiple key presses will skip multiple slides.
You can even grab the scroll bar!
If you stop between slides,
stack snaps to the closest slide.
Stack works on iOS, too.
Stack is made by Mike Bostock
and is available on GitHub
under the BSD license.
View source to get started.


The DFT is deﬁned by Eq. (34), i.e.,
|
| (84) |
where W = exp(2πi∕N). Equations (84) indicates that the DFT is the multiplication of a transformation matrix Mkj ≡ Wkj with a column vector hk, where the transformation matrix Mkj is symmetric and called DFT matrix. In the matrix form, the DFT is written as
|
| (85) |
If directly using the deﬁnition in Eq. (85) to compute DFT, then a matrix multiplication need to be performed, which requires O(N2) operations. Here the powers of W are assumed to be pre-computed, and we deﬁne “an operation” as a multiplication followed by an addition.
The Fast Fourier Transformation (FFT) algorithm manage to reduce the complexity of computing the DFT from O(N2) to O(N log 2N) by factoring the DFT matrix Mkj into a product of sparse matrices.
The original paper on FFT is Cooley and Tukey’s paper: An algorithm for the machine calculation of complex Fourier series, which turns out to be a very concise paper.
Suppose N is a composite, i.e., N = r1 ⋅ r2. Then the indices in Eq. (84) can be expressed as
|
| (86) |
|
| (87) |
Then, one can write
|
| (88) |
Noting that
|
| (89) |
Eq. () is written as
|
| (90) |
where the inner sum over k1 is independent of j1 and can be deﬁned as a new array
|
| (91) |
Then
|
| (92) |
There are N elements in the array h1, each requiring r1 operations, giving a total of Nr1 operation to obtain h1. Similarly, it takes Nr2 operations to calculate H from h1. Therefore, this two-step algorithm requires a total of N(r1 + r2) operations.


I went on a fishing trip
I caught a sword fish
I named him Charlie
How big was Charlie?
 He's a bum!
What's a fish?'
How big was Charlie?
 He's a bum!
What's a fish?'


{% extends "registration/base.html" %} {% block content %}
Forgotten your password? Enter your email address below, and we'll email instructions for setting a new one.


-
Google and Your Business: One week left to apply for a Mission Main Street ...
googleandyourbusiness.blogspot.com
-
A Googler sur Twitter : "Geez. It's annoying enough when your foot falls ...
twitter.com
Mot de passe oublié ? Vous utilisez déjà Twitter via SMS ?
-
Love a good airfare deal but don’t have the time to monitor prices? Google ...
plus.google.com
Love a good airfare deal but don’t have the time to monitor prices? Google can help make sure you don’t miss a good deal — when the price drops on a… ...
-
Keep critical first-aid information at your fingertips.
-
How Google Works - The rules for success in the Internet Century - A new ...
www.howgoogleworks.net
The rules for success in the Internet Century - by Eric Schmidt & Jonathan Rosenberg
-
For those who dream big: Announcing the winners of the 2014 Google Science ...
googleblog.blogspot.com
-
GSF 2014: Live from the Exhibition Hall
www.youtube.com
Watch an exclusive tour from the exhibit hall with the 2014 Google Science Fair finalists.
-
Finalists @ Google - Live from the Google Campus, Meet the Finalists for ...
plus.google.com
The Finalists are here! They’ve journeyed from around the world, and now they’re visiting Google Headquarters to showcase their amazing projects. ...
-
Study: Cities with super fast Internet speeds are more productive
www.washingtonpost.com
A look at 14 metropolitan areas and their neighbors links gigabit Internet speeds to higher per-capita GDP.
-
Boeken op Google Play
play.google.com
Winkel bij Google Play op internet. Doe aankopen en gebruik deze direct op uw Android-telefoon of -tablet zonder te synchroniseren.
-
Scottish Referendum – Google Politics & Elections
www.google.com
Catch the latest Google+ Hangouts and YouTube videos
-
Skybox Imaging - The Transformation of Burning Man
www.skybox.com
Skybox Imaging empowers global businesses to make better decisions with timely, high fidelity imagery and infinite analytics.
-
Google donates $185K worth of school supplies to Boston, Cambridge ...
www.bizjournals.com
The Mountain View-Calif.-based search giant, which has a local office in Cambridge, said it teamed up for the project with DonorsChoose.org, an ...
-
Google Mobile
www.google.com
Hangouts bring conversations to life with photos, emoji, and even group video calls for free.
-
The Brave New Digital World
online.wsj.com
On Wednesday, 15 new American partners from across the country will launch exhibitions on the Google Cultural Institute, joining more than 500 ...
-
Google Cultural Institute
www.google.com
Het Google Cultural Institute brengt miljoenen artefacten van diverse partners bijeen in een virtueel museum, samen met de verhalen die ze tot leven ...
-
Made with Code_Google
www.madewithcode.com
Things you love are Made with Code. Code your first creative project and meet music producers, fashion designers, humanitarians, and animators who ...
-
We have news -- we’re excited to be joining Google[x], Google’s moonshot…
plus.google.com
We have news -- we’re excited to be joining Google[x], Google’s moonshot factory. We will continue to sell our Liftware system, and Google will ...
-
Free and Open Internet | Google
google.bsd.net
The Internet belongs to everyone - and it's our job to protect it.


Preparation time
less than 30 mins
Cooking time
10 to 30 mins
Serves
Serves 4
For the bacon, spring onion and mashed potato cakes, place the potatoes into a pan of salted water, bring to the boil and simmer for 12-15 minutes, or until the potatoes are tender.
Heat a frying pan until hot, add the chopped bacon and cook for 2-3 minutes, or until the bacon is golden-brown and crisp. Remove from the pan and set aside to drain on kitchen paper.
Drain the potatoes and return to the pan. Place the pan over the heat for a few seconds to drive off any excess moisture. Pass the potatoes through a ricer into a bowl and add the butter or olive oil.
Beat the potato mixture with a wooden spoon until well combined, then add the spring onions and cooked, chopped bacon and mix until well combined. Season, to taste, with salt and freshly ground black pepper.
Using your hands, form the mashed potato mixture into four equal-sized patties, then set aside to cool. When completely cool, place the patties into the fridge for 30-45 minutes to chill and set.
Meanwhile, for the sautéed wild mushrooms, preheat the oven to 200C/400F/Gas 6.
Place the bacon onto a baking tray and place a second baking tray on top to weigh it down and prevent it from curling as it cooks.
Cook in the oven for 5-8 minutes, or until browned and cooked through. Remove from the oven and set aside to cool for ten minutes, or until the bacon has crisped up and is firm.
Heat a pan until hot, then add the 50g/2oz butter and one tablespoon of the olive oil. Add the shallot and cook for 2-3 minutes, until the shallot has just softened.
Add the garlic and the mushrooms and cook for another 3-4 minutes, until the mushrooms have released their liquid and are tender. Season, to taste, with salt and freshly ground black pepper.
For the potato cakes, when the potato cakes have chilled and set, remove them from the fridge and dredge in the flour.
Heat a frying pan until hot, add the remaining two tablespoons of olive oil, then add the cakes, two at a time. Cook on both sides, turning carefully, for 3-4 minutes, until golden-brown on both sides and heated through. Keep warm.
Heat a separate frying pan until hot, add the remaining olive oil. Crack in the duck eggs and fry until cooked to your liking.
To serve, place a potato cake in the centre of each plate. Spoon some mushrooms onto each potato cake, piling them up carefully. Top with a fried duck egg, then season, to taste, with a little salt and black pepper. Finish with a sprig of chervil.


BVLGARI
POUR HOMME
Odors have a power of persuasion stronger than that of words, appearances, emotions, or will. The persuasive power of an odor cannot be fended off, it enters into us like breath into our lungs, it fills us up, imbues us totally. There is no remedy for it.
- Flower Code : 30PARFUME1
- Type : Parfume
- Price : IDR 500.000,00


It's just a website where the content changes, or responds to, the size of the screen or browser window it's displayed on. It's incredibly important as there are so many divices with different screen sizes nowadays that are able to view the web, and you want your websites to have the desired effect on every visitor.
In a more complex application of this idea, the effect that you want to have might be different for mobile visitors - the term given for people viewing your website on their mobile phone - as you might be selling computer software or something else that's not designed to be used on a phone anyway, so you really just want them to get your few key messages, see some visuals and be impressed with your shiny modern design... so you'd design for your site to appear in that way on mobile screen sizes. For your desktop and laptop visitors, you might want to be showing off your software in action, offering free trial versions etc to capture email addresses, or encouraging people to purchase, so you'd design your site to appear that way on desktop and laptop screen sizes
But most of the time, it's just a fancy name for making your website content change size and layout depending on how big the user's screen is so that it's all still readable and nice.
I spent probably the majority of this week's study-time trying to make this website responsive, so have a play with resizing the browser window down to really small, or come to this page on your phone to see.
Mobile first is a design philosophy that does what it says on the can. You design your mobile website first - or, more accurately, how your website will appear on mobile screen sizes - and then once you're happy with that, move on to use that as a base for how your website will appear on all other screen sizes. It's a good move as most mobile designs can be tweaked just a little bit in terms of sizing, content and layout, and look good on bigger screen sizes, but it doesn't neccessarily work the other way around. So going mobile-first avoids doing the technical equivalent of painting yourself into a corner as this stickman below has done.
A framework is kind of like a template for building a website. Using one is like buying prefabricated house, as opposed to building a house from scratch. You still get to decide where all your stuff goes and how it looks, and you can change it a little bit here and there and maybe knock down a wall you really don't like as long as the rest of the structure isn't relying on that wall, but most of the hard work has been done for you.
A wireframe is a fancy name for a basic design sketch. It's a way for people to communicate design and functionality ideas without actually having to build the thing to show someone what they are thinking. Web designers use them to do exactly that, and to test whether their designs have the desired effect on people they show them to before they invest the time to build it.

My homepage mobile wireframe for this site looks like this:
I crudely drew around my iPhone 5 to get a proper idea of the screen size, and also did my 'booxifying' in red pen over the top so it's not the prettiest thing, but you get the gist.
Here are my homepage desktop, blog mobile, and blog desktop wireframes:
I decided to have a 'related' side navigation on blogs in my desktop design, but it definitely doesn't fit on the mobile disign so I took it out. It was a bit of mission to figure out how but I ended up getting it by giving the side nav's div
a class of side-nav and making a media query in my custom css file for screens that have a width of up to 549px maximum, and applying the style display: none;
to things with the class side-nav. If you shrink the browser window on this page, the nav on the left should dissappear when the width gets down to 549px.
I also discovered that the skeleton wireframe we're using here will not display an empty column in a row, so when I was trying to balance elements like the logo at the top of the page to be center-aligned, I couldn't just put an empty two column div on the left to match the two column div on the right with the 'all blogs' button.
That wasn't too hard to solve as I found you can just use the offset-by-x classes to offset it any number of columns, but the mindboggle came when I needed to 'inset' columns, for lack of a better term, later on to do the same thing but on the right-hand side of the page. I needed this on my blogs to balance the two columns used for the side navigation so the center 8 column div with all the words could sit center aligned. Skeleton didn't have anything set up for this so I ended up trawling through their css files I am linking at the very top of the html file, finding out they made their offset classes and making my own 'inset' class in my custom css file and applying it to this center 8 column div containing all the words.
Reuben Harcourt.


Home
Toggle navigation
Projects
Footballbets
References
Bachsanierung
Reviews
Building Microservices
Latest News Headlines
From DEVOXX 2014: Pico Services with Java EE 7 on Java 8 and Docker
13.05.2015 by Adam Bien
Deploying Java EE Application to Docker Swarm Cluster
13.05.2015 by Arun Gupta
Docker Maschine on Windows - How To Setup You Hosts
06.05.2015 by Markus Eisele
WildFly Swarm: Building Microservices with Java EE
06.05.2015 by Arun Gupta
Continuous Delivery with Docker Containers and Java EE
30.04.2015 by Markus Eisele
Robert Brem
Software Engineer
Transhumanist
Optimist
Technical
Topics of Interest
Kubernetes
Docker
Netflix OSS
Java EE
AngularJS
Architectural
Topics of Interest
Microservices
Programmer Anarchy
Resilient Software Design
Lean Enterprise
DevOps
Other
Topics of Interest
American Football
Arduino
Technological Singularity
Poker


About
This is a RSS Reader web app developed using AngularJS.
You can access the code on Github.
About the Author
LabsterX
- Website: http://labsterx.com
- Twitter: https://twitter.com/labsterx
- Github: https://github.com/labsterx
This is a RSS Reader web app developed using AngularJS.
You can access the code on Github.
LabsterX


Home
Navigators
Contact Us
Swing by for a cup of coffee, or leave us a message:
First Name
Last Name
Country
Subject


|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| | If you have any feedback on how we can make our new website better please do contact us and we would like to hear from you. | |
|
|
|
|
|
|
|
The Chamblee Bistro
www.chambleebistro.net
corner of Broad Street and Peachtree Road
770.457.9869
menu and more info coming soon
|
|
| |
|
|
|


[color]This tag should be ignored[/color] This is red text This is also red text The malicious quote should be removed.


LuaSrcDiet
Introduction
LuaSrcDiet is a utility written in Lua for the purpose of turning Lua
5.1 source code like this:
local function calc_indent(s)
local col = 0
for i = 1, #s do
local c = sub(s, i, i)
col = col + 1
if c == "\t" then
while col % 8 > 0 do col = col + 1 end
end
end
return math.floor(col / 8)
end
into a more compact or 'squeezed' form (minus a lot of unnecessary
characters) like this:
local function _(l)local e=0
for o=1,#l do
local n=n(l,o,o)e=e+1
if n=="\t"then
while e%8>0 do e=e+1 end
end
end
return r.floor(e/8)end
and still be able to run normally under standard Lua 5.1.
LuaSrcDiet reduces the size of Lua 5.1.x source
files by aggressively removing all unnecessary whitespace and comments,
optimizing constant tokens, and renaming local variables to shorter
names. For example, LuaSrcDiet squeezes its own sources from 156KB down
to 42KB. Further bzip2 or lzma compression can bring the file size
further down to under 13KB. That's 12X reduction in size, if you
don't mind the decompression and compilation time.
LuaSrcDiet is broadly similar to Luiz's
lstrip
(tar.gz link) for Lua 5.1, which can be found on Luiz's
Libraries and tools for
Lua page. LuaSrcDiet with its modified Lua source code lexer and
parser allows most optimization options to be enabled or disabled
separately, and can do a bit more like renaming local variable names.
There is also Matthew Wild's
squish
, which
incorporates LuaSrcDiet and offers more code compression options.
squish
goes beyond what LuaSrcDiet does, as the latter (as a matter
of policy) only sticks to source code readable by standard Lua binaries.
LuaSrcDiet and Obfuscation
Owing to the use of LuaSrcDiet among certain things like WoW add-ons,
the following is a clarification of this author's intentions:
- LuaSrcDiet can be used as a weak obfuscator. However, note that the structure and arrangement of the source code stays exactly the same, so do not depend on such a weak form of obfuscation if you really needed heavy-duty obfuscation.
- LuaSrcDiet was written for the purpose of comparing minimum-sized sources with binary chunks, their compressibility, and the parsing performance of the Lua interpreter. I don't care one iota about obfuscation, it's compression I'm interested in.
- This is experimental software. If you want to use it for important stuff, be sure to apply source and binary equivalence checking. I'm not, of course, responsible for anything you do.
- Treat it like a text filter tool or a compiler. There is no legal requirement to acknowledge LuaSrcDiet or to place its copyright notice anywhere for the source code you processed. Your app is stuff you wrote, LuaSrcDiet is stuff I wrote. Simples.
- Obfuscation cannot be defined precisely so we are dealing with subjective judgements. I think it's fair if people want to apply a mild deterrent against casual plagiarism. Those desperate for original sources should instead turn their energies towards Open Source or Free Software.
What's New
As of version 0.12.0, LuaSrcDiet has been moved to a new project host
site at: http://code.google.com/p/luasrcdiet/
- Version 0.12.1 (2012-04-07):
- BUG FIX: Long comment adds an extra 2 characters when using --keep option.
- Faster function call syntax sugar optimization using a one-pass token deletion loop.
- Version 0.12.0 (2011-09-13):
- Added convenient single-file versions of LuaSrcDiet in various sizes.
- BUG FIX: String optimization of "\ddd" -- "\00101" was incorrectly optimized to "\101".
- Added --opt-srcequiv: Source equivalence checking. Tries hard to compare 'before' and 'after' lexer token streams for equivalence.
- Added --opt-binequiv: Binary chunk equivalence checking. Tries hard to compare 'before' and 'after' binary chunks for equivalence.
- When using --opt-eols, the last EOL character is now removed.
- --opt-experimental: Turns on a few experimental optimizations:
- Semicolon (';') operator removal (deleted or turned into whitespace).
- Function call syntax sugar optimization. E.g.
f("string")
is turned into f"string"
- Plugins are now embedded into single-file versions.
- First release of completed documentation files.
- New Makefile and numerous minor updates.
- Old code for Lua 5.0 removed (the last working version can be found in the previous release.)
- Version 0.11.2 (2008-06-08):
- Improved local variable name allocation, better reuse leading to less identifiers used.
- Added experimental --plugin option with an example plugin script.
- Added a SLOC plugin to count SLOC for Lua 5.1 source files.
- Added a HTML plugin to see globals and locals marked.
- Version 0.11.1 (2008-06-03):
- Fixed a local variable rename bug that generates names that are keywords.
- Added --opt-entropy option for locals variables to reduce symbol entropy.
- Implemented --detail info for strings, numbers and local variables
- Added explanatory notes on local variable optimization.
- Version 0.11.0 (2008-05-28):
- Local variable name optimization.
- Many options and sample output added.
- Version 0.10.2 (2008-05-27):
- Aggressive optimizations for string and number tokens.
- Minor bug fixes.
- Version 0.10.1 (2008-05-25):
- Totally rewritten for Lua 5.1.x.
Acknowledgements
LuaSrcDiet was originally hosted on LuaForge.
Thanks to the LuaForge team for their contributions to the Lua ecosystem.
LuaSrcDiet was developed exclusively using the
SciTE editor, on
Cygwin, and managed using
SVN.
Parts of LuaSrcDiet is based on Yueliang,
which is in turn based on the Lua sources.
2012-04-07 khman


---
layout: post
title: Gooey flourless brownies
date: 2021-03-13 06:00:34 -0200
background: '/img/recipes/gooey-brownies.jpg'
categories: Recipes
---
No eggs? No butter? No problem! These brownies are life changing, this is one of my favourite recipes.
They are decadent, soft and super gooey. The secret Ingredient? MAYO!!! You'll never make your brownies any other way.
Prep time: 10 minutes
Cook time: 25 minutes
Serving: 1x 24cm square tin/casserole dish.
Ingredients: gooey brownies
- 1 ½ cup almond flour
- 3 tbsp whey powder
- 1 tsp psyllium husk powder
- 1 ½ tsp baking powder
- ⅓ cup erythritol
- 3 tbsp cocoa powder
- ½ cup boiling water
- ⅓ cup mayonnaise
- 1 cup cream
Ingredients: chocolate ganache
- ¼ cup cream
- 100g sugar-free chocolate
Instructions: brownies
- Preheat the oven to 180°C.
- Line the tin/dish with baking paper and grease as an extra precaution.
- Boil water.
- Combine all the dry ingredients (except the cocao powder) in a mixing bowl.
- Combine the cocoa and boiling water in a separate bowl.
- Add the mayonnaise and cream to the dry ingredients and mix.
- Add the cocoa powder and mix thoroughly.
- Pour the batter into the prepared tin/dish and bake for 25 minutes.
- Remove from the oven and let the brownies cool down in the tin/dish.
- Pour over the sugar-free chocolate ganache (see instructions below) and put into the fridge for 30 minutes to set.
- Remove the brownies from the fridge and use the baking paper to lift the brownies out from the tin/dish.
- Cut it into squares.
- Store in an airtight container. If you are stacking the brownies, layer each row with baking paper.
- Store it in the fridge (unless you have a very low room temperature).
- Remove the brownies, 10-15 minutes before eating, from the fridge.
Instructions: chocolate ganache
- Heat up the cream.
- Break the chocolate up and stir into the cream until completely melted.
Tip
These brownies don't contain any raw egg or flour so don't worry about under baking them.
Adding boiling water to the cocoa powder first, activates it and gives a richer chocolate taste: it's called blooming
The brownies will rise really high in the oven and then collapse when removed. This is because there are no eggs to form a structure but this is also what makes them super gooey.
Handle the brownies with care, they are more delicate than standard brownies because they don't contain eggs or flour.
Live long and keto-on!


| HYTOOL Function Reference |
Theis model with a constant head boundary for multiple rate
tests (1935).s = tmc_dim(p,t) p(1) = b = slope of Jacob Straight Line ( = 0.183/T ) p(2) = t0 = intercept with the horizontal axis for s = 0 p(3) = ti = time of intersection between the 2 straight lines t = time s = drawdown
Calculate the drawdown at time t for multiple rate tests with accounting for a constant head boundary. For this solution, quadratic head losses are not taken into account. The function tmc_pre must be used to initialize the pumping rate history before making any call to tmc_dim. tmc_dim is designed to interpret drawdown within a piezometer during a step drawdown test. It can also be used to interpret simultaneously multiple pumping and recoveries dataset.
tmc_dmo, tmc_pre, tmc_rpt, tmc_gss Published output in the Help browser showdemo tmc_dim
| Hytool |
© 1998-2017 Philppe Renard and Co. Terms of Use Acknowledgments


There were few validation errors while processing a file from {0}. The attached
file has total {1} record(s), out of which {2} record(s) are invalid.
Please study below errors and re-process the file.
{3}
{4}
{5}
Thanks,
Integrated Data Processing Environment
Legends:
Error(s)|Warning(s)
[Please do not reply to this automated email]


Copyright © 2008 W3C® (MIT, ERCIM, Keio), All Rights Reserved. W3C liability, trademark and document use rules apply.
One of the challenges facing Semantic Web for Health Care and Life Sciences is that of converting relational databases into Semantic Web format. The issues and the steps involved in such a conversion have not been well documented. To this end, we have created this document to describe the process of converting SenseLab databases into OWL. SenseLab is a collection of relational (Oracle) databases for neuroscientific research. The conversion of these databases into RDF/OWL format is an important step towards realizing the benefits of Semantic Web in integrative neuroscience research. This document describes how we represented some of the SenseLab databases in Resource Description Framework (RDF) and Web Ontology Language (OWL), and discusses the advantages and disadvantages of these representations. Our OWL representation is based on the reuse and extension of existing standard OWL ontologies developed in the biomedical ontology communities. The purpose of this document is to share our implementation experience with the community.
This section describes the status of this document at the time of its publication. Other documents may supersede this document. A list of current W3C publications and the latest revision of this technical report can be found in the W3C technical reports index at http://www.w3.org/TR/.
This is an Interest Group Note of the Semantic Web in Health Care and Life Sciences Interest Group (HCLS), part of the W3C Semantic Web Activity. It is considered stable and expected to be published as an Interest Group Note in May 2008. This document serves as a companion to A Prototype Knowledge Base for the Life Sciences and describes the process for integrating new data into an existing biological database. We hope other groups who plan to convert their databases into RDF/OWL format will benefit from this document.
The document was produced by the Semantic Web in Health Care and Life Sciences Interest Group (HCLS), part of the W3C Semantic Web Activity (see charter). Comments may be sent to the publicly archived<EMAIL_ADDRESS>mailing list. Feedback is encouraged, as is participation in the recently re-charted HCLSIG. A list of changes since the last publication is available.
Publication as an Interest Group Note does not imply endorsement by the W3C Membership. This is a draft document and may be updated, replaced or obsoleted by other documents at any time. It is inappropriate to cite this document as other than work in progress.
This document was produced by a group operating under the disclosure obligations of the 5 February 2004 W3C Patent Policy. The group does not expect this document to become a W3C Recommendation. An individual who has actual knowledge of a patent which the individual believes contains Essential Claim(s) must disclose the information to<EMAIL_ADDRESS>[public archive] in accordance with in accordance with section 6 of the W3C Patent Policy.
The SenseLab databases can be accessed through a web interface at the SenseLab web site [SENSELAB-WEB]. SenseLab is divided into a number of specialised databases, of which we have converted three to Semantic Web formats. These databases are NeuronDB, BrainPharm and ModelDB. All databases are based on compartmental models of neurons. NeuronDB contains descriptions of anatomic locations, cell architecture and physiologic parameters of neuronal cells. The pilot BrainPharm database is intended to support research on drugs for the treatment of neurological disorders. It enhances the descriptions in a portion of NeuronDB with descriptions of the actions of pathological and pharmacological agents. ModelDB is a large repository of computational neuroscience models and simulations. The mathematical models in ModelDB are annotated with references to NeuronDB. Taken together, these databases allow the researcher to query information and to run simulations pertaining to the function of neurons in healthy and disease states. All databases contain extensive literature references and excerpts from texts that have been used to curate the database entries.
The databases are based on the "entity-attribute-value with classes and relationships" (EAV/CR) schema [EAV-CR]. The data can also be downloaded from the SenseLab Semantic Web development portal [SENSELAB-SW] as a database dump in Microsoft Access format and as text.
Our motivation was to make the SenseLab databases available in RDF(S) [RDFS] (without OWL) and in OWL DL [OWL Overview]. The two versions were developed in parallel in order to compare the difference between the conversion processes and the outcomes. We wanted to explore the issues in mapping relational databases to RDF/OWL structure. In addition, we wanted to explore the possibility of automatic translation from EAV/CR to RDF.
We developed a converter application in Java that queried the SenseLab database and wrote RDF/XML files. The conversion was fully automatic for the RDF version, but required some manual editing for the OWL version.
These conversions were too tied to the original database structure, which resulted in inconsistent OWL ontologies. Some shortcomings of the first conversion to OWL were:
http://neuroweb.med.yale.edu/senselab/neuron_ontology.owl#GABA
).
This grave mistake would not have been noticed without the use of OWL
reasoning. ¹ Disjoint classes are used in OWL to assert that they have no members in common. Inferences from this can be used to flag any inconsistent models.
The revised OWL conversion was based on the first OWL conversions described above. The design of the revised SenseLab ontologies follows the "ontological realism" approach [SMITH-2004]. This means that the revised ontologies are focused on direct representations of physical objects and processes (e.g., neuronal cells, ionic currents), and not on their abstractions (e.g., concepts or database entries).
Manually correcting the logical inconsistencies in the first version of the OWL ontology; making use of foundational ontologies (BFO, Relation Ontology) where possible; mapping the ontology to other neuroscience ontologies.
An ontology containing basic class hierarchies and relations was manually created, based on the structure of existing SenseLab databases. This basic ontology could not be created from the database structure in an automated process because this would not have resulted in a logically consistent ontology. This ontology was edited by a domain expert, based on inspection and manual editing with Protege 3.2 [PROTEGE] and Topbraid Composer [TOPBRAID]. The ontologies were built upon established foundational ontologies in order to maximize the interoperability with other existing and forthcoming biomedical Semantic Web resources. The foundational ontologies used were:
Based on this manually created basic ontology, the data from the SenseLab databases were then automatically converted to OWL using programs written in Java and Python. The automated export scripts extended the manually created basic ontology through the creation of subclasses, OWL property restrictions and individuals. The resulting ontologies show no clearly distinguishable divide between the 'schema' and 'data'.
The OWL export of NeuronDB was based on a transformation from the EAV/CR model of the SenseLab database to files in RDF/XML syntax by a Java program. The export from ModelDB and BrainPharm was based on a simple flat text file export of the databases. The text file exports were converted to RDF/XML files with a Python script.
For mappings to external bioinformatics databases that did not yet offer
stable URIs for reference on the Semantic Web, we used the URI scheme for
database record identifiers established by Science Commons [SC-URI]. URIs for database records could simply be
generated by concatenating the record identifier to a predefined namespace.
For example, the Entrez Gene record with ID '3579' was identified by the URI
http://purl.org/commons/record/ncbi_gene/3579
,
the Uniprot record 'P46663' was identified by http://purl.org/commons/record/uniprotkb/P46663
and the Pubmed record with ID '11160518' was identified by http://purl.org/commons/record/pmid/11160518
.
The database entries were connected to the ontological representations of
real-word entities through relations such as
has_nucleotide_sequence_described_by
. For example, the gene of
the Dopamine Receptor D1 (DRD1) is defined through a reference to NCBI record
1812, which contains a description of the sequence of this specific gene:
<http://purl.org/ycmi/senselab/neuron_ontology.owl#DRD1_Gene>
owl:equivalentClass _:property_restriction1 .
_:property_restriction1 owl:onProperty
senselab:has_nucleotide_sequence_described_by .
_:property_restriction1 owl:hasValue
<http://purl.org/commons/record/ncbi_gene/1812> .
Mappings were made to the following ontologies:
The mappings were made with the following cross-ontology relations: owl:equivalentClass, rdfs:subClassOf and the "has part" relation from the OBO relation ontology.
Figure 1: Import hierarchy of OWL ontologies. Ontologies printed in bold have been created by the SenseLab team, other ontologies have been created by other groups. The arrows point from the imported ontology to the importing ontology, e.g., the NeuronDB Ontology imports the Relation Ontology. Import statements are transitive, e.g., the ModelDB Ontology imports both the NeuronDB ontology and the Relation ontology.
Figure 2: Examples of relations ('mappings') spanning between classes from the NeuronDB ontology (in the middle) and classes from external ontologies.
Terse rdfs:labels were replaced by more descriptive ones that could be better understood without knowledge about context. For example, the rdfs:label "Ded" was changed to "Distal part of equivalent dendrite (Ded)". Note that, in this case, the original label was also preserved (in brackets), because it might still be useful for people that do know about the context.
The ontology development was moved to a Subversion (SVN) system on a central web server. During most of the development, the ontologies were simply developed on the client side and were periodically uploaded via FTP. Of course this led to problems when more than one person was working on the ontologies at a time, and it was also impossible for users of the ontology to access previous versions of the ontology, since only the most recent version was available on the web site.
The namespaces / ontology locations were changed to PURL-based URIs. For
example, the URI
http://neuroweb.med.yale.edu/senselab/neuron_ontology.owl#Dopamine
was changed to http://purl.org/ycmi/senselab/neuron_ontology.owl#Dopamine
('ycmi' stands for 'Yale Center for Medical Informatics'). PURL-based URIs
are easier to maintain when server configurations change or (in the worst
case) the original server is unavailable and the ontologies need to be served
from a different location. The increased stability of PURLs encourages the
re-use of entities in ontologies developed by other groups -- which is a key
factor in the creation of a coherent Semantic Web.
A SPARQL endpoint for the SenseLab ontologies was set up using the open
source version of the Openlink Virtuoso server [VIRTUOSO]. A SPARQL endpoint is a service that
allows clients to query a RDF store with the SPARQL query language through
simple HTTP GET requests. The ontologies were loaded into the triple store of
the server to make them accessible to SPARQL queries. Each ontology file was
put into a separate labeled graph, the label of each graph was identical to
the URL of the ontology file. For example, the ontology located at http://purl.org/ycmi/senselab/neuron_ontology.owl
was loaded into a graph labeled
http://purl.org/ycmi/senselab/neuron_ontology.owl
. Loading each
ontology into a separate graph makes it possible to restrict SPARQL queries
to certain graphs and hence, certain ontologies. This has the advantage that
queries can be more selective and can be executed with better performance.
The final products of the project are accessible at http://neuroweb.med.yale.edu/senselab/. A SVN repository can be accessed through a web interface at http://neuroweb.med.yale.edu/svn/trunk/ontology/senselab/. The SPARQL endpoint can be accessed at http://hcls.deri.ie/sparql. The SenseLab OWL ontologies are mentioned as an example of the application of OBO ontologies in the article The OBO Foundry: coordinated evolution of ontologies to support biomedical data integration [OBO-ARTICLE].
We experienced the following advantages from using RDF/OWL:
We experienced the following problems while using RDF/OWL:
The SenseLab ontologies will be further integrated with other neuroscientific and biomedical ontologies. User friendly applications will be developed to query a multitude of interrelated ontologies in a scientifically meaningful way. To this end, we have implemented a prototype Web application called 'Entrez Neuron' that allows the user to query data across multiple sources based on key words. The user can browse the query results and retrieve more detailed information about neurons based on a 'brain-anatomy/neuron' view. A paper describing this application was published in the WWW/HCLS2008 workshop. Currently, we are expanding this application to include more views and features.
Based on our experiences we can make the following suggestions for other projects that have similar goals:
We experienced clear benefits from using Semantic Web technologies for the integration of SenseLab data with other neuroscientific data in a consistent, flexible and decentralised manner. The main obstacle in our work was the lack of mature and scalable open source software for editing the complex, expressive ontologies we were dealing with. Since the quality of these tools is rapidly improving, this may cease to be an issue in the near future. The detailed analysis of the experiences with the SenseLab ontologies and other complex biomedical ontologies may help drive the improvement of current ontology editors.
Thanks to Huajun Chen and Ernest Lim who contributed to the SenseLab conversion. Thanks to Gordon Shepherd, Perry Miller, Luis Marenco and Tom Morse for their input, suggestions and support. Thanks to Susie Stephens for her detailed suggestions for improving this document. Thanks to Alan Ruttenberg for his technical suggestions during the conversion process. Thanks to Eric Prud'hommeaux for technical advice and assistance on the creation of this document.


QuantConnect is offering contributing authors compensation for their BootCamp Lesson submissions. Depending on the complexity and topics covered a lesson ranges from $2,000 to $4,000USD.
| Difficulty | Compensation | Estimated Effort |
|---|---|---|
Beginner |
$2,000USD |
3-5 days fulltime work |
Intermediate |
$3,000USD |
4-6 days fulltime work |
Advanced |
$4,000USD |
5-8 days fulltime work |
Before starting a lesson reach out to the QuantConnect team for approval on the lesson concept. We are seeking to provide diverse and complementing content for the community. If you're interested in creating BootCamp lessons but don't have a topic in mind get in touch with us!


{{ firstUpdate.title }}
{{ firstUpdate.lead }}
Read more{{ firstUpdate.lead }}
Read moreThis year we return to our first venue ever!
Uránia Cinema in the middle of the city, near the party-district. Designed by Henrik Schmahl in the late 1890's, the interior is characterized by the ornamental motifs of the Venetian Gothic and Moor styles. The place is listed as the world's 3rd most beautiful cinema on Bored Panda, and many tech conferences were hosted here recently, like TEDx, and Strech Conference, because of the unique atmosphere.
LiveJS rocks JSConf Budapest in October!
Imagine a party with awesome visuals, music & beats, and lights - all powered and created by JavaScript!
On the stage, performing live:
This awesome gig is brought to you by
Afterparty at EXTRA Budapest by EPAM
EPAM invites everyone to chill, have some drinks and games at the EXTRA ruinpub after JSConf Budapest. Beer and a selection of soft drinks and juices are on the house
These companies provide tremendous help, to make JSConf Budapest even more awesome!
If you are interested in sponsoring us in 2017, check out our Sponsoration Brochure, and get in touch!


The math behind the popular draftsim model is discussed, as well as a description of how to acquire and clean data to train the model.
Dominion is a popular deckbuilding game, but up to this point AI development has focused on simple money decks. Here, a model for playing and optimizing more complex engine decks is presented.
Lucky is a cute puppy. Here is his story.


Avoid unexpected results by using unitless line-height
length and percentage line-heights have poor inheritance behavior ...
Avoid unexpected results by using unitless line-height
length and percentage line-heights have poor inheritance behavior ...


The Free Software Foundation (FSF) is a 501(c)(3) non-profit organization founded by Richard Stallman on 4 October 1985 to support the free software movement, which promotes the universal freedom to study, distribute, create, and modify computer software, with the organization's preference for software being distributed under copyleft ("share alike") terms, such as with its own GNU General Public License. The FSF was incorporated in Massachusetts, US, where it is also based. From its founding until the mid-1990s, FSF's funds were mostly used to employ software developers to write free software for the GNU Project. Since the mid-1990s, the FSF's employees and volunteers have mostly worked on legal and structural issues for the free software movement and the free software community. Consistent with its goals, the FSF aims to use only free software on its own computers.
Free software or libre software is computer software distributed under terms that allow users to run the software for any purpose as well as to study, change, and distribute it and any adapted versions. Free software is a matter of liberty, not price: users—individually or in cooperation with computer programmers—are free to do what they want with their copies of a free software (including profiting from them) regardless of how much is paid to obtain the program. Computer programs are deemed free insofar as they give users (not just the developer) ultimate control over the first, thereby allowing them to control what their devices are programmed to do
The Free Software Foundation was founded in 1985 as a non-profit corporation supporting free software development. It continued existing GNU projects such as the sale of manuals and tapes, and employed developers of the free software system. Since then, it has continued these activities, as well as advocating for the free software movement. The FSF is also the steward of several free software licenses, meaning it publishes them and has the ability to make revisions as needed. The FSF holds the copyrights on many pieces of the GNU system, such as GNU Compiler Collection. As holder of these copyrights, it has the authority to enforce the copyleft requirements of the GNU General Public License (GPL) when copyright infringement occurs on that software. From 1991 until 2001, GPL enforcement was done informally, usually by Stallman himself, often with assistance from FSF's lawyer, Eben Moglen. Typically, GPL violations during this time were cleared up by short email exchanges between Stallman and the violator. In the interest of promoting copyleft assertiveness by software companies to the level that the FSF was already doing, in 2004 Harald Welte launched gpl-violations.org. In late 2001, Bradley M. Kuhn (then executive director), with the assistance of Moglen, David Turner, and Peter T. Brown, formalized these efforts into FSF's GPL Compliance Labs. From 2002-2004, high-profile GPL enforcement cases, such as those against Linksys and OpenTV, became frequent. GPL enforcement and educational campaigns on GPL compliance was a major focus of the FSF's efforts during this period. In March 2003, SCO filed suit against IBM alleging that IBM's contributions to various free software, including FSF's GNU, violated SCO's rights. While FSF was never a party to the lawsuit, FSF was subpoenaed on November 5, 2003.[16] During 2003 and 2004, FSF put substantial advocacy effort into responding to the lawsuit and quelling its negative impact on the adoption and promotion of free software. From 2003 to 2005, FSF held legal seminars to explain the GPL and the surrounding law. Usually taught by Bradley M. Kuhn and Daniel Ravicher, these seminars offered CLE credit and were the first effort to give formal legal education on the GPL. In 2007, the FSF published the third version of the GNU General Public License after significant outside input. In December 2008, FSF filed a lawsuit against Cisco for using GPL-licensed components shipped with Linksys products. Cisco was notified of the licensing issue in 2003 but Cisco repeatedly disregarded its obligations under the GPL. In May 2009, FSF dropped the lawsuit when Cisco agreed to make a monetary donation to the FSF and appoint a Free Software Director to conduct continuous reviews of the company's license compliance practices.
GO BACKRichard Matthew Stallman , born 1953, often known by his initials, RMS, is an American free software movement activist and programmer. He campaigns for software to be distributed in a manner such that its users receive the freedoms to use, study, distribute and modify that software. Software that ensures these freedoms is termed free software. Stallman launched the GNU Project, founded the Free Software Foundation, developed the GNU Compiler Collection and GNU Emacs, and wrote the GNU General Public License. Stallman launched the GNU Project in September 1983 to create a Unix-like computer operating system composed entirely of free software.With this, he also launched the free software movement. He has been the GNU project's lead architect and organizer, and developed a number of pieces of widely used GNU software including, among others, the GNU Compiler Collection, the GNU Debugger and the GNU Emacs text editor. In October 1985 he founded the Free Software Foundation. Stallman pioneered the concept of copyleft, which uses the principles of copyright law to preserve the right to use, modify and distribute free software, and is the main author of free software licenses which describe those terms, most notably the GNU General Public License (GPL), the most widely used free software license. In 1989 he co-founded the League for Programming Freedom. Since the mid-1990s, Stallman had spent most of his time advocating for free software, as well as campaigning against software patents, digital rights management (which he referred to as digital restrictions management, calling the more common term misleading), and other legal and technical systems which he sees as taking away users' freedoms. This has included software license agreements, non-disclosure agreements, activation keys, dongles, copy restriction, proprietary formats and binary executables without source code.
GO BACKThe FSF maintains a list of "high priority projects" to which the Foundation claims that "there is a vital need to draw the free software community's attention". The FSF considers these projects "important because computer users are continually being seduced into using non-free software, because there is no adequate free replacement." Current high priority tasks include reverse engineering proprietary firmware; reversible debugging in GNU Debugger; developing automatic transcription and video editing software, Coreboot, drivers for network routers and creating replacements for Skype, Google Earth, OpenDWG libraries, BitTorrent Sync and Oracle Forms. Previous projects highlighted as needing work included the Free Java implementations, GNU Classpath, and GNU Compiler for Java, which ensure compatibility for the Java part of OpenOffice.org, and the GNOME desktop environment. The effort has been criticized by Michael Larabel for either not instigating active development or for being slow at the work being done, even after certain projects were added to the list.


| 1 | /* | |
| 2 | * Licensed to the Apache Software Foundation (ASF) under one or more | |
| 3 | * contributor license agreements. See the NOTICE file distributed with | |
| 4 | * this work for additional information regarding copyright ownership. | |
| 5 | * The ASF licenses this file to You under the Apache License, Version 2.0 | |
| 6 | * (the "License"); you may not use this file except in compliance with | |
| 7 | * the License. You may obtain a copy of the License at | |
| 8 | * | |
| 9 | * http://www.apache.org/licenses/LICENSE-2.0 | |
| 10 | * | |
| 11 | * Unless required by applicable law or agreed to in writing, software | |
| 12 | * distributed under the License is distributed on an "AS IS" BASIS, | |
| 13 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
| 14 | * See the License for the specific language governing permissions and | |
| 15 | * limitations under the License. | |
| 16 | */ | |
| 17 | package org.apache.commons.collections4.sequence; | |
| 18 | ||
| 19 | import java.util.ArrayList; | |
| 20 | import java.util.List; | |
| 21 | ||
| 22 | /** | |
| 23 | * This class gathers all the {@link EditCommand commands} needed to transform | |
| 24 | * one objects sequence into another objects sequence. | |
| 25 | *
 | |
| 26 | * An edit script is the most general view of the differences between two | |
| 27 | * sequences. It is built as the result of the comparison between two sequences | |
| 28 | * by the {@link SequencesComparator SequencesComparator} class. The user can | |
| 29 | * walk through it using the visitor design pattern. | |
| 30 | *
 | |
| 31 | * It is guaranteed that the objects embedded in the {@link InsertCommand insert | |
| 32 | * commands} come from the second sequence and that the objects embedded in | |
| 33 | * either the {@link DeleteCommand delete commands} or {@link KeepCommand keep | |
| 34 | * commands} come from the first sequence. This can be important if subclassing | |
| 35 | * is used for some elements in the first sequence and the equals | |
| 36 | * method is specialized. | |
| 37 | * | |
| 38 | * @see SequencesComparator | |
| 39 | * @see EditCommand | |
| 40 | * @see CommandVisitor | |
| 41 | * @see ReplacementsHandler | |
| 42 | * | |
| 43 | * @since 4.0 | |
| 44 | * @version $Id: EditScript.java 1477760 2013-04-30 18:34:03Z tn $ | |
| 45 | */ | |
| 46 | public class EditScript<T> { | |
| 47 | ||
| 48 | /** Container for the commands. */ | |
| 49 | private final List<EditCommand<T>> commands; | |
| 50 | ||
| 51 | /** Length of the longest common subsequence. */ | |
| 52 | private int lcsLength; | |
| 53 | ||
| 54 | /** Number of modifications. */ | |
| 55 | private int modifications; | |
| 56 | ||
| 57 | /** | |
| 58 | * Simple constructor. Creates a new empty script. | |
| 59 | */ | |
| 60 | public EditScript() { | |
| 61 | commands = new ArrayList<EditCommand<T>>(); | |
| 62 | lcsLength = 0; | |
| 63 | modifications = 0; | |
| 64 | } | |
| 65 | ||
| 66 | /** | |
| 67 | * Add a keep command to the script. | |
| 68 | * | |
| 69 | * @param command command to add | |
| 70 | */ | |
| 71 | public void append(final KeepCommand<T> command) { | |
| 72 | commands.add(command); | |
| 73 |
1
1. append : Replaced integer addition with subtraction → SURVIVED |
++lcsLength; |
| 74 | } | |
| 75 | ||
| 76 | /** | |
| 77 | * Add an insert command to the script. | |
| 78 | * | |
| 79 | * @param command command to add | |
| 80 | */ | |
| 81 | public void append(final InsertCommand<T> command) { | |
| 82 | commands.add(command); | |
| 83 |
1
1. append : Replaced integer addition with subtraction → KILLED |
++modifications; |
| 84 | } | |
| 85 | ||
| 86 | /** | |
| 87 | * Add a delete command to the script. | |
| 88 | * | |
| 89 | * @param command command to add | |
| 90 | */ | |
| 91 | public void append(final DeleteCommand<T> command) { | |
| 92 | commands.add(command); | |
| 93 |
1
1. append : Replaced integer addition with subtraction → KILLED |
++modifications; |
| 94 | } | |
| 95 | ||
| 96 | /** | |
| 97 | * Visit the script. The script implements the visitor design | |
| 98 | * pattern, this method is the entry point to which the user supplies its | |
| 99 | * own visitor, the script will be responsible to drive it through the | |
| 100 | * commands in order and call the appropriate method as each command is | |
| 101 | * encountered. | |
| 102 | * | |
| 103 | * @param visitor the visitor that will visit all commands in turn | |
| 104 | */ | |
| 105 | public void visit(final CommandVisitor<T> visitor) { | |
| 106 |
1
1. visit : negated conditional → KILLED |
for (final EditCommand<T> command : commands) { |
| 107 |
1
1. visit : removed call to org/apache/commons/collections4/sequence/EditCommand::accept → KILLED |
command.accept(visitor); |
| 108 | } | |
| 109 | } | |
| 110 | ||
| 111 | /** | |
| 112 | * Get the length of the Longest Common Subsequence (LCS). The length of the | |
| 113 | * longest common subsequence is the number of {@link KeepCommand keep | |
| 114 | * commands} in the script. | |
| 115 | * | |
| 116 | * @return length of the Longest Common Subsequence | |
| 117 | */ | |
| 118 | public int getLCSLength() { | |
| 119 |
1
1. getLCSLength : replaced return of integer sized value with (x == 0 ? 1 : 0) → NO_COVERAGE |
return lcsLength; |
| 120 | } | |
| 121 | ||
| 122 | /** | |
| 123 | * Get the number of effective modifications. The number of effective | |
| 124 | * modification is the number of {@link DeleteCommand delete} and | |
| 125 | * {@link InsertCommand insert} commands in the script. | |
| 126 | * | |
| 127 | * @return number of effective modifications | |
| 128 | */ | |
| 129 | public int getModifications() { | |
| 130 |
1
1. getModifications : replaced return of integer sized value with (x == 0 ? 1 : 0) → KILLED |
return modifications; |
| 131 | } | |
| 132 | ||
| 133 | } | |
Mutations | ||
| 73 |
1.1 |
|
| 83 |
1.1 |
|
| 93 |
1.1 |
|
| 106 |
1.1 |
|
| 107 |
1.1 |
|
| 119 |
1.1 |
|
| 130 |
1.1 |


{% extends "base.html" %} {% block container %} {% if debug %}
It looks like you have found a bug! You can help to improve Flower by opening an issue in https://github.com/mher/flower/issues
{{ bugreport }} {{ error_trace }}


Upcoming Album
I'm excited to announce that I've begun work on a full-length album. I feel that my last release lacked dirt. So for the album I've broken out the fertilizer, and started to compost. Check back here to learn more.
After half a year of writing, recording, mixing and mastering, The Purest Cacophony's debut EP is released. Special thanks to my friends Theo Van Dyke, Jonathan Dana, Mike Tierney & Paul Puiia for all their help.
I'm excited to announce that I've begun work on a full-length album. I feel that my last release lacked dirt. So for the album I've broken out the fertilizer, and started to compost. Check back here to learn more.


Add some photos of your court.
Add photos of your facilities or games. You can always add more later.
Current Videos
-
Watch Drag
Add photos of your facilities or games. You can always add more later.
You can edit information about your court here.
You can edit availability details for your court here.
Select a range of time that you want to rent your court out for. You will be able to account for holidays and other breaks in schedule in the following steps.
Select the days with the same availability and create a schedule. (For example, select Monday and Wednesday if your court/field has the same availability schedule on both days.)
Add a range or a single time slot below
There is no booking.
| Sr No. | Date | Start Time | End Time |
| {{ $index+1 }} | {{ booking.date | date:'dd MMMM yyyy' }} | {{ booking.start_time }} | {{ booking.end_time }} |
You can edit price for your court here.
You can edit features for your court here.


Set the height and width of an element
Subtitle 2
This div element has a height of 200px and a width of 50%:
Set the height and width of an element
Subtitle 2


530 sq. ft. Enjoy golf course, tropical garden or mountain views from the private balcony of a resort view room. The room features a king-sized bed, full sofa bed, 42-inch TV, PlayStation3, desk, mini-refrigerator and coffeemaker. The bathroom features a tub and spa-quality bath amenities. Sleeps 4.
530 sq. ft. Enjoy golf course, tropical garden or mountain views from the private balcony of a resort view room. The room features a king-sized bed, full sofa bed, 42-inch TV, PlayStation3, desk, mini-refrigerator and coffeemaker. The bathroom features a tub and spa-quality bath amenities. Sleeps 4.
530 sq. ft. Enjoy golf course, tropical garden or mountain views from the private balcony of a resort view room. The room features a king-sized bed, full sofa bed, 42-inch TV, PlayStation3, desk, mini-refrigerator and coffeemaker. The bathroom features a tub and spa-quality bath amenities. Sleeps 4.


/* Alien Night Theme (Desktop) - A Dark Theme for Discourse Author: Ignaz Biegler Github: https://github.com/B-iggy/discourse-dark-theme Version 2.0.0 */


App title
Organization Name
Modify Inventory
Item Name:
Quantity:
Add
Remove
Inventory Distribution
Food Bank Inventory
Food Item
Quantity
Beans
500
Corn
335


Toggle navigation
Menu
Ssangyoung Company
Services
About
Contact
로그인
회원가입
Link 1
Link 2
Link 3
My Profile
My Profile
Designer, UI
London, UK
April 1, 1988
My Project
My Project
Create Project
Post
Share Project
Post
To do list
Progression rate
Management
Hey!
People are looking at your profile. Find out who.
글쓰기
카테고리
1
2
3
4
5
제목
업로드
내용
태그
확인
취소