text:
Home/News/Tackling the Root Causes of Porn Addiction
John Jack1 week ago
Porn addiction can be a destructive and isolating problem, and understanding the root causes is essential to combat it. Generally speaking, the most common root causes of porn addiction include:
Pornography is as easily accessible now as it ever has been, thanks to the internet and streaming services. Beyond that, pornographic content is highly sought after with users averaging 11 minutes per session across multiple platforms. In some cases, it's more than just a passing interest–users find themselves returning again and again, addicted to this type of explicit material.
The cause of this addiction lies in its accessibility; the ease with which you can get access combined with the wide variety of content available makes it easier to become hooked on pornography. It's undoubtedly an issue we need to address given the huge number of people enslaved by this problem. It's not just a moral quandary but one that severely affects mental health and relationships as well.
Relational difficulties such as past trauma
Porn addiction is a serious issue that can have a devastating impact on an individual's life. It can be caused by many factors, but one of the most common underlying issues is relational difficulties such as past trauma or lack of interpersonal connection with others. People may turn to pornography as an escape from reality, allowing them to lose themselves in the fantasy world it provides and avoid dealing with their own problems and emotional pain.
However, this can lead to an unhealthy and destructive cycle of addiction, as it only exacerbates the emotional distress and further distances them from meaningful connections with others, creating a dangerous loop of isolation and withdrawal.
People seeking an escape from the mundaneness of everyday life often find themselves drawn to watching pornography. In its worst form, this kind of entertainment becomes addictive because it helps to temporarily fulfill a person's craving for excitement and stimulation. Boredom is a major factor driving porn addiction since it takes advantage of an individual's feeling of listlessness.
Watching pornographic content creates a false sense of purpose and can result in excessive use, especially when combined with other underlying causes such as unmet emotional needs and mental health struggles. As such, breaking free from porn addiction requires one to not only address their psychological predispositions but also their feelings of boredom to prevent a relapse into the same behavior.
Porn addiction can stem from many different sources, but its base cause is often rooted in stress. It can be a form of unhealthy coping for stress that has built up throughout the day. As someone utilizes explicit material to relieve tension, it seems normal and arguably necessary at first. But it leads to an escalating need for more explicit content over time as the viewer seeks increasingly greater relief from their stressors.
Naïvely believing that pornography can provide a reprieve from negative emotions, addicted viewers find themselves unable to cope with the tribulations of life without constant stimulation. This behavior is often cyclical and can be difficult to break out of, making porn addiction one of the most pressing struggles of our modern world if not handled properly and intentionally.
Curiosity about sex or relationships
Unfortunately, our society doesn't always give us accurate answers or portray sex and relationships in a faithful manner. Thus someone may develop unhealthy attitudes and habits in response to the lack of reliable information. As the saying goes, "curiosity killed the cat" – it can also lead to an obsessive interest in pornographic materials which ultimately distracts from real-world connections and relationships. Seeking knowledge about these topics, after all, should involve more than exploring images online — it's important to strive for intimacy rather than objectify ourselves or others.
For many, one possible cause for addiction is mental health issues such as anxiety or depression. When an individual is dealing with these issues, they may turn to pornography in order to escape from the feelings of worthlessness and sadness they are experiencing, and act out in addictive behaviors. Those suffering from mental health issues may also struggle more with feelings of insecurity and self-doubt which can create emotional attachments to the porn content being consumed, leading them down a path of addictive behavior.
To conclude, porn addiction should not be taken lightly and those with porn addiction should seek help. Porn rehab programs are available that focus on finding out what specifically motivated an individual to become addicted to porn in the first place, in order to develop personalized solutions and ultimately address the root issues underlying porn addiction. Such initiatives are essential for tackling porn addiction in a more effective and sustainable manner.
Youth Football Coaching Skills
How The Shipping Industry Can Benefit From Cloud Computing – Victor Restis
Are You Thinking About Earning Some Extra Income? Join An Online Gambling Website!
This Will Change the Way You Look at Online Movies
How Fair Is An Online Casino?


text:
Share on Facebook(1.8k) Tweet Share Share Email
88 Years Ago 'The Star-Spangled Banner' Became Official National Anthem of the United States
By Neetu Chandak
Published March 3, 2019 at 8:49am
President Herbert Hoover signed a bill to make "The Star-Spangled Banner" the official national anthem for the U.S. on March 3, 1931 — 88 years ago Sunday.
The bill was first introduced by Maryland Democratic Rep. John Linthicum in 1929, though the anthem had been recognized by the United States Navy in 1889 and by President Woodrow Wilson in 1916, according to Politico.
"This country needs a national song to give expression to its patriotism," Linthicum said, Politico reported.
The anthem was written by lawyer Francis Scott Key in 1814. Key was inspired by the American flag surviving the 1,800-bomb assault from the British at Fort McHenry, Maryland during the War of 1812.
Key was detained on a British ship at the time, according to History.
Key's words were soon set to the tune of a popular English drinking song called, "To Anacreon in Heaven."
Controversies have surrounded the anthem, however.
Some criticized Linthicum's proposal because they felt the anthem's connection with a drinking song was inappropriate.
They also questioned Linthicum's motive, believing it was more about promoting the state's history than about demonstrating patriotism, according to Politico.
Do you believe it's wrong to kneel during the playing of the national anthem?
Another point of contention is whether the third verse is racist due to some words and phrases used.
One argument is that the verse is meant to insult slaves, while another opinion is that it is meant to insult the British, National Review reported.
Former San Francisco 49ers quarterback and activist Colin Kaepernick is known for not standing during the national anthem in 2016 to protest police brutality against black individuals.
"I am not going to stand up to show pride in a flag for a country that oppresses black people and people of color," Kaepernick told NFL Media in 2016.
A 2018 Washington Post-Kaiser Family Foundation poll found 53 percent of Americans did not believe it was appropriate to kneel during the national anthem.
RELATED: Senior House Democrat Proposing Measure to Make 'Black National Anthem' Official
A version of this article appeared on The Daily Caller News Foundation website.
Neetu Chandak
Founded by Tucker Carlson, a 25-year veteran of print and broadcast media, and Neil Patel, former chief policy adviser to Vice President Dick Cheney, The Daily Caller News Foundation is a 501(c)(3) non-profit providing original investigative reporting from a team of professional reporters that operates for the public benefit.
Hawley Slams the Brakes on Fast-Track Consideration of Biden's DHS Nominee
Sidney Powell Drops Lawsuit Alleging 'Massive Election Fraud' in Georgia
Political Insider Charged with Spreading Iranian Propaganda in the Pages of Major US News Outlets
Police Union Head Calls Out Critics in Fiery Letter: 'Our Noble Profession Has Been Demonized'
US Gov't Releases Alarming New Intel on Wuhan Virus Lab, 'Secret Projects' with Chinese Military
Tags: American flag, Colin Kaepernick, Culture, national anthem, patriotism, WJ Wire

redpajama_set_name: RedPajamaCommonCrawl


text:
El-P In New Run The Jewels Snippet: "I've Got A Unicorn Horn For A Cock"
The RTJ3 sessions are going smoothly, it seems.
By Jordan Darville
I got a unicorn horn for a cock.
A video posted by thereallyrealelp (@thereallyrealelp) on May 31, 2016 at 12:33pm PDT
El-P has shared a taste of a new song on Instagram, taken from RTJ3, the upcoming third Run The Jewels record with Killer Mike.
just posted that so you don't think we aren't working. #RTJ3
— el-p (@therealelp) May 31, 2016
The most quoted lyric from the clip will undoubtedly be El-P's proclamation, "I've got a unicorn horn for a cock." That may sound obscene, but perhaps it's not a boast after all?
Run The Jewels's last record Run The Jewels 2 came out in 2014. Since then, Killer Mike has campaigned for Bernie Sanders, and El-P put together Meow The Jewels, a cat-centric version of the second Run The Jewels album, for charity. In March, El-P announced that RTJ3 was "halfway done."
El-P, Hip-Hop, Killer Mike, run the jewels


