text:
LongJump, a provider of software that powers Platform-as-a-Service (PaaS), has updated its LongJump Business Applications Platform. Version 6.2 includes features that enable enterprises and ISVs to deliver secure web applications that address unique business problems or a specific vertical market.
The new features of LongJump, geared towards private cloud applications, focus on giving developers tools to automatically create unique and dynamic user experiences, certifying information and processes, and adding greater depth to the data model.
Features include:
- Dynamic, Rule-based Layouts that automatically adjust the section and field visibility based on business rules and criteria.
- Multiple Layout Styles including wizard, accordion, tab and sectional and mixed mode layouts so developers can select the best method for viewing or editing information.
- Multiple View Styles including list, tree and thumbnail and mixed mode views provide developers with flexibility in how users interact with application data.
- Role-based Workspace Configuration Control lets developers present dynamic data, widgets, or other useful application information.
- Translation Workbench lets developers create and publish a multi-tenant application in multiple languages. Each user sees the language specific to their profile.
- Digital Signature Support including multiple hierarchical signature blocks.
- Field-level Change Tracking and Auditing and record level event driven snapshots.
- Data Model Inheritance: N-level object inheritance support creates design efficiency.
- Workflow Inheritance support for workflows created on parent objects will be inherited by child objects. Also applies to data policies, validations, layouts and indexes.
- Object Model Viewer helps developers visualize entity relationships.
- Automated Remote Package Deployment further streamlines the process of packaging and deploying applications between development, testing and production instances.
- Automated Upgrades provide the developer with controls to either automatically push grades, let the user manually upgrade, or selectively upgrade groups of subscribers.
"Taking your business to a SaaS delivery model requires a robust, mature approach with a very rich set of tools," says LongJump's Pankaj Malviya. "With this latest enhanced release, we're providing developers from private enterprise, to government agencies, to international corporations with a flexible, secure platform to deliver applications that outfit them with the solution and broad toolset to design and build applications that unique fit their business."


text:
City Epoxy has been serving the world with the best premium epoxy products and installations since 2005. We provide the best commercial , installation , and certification services in the United States Of America. Top of the line quality premium epoxy products & expert manufactured certified installations. The best guarantees & services in the industry. Fully licensed and insured with references. We provide the best epoxy flooring products , services and installations. We are located in Lancaster, PA "No Job Too Small Or Too Big". #1 Epoxy Industrial Flooring Systems Berks County Pennsylvania.
(717) 393 – 3098
Epoxy Industrial Flooring Systems Berks County Pennsylvania
Richard Rineer attended J.P. McCaskey High School where he played football and track and graduated in 1983. After school Richard enlisted in the U.S. Marine Corps where he was a 60 cal machine gunner. During his 4 years in the Marines Richard had the opportunity to travel around the world visiting places like Japan, Korea, Panama, Philippines, and many other Far East countries. Since 1998 Richard Rineer has been a General Contractor in the construction industry. Having owned several companies from trim work to total renovations of city homes.
Customers are always looking for alternatives for flooring, each room has its own character and the flooring is a main part. City Epoxy offers an alternative. Our Premium Resin Rich Epoxy Products allow us to go over most all substrates. So regardless if it's concrete, wood, ceramic, stone, vinyl, tile, or laminate City Epoxy has an alternative. Our customers have used our products on floors, showers, bathrooms, laundry rooms, kitchens, garages, counter tops, pool areas, pool decking, tub and shower repair, bar tops, basements and truck beds for customers looking for an alternative.
For the customer that wants a classier looking floor City Epoxy offers boarders, inlays, cove base and custom color combinations. So if you're looking for an alternative flooring for your family and pets or just want a easy to clean, long lasting, slip resistant and durable floor. City Epoxy Premium Resin Rich Epoxy Products can help.
Epoxy Industrial Flooring Systems Berks County Pennsylvania
When a hospital, institute of learning, restaurant or any type of business are forced to replace or install new flooring due to wear and tear, remodel or just a new floor they will have many options, from carpet to tile and wood to epoxy. At City Epoxy we understand that. Our Premium Resin Rich Epoxy Products are formulated to adhere to many substrates eliminating long rip outs and demolition time. At City Epoxy our installation crews work to get the job complete, so that your daily operation can return to normal.
City Epoxy products are designed for easy maintenance. Bathroom and shower areas in the commercial market are the most common areas where we install our Premium Resin Rich Epoxy Products, WHY? To eliminate the urine smell from the restrooms, to have a clean shower area that is slip resistant. City Epoxy seamless floors allow no penetration, all dirt lies on the top of the epoxy sealer.
Regardless of the business, if you're looking for an easy to cleaning, low VOC, durable, slip resistant epoxy flooring Product City Epoxy can help.
Epoxy Industrial Flooring Systems Berks County Pennsylvania
Commercial fishing and shipping industry require the crew to live on the ship for week's even months at a time. City Epoxy Products were developed in the 70's for military use on coast guard and navy ships. Today that same product is being use in the gallies, passage ways, heads, berthing areas and showers on commercial fishing boats, commercial barge ships, pleasure boats, and luxury yachts. Epoxy flooring for ships must flex, City Epoxy products are designed to flex. Our underlayment system along with our epoxy flooring and sealer provide a durable, slip resistant, low maintenance floor that has proven it works over time, that's why they still use it.
Since 2005 City Epoxy has been installing Premium Epoxy Flooring Product throughout the U.S. on various substrates and applications. Our mission is to provide the highest quality materials, experienced installers, and a floor that will last. During these years we have developed new tools for our installers, advanced training program for certification and a client list that stretches from coast to coast. Our clients have ranged from animal shelters to VA ( Veterans Association ) Hospitals, all with one thing in common, they all wanted a long lasting, slip resistant, waterproof, low VOC, a very beautiful floor to look at. City Epoxy believes that we have a floor for everybody's budget and style.
City Epoxy has been serving the world with the best premium epoxy products and installations since 2005. We provide the best commercial , installation , and certification services in the United States Of America. Since 2005 We have been serving the Tri-State area with the best commercial & residential epoxy flooring services and products. City Epoxy Products were developed in the 70s for military use on coast guard and navy ships. City Epoxy uses only the best quality products for your Marina epoxy flooring needs. Customers are always looking for alternatives for flooring, each room has its own character and the flooring is a main part. City Epoxy offers an alternative for home owners.

subset: commoncrawl


