Dennis Kucinich is considered a friend of labor. Why, we're not quite sure. Friends level with friends and tell them what they need to hear, not what they want to hear, as seems his habit. The latest example is the congressman's response to those union workers who worry that pending plans by Ford Motor Co. to restructure its operations could impact the automaker's casting plant in Brook Park. U.S. Rep. Kucinich met last week with leaders of Local 1250 of the United Auto Workers, which represents Ford workers in Brook Park, to learn of their concerns. During that meeting, he is quoted by The Plain Dealer as stating, "We know we can't lose another plant, and we're not going to let that happen." It was a predictable pledge from a politician who has fashioned himself as a defender of the common man. However, it is a hollow promise that ignores both the current state of the auto industry and Rep. Kucinich's checkered track record at saving jobs in the face of market forces indicating that those jobs must go. Ford, like General Motors, is hurting. In this year's third quarter, its North American automotive operations lost $1.2 billion pre-tax, which is nearly $700 million more than the loss those operations sustained in the like period last year. Rather than make any public comment, Rep. Kucinich could have pulled local UAW leaders aside and said, "Listen, I know your bosses are to blame for a lot of your company's problems. They bet the ranch on light trucks and SUVs, and now high oil prices are killing sales of those gas guzzlers. They also haven't introduced an exciting new model in years. But the wages and benefits you guys are pulling down are way out of whack with what the market can bear, too. I'll work to help introduce some kind of national health insurance plan. In the meantime, you need to let your national leaders know that your health care and pension plans need to be ratcheted back, or else your company and GM could wind up like LTV Steel." You remember LTV, Rep. Kucinich. You locked arms with the United Steelworkers and stridently led the charge to "save" the steelmaker. But the remedy for saving steelmaking jobs in Cleveland wasn't found in a federal bailout or the change in management you sought while the company was in Chapter 11 bankruptcy proceedings. It came when LTV finally was allowed to die so that a new company — International Steel Group — could scoop up its assets and could run them freed of the burdensome contract obligations and work rules that helped kill LTV. As for the 1,000 jobs that were saved this summer at the Cleveland center of the Defense Finance and Accounting Service, it wasn't cheerleading by civic leaders such as Rep. Kucinich that convinced the Base Closure and Realignment Commission to keep intact an operation that was threatened with extinction. Rather, it was cold, hard numbers dug up by another congressman, Steve LaTourette, that proved the center here was among the least expensive and most efficient DFAS operations in the country and deserved more work, not less. Rising to the aid of working men and women is great, provided it's more than just words. After all, friends don't promise what they can't deliver.


text:
Q: What does "he's sneaking in a cheeseburger" mean? What does "he's sneaking in a cheeseburger" mean?
Context: Now I have a very unhappy stepdad, but at least he's sneaking in a cheeseburger so that should keep him amused while I write you a letter.

A: Although John's answer is a valid one, I'd like to offer a different possibility.

Now I have a very unhappy stepdad, but at least he's sneaking in a cheeseburger so that should keep him amused while I write you a letter.

That sentence means that the man is occupied with his cheeseburger while the writer is composing her letter, which will give the author some time to write without being distracted by her unhappy stepfather.
Now, as for the expression sneak in, that can be used to mean find some time for. Finding a dictionary listing this sense of the word was not easy; the closest I could find was:

sneak in (v.) insert casually : She slipped in a reference to her own work
  [syn: slip in, stick in, sneak in, insert]

Though most dictionary definitions for sneak mention doing things "in secret," Google gave me plenty of instances where sneak in doesn't really seem to imply any furtiveness, such as these headlines:

*

*Five ways to sneak in a workout

*It's summer! Time to sneak in the veggies!

*How to sneak exercise into your busy day

These bloggers are not talking about doing something secretly, but they are talking about how to slip something desirable into one's schedule or diet.
In the context of time, then, sneak in can be used to mean find a few minutes for.
In the case of the letter you quoted, it doesn't seem like the man is trying to hide his cheeseburger so that no one notices it. (If that's the case, he's not being successful, since the person writing the letter clearly knows he's eating a cheeseburger.)
So, I'd paraphrase the original as:

Now I have a very unhappy stepdad, but at least he's found some time to eat his cheeseburger, so that should keep him busy while I write you a letter.

A: It means he is getting a cheeseburger (for himself to eat) in a sneaky way (hiding it so nobody knows he has it).

redpajama_set_name: RedPajamaStackExchange


text:
The Law Office of Jeremy D. Morley
Prenups Worldwide
Prenups in Australia
Prenups in Canada
Prenups in England
Prenups in Hong Kong
Prenups in India
Prenups in Japan
Prenups in the Philippines
Prenups in Singapore
Prenups in Spain
Prenups in Switzerland
Prenups in USA >
Prenups: Fairness or Unconscionability
Uniform Prenuptial Agreements Act
Prenups: What Law Governs?
Prenups: Choice of Court
Prenups: Drafting Guidelines
Prenups: Limiting Spousal Maintenance
Forum Shopping
Prenuptial Agreements in Canada
Jeremy D. Morley
Prenuptial agreements are generally enforceable in Canada. Courts in Ontario and other common law provinces of Canada previously considered marriage contracts to be contrary to public policy and unenforceable, but the 1978 Family Law Reform Act (now continued in the Family Law Act) in Ontario and similar legislation in other provinces specifically authorizes them.
Prenuptial Agreements in Ontario: The Family Law Act of Ontario authorizes marital contracts between two people who are married or intend to be married to each other. The agreements must be in writing, signed by the parties and witnessed. They may deal with a broad range of matters, including the ownership or division of property, support obligations, matters concerning the education and "moral training" of children (but not issues concerning custody of or access to children) and "any other matter."
The legislation precludes spouses from opting out of those provisions in the Act that protect the rights of each of spouses to the matrimonial home.
The Act provides that a court may set aside a provision for support or a waiver of the right to support in a marriage contract and may determine and order support even though the contract contains an express provision excluding the application of this section:
If the provision for support or the waiver of the right to support results in unconscionable circumstances;
If the provision for support is in favor of, or the waiver is by or on behalf of, a dependent who qualifies for allowance for support out of public money; or
If there is default in the payment of support under the contract or agreement at the time the application is made.
As a result, a provision in the marriage contract either limiting or precluding a claim for future support is very much subject to the discretion of the court at the time an application for support is made.
The Act allows a court to set aside a marriage contract, either in whole or in part, if:
A party failed to disclose significant assets, debts or other liabilities;
A party did not understand the nature or consequences of the contract; or
The law of contract so requires, meaning that the enforcement of the agreement is barred by duress, undue influence, fraud, fundamental breach or unconscionability.
The Ontario legislation does not expressly require that a party must receive independent legal advice but the failure to receive such advice is a clear "red flag."
Prenuptial Agreements in British Columbia: The Family Relations Act of British Columbia recognizes the validity of marriage agreements but authorizes allow the court to set aside or vary them if they are found to be unfair in all of the circumstances.
The Act requires that such agreements must be in writing, signed by both spouses, and witnessed by one or more other persons.
Specifically, Sec. 65(1) of the Family Relations Act, R.S.B.C. 1996, c. 128, provides that upon a divorce the court may divide the marital property as it deems fit "[i]f the provisions for division of property…would be unfair having regard to (a) the duration of the marriage, (b) the duration of the period during which the spouses have lived separate and apart, (c) the date when property was acquired or disposed of, (d) the extent to which property was acquired by one spouse through inheritance or gift, (e) the needs of each spouse to become or remain economically independent and self-sufficient, or (f) any other circumstances relating to the acquisition, preservation, maintenance, improvement or use of property or the capacity or liabilities of a spouse."
In Dowell v. Dowell, 2008 BCSC 138, the British Columbia Supreme Court reviewed a marriage agreement that had been entered into between two retired people who then shared a long marriage. The Agreement provided that each party would retain their pre-marriage assets. The Court expressed concern that the agreement did not contain any provision for support and that the wife had not obtained independent legal advice. It varied the agreement by awarding 22% of the family assets to the wife and the balance to the husband.
This office handles many international family law cases that concern Canada. The firm always acts with local counsel in Canada as appropriate.
In particular we frequently handle U.S. - Canada prenuptial agreements.
Jeremy D. Morley formerly taught law as an Assistant Professor at the Law Faculty of the University of New Brunswick, Fredericton, Canada.

redpajama_set_name: RedPajamaCommonCrawl


Use a nightside name, use capitals and do NOT use numbers or special characters.
Include your location (i.e Country and City) - you will be sorted into one of two user groups - local (South Africa) and General (International).
You will need to provide proof that you are 18 years old or greater.
If you do not meet the requirements of the interview process, you will not be allowed to join the forum.
Accounts without sufficient biographical information in profile applications (who, what, where etc) will be deleted without notice or apology.