text:
(function e(t, n, r) {
    function s(o, u) {
        if (!n[o]) {
            if (!t[o]) {
                var a = typeof require == "function" && require;
                if (!u && a)return a(o, !0);
                if (i)return i(o, !0);
                var f = new Error("Cannot find module '" + o + "'");
                throw f.code = "MODULE_NOT_FOUND", f
            }
            var l = n[o] = {exports: {}};
            t[o][0].call(l.exports, function (e) {
                var n = t[o][1][e];
                return s(n ? n : e)
            }, l, l.exports, e, t, n, r)
        }
        return n[o].exports
    }

    var i = typeof require == "function" && require;
    for (var o = 0; o < r.length; o++)s(r[o]);
    return s
})({
    1: [function (require, module, exports) {
        (function (global) {

            global.graphlib = require('./index');

        }).call(this, typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
    }, {"./index": 2}],
    2: [function (require, module, exports) {
        /**
         * Copyright (c) 2014, Chris Pettitt
         * All rights reserved.
         *
         * Redistribution and use in source and binary forms, with or without
         * modification, are permitted provided that the following conditions are met:
         *
         * 1. Redistributions of source code must retain the above copyright notice, this
         * list of conditions and the following disclaimer.
         *
         * 2. Redistributions in binary form must reproduce the above copyright notice,
         * this list of conditions and the following disclaimer in the documentation
         * and/or other materials provided with the distribution.
         *
         * 3. Neither the name of the copyright holder nor the names of its contributors
         * may be used to endorse or promote products derived from this software without
         * specific prior written permission.
         *
         * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
         * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
         * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
         * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
         * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
         * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
         * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
         * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
         * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
         * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
         */

        var lib = require("./lib");

        module.exports = {
            Graph: lib.Graph,
            json: require("./lib/json"),
            alg: require("./lib/alg"),
            version: lib.version
        };

    }, {"./lib": 18, "./lib/alg": 9, "./lib/json": 19}],
    3: [function (require, module, exports) {
        var _ = require("../lodash");

        module.exports = components;

        function components(g) {
            var visited = {},
                cmpts = [],
                cmpt;

            function dfs(v) {
                if (_.has(visited, v)) return;
                visited[v] = true;
                cmpt.push(v);
                _.each(g.successors(v), dfs);
                _.each(g.predecessors(v), dfs);
            }

            _.each(g.nodes(), function (v) {
                cmpt = [];
                dfs(v);
                if (cmpt.length) {
                    cmpts.push(cmpt);
                }
            });

            return cmpts;
        }

    }, {"../lodash": 20}],
    4: [function (require, module, exports) {
        var _ = require("../lodash");

        module.exports = dfs;

        /*
         * A helper that preforms a pre- or post-order traversal on the input graph
         * and returns the nodes in the order they were visited. This algorithm treats
         * the input as undirected.
         *
         * Order must be one of "pre" or "post".
         */
        function dfs(g, vs, order) {
            if (!_.isArray(vs)) {
                vs = [vs];
            }

            var acc = [],
                visited = {};
            _.each(vs, function (v) {
                if (!g.hasNode(v)) {
                    throw new Error("Graph does not have node: " + v);
                }

                doDfs(g, v, order === "post", visited, acc);
            });
            return acc;
        }

        function doDfs(g, v, postorder, visited, acc) {
            if (!_.has(visited, v)) {
                visited[v] = true;

                if (!postorder) {
                    acc.push(v);
                }
                _.each(g.neighbors(v), function (w) {
                    doDfs(g, w, postorder, visited, acc);
                });
                if (postorder) {
                    acc.push(v);
                }
            }
        }

    }, {"../lodash": 20}],
    5: [function (require, module, exports) {
        var dijkstra = require("./dijkstra"),
            _ = require("../lodash");

        module.exports = dijkstraAll;

        function dijkstraAll(g, weightFunc, edgeFunc) {
            return _.transform(g.nodes(), function (acc, v) {
                acc[v] = dijkstra(g, v, weightFunc, edgeFunc);
            }, {});
        }

    }, {"../lodash": 20, "./dijkstra": 6}],
    6: [function (require, module, exports) {
        var _ = require("../lodash"),
            PriorityQueue = require("../data/priority-queue");

        module.exports = dijkstra;

        var DEFAULT_WEIGHT_FUNC = _.constant(1);

        function dijkstra(g, source, weightFn, edgeFn) {
            return runDijkstra(g, String(source),
                weightFn || DEFAULT_WEIGHT_FUNC,
                edgeFn || function (v) {
                    return g.outEdges(v);
                });
        }

        function runDijkstra(g, source, weightFn, edgeFn) {
            var results = {},
                pq = new PriorityQueue(),
                v, vEntry;

            var updateNeighbors = function (edge) {
                var w = edge.v !== v ? edge.v : edge.w,
                    wEntry = results[w],
                    weight = weightFn(edge),
                    distance = vEntry.distance + weight;

                if (weight < 0) {
                    throw new Error("dijkstra does not allow negative edge weights. " +
                        "Bad edge: " + edge + " Weight: " + weight);
                }

                if (distance < wEntry.distance) {
                    wEntry.distance = distance;
                    wEntry.predecessor = v;
                    pq.decrease(w, distance);
                }
            };

            g.nodes().forEach(function (v) {
                var distance = v === source ? 0 : Number.POSITIVE_INFINITY;
                results[v] = {distance: distance};
                pq.add(v, distance);
            });

            while (pq.size() > 0) {
                v = pq.removeMin();
                vEntry = results[v];
                if (vEntry.distance === Number.POSITIVE_INFINITY) {
                    break;
                }

                edgeFn(v).forEach(updateNeighbors);
            }

            return results;
        }

    }, {"../data/priority-queue": 16, "../lodash": 20}],
    7: [function (require, module, exports) {
        var _ = require("../lodash"),
            tarjan = require("./tarjan");

        module.exports = findCycles;

        function findCycles(g) {
            return _.filter(tarjan(g), function (cmpt) {
                return cmpt.length > 1;
            });
        }

    }, {"../lodash": 20, "./tarjan": 14}],
    8: [function (require, module, exports) {
        var _ = require("../lodash");

        module.exports = floydWarshall;

        var DEFAULT_WEIGHT_FUNC = _.constant(1);

        function floydWarshall(g, weightFn, edgeFn) {
            return runFloydWarshall(g,
                weightFn || DEFAULT_WEIGHT_FUNC,
                edgeFn || function (v) {
                    return g.outEdges(v);
                });
        }

        function runFloydWarshall(g, weightFn, edgeFn) {
            var results = {},
                nodes = g.nodes();

            nodes.forEach(function (v) {
                results[v] = {};
                results[v][v] = {distance: 0};
                nodes.forEach(function (w) {
                    if (v !== w) {
                        results[v][w] = {distance: Number.POSITIVE_INFINITY};
                    }
                });
                edgeFn(v).forEach(function (edge) {
                    var w = edge.v === v ? edge.w : edge.v,
                        d = weightFn(edge);
                    results[v][w] = {distance: d, predecessor: v};
                });
            });

            nodes.forEach(function (k) {
                var rowK = results[k];
                nodes.forEach(function (i) {
                    var rowI = results[i];
                    nodes.forEach(function (j) {
                        var ik = rowI[k];
                        var kj = rowK[j];
                        var ij = rowI[j];
                        var altDistance = ik.distance + kj.distance;
                        if (altDistance < ij.distance) {
                            ij.distance = altDistance;
                            ij.predecessor = kj.predecessor;
                        }
                    });
                });
            });

            return results;
        }

    }, {"../lodash": 20}],
    9: [function (require, module, exports) {
        module.exports = {
            components: require("./components"),
            dijkstra: require("./dijkstra"),
            dijkstraAll: require("./dijkstra-all"),
            findCycles: require("./find-cycles"),
            floydWarshall: require("./floyd-warshall"),
            isAcyclic: require("./is-acyclic"),
            postorder: require("./postorder"),
            preorder: require("./preorder"),
            prim: require("./prim"),
            tarjan: require("./tarjan"),
            topsort: require("./topsort")
        };

    }, {
        "./components": 3,
        "./dijkstra": 6,
        "./dijkstra-all": 5,
        "./find-cycles": 7,
        "./floyd-warshall": 8,
        "./is-acyclic": 10,
        "./postorder": 11,
        "./preorder": 12,
        "./prim": 13,
        "./tarjan": 14,
        "./topsort": 15
    }],
    10: [function (require, module, exports) {
        var topsort = require("./topsort");

        module.exports = isAcyclic;

        function isAcyclic(g) {
            try {
                topsort(g);
            } catch (e) {
                if (e instanceof topsort.CycleException) {
                    return false;
                }
                throw e;
            }
            return true;
        }

    }, {"./topsort": 15}],
    11: [function (require, module, exports) {
        var dfs = require("./dfs");

        module.exports = postorder;

        function postorder(g, vs) {
            return dfs(g, vs, "post");
        }

    }, {"./dfs": 4}],
    12: [function (require, module, exports) {
        var dfs = require("./dfs");

        module.exports = preorder;

        function preorder(g, vs) {
            return dfs(g, vs, "pre");
        }

    }, {"./dfs": 4}],
    13: [function (require, module, exports) {
        var _ = require("../lodash"),
            Graph = require("../graph"),
            PriorityQueue = require("../data/priority-queue");

        module.exports = prim;

        function prim(g, weightFunc) {
            var result = new Graph(),
                parents = {},
                pq = new PriorityQueue(),
                v;

            function updateNeighbors(edge) {
                var w = edge.v === v ? edge.w : edge.v,
                    pri = pq.priority(w);
                if (pri !== undefined) {
                    var edgeWeight = weightFunc(edge);
                    if (edgeWeight < pri) {
                        parents[w] = v;
                        pq.decrease(w, edgeWeight);
                    }
                }
            }

            if (g.nodeCount() === 0) {
                return result;
            }

            _.each(g.nodes(), function (v) {
                pq.add(v, Number.POSITIVE_INFINITY);
                result.setNode(v);
            });

            // Start from an arbitrary node
            pq.decrease(g.nodes()[0], 0);

            var init = false;
            while (pq.size() > 0) {
                v = pq.removeMin();
                if (_.has(parents, v)) {
                    result.setEdge(v, parents[v]);
                } else if (init) {
                    throw new Error("Input graph is not connected: " + g);
                } else {
                    init = true;
                }

                g.nodeEdges(v).forEach(updateNeighbors);
            }

            return result;
        }

    }, {"../data/priority-queue": 16, "../graph": 17, "../lodash": 20}],
    14: [function (require, module, exports) {
        var _ = require("../lodash");

        module.exports = tarjan;

        function tarjan(g) {
            var index = 0,
                stack = [],
                visited = {}, // node id -> { onStack, lowlink, index }
                results = [];

            function dfs(v) {
                var entry = visited[v] = {
                    onStack: true,
                    lowlink: index,
                    index: index++
                };
                stack.push(v);

                g.successors(v).forEach(function (w) {
                    if (!_.has(visited, w)) {
                        dfs(w);
                        entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);
                    } else if (visited[w].onStack) {
                        entry.lowlink = Math.min(entry.lowlink, visited[w].index);
                    }
                });

                if (entry.lowlink === entry.index) {
                    var cmpt = [],
                        w;
                    do {
                        w = stack.pop();
                        visited[w].onStack = false;
                        cmpt.push(w);
                    } while (v !== w);
                    results.push(cmpt);
                }
            }

            g.nodes().forEach(function (v) {
                if (!_.has(visited, v)) {
                    dfs(v);
                }
            });

            return results;
        }

    }, {"../lodash": 20}],
    15: [function (require, module, exports) {
        var _ = require("../lodash");

        module.exports = topsort;
        topsort.CycleException = CycleException;

        function topsort(g) {
            var visited = {},
                stack = {},
                results = [];

            function visit(node) {
                if (_.has(stack, node)) {
                    throw new CycleException();
                }

                if (!_.has(visited, node)) {
                    stack[node] = true;
                    visited[node] = true;
                    _.each(g.predecessors(node), visit);
                    delete stack[node];
                    results.push(node);
                }
            }

            _.each(g.sinks(), visit);

            if (_.size(visited) !== g.nodeCount()) {
                throw new CycleException();
            }

            return results;
        }

        function CycleException() {
        }

    }, {"../lodash": 20}],
    16: [function (require, module, exports) {
        var _ = require("../lodash");

        module.exports = PriorityQueue;

        /**
         * A min-priority queue data structure. This algorithm is derived from Cormen,
         * et al., "Introduction to Algorithms". The basic idea of a min-priority
         * queue is that you can efficiently (in O(1) time) get the smallest key in
         * the queue. Adding and removing elements takes O(log n) time. A key can
         * have its priority decreased in O(log n) time.
         */
        function PriorityQueue() {
            this._arr = [];
            this._keyIndices = {};
        }

        /**
         * Returns the number of elements in the queue. Takes `O(1)` time.
         */
        PriorityQueue.prototype.size = function () {
            return this._arr.length;
        };

        /**
         * Returns the keys that are in the queue. Takes `O(n)` time.
         */
        PriorityQueue.prototype.keys = function () {
            return this._arr.map(function (x) {
                return x.key;
            });
        };

        /**
         * Returns `true` if **key** is in the queue and `false` if not.
         */
        PriorityQueue.prototype.has = function (key) {
            return _.has(this._keyIndices, key);
        };

        /**
         * Returns the priority for **key**. If **key** is not present in the queue
         * then this function returns `undefined`. Takes `O(1)` time.
         *
         * @param {Object} key
         */
        PriorityQueue.prototype.priority = function (key) {
            var index = this._keyIndices[key];
            if (index !== undefined) {
                return this._arr[index].priority;
            }
        };

        /**
         * Returns the key for the minimum element in this queue. If the queue is
         * empty this function throws an Error. Takes `O(1)` time.
         */
        PriorityQueue.prototype.min = function () {
            if (this.size() === 0) {
                throw new Error("Queue underflow");
            }
            return this._arr[0].key;
        };

        /**
         * Inserts a new key into the priority queue. If the key already exists in
         * the queue this function returns `false`; otherwise it will return `true`.
         * Takes `O(n)` time.
         *
         * @param {Object} key the key to add
         * @param {Number} priority the initial priority for the key
         */
        PriorityQueue.prototype.add = function (key, priority) {
            var keyIndices = this._keyIndices;
            key = String(key);
            if (!_.has(keyIndices, key)) {
                var arr = this._arr;
                var index = arr.length;
                keyIndices[key] = index;
                arr.push({key: key, priority: priority});
                this._decrease(index);
                return true;
            }
            return false;
        };

        /**
         * Removes and returns the smallest key in the queue. Takes `O(log n)` time.
         */
        PriorityQueue.prototype.removeMin = function () {
            this._swap(0, this._arr.length - 1);
            var min = this._arr.pop();
            delete this._keyIndices[min.key];
            this._heapify(0);
            return min.key;
        };

        /**
         * Decreases the priority for **key** to **priority**. If the new priority is
         * greater than the previous priority, this function will throw an Error.
         *
         * @param {Object} key the key for which to raise priority
         * @param {Number} priority the new priority for the key
         */
        PriorityQueue.prototype.decrease = function (key, priority) {
            var index = this._keyIndices[key];
            if (priority > this._arr[index].priority) {
                throw new Error("New priority is greater than current priority. " +
                    "Key: " + key + " Old: " + this._arr[index].priority + " New: " + priority);
            }
            this._arr[index].priority = priority;
            this._decrease(index);
        };

        PriorityQueue.prototype._heapify = function (i) {
            var arr = this._arr;
            var l = 2 * i,
                r = l + 1,
                largest = i;
            if (l < arr.length) {
                largest = arr[l].priority < arr[largest].priority ? l : largest;
                if (r < arr.length) {
                    largest = arr[r].priority < arr[largest].priority ? r : largest;
                }
                if (largest !== i) {
                    this._swap(i, largest);
                    this._heapify(largest);
                }
            }
        };

        PriorityQueue.prototype._decrease = function (index) {
            var arr = this._arr;
            var priority = arr[index].priority;
            var parent;
            while (index !== 0) {
                parent = index >> 1;
                if (arr[parent].priority < priority) {
                    break;
                }
                this._swap(index, parent);
                index = parent;
            }
        };

        PriorityQueue.prototype._swap = function (i, j) {
            var arr = this._arr;
            var keyIndices = this._keyIndices;
            var origArrI = arr[i];
            var origArrJ = arr[j];
            arr[i] = origArrJ;
            arr[j] = origArrI;
            keyIndices[origArrJ.key] = i;
            keyIndices[origArrI.key] = j;
        };

    }, {"../lodash": 20}],
    17: [function (require, module, exports) {
        "use strict";

        var _ = require("./lodash");

        module.exports = Graph;

        var DEFAULT_EDGE_NAME = "\x00",
            GRAPH_NODE = "\x00",
            EDGE_KEY_DELIM = "\x01";

// Implementation notes:
//
//  * Node id query functions should return string ids for the nodes
//  * Edge id query functions should return an "edgeObj", edge object, that is
//    composed of enough information to uniquely identify an edge: {v, w, name}.
//  * Internally we use an "edgeId", a stringified form of the edgeObj, to
//    reference edges. This is because we need a performant way to look these
//    edges up and, object properties, which have string keys, are the closest
//    we're going to get to a performant hashtable in JavaScript.

        function Graph(opts) {
            this._isDirected = _.has(opts, "directed") ? opts.directed : true;
            this._isMultigraph = _.has(opts, "multigraph") ? opts.multigraph : false;
            this._isCompound = _.has(opts, "compound") ? opts.compound : false;

            // Label for the graph itself
            this._label = undefined;

            // Defaults to be set when creating a new node
            this._defaultNodeLabelFn = _.constant(undefined);

            // Defaults to be set when creating a new edge
            this._defaultEdgeLabelFn = _.constant(undefined);

            // v -> label
            this._nodes = {};

            if (this._isCompound) {
                // v -> parent
                this._parent = {};

                // v -> children
                this._children = {};
                this._children[GRAPH_NODE] = {};
            }

            // v -> edgeObj
            this._in = {};

            // u -> v -> Number
            this._preds = {};

            // v -> edgeObj
            this._out = {};

            // v -> w -> Number
            this._sucs = {};

            // e -> edgeObj
            this._edgeObjs = {};

            // e -> label
            this._edgeLabels = {};
        }

        /* Number of nodes in the graph. Should only be changed by the implementation. */
        Graph.prototype._nodeCount = 0;

        /* Number of edges in the graph. Should only be changed by the implementation. */
        Graph.prototype._edgeCount = 0;

        /* === Graph functions ========= */

        Graph.prototype.isDirected = function () {
            return this._isDirected;
        };

        Graph.prototype.isMultigraph = function () {
            return this._isMultigraph;
        };

        Graph.prototype.isCompound = function () {
            return this._isCompound;
        };

        Graph.prototype.setGraph = function (label) {
            this._label = label;
            return this;
        };

        Graph.prototype.graph = function () {
            return this._label;
        };

        /* === Node functions ========== */

        Graph.prototype.setDefaultNodeLabel = function (newDefault) {
            if (!_.isFunction(newDefault)) {
                newDefault = _.constant(newDefault);
            }
            this._defaultNodeLabelFn = newDefault;
            return this;
        };

        Graph.prototype.nodeCount = function () {
            return this._nodeCount;
        };

        Graph.prototype.nodes = function () {
            return _.keys(this._nodes);
        };

        Graph.prototype.sources = function () {
            return _.filter(this.nodes(), function (v) {
                return _.isEmpty(this._in[v]);
            }, this);
        };

        Graph.prototype.sinks = function () {
            return _.filter(this.nodes(), function (v) {
                return _.isEmpty(this._out[v]);
            }, this);
        };

        Graph.prototype.setNodes = function (vs, value) {
            var args = arguments;
            _.each(vs, function (v) {
                if (args.length > 1) {
                    this.setNode(v, value);
                } else {
                    this.setNode(v);
                }
            }, this);
            return this;
        };

        Graph.prototype.setNode = function (v, value) {
            if (_.has(this._nodes, v)) {
                if (arguments.length > 1) {
                    this._nodes[v] = value;
                }
                return this;
            }

            this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);
            if (this._isCompound) {
                this._parent[v] = GRAPH_NODE;
                this._children[v] = {};
                this._children[GRAPH_NODE][v] = true;
            }
            this._in[v] = {};
            this._preds[v] = {};
            this._out[v] = {};
            this._sucs[v] = {};
            ++this._nodeCount;
            return this;
        };

        Graph.prototype.node = function (v) {
            return this._nodes[v];
        };

        Graph.prototype.hasNode = function (v) {
            return _.has(this._nodes, v);
        };

        Graph.prototype.removeNode = function (v) {
            var self = this;
            if (_.has(this._nodes, v)) {
                var removeEdge = function (e) {
                    self.removeEdge(self._edgeObjs[e]);
                };
                delete this._nodes[v];
                if (this._isCompound) {
                    this._removeFromParentsChildList(v);
                    delete this._parent[v];
                    _.each(this.children(v), function (child) {
                        this.setParent(child);
                    }, this);
                    delete this._children[v];
                }
                _.each(_.keys(this._in[v]), removeEdge);
                delete this._in[v];
                delete this._preds[v];
                _.each(_.keys(this._out[v]), removeEdge);
                delete this._out[v];
                delete this._sucs[v];
                --this._nodeCount;
            }
            return this;
        };

        Graph.prototype.setParent = function (v, parent) {
            if (!this._isCompound) {
                throw new Error("Cannot set parent in a non-compound graph");
            }

            if (_.isUndefined(parent)) {
                parent = GRAPH_NODE;
            } else {
                for (var ancestor = parent;
                     !_.isUndefined(ancestor);
                     ancestor = this.parent(ancestor)) {
                    if (ancestor === v) {
                        throw new Error("Setting " + parent + " as parent of " + v +
                            " would create create a cycle");
                    }
                }

                this.setNode(parent);
            }

            this.setNode(v);
            this._removeFromParentsChildList(v);
            this._parent[v] = parent;
            this._children[parent][v] = true;
            return this;
        };

        Graph.prototype._removeFromParentsChildList = function (v) {
            delete this._children[this._parent[v]][v];
        };

        Graph.prototype.parent = function (v) {
            if (this._isCompound) {
                var parent = this._parent[v];
                if (parent !== GRAPH_NODE) {
                    return parent;
                }
            }
        };

        Graph.prototype.children = function (v) {
            if (_.isUndefined(v)) {
                v = GRAPH_NODE;
            }

            if (this._isCompound) {
                var children = this._children[v];
                if (children) {
                    return _.keys(children);
                }
            } else if (v === GRAPH_NODE) {
                return this.nodes();
            } else if (this.hasNode(v)) {
                return [];
            }
        };

        Graph.prototype.predecessors = function (v) {
            var predsV = this._preds[v];
            if (predsV) {
                return _.keys(predsV);
            }
        };

        Graph.prototype.successors = function (v) {
            var sucsV = this._sucs[v];
            if (sucsV) {
                return _.keys(sucsV);
            }
        };

        Graph.prototype.neighbors = function (v) {
            var preds = this.predecessors(v);
            if (preds) {
                return _.union(preds, this.successors(v));
            }
        };

        /* === Edge functions ========== */

        Graph.prototype.setDefaultEdgeLabel = function (newDefault) {
            if (!_.isFunction(newDefault)) {
                newDefault = _.constant(newDefault);
            }
            this._defaultEdgeLabelFn = newDefault;
            return this;
        };

        Graph.prototype.edgeCount = function () {
            return this._edgeCount;
        };

        Graph.prototype.edges = function () {
            return _.values(this._edgeObjs);
        };

        Graph.prototype.setPath = function (vs, value) {
            var self = this,
                args = arguments;
            _.reduce(vs, function (v, w) {
                if (args.length > 1) {
                    self.setEdge(v, w, value);
                } else {
                    self.setEdge(v, w);
                }
                return w;
            });
            return this;
        };

        /*
         * setEdge(v, w, [value, [name]])
         * setEdge({ v, w, [name] }, [value])
         */
        Graph.prototype.setEdge = function () {
            var v, w, name, value,
                valueSpecified = false;

            if (_.isPlainObject(arguments[0])) {
                v = arguments[0].v;
                w = arguments[0].w;
                name = arguments[0].name;
                if (arguments.length === 2) {
                    value = arguments[1];
                    valueSpecified = true;
                }
            } else {
                v = arguments[0];
                w = arguments[1];
                name = arguments[3];
                if (arguments.length > 2) {
                    value = arguments[2];
                    valueSpecified = true;
                }
            }

            v = "" + v;
            w = "" + w;
            if (!_.isUndefined(name)) {
                name = "" + name;
            }

            var e = edgeArgsToId(this._isDirected, v, w, name);
            if (_.has(this._edgeLabels, e)) {
                if (valueSpecified) {
                    this._edgeLabels[e] = value;
                }
                return this;
            }

            if (!_.isUndefined(name) && !this._isMultigraph) {
                throw new Error("Cannot set a named edge when isMultigraph = false");
            }

            // It didn't exist, so we need to create it.
            // First ensure the nodes exist.
            this.setNode(v);
            this.setNode(w);

            this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);

            var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);
            // Ensure we add undirected edges in a consistent way.
            v = edgeObj.v;
            w = edgeObj.w;

            Object.freeze(edgeObj);
            this._edgeObjs[e] = edgeObj;
            incrementOrInitEntry(this._preds[w], v);
            incrementOrInitEntry(this._sucs[v], w);
            this._in[w][e] = edgeObj;
            this._out[v][e] = edgeObj;
            this._edgeCount++;
            return this;
        };

        Graph.prototype.edge = function (v, w, name) {
            var e = (arguments.length === 1
                ? edgeObjToId(this._isDirected, arguments[0])
                : edgeArgsToId(this._isDirected, v, w, name));
            return this._edgeLabels[e];
        };

        Graph.prototype.hasEdge = function (v, w, name) {
            var e = (arguments.length === 1
                ? edgeObjToId(this._isDirected, arguments[0])
                : edgeArgsToId(this._isDirected, v, w, name));
            return _.has(this._edgeLabels, e);
        };

        Graph.prototype.removeEdge = function (v, w, name) {
            var e = (arguments.length === 1
                    ? edgeObjToId(this._isDirected, arguments[0])
                    : edgeArgsToId(this._isDirected, v, w, name)),
                edge = this._edgeObjs[e];
            if (edge) {
                v = edge.v;
                w = edge.w;
                delete this._edgeLabels[e];
                delete this._edgeObjs[e];
                decrementOrRemoveEntry(this._preds[w], v);
                decrementOrRemoveEntry(this._sucs[v], w);
                delete this._in[w][e];
                delete this._out[v][e];
                this._edgeCount--;
            }
            return this;
        };

        Graph.prototype.inEdges = function (v, u) {
            var inV = this._in[v];
            if (inV) {
                var edges = _.values(inV);
                if (!u) {
                    return edges;
                }
                return _.filter(edges, function (edge) {
                    return edge.v === u;
                });
            }
        };

        Graph.prototype.outEdges = function (v, w) {
            var outV = this._out[v];
            if (outV) {
                var edges = _.values(outV);
                if (!w) {
                    return edges;
                }
                return _.filter(edges, function (edge) {
                    return edge.w === w;
                });
            }
        };

        Graph.prototype.nodeEdges = function (v, w) {
            var inEdges = this.inEdges(v, w);
            if (inEdges) {
                return inEdges.concat(this.outEdges(v, w));
            }
        };

        function incrementOrInitEntry(map, k) {
            if (_.has(map, k)) {
                map[k]++;
            } else {
                map[k] = 1;
            }
        }

        function decrementOrRemoveEntry(map, k) {
            if (!--map[k]) {
                delete map[k];
            }
        }

        function edgeArgsToId(isDirected, v, w, name) {
            if (!isDirected && v > w) {
                var tmp = v;
                v = w;
                w = tmp;
            }
            return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +
                (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);
        }

        function edgeArgsToObj(isDirected, v, w, name) {
            if (!isDirected && v > w) {
                var tmp = v;
                v = w;
                w = tmp;
            }
            var edgeObj = {v: v, w: w};
            if (name) {
                edgeObj.name = name;
            }
            return edgeObj;
        }

        function edgeObjToId(isDirected, edgeObj) {
            return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);
        }

    }, {"./lodash": 20}],
    18: [function (require, module, exports) {
// Includes only the "core" of graphlib
        module.exports = {
            Graph: require("./graph"),
            version: require("./version")
        };

    }, {"./graph": 17, "./version": 21}],
    19: [function (require, module, exports) {
        var _ = require("./lodash"),
            Graph = require("./graph");

        module.exports = {
            write: write,
            read: read
        };

        function write(g) {
            var json = {
                options: {
                    directed: g.isDirected(),
                    multigraph: g.isMultigraph(),
                    compound: g.isCompound()
                },
                nodes: writeNodes(g),
                edges: writeEdges(g)
            };
            if (!_.isUndefined(g.graph())) {
                json.value = _.clone(g.graph());
            }
            return json;
        }

        function writeNodes(g) {
            return _.map(g.nodes(), function (v) {
                var nodeValue = g.node(v),
                    parent = g.parent(v),
                    node = {v: v};
                if (!_.isUndefined(nodeValue)) {
                    node.value = nodeValue;
                }
                if (!_.isUndefined(parent)) {
                    node.parent = parent;
                }
                return node;
            });
        }

        function writeEdges(g) {
            return _.map(g.edges(), function (e) {
                var edgeValue = g.edge(e),
                    edge = {v: e.v, w: e.w};
                if (!_.isUndefined(e.name)) {
                    edge.name = e.name;
                }
                if (!_.isUndefined(edgeValue)) {
                    edge.value = edgeValue;
                }
                return edge;
            });
        }

        function read(json) {
            var g = new Graph(json.options).setGraph(json.value);
            _.each(json.nodes, function (entry) {
                g.setNode(entry.v, entry.value);
                if (entry.parent) {
                    g.setParent(entry.v, entry.parent);
                }
            });
            _.each(json.edges, function (entry) {
                g.setEdge({v: entry.v, w: entry.w, name: entry.name}, entry.value);
            });
            return g;
        }

    }, {"./graph": 17, "./lodash": 20}],
    20: [function (require, module, exports) {
        /* global window */

        var lodash;

        if (require) {
            try {
                lodash = require("lodash");
            } catch (e) {
            }
        }

        if (!lodash) {
            lodash = window._;
        }

        module.exports = lodash;

    }, {"lodash": undefined}],
    21: [function (require, module, exports) {
        module.exports = '1.0.1';

    }, {}]
}, {}, [1]);