text:
- Methodology article
- Open Access
Multiple graph regularized protein domain ranking
- Jim Jing-Yan Wang1,
- Halima Bensmail2 and
- Xin Gao1, 3Email author
© Wang et al; licensee BioMed Central Ltd. 2012
- Received: 22 May 2012
- Accepted: 29 October 2012
- Published: 19 November 2012
Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.
To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.
The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.
- Protein Domain
- Graph Weight
- Ranking Score
- Graph Regularization
- Fold Level
Proteins contain one or more domains each of which could have evolved independently from the rest of the protein structure and which could have unique functions[1, 2]. Because of molecular evolution, proteins with similar sequences often share similar folds and structures. Retrieving and ranking protein domains that are similar to a query protein domain from a protein domain database are critical tasks for the analysis of protein structure, function, and evolution[3–5]. The similar protein domains that are classified by a ranking system may help researchers infer the functional properties of a query domain from the functions of the returned protein domains.
The output of a ranking procedure is usually a list of database protein domains that are ranked in descending order according to a measure of their similarity to the query domain. The choice of a similarity measure largely defines the performance of a ranking system as argued previously[6]. A large number of algorithms for computing similarity as a ranking score have been developed:
Pairwise protein domain comparison algorithms compute the similarity between a pair of protein domains either by protein domain structure alignment or by comparing protein domain features. Protein structure alignment based methods compare protein domain structures at the level of residues and sometime even atoms, to detect structural similarities with high sensitivity and accuracy. For example, Carpentier et al. proposed YAKUSA[7] which compares protein structures using one-dimensional characterizations based on protein backbone internal angles, while Jung and Lee proposed SHEBA[8] for structural database scanning based on environmental profiles. Protein domain feature based methods extract structural features from protein domains and compute their similarity using a similarity or distance function. For example, Zhang et al. used the 32-D tableau feature vector in a comparison procedure called IR tableau[3], while Lee and Lee introduced a measure called WDAC (Weighted Domain Architecture Comparison) that is used in the protein domain comparison context[9]. Both these methods use cosine similarity for comparison purposes.
Graph-based similarity learning algorithms use the traditional protein domain comparison methods mentioned above that focus on detecting pairwise sequence alignments while neglecting all other protein domains in the database and their distributions. To tackle this problem, a graph-based transductive similarity learning algorithm has been proposed[6, 10]. Instead of computing pairwise similarities for protein domains, graph-based methods take advantage of the graph formed by the existing protein domains. By propagating similarity measures between the query protein domain and the database protein domains via graph transduction (GT), a better metric for ranking database protein domains can be learned.
The main component of graph-based ranking is the construction of a graph as the estimation of intrinsic manifold of the database. As argued by Cai et al.[11], there are many ways to define different graphs with different models and parameters. However, up to now, there are, in general, no explicit rules for choice of graph models and parameters. In[6], the graph parameters were determined by a grid-search of different pairs of parameters. In[11], several graph models were considered for graph regularization, and exhaustive experiments were carried out for the selection of a graph model and its parameters. However, these kinds of grid-search strategies select parameters from discrete values in the parameter space, and thus lack the ability to approximate an optimal solution. At the same time, cross-validation[12, 13] can be used for parameter selection, but it does not always scale up very well for many of the graph parameters, and sometimes it might over-fit the training and validation set while not generalizing well on the query set.
In[14], Geng et al. proposed an ensemble manifold regularization (EMR) framework that combines the automatic intrinsic manifold approximation and semi-supervised learning (SSL)[15, 16] of a support vector machine (SVM)[17, 18]. Based on the EMR idea, we attempted to solve the problem of graph model and parameter selection by fusing multiple graphs to obtain a ranking score learning framework for protein domain ranking. We first outlined the graph regularized ranking score learning framework by optimizing ranking score learning with both relevant and graph constraints, and then generalized it to the multiple graph case. First a pool of initial guesses of the graph Laplacian with different graph models and parameters is computed, and then they are combined linearly to approximate the intrinsic manifold. The optimal graph model(s) with optimal parameters is selected by assigning larger weights to them. Meanwhile, ranking score learning is also restricted to be smooth along the estimated graph. Because the graph weights and ranking scores are learned jointly, a unified objective function is obtained. The objective function is optimized alternately and conditionally with respect to multiple graph weights and ranking scores in an iterative algorithm. We have named our Multi ple G raph regularized Rank ing method MultiG-Rank. It is composed of an off-line graph weights learning algorithm and an on-line ranking algorithm.
Graph model and parameter selection Given a data set of protein domains represented by their tableau 32-D feature vectors[3], where is the tableau feature vector of i-th protein domain, x q is the query protein domain, and the others are database protein domains. We define the ranking score vector as in which f i is the ranking score of x i to the query domain. The problem is to rank the protein domains in in descending order according to their ranking scores and return several of the top ranked domains as the ranking results so that the returned protein domains are as relevant to the query as possible. Here we define two types of protein domains: relevant when they belong to the same SCOP fold type[19], and irrelevant when they do not. We denote the SCOP-fold labels of protein domains in as, where l i is the label of i-th protein domain and l q is the query label. The optimal ranking scores of relevant protein domains {x i },l i = l q should be larger than the irrelevant ones {x i },l i ≠ l q , so that the relevant protein domains will be returned to the user.
Graph regularized protein domain ranking
We applied two constraints on the optimal ranking score vector f to learn the optimal ranking scores:
Relevance constraint Because the query protein domain reflects the search intention of the user, f should be consistent with protein domains that are relevant to the query. We also define a relevance vector of the protein domain as where y i = 1, if x i is relevant to the query and y i = 0 if it is not. Because the type label l q of a query protein domain x q is usually unknown, we know only that the query is relevant to itself and have no prior knowledge of whether or not others are relevant; therefore, we can only set y q = 1 while y i , i ≠ q is unknown.
where D is a diagonal matrix whose entries are and L = D − W is the graph Laplacian matrix. This is a basic identity in spectral graph theory and it provides some insight into the remarkable properties of the graph Laplacian.
where α is a trade-off parameter of the smoothness penalty. The solution is obtained by setting the derivative of O(f) with respect to f to zero as f = (U + αL)−1U y. In this way, information from both the query protein domain provided by the user and the relationship of all the protein domains in are used to rank the protein domains in. The query information is embedded in y and U, while the protein domain relationship information is embedded in L. The final ranking results are obtained by balancing the two sources of information. In this paper, we call this method G raph regularized Rank ing (G-Rank).
Multiple graph learning and ranking: MultiG-Rank
Here we describe the multiple graph learning method to directly learn a self-adaptive graph for ranking regularization The graph is assumed to be a linear combination of multiple predefined graphs (referred to as base graphs). The graph weights are learned in a supervised way by considering the SCOP fold types of the protein domains in the database.
Multiple graph regularization
The main component of graph regularization is the construction of a graph. As described previously, there are many ways to find the neighbors of x i and to define the weight matrix W on the graph[11]. Several of them are as follows:
Gaussian kernel weighted graph: of x i is found by comparing the squared Euclidean distance as,(4)
where σ is the bandwidth of the kernel.
Dot-product weighted graph: of x i is found by comparing the squared Euclidean distance and the weighting is computed as the dot-product as,(6)
Cosine similarity weighted graph: of x i is found by comparing cosine similarity as,(7)
Tanimoto coefficient weighted graph: of x i is found by comparing the Tanimoto coefficient as,(11)
With so many possible choices of graphs, the most suitable graph with its parameters for the protein domain ranking task is often not known in advance; thus, an exhaustive search on a predefined pool of graphs is necessary. When the size of the pool becomes large, an exhaustive search will be quite time-consuming and sometimes not possible. Hence, a method for efficiently learning an appropriate graph to make the performance of the employed graph-based ranking method robust or even improved is crucial for graph regularized ranking. To tackle this problem we propose a multiple graph regularized ranking framework, that provides a series of initial guesses of the graph Laplacian and combines them to approximate the intrinsic manifold in a conditionally optimal way, inspired by a previously reported method[14].
where μ m is the weight of m-th graph. To avoid any negative contribution, we further constrain
where μ = [μ1,⋯,μ M ]⊤ is the graph weight vector.
Off-line supervised multiple graph learning
To avoid the parameter μ over-fitting to one single graph, we also introduce the l2 norm regularization term ||μ||2 to the object function. The difference between f q and y q should be noted: f q ∈{1,0} N plays the role of the given ground truth in the supervised learning procedure, while is the variable to be solved. While f q is the ideal solution of y q , it is not always achieved after the learning. Thus, we introduce the first term in (16) to make y q as similar to f q as possible during the learning procedure.
Object function
where F =[f1,⋯,f N ] is the ranking score matrix with the q-th column as the ranking score vector of q-th protein domain, and Y =[y1,⋯,y N ] is the relevance matrix with the q-th column as the relevance vector of the q-th protein domain.
Because direct optimization to (17) is difficult, instead we adopt an iterative, two-step strategy to alternately optimize F and μ. At each iteration, either F or μ is optimized while the other is fixed, and then the roles are switched. Iterations are repeated until a maximum number of iterations is reached.
Optimizing F: By fixing μ, the analytic solution for (17) can be easily obtained by setting the derivative of O(F,μ) with respect to F to zero. That is,(18)
Optimizing μ: By fixing F and removing items irrelevant to μ from (17), the optimization problem (17) is reduced to,(19)
where e m = Tr(F⊤L m F) and e =[e1,⋯,e M ]⊤. The optimization of (19) with respect to the graph weight μ can then be solved as a standard quadratic programming (QP) problem[4].
Off-line algorithm
The off-line μ learning algorithm is summarized as Algorithm 1
Algorithm 1.
MultiG-Rank: off-line graph weights learning algorithm.
Require: Candidate graph Laplacians set;
Require: SCOP type label set of database protein domains;
Require: Maximum iteration number T;
Construct the relevance matrix Y =[y iq ]N×N where y iq if l i = l q , 0 otherwise; Initialize the graph weights as, m = 1,⋯,M;
for t = 1,⋯,T do
Update the ranking score matrix F t according to
previous by (18);
Update the graph weight μ t according to
updated F t by (19);
end for Output graph weight μ = μ t .
On-line ranking regularized by multiple graphs
Given a newly discovered protein domain submitted by a user as query x0, its SCOP type label l0 will be unknown and the domain will not be in the database. To compute the ranking scores of to query x0, we extend the size of database to N + 1 by adding x0into the database and then solve the ranking score vector for x0 which is defined as using (3). The parameters in (3) are constructed as follows:
Laplacian matrix L: We first compute the m graph weight matrices with their corresponding Laplacian matrices for the extended database {x0,x1,⋯,x N }. Then with the graph weight μ learned by Algorithm 1, the new Laplacian matrix L can be computed as in (13).On-line graph weight computation: When a new query x0 is added to the database, we calculate its K nearest neighbors in the database and the corresponding weights W0j and Wj 0, j = 1,⋯,N. If adding this new query to the database does not affect the graph i n the database space, the neighbors and weights W ij , i,j = 1,⋯,N for the protein domains in the database are fixed and can be pre-computed off-line. Thus, we only need to compute N edge weights for each graph instead of (N + 1) × (N + 1).
Relevance vector y: The relevance vector for x0 is defined as with only y0 = 1 known and y i , i = 1,⋯,N unknown.
Matrix U: In this situation, U is a (N + 1)×(N + 1)diagonal matrix with U00 = 1 and U ii = 0, i = 1,⋯,N.
The on-line ranking algorithm is summarized as Algorithm 2
Algorithm 2.
MultiG-Rank: on-line ranking algorithm.
Require: protein domain database;
Require: Query protein domain x0;
Require: Graph weight μ;
Extend the database to (N + 1) size by adding x0 and compute M graph Laplacians of the extended database; Obtain multiple graph Laplacian L by linear combination of M graph Laplacians with weight μ as in (13); Construct the relevance vector where y0 = 1 and diagonal matrix with U ii = 1 if i = 0 and 0 otherwise; Solve the ranking vector f for x0 as in (20); Ranking protein domains in according to ranking scores f in descending order.
Protein domain database and query set
We used the SCOP 1.75A database[21] to construct the database and query set. In the SCOP 1.75A database, there are 49,219 protein domain PDB entries and 135,643 domains, belonging to 7 classes and 1,194 SCOP fold types.
Protein domain database
Query set
We also randomly selected 540 protein domains from the SCOP 1.75A database to construct a query set. For each query protein domain that we selected we ensured that there was at least one protein domain belonging to the same SCOP fold type in the ASTRAL SCOP 1.75A 40% database, so that for each query, there was at least one "positive" sample in the protein domain database. However, it should be noted that the 540 protein domains in the query data set were randomly selected and do not necessarily represent 540 different folds. Here we call our query set the 540 query dataset because it contains 540 protein domains from the SCOP 1.75A database.
Evaluation metrics
By varying the length of the returned list, different TPR, FRP, recall and precision values are obtained.
ROC curve
Using FPR as the abscissa and TPR as the ordinate, the ROC curve can be plotted. For a high-performance ranking system, the ROC curve should be as close to the top-left corner as possible.
Recall-precision curve
Using recall as the abscissa and precision as the ordinate, the recall-precision curve can be plotted. For a high-performance ranking system, this curve should be close to the top-right corner of the plot.
The AUC is computed as a single-figure measurement of the quality of an ROC curve. AUC is averaged over all the queries to evaluate the performances of different ranking methods.
Results and discussion
We first compared our MultiG-Rank against several popular graph-based ranking score learning methods for ranking protein domains. We then evaluated the ranking performance of MultiG-Ranking against other protein domain ranking methods using different protein domain comparison strategies. Finally, a case study of a TIM barrel fold is described.
Comparison of MultiG-Rank against other graph-based ranking methods
The figure shows the ROC and the recall-precision curves obtained using the different graph ranking methods. As can be seen, the MultiG-Rank algorithm significantly outperformed the other graph-based ranking algorithms; the precision difference got larger as the recall value increased and then tend to converge as the precision tended towards zero (Figure2 (b)). The G-Rank algorithm outperformed GT in most cases; however, both G-Rank and GT were much better than the pairwise ranking which neglects the global distribution of the protein domain database.
AUC results off different graph-based ranking methods
- 1.
G-Rank and GT produced similar performances on our protein domain database, indicating that there is no significant difference in the performance of the graph transduction based or graph regularization based single graph ranking methods for unsupervised learning of the ranking scores.
- 2.
Pairwise ranking produced the worst performance even though the method uses a carefully selected similarity function as reported in [3]. One reason for the poorer performance is that similarity computed by pairwise ranking is focused on detecting statistically significant pairwise differences only, while more subtle sequence similarities are missed. Hence, the variance among different fold types cannot be accurately estimated when the global distribution is neglected and only the protein domain pairs are considered. Another possible reason is that pairwise ranking usually produces a better performance when there is only a small number of protein domains in the database; therefore, because our database contains a large number of protein domains, the ranking performance of the pairwise ranking method was poor.
- 3.
MultiG-Rank produced the best ranking performance, implying that both the discriminant and geometrical information in the protein domain database are important for accurate ranking. In MultiG-Rank, the geometrical information is estimated by multiple graphs and the discriminant information is included by using the SCOP-fold type labels to learn the graph weights.
Comparison of MultiG-Rank with other protein domain ranking methods
AUC results for different protein domain ranking methods
IR Tableau
QP tableau
The results in Table2 show that with the advantage of exploring data characteristics from various graphs, MultiG-Rank can achieve significant improvements in the ranking outcomes; in particular, AUC is increased from 0.9478 to 0.9730 in MultiG-Rank which uses the same Tableau feature as IR Tableau. MultiG-Rank also outperforms QP Tableau, SHEBA, and YAKUSA; and AUC improves from 0.9364, 0.9421 and 0.9537, respectively, to 0.9730 with MultiG-Rank. Furthermore, because of its better use of effective protein domain descriptors, IR Tableau outperforms QP Tableau.
To evaluate the effect of using protein domain descriptors for ranking instead of direct protein domain structure comparisons, we compared IR Tableau with YAKUSA and SHEBA. The main differences between them are that IR Tableau considers both protein domain feature extraction and comparison procedures, while YAKUSA and SHEBA compare only pairs of protein domains directly. The quantitative results in Table2 show that, even by using the additional information from the protein domain descriptor, IR Tableau does not outperform YAKUSA.
This result strongly suggests that ranking performance improvements are achieved mainly by graph regularization and not by using the power of a protein domain descriptor.
Plots of TPR versus FPR obtained using MultiG-Rank and various field-specific protein domain ranking methods as the ranking algorithms are shown in Figure3 (a) and the recall-precision curves obtained using them are shown in Figure3 (b). As can be seen from the figure, in most cases, our MultiG-Rank algorithm significantly outperforms the other protein domain ranking algorithms. The performance differences get larger as the length of the returned protein domain list increases. The YAKUSA algorithm outperforms SHEBA, IR Tableau and QP Tableau in most cases. When only a few protein domains are returned to the query, the sizes of both the true positive samples and the false positive samples are small, showing that, in this case, all the algorithms yield low FPR and TPR. As the number of returned protein domains increases, the TPR of all of the algorithms increases. However, MultiG-Rank tends to converge when the FPR is more than 0.3, whereas the other ranking algorithms seems to converge only when the FPR is more than 0.5.
Case Study of the TIM barrel fold
Besides considering the results obtained for the whole database, we also studied an important protein fold, the TIM beta/alpha-barrel fold (c.1). The TIM barrel is a conserved protein fold that consists of eight α-helices and eight parallel β-strands that alternate along the peptide backbone[22]. TIM barrels are one of the most common protein folds. In the ASTRAL SCOP 1.75A %40 database, there are a total of 373 proteins belonging to 33 different superfamilies and 114 families that have TIM beta/alpha-barrel SCOP fold type domains,. In this case study, the TIM beta/alpha-barrel domains from the query set were used to rank all the protein domains in the database. The ranking was evaluated both at the fold level of the SCOP classification and at lower levels of the SCOP classification (ie. superfamily level and family level). To evaluate the ranking performance, we defined "true positives" at three levels:
Fold level
When the returned database protein domain is from the same fold type as the query protein domain.
Superfamily level
When the returned database protein domain is from the same superfamily as the query protein domain.
Family level
When the returned database protein domain is from the same family as the query protein domain.
The proposed MultiG-Rank method introduces a new paradigm to fortify the broad scope of existing graph-based ranking techniques. The main advantage of MultiG-Rank lies in its ability to represent the learning of a unified space of ranking scores for protein domain database in multiple graphs. Such flexibility is important in tackling complicated protein domain ranking problems because it allows more prior knowledge to be explored for effectively analyzing a given protein domain database, including the possibility of choosing a proper set of graphs to better characterize diverse databases, and the ability to adopt a multiple graph-based ranking method to appropriately model relationships among the protein domains. Here, MultiG-Rank has been evaluated comprehensively on a carefully selected subset of the ASTRAL SCOP 1.75 A protein domain database. The promising experimental results that were obtained further confirm the usefulness of our ranking score learning approach.
The study was supported by grants from National Key Laboratory for Novel Software Technology, China (Grant No. KFKT2012B17), 2011 Qatar Annual Research Forum Award (Grant No. ARF2011), and King Abdullah University of Science and Technology (KAUST), Saudi Arabia. We appreciate the valuable comments from Prof. Yuexiang Shi, Xiangtan University, China.
Authors' Affiliations
- Zhang Y, Sun Y: HMM-FRAME: accurate protein domain classification for metagenomic sequences containing frameshift errors. BMC Bioinformatics 2011, 12: 198. 10.1186/1471-2105-12-198PubMed CentralView ArticlePubMedGoogle Scholar
- Ochoa A, Llinas M, Singh M: Using context to improve protein domain identification. BMC Bioinformatics 2011, 12: 90. 10.1186/1471-2105-12-90PubMed CentralView ArticlePubMedGoogle Scholar
- Zhang L, Bailey J, Konagurthu AS, Ramamohanarao K: A fast indexing approach for protein structure comparison. BMC Bioinformatics 2010, 11(Suppl 1):S46. 10.1186/1471-2105-11-S1-S46PubMed CentralView ArticlePubMedGoogle Scholar
- Stivala A, Wirth A Stuckey: Tableau-based protein substructure search using quadratic programming. BMC Bioinformatics 2009, 10: 153. 10.1186/1471-2105-10-153PubMed CentralView ArticlePubMedGoogle Scholar
- Stivala AD, Stuckey PJ, Wirth AI: Fast and accurate protein substructure searching with simulated annealing and GPUs. BMC Bioinformatics 2010, 11: 446. 10.1186/1471-2105-11-446PubMed CentralView ArticlePubMedGoogle Scholar
- Bai X, Yang X, Latecki LJ, Liu W, Tu Z: Learning Context-Sensitive Shape Similarity by Graph Transduction. IEEE Transactions on Pattern Analysis and Machine Intelligence 2010, 32(5):861–874.View ArticlePubMedGoogle Scholar
- Carpentier M, Brouillet S, Pothier J: YAKUSA: A fast structural database scanning method. Proteins-Structure Function and Bioinformatics 2005, 61(1):137–151. 10.1002/prot.20517View ArticleGoogle Scholar
- Jung J, Lee B: Protein structure alignment using environmental profiles. Protein Engineering 2000, 13(8):535–543. 10.1093/protein/13.8.535View ArticlePubMedGoogle Scholar
- Lee B, Lee D: Protein comparison at the domain architecture level. BMC Bioinformatics 2009, 10(Suppl 15):S5. 10.1186/1471-2105-10-S15-S5PubMed CentralView ArticlePubMedGoogle Scholar
- Weston J, Kuang R, Leslie C, Noble W: Protein ranking by semi-supervised network propagation. BMC Bioinformatics 2006, 7(Suppl 1):S10. 10.1186/1471-2105-7-S1-S10PubMed CentralView ArticlePubMedGoogle Scholar
- Cai D, He X, Han J, Huang TS: Graph Regularized Nonnegative Matrix Factorization for Data Representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 2011, 33(8):1548–1560.View ArticlePubMedGoogle Scholar
- Varma S, Simon R: Bias in error estimation when using cross-validation for model selection. BMC Bioinformatics 2006, 7: 91. 10.1186/1471-2105-7-91PubMed CentralView ArticlePubMedGoogle Scholar
- Nagel K, Jimeno-Yepes A, Rebholz-Schuhmann D: Annotation of protein residues based on a literature analysis: cross-validation against UniProtKb. BMC Bioinformatics 2009, 10(Suppl 8):S4. 10.1186/1471-2105-10-S8-S4PubMed CentralView ArticlePubMedGoogle Scholar
- Geng B, Tao D, Xu C, Yang L, Hua X: Ensemble Manifold Regularization. IEEE Transactions on Pattern Analysis and Machine Intelligence 2012, 34(6):1227–1233.View ArticlePubMedGoogle Scholar
- You ZH, Yin Z, Han K, Huang DS, Zhou X: A semi-supervised learning approach to predict synthetic genetic interactions by combining functional and topological properties of functional gene network. BMC Bioinformatics 2010, 11: 343. 10.1186/1471-2105-11-343PubMed CentralView ArticlePubMedGoogle Scholar
- Song M, Yu H, Han WS: Combining active learning and semi-supervised learning techniques to extract protein interaction sentences. BMC Bioinformatics 2011, 12(Suppl 12):S4. 10.1186/1471-2105-12-S12-S4View ArticleGoogle Scholar
- Kandaswamy KK, Pugalenthi G, Hazrati MK, Kalies KU, Martinetz T: BLProt: prediction of bioluminescent proteins based on support vector machine and relieff feature selection. BMC Bioinformatics 2011, 12: 345. 10.1186/1471-2105-12-345PubMed CentralView ArticlePubMedGoogle Scholar
- Tung CW, Ziehm M, Kaemper A, Kohlbacher O, Ho SY: POPISK: T-cell reactivity prediction using support vector machines and string kernels. BMC Bioinformatics 2011, 12: 446. 10.1186/1471-2105-12-446PubMed CentralView ArticlePubMedGoogle Scholar
- Shi JY, Zhang YN: Fast SCOP classification of structural class and fold using secondary structure mining in distance matrix. In Pattern Recognition in Bioinformatics. Proceedings 4th IAPR International Conference, PRIB 2009. ENGLAND: Sheffield; 2009:344–53.Google Scholar
- Albatineh AN, Niewiadomska-Bugaj M: Correcting Jaccard and other similarity indices for chance agreement in cluster analysis. Advances in Data Analysis and Classification 2011, 5(3):179–200. 10.1007/s11634-011-0090-yView ArticleGoogle Scholar
- Chandonia J, Hon G, Walker N, Lo Conte L, Koehl P, Levitt M, Brenner S: The ASTRAL Compendium in 2004. Nucleic Acids Research 2004, 32(SI):D189—D192.PubMed CentralPubMedGoogle Scholar
- Kim C, Basner J, Lee B: Detecting internally symmetric protein structures. BMC Bioinformatics 2010, 11: 303. 10.1186/1471-2105-11-303PubMed CentralView ArticlePubMedGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