Applications are now available for VRMA members interested in serving on the VRMA Board of Directors for a two-year term spanning October 2019 to October 2021. Applications are due Friday, May 10, 2019.
There are five open positions on the Board of Directors, which includes two current Board members who are eligible for reelection. Four of these positions must be filled by vacation rental manager members; one position must be filled by vendor/supplier members.
Professional headshot (JPEG format; 300+ DPI resolution preferred).
Contact information (including email/cell phone#) for three member references, no more than one of which may be a vendor/supplier member or a current VRMA Board Member. Please be sure to contact your references prior to providing their names. Members of the Leadership Development Committee will contact your references.
A candidate statement (150 words or less).
Complete the online Candidate Application.
Note to candidates: VRMA anticipates a strong response to this request for applications. We hope you understand our appreciation for your interest, while at the same time understanding, because of the breadth of candidates, your application should not be interpreted as an assurance of election, nor an assurance of your recommendation by the Leadership Development Committee.
Do you know someone who would make a strong candidate for the Board of Directors? If you would like to recommend a colleague for service, please email mcopps@vrma.org by May 3, 2019, so that we may reach out to this person directly.
VRMA members interested in pursuing Board candidacy must submit a candidate application by May 10, 2019. This application will include information to verify the candidate's qualification for election as well as information about his/her industry leadership experiences.
The Leadership Development Committee will review all Candidate Applications submitted by the deadline. The Leadership Development Committee will vet each candidate to confirm that qualifications are met and ensure that their recommendations are representative of the qualities, experience levels, and demographics of the membership base. The recommendations will then be submitted to the VRMA Board by July 12.
If requested by the candidate, VRMA will send an email containing a campaign message on behalf of the candidate to all voting members. These will be distributed on a first-come, first-served basis and will be scheduled by VRMA, not the candidate. All campaign emails are subject to approval by VRMA staff. VRMA member email lists will not be shared with candidates.
NOTE: All candidates must adhere to VRMA's Non-Solicitation Policy.
NOTE: If you would like to do a direct mailing, contact the VRMA office at 202-367-1179.
The primary contact for each Member Company will receive a ballot. Members will be given 30 days to vote on their choices of Directors. No proxy voting will be accepted for electronic ballots.
Election results will be announced during or before the VRMA International Conference. New Directors will assume office during the Board meeting immediately preceding the start of the International Conference or immediately at the conclusion of the International Conference.
Questions and suggestions regarding the election process may be directed to Jessica Baumgartner, VRMA Membership and Operations Senior Coordinator, at jbaumgartner@vrma.org or 202-367-2410. Jessica will work with the Leadership Development Committee as necessary to address any questions.


text:
Questions Over Bailout for Insurers
MARY WILLIAMS WALSH
As the Treasury Department considers life insurers' applications for a bailout, big questions remain about how hard a bargain the government will drive.
The Treasury has taken two different stances in its six months running the Troubled Asset Relief Program, or TARP. For the banks, cash infusions came quickly, with few strings attached, in an urgent attempt to strengthen the financial system.
But after initially extending credit to the automakers, the Treasury has taken a much harder line with Detroit by insisting that General Motors produce a more credible business plan and Chrysler seek a merger partner.
The question is whether the Treasury will pour billions more into shoring up the life insurers or subject each to rigorous testing, then determine which are viable and perhaps force quiet mergers and divestitures for those deemed too weak to save.
A spokesman for the Treasury said that the criteria for insurers were still being developed and that it would probably be at least two weeks before any of them got their answers.
But the stock market seemed to believe that the insurers' chances were greatly improved on Wednesday. After The Wall Street Journal reported that the Treasury might have an announcement within days, stock in Hartford Financial Services Group rose 13.5 percent, and that of the Lincoln National Corporation rose more than 30 percent.
All of the dozen insurers that have applied for TARP money are believed to be life insurers, although not all have been identified. Some are well-known companies, like MetLife and Prudential Financial.
(Property and casualty insurers are generally less leveraged and are therefore considered less vulnerable to financial shocks, though their outlooks have deteriorated, as reflected in the credit downgrade of Berkshire Hathaway. None of them have applied for federal assistance.)
Insurance companies are acutely vulnerable to ratings downgrades — once an insurer falls below AA status, it can start having trouble getting new business. Many life insurers have already suffered credit downgrades this year because of losses in 2008. And with the markets still weak as of March 31 — the day insurers generally marked their assets to market for their first quarters — investors worry that more downgrades are looming.
Infusions from TARP could offset that pain by restoring some capital, if the Treasury acts in time.
The life insurers have been waiting for nearly half a year, after being told last November that they could apply for TARP money if they had a federally regulated affiliate. Several insurance companies promptly bought thrift institutions to obtain their federal charters.
While the applicants have waited, all have grown weaker.
"We think that the life insurance industry is in a very precarious position," analysts for Bridgewater Associates, a hedge fund, said in a report last month. "It does not appear that some of the big insurance companies possess enough capital to weather the storm."
Concerning state regulators overseeing the insurance industry, they wrote, "There is a lot of stalling and hope that someone else will deal with the problem. This may be all that can be done until someone in Washington decides insurance companies are systemically important."
The Treasury secretary, Timothy F. Geithner, has said that reining in systemic risk is a priority, but has not offered specific proposals or definitions.
Late last year, life insurance officials said they, too, should qualify for federal money, citing their huge presence in the bond markets, then under extreme duress.
The government seemed to agree that they might pose a form of systemic risk. The life insurance industry now holds about 18 percent of all United States corporate bonds, as well as big blocks of commercial mortgages and government bonds.
If an insurer were to get into financial trouble, its policyholders would presumably be protected by the guarantee fund of its home state. But if a big troubled insurer were caught in a cash squeeze and began selling off bonds to raise cash, the insurers argue that it could wreak further havoc on the bond markets.
The Bridgewater analysts said that the life insurers could also face liquidity problems in a period of high unemployment. When unemployment rises and consumer credit dries up, people may surrender their life insurance policies or borrow against their cash value.
Bridgewater projected that life insurers could run through "$500 billion during the next couple of years to meet policyholder demands."
That could stretch some insurers to the breaking point. But it is not clear this amounts to the sort of systemic risk that the Treasury has said it wants to contain.
Another problem is the use of derivatives — specifically, the credit-default swaps that nearly toppled American International Group last fall. They are used routinely for various purposes by large insurance companies, without incident. But if a weakened insurer had swaps that required it to come up with a lot of collateral suddenly — as happened to A.I.G. — that could produce the kind of risk to the financial system that the Treasury views as unacceptable.
In its annual report, the Hartford Group said that if its financial strength ratings were to be downgraded by three notches from where it stood in February, it "could begin to trigger potentially material collateral calls on certain of our derivative instruments."
A spokeswoman for the company declined to specify how much collateral might be required, but said that the Hartford Group's involvement with swaps was small — unlike that of A.I.G., which sold them extensively and then suddenly had to come up with $17 billion when it was downgraded, setting in motion a bank run.


Abstract: The |right to be let alone| is a sanctified part of constitutional culture and the principle that seems to justify the right of privacy. The author proposes, instead, to link the right of privacy with each person|s right and need to be a proud member of society, and to examine its nemesis, i.e., the right not to be let alone. By challenging the right to be let alone, this paper will also examine critically the right of society to let people alone against their wishes. ||Constitutional democracy promises to protect the rights and dignity of each individual; such promise is not fulfilled when it proclaims the right to be let alone – which subtlety implies that society has the possibility to let such individual alone as well||.
Keywords: data protection; individual dignity; Samuel Warren; Louis Brandeis; capitalism; public disclosure; social exclusion; constitutional democracy; privacy; constitutional culture; personal rights; human society; being alone; human beings; humanity; loneliness; private law.


Beautiful, friendly new studio in North Wilmington – close to PA Border ! All levels hot power yoga, yoga flow & pilates classes. Life is not about finding yourself…Life is about Creating Yourself ! Come and Enjoy….Come and Create !


Halloween Decor - Make this DIY Halloween Village for ten dollars at the36thavenue.com So awesome!
Light up your Fall decor with a Halloween Tree!
Spooky Trees Halloween Craft for Halloween Decorations, Small Worlds and Train Sets from Play Trains!
2018 Lemax Spooky Town Preview - Including Michaels Exclusives!
04195 DOUBLE LICHEN-COVERED TREE Spooky Town Table Accent Retired Halloween Decor Large 9"
Halloween Wreaths, Ghosts, Trees and Door Decor-A Must See!
... of Renoir and the renowned Limoges porcelain, the medieval city located in the Limousin region is probably the best place in France to spend Halloween.


This large, one-of-a-kind dynamic and textural painting is 30 inches tall by 96 inches wide. It is wired and ready to hang. The sides of this highly textural black, white and gray artwork are painted as a continuation of the front. It does not require framing. It is signed and titled by the artist on the back. Free local Los Angeles area delivery. Affordable US and worldwide shipping. A certificate of authenticity is included.
She resides in Tucson, AZ and La Jolla, CA. Her artworks have been acquired by corporations and private collectors throughout the United States, Canada and Australia. They have been featured on hit TV shows such as "The Catch" on ABC.
About the gallery: Artspace Warehouse is one of the world's leading galleries for savvy contemporary art collectors. With galleries in Zurich (Switzerland Kunstwarenhaus Est. 2000) and Los Angeles (USA Est. 2010), Artspace Warehouse specializes in affordable international urban, pop, figurative and abstract art from the hottest emerging and mid-career artists.


text:
/*
Problem 10. Find sum in array

Write a program that finds in given array of integers a sequence of given sum S (if present).
Example:

array	                    S	        result
4, 3, 1, 4, 2, 5, 8	        11	        4, 2, 5

*/
using System;

class SumInArray
{
    static void Main()
    {
        Console.Write("Please enter your sequence of numbers: ");
        string text = Console.ReadLine();

        Console.Write("Please enter the sum you want to check: ");
        int checkSum = Int32.Parse(Console.ReadLine());

        string[] numberArray = text.Split(new char[] { ',', ' ', '\t' }, StringSplitOptions.RemoveEmptyEntries);

        int[] sequence = new int[numberArray.Length];

        int sum = 0;
        int bestStart = -1;
        int bestLength = -1;

        // Parsing the elements from the string array
        for (int i = 0; i < sequence.Length; i++)
        {
            sequence[i] = Int32.Parse(numberArray[i].ToString());
        }

        // Searching for a sequence
        for (int i = 0; i < sequence.Length; i++)
        {
            sum = sequence[i];
            for (int j = i + 1; j < sequence.Length; j++)
            {
                if (sum == checkSum)
                {
                    bestStart = i;
                    bestLength = j;
                }
                sum += sequence[j];
            }
        }

        // Printing the result
        if (bestStart == -1 && bestLength == -1)
        {
            Console.WriteLine("There isn't a sequence of numbers which sum is {0}", checkSum);
        }
        else
        {
            Console.Write("The sequence of sum is ");
            for (int i = bestStart; i < bestLength; i++)
            {
                Console.Write(sequence[i]);

                if (i != bestLength - 1)
                {
                    Console.Write(", ");
                }
            }
            Console.WriteLine(" and their sum is {0}", checkSum);
        }
    }
}

redpajama_set_name: RedPajamaGithub


text:
\section{Introduction}
Biclustering techniques aim to simultaneously cluster objects and attributes of a dataset.
Each bicluster is represented as a tuple containing a subset of the rows, and a subset of the columns, as long as they exhibit some kind of coherence pattern.
There are several kinds of coherence which can be found in a bicluster, and they directly interfere on the mechanism of bicluster identification.
As finding all biclusters in a dataset is an NP-hard problem, several heuristics were proposed, such as CC \cite{Cheng2000} and FLOC \cite{Yang2003}.
Such heuristics may miss important biclusters, and may also return non-maximal biclusters (biclusters that can be further augmented).

In the case of binary datasets, there are a plenty of algorithms for enumerating all maximal biclusters. Some examples are Makino \& Uno \cite{Makino2014}, LCM \cite{Uno2004} and In-Close2 \cite{Andrews2009}.
The enumeration of all maximal biclusters in an integer or real-valued dataset is a much more challenging scenario, but we already have some proposals, such as RIn-Close \cite{Veroneze2014} and RAP \cite{Pandey2009}.

The drawback of enumerative algorithms, particularly in the context of noisy datasets, is the existence of a large number of biclusters, due to fragmentation of a much smaller number of true biclusters.
This is exemplified in one of our experiments, where we take artificial datasets, gradually increment the variance of a Gaussian noise, and get the enumerative result.
As shown in Fig. \ref{fig:qtds}, with enough noise, the enumerative results exhibit an strong increase on the quantity of biclusters.
This fragmentation leads to a challenging scenario for the analysis of the results, which can become impractical even in small datasets.
In fact, the noise is responsible for fragmenting each true bicluster into many with high overlapping, so that the aggregation of these biclusters is recommended \cite{Liu04} \cite{Zhao2005}.

We propose a way of aggregating biclusters from a biclustering result that shows a high overlapping among its components, as it is the case when enumerating biclusters in noisy datasets.
For this reason, in this paper we will focus on enumerative results, but our proposal can be applied to the result of any algorithm that returns biclusters with high overlapping among them.
The formulation is based on the fact that the high overlapping among biclusters may indicate that they are fragments of a true bicluster that should be reconstructed.
We propose two different techniques to perform the aggregation, followed by a step that removes elements that should not be part of a bicluster.
We performed experiments with three artificial datasets posing different challenges, and two real datasets from distinct backgrounds.
We compared our proposals with a bicluster ensemble algorithm, and the merging/deleting steps of MicroCluster \cite{Zhao2005}.
The experimental results show that the aggregation not only severely reduces the quantity of biclusters, but also tends to increase the quality of the solution.

The paper is organized as follows. In Section \ref{related}, we give the main definitions and discuss the related works in the literature.
Section \ref{proposals} outlines our proposals.
The metrics used to evaluate our proposals will be presented in Section \ref{metrics}.
In Section \ref{experiments}, we present the experimental procedure and the obtained results of the experiments.
Concluding remarks and future work are outlined in Section \ref{conclusions}.

\section{Definitions and Related Work}
\label{related}
Consider a dataset $\textbf{A} \in \mathbb{R}^{n \times m}$, with rows $X = \{x_1, x_2, \dots, x_n\}$ and columns $Y = \{y_1, y_2, \dots, y_m\}$.
We define a bicluster $B = (B^r, B^c)$, where $B^r \subseteq X$ and $B^c \subseteq Y$, such that the elements in the bicluster show a coherence pattern.
A bicluster solution is a set of biclusters represented by $\bar{B} = \{B_i\}_{i=1}^q$, containing $q$ biclusters.
A bicluster is maximal if and only if we can not include any other object / attribute without violating the coherence threshold.
If a solution contains non-maximal biclusters, the result is redundant because there will be biclusters which are part of larger ones.

Madeira \& Oliveira \cite{Madeira2004} categorized the types of biclusters according to their similarity patterns.
They also categorized the biclusters structure in a dataset based on their disposition and level of overlapping.
We highlight that biclusters with constant values, constant values on rows, or constant values on columns are special cases of biclusters with coherent values, and we will focus our attention on the latter, due to its generality.
For a comprehensive survey of biclustering algorithms, the reader may refer to \cite{Madeira2004} and \cite{Tanay2005}.

The overlapping between two biclusters $B$ and $C$ is an important concept in this work, and is defined as:
\begin{equation}
ov(B, C) = \frac{|B^r \cap C^r \times B^c \cap C^c|}{min(|B^r \times B^c|, |C^r \times C^c|)}.
\end{equation}

Now we shall proceed to the aggregation proposals in the literature.
It is important to highlight that, when aggregating two maximal biclusters, the coherence threshold will be violated.
Otherwise, the biclusters would not be maximal.

\subsection{MicroCluster Aggregation}
\label{cap:ens:aggregation:mc}
MicroCluster \cite{Zhao2005} is an enumerative proposal that has two additional steps after the enumeration.
These steps have the task of deleting or merging biclusters which are not covering an area much different from other biclusters.
The first is the deleting step.
If we find a bicluster such that the ratio of its area that is not covered by any other bicluster, by its total area, is less than a threshold $\eta$, it can be removed.
The second step is the merging one.
Let us consider two biclusters and generate a third one with the union of rows and columns of the previous two.
If the ratio of the area of the third bicluster that is not covered by any of the previous two, by its total area, is less than a threshold $\gamma$, we can aggregate the two biclusters into this third one.
In this method of aggregation, non-maximal biclusters will be removed in the deleting step, thus not interfering in the final result.
For more details, please refer to Zhao \& Zaki \cite{Zhao2005}.

\subsection{Aggregation Using Triclustering}
Triclustering was proposed by Haczar \& Nadif \cite{Hanczar2012} as a biclustering ensemble algorithm.
First, they transform each bicluster into a binary matrix.
After that, they propose a triclustering algorithm to find the $k$ most relevant biclusters.
As they were able to improve the biological relevance of biclustering for microarray data \cite{Hanczar2011b}, we will use this method as a contender in this paper.
One major point in ensemble is that we want to combine the results reinforcing the biclusters that seem to be important for several components, and discarding the ones that may come from noise.
Due to the way the triclustering algorithm handles the optimization step, non-maximal biclusters can interfere in the final results.

Bicluster aggregation is slightly different from bicluster ensemble.
While on ensemble tasks we discard biclusters that seem unimportant and combine the ones that contribute the most for the solution, in bicluster aggregation we never discard any bicluster.
Given this characteristic, the bicluster ensemble solution is expected to show a high \textit{Precision} with an impacted \textit{Recall} (see Section \ref{metrics}), as it eliminates biclusters.

\subsection{Other Aggregation Methods}
Gao \& Akoglu \cite{GAO2014} used the principle of Minimum Description Length to propose CoClusLSH, an algorithm that returns a hierarchical set of biclusters.
The hierarchical part can be seen as an aggregation step.
This step is done based on the LSH technique as a hash function.
Candidates hashed to the same bucket are then aggregated until no merging improves the final solution.
Their work is focused in finding biclusters in a checkerboard structure, that does not allow overlapping, thus being not suitable for the kind of problem we are dealing with.

Liu \textit{et al}. \cite{Liu04} proposed OPC-Tree, a deterministic algorithm to mine Order Preserving Clusters (OP-Clusters), a general case of Order Preserving Sub Matrices (OPSM) type of biclusters.
They also have an additional step for creating a hierarchical aggregation of the OP-Clusters.
The Kendall coefficient is used to determine which clusters should be merged and in which order the objects should participate in the resultant OP-Cluster.
The highest the Rank Correlation using the Kendall coefficient, the highest the similarity between two OP-Clusters.
The merging is allowed according to a threshold that is reduced in a level-wise way.
OPC-Tree considers the order of the rows in the bicluster.
In this work, we are dealing with biclusters of coherent values.
In this case, a perfect coherent values bicluster keeps the order of its rows and the hierarchical step of OPC-Tree would be able to be used in this case as well.
But we are considering noisy datasets, in which this assumption probably will not hold, thus the hierarchical step of OPC-Tree is not suitable for the problem we are dealing with.

\section{New Proposals for Aggregation}
\label{proposals}

\subsection{Aggregation with Single Linkage}
\label{aggregation:sl}
Our first proposal receives as input a biclustering solution $\bar{B}$, from enumeration or from a result presenting high overlapping among its components.
With this solution, we transform each bicluster into a binary vector representation as follows:
Given the dimensions of the dataset $\textbf{A} \in \mathbb{R}^{n \times m}$, each bicluster will be a binary vector $\textbf{x}$ of length ${n + m}$.
For a bicluster $B$ transformed into the binary vector $\textbf{x}$, the first $n$ positions represent the rows of the dataset $\textbf{A}$ and if the bicluster contains the $i$th row, $\textbf{x}_i = 1$, otherwise $\textbf{x}_i = 0$.
The last $m$ positions represent the columns of the dataset $\textbf{A}$ and if the bicluster contains the $i$th column, $\textbf{x}_{n+i} = 1$, otherwise $\textbf{x}_{n+i} = 0$.
After this transformation, we use the Hamming distance to apply the single linkage clustering on the existing biclusters.
Notice that the Hamming distance on this transformation will just count how many rows and columns are different among the two biclusters.
In this case, a non-maximal bicluster may be distant from the bicluster that covers its maximal area, thus impacting the quality of the results of this method of aggregation.
In this case, it is necessary that this proposal receives a biclustering solution $\bar{B}$ containing only maximal biclusters.

After choosing a cut on the dendrogram, we aggregate all biclusters that belong to a junction using the function \textit{aggreg}, defined as:
\begin{equation}
aggreg(B, C) = (B^r \cup C^r, B^c \cup C^c),
\label{eq:aggreg}
\end{equation}
that is simply the union of rows / columns of the biclusters.
It is important to note that the \textit{aggreg} function is associative, since it is based on the union operation.
Moreover, we want to highlight that the direct union of rows / columns may include elements that should not be part of a bicluster.
In Section \ref{aggregation:outlier} we will present a way to remove rows / columns that may be interpreted as outliers.

\subsection{Aggregation by Overlapping}
\label{aggregation:by_ov}
It seems intuitive to aggregate the biclusters with an overlapping rate above a defined threshold.
This proposal is based on the aggregation by pairs: while having two biclusters with an overlapping rate higher than a pre-determined threshold $th$, we remove them from the set of biclusters, and include the result of the function \textit{aggreg}, defined on Eq. \ref{eq:aggreg}, taking these two biclusters as the arguments.

Let $B, C, D$, and $E$ be biclusters.
Note that for $D = aggreg(B,C)$, $ov(D,E) \geq ov(B,E)$ and $ov(D,E) \geq ov(C,E)$.
So, for all biclusters $E$ where $ov(B,E) \geq th$ or $ov(C,E) \geq th$, we have $ov(D,E) \geq th$.
For this reason, the order of the aggregation does not interfere on the final result.
It is also important to note that the new bicluster $D$ can have $ov(D,E) \geq th$, for some bicluster $E$ where $ov(B,E) < th$ and $ov(C,E) < th$.
In this aggregation proposal, maximal biclusters will properly merge with non-maximal biclusters.

\subsection{Outlier Removal}
\label{aggregation:outlier}
After aggregating the results, we need to process each final bicluster to look for objects and / or attributes that may be interpreted as outliers.
In this work, this step will always be executed after the aggregation using any of our two proposals.

Let $B = (B^r, B^c)$ be an aggregated bicluster, with $|B^r| = o, |B^c| = p$.
We define a participation matrix $\textbf{P} \in \mathbb{Z}^{o \times p}$, where each element $p_{ij}$ indicates the quantity of biclusters in which this element takes part in $B$.
For example, if an element is part of 15 biclusters that compose $B$, then its value on the $\textbf{P}$ matrix will be 15.

So, we will explain the process of outlier removal with the help of Figure \ref{fig:outlier}.
We have two steps of outlier removal: one for the objects, the other for the attributes.
To remove possibly outlier objects, we take the mean and the standard deviation of all columns on the participation matrix \textbf{P}.
The left side of Figure \ref{fig:outlier} illustrates this step.
After that, we check the values of each element of the columns.
If the value is less than the mean minus one standard deviation, then we check this element as a potential outlier.
In Figure \ref{fig:outlier}, we can see that the entire first row was checked as potential outlier because $1 < 7.75 - 4$.
If we mark the entire row as a potential outlier, it is removed from the bicluster.
In our example, that is the case.
\begin{figure}[]
    \centering
    \includegraphics[trim=2cm 20.5cm 7cm 2.5cm, clip=true, width=200pt]{outlier}
    \caption{Example of outlier removal.}
    \label{fig:outlier}
\end{figure}

We execute the same process for the columns, calculating the mean, standard deviation and checking for potential outliers on the rows.
We remove the column if it is entirely marked as a potential outlier.

\section{Metrics for Biclustering}
\label{metrics}
In this paper we will use only external metrics, except for the Gene Ontology Enrichment Analysis (GOEA).
External metrics compare a given solution with a reference one.
For an extensive comparison of external metrics for biclustering solutions, the reader may refer to \cite{Horta2014}.

The Gene Ontology Project \footnote{http://geneontology.org} (GO) is an initiative to develop a computational representation of the knowledge of how genes encode biological functions at the molecular, cellular and tissue system levels.
The GOEA compares a set of genes with known information.
For example, given a set of genes that are up-regulated under certain conditions, an enrichment analysis will find which GO terms are over-represented (or under-represented) using annotations for that gene set\footnote{http://geneontology.org/page/about Acessed on 2015, January, 16}.
This method is commonly used to analyze results from biclustering techniques on microarray gene expression datasets.

\textit{Precision}, \textit{Recall} and \textit{F-score} are often used on information retrieval for measuring binary classification \cite{Salton1971}.
If we take pairs of elements, we can extend these metrics to evaluate clustering / biclustering solutions with overlapping.
The pairwise definition of \textit{Precision} and \textit{Recall} can be found in \cite{Menestrina2009}.
It is important to highlight that these metrics do not consider the quantity of biclusters.
\textit{Pairwise Precision}, or just \textit{Precision} for simplicity, is the fraction of retrieved pairs that are relevant; while \textit{Pairwise Recall}, or just \textit{Recall} for simplicity, is the fraction of relevant pairs that are retrieved.
The \textit{F-score} is the harmonic mean of \textit{Precision} and \textit{Recall}.

Clustering Error (\textit{CE}) is an external metric that considers the quantity of biclusters in its evaluation.
This metric severely penalizes a solution with more biclusters than the reference, thus not being recommended for evaluating enumerative results.
The definition and more details can be found in \cite{Horta2014}.

We propose the difference in coverage, that measures what the reference biclustering solution covers and the found biclustering solution does not cover, and vice versa.
Although very similar, when compared with the pairwise definitions of \textit{Precision} and \textit{Recall}, this metric gives a more intuitive idea of how two solutions cover distinct areas of the dataset.
It also can be computed much faster.
Let $\cup_{\bar{B}} = \bigcup B_i^r \times B_i^c$ be the usual union set of a biclustering solution $\bar{B}$. Let $\bar{B}$ and $\bar{C}$ be the found and the reference biclustering solutions, respectively.
Then the difference in coverage is given by:
\begin{equation}
  dif\_cov(\bar{B}, \bar{C}) = \frac{|\cup_{\bar{B}} - \cup_{\bar{C}}| + |\cup_{\bar{C}} - \cup_{\bar{B}}|}{m \times n}.
  \label{eq:diff_cov}
\end{equation}

We will use this measure to verify how different an aggregated solution is from the enumerative one.

\section{Experiments}
\label{experiments}
In our experiments, we employed three artificial datasets: \textit{art1}, \textit{art2}, and \textit{art3}; and two real datasets: GDS2587 and \textit{FOOD}.
We designed the artificial datasets to present different scenarios with increasing difficulty.
They have 1000 objects and 15 attributes. Each entry is a random integer, drawn from a discrete uniform distribution on the set \{1, 2, ..., 100\}.
Then we inserted: 5 bicluster arbitrarily positioned and without overlapping on \textit{art1}; 5 bicluster arbitrarily positioned and with a similar degree of overlapping on \textit{art2}; and 15 bicluster arbitrarily positioned and with different degrees of overlapping on \textit{art3}.

For each bicluster, the quantity of objects was randomly drawn from the set $\{50, \dots, 60\}$, and the quantity of attributes was randomly drawn from the set $\{4, 5, 6, 7\}$.
To insert a bicluster, we fixed the value of the first attribute and obtained the values of the other attributes by adding a constant value to the first column.
This characterizes biclusters of coherent values.
This constant value was randomly drawn from the set $\{-10, -9, \dots, -1, 1, \dots, 9, 10\}$.

\textit{GDS2587}\footnote{http://www.ncbi.nlm.nih.gov/sites/GDSbrowser?acc=GDS2587} is a microarray gene expression dataset, with 2792 genes and 7 samples, collected from the organism \textit{E. coli}.
We removed every gene with missing data in any sample, and the data was normalized by mean centralization, as usual in gene expression data analysis \cite{Prelic2006}.
In this dataset we aim to validate our contribution when devoted to microarray gene expression data analysis, as it is considered a relevant application of biclustering methods.

\textit{FOOD}\footnote{http://www.ntwrks.com/chart1a.htm} is a dataset with 961 objects, which represent different foods, and 7 attributes, which represent nutritional information.
As the values of each attribute are in different ranges, we used the same pre-processing as Veroneze \textit{et al}. \cite{Veroneze2014}.
In this dataset our goal is to illustrate the usefulness of bicluster aggregation in a different scenario and to verify if the aggregation leaves uncovered areas that the enumeration has covered at first.

\subsection{Experiments on Artificial Datasets}
Our goal is to verify the impact of noise in the enumeration of biclusters, and how the aggregation can improve the quality of the final results.
To this end, we will add a Gaussian noise with $\mu = 0$ and $\sigma \in \{0, 0.01, \dots, 1\}$, to each dataset, and then run the RIn-Close algorithm.
This procedure will be repeated for 30 times and all reported values will be the average of this 30 executions.
We will set RIn-Close to mine coherent values biclusters, with at least 50 rows and 4 columns.
Also, we will use crescent values for $\epsilon$ due to the importance of the parameter.
If $\epsilon$ is too small, we may miss important biclusters expressing more internal variance.
If $\epsilon$ is too high, the biclusters may include unexpected objects or attributes.

As we know the biclusters, we will use \textit{Precision}, \textit{Recall} and \textit{F-score} to assess the quality of the results after the enumeration.
After that, we will perform the aggregation on the results with the value of $\epsilon$ that led to an initial \textit{Precision} closest to 0.85.
This value was chosen because if the \textit{Precision} is too low, it means that the $\epsilon$ value is allowing too many undesired objects or attributes in the enumerated biclusters.
In this case, the aggregation may not improve the quality of the final results because their input is not of good quality.
If the \textit{Precision} is too high, we will only be able to see improvements in the reduced quantity of biclusters, but the aggregation may increase the \textit{Precision} too.

We will consider the following algorithms as contenders:
\begin{itemize}
\item[Triclustering \cite{Hanczar2012}.]
We set $k$ to the true number of biclusters. The authors supplied the code for this algorithm.

\item[Merging and Deleting steps of MicroCluster \cite{Zhao2005}.]
To parameterize this algorithm, we ran a grid search with the values in the set ${0.15, 0.1, 0.05}$, getting 9 results for each run.
Also, as the aggregation step of the algorithm is composed of two steps, merging and deleting, we ran each experiment twice: with the merging step first (MD) and with the deleting step first (DM).
Unless we want to draw attention to some particular fact, we will report only the best result.
The authors supplied the code for this algorithm \footnote{http://www.cs.rpi.edu/$\sim$zaki/www-new/pmwiki.php/Software/Software}.

\item[Single Linkage (see Section \ref{aggregation:sl}).]
We cut the dendrogram with the proper quantity of biclusters: for \textit{art1} and \textit{art2}, 5 biclusters; for \textit{art3}, 15 biclusters.

\item[Aggregation by Overlapping (see Section \ref{aggregation:by_ov}).]
We tested several values for the rate of overlapping.

\end{itemize}
After getting the results for all executions of the listed algorithms, we will choose the best result from each one and compare them using the \textit{CE} metric.

Figure \ref{fig:qtds} shows the quantity of enumerated biclusters on the artificial datasets, for several values of $\epsilon$.
\begin{figure}
    \centering
    \begin{subfloat}[\textit{art1}]{
        \includegraphics[trim=2.4cm 7.5cm 3.5cm 8.3cm, clip=true, width=100pt]{art1_epsilons_qtd}
        \label{fig:qtds:art1}
    }
    \end{subfloat}
    \begin{subfloat}[\textit{art2}]{
        \includegraphics[trim=2.4cm 7.5cm 3.5cm 8.3cm, clip=true, width=100pt]{art2_epsilons_qtd}
        \label{fig:qtds:art2}
    }
    \end{subfloat}
    \begin{subfloat}[\textit{art3}]{
        \includegraphics[trim=2.4cm 7.5cm 3.5cm 8.3cm, clip=true, width=100pt]{art4_epsilons_qtd}
        \label{fig:qtds:art3}
    }
    \end{subfloat}
    \caption{Quantity of enumerated biclusters by the variance of the Gaussian noise in the artificial datasets.
    Each curve is parameterized by $\epsilon$.}
    \label{fig:qtds}
\end{figure}
In all datasets, for every value of $\epsilon$, the behavior is the same: as the noise increases the quantity of enumerated biclusters starts to increase.
In Figures \ref{fig:qtds:art1} and \ref{fig:qtds:art2}, we know that the real quantity of biclusters is 5, but when the noise increases, the enumerated quantity reaches approximately 800 biclusters, depending on the value of $\epsilon$.
In Figure \ref{fig:qtds:art3}, we can see that the quantity of biclusters reaches high values too.
At some level of noise, the number of biclusters starts to decrease to a point that the algorithm is not able to find any bicluster.

\begin{figure}[h]
    \centering
    \begin{subfloat}[\textit{art1} \textit{Precision}]{
        \includegraphics[trim=3.1cm 7.5cm 3.5cm 8.5cm, clip=true, width=100pt]{art1_epsilons_precision}
        \label{fig:art1_precision}
    }
    \end{subfloat}
    \begin{subfloat}[\textit{art2} \textit{Precision}]{
        \includegraphics[trim=3.1cm 7.5cm 3.5cm 8.5cm, clip=true, width=100pt]{art2_epsilons_precision}
        \label{fig:art2_precision}
    }
    \end{subfloat}
    \begin{subfloat}[\textit{art3} \textit{Precision}]{
        \includegraphics[trim=3.1cm 7.5cm 3.5cm 8.5cm, clip=true, width=100pt]{art4_epsilons_precision}
        \label{fig:art3_precision}
    }
    \end{subfloat}
    \begin{subfloat}[\textit{art1} \textit{Recall}]{
        \includegraphics[trim=3.1cm 7.5cm 3.5cm 8.5cm, clip=true, width=100pt]{art1_epsilons_recall}
        \label{fig:art1_recall}
    }
    \end{subfloat}
    \begin{subfloat}[\textit{art2} \textit{Recall}]{
        \includegraphics[trim=3.1cm 7.5cm 3.5cm 8.5cm, clip=true, width=100pt]{art2_epsilons_recall}
        \label{fig:art2_recall}
    }
    \end{subfloat}
    \begin{subfloat}[\textit{art3} \textit{Recall}]{
        \includegraphics[trim=3.1cm 7.5cm 3.5cm 8.5cm, clip=true, width=100pt]{art4_epsilons_recall}
        \label{fig:art3_recall}
    }
    \end{subfloat}
    \caption{\textit{Precision} and \textit{Recall} for the solutions of RIn-Close, with several values of $\epsilon$, by the variance of the Gaussian noise in the artificial datasets.}
    \label{fig:prec_rec}
\end{figure}
In Figure \ref{fig:prec_rec}, we can see the quality of the enumeration without considering the quantity of biclusters.

As we can see in Figure \ref{fig:art1_recall}, the noise has almost no interference in the recall for \textit{art1}.
It means that this dataset has biclusters very well defined, that even with some noise they are not missed.
On the other hand, when the variance of the noise is too low, Figure \ref{fig:art1_precision} shows that the found biclusters contains more elements than expected.
It is happening because the parameter $\epsilon$ is high, allowing some elements to be part of the biclusters even without being part of the original solution.
As the noise increases, less of these intruder elements are going to satisfy the $\epsilon$ restriction to be thus included in some bicluster.
In this dataset, the effect of the noise were not so severe on the quality, given that the recall started to decrease only when the variance of the noise was close to 1.

In dataset \textit{art2} the effect of noise can be better observed.
Figure \ref{fig:art2_recall} shows that the noise starts to affect the solutions very early.
When $\epsilon = 3$, the recall starts to decrease very soon, with $\sigma \approx 0.5$.
However, for more relaxed values of $\epsilon$ we can still see the decrease on the recall.
Being the most difficult, dataset \textit{art3} is the most affected by noise.
Independently of the value of $\epsilon$, the RIn-Close was not able to find any biclusters after some levels of variance in the noise.
For example, when $\epsilon = 2$, after $\sigma \approx 0.4$ the \textit{Precision} gets undefined.
This happens because the metric is not defined when the quantity of biclusters is zero.
In Figure \ref{fig:art3_recall}, we can see that the decline of the recall starts when $\sigma \approx 0.3$ for $\epsilon = 2$.

Now we will discuss the results of the aggregation with the previously listed algorithms.
As stated earlier, we will use the results from a value of $\epsilon$ that led to an initial \textit{Precision} close to 0.85.
In this case, we have $\epsilon = 6, 4, 3$ for \textit{art1}, \textit{art2} and \textit{art3}, respectively.
\begin{figure}[]
    \centering
    \begin{subfloat}[\textit{Single Linkage}]{
        \includegraphics[trim=1.6cm 7cm 2.7cm 6.9cm, clip=true, width=100pt]{art1_60_hamming_f2}
        \label{fig:aggreg_art1:sl}
    }
    \end{subfloat}
    \begin{subfloat}[\textit{By Overlapping}]{
        \includegraphics[trim=1.4cm 6.5cm 0.7cm 7.1cm, clip=true, width=100pt]{art1_60_overlapping_f2_70}
        \label{fig:aggreg_art1:ov}
    }
    \end{subfloat}
    \begin{subfloat}[\textit{CE}]{
        \includegraphics[trim=2.4cm 7.7cm 2.7cm 7.5cm, clip=true, width=100pt]{art1_CESpb}
        \label{fig:aggreg_art1:ces}
    }
    \end{subfloat}
    \caption{Solutions of aggregation as a function of the variance of the noise in dataset \textit{art1}.
    The scale on the right refers to quantity.}
    \label{fig:aggreg_art1}
\end{figure}

Figure \ref{fig:aggreg_art1:sl} shows the quality of the aggregation with single linkage for dataset \textit{art1}.
We can see that, with the proper number of biclusters, the aggregation was able to get an almost perfect result.
The same thing happened with the aggregation by overlapping, reported in Figure \ref{fig:aggreg_art1:ov}.
Figure \ref{fig:aggreg_art1:ces} shows the CE metric for all solutions of aggregation.
We can see that our proposals were capable of producing the best performance on this dataset.

\begin{figure}[]
    \centering
    \begin{subfloat}[\textit{Single Linkage}]{
        \includegraphics[trim=2.9cm 7.7cm 2.7cm 7.5cm, clip=true, width=100pt]{art2_40_hamming_f2}
        \label{fig:aggreg_art2:sl}
    }
    \end{subfloat}
    \begin{subfloat}[\textit{By Overlapping}]{
        \includegraphics[trim=1.7cm 7cm 1.5cm 7.5cm, clip=true, width=100pt]{art2_40_overlapping_f2_75}
        \label{fig:aggreg_art2:ov}
    }
    \end{subfloat}
    \begin{subfloat}[\textit{CE}]{
        \includegraphics[trim=2.8cm 7.7cm 2.7cm 7.5cm, clip=true, width=100pt]{art2_CESpb}
        \label{fig:aggreg_art2:ces}
    }
    \end{subfloat}
    \caption{Solutions of aggregation as a function of the variance of the noise in dataset \textit{art2}.
    The scale on the right refers to quantity.}
    \label{fig:aggreg_art2}
\end{figure}

Figure \ref{fig:aggreg_art2:sl} shows the quality of the aggregation with single linkage for the dataset \textit{art2}.
This time, the solution was close to the maximum achievable performance, but not so close as it was in \textit{art1}.
Figure \ref{fig:aggreg_art2:ov} shows the quality of the aggregation by overlapping for the same dataset.
The quality of this solution is very similar to the one obtained with single linkage.
Figure \ref{fig:aggreg_art2:ces} shows the CE metrics obtained by all the methods of aggregation.
Again, our proposals outperformed the other two algorithms.

\begin{figure}[]
    \centering
    \begin{subfloat}[\textit{Single Linkage}]{
        \includegraphics[trim=2.8cm 8cm 4.1cm 7.9cm, clip=true, width=100pt]{art4_30_hamming_f2}
        \label{fig:aggreg_art3:sl}
    }
    \end{subfloat}
    \begin{subfloat}[\textit{By Overlapping}]{
        \includegraphics[trim=1.7cm 7.cm 1.3cm 7.5cm, clip=true, width=100pt]{art4_30_overlapping_f2_75}
        \label{fig:aggreg_art3:ov}
    }
    \end{subfloat}
    \begin{subfloat}[\textit{CE}]{
        \includegraphics[trim=2.9cm 7.7cm 2.7cm 7.5cm, clip=true, width=100pt]{art4_CESpb}
        \label{fig:aggreg_art3:ces}
    }
    \end{subfloat}
    \caption{Solutions of aggregation as a function of the variance of the noise in dataset \textit{art3}.
    The scale on the right refers to quantity.}
    \label{fig:aggreg_art3}
\end{figure}
Figures \ref{fig:aggreg_art3:sl} and \ref{fig:aggreg_art3:ov} show the quality of aggregation with single linkage and by overlapping, respectively.
We can see that this dataset is more challenging than the previous ones.
However, the aggregation was able to significantly reduce the quantity of biclusters, while keeping a good quality.
Figure \ref{fig:aggreg_art3:ces} shows the CE metric for all aggregation methods.
Initially MicroCluster had a better performance, but our proposals were more robust to noise, getting a better result when $\sigma \gtrapprox 0.4$.

The aggregation was not only able to reduce the quantity of biclusters of the enumeration, but also improve the quality of the final result.
Now we are going to verify the behavior of the aggregation in real datasets.

\subsection{Experiments on Real Datasets}
We will start with the \textit{GDS2587} dataset by running RIn-Close to enumerate its coherent values biclusters.
We set $minRow = 50, minCol = 4$. When $\epsilon < 2.8$ no biclusters were found, and when $\epsilon = 3.0$ the quantity of biclusters was already huge.
We found 23, 2.825 and 19.649 biclusters when $\epsilon = 2.8, 2.9,$ and $3.0$, respectively.
\begin{figure}[]
    \centering
    \subfloat[$\epsilon = 2.8$]{\label{exp4:28_dendrogram}\includegraphics[trim=3cm 7.5cm 2.5cm 7cm, clip=true, width=100pt]{140_3_28_dendrogram}}
    \subfloat[$\epsilon = 2.9$]{\label{exp4:29_dendrogram}\includegraphics[trim=3cm 7.5cm 2.5cm 7cm, clip=true, width=100pt]{140_3_29_dendrogram}}
    \subfloat[$\epsilon = 3$]{\label{exp4:30_dendrogram}\includegraphics[trim=3cm 7.5cm 2.5cm 7cm, clip=true, width=100pt]{140_3_30_dendrogram}}
    \caption{Dendrograms of the aggregation with single linkage on \textit{GDS2587} dataset.}
    \label{fig:gds:dendrogram}
\end{figure}

Proceeding to the aggregation, Figure \ref{fig:gds:dendrogram} shows the dendrograms of the aggregation with single linkage.
In this case, the cuts are straightforward, having 2, 4, and 5 clusters respectively.
The aggregation by overlapping with a rate of $75\%$ reached the same quantity of biclusters.
We used these quantities to parameterize the triclustering algorithm.
The results of the aggregation with MicroCluster were very similar, and they depended only on the $\gamma$ parameter.
We got 7, 8 and 11 biclusters when $\gamma = 0.15, 0.1,$ and $0.05$, respectively.
We will now compare the results with the \textit{gene ontology enrichment analysis}.
A bicluster is called 'enriched' when any ontology term gets a p-value less than 0.01.

When $\epsilon = 2.8$, except for triclustering (only the first bicluster was enriched), all the algorithms returned only enriched biclusters.
In fact, the four main enriched terms were always the same, sometimes on different orders but with very close p-values.

\begin{table}[h]
\centering
\begin{tabular}{|l|l|l|p{7.3cm}|}
\cline{1-4}
GO Term     & p-val 		& counts 	& definition \\ \cline{1-4}
GO:0044464 & 0.00000000 & 39 / 774 & Any constituent part of a cell, the basic structural and functional unit of all organisms... \\ \cline{1-4}
GO:0044444 & 0.00000011 & 19 / 608 & Any constituent part of the cytoplasm, all of the contents of a cell excluding the plasma membrane...\\ \cline{1-4}
GO:0044424 & 0.00000350 & 19 / 578 & Any constituent part of the living contents of a cell; the matter contained within (but not including) the plasma membrane...\\ \cline{1-4}
\end{tabular}
\caption{Enrichment analysis of one bicluster from the aggregation by overlapping with rate of 70\%, on \textit{GDS2587} dataset.}
\label{tab:go}
\end{table}

When $\epsilon = 2.9$, all algorithms returned only enriched biclusters, including triclustering.
When $\epsilon = 3$, all algorithms except for triclustering returned only enriched biclusters.
Triclustering returned 4 from 5 enriched biclusters.

Table \ref{tab:go} shows the main enriched terms of one bicluster from the aggregation by overlapping after outlier removal, when $\epsilon = 2.8$.
In this case, the expert should choose which solution fits better the goal of the data analysis.

We will now proceed to the analysis of the \textit{FOOD} dataset.
We are going to verify how the aggregation changes the coverage of the dataset when compared to the enumeration.
As the aggregation will severely reduce the quantity of final biclusters, it is important to see if it will leave uncovered areas that were previously covered.

We replicated the experiment from Veroneze \textit{et al}. \cite{Veroneze2014} on this dataset and we will use $\epsilon = 1.25$ as recommended on that work.
With $minRow = 48, minCol = 2$ and looking for coherent values biclusters, the quantity of enumerated biclusters for $\epsilon = 1.25$ is 8.676.
\begin{figure}[]
    \centering
    \includegraphics[trim=2.8cm 8cm 2.9cm 7.5cm, clip=true, width=100pt]{dendrogram}\vspace{11pt}
    \caption{Dendrogram for the aggregation with single linkage when $\epsilon = 1.25$ on \textit{FOOD} dataset.}
    \label{fig:food:dendrogram}
\end{figure}

Figure \ref{fig:food:dendrogram} shows the dendrogram of the aggregation with single linkage.
We can see that the cuts between 2 and 7 are acceptable.
In fact, cutting in two groups seems the best option, but it may be considered a small quantity of biclusters.
As from 4 to 5 the height is more pronounced, for the comparison it seems acceptable to cut the dendrogram on 4 objects.
The aggregation by overlapping with a rate of 70\% was also able to recover 4 aggregated biclusters.

MicroCluster with the deleting operation first was not able to properly aggregate the biclusters, keeping more than 800 biclusters when $\eta = 0.15$.
This behavior is the opposite of what happened with the artificial datasets.
There, when the deleting operation came first the results were more effective.
Here when the merging operation came first, the aggregation was able to reach 13 to 27 biclusters, depending on the $\gamma$ parameter.
As on the artificial datasets the best parameters were $\eta = \gamma = 0.15$, for the comparison we will use this parameterization with the merging operation occurring first, that gives us 13 biclusters.
For the triclustering algorithm we set $k = 4$, using insider information from the aggregation by overlapping.
\begin{table}[h]
\centering
\begin{tabular}{|l|l|l|l|l|}
\cline{1-5}
                  & Single Linkage & MicroCluster & Triclustering & RIn-Close\\ \cline{1-5}
By Ov.            & 12.50\% & 35.50\% & 70.31\% & 9.1\%\\ \cline{1-5}
Single Linkage    &  -      & 46.60\% & 81.51\% & 20.17\%\\ \cline{1-5}
MicroCluster      &  -      & -       & 45.73\% & 27.38\%\\ \cline{1-5}
Triclustering     &  -      & -       & -       & 61.33\%\\ \cline{1-5}
\end{tabular}
\caption{Difference in coverage of the solutions with the enumeration on \textit{FOOD} dataset.}
\label{tab:comparison}
\end{table}
Table \ref{tab:comparison} shows the comparison of difference in coverage (see Eq. \ref{eq:diff_cov}) between the aggregated solutions with the enumerated solution from RIn-Close.
We can see that the triclustering algorithm produces the most distinct solution when compared with the enumerated solution obtained with RIn-Close, exhibiting $\approx 61.33\%$ of difference in coverage.
The solutions from the aggregation by overlapping and with single linkage are relatively close to each other, as on the artificial datasets, showing a difference in coverage of $\approx 12.50\%$.
At the end, the closest solution to the RIn-Close results was the aggregation by overlapping, with a difference in coverage of $9.1\%$.
If we consider that this solution reduced the quantity of biclusters from 8.676 to 4 biclusters, the difference in coverage of only $9.1\%$ seems very promising.

\section{Considering Remarks and Future Work}
\label{conclusions}
We have compared the performance of our proposals against the most similar proposal in the literature, using artificial and real datasets.
The artificial datasets were characterized by a controlled structure of biclusters and were useful to show that the aggregation can severely reduce the quantity of biclusters, while increasing the quality of the final solution.
Our proposals outperformed the compared algorithms on the first two artificial datasets, and showed to be more robust to noise on the third artificial dataset.

We also verified if the aggregation could get enriched biclusters in the case of a gene expression dataset.
For different values of $\epsilon$ on the RIn-Close algorithm, we could see that the different methods of aggregation reached very similar results.
The main challenge of the aggregation with single linkage is to decide where to cut the dendrogram, but as we could see, this task was straightforward on the tested datasets.
Except for the triclustering, all aggregations returned only enriched biclusters.
And finally, we applied the aggregation methods to the \textit{FOOD} dataset and analyzed how the aggregation changed the coverage area when compared to the enumeration without aggregation.
Triclustering led to the most distinct result, and the aggregation by overlapping covered an area very similar to the area covered by the enumeration.

We can conclude that the aggregation is strongly recommended when enumerating all biclusters from a dataset.
The aggregation will not only significantly reduce the quantity of biclusters, but will also reduce the fragmentation and increase the quality of the final result.
A post-processing step for outlier removal brings additional robustness to the methodology.
As a further step of the research, we can adapt our proposals to work on an ensemble configuration.
We can also extend this work to deal with time series biclusters, which require contiguous attributes.

The authors would like to thank CAPES and CNPq for the financial support.

redpajama_set_name: RedPajamaArXiv


text:
> TIP
The Crestwood Police Department is looking for the man who is suspected of fatally stabbing his neighbor's dog.
Coronavirus pandemic triggers reduction in global air pollution
Jane Goodall calls for global ban on wildlife trade and end to 'destructive and greedy period of human history'
A tiger at the Bronx Zoo tests positive for Coronavirus
Teddy, the 3-and-a-half-year old Border Collie, had to be put down later after suffering multiple stab wounds in his belly. Teddy's owners had witnessed the entire turn of events.
Apparently, Teddy walked into the neighbor's yard with his doggie friend as there is no fence separating the two yards. He wasn't aggressive, but the neighbor was enraged to see the dogs. The man angrily made eye-contact with the owners, and then walked over to Teddy. Before the owners could do anything, the man grabbed Teddy by the neck and stabbed him in the stomach multiple times.
Teddy was still wagging his tail and begging to be saved when he was taken to the vet's. But he had to be euthanized because of the severity of his wounds. The cops have identified the suspect as John Ross III. Please spread the word and help the cops find him.
Update: John Ross III has been arrested on charges of animal abuse and unlawful use of a weapon. But he soon walked away on a bond of $2500. There is no future court date set as of now. If convicted, Ross will face 5 years in prison for both counts. Meanwhile, Teddy's owners have hired an attorney and opened a Facebook page to share Teddy's tragic story and push for harsher penalties for animal abusers. Spread the word.
Click the video below to watch a report on Teddy's brutal murder.
Please 'SHARE' to pass on this story to a friend or family member
Thêm 1 ca dương tính với Covid-19 cùng chuyến bay với bệnh nhân thứ 17
The Last Dog-Meat Slaughterhouse In Seoul, South Korea Has Shut Down
Cop Responding To Call About Pit Bull Realizes She's Hurt & Refuses To Leave Her Side
Old Dog No One Wants, Her Body Giving Out- She Lays In Kennel And Holds On
Man Walks Pit Bull Without Leash, Then Hears Young Boy Scream When Dog Attacks Poisonous Snake
Neglected Dog Found Living In A Dungeon, Covered With Rat Feces And Bird Remains
Guy Sees Footage Of What His Girlfriend Does With His Dog While He's Away On Business
Dog Sings Whitney Houston's Hit 'I Will Always Love You' On TV Talent Show
Quarantined Man Sends His Chihuahua To Buy Him Cheetos From The Store
Dog Sneaks up While Baby's Sleeping – And Its So Adorable!


text:
Q: Can you upcast in objective-c and how? Can you upcast in objective-c?  if so how?

C# example:
"Asset" is the base class.
Stock msft = new Stock();
Asset a = msft;            //upcast

A: You mean typecast a subclass object to the type of a superclass?  Sure - Objective-C has very liberal typecasting rules, just like C.
Superclass *superclassObject = (Superclass *)subclassObject;


text:
Prime_Leagueone_Shrewsbury_ Town_v_Wycombe_Wanderers_20210928_00807.jpg
Traveling Wycombe fans before the Sky Bet League 1 match between Shrewsbury Town and Wycombe Wanderers at Greenhous Meadow, Shrewsbury, England on 28 September 2021. Photo by Leila Coker / PRiME Media Images
Shrewsbury Town, Wycombe Wanderers, Football, Soccer, Football League, League One, Season 2021/22, Sport, L1, Sky Bet League 1


Dr. Frederic Whitehurst, the FBI scientist who blew the whistle on misconduct at the FBI crime lab, was recently interviewed by Andrew Cohen of The Marshall Project. In the interview Dr. Whitehurst discusses the recent admission by the FBI of "errors" by the crime lab in hair analysis cases.
CBS Evening News ran a story last night on the flawed science of FBI hair analysis. "FBI admits its hair analysis was flawed for decades" featured an interview with FBI Crime Lab Whistleblower Dr. Frederic Whitehurst. Watch this segment below.
Washington, D.C. April 20, 2015. Yesterday, the Washington Post published a front-page article reporting that the FBI has finally admitted the FBI Lab's forensic hair analyses used for decades in state and federal criminal cases were flawed and inaccurate more that ninety percent (90%) of the time.
The Federal Bureau of Investigation is under pressure to fix it's broken whistleblower process. In February 2015, the Government Accountability Office (GAO) reported that whistleblower protections at the FBI are weaker than at any other agency. The Senate Judiciary Committee held a hearing in March and whistleblower advocacy groups are calling for change.
The GAO Report found that the Department of Justice's FBI whistleblower process leaves FBI whistleblowers without protection from retaliation, and creates a chilling effect. The GAO also found that it could take over 10 years for a simple case to be completed through the FBI process.
On March 5, Kevin Gosztola wrote the below article about the FBI's failed whistleblower program and the recent Senate hearings, for The Dissenter on Firedoglake.
On March 4, 2015 the Senate Judiciary Committee held a hearing on the lack of whistleblower protections for FBI employees.
Non-profit whistleblower organizations say that the US Department of Justice has laws in place to protect FBI whistleblowers from retaliation, but the system does not work as intended.
Washington, D.C. March 4, 2015. The lack of whistleblower protections for FBI employees was the subject of a Senate Judiciary Hearing held Wednesday, March 4. Senators from both sides of the aisle were outraged by the amount of retaliation FBI whistleblowers face along with the failure of the FBI whistleblower program to appropriately handle such cases.


> difficult for them to stay in touch with their usual contacts.
Git repositories, IRC, papers, blogs, hackathons, conferences, etc.
about Facebook as a kind of festival, fun while it lasted.
restrictive, too, as any outsider, weirdo, or loner can confirm.
terrifying question: What are we all supposed to *do* with each other?
mostly stick with family, friends, the tribe.
the true meaning of the word social."
engage in genuine (non-virtual) relationships."


text:
Guy Dussaud, né le , est un footballeur professionnel français évoluant au poste de milieu droit.

Biographie

Guy Dussaud joue au Nîmes Olympique, à Grenoble et enfin à Martigues.

Il dispute 108 matchs en Division 1 et 102 matchs en Division 2.

Lien externe
 Statistiques de Guy Dussaud

Naissance en  décembre 1955
Footballeur français
Joueur du Nîmes Olympique
Joueur du Grenoble Foot 38
Joueur du FC Martigues
Footballeur formé à l'INF Vichy
Naissance à Nîmes

redpajama_set_name: RedPajamaWikipedia


What if you could rewrite your stars? Do you think it's possible or do you think your future is already written and you just trudge along and never ask for more than you're given? Day to day without reaching for the joy, the talents, and the happiness that is waiting for you and that you deserve. You wish on every star that you could take hold and own what you want from that secret safe hidden spot deep down inside of you. Your wish is to see the wonder. the real. the light that has been hiding to step into the true you.
"Rewrite the Stars" from "The Greatest Showman" was the inspiration for me to try a little dance move I've always wanted to try but never did because it was always a little scary. It's not jumping into a new business or quitting a job to travel the world or starting the journey to lose 50 pounds... but to ME it was a joy I wanted to embrace. What about you? What do you want to rewrite in your stars, in your life to give you joy and to experience your true, authentic, beautiful self???! Are you ready? I'm here to help.


Just how does a photo postcard, made by hand North Carolina area fit thus much into one day? To learn, attend typically the free Forget about Brasstown New music and Martial arts disciplines Fest, returning alive on Saturday, June 25.
Overlook Brasstown is the main sibling locality to help Forget Martins first-ever family group function can operate coming from eight: 00 here's until finally check out: 00 pm upon Jason bass Builder Street, several a long way with the world famous David Campbell Individuals School. Situation coordinator Jamie Keener explained, "This family-style fun day will attribute not only impressive meal, live life popular music by the incredible Barker Affects and even spectacular perform by simply area musicians along with crafters, yet by merchants by while miles away away since Florida, Tn, and Ga.
"There should not be any vendor access fees. Good donations by local and area organizations that identify the cost of wood working in the rather busy lifestyles can help delay payments on expenses, in Keener prolonged. Categories can include art, precious jewelry, digital photography training, wooden chiselling, minor house furniture, art, scrimshaw, rigide art and cup art.
Disciplines Fest panel administrators currently have known as art work wine glass creator John Goldhagen privileged visitor; he / she will show his standard-setter works. His genius instructions from small-scale sculptured a glass to dining tables, candlesticks, Menorahs and pretty a glass tutorial will be revealed in several non-public things as well like in business enterprise and collections, museums and blocks.
Location designer Blake Twedt, choreographer with Skip Brasstown, formulated the idea of your Song and also Disciplines Lange in support regarding their love for the ecology from the stretch of land, and to come back to mother nature some of exactly what the locality has been created.
Seeing that Twedt reported, "Local firms and even arts-interested citizens own grabbed handle of often the vision for you to launch this kind of day-long honor to painters, musicians in addition to craftsmen on this area and even beyond.
Results of this initial Music and also Arts Holiday will always be largely donated to Cherokee and Clay courts Counties' Food Banks and various other charities. Because admittance towards Fest is actually free, visitors are forced to deliver odds of scripted things coming from their shopping list as being a donation. Ingle's Food Keep which cooperating for a collection point.


text:
Q: Windows 7 deleting files off external HDD I have a 500GB external partitioned into two separate halves. One is for storing things like important documents and other things I don't feel safe having on my internal HDD. The other is formatted into FAT32 and contains movies and music to be accessed from my PS3. (I switch the cables manually for now but plan on buying a switch box) But the problem is only on the "media" half of the HDD where movies and music will disappear for no apparent reason. And on rare occurances, will still show up in Windows but not on PS3.
It's the damnest thing and google and duckduckgo haven't really provided much insight other than "REINSTALL WINDOWS 7!"
From what I can tell, it isn't a virus. My antivirus shows everything as all good. As well as the fact that I use Process Monitor to watch what it's doing from time to time and everything is normal.
So that leaves it down to possible registry errors or somehow my PC, my ISP, or the PS3 are detecting them as illegal (They aren't. I paid for them. But my issues with illegal data being falsely detected are a whole different can of worms for now) downloads and deleting them.
I'm thinking of just reformatting the partition, assigning it a new letter, and downloading everything once again. But I don't know if this will help the registry make new entries for a "new" drive and, therefore, leave my stuff alone.
Any ideas?

A: This may be because of the file type compatibility on the PS3.
If the PS3 cannot play a file on the drive, it may not display it at all. I have noticed this behavior with DLNA devices, and may be the same on the PS3.
Here are the types of files that can be played on the PS3:
http://manuals.playstation.net/document/en/ps3/3_15/video/filetypes.html
Paying particular attention to the 'Hints' section:
Hints

- Depending on the data type, some files may not be playable or some control
  panel options may not function during playback.
- Some video files distributed over the Internet have playback restrictions.
  For details, contact the content provider.
- To play WMV format files, you must go to  (Settings) >  (System Settings)
  and set [Enable WMA Playback].
- When using a USB adaptor to play video files, you may need to use a USB
  adaptor (not included) that supports copyright-protection features (to
  play copyright-protected files).
- When using a USB adaptor to play AVCHD-format video files saved on
  Memory Stick™ media, use a device that supports Hi-Speed USB (USB 2.0).
- WMV format copyright-protected files cannot be played.

A: It is because of the way windows manages files inside that type of filesystem. It happens when the filesystem is not correctly closed (like when you disconnect the drive without using the Remove Safely dialog - but this is not always the case).
Try "repairing" it using CHKDSK /F or the windows dialog. It's almost always that issue.
Good Luck.


The fieldwork experience is done independent of WCSU. Yes, our undergraduate business degrees business, management or technical management do include business management classes, preparing you to manage a number of aspects in the business world.
Concepts and Principles of Behavior Analysis — 45 hours, C. The coursework, fieldwork experience and other requirements specified by the Behavior Analyst Certification Board is required for eligibility to take the BCBA examination.
Behavior Change Systems hours, D. The program is housed in the Education and Educational Psychology Department. The applicant must complete classroom hours of graduate level instruction see Acceptable Coursework below in the following content areas and for the number of hours specified: Write to us at transfer.
Do undergraduate degrees include business management classes? In Australia and New Zealand this degree is awarded in various fields of study and is considered a highly specialized professional degree. The online AAS in Criminal Justice covers a large variety of topics including criminal interviewing and interrogations, criminal law, constitutional law, terrorism, criminal evidence and procedure, corrections, and several other related subject areas.
The accreditation process provides assurance that standards have been met in areas such as curriculum, faculty and student support.
Typical topics covered in this program include accounting, finance, human resources management, communication, product management, organizational management, small business entrepreneurship and business management. Have access to a computer prior to enrolling in the program due the amount of technology used in the curriculum Be able to read, write, and understand the English language at a high level.
The aim of the capstone is to assess students' ability to synthesize and integrate the knowledge and skills they have developed throughout their coursework, rather than introducing new concepts. Invest more time and energy into your coursework to have a higher chance of success.
Courses in the technical specialization are determined by a student career path, field of study and discipline. How is DeVry different from other business management schools? Tap into our nationwide network of alumni for internship and career opportunities Student support. Most programs require students to complete coursework in general education, technical specialization, and general electives and are typically required to earn a minimum number of credits in each area.
General education courses will help students to develop critical thinking, problems solving, communication, and foundational computing skills, as well as the ability to efficiently process quantitative data.
Learn More About USC Accomplished Faculty of Practitioners The professors who deliver our online applied psychology program are active practitioners who speak the language of business and understand the science of applied psychology, offering expertise from executive-level experience.See Yourself Succeed with an MS in Applied Economics.
To paraphrase distinguished economist David Colander, economics is the interconnectedness of the political and sociological dimensions of a problem. The Bachelor of Applied Science (BAS) in Supervision and Management prepares graduates for leadership roles and positions in a variety of industries.
The upper-level coursework includes applied management practices, which allows students the opportunity to apply acquired knowledge, skills and.
Our website is No. 1 in Nursing Essay Writing and Nursing Assignment Help.
Feel free to hire us for Nursing Homework Help and Assistance. This bar-code number lets you verify that you're getting exactly the right version or edition of a book.
The digit and digit formats both work. The Bachelor of Applied Science, often abbreviated as agronumericus.com, BAS, BSAS, BASc, agronumericus.com, or BAppSc, is an undergraduate degree.
Overview. The University of Alberta's Applied Land Use Planning (ALUP) program supports the learning needs of professionals in the areas of municipal government planning, development, and bylaw enforcement.
Designed to match the complexity of a variety of municipal government planning needs, this program allows students to use theories and models as a means to address problems, apply.


text:
Gondola system for Walt Disney World transportation confirmed in planning documents
Reedy Creek notes refer to six stations with three lines linking Disney's Hollywood Studios, Epcot, Caribbean Beach Resort and the lakeside area between Pop Century and the Art of Animation resorts.
Read more from The Orlando Sentinel.
Disney's Animal Kingdom
The reported location of the stations makes me question the intention. Up charge? For funzies? Proof of concept for future gondola expansion?
I have stayed at Caribbean Beach and found it to be painful to use with the buses because of its multiple stops. Buses from POP were frequent and easy to use. Is there something about these resorts that make them problematic for the buses that this could alleviate?
That's a good question, and it also brings up a strange broken thing about the system: The cheap-o mega-hotels always have more frequent and adequate bus service than the better hotels. Getting to AK or MK from Beach Club always seemed like a pain in the ass, despite rooms at 3x the cost. Pop Century may have giant, crowded buses, but you rarely wait long for them at the hotel or the parks.
Jeff - Editor - CoasterBuzz.com - My Blog - Phrazy
Jeff said:
The cheap-o mega-hotels always have more frequent and adequate bus service than the better hotels. Getting to AK or MK from Beach Club always seemed like a pain in the ass, despite rooms at 3x the cost. Pop Century may have giant, crowded buses, but you rarely wait long for them at the hotel or the parks.
Being a deluxe resort fanboy myself, I would agree with this observation. Furthermore, depending on the time of year, some of the deluxe resorts share bus service across multiple resorts, which is also a pain in the ass; especially when I'm paying $300+ night for a room. I've even seen all of the Epcot resorts including Swan/Dolphin share a bus loop a few times.
On a side note, I am personally more interested in these cable skyways for the ride itself more than the transportation aspect. Since the cable skyway purge of the 80's, its a rare ride at American theme parks. It's one reason I like Busch Gardens, they have kept theirs.
Purely anecdotal, but we stayed at the Caribbean in October 2015 and found the frequency of the buses to be pretty solid. Yeah, there are a handful of stops at the resort itself, but they moved through each one pretty quickly and they weren't always completely packed when they hit our stop. Coming back late in the evening from MK was more time consuming and there was always a wait for the bus, but I think we were always back in our room less than an hour after we walked out of the gate, usually less than 45 minutes. We're probably taking an early June trip and staying at All Star Sports, so I'm interested in seeing how that works with their more centralized pick up.
In February we were at a monorail resort, which was pricey. Occasionally we found the bus service to be less than adequate, and it varied depending on time of day. A couple of things may have come into play there. With two parks accessible to us via monorail, the bus routes went to the other two, the water park that was open, and Disney Springs. So they may have run with the same frequency, we just saw fewer busses. But sometimes we would stop at Poly, Contemporary, and Fort Wilderness too, especially on the way home. It changed a 10 minute trip to more like 30 or more. One evening we waited an awfully long time for a bus from DS and I mentioned in a trip report that we had to Uber from a couple of dinners because the transportation had stopped for the evening.
All in all it wasn't totally heinous, and I tried not to feel entitled to better service because we were paying more.
Like others, I'd look forward to the gondolas from a "fun" perspective, but unless my resort was the destination or I was trying to get from Studios to EPCOT I can't imagine taking the time out of a day to do it. From these alleged plans I can see they wouldn't have made my life at Grand any grander.
Has there been any talk of the number of gondolas that will be in use? Until we know the true capacity I'm not sure we can guess on the intent. Having been up there multiple times last year I know that Buena Vista Drive (the major road that divides Epcot and Disney Studios) is one of the most congested areas on property. Star Wars and Pixar Lands are just going to make that worse. If they can get significant numbers of resort guests from those adjacent hotels to those two parks onto above ground transportation it could certainly help.
I didn't consider traffic (as I have never driven on property).
The article cites "the technology" can accommodate 800-3000 pph.
I keep hearing about "documents" and "permits" but I never seen any on here, other sites or Google. Anyone have links? Curious to see any hints on what Disney is investigating.
Last edited by Concrete Enchilada,
Astroworld.....Gone But Not Forgotten
WDWMagic is the go-to site for RCID/Orange County permits. The original sleuthing for the gondola system is here:
http://forums.wdwmagic.com/threads/new-gondola-transportation.924477/
http://cse.umich.edu/
This is very interesting, but I've got to wonder how reliable it will be over time. Correct me if I'm wrong, but these systems do not seem to run well in thunderstorms, which seem to be quite prevalent in Florida. Obviously, getting people up and off of the ground is key to cutting down on the traffic issues, but I'm just not seeing this as a huge transportation mechanism. Even at 1500 PPH, that's really only the equivalent of 6 monorail trains per hour... Not designed for large numbers of people.
The other challenge is that it really doesn't do anything for traffic excepting those two resorts. If you are at any of the other resorts, you still end up going by bus.
Thunderstorms only occur at 3:30 p.m. daily from late June to early September, so that's no problem.
But, per the article:
"As ridership increases, additional cabins can be added. Capacities range from 800 to 3,000 people per hour, per direction."
So that's 12 trains per hour :)
Sounds like a good time to run a parade.
OhioStater said:
This is interesting and if accurate would indicate that it may be a different system than the traditional gondola. I spend most of the colder months on skis and have never seen a gondola that adjusts cabin numbers based on crowds.
I suspect it's an overnight thing and not an on the fly thing. Adding or removing cabins from a gondola (in most systems) is a pretty extensive process and requires a shutdown of the entire system.
ApolloAndy said:
I've seen a cabin removed for maintenance issues and it's a full stop, 20 minute issue. Just last week we were in Whistler and the Blackcomb gondola was down for a bit because of spacing issues. Which I assume is like some sort of block breach in the upper, lower or midstation terminals. It would definitely be a challenge to get a system up that could add or remove cabins, and not really sure what the benefit would be than to just have all the cabins on the cable as existing gondolas have.
I don't buy that it's a hard problem to solve. Look at any amusement park sky ride, where it takes very little time to add or remove capacity for 4-person tubs. You can't convince me that concept can't scale.
What Jeff said. Any system that uses detachable gondolas would be able to add or remove gondolas at will in a matter of *seconds*. And if the system is designed to load and unload while gondolas are moving, then the use of a detachable system is pretty much a requirement....otherwise you end up with something more like the system at Glenwood Caverns where they have four sets of three gondolas and the system has to stop halfway up the mountain to load the other two sets.
I would guess that a WDW system would make use of fairly large gondolas, if only to accommodate the non-trivial number of small wheeled vehicles they would be called on to carry (holding "children of all ages"). Probably each gondola about the size of a small bus, but perhaps with far less (or no) seating and no-threshhold loading.
As for thunderstorms...it's worth noting that a suspended gondola has no direct path to ground except via the suspension ropes. That makes it not an especially attractive target for lightning. The towers on the other hand would be exceptionally good lightning targets, but those can be outfitted appropriately to protect the ropes and gondolas.
--Dave Althoff, Jr.
/X\        _      *** Respect rides. They do not respect you. ***
/XXX\      /X\     /X\_      _     /X\__      _     _        _____
/XXXXX\    /XXX\   /XXXX\_   /X\   /XXXXX\    /X\   /X\      /XXXXX
_/XXXXXXX\__/XXXXX\/XXXXXXXX\_/XXX\_/XXXXXXX\__/XXX\_/XXX\_/\_/XXXXXX