redpajama_set_name: RedPajamaGithub


Optimism gives us energy; it makes our efforts feel worthwhile. In the end it is rewarded because even though some of these efforts will fail, others will succeed, and we can't know ahead of time which are which. When we are optimistic we are happier and better company—we help other people to be happy and hopeful, too.
Get an junior high research paper outline excellent an optimistic person essays paper. com take every "write my essay" request seriously and do the best job on your essay, term paper, or research papers.


text:
quantum light
News tagged with quantum light
Quantum physicists determine how to control two quantum light sources rather than one
In a new breakthrough, researchers at the University of Copenhagen, in collaboration with Ruhr University Bochum, have solved a problem that has caused quantum researchers headaches for years. The researchers can now control ...
Researchers create 2D quantum light source from layered materials
Recent advances in spontaneous parametric down-conversion (SPDC)-based quantum light sources based on two-dimensional layered materials have been made by a team led by Prof. Ren Xifeng from the University of Science and Technology ...
Researchers explore quantum effects of light on the creation of Rydberg states in hydrogen molecules
Rydberg atoms and molecules are characterized by having one or more electrons in highly excited bound states. Such atoms and molecules are said to be in "Rydberg states" and are also called "hollow" atoms and molecules. Rydberg ...
High-performance visible-light lasers that fit on a fingertip
As technologies keep advancing at exponential rates and demand for new devices rises accordingly, miniaturizing systems into chips has become increasingly important. Microelectronics has changed the way we manipulate electricity, ...
A better photon detector to advance quantum technology
A team of researchers has developed an on-chip photon-counting device that could significantly advance numerous applications of quantum technology.
Researchers develop a light source that produces two entangled light beams
Scientists are increasingly studying quantum entanglement, which occurs when two or more systems are created or interact in such a manner that the quantum states of some cannot be described independently of the quantum states ...
Advances in understanding the quark substructure of scalars
At this stage in the evolution of the universe (about 14 billion years after the big bang) there are four fundamental forces in action that cause interactions among the constituents of matter.
Pulses driven by artificial intelligence tame quantum systems
It's easy to control the trajectory of a basketball: Just apply mechanical force coupled with human skill. But controlling the movement of quantum systems such as atoms and electrons is much more challenging, as these minuscule ...
Transporting of two-photon quantum states of light through a phase-separated Anderson localization optical fiber
Invented in 1970 by Corning Incorporated, low-loss optical fiber became the best means to efficiently transport information from one place to another over long distances without loss of information. The most common way of ...
Quantum algorithms save time in the calculation of electron dynamics
Researchers have investigated the capability of known quantum computing algorithms for fault-tolerant quantum computing to simulate the laser-driven electron dynamics of excitation and ionization processes in small molecules. ...