text:
Music Writing
Heads in the Cloud
A local college follows the trend and signs up for Gmail, accepting all the benefits and potential troubles that come with it
On Monday, the more than 7,000 students at the College of Saint Rose were able to log in to their new Gmail-powered student email accounts for the first time. Flyers emblazoned with Google's primary-color scheme were hung around campus advertising the switch from Microsoft Outlook to Google Apps Education Edition for managing student e-mail, contacts, calendars and file hosting and sharing.
The switch, which came after repeated solicitations of feedback and multiple student information sessions, is one that more and more colleges are making. University of Notre Dame, Northwestern University, University of Virginia, University of Florida, George Washington University and the two-year SUNY Orange are among the growing list that are signing up for the one-stop communication service that Google offers. Students keep their current email addresses, but get a greatly increased storage capacity, 24/7 technical support, and the user-friendly Gmail interface, complete with customized themes, message labeling, chat, and pop3 e-mail fetching.
Because Google dips into so many different services, it allows for easy synchronization. People can check their e-mail, chat with a friend, print out directions to their business meeting, double-check the meeting time on their calendar, pull their PowerPoint presentation, even upload a video of the meeting to send to coworkers who couldn't attend—all using Google services.
The best part is that Google Apps Education Edition is free and ad-free. According to Saint Rose Information Technology Services director, John Ellis, it's hard to pinpoint exactly how much the college spends annually on providing student e-mail through Microsoft because it is bundled with other services, but he says that Saint Rose has paid a licensing fee of $5 per student or approximately $35,000 total each year to Microsoft.
At a time when local universities are experiencing tuition hikes, shrinking endowments and massive staff layoffs, outsourcing student e-mail to Google can help to balance a stretched budget, particularly at schools with a larger student enrollment.
While many of the students at Saint Rose were in favor of the switch, the main concerns involved privacy and security. Along with the convenience of Google, there also comes the reality that someone else is responsible for the primary means of communication between students, faculty and administrators.
The practice of working and storing information online is called "cloud computing," and it has many benefits. For businesses, there's no need to invest in a dedicated server or IT staff. It frees up valuable hard drive space, and files can be accessed from anywhere there's an Internet connection. Anybody who uses a Web site where data is stored only online—Backpack, Flickr, Salesforce—is on the cloud. While some businesses, and people, make the conscious decision to utilize cloud computing, many people don't even realize they're on the cloud until something goes wrong and they lose valuable information or services. It could be the company that runs your file- hosting Web site going out of business or suffering a worldwide outage.
That happened to Gmail earlier this year when, in February, consumer and business accounts experienced a loss of e-mail service. Not only were people unable to send and receive e-mails, but they could not access the e-mails they had already received, including valuable attachments, contacts and other information. Although the outage only lasted for 2.5 hours, Gmail users worldwide panicked, and Google blog posts updating on the outage were linked, tweeted and pinged across the Internet. Google resolved the situation relatively quickly, but issued a mea culpa to all those who were displaced due to the loss of their vital Gmail accounts.
"We know how important Gmail is to you," wrote Acacio Cruz, Gmail reliability manager, in a blog post, "and how much people rely on the service."
There is also the issue of privacy. According to their terms of service, while Google claims no ownership or control over anything you send, post, or receive using Google services, it does reserve the right to prescreen, flag, filter, refuse, modify, or move any content that may be inappropriate. It may also disclose your account information and any content if required to do so by law.
Your data may also be exposed to those outside of Google. According to a recent article in the International Business Times, while Gmail does use a secure connection to encrypt login information, the default setting for its e-mail service uses an unencrypted http connection. Users can opt to always use a secure https connection, but many Gmail users don't realize that their content may be at risk. In March of this year, a bug in the Google Docs service resulted in some documents being shared without the users' knowledge.
Whether or not you decide to trust Google ultimately will depend on how much you value your content, how secure you want it to be, and how willing you are to live without the services that Google provides. Earlier this month, a letter signed by 38 experts in the fields of computer science, privacy law and information security was sent to the CEO of Google demanding better privacy and security for users of Google cloud-computing services. This comes after the Electronic Privacy Information Center filed an official complaint with the Federal Trade Commission in March asking them to investigate the security of Google services after the Google Docs gaffe. That's something to think about before hitting "send."
Link to original article
Powered by
Create your own unique website with customizable templates.
Get Started


text:
Your shopping cart is empty!
Supported Phone Models:
What you need to know:
This service unlocks any Samsung phone locked to Orange Austria. Give us IMEI and you will receive your unlocking codes. When the phone is unlocked you will receive e-mail looking like tihs:
Your Phone is unlocked, please put SIM card different than original and enter your code.
IMEI : *your IMEI* Unlock code : *your unlock codes*
|How to find IMEI
|IMEI have only 15 digit Number (dial *#06# for IMEI Number) For example: 181361285345758


text:
April 23, 2013
JACKSONVILLE, Fla. – No. 9 Florida State (32-9) secured its seventh straight win over Jacksonville (14-26) with a 9-0 victory Tuesday night on Alexander Brest Field inside John Sessions Stadium. Five Seminole hitters recorded multiple hits in the win as FSU out hit JU 14-3 to snap a three-game losing streak.
"We played very well, "said head coach Mike Martin on the performance from his team Tuesday night. "We got a great pitching performance out of Peter Miller, (Bryant) Holtmann and (Jameis) Winston. We had some guys that really played solid baseball and it is very important that we do just that."
Marcus Davis and John Sansone led the offensive attack with three hits apiece, while Jameis Winston tied a career-high with two hits. Davis finished the evening 3-for-6 with three singles. Sansone registered a double and two singles, scored two runs and drove in one as it marked his third career three-hit game. Winston recorded a pair of doubles.
DJ Stewart had a two-hit night driving in a game-high five runs in front of his hometown crowd. The freshman left fielder drove in a pair in FSU's five-run fifth and then knocked home three more runs with a bases clearing double in the seventh. Stephen McGee went 2-for-3 with an RBI and two walks as he reached base in four of his five plate appearances.
"We had some very good at-bats," said Martin. "I thought the guys really approached the game in a professional way and took the game right to them early; got some big hits and just very pleased that we were able to do that tonight."
Peter Miller turned in another scoreless start as the junior right hander scattered three hits over a career-high 7.0 innings of work to improve to 5-1 on the year. Miller faced the minimum in four of the seven innings he worked finishing the game with just one walk while striking out six. Following Tuesday night's outing, the Lutz, Fla., native extended his scoreless innings streak to 14.0 innings.
"I felt good," said Miller. "We came in there with a game plan knowing that they were going to be aggressive. I was able to take advantage of that and work in the off-speed stuff."
"What was so impressive tonight was his ability to throw the change-up literally any time he wanted to throw it," added Martin. "Peter Miller is slowly but surely getting better and better after each outing."
Bryant Holtmann and Winston worked a scoreless eighth and ninth inning, respectively, to secure Florida State's fifth shutout of the season and second straight shutout on Tuesday night.
JU's Zach Gordon suffered the loss falling to 2-6 on the year as he allowed four runs on four hits and two walks in an inning of work. The Dolphins used six pitchers in the loss.
Florida State jumped out to the early lead with five runs in the top of the second as the Seminoles sent 11 batters to the plate collecting five hits, two walks and a hit-by-pitch. The first four Seminole batters reached to open the inning chasing Gordon from the game after working an inning plus. Giovanny Alfonzo and Sansone registered back-to-back RBI singles followed two batters later by a two-run single by Stewart. John Nogowski plated the final run of the inning as he drew a bases loaded walk off reliever Josh Baker.
Jacksonville put together consecutive singles in the bottom of the third by Scott Schaub and Ethan Loosen to end Miller's streak as he retired seven straight Dolphins to open the game Tuesday night. But the Seminole right hander got out of the jam getting Zach Houck looking on strikes and then Jake Huxtable to fly out to right to retire the side.
The Seminoles extended their lead to 9-0 with a four-run seventh as Stewart provided the big blow in the inning with a bases clearing double to center. McGee gave Florida State its ninth run of the night dropping a bloop single to right to score Stewart from third.
Florida State returns to league play this weekend as the Seminoles host Wake Forest for a three-game series beginning Friday, April 26. Saturday's game will be Military Appreciation Night at the ballpark with the first 1,000 fans receiving a replica team jersey courtesy of the Tallahassee Orthopedic Clinic. Game times for all three games are set at 6 pm (Friday & Saturday) and 1 pm (Sunday). All three games will broadcast live on ESPN3.
Fans can listen to the games on the Seminoles.com All-Access player and locally on 1270 AM (Friday) & 100.7 FM (Saturday & Sunday). As always, Seminole fans can follow the Noles on twitter @FSU_Baseball and remember to like the Seminoles on Facebook (www.facebook.com/FSUBaseball). Live stats for all three games will be available via gametracker.


text:
Groupthink: a pattern of thought characterized by self-deception, forced manufacture of consent, and conformity to group values and ethics.
One of my passions is to see wages increase through higher productivity within a free market. To this end, our existing framework is not postured towards serving this goal.
Ontario Liberals continue to debase the Employer/Employee relationship through destructive policy and laws. This damages the middle class through businesses having less money to compensate employees for their increased productivity due to forcing businesses to manage these senseless laws.
If Sally makes $25/hour for making Widget A and the government forces a new cost, regulation, or law on the Province, the business uses a portion of its free cash-flow to spend on managing said obstruction. Sally may actually improve her productivity resulting in a $26/hour compensation possibility. Regrettably, that $1/hour available raise was spent on implementing the intrusive regulation and therefore the raise is tied up in regulation land. Since this is province-wide, all businesses now have that burden. Law after law and regulation after regulation has taken its toll on Ontario businesses.
The constant new laws and regulations are not sensible. They are predicated on a groupthink mindset that the Employer/Employee relationship is dysfunctional and only massive government intrusion into that relationship will protect the employee. The cost of this intrusion damages employee wages. Capital flows into areas of a return and quickly exits where there is a negative or insufficient return. The myth that "employers pay for the cost of regulation implementation" is debunked by businesses leaving when the regulation impacts their desired profit level or risk tolerance. The employee pays through the layoff or absent wage increase. Businesses look to pass off the regulatory burden however they can: either through reduced wages, terminated employees or moving to a more "capital friendly" area. There is clear evidence that restaurants are moving towards machines replacing people when ordering food as governments force increased minimum wages on employers. There is evidence of manufacturing plants leaving Ontario because they lose their competitive edge (in part because of the regulations and risks of growth).
Groupthink is at work in that the workforce and political landscape of the collective majority have mindlessly accepted this notion that the government will control and govern the Employer/Employee relationship and enforce the relationship with an iron fist. It is argued that more regulations are the only path to violations of each victim class (and new victim classes are continually being created). The idea that excessive government laws can create safe spaces for the purported victim class is an expensive, unrealistic objective that will certainly fail. The lack of opposition to the endless regulations is further evidence that little alternative opinions are accepted and the status quo is the only permissible line of thinking. The demagogues are hard at work to uphold groupthink and brand the outlier as "sexist", "racist", "greedy" or "a violator of human rights"...etc. to ensure no alternate perspective exists or can gain steam. If I were smart enough; I would calculate the total cost business pays for each needless regulation and the total cost of the governments to administer and enforce their silly laws and simply communicate to the voter, "Hey, this is how much money the government punitively imposes on you...for your protection. Do you want this protection at this cost?" I'd imagine that numbers are staggering and most sensible workers would tell the government to jump in a lake if they saw the costs.
When laws continue to creep towards siding with a socialist society, capital will flee and wages will be suppressed.
A just and fair society is created through increasing personal freedoms. Imagine deeming the employee competent to look after themselves (without excessive laws). Imagine the government did not create special victim classes and the lack of regulation could be spent on higher wages because people are responsible for their lives. The massive debt piled on by the McGuinty/Wynne administration is damning evidence as to their overall failure to create this "sharing and just" society. $180 billion of debt to show for this fairness effort...and we are still having issue after issue resulting in new law after new law. Liberal Groupthink is a failed and expensive social experiment that has left our province in shambles and intellectually disadvantaged. Suppressed wages, out of control debt and absurd regulations are making our province less and less competitive.
My passion is to see higher wages in the context of increased freedoms and higher productivity. I will continue to work towards this end. My argument is as practical as it is theoretical. Raising wages is a beautiful thing: I am calling out the Liberals for causing economic damage with their Orwellian enforced groupthink.


text:
To enable message protection for a specific method, or for a set of methods that can be identified using a wildcard value, follow these steps. As in the example discussed in Using a Signature to Enable Message Protection for All Methods, to enable message protection for a specific method, update the message-security-binding element for the EJB web service endpoint in the application's sun-ejb-jar.xml file. To this file, add request-protection and response-protection elements, which are analogous to the request-policy and response-policy elements discussed in Chapter 13, Administering Message Security, in Oracle GlassFish Server 3.0.1 Administration Guide. The administration guide includes a table listing the set and order of security operations for different request and response policy configurations.
This section uses the sample application discussed in Understanding and Running the Sample Application to apply application-level message security to show only the differences necessary for protecting web services using various mechanisms.
In a text editor, open the application's sun-ejb-jar.xml file.
For the xms example, this file is located in the directory app-dir/xms-ejb/src/conf, where app-dir is defined in To Set Up the Sample Application.
Modify the sun-ejb-jar.xml file by adding the message-security-binding element as shown:
<sun-ejb-jar> <enterprise-beans> <unique-id>1</unique-id> <ejb> <ejb-name>HelloWorld</ejb-name> <jndi-name>HelloWorld</jndi-name> <webservice-endpoint> <port-component-name>HelloIF</port-component-name> <endpoint-address-uri>service/HelloWorld</endpoint-address-uri> <message-security-binding auth-layer="SOAP"> <message-security> <message> <java-method> <method-name>ejbCreate</method-name> </java-method> </message> <message> <java-method> <method-name>sayHello</method-name> </java-method> </message> <request-protection auth-source="content" /> <response-protection auth-source="content"/> </message-security> </message-security-binding> </webservice-endpoint> </ejb> </enterprise-beans> </sun-ejb-jar>
Compile, deploy, and run the application as described in To Run the Sample Application.


text:
Louis XIV, the Sun King, was a proud and arrogant man who wanted to be the center of attention at all times; he could not countenance being outdone in lavishness by anyone, and certainly not his finance minister. To succeed Fouquet, Louis chose Jean-Baptise Colbert, a man famous for his parsimony and for giving the dullest parties in Paris. Colbert made sure that any money liberated from the treasury went straight into Louis's hands. With the money, Louis built a palace even more magnificent than Fouquet's--the glorious palace of Versailles. He used the same architects, decorators, and garden designer. And at Versailles, Louis hosted parties even more extravagant than the one that cost Fouquet his freedom.
Let us examine the situation. The evening of the party, as Fouquet presented spectacle on spectacle to Louis, each more magnificent than the one before, he imagined the affair was demonstrating his loyalty and devotion to the king. Not only did he think the party would put him back in the king's favor, he thought it would show his good taste, his connections, and his popularity, making him indispensable to the king and demonstrating that he would make an excellent prime minister. Instead, however, each new spectacle, each appreciative smile bestowed by the guests on Fouquet, made it seem to Louis that his own friends and subjects were more charmed by the finance minister than by the king himself, and that Fouquet was actually flaunting his wealth and power. Rather than flattering Louis XIV, Fouquet's elaborate party offended the king's vanity. Louis would not admit this to anyone, of course--instead, he found a convenient excuse to rid himself of a man who had inadvertently made him feel insecure.
Such is the fate, in some form or another, of all those who unbalance the master's sense of self, poke holes in his vanity, or make him doubt his preeminence.
"When the evening began, Fouquet was at the top of the world. By the time it had ended, he was at the bottom."-Voltaire, 1694-1778
Here, Robert Greene discusses the way in which Fouquet's fate relates to the 1st Law of Power: Never Outshine Your Master.


text:
Looking for an RV topic? Search the entire forum HERE
Kinda reminds me of my old girlfriend.
Had one like that too. Now that's the look I get on my face sometimes while I'm dealing with quitting smoking.
I'm still making good headway. Funny thing is, my lungs are still in good shape. It's my heart that isn't in the best of shape. Doctors can't believe I breathe as well as I do. Family has a really long string of bad heart problems. We knew about a couple of folks with problems including my mother, who died at 44. One of my sisters found out when researching genealogy. Man what a hijack. Let's all get back to Tom's card. I am impressed with both pics Tom.
The emu has the same expression as my daughter had when asked "Where'd all the cookies go?"BTW - great cards.Corky
Those big birds are creepy to me, but then I had a bad experience with a goose when I was a youngster.
Thanks goat. There is no real way to know if your lungs are in good shape or not. Mine were in awesome shape until about four years ago. Then they suddenly got worse.
Great pics Tom, I seem to remember the Emu one from one of your albums, it really makes you want to run and hide. Debra, our daughter made our using Microsoft Word, just printed them on craft paper and DW cut them to size. It took a little playing to get them to center correctly on both sides of the paper.Ed
The emu is hilarious! Good thing he was behind bars 😀. Did you print the cards yourself or take them to a print shop? And how did you create the card? Is there a google app that you used? Im interested in making some cards
Page created in 0.112 seconds with 22 queries.


text:
The start of something new — FlakPhoto Digest.
We're developing a new project, a weekly newsletter focused on photography + visual culture recommendations carefully curated from across the Web. You know, the good stuff that deserves a closer look. FlakPhoto Digest is currently in closed beta and will be available to the public later this year. You can request an invite by subscribing below.
Grandma's View,
Fairfield, Connecticut, 2010
From the From Above series
Website - RachelHulin.com
Rachel Hulin is a writer and photographer. Her work has been shown at Jen Bekman Gallery, The Bronx Museum of the Arts, Wallspace Gallery, and The New York Photo Festival. She has written about photography for Photo District News, Emerging Photographer Magazine, Huffington Post, The Daily Beast, and The Faster Times. She is editor and co-founder of The Photography Post. Her first book — A children's photography book about a flying baby — will be published by powerHouse in April 2013.
Posted on Tuesday, September 18, 2012.
Swoosh, 2007
Untitled, 2011
Children in Front of Chalkboard, 2006
Are you promoting a photography project? Share it with Flak Photo's global audience by placing a graphic advertisement in this space. For details about banner ads, media partnerships or other inquiries, contact editor Andy Adams »


text:
MOREHEAD CITY � Hatteras Fever II captain Buddy Hooper didn�t think he had a winner, and he was happily wrong.
MOREHEAD CITY � Hatteras Fever II captain Buddy Hooper didn�t think he had a winner, and he was happily wrong.
As it turned out, the 465.3-pound blue marlin that the Buxton-based boat brought to the weigh station earlier this week was a winner, claiming the 55th Big Rock Blue Marlin Tournament on Saturday and $474,050 in prize money.
Not, however, without a challenge.
With 99 of the tournament�s 100 boats fishing the final day, 30 blue marlin were tallied as officially caught and released because they failed to meet the tournament qualifying standards of 400 pounds or 110 inches.
So how does it feel to win one of the most prestigious tournaments on the East Coast?
�You�re kind of exhausted,� the deeply tanned Hooper said as he stood inside the Carteret County Civic Center before the awards banquet. �Yeah, you�re just, �Wooo, thank goodness.� But you just feel lucky.�
Not that the 64-year-old was feeling that way when angler Taylor Miller and crew brought the big blue to the boat Wednesday after a brief fight that included about 10 minutes alongside the 54-foot Ricky Scarborough.
In fact, he didn�t think he had a winner at all.
�I thought it was a good chance it could maybe place, but I didn�t think it would hold up,� he said, adding he had not seen another blue marlin not only this year but in last year�s tournament either.
Sensation brought the only other big blue to the weigh station, a 423.8-pounder on Monday. Sensation, based out of Morehead City and captained by Dale Britt, won $206,950 for its second-place finish.
And while Hatteras Fever II withstood three days of fishing by its competitors, Saturday figured to be the biggest threat to its hopes of winning not only because every boat but one � The Enigma � was fishing, but it was the best weather of the week.
Or, as Hooper said, tied with Wednesday, which also happened to be the day Hatteras Fever II brought its big blue to the docks.
Was Hooper worried?
�You take your chances,� he said. �It�s not a luck tournament, but anybody can win this tournament the way the rules are, which are probably the most fair rules of any tournament in the country.�
Asked how he was feeling the past 24 hours, he replied: �Focused on trying to catch another fish and forget about what you can�t do anything about.�
As of 2 p.m. Saturday when lines were officially out of the water for the final time at this year�s Big Rock, three boats were still hooked up, including Blue Magic at 1:59. Crack of Dawn had been hooked up the longest of the trio � since 12:13 p.m. � while Reel Dreams was at 1:08 p.m.
Reel Dreams released a blue marlin at 2:30 p.m. and Blue Magic 29 minutes later. Then after about a three-hour battle, Crack of Dawn brought what it discovered was a 99-inch big blue (11 inches under the tournament minimum) and opted not to bring it to the dock.
Hooper said he was aware of Crack of Dawn�s situation but didn�t pay too much attention to the possibility it might be fighting a blue marlin bigger than his own.
�Good luck to him if it�s bigger than ours was,� he said. �When you�ve been in it 43 years, you mellow out a little bit. You always support the other fellow.�
Oddly enough, Hooper credited the radio for helping him land his winner.
�The charter boat boys in Hatteras were seeing a lot of blue marlin and I picked up and ran 25 miles to where they were fishing,� Hooper said matter-of-factly. �So they�re the reason I was able to get that fish.�
Hooper said he learned he had won the Big Rock from some of the younger fishermen on his boat, who had found out on the Internet as the boat headed to Morehead City where �win, lose or draw� the captain and crew were coming to celebrate.
�When the kids on the boat found out, they started screaming,� Hooper said. �They were pretty wild. They were excited. I was excited for the people on my boat and my son (Chase). He mated with me. He�s been on the boat with me since he was 5.�
While Hooper has competed in the Big Rock for years, he said he�d never �really caught a big fish� in the six-day tournament.
Until this year.
�We just got lucky,� he said. �You wish everybody the best of luck and hope yours is bigger. That�s all you can do.�


text:
He did not disappoint. Dovlatov's "The Colonel Says I Love You" is witty and wise; it demonstrates what Joseph Brodsky once said about Dovlatov (as I would later learn, thanks to Amitava): "The decisive thing is his tone, which every member of a democratic society can recognize: the individual who won't let himself be cast in the role of a victim, who is not obsessed with what makes him different." Dovlatov writes direct but surprising stories that draw heavily from his life; Bezmozgis aptly compares him to David Sedaris, though Dovlatov's humor is less broad, and his circumstances—living and writing in communist Russia—give his stories a kind of moral weight, even if he handles it lightly.
So why isn't he read more in the United States? Soon after the podcast, Sonya Chung pointed out on The Millions how hard it has become to get copies of his books in English, though they were all translated and published once upon a time (he died in 1990). "Why is Dovlatov so little known or read in the West today?" she asked, repeating a question Triesman had asked Bezmozgis. His answer: "I have no idea. It's hard to understand these things." As Chung notes, "Dovlatov couldn't have said it better himself." (Responding to Chung's piece, the blogger languagehat, who reads Russian, said: "Dovlatov is one of the funniest and most likable writers I know, and I'm sure Americans would love him if he were properly introduced.")
So when we were putting together PEN America 12, we decided we would re-publish one of Dovlatov's stories. Happily, one of his translators, Antonina W. Bouis, is a generous member of PEN; I still have her copy of The Suitcase (though I'll be returning it soon, promise!), from which we selected "A Poplin Shirt."
When I was a child, my nanny, Luiza Genrikhovna, did everything distractedly. Once she dressed me in shorts and shoved both legs into one opening. I walked around like that all day. I was four. I knew that I had been dressed wrong, but I kept quiet. I didn't want to change. I still don't.So the narrator tells us near the beginning of the story; he goes on to recount his first outing with his future wife (she speaks first in this bit):
"You can be trusted. I understood that immediately, as soon as I saw Solzhenitsyn's portrait."Near the end, the narrator reflects on the life he and his wife have lived:
"That's Dostoyevsky. But I respect Solzhenitsyn, too." We had a modest breakfast. Mother gave us a piece of halvah after all.
Then we went outside. The houses were decorated with bunting. Candy wrappers lay in the snow. Our janitor, Grisha, was showing off his ratiné coat.
....We went to the movies to see Ivan's Childhood. The film was good enough for me to patronize. In that period I liked only detective movies, because they let me relax. But Tarkovsky's movies I praised, patronizingly—and with a hint that Tarkovsky had been waiting for almost six years for a screenplay from me.
Are we alike, then? I at least have a stimulus, a goal, an illusion, a hope. What does she have? Only our daughter, and indifference. We have twenty-five years of marriage behind us—twenty-five years of mutual isolation and indifference to real life. In those twenty-five years, our friends fell in love, married, and divorced. They wrote poems and novels about it all. They moved from one republic to another; they changed jobs, convictions, habits, became dissidents and alcoholics, tried to kill others or themselves. Marvelous, mysterious worlds arose and collapsed with a roar all around us. Like taut strings, human relations snapped. Our friends were reborn and died in the search for happiness.To read the rest, pick up PEN America 12: Correspondences, or try to find a copy of The Suitcase at your local used bookstore. And then maybe blog about it. Eventually someone will get the point and start publishing Dovlatov's books in the U.S. again.
And we? We faced all the temptations and horrors of life with our only gift—indifference. What is more solid than a castle built on sand? What is more durable and dependable in family life than mutual lack of character? What could be stabler than two hostile states each incapable of defending itself?