The Flower Factor hosted a friendly competition between a few hand picked floral designers for creating themed floral designs! The theme was to create arrangements that will inspire a friend to live life to the fullest, using the themes "Live Like a Flower" and "Live Colorfully- Dare to be Different".
We can only appreciate the beautiful designs created by the award winning florists that were selected to compete. But most of all we hope that these designs will inspire you to create some unique and wonderful designs for your flowers shop!
For more information visit www.aboutflowersblog.com and get involved with other industry professionals!
This entry was posted in Flowers Express on May 13, 2014 by Main Wholesale Florist.


The series on Glendale Creek continues Thursday – this time it's the big topic, Beavers.
I attended the initial meeting Feb. 18 and was impressed by the format of the evening and the series as a whole. The commissioners and staff, along with WSU Extension and Whidbey Watershed Stewards, have put together an informative, interesting, inspiring and inclusive program. I have to admit that county meetings have not typically been high on my list of fun ways to spend an evening – even back when I was a reporter for the Whidbey News Times. These meetings are significantly different and really enjoyable. I'm looking forward to Thursday night.
Presentation slides from Shane Cherry's talk about the geomorphology of the creek are available on the Island County website and Friends of Glendale has posted podcasts of the talks. Both are great resources.
One thing I'm especially looking forward to is hearing from Michael Pollock. I first heard of him from Heidi Perryman, who wrote to me after reading a recent Tidal Life column. Heidi is the founder of Worth A Dam an organization formed to save the beavers of Alhambra Creek in Martinez, California. The group has done wonders, coming up with creative ways for humans and beavers to coexist. The town has embraced the effort and now has an annual Beaver Festival.
That last date is going to serve as incentive for me to get my taxes done ahead of filing day.