text:
BASRA, Iraq (Reuters) - A truck bomb exploded at Iraq's main commodities port near the oil-exporting southern city of Basra, wounding four people on Saturday, but officials said shipping traffic at the Umm Qasr docks was not affected.
Umm Qasr port, near Iraq's border with Kuwait, sits at the top of the strategic Gulf waterway and does not export oil. Imports handled there include grain shipments and heavy equipment used in the energy industry.
The blast damaged an out-of-service Iraqi ship anchored there and wounded four porters, the head of the Basra provincial security committee, Jabbar al-Saedi, told Reuters.
"It's a serious breach to the port security and a terrorist act targeting Iraq's economy," he said.
The truck had been parked near one of the port's unloading berths, he added.
Shipping movements and unloading operations at the port were not disrupted by the explosion, said Mahdi Askar, an official with the state-run General Company for Maritime Transport.
The site is close to the city of Basra, about 420 km (260 miles) southeast of the capital Baghdad.
Iraq's economic infrastructure has been hit hard by frequent militant attacks. An oil export pipeline between Iraq and Turkey has been bombed about 30 times since the start of the year, the oil ministry said last week. The pipeline was hit again late on Friday.
Sunni Muslim militant groups, including al Qaeda, have stepped up their insurgency against Iraq's Shi'ite-led government in the past four months.
More than 30 people were killed and scores wounded in Baghdad on Thursday after a series of car bombs, part of a wave of violence that has taken the monthly death toll to the highest levels in around five years.
Additional reporting by Ahmed Rasheed; Writing by Sylvia Westall; Editing by Andrew Heavens


text:
Welcome to the Weekend Wind-down Link Party 121!
Welcome to the party! It's been a busy week come Wind-down with us and share your blog post! Don't forget to mingle and visit other blog post! Not familiar with this party, here's the 411-we love post related to recipes, frugal, DIY,organization, crafts, inspirational, family,and homemaking. Please no giveaways or advertisement. We love to learn new things and see what you have been up to this past week. We ask that you link back to us somewhere on your site. We choose 9 post to feature each week! If you follow that one simple request you have chance of getting featured :):) We will be pinning features and doing social-media shout outs!
Weekly Features
Here are a few simple rules to follow:
Meet Your Hosts–And follow each one on the social-media platform of your choice!
Have a Fabulous time at the Weekend Wind-Down Link Party 121! Be sure to visit others, interact and build new relationships! I look forward to seeing what you link! I will be sharing and pinning from these link but only the one that link back to us!!


text:
Daily log, June 8
Tiffin reports
Sheila A. Floro, 36, of Findlay, was charged with theft Wednesday afternoon.
A 14-year-old girl from Tiffin and a 14-year-old boy from Tiffin were charged with juvenile delinquency and obstructing official business early Thursday morning.
Matthew P. Yeager, 29, of Tiffin, was charged with drug abuse instruments early Thursday morning.
Scott A. May, 18, of Tiffin, was charged with failure to obey a pedestrian signal Thursday afternoon.
A first-block Noble Street caller reported Thursday evening a man walking down an alley next to her house was waving a dead rabbit. Police were unable to locate the man.
A 100-block East Market Street caller reported the theft of medication Thursday evening.
A 600-block South Sandusky Street woman reported Thursday evening she had been assaulted by her son.
A man in the 200 block of South Washington Street reported Thursday night four males in a truck were trying to assault him and his friend. Police were unable to locate the truck.
A caller reported Friday afternoon an older woman was pushing a stroller that had a baby inside wearing a plaid wig. Police checked the area of North Sandusky and North Washington streets and were unable to locate the woman.
County reports
Stephan A. Johnson, 35, of Rawson, was charged with theft for an incident Jan. 31.
Miguel A. Ramon Jr., 25, of Tiffin, was charged with selling to an underage person for an incident May 30.
Uriah M. Sanders, 22, of Tiffin, was charged with selling to an underage person for an incident May 30.
Bobbie J. Moon, 30, of Fostoria, was charged with disorderly conduct for an incident June 1.
A 5000-block West Ash Street man reported Thursday evening someone had tampered with his swinging garage door's lock.
Jeremy J. Thompson, 42, of Green Springs, was charged with disorderly conduct Thursday.
Fostoria reports
Joey O. Jackson, 34, of Fostoria, was cited with driving under suspension, speed, following too closely and operating a vehicle while intoxicated early Thursday morning.
A man went to the station Thursday afternoon to report someone stole his daughter's iPod at school and refused to return it.
A woman went to the station Thursday night to speak to an officer about threats she was receiving on Facebook.
A 700-block West North Street caller reported Friday morning a vehicle's tire had been slit and another vehicle's windshield was broken.
A 200-block East North Street man reported Friday afternoon someone stole his dog from inside a privacy fence.
Tiffin accident
Kyle E. Risser, 23, of Tiffin, was cited with failure to yield right-of- way following an accident Friday morning on Tomb Street.
Fostoria accident
Danielle M. Blackburn, 25, of Fostoria, was cited with driving under suspension and improper backing following an accident May 30 at Fall Street and SR 18.
Tiffin firefighters were called to 355 Miami St. Thursday night for an unintentional smoke detector activation.
Tiffin EMS had one squad run Thursday night and one squad run Friday morning.
Green Springs fire and EMS had a squad run early Friday morning.
New Riegel fire and EMS had a squad run early Friday morning.