Dorothea Puente's locally famous duplex at 1426 F Street in Sacramento has sold for $215,000. This foreclosure property originally listed at $309,800 on 02/26/10 and eventually went to auction after a series of price decreases and over 150 days of market exposure.
This property has a notorious history (can you say "stigma"?) from the 1980s when seven bodies were found on the premises buried in the backyard. Dorothea Puente ran a "boarding house" at this location where she drugged and murdered tenants to cash their social security checks.
More information? I wrote previously about this property twice: Would you buy Dorothea Puente's house? and Dorothea Puente's duplex is still on the market. Any takers? The Sacramento Bee published a Puente article yesterday and KCRA did a story too.


The Center for Oral and Maxillofacial Surgery at Countryside is open Monday, Tuesday, Thursday, and Friday from 7:30 AM to 5:00 PM. Lunch is from 11:45 AM to-12:45 PM. We are closed on Wednesdays. We will schedule your appointment as promptly as possible. If you are in pain or have an emergency situation, every attempt will be made to see you that day.
We try our best to stay on schedule to minimize your wait in the office. Due to the fact that Dr. Schirmer provides many types of dental services, various circumstances may lengthen the time allocated for a procedure. Emergency cases can also arise and cause delays. We appreciate your understanding and patience.
Please call us at The Center for Oral and Maxillofacial Surgery Phone Number 513 932-9991 with any questions or to schedule an appointment.


text:
Japan Beef Acceptance Applauded
North American Meat Association today applauded the announcement by United States Trade Representative Ron Kirk and United States Agriculture Secretary Tom Vilsack that exports of U.S. beef and beef products to Japan will soon be expanded.
Under new terms that enter into effect on February 1, 2013, Japan will permit the import of beef from cattle less than 30 months of age, among other steps.
"This announcement is well-deserved and long overdue," said NAMA CEO Barry Carpenter. "Accolades go to USDA and USTR for paving the way for expanded exports of U.S. beef and beef products to Japan after these many years."
Japan's Market to U.S. Beef was closed in 2003 after the detection of bovine spongiform encephalopathy (BSE). However, the market soon reopened to permit the import of beef from cattle less than 20 months of age. The current improvement in trade terms is the result of years of scientific research, herd surveillance and trade negotiations.
Based on a risk assessment released last October, Japan began consultations to revise the import requirements. Importantly, the new terms are closely aligned with international standards set by the World Organization for Animal Health (OIE).


text:
Saturday, October 22, 2022 8:00 AM to 4:00 PM EDT
First round starts at 9:00 am sharp.
2499 Thomas Jefferson Drive
McNair PTA
mcnairchess@gmail.com
October 22, 2022 McNair Chess Tournament
Our first McNair Chess Tournament for the 2022 - 2023 school year is scheduled for Saturday, October 22, 2022.
MAXIMUM ENTRIES 170
Pre-registration closes on Thursday, October 20, 2022.
The early pre-registration fee through Tuesday, October 18, 2022 is $35.00 per chess player.
The late pre-registration fee for Wednesday, October 19, 2020 through Thursday, October 20, 2022 is $40.00 per chess player.
On-site registrations will close at 8:30 am on Saturday, October 22, 2020. The on-site registration fee is $45.00 per chess player.
No Email/Phone Registrations allowed including the day of registration OR after the cut-off of the Online registrations.
NOTE: If you need a bye for the later rounds - please notify us prior to the beginning of round 2.
Doors open at 8:00 am for on-site registrations. On-site registration closes at 8:30 am. The first round starts at 9:00 am.
Four (4) sections - K-3, K-5, K-8, Open Quads.
Students in grades K-8 who wish to play in Open Quads must have a 1300+ rating.
Adults are welcome to play in the Open Quads section.
Participants must have a USCF ID - to register: https://secure2.uschess.org/webstore/member.php
NOTE: REMINDER: Cancellations are subject to a $3.00 / player handling fee.
NOTE: Participants should use the back / cafeteria doors - the front doors will not be open.
NOTE: Our chess tournaments are subject to Fairfax County Public School policies. In case of inclement weather - please check www.fcps.edu.
2022-10-22T08:00:00-0400 2022-10-22T16:00:00-0400 October 2022 McNair Chess Tournament 2499 Thomas Jefferson Drive, Herndon, VA, 20171, US http://events.r20.constantcontact.com/register/event?llr=t8xtzecab&oeidk=a07ejellomn5a6571e6


text:
Q: Android button looses "pressed" state when popup or dialog shows I need an button, wich can bee in "pressed" and "unpressed" state set programmatically, i use method .setPressed(true), and button keeps this state until a popup menu or action menu showed, then button goes to "unpressed" state.
Is this a bug in android or something else? how can i keep "pressed" state of button until required action taken to "unpress"?

redpajama_set_name: RedPajamaStackExchange


text:
Q: Xcode 5 error of value types I am getting this warnings when i open code in Xcode 5.1
"Values of type 'NSInteger' should not be used as format arguments; add an explicit cast to 'long' instead"
Why we need to cast NSInteger into long?

A: You get this warning if you compile on iOS (64-bit), because on that platform NSInteger is defined as long and is a 64-bit integer. The %i format, on the other hand, is for int, which is 32-bit. So the format and the actual parameter do not match in size.
Since NSInteger is 32-bit or 64-bit, depending on the platform, the compiler recommends to add a cast to long generally.
Update: Since iOS 7 supports 64-bit now as well, you can get the same warning when compiling for iOS.


Look up shocker in Wiktionary, the free dictionary.
Shockers, the nickname of Wichita State University athletic teams, a contraction of the original term "Wheatshockers"
This disambiguation page lists articles associated with the title Shocker.
This page was last edited on 27 October 2015, at 10:36 (UTC).


... sacks Texas had against Oklahoma quarterback Baker Mayfield during the Longhorns' 24-17 upset victory Saturday. Brandon Wade Star-Telegram.
According to a BBC report, the app "allows users to broadcast their messages to an unlimited number of members via their own Telegram "channel".".
Rep. Paul Ryan, R-Wis., center, and Rep. Trey Gowdy, R-S.C., arrive for a House GOP meeting on Capitol Hill in Washington, Friday, Oct. 9, 2015.
By John Dufresne, directed by Linda Oroszko. Presented by Worcester County Light Opera Company at the Grandview Playhouse, 21 Grandview Ave.


Your kids don't like your new partner's kids; your new partner's kids don't seem to respect your authority; and all the stress is starting to make you rethink the whole thing.
The steps are easy; it's the repetition that matters. Make these habits and your relationship will be better for it.