text:
How we can help
If you, or someone you care about has been diagnosed with cancer, you'll have many questions and concerns. We're here to help. We offer a support system for people with cancer and their family, friends and caregivers.
Fear, anxiety, helplessness, anger – these are feelings people can have when faced with a cancer diagnosis. But knowledge and support are power. Our services are free and confidential, and many are available in multiple languages.
Our Cancer Information Service provides answers to questions about all types of cancer, diagnostic tests, treatments, side effects, clinical trials and many other cancer-related topics.
Our Peer Support Service connects people living with cancer and caregivers with trained volunteers who offer encouragement and share ideas for coping – all from their unique perspective as someone who's been there.
Our online community – CancerConnection.ca –helps people who have cancer, cancer survivors and caregivers share their experiences and build supportive relationships.
We can also help you find more cancer-related services in your area through our Community Services Locator – a searchable database of over 4000 cancer-related services and resources nationwide – or at one of our community offices across the country.
Quit smoking – Our Smokers' Helpline offers proven tips and tools to help people quit smoking.
See the impact of our support services on people touched by cancer.
How can you stop cancer before it starts?
Discover how 16 factors affect your cancer risk and how you can take action with our interactive tool – It's My Life! Presented in partnership with Desjardins.


text: The pathology lies in society discriminating against transgender people, not in transgender people themselves. Ted Eytan/Flickr July 29, 2016 Being transgender is not a mental illness, and the WHO should acknowledge this Damien Riggs, Flinders University Poor mental health in transgender people is primarily the product of social stigma and violence. This counters the view that being transgender is itself pathological.


text:
Note: This item is more than seven years old. Please take the publication date into consideration for any date references.
Print – Plain Text – Permalink
News Release
Media Contact: TPWD News, firstname.lastname@example.com, 512-389-8030
Jan. 3, 2012
Native Prairie Seed Harvested from Houston Area Parks for San Jacinto Battleground
LA PORTE — The Texas Parks and Wildlife Department will soon be restoring 110 acres of tall-grass prairie at the San Jacinto Battleground State Historic Site with the help of League City's Parks Department, University of Houston's Coastal Center, the Native American Seed Company, Shell Refining and the San Jacinto Battlegrounds Conservancy.
While much of the park retains the same tall grasses that helped hide the Texian army as it approached Mexican Gen. Santa Anna's encampment during the Texas Revolution, portions of the historic battleground have become overgrown with a canopy of alien Chinese tallow trees. A large area of the battleground has been cleared of this invasive tree imported from Asia and is now ready to be seeded with native grasses and wildflowers.
Since very few areas of Texas today retain native prairie consisting of a landscape rich in plant diversity because of loss of habitat caused by farming, overgrazing and development. TPWD had been having a difficult time finding the coastal region type of prairie plants that once grew across the battleground. In addition, the site's existing prairie was too small and patchy for a successful harvest.
Fortunately, League City's Benoit Prairie Park holds 44 acres of one of the highest quality remnant prairies left on the Gulf Coast. Likewise, U of H's Galveston County coastal property contains roughly 100 acres of prairie grasses. TPWD worked out an agreement that allows Junction's Native American Seed Company to harvest native grass and wildflower seed from their prairies to use to reseed 110 acres of the San Jacinto Battleground late this winter or early next spring.
The work is being accomplished with the same type of combines most farmers use, but the machines have been modified to harvest the especially diverse and fluffy native plant seeds. The combine work is similar to mowing the prairie; a practice now done annually at the prairie parks, except that the cut portion of the plants is retained and the attached seed is collected. This material is then brought back to Native American Seed's facility where it is cleaned and tested for viability.
The diverse species harvested so far include such beautiful plants as blue mist flower, purple gay feather, switchgrass, little bluestem, Indian grass and Texas coneflower. More than a hundred different types of seed will be collected in all and planted into the restored battleground by Native American Seed once the ground becomes dry enough this winter or early spring.
This project emphasizes the importance of the conservation work League City and Harris County have been doing to retain portions of Texas' native landscape. Native American Seed specializes in conducting large-scale conservancy seed harvests on Texas' last great prairie remnants. This seed is not available elsewhere and the San Jacinto Battleground restoration would not be possible without it. These preserved coastal tall-grass prairie parks not only provide beautiful and historic landscapes, but also provide a home for such prairie-dependent wildlife as marsh hawks and meadow larks.
Publication — Permission is granted to publish, in whole or in part, any news releases on this page.
Print — A print-friendly version of the news release shows only the release with font sizes set to the browser default.
Plain Text — Plain text versions of TPWD news releases are provided for copying and pasting into editing software.
To copy text into an editing software:
- Click a Plain Text link to display the plain text page in your browser.
- Select all.
- Copy.
- Paste in a document in your editing program.
Permalink — This is a direct link to the news release, omitting the navigation context from the URI.
English/Spanish — News releases posted in both English and Spanish have one of these links.
If you have any suggestions for improving these pages, send an e-mail to email@example.com and mention Plain Text Pages.


text: These COMP Cams® titanium retainers are made from the finest 6AL4V alloy for maximum stiffness and minimal warpage. The 6AL4V alloy is heat-treated and processed to a stringent tolerance that makes it so strong that it is even used in the aircraft industry. Other manufacturers purchase titanium from metal brokers and produce cheap retainers, but COMP Cams® titanium retainers will not deform. From a standing idle to the most extreme RPM, our titanium retainers perform flawlessly and without compromise.


text:
Member? Sign in. Not a member? Register for free.
This app was removed from the App Store.
Best of Lake Lanier
iOS Universal Travel
2012 Recipient of the Goergia Govornor's Paul Broun Award for Marketing Excellence.
We've made it simple to discover the Best of Georgia's Lake Lanier. With over 8 million visitors annually, Lake Lanier (just 45 minutes north of Atlanta) is known for its scenic mountain views, hot boat parties and the most beautiful beaches of any lake destination in the southeast. Here you'll find recommendations from those in the know about the Best of Lake Lanier including where to Stay, Play, Eat and what to do On the Lake all with the touch of a button. From Full Moon Parties at Sunset Cove to a delicious sunrise breakfast on the docks at a marina, we've got you covered for the best bets for summer fun on Lake Lanier.
The Lake Lanier Convention & Visitors Bureau has been guiding travelers to local hot spots and tranquil retreats for over 20 years. Backed by a network of locals who share the inside scoop on the newest places to dine out, boat, float and enjoy the Lake Lanier lifestyle, you'll explore with the most reliable, up-to-date travel intelligence available. With the Best of Lake Lanier app, you can:
- Quickly find lodging for your stay with accommodations ranging from luxury resort to rustic campgrounds
- Explore dining options, recommended by locals for best lakeside dining, picnic fare and fine dining
- Scout the options for how to spend your time playing indoors or out
- Check out current events in real time from our online calendar featuring all the hottest happenings on Lake Lanier
- Navigate your way around by car or boat with GPS mapping and waypoints to all our recommended locations
- Get social with quick connect buttons to Lake Lanier's Facebook, Twitter and our Slip Away Blog
Not visiting the lake during the hot summer season? No problem, the app will be updated regularly with seasonal content including fall foliage events, holiday happenings and arts performances. Lake Lanier is a year round destination, and our app will keep you updated through every season.
What's New
- Added Deal Feature in App.
- Minor Bug Fixes and Performance Improvements.


text:
Date(s) - 12/06/2018
5:00 pm - 9:00 pm
Newfields (Indianapolis Museum of Art)
Return to Winterlights this November 18 through January 6. The lights will dance again on the Lilly House lawn as you amble side by side with family and friends. You can still enjoy warm drinks, handmade s'mores, and unique photo ops. But this time? It'll be among the glow of a million and a half lights. Our new Wintermarket will open, alongside some bigger, better light designs. Wanna upgrade? We're offering special glasses that transform each and every light into a shimmering snowflake. Each pair comes with a complimentary warm drink and a tear off tab for buy one get one free admission from January 8 through Valentine's Day weekend.
Starting October 1, you can save 20% by reserving your tickets online (and you'll bypass the purchase line upon arrival – nice, right?) Tickets will be available every half hour from 5–8 pm. We close at 9 pm.
Newfields members receive additional discounts and exclusive access to Winterlights presented by Bank of America. Our member preview evenings happen November 16 and 17 for just $10.
New this year, the Deer Zink Special Events Pavilion has been transformed into a Wintermarket, the first stop for a warm cup of hot chocolate or apple cider—with spiked options for adults. Local artisans like Goose the Market, Gallery Pastry Shop and Sun King Spirits will sell popular food and beverage options.
Santa will join us for special appearances every Tuesday in December. Also in December, you'll hear the voices of carolers every Wednesday.
Take your Winterlights experience to the next level by purchasing festive holiday décor, gifts, plants, and fun items to wear that blink bright holiday colors. These items are available for purchase in the Museum & Garden Shop and along the Poinsettia Path on the first floor of the IMA and at the Lilly House Christmas Shop. Blinky lights are also available in the Hospitality tents within the show.
Winterlights will be open Thanksgiving Day, Black Friday, Christmas, Christmas Eve, New Year's Eve, and New Year's Day.
Members (no matter which type of membership) will be able to buy unlimited discounted tickets for Winterlights only.
We do our best to provide the most relevant and timely information to our readers, but please confirm dates, times, and availability before attending an event. Events are posted on IWK from information found on, but not limited to, attraction sites, government city sites; as well as submissions from individual attractions, press releases and PR firms. All events are subject to change without notice and Indy with Kids cannot be held responsible.


text:
Amar Akbar and Tony: About time Akshaye Khanna, Ranbir Kapoor and Abhishek Bachchan gave us a remake, in English, of one of the best masala films ever in Amar Akbar Anthony (1977).
Belt: To hold the Jeans (1998) in place.
Chaal Kaisa Hai Janaab Ka: The title is inspired by the song Haal Kaisa Hai Janaab Ka from Chalti Ka Naam Gaadi (1958), but this would be a remake of Mr. and Mrs. 55 (1955) starring my equivalents of Guru Dutt and Madhubala, Aamir Khan and Madhuri Dixit. It's too bad they didn't do much work together, but Dil (1990) was enough to showcase their chemistry.
Dhoom Again...and Again: Yash Raj Films might be caught in a bubble when every other film contains a reference to one film -- Dhoom (2004) -- and its sequel. *Yawn*
Elizabeth in a Saree: I'm fiercely opposed to a mere discussion on a sequel to Lagaan (2001), but how about a short film the length of a music video dedicated to Rachel Shelley?!
Farida Ka Jalaal (The Eminence of Farida): Farida Jalal and Reema Lagoo are my favorite filmy moms. I recently saw an older film starring Ms. Jalal, and my only reaction was 'Woah'! This film would be a compilation of some of her older works, because those of us who were born after her prime deserve to know more.
Gabbar Singh Ka Hamla (The Attack of Gabbar Singh): Another remake of Sholay (1975), in which Gabbar beats up Ram Gopal Verma by the Gateway of India. In about a minute, this film would be better and more engaging than RGV's attempt to remake a classic with Aag (2007).
Hum Tumhare Bhi Hain Sanam (I am yours too, [my] love): A sequel to Hum Tumhare Hain Sanam (2002), starring Salman Khan and all the lovely ladies he's partnered with, in and out of film (so it would include Madhuri Dixit).
Isshh: Yet another adaptation of Devdas (1917) the novel. This Wikipedia entry notes nine adapted films, with a tenth on its way, starring Abhay Deol. That's about one film for every decade, so I guess it's not as bad (or as good) as it sounds.
Jo Haara Woh Bandar (One who loses is a Monkey): The title is inspired by Jo Jeeta Wohi Sikandar (1992), in which Sanju is a winner. But this film is about a loser, so it would be the eleventh film on Devdas, maybe another name for 'Isshh' above :)
Kuriosity Kills the Kat: A Rakesh Roshan film, the third following Koi Mil Gaya (2003) and Krissh (2006). It's great to have a Bollywood superhero, but even Batman has Catwoman and He-Man, Teela. So I propose we give Krrish, Kat. Katrina Kaif is the obvious choice.
Love Story 1950: A sequel to Love Story 2050 (2008), in which Daddy and Baby Baweja travel back in time to try to get a period film right before attempting to take us to the future with Love Story 3050. I've tried playing the one set in 2050 three times, and haven't gotten past the first 15 minutes.
Main Mohammad Rafi Banna Chahta Hoon (I want to be Mohammad Rafi): The title is inspired by Main Madhuri Dixit Banna Chahti Hoon (2003), and the film would feature a singing competition hosted by the one and only Sonu Nigam, who credits Mohammad Rafi as his inspiration. Sonu is a fantastic vocalist, and his releases dedicated to Rafi, especially the newer one with music by the London Philharmonic, are unbelievably good.
Naukri Paane Ke Sau Tareeqe (A Hundred ways to get a Job): The line was used by Akash right before the song Koi Kahe Kehta Rahe in Dil Chahta Hai (2001). This would be a tribute to the film and its emotional depth, which encourages college students to pursue a degree based on what they enjoy (more constant), not based on market trends (temporary).
Ooh, Aah, Ouch: The title is inspired by an iconic and memorable commercial (very popular on Doordarshan in the late 1980s, if I recall correctly) for a muscular pain relief product, Iodex. This film would be a documentary on product placement in film and the role of film celebrities in mainstream Indian media. Maybe a compilation of some of their best commercials (because they're so good, each gets a 'Making of' video before its release!). The hurt (as in 'ouch') would be captured in a special chapter noting recent failed campaigns, and the brands and actors behind them. This documentary would be presented by Bipasha Basu, whose character in Corporate (2006) seemed to love repeating the term 'product placement'.
Paani Aasmaan Par (Water in the Sky): A sequel to Swades (2004), in which Darsheel Safary, the offspring of Shah Rukh Khan and Gayatri Joshi, discovers water on an unknown planet! Darsheel then goes and thanks his mentor Ram Shankar Nikumbh from Taare Zameen Par (2007), which serves as inspiration for the title. To make it a truly universal theme, Darsheel takes with him Sandy Cheeks from SpongeBob Squarepants, which means Nickelodeon and Walt Disney would be interested, too. Of course my favorite director Ashutosh Gowariker would direct it.
Qayaamat Se Jannat Tak (From the Day of Judgment to Heaven): A sequel to Qayaamat Se Qayaamat Tak (1988), dedicated to the greatest filmy couple ever -- Aamir Khan and Juhi Chawla (haaye Allah!) -- because we know they're going to heaven for spreading all the Love Love Love (1991)!
Rona Dh(r)ona - No more crying: If you have not yet seen Drona (2008), please, please do yourselves a favor and ignore it, because I didn't, and paid the price. Word is Goldie Behl wants to make a sequel to it. Why we need sequels to miserable failures is beyond me, but just in case, at least we could have a name more indicative of the product.
Sab Kuch Hota Hai: The title is inspired by this saying at my high school for Rani Mukherji in Ghulam (1998), her first commercial success. Later that year, she confirmed in her brief role in Kuch Kuch Hota Hai that she would be sticking around for a while. This film would have two love triangles too, both involving Rani.
Tabu Ke Sang - A day in the life of Tabu: Another documentary, on what makes Tabu who she is. I'd fund the project, interview Tabu, and film a non-filmy song opposite her. Maybe for a commercial that makes it to the documentary Ooh, Aah, Ouch mentioned above?
Us Paar Hi Rehna (Stay on the other Side): One of my favorite jokes, which is rather silly, has to do with two people on opposite sides of a river. "How do I get to the other side of the river?", asks one. "You are on the other side of the river," says the other. Well, apply this to conflicts internal to India and Pakistan, and peace not being given much of a chance in both countries (let alone among them), no matter who we choose to blame. Nothing funny about this sequel to 1947 Earth (1999), which might as well have been titled 'Kuch Nahin Badla' (Nothing has Changed). The title is inspired by Jheel Ke Us Paar (1973).
Vacation - Wilayat Mein Sukoon (Peace in Authority): A joint sequel to Holiday (2005) and Pardes (1998), in which Mahima Chaudhary and Shah Rukh Khan find themselves deserted on a little unknown island in the Pacific Ocean (no, not in an archipelago where smoke signals might attract attention), discover it's haunted, fight the ghosts, find peace, and live happily ever after as king and queen of the island. SRK gets to finally crown himself king in the absence of Aamir and Hrithik (in that order), and Mahima gets to shed the label of one-film-wonder.
Wanted: Himesh: A sequel to Gangster (2006), starring Emraan Hashmi and the man he captures, Himesh Reshammiya.
Xtra Time: If Drona (2008) can get a sequel, surely, Dhan Dhana Dhan Goal (2007) deserves one too. The surprise element here is that an English Premier League soccer team comprising South Asian players is involved in the longest ever soccer match in history, with over a hundred penalty kicks needed to break the tie with...Chelsea FC. Never mind there's a greater likelihood of Darsheel finding water in space.
Yahoo! Shammi Kapoor from Junglee (1961) returns to cinema with a short film (which is really a commercial popularized as viral video, making it very budget-friendly and easy to sell to the corporation) in which he rescues internet content search firm Yahoo! with a stroke of marketing genius. Memo to Yahoo: Forget the Eskimo, the world needs Shammi!
Zameendar Pe Laanat (Curse the landlord): A sequel to Mother India (1957), in which we are reminded of the continued hardships of rural India because of poverty and illiteracy, which make it all too easy for landlords to con poor villagers. Enter Sanjay Dutt, who runs for office and aims to hold others accountable, but doesn't need to because he successfully spreads good will through Gandhi-giri, as portrayed in Lage Raho Munnabhai (2006).
The Rules:
- Pick one film to represent each letter of the alphabet.
- The letter "A" and the word "The" do not count as the beginning of a film's title, unless the film is simply titled A or The, and I don't know of any films with those titles.
- Return of the Jedi belongs under "R," not "S" as in Star Wars Episode IV: Return of the Jedi. This rule applies to all films in the original Star Wars trilogy; all that followed start with "S." Similarly, Raiders of the Lost Ark belongs under "R," not "I" as in Indiana Jones and the Raiders of the Lost Ark. Conversely, all films in the LOTR series belong under "L" and all films in the Chronicles of Narnia series belong under "C," as that's what those filmmakers called their films from the start. In other words, movies are stuck with the titles their owners gave them at the time of their theatrical release. Use your better judgement to apply the above rule to any series/films not mentioned.
- Films that start with a number are filed under the first letter of their number's word. 12 Monkeys would be filed under "T."
- Link back to Blog Cabins in your post.