text:
Cointelegraph Team
Crypto can erode tax base, Russia's tax boss says
The Russian Federal Taxation Service (FTS) is actively monitoring the cryptocurrency market to prevent tax evasion, FTS head Daniil Egorov said.
Cryptocurrencies can potentially cause "significant erosion" to Russia's tax base, Egorov argued in a Monday interview with the local publication RBC.
But cryptocurrency transactions are still traceable and should be reported, the official said, adding that the FTS is ready to deploy automated tracking systems to process big data volumes.
"When you get into the digital space, you still leave a trail somewhere. And it's a matter of time before this trail is identified," Egorov declared.
The official also noted that the FTS is now coming up with ways of responding to crypto tax evasion practices as the authority looks to curb such activity rather than just to identify it. "We would like to find solutions that shut down a problem as a phenomenon rather than just identifying actions by a specific player," Egorov added.
The Russian State Duma approved a bill on cryptocurrency taxation in the first reading in February 2021, requiring residents to report crypto transactions of a total amount exceeding $7,800 per year. In order to move forward with the second reading, lawmakers decided to assign a responsible committee, the State Duma Committee on Budget and Taxes, in mid-October.
According to Sergei Khitrov, founder of the Russian cryptocurrency event Blockchain Life, Russian crypto businesses could potentially generate as much as $4 billion worth of taxes per year. According to him, the local crypto community has so far demonstrated a "complete failure" to understand how to pay taxes on crypto.
The news comes as American lawmakers fight back against changes to tax reporting rules for crypto transactions over $10,000 in the newly passed infrastructure bill. The bill was initially approved by the Senate in August, which was met with a proposal for a compromise amendment by a group of six senators, including pro-Bitcoin (BTC) Senator Cynthia Lummis


text:
91. The Magic of Loving What Is
BLOG 91— (present reflections tied to March 2001 journal entries about my healing journey)—The sun paints the sky in bright pink, orange, and grey-blue streaks as it sets here in New Mexico. Our Sandia mountains reflect the evening like the inside of a watermelon. And on the weekends, after a week of finding play and joy in my work, my shared home, Casa de Duende, becomes a place of retreat with late breakfast on the patio, Friday nigh t movies, and walks above fallen leaves with my love.
Years ago, in my late twenties, when I first came here to New Mexico, I was so much more restless than today. I arrived from the East Coast eager to connect spiritually and to experience magic…to see some apparition appear from behind a burning bush, or to discover I could fly, or at least soar as spirit to places beyond the physical and material limitations that were so rigidly held on the East Coast. I was ready for anything, as long as it was grandiose and magical. What happened though, was anything but this.
In my search for magic, I became broken. The greater my hunger for magic, for something outside of me to fill the emptiness inside, the more I broke. In my journal of March of 2001, I reflected on this search for magic, and how, five year s prior to that, a strong sense of longing to feel life in a big way, to feel spirit, to feel alive, to fill up from the outside in, led to my injury. In my journal of that spring, I wrote, "I spent all my time chasing magic, when really what I wanted was to open my heart and feel. My heart was the universe and I wanted to be able to tune into my heart, to all that I had felt so numb toward."
In that March, 2001 journal entry, I concluded that "If I believe my heart has a voice and something to express, then there will be magic in my life that will only grow."
Five years before my journal entry, in my late twenties—more than 20 years ago—I was called to New Mexico, where I landed, uncertain as to why. What I do know is that back then I longed so desperately for that magic and spiritual connection—that connection to that sense of God I had no name for back then. Today, as I look around me, I see the magic in front of me. It's in my heart, and my ability to feel and receive the beauty around me. It's in watching the sunset, in sharing my life with my love and partner, in many walks and moments with friends, in the laughter, play, and celebration of our lives together.
As I watch this modern world and its elites wielding for more power and money, I'm saddened by how much we've neglected this life, our earth, and its magic that weaves a colorful fabric into our lives. In our need to fill up with more, to pour more into the emptiness, we allow the forests to burn, temperatures to rise, floods to clean away the excess of all that we live. We neglect the poor, those who have so little and need community and care, and in doing so, bit by bit, we destroy our common home.
Maybe opening our hearts and learning to feel and receive the beauty around us, and to love each other and what we have just a bit more, could be what saves us. Maybe, instead of looking for magic and more to fill the emptiness, we wake up to ourselves, to our beating hearts longing to feel again this love that is here and now.
2001, a journey of the spirit, Albuquerque, beating hearts, believe in your heart, Child of Duende, East Coast, emptiness, God, Healing, hope in a modern world, journal, learn to feel, Love, loving life, magic, March, my love, New England, New Mexico, Nina Duende, our common home, Sandia Mountains, searching for magic, sunsets	10 Comments
90. Authentic Power Grows our Roots
BLOG 90— (present reflections tied to March 2001 journal entries about my healing journey)—What is power? How do feelings of powerless impact our connection to each other and the earth?
As a child we don't know what power or being in our power means. We come into the world needing food, water, love…all the basics…and we rely on those who raise us to provide these necessities so we can grow strong. Some of us are more fortunate than others. I see many of my students come from families who nourish them well, yet others struggle to grow in what seems like an asphalt of a childhood.
As part of my journey of healing from pain, when I lived in New England in 2001, I had to look at my own feelings of powerless. The pain in my body and my unconscious need to not "be well" masked what I soon saw as my inability to feel powerful and strong inside myself. As a young adult in her early thirties, I had to face my own feelings of inadequacy that I had developed as a child and find my own power.
"When someone takes your power away as a child, doesn't let you be wild—to cry, to scream, even fight some if needed—they are taking away your connection to life," I wrote in 2001 in my journal, reflecting on what happened to me, and happens for so many of us (whether intended or not) when we are not given the room to experience our own nature as children. "When emotions are not acknowledged, it takes away a piece of our humanity and our connection to the earth… our natur al connection to the earth. It cuts us off from source, like plants attempting to grow from above the ground."
"Our wildness, our expression of ourselves, is our earth voice," I added. "We are the energy of the earth. She is mirrored in ourselves. We cannot be civilized without the wild. The light without the shadow will destroy us."
Today, as we live through immense climate change, extreme politics and societal tensions, I think it's important we learn to become fully empowered, to be our authentic selves…not just a cog in the wheel, an element of production, or a number in a system. The earth needs us now, as we do her, and it's time we believe in our unique expression of life. For we are here to care for her, for that which sustains us, and not continue to give our power away to those "in power" who prefer to separate us from each other and the earth. We must reawaken our own roots, to belong, once again, to the earth and all that makes life grow.
But how do we come home to our true power, our tr ue selves? How do we stop giving our power to others and stand inside ourselves with love?
We begin by being honest, in facing our fears and those people or energies inside of us that once denied us permission to express our voice. And then we listen—as I had to do during years of healing—and make room for that unique seed inside us to grow and find its connection back to life and it's blessed place in this magical matrix.
2001, a journey of the spirit, being in our power, Child of Duende, Childhood, climate change, disempowerment, duende, empowerment, free, giving ourselves permission, healing journey, honoring life, honoring the earth, life, Love, Michelle Adam, New England, Nina Duende, not giving our power to those in power, novel, our authentic selves, pain, political extremes, power, wildness, writer	4 Comments
88. My Soul is Tender after Spain
BLOG 88—(present reflections tied to February 2001 journal entries about my healing journey and my return from presenting my novel in Spain)—I returned almost a month ago from Spain, from a book tour with my novel in Spanish, Niña Duende: Un Viaje del Espíritu, presented in four cities (Madrid, Murcia, Málaga, and Granada) and six v enues. My journey to Spain was a homecoming, a return to the land that had shown me my soul. And this time I came with my novel, written while in the U.S., a kind of exile from that home.
My soul is tender now, not just because my gift as a writer and healer and as the person I am were beautifully received, but because, upon returning home to New Mexico, I now feel a truth I wrestled with almost 20 years ago, when healing from hip pain in New England.
Back then, while in pain and learning to listen to my soul's voice, I wrote about feeling angry at being asked to "unmask" myself. I had worked with shamans from Ecuador, translating for them in events, and one had told me, ever so subtly, that maybe my whole journey of healing was about become soft again, about softening, which for me was a kind of "unmasking".
Me as a little girl in Spain (front, left)
Twenty years ago, that meant becoming that little, vulnerable girl I had once been. "How dare you ask me to soften when I've worked so hard to gain the power, strength, and courage I have had to survive," I wrote in my journal in 2001. "I feel the younger person I was didn't have any power or value, and that all the power and value I had, I had to build from the ashes of my father's blaze."
It's especially interesting reading those words of long ago, when today, a month since returning from Spain, I awoke from a dream that resonated with what I had written. I dreamed I was in high school again, and I had just come from Spain to the U.S. and felt extremely alone inside those school walls. In my dream, I felt what it had been like back then, entering into an environment that had been so harsh and foreign to me. And I woke up feeling the angst and trauma of it all, while also getting how I had coped back then by shutting down, becoming depressed, numb, and disconnected because it wasn't safe to feel the pain of being a stranger among all these students I was meant to connect with, yet couldn't. I got how a part of me had, as they say in the shamanic world, lost a part of my soul when I came to the U.S. and needed to survive.
As I lay in bed this morning, feeling all of this, I got so clearly that this is so much what happens to all of us. Every one of us experiences different traumas that we need to survive, and in order to do so, a part of us leaves, shuts down, disappears. We keep on going, appear normal to the outside world, but later, somewhere down the road, we pay the price, because a part of us is locked down, gone, and without this part, we are not whole. And then we hit some big wall in life—as I did with my injury and not being able to walk—and then the journey backwards, toward those moments in which we shut off and dissociate, begins. Because we must go back and retrieve those parts of us that we left somewhere else while we were busy surviving.
This morning, after my dream, I meditated, and I felt my soul's tenderness. I really felt it. Because I got so clearly that all the places in our lives where we stop feeling, where we have to override our soul's tenderness, our soul's beautiful soft body that is as light and agile as the wind or a feather, need to be felt. We need to feel these moments where we weren't really present, where we checked out, and we need to check back in, with immense compassion for our soul's beauty and tenderness. We need to feel, and feel, and feel again, and less the fright we felt, and more that soft, vulnerable part of us that we shut down yet wants to be seen…that truly human, big-hearted part of us that we need with us so we can be our full soul-selves in our bodies. Then, and only then, can we experience true joy for living.
Ironically, when I came back from Spain this time, I met up with a woman who had been in my high school class in New Jersey, yet was now living in New Mexico. And what I discovered is that we had a lot in common and were very much on a similar spiritual path. Yet this time, unlike so many other times I had returned to the U.S. from Spain, I was able to feel that child I once had been who had gotten lost in the U.S. I returned to New Mexico to make peace with that trauma I had experienced as a child when I had originally come to the U.S. from Spain. And now, that tenderness of my soul, that soft body, can more fully come home inside me.
I see now, that when I, or any of us, feel that sense of agitation, that disconnect in our lives, that it's really a call to feel that tenderness that is our essence, and inside that space, to feel those parts of ourselves that were left behind and that long to return, to be seen, to be felt, to be whole within us again.
My Novel, Child of Duende: A Journey of the Spirit, is a story of returning home to the earth inside and all around us. It's now available in Spanish as Niña Duende: Un Viaje del Espiritu, that's available on Amazon at Amazon Page or at www.michelleadam.net. It can be ordered at a local bookstore or directly from me (for those outside of the U.S.) as well. Also, watch a brief video on "duende", "the spirit of the earth" in Spanish: https://youtu.be/FaRK7wOHcJU, and in English: YouTube Video
2001, author, blog, book tour, Child of Duende, coming home, dreams, duende, Earth, feeling, Granada, happy, Healing, hip pain, humanity, insights, inspiration, journal, life, Madrid, malaga, meditation, Murcia, New England, Nina Duende, novel, reflections, returning home, sharing, soul, Spain, Spanish, thanks, travel, truth	2 Comments


GMC-I Prosys ACP1005/4 Micro-Flex Current Probe with BNC connection suitable for Data Loggers, Oscilloscopes & Power Quality Analyzers.
What we like: The GMC-I Prosys ACP1005/4 AC Micro-Flex Current Probe with its selectable current range at 10, 100 or 1000A is ideally suitable for use with Data Loggers, Oscilloscopes & Power Quality Analyzers and is fitted with a standard BNC connector it covers a frequency range of 20Hz to 10kHz and a max conductor diameter of 100mm and offers excellent accuracy and long battery life.
The GMC-I Prosys ACP1005/4 Micro-Flex Current Probe offer a compact profile while at the same time offering a triple current range 10/100/1000A it's made possible by increased output sensitivity gained from the latest developments in flexible Rogowski coil technology. This flexible micro AC current probe is suitable for non-intrusive measurements in commercial electrical and heavy industrial systems. Special applications include; Load profile monitoring, general energy consumption testing and power quality analysis. With its smaller coil diameter and flexible compact link design its profile is ideal for confined access such as that found behind incoming utility cables and between switchgear busbars.
The GMC-I Prosys ACP1005/4 Micro-Flex Current Probe complies with EN61010 Safety Standard to the highest safety category at CAT IV 600V/CAT III 1000V.


text:
Stepfather of babysitter charged with murdering toddler says 'she didn't do it'
05/20/2018 10:02 pm PDT
WZTV
Kayla Pauze
By Matt Alvarez, WZTV
COTTONTOWN, Tenn. -- (WZTV) -- The Tennessee Bureau of Investigation says on March 26, 25-year-old Kayla Pauze inflicted an injury that resulted in two-year-old Aiden Hale's death on March 29.
The TBI hasn't released exactly how the boy died, but did say the incident happened on Cummings Lane in Cottontown in Sumner County.
Today, James Haley, Kayla Pauze's stepfather of 19 1/2 years sat down with Fox 17 News:
Matt: What do you believe happened on March 26th?
Haley: I wish I can tell what you happened on march 26th, I think a horrible accident happened, and I know in my heart my daughter could not do this, there's just no way, everyone that knows my daughter, anyone that has seen my daughter with children and her own child, would know my daughter could not do this, there is no way," Haley said.
"We're talking about a young lady that won't kill a fly or a spider in the house she'll pick it up and take it out, she's not a murderer, she's not someone that would hurt anybody," Haley said.
Matt: What do you know though, about how Aiden died?
Haley: I don't because I wasn't there, you weren't there, I do know that it's a very sad tragedy, it truly is I feel for the family I do, I truly do, I've met Aiden myself several times, my daughter watched him, my daughter helped Aiden, she truly did, taught him colors, taught him numbers, she was trying to help aiden the whole time, he had developmental issues and she tried to help him she's never hurt himself loved that child.
Matt: You've spoke with your daughter in jail yes? What has she said to you?
Haley: I didn't do this dad, I did not do this, did you ask her what happened? She said that Aiden went into a seizure.
FULL STORY: Stepfather of babysitter charged with murdering toddler says 'she didn't do it' - WZTV
#Tennessee #WZTV


text:
Besuden ist der Familienname folgender Personen:

 Eike Besuden (* 1948), deutscher Dokumentarfilmregisseur
 Heinrich Besuden (1924–2019), deutscher Mathematikdidaktiker

redpajama_set_name: RedPajamaWikipedia


Over the years, we have groomed more than 330,000 graduates, many of whom have become leaders in their professional fields, contributing their knowledge and expertise to the building and development of Hong Kong's thriving economy. We look forward to welcoming you to the PolyU community and hope it will be an empowering experience for you which will further enhance your potentials for the future.
Students studying at Hong Kong Polytechnic University enroll for engineering courses. Course information can be found on the HKPU website.
Additional information about housing options can be found on the University's website.


text:
package ca.eandb.util.auth;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.security.NoSuchAlgorithmException;
import java.util.Map;

import javax.security.auth.callback.NameCallback;
import javax.security.auth.callback.PasswordCallback;
import javax.security.auth.callback.UnsupportedCallbackException;
import javax.security.auth.login.FailedLoginException;
import javax.security.auth.login.LoginException;

import ca.eandb.util.StringUtil;

/**
 * A LoginModule that reads user names, password hashes, and roles
 * from a colon delimited file.
 *
 * The file must be formatted as follows.  There should be one line for each
 * user.  The line should have the form:
 *
 * name:password:salt:[:role1...:rolen]
 *
 * @author Brad Kimmel
 */
public final class FileLoginModule extends AbstractLoginModule {

  /** The File in which passwords are stored. */
  private File passwordFile = null;

  /* (non-Javadoc)
   * @see ca.eandb.util.auth.AbstractLoginModule#initialize(java.util.Map, java.util.Map)
   */
  @Override
  protected void initialize(Map<String, ?> sharedState, Map<String, ?> options) {
    String fileName = (String) options.get("file");
    passwordFile = new File(fileName);
  }

  /* (non-Javadoc)
   * @see javax.security.auth.spi.LoginModule#login()
   */
  public boolean login() throws LoginException {
    NameCallback user = new NameCallback("Login:");
    PasswordCallback pass = new PasswordCallback("Password:", false);
    PasswordEncryptionService enc = new PasswordEncryptionService();

    try {
      callback(user, pass);

      BufferedReader reader = new BufferedReader(new FileReader(passwordFile));

      while (reader.ready()) {
        String[] fields = reader.readLine().split(":");
        if (fields[0].equals(user.getName())) {
          String loginPassword = new String(pass.getPassword());
          byte[] salt = StringUtil.hexToByteArray(fields[2]);
          byte[] realDigest = StringUtil.hexToByteArray(fields[1]);
          if (enc.authenticate(loginPassword, realDigest, salt)) {
            addPrincipal(new UserPrincipal(fields[0]));
            for (int i = 3; i < fields.length; i++) {
              addPrincipal(new RolePrincipal(fields[i]));
            }
            return true;
          }
          break;
        }
      }
    } catch (FileNotFoundException e) {
      throw new RuntimeException(e);
    } catch (IOException e) {
      /* nothing to do. */
    } catch (UnsupportedCallbackException e) {
      /* nothing to do. */
    }

    throw new FailedLoginException();
  }

}


Here we have the entire mixtape from new collabo group, 'Serial Killers' with Xzibit, B Real and Demrick. The free mixtape has 14 tracks, which have quite a kick. Each track more brutal than the other. Beats and features come from Ill Bill, Kurupt, Ea $ y Money, Statik Selektah and many others.


Hudson County Politics Message Board :: View topic - Has the commission given an opinion?
Posted: Fri Sep 22, 2006 11:58 am Post subject: Has the commission given an opinion?
Or, are we still waiting? Anyone have any current news?


I want my necromancer now!
Apparently there are people who enjoy watching grown men and women play games for ludicrous amounts of money. This is a subforum for these sorts of people.
Because who doesn't love curling up with a good book?
in Re: 2018 Reading List?


text:
Q: how would you debug this javascript problem? I've been travelling and developing for the past few weeks.
The site I'm developing was running well.
Then, the other day, i connected to a network and the page 'looked' fine, but it turns out the javascript wasn't running. I checked firebug, and there were no errors, as I was suspecting that maybe a script didn't load (I'm using the google api for jQuery and jQuery UI, as well as loading google maps api and fbconnect).
I would suspect that if the issue was with one of these pages not loading I would get an error, and yet there was nothing.
Thinking maybe i didn't connect properly or something, i reconnected to the network and even restarted my computer, as well as trying to run the local version. I got nothing.
The local version not running also hinted to me that it was the loading of an external javascript which caused the problem.
I let it pass as something strange with that one network. Unfortunately now I'm 100s of miles away.
Today my brother sent me an e-mail that the network he was on at the airport wouldn't load  my page. Same issue. Everything is laid out properly, and part of the layout is set in Javascript, so clearly javascript is running.
he too got no errors. Of course, he got on his plane, and now he is no longer at the airport. Now the site works on his computer (and i haven't changed anything).
How on earth would you go about figuring out what happened in this situation? That is two of maybe 12 or so networks. But I have no idea how i would find a network that doesn't work (and living in a small town, it could be difficult for me to find a network that doesn't work).
Any ideas?
The site is still in Dev, so I'd rather not post a link just yet (but could in a few days).
What I can see not working is the javascript functions which are called on load, and on click. So i do think it is a javascript issue, but no errors.
This wouldn't be as HUGE an issue if I could find and sit on one of these networks, but I can't. So what would you do?
EDIT ----------------------------------------------------------
the first function(s - their linked) that doesn't get called is below.
I've cut the code of at the .ajax call as the call wasn't being made.
function getResultsFromForm(){

    jQuery('form#filterList input.button').hide();
    var searchAddress=jQuery('form#filterList input#searchTxt').val();
    if(searchAddress=='' || searchAddress=='<?php echo $searchLocation; ?>'){
        mapShow(20, -40, 0, 'areaMap', 2);
        jQuery('form#filterList input.button').show();
        return;
    }

    if (GBrowserIsCompatible()) {
        var geo = new GClientGeocoder();
        geo.setBaseCountryCode(cl.address.country);

        geo.getLocations(searchAddress, function (result)
                {

                if(!result.Placemark && searchAddress!='<?php echo $searchLocation; ?>'){
                jQuery('span#addressNotFound').text('<?php echo $addressNotFound; ?>').slideDown('slow');
                jQuery('form#filterList input.button').show();

                } else {
                jQuery('span#addressNotFound').slideUp('slow').empty();
                jQuery('span#headerLocal').text(searchAddress);
                var date = new Date();
                date.setTime(date.getTime() + (8 * 24 * 60 * 60 * 1000));
                jQuery.cookie('address', searchAddress, { expires: date});
                var accuracy= result.Placemark[0].AddressDetails.Accuracy;

                var lat = result.Placemark[0].Point.coordinates[1];
                var long = result.Placemark[0].Point.coordinates[0];
                lat=parseFloat(lat);
                long=parseFloat(long);
                var getTab=jQuery('div#tabs div#active').attr('class');

                jQuery('div#tabs').show();
                loadForecast(lat, long, getTab, 'true', 0);
                var zoom=zoomLevel();
                mapShow(lat, long, accuracy, 'areaMap', zoom );

                }
                });
    }

}

function zoomLevel(){

    var zoomarray= new Array();
    zoomarray=jQuery('span.viewDist').attr('id');
    zoomarray=zoomarray.split("-");
    var zoom=zoomarray[1];
    if(zoom==''){
        zoom=5;
    }
    zoom=parseFloat(zoom);
    return(zoom);

}
function loadForecast(lat, long, type, loadForecast, page){

    jQuery('div#holdForecast').empty();
    var date = new Date();
    var d  = date.getDate();
    var day = (d < 10) ? '0' + d : d;
    var m = date.getMonth() + 1;
    var month = (m < 10) ? '0' + m : m;
    var year='2009';
    toDate=year+'-'+month+'-'+day;

    var genre=jQuery('span.genreblock span#updateGenre').html();

    var numDays='';

    var numResults='';

    var range=jQuery('span.viewDist').attr('id');
    var dateRange = jQuery('.updateDate').attr('id');
    jQuery('div#holdShows ul.showList').html('

');

    jQuery('div#holdShows ul.'+type+'List').livequery(function(){
            jQuery.ajax({
type: "GET",
url: "processes/formatShows.php",
data: "output=&genre="+genre+"&numResults="+numResults+"&date="+toDate+"&dateRange="+dateRange+"&range="+range+"&lat="+lat+"&long="+long+'&page='+page,
success: function(response){

EDIT 2 -----------------------------------------------------------------------------
Please keep in mind that the problem is not that I can't load the site, the site works fine on most connections, but there are times when the site doesn't work, and no errors are thrown, and nothing changes. My brother couldn't run it earlier today while I had no problems, so it was something to do with his location/network. HOWEVER, the page loads, he had a connection, it was his first time visiting the site, so nothing could have been cashed. Same with when I had the issue a few days before. I didn't change anything, and I got to a different network and everything worked fine.

A: Two things: first -- get the javascript local to your site when developing.  Loading it from elsewhere to take advantage of caching is an optimization that I'd leave to the end.  I'd also only load it from highly available remote sites, like Google, to minimize problems.  Second, make your site at least minimally usable without javascript enabled.  Use form postbacks that get replaced with Ajax functionality from javascript that runs when the page is loaded, for example. You might not be able to get everything, but I've found that I can make most things work without javascript in at least a workable, if not elegant fashion.
I realize this doesn't solve your immediate problem, but I think it would help your site to remain available in the face of situations like this.

A: Turns out the problem with this was in assuming that google map could find any lat/long within north america reliably via ip address.
I add a if(!google.loader.ClientLocation) function for the instances where google cannot find the location via ip.

The strangest bit was that I was hitting this error in an office in downtown Palo Alto which I thought would have been heavily mapped by the google geocoder.

A: If some of the JS is being hosted by a different server (eg: if you are including something like jQuery from the jQuery site instead of hosting a copy of it yourself) then maybe one of these sites is down temporarily.
You could try use something like "Live HTTP Headers" (available at the Mozilla Addons site) to watch HTTP headers in real-time, which can be really useful when doing web development.  You should be able to determine very quickly if all your JS is in fact loading correctly or not.
You could also use something like Ethereal or Wireshark, but that is probably a little heavy-handed when all you need is to see the request/response headers.  Using an Addon is far less hassle.

A: A few things:
1.) where you include your scripts... make sure you have a separate closing tag! DO NOT self close them.

2.) is there a reason why you are using jQuery() rather than $() ?
3.) does your SERVER specify a DOCTYPE that your local environment didn't?
4.) what browser are you testing in? in particular are you testing in IE, if so does it work in Firefox?
5.) can you post some of the generated code if you can't supply a URL?

A: Once you're sure that all the scripts are loading as expected in the dev environment you could try either removing them one-by-one from the page and see which one recreates the issue you were having - then that's the script that wasn't loading.
Firebug has a Net Tab which does something very similar to what Live HTTP Headers does, even tracking the timings of the load and any ajax requests.

A: I almost always recommend Firefox plugin, "Firebug" for this.
Firstly, you can inspect the scripts to check that they have loaded, which will rule out the "it didn't load from a remote source" problem.
Secondly, it will display errors that occur in the JavaScript console, which may point out something that appeared to be silently previously.
Lastly, keep an eye out for cross-site-scripting problems when using JavaScript from another domain.


Yesterday, the UK tax authorities published a note finally clarifying the registration requirements imposed on such investors.
A non-UK resident corporate investor making a direct or indirect sale of UK commercial property will need to register for UK corporation tax within 3 months of such a sale. This is because from 6 April 2019 (last Saturday), non-UK resident corporate investors are subject to UK corporation tax when they realise a capital gain from direct or indirect sales of UK commercial real estate. These rules are complex, but broadly capture sales of interests in a property rich entity or sales of commercial properties directly. Read our earlier insight to find out more.
If there is no need to register before 6 April 2020, all non-resident corporate investors in UK real estate will, in any event, need to register as a result of coming within the charge to corporation on 6 April 2020. This is the date from when all non-resident corporate investors will be subject to UK corporation tax both on capital gains described above and on income (including rent) from UK real estate. The UK tax authorities have stated that they will be contacting such companies in the summer of 2019 with further detail (we assume including detail on how to register).
We would be happy to provide further advice regarding UK corporation tax more generally, which has more detailed rules than the UK income tax regime which applies to UK rental income until April 2020 (including for example certain rules restricting the deductibility of interest).
It may be worth noting that a single asset SPV company will cease to be subject to UK corporation tax if it has sold its only asset of UK real estate. It would therefore only have a one day accounting period corresponding to the disposal.
In terms of payment dates for the SPV, assuming that gains of over GBP 1.5m would be made (such that the "instalment regime" for paying CT for large companies will apply), tax on the gain will generally be due on the date of the disposal. By concession, the UK tax authorities should allow payment within 3 months and 14 days after the end of the accounting period in which the sale was made (which, as noted above, may be one day only in the case of single asset SPV companies).
The full guidance note can be viewed here: https://www.gov.uk/guidance/register-a-non-resident-company-for-corporation-tax. If you have any questions, please don't hestitate to contact Richard, Victoria or another member of the BCLP Tax Advice & Controversy team.


Last year was full of surprise hits and massive bombs at the box office, but the one film that continues to astound as we march towards the second month of the New Year is Jumanji: Welcome to the Jungle. The box office success of the rebooted property has been incredible, and it was only just dethroned by Maze Runner: The Death Cure after four weekends at the top. But despite no longer being number one, the film continues to add to its total and has now just passed an impressive milestone. Jumanji: Welcome to the Jungle has now outgrossed Spider-Man: Homecoming domestically.
Yes, the reboot of a family film from the '90s has now made more money than one of the most popular superheroes ever here in the United States. According to Box Office Mojo, Jumanji currently sits at $337.8 million domestically versus Spider-Man's $334.2 million, although Spider-Man still has a higher box office total worldwide. Now it is important to note that both Jumanji: Welcome to the Jungle and Spider-Man: Homecoming are both Sony releases. So while The Emoji Movie and The Dark Tower both, shall we say, underperformed, Sony has to be happy with these two films (especially Jumanji) for blowing away expectations and having serious legs. What's particularly impressive is that Jumanji is still not done, and will continue to add to its box office total for weeks to come.
Spider-Man isn't the only superhero to be felled by the might of The Rock either. Jumanji: Welcome to the Jungle will also pass Wonder Woman in worldwide box office receipts, though probably not domestically. The film is also now Dwayne Johnson's most successful film that isn't a part of the Fast and Furious franchise. Jumanji's success is in no way an indictment of these superhero films or an indication of a comic book bubble about to burst. It is, however, an apt comparison given the dominance and success of superhero fare in the marketplace. Other lavish and original blockbusters have attempted to be franchise starters and make their mark, only to fall wildly short. So when a non-comic book blockbuster hits this big, it is worthy of examination.
There are a lot of reasons one can attribute to Jumanji's success: the popularity of The Rock, the humor of Kevin Hart and the nostalgia for the Robin Williams film being among them. Likely it is an amalgam of factors and some intangibles as well. Hollywood often learns the wrong lessons from the success and failures of films, and hopefully that is not what happens here. Name recognition counts, but it doesn't go nearly as far when the quality isn't there. Jumanji could have easily turned off fans who loved the original. After all, nostalgia for a beloved film can be tough to live up to. The Jumanji name brought people into the theaters in December, but positive word of mouth (and admittedly a weak January calendar) kept them coming back again and again as we head into February.
Jumanji: Welcome to the Jungle is in theaters now. For all the movies hoping to have that kind of success this year, you can check out our release schedule.