http://www.chatterous.com/hnyc/\", \"\\\"a very large share of the people who were visiting the site were merely browsing to read headlines rather than using the aggregation page to decide what they wanted to read in detail.\\\"
It's exactly the way I use a newsstand. I mostly browse the headlines and unless I find something every interesting I don't buy a newspaper or magazine.\", \"When I say \\\"hang out\\\", I mean people can talk about anything (not just startup ideas) that HN community have interests, like what happens on HN web site, only in a mailing list interface. It has to be mailing list because a lot of people prefer to be able to use their favorite email client (gnus, mutt, etc.) to read and write.\", \"Indeed, we need data portability to rescue our content from dying services.\", NaN, \"Dumb hollywood stuff that, funny enough, seems to be praised when it comes in dead tree format (eg. Neuromancer).
Thing is, cyberpunk is not hacking. Buffer overflows are not hacking. It never was, actually. Hacking is about building and learning, not about showing off your skills (which in most cases aren't really there).\", \"That would just fork a bunch of threads from HN onto the mailing list, without the benefits that the site offers.
HN is currently 'pull', a mailing list would make it 'push'. I think one of the great things about the website is that you get to choose when you go there, a mailing list (especially a busy one) gets in the way of work pretty quickly.\", \"> If the person doing the verifying is a human, they don't need the stamp
That was my thought too. Can it be improved? If there is an API to create a unique key based on the contents of the message (and the headers) that the client can then verify with centmail (or w/e).
Sure it wont do anything for mail NOT covered with centmail. BUT you can dump anything with a faked key (likely spam) and let in those with a real key. Then anything else goes to the spam filter as usual.
Kinda like a more worldly version of PGP signing.
Obviously that kind of scheme would require much more support from email vendors.\", NaN, \"You're making the somewhat curious assumption that systematic neglect of \\\"preventive\\\" care (i.e. routine checkups) results directly in the \\\"downside\\\": large-scale, high-cost catastrophic events.
It certainly can, but from the point of view of statistics in human pathology, a complete non sequitur. For every person that neglects a checkup and misses early detection of a highly surreptitious, life-threatening disease, there will be ten for whom it either has no impact or results in low-grade, unremarkable chronic conditions that require occasional office visits and prescriptions.
Having to directly bear the cost of going to the doctor also provides a considerable incentive for leading a healthier life and staying away from bad habits with adverse medical consequences, in the same way that people are disincentivised to do avoidable things that hurt their financial standing in other areas.\", \"While I agree with you to an extent, Neal Stephenson also gets panned for writing long-winded stuff, like Anathem or the Baroque Trilogy. I just view it as dense brain-food, but some people get turned off.\", \"Thanks. I spent 5 minutes staring at that title trying to make sense of it. I'm quite hung over.\", \"It's my understanding that they are considered co-founders in title only, not in equity or role or responsibility.\", \"They are very vague about what they say it is, there are basically no real details in the article.\", \"You have an audience like this and all you wanna do is \\\"hang out\\\"? I wanna put their time and mine to better uses.\", \"For a while it seemed that Facebook had killed Parakey, except for the redesign that made Facebook look more operating system like. I think the browser war is still relatively wide open assuming the eventual crash of Microsoft. Whatever these guys make is going to be interesting.\", \"What are you talking about? I was suggesting a mailing list for Hacker News community to hang out.\", \"That has the unfortunate effect of silencing minority constituencies that may have a substantive and HN spirit-compatible reason for thinking that an article is important to get out there and discuss, but whose thoughts do not mirror the prevailing trend of the groupthink.\", \"Thanks for the specific suggestion on the copy editing. I'll definitely try to make it clearer.
Also a good point on the photo. It's about the only \\\"bounce\\\" stock photo I could find... I'll poke around and see if anything else might work, though.
Thanks for your suggestions!\", \"The best equity split is: everyone in your startup is happy. And, I don't think that there is any formula out there you can use.\", \"Thanks for the feedback!
a) I use the Yahoo BOSS index of your site to find other pages that would fit the search query well.
b) If the site isn't indexed then SearchEkko just doesn't display the widget at all.
c) Haha well it certainly tries to give the site owner front and center real-estate. It also displays up to 4 results, if they're available (not shown in the demo).
d) Excellent points. It's early -- I just wanted to see if there was any demand for the product before I spent too much more time on it.
e) I don't think that it really works very well in a sidebar. It would be hard to display the other hits attractively, and I don't think it as noticeable to the visitor. I played around with it, and 480px seemed as short as I could reasonably go.
f) Good to know. It's something I've been working on, and I'll try to clarify it.
Thanks again!\", \"Did you miss this gem? - http://news.ycombinator.com/item?id=639976\", \"A well-reasoned piece, although I understand that using BMI without considering muscle mass can be misleading.\", \"And presumably s/Erasers/Erases/ too?\", \"And also microwave-thaws quite well, if you get the technique down.
Preferably, use the thawing program of the owen - if there isn't one, use a quite low setting.
Run the thaw-program for about half the amount of meat you have. This should soften the meat enough that you can chop it in 2-3 cm cubes with a big knife. Run the cubes (with plenty of air around) in the owen again, on the same program. You'll probably need to experiment a bit, but the idea is that you'd rather have nice and raw on the outside and semi-frozen in the middle, than cooked on the outside and raw in the middle.
The semi-frozen bits of meat will cook just fine, if the object is to get small chuck of meat, e.g. for a taco (if you need patties, slow-thawing is the only solution). Just remember not to over-fill the pan, if there's too much on the pan, if will boil, not sear, and you'll miss out on the tasty goodness of the malliard process.\", \"I use Google Calendar...\", \"That's because the notion of insurance is wrong. People need healthcare coverage, not insurance.
We are all connected in this stupid country - if the family down the street can't afford preventative care, and the wife gets sick, and can't take care of the kids, and the husband misses work and gets fired from his job, and then they can't afford good nutritious food for their kids, so the kids go to school hungry and don't learn as well and don't test as well, the ripples can last for generations.
Here's the thing. People act as if healthcare is something that has to be earned, and deserved, and not only is this viewpoint inhumane (in the Greatest Nation in the World!), but it's economically indefensible.
If people don't get early medical care, their lifetime economic output can be greatly reduced. And their children are affected. If children aren't taken care of with nutrition and care, their mental abilities, abilities to stay in school, are affected -- and their lifetime economic output is reduced. And targeted poverty (as opposed to where everyone's poor) breeds crime. Which creates greater loss of human economic potential AND greater costs for the government.
The country benefits from more, healthier workers, who can think straight, and don't spend significant portions of their time figuring out how to scrape by. These people can then spend money. Middle- and lower-middle-class people spend far more of their income than higher income brackets, if only they have the money to spend.
Net effect: The benefits to the entire country outweigh the costs, in a system where costs aren't an arms race between health insurance providers, malpractice insurers, and other for-profit companies.
A stitch in time saves nine.\", \"Nice idea and the implementation seems good. I am tempted to use this on some of my sites.
Some questions:
a) How does it work? Lets say I have a recipe site and a visitor arrives from Google having searched for \\\"steak\\\". How do you find related articles on my site?
b) What if my site isn't indexed? (e.g. new, blocked etc)
c) The widget has 8 actions (links/buttons etc). 2 of them point to my site and 6 to yours! I would prefer something like 7 to mine and 1 to yours :)
d) Certainly add some options. The \\\"Looking for more on\\\", \\\"Or try a new search\\\" and the 3 related keywords should be optional.
e) The 480px is very limiting. I can't put that in a sidebar it has to go to the main area
f) The site copy needs a redo. I could not easily grasp what it does, how it works etc.
Great work overall - I hope my suggestions are well taken!\", \"For the young programmer 12 years ago it was still easier to get absorbed in a \\\"hacking\\\" culture - or so it was for me. At that time I thought linux, assembly and writing a virus in Pascal were very cool things, and I didn't have a problem getting my friends to agree. It seemed very natural then.
I admit I don't know many high-schoolers now, but my feeling is they really are less hacking-inclined, at least around here (Eastern Europe). I'd guess the main difference is access to information. Then it was very rationed - I remember learning assembly from a reference manual. Now Internet offers a lot less obstacles, so I don't really see a point for \\\"subversiveness\\\", at least in mainstream programming.\", NaN, \"
Anyway I'd like to see a book of other 'Cooking Patterns' laid out like this.\\\\nWatir and selenium: plenty of examples of usage:
http://delicious.com/tag/watir
You can look at iMacros and testGen4web, here's a staggeringly large list;
http://www.softwareqatest.com/qatweb1.html#FUNC\", \"Really? The VA? Did you miss all the scandals about the Walter Reed medical base in DC, where soldiers were mistreated, ignored and neglected, and even one killed himself in his room and no one noticed for 2 days? The hospital had no idea until his parents called and forced them to look for their missing son. This was a guy who was evacuated due to a semi-suicide attempt, and they didn't even bother to monitor him. Shameful.
Not to mention the older vets, especially from Vietnam. They are screwed at every turn and the previous administration cut their benefits even more.\", \"congrats on launching\", \"mmm... I work with 2 cups of liquid per cup of rice!\", \"Ok, well, for what it's worth it sounds like a second hand toyota or something to that effect would be your ticket, they're reasonably cheap and about as reliable as it gets.
Other than that... you'd have to provide a whole pile of information on what your budget is (cheap is not the same for everybody), where you are and how much you expect to drive annually.
The way I do it is I set a budget, research the hell out of what is available on the local car sites within that budget, then pick a car make & model.
Then for the next month or so, every day I log in to all those sites and scan the listings for one that does not match the price/model year/mileage bracket.
The ones that are far below the average are worth looking in to and then you can probably still get a deal 20% better than what is listed. It's a buyers market at the moment.
I just bought a car listed at 11950 euros everywhere for 7000, (a c5 diesel), I expect to drive it for years.
EDIT: regarding the 'trust' factor, if I'm going to code up some stuff and I need advice I'd go to HN, not to my 'mechanic buddies' because I trust them more. Trust is not just personal relationships, it is also expertise.\", \"I want to be able to \\\"pitch\\\" an idea to a group of people and have some of them accept to implement it for equity, or choose to fund it for investment.
I feel like I latched on the first successful idea, mainly because it was 'ramen profitable' from the first instant, but I have done the market research for plenty of Plan Bs and Cs and would love to see some of them come to fruition NOW, and not wait for me til I have the time. The good part is that my Plan A is 'advertising', and it can carry all others on its back free of charge. Everything piggybacks on everything else.
Or maybe I should just hunker down and get this one rolling then come back for the others one at a time.
Too many bright minds and too much time is being wasted on \\\"web 2.0\\\" utilities and single-serving crap. Corporate intranet software is where \\\"we\\\" need to be at.\", \"I have serious doubts about that being true. What about people submitting their own content? Stuff from RSS? Irc? Forwards at work? Random discovery? Only links I have ever seen on twitter is to Wil Weathon's blog posts. Not a single link I have posted on HN/reddit has ever come from twitter.
Guess my friends are more interested in posting original stuff than plugging content, and I'm pretty happy about that. If it's on their site, my RSS reader checks the internet 400x more times a day than I check twitter myself.
I think some twitter \\\"power users\\\" are oblivious to the fact that to everyone else it doesn't have to be the end all be all new everything communication platform it is to them. Me at least, I'm fully open about my ignorance about other uses :)\", \"http://www.artlebedev.com/everything/taskwatch (note the release date).\", \"Mailing list may have a cleaner interface than web, every email address subscribed to the mailing list is associated with a handle on HN web site, which can be ensured by some way. What do you think about this?\", \"Okay, it's not a business. The important part of the question is whether it's viable, which is equally valid to ask of a nonprofit.\", \"OK - but where in the world are you - such advice needs to be localised to some degree?\"], \"col10\": [1250243965, 1250243945, 1250243934, 1250243919, 1250243838, 1250243658, 1250243631, 1250243612, 1250243608, 1250243546, 1250243539, 1250243441, 1250243382, 1250243262, 1250243199, 1250243144, 1250243082, 1250243068, 1250242975, 1250242879, 1250242802, 1250242611, 1250242601, 1250242479, 1250242455, 1250242272, 1250242202, 1250242068, 1250241990, 1250241881, 1250241856, 1250241818, 1250241604, 1250241546, 1250241524, 1250241360, 1250241274, 1250241268, 1250241256, 1250241140, 1250241061, 1250241025, 1250240932, 1250240807, 1250240751, 1250240721, 1250240698]}, \"column_text\": [NaN, 762413.0, NaN, 762659.0, 762500.0, 762690.0, 762632.0, NaN, 762320.0, 762659.0, 762650.0, NaN, 761587.0, 762037.0, 762570.0, 762512.0, 762482.0, 762688.0, 762425.0, 762663.0, 762374.0, 762642.0, 762512.0, 762676.0, 762121.0, 762613.0, 762570.0, 762384.0, 762552.0, 762348.0, 762565.0, 762357.0, NaN, 762564.0, 762616.0, 761075.0, 762509.0, 762114.0, 762360.0, 762538.0, 762643.0, 762659.0, 762640.0, 762552.0, NaN, 762393.0, 762643.0]}" "{\"table_id\": \"GitTables_1503_dbpedia\", \"target_column\": \"2\", \"annotation_id\": \"http://dbpedia.org/ontology/state\", \"annotation_label\": \"state\", \"id\": \"1917\", \"table_text\": {\"col0\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19], \"col1\": [\"boundary\", \"boundary\", \"boundary\", \"boundary\", \"circle\", \"bar\", \"bar\", \"bar\", \"bar\", \"bar\", \"bar\", \"bar\", \"bar\", \"bar\", \"bar\", \"bar\", \"bar\", \"circle\", \"bar\", \"User Circle\"], \"col2\": [\"Static\", \"Static\", \"Static\", \"Static\", \"Dynamic\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Dynamic\", \"Static\", \"Dynamic\"], \"col3\": [\"Black\", \"Black\", \"Black\", \"Black\", \"Green\", \"Black\", \"Black\", \"Black\", \"Black\", \"Black\", \"Black\", \"Black\", \"Black\", \"Black\", \"Black\", \"Black\", \"Black\", \"Gray\", \"Purple\", \"Red\"], \"col4\": [128.0, -2.5, 128.0, 258.5, 138.53999328613278, 94.55877685546876, 94.55877685546876, 94.55877685546876, 94.55877685546876, 94.55877685546876, 94.55877685546876, 94.55877685546876, 94.55877685546876, 94.55877685546876, 94.55877685546876, 156.16000366210938, 156.16000366210938, 174.10000610351562, 285.6000061035156, 100.0], \"col5\": [-2.5, 128.0, 258.5, 128.0, 240.88363647460935, 24.770788192749023, 63.17078399658203, 101.57078552246094, 139.97079467773438, 178.37078857421875, 216.77078247070312, 255.17079162597656, 293.57080078125, 331.9707946777344, 370.3707885742188, 165.1199951171875, 16.120000839233402, 242.8836669921875, 2.559999942779541, 196.0], \"col6\": [0.0, 0.0, 0.0, 0.0, NaN, -0.6326818466186523, -0.6326818466186523, -0.6326818466186523, -0.6326818466186523, -0.6326818466186523, -0.6326818466186523, -0.6326818466186523, -0.6326818466186523, -0.6326818466186523, -0.6326818466186523, 1.5707963705062866, 1.5707963705062866, NaN, 0.0, NaN], \"col7\": [256.0, 5.0, 256.0, 5.0, NaN, 76.8, 76.8, 76.8, 76.8, 76.8, 76.8, 76.8, 76.8, 76.8, 76.8, 181.76, 32.239999999999995, NaN, 256.0, NaN], \"col8\": [5.0, 256.0, 5.0, 256.0, NaN, 5.12, 5.12, 5.12, 5.12, 5.12, 5.12, 5.12, 5.12, 5.12, 5.12, 5.12, 5.12, NaN, 5.12, NaN], \"col9\": [NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN], \"col10\": [NaN, NaN, NaN, NaN, 10.5, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, 12.5, NaN, 10.0]}, \"column_text\": [\"Static\", \"Static\", \"Static\", \"Static\", \"Dynamic\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Dynamic\", \"Static\", \"Dynamic\"]}" "{\"table_id\": \"GitTables_1508_dbpedia\", \"target_column\": \"2\", \"annotation_id\": \"http://dbpedia.org/ontology/writer\", \"annotation_label\": \"writer\", \"id\": \"1923\", \"table_text\": {\"col0\": [\"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\", \"VLDB\"], \"col1\": [\"Similarity_search_in_high_dimensions_via_hashing\", \"A_quantitative_analysis_and_performance_study_for_similarity-search_methods_in_high-dimensional_spaces\", \"Generic_schema_matching_with_cupid\", \"STING:_A_statistical_information_grid_approach_to_spatial_data_mining\", \"Sampling_large_databases_for_association_rules\", \"Discovery_of_multiple-level_association_rules_from_large_databases\", \"Roadrunner:_Towards_automatic_data_extraction_from_large_web_sites\", \"SPRINT:_A_scalable_parallel_classifier_for_data_mining\", \"Indexing_and_querying_XML_data_for_regular_path_expressions\", \"The_transaction_concept:_Virtues_and_limitations\", \"Wavecluster:_A_multi-resolution_clustering_approach_for_very_large_spatial_databases\", \"Efficient_progressive_skyline_computation\", \"Novel_approaches_to_the_indexing_of_moving_object_trajectories.\", \"Focused_Crawling_Using_Context_Graphs.\", \"On_the_computation_of_multidimensional_aggregates\", \"Detecting_change_in_data_streams\", \"Semantic_data_caching_and_replacement\", \"On_k-anonymity_and_the_curse_of_dimensionality\", \"Composite_events_for_active_databases:_Semantics,_contexts_and_detection\", \"Automated_selection_of_materialized_views_and_indexes_in_SQL_databases\", \"Approximate_string_joins_in_a_database_(almost)_for_free\", \"SPIRIT:_Sequential_pattern_mining_with_regular_expression_constraints\", \"Potter's_wheel:_An_interactive_data_cleaning_system\", \"Objectrank:_Authority-based_keyword_search_in_databases\", \"Linear_Hashing:_a_new_tool_for_file_and_table_addressing.\", \"Finding_intensional_knowledge_of_distance-based_outliers\", \"Knowledge_discovery_in_databases:_An_attribute-oriented_approach\", \"Schema_mapping_as_query_discovery\", \"Selectivity_estimation_without_the_attribute_value_independence_assumption\", \"Disk_Shadowing.\", \"Using_schema_matching_to_simplify_heterogeneous_data_translation\", \"A_fast_index_for_semistructured_data\", \"Adaptive_cleaning_for_RFID_data_streams\", \"Don't_Scrap_It,_Wrap_It!_A_Wrapper_Architecture_for_Legacy_Data_Sources.\", \"Algorithms_for_acyclic_database_schemes\", \"Surfing_wavelets_on_streams:_One-pass_summaries_for_approximate_aggregate_queries\", \"Optimal_histograms_with_quality_guarantees\", \"Materialized_Views_Selection_in_a_Multidimensional_Database.\", \"Answering_XML_Queries_on_Heterogeneous_Data_Sources.\", \"Weaving_Relations_for_Cache_Performance.\", \"Database_architecture_optimized_for_the_new_bottleneck:_Memory_access\", \"Composite_event_specification_in_active_databases:_Model_&_implementation\", \"An_efficient,_cost-driven_index_selection_tool_for_Microsoft_SQL_server\", \"Maximal_vector_computation_in_large_data_sets\", \"Algorithms_for_materialized_view_design_in_data_warehousing_environment\", \"A_foundation_for_multi-dimensional_databases\", \"LEO-DB2's_learning_optimizer\", \"Indexing_the_distance:_An_efficient_method_to_knn_processing\", \"A_new_SQL-like_operator_for_mining_association_rules\", \"Improving_Data_Quality:_Consistency_and_Accuracy.\", \"Materialized_view_selection_for_multidimensional_datasets\", \"The_theory_of_probabilistic_databases.\", \"Don't_be_lazy,_be_consistent:_Postgres-R,_a_new_way_to_implement_database_replication\", \"Extracting_large-scale_knowledge_bases_from_the_web\", \"Evaluating_top-k_selection_queries\", \"Indexing_multi-dimensional_uncertain_data_with_arbitrary_probability_density_functions\", \"Answering_queries_with_aggregation_using_views\", \"Sampling-based_estimation_of_the_number_of_distinct_values_of_an_attribute\", \"Automatic_composition_of_transition-based_semantic_web_services_with_messaging\", \"Including_group-by_in_query_optimization\", \"Efficient_Computation_of_Reverse_Skyline_Queries.\", \"Rainforest-a_framework_for_fast_decision_tree_construction_of_large_datasets\", \"Preferences;_Putting_More_Knowledge_into_Queries.\", \"Optimization_of_Nonrecursive_Queries.\", \"Online_balancing_of_range-partitioned_data_with_applications_to_peer-to-peer_systems\", \"Fast_computation_of_sparse_datacubes\", \"W3qs:_A_query_system_for_the_world-wide_web\", \"Data_warehouse_configuration\", \"Storage_and_querying_of_e-commerce_data\", \"Scalable_sweeping-based_spatial_join\", \"The_A-tree:_An_index_structure_for_high-dimensional_spaces_using_relative_approximation\", \"Distinct_sampling_for_highly-accurate_answers_to_distinct_values_queries_and_event_reports\", \"Comparing_hierarchical_data_in_external_memory\", \"Histogram-based_approximation_of_set-valued_query-answers\", \"Business_Process_Coordination:_State_of_the_Art,_Trends,_and_Open_Issues.\", \"Ode_as_an_Active_Database:_Constraints_and_Triggers.\", \"VGRAM:_Improving_Performance_of_Approximate_Queries_on_String_Collections_Using_Variable-Length_Grams.\", \"A_Taxonomy_and_Performance_Model_of_Data_Skew_Effects_in_Parallel_Joins.\", \"GraphDB:_Modeling_and_querying_graphs_in_databases\", \"Querying_XML_views_of_relational_data\", \"Change-centric_management_of_versions_in_an_XML_warehouse\", \"Rethinking_Database_System_Architecture:_Towards_a_Self-Tuning_RISC-Style_Database_System.\", \"Measuring_the_Complexity_of_Join_Enumeration_in_Query_Optimization.\", \"A_scalable_algorithm_for_answering_queries_using_views\", \"Resource_sharing_in_continuous_sliding-window_aggregates\", \"A_Consideration_on_Normal_Form_of_Not-Necessarily-Normalized_Relation_in_the_Relational_Data_Model.\", \"Database_Updates_through_Abduction.\", \"Instance-based_schema_matching_for_web_databases_by_domain-specific_query_probing\", \"Supporting_incremental_join_queries_on_ranked_inputs\", \"Approximate_Query_Processing:_Taming_the_TeraBytes.\", \"Window-aware_load_shedding_for_aggregation_queries_over_data_streams\", \"An_overview_of_repository_technology\", \"Improving_business_process_quality_through_exception_understanding,_prediction,_and_prevention\", \"Building_light-weight_wrappers_for_legacy_Web_data-sources_using_W4F\", \"Efficient_Processing_of_Top-k_Dominating_Queries_on_Multi-Dimensional_Data.\", \"Queries_independent_of_updates\", \"Object_fusion_in_mediator_systems\", \"The_use_of_information_capacity_in_schema_integration_and_translation\", \"Fast_incremental_maintenance_of_approximate_histograms\"], \"col2\": [\"A Gionis, P Indyk, R Motwani\", \"R Weber, HJ Schek, S Blott\", \"J Madhavan, PA Bernstein, E Rahm\", \"W Wang, J Yang, R Muntz\", \"H Toivonen\", \"J Han, Y Fu\", \"V Crescenzi, G Mecca, P Merialdo\", \"J Shafer, R Agrawal, M Mehta\", \"Q Li, B Moon\", \"J Gray\", \"G Sheikholeslami, S Chatterjee, A Zhang\", \"KL Tan, PK Eng, BC Ooi\", \"D Pfoser, CS Jensen, Y Theodoridis\", \"M Diligenti, F Coetzee, S Lawrence, CL Giles, M Gori\", \"S Agarwal, R Agrawal, PM Deshpande, A Gupta\\u2026\", \"D Kifer, S Ben-David, J Gehrke\", \"S Dar, MJ Franklin, BT Jonsson, D Srivastava, M Tan\", \"CC Aggarwal\", \"S Chakravarthy, V Krishnaprasad, E Anwar, SK Kim\", \"S Agrawal, S Chaudhuri, VR Narasayya\", \"L Gravano, PG Ipeirotis, HV Jagadish, N Koudas\\u2026\", \"MN Garofalakis, R Rastogi, K Shim\", \"V Raman, JM Hellerstein\", \"A Balmin, V Hristidis, Y Papakonstantinou\", \"W Litwin\", \"EM Knorr, RT Ng\", \"J Han, Y Cai, N Cercone\", \"RJ Miller, LM Haas, MA Hern\\u00e1ndez\", \"V Poosala, YE Ioannidis\", \"D Bitton, J Gray\", \"T Milo, S Zohar\", \"BF Cooper, N Sample, MJ Franklin, GR Hjaltason\\u2026\", \"SR Jeffery, M Garofalakis, MJ Franklin\", \"MT Roth, PM Schwarz\", \"M Yannakakis\", \"AC Gilbert, Y Kotidis, S Muthukrishnan, M Strauss\", \"HV Jagadish, N Koudas, S Muthukrishnan, V Poosala\\u2026\", \"E Baralis, S Paraboschi, E Teniente\", \"I Manolescu, D Florescu, D Kossmann\", \"A Ailamaki, DJ DeWitt, MD Hill, M Skounakis\", \"PA Boncz, S Manegold, ML Kersten\", \"NH Gehani, HV Jagadish, O Shmueli\", \"S Chaudhuri, VR Narasayya\", \"P Godfrey, R Shipley, J Gryz\", \"J Yang, K Karlapalem, Q Li\", \"M Gyssens, LVS Lakshmanan\", \"M Stillger, GM Lohman, V Markl, M Kandil\", \"C Yu, BC Ooi, KL Tan, HV Jagadish\", \"R Meo, G Psaila, S Ceri\", \"G Cong, W Fan, F Geerts, X Jia, S Ma\", \"A Shukla, P Deshpande, JF Naughton\", \"R Cavallo, M Pittarelli\", \"B Kemme, G Alonso\", \"R Kumar, P Raghavan, S Rajagopalan, A Tomkins\", \"S Chaudhuri, L Gravano\", \"Y Tao, R Cheng, X Xiao, WK Ngai, B Kao, S Prabhakar\", \"D Srivastava, S Dar, HV Jagadish, AY Levy\", \"PJ Haas, JF Naughton, S Seshadri, L Stokes\", \"D Berardi, D Calvanese, G De Giacomo, R Hull\\u2026\", \"S Chaudhuri, K Shim\", \"E Dellis, B Seeger\", \"J Gehrke, R Ramakrishnan, V Ganti\", \"M Lacroix, P Lavency\", \"R Krishnamurthy, H Boral, C Zaniolo\", \"P Ganesan, M Bawa, H Garcia-Molina\", \"KA Ross, D Srivastava\", \"D Konopnicki, O Shmueli\", \"D Theodoratos, T Sellis\", \"R Agrawal, A Somani, Y Xu\", \"L Arge, O Procopiuc, S Ramaswamy, T Suel, JS Vitter\", \"Y Sakurai, M Yoshikawa, S Uemura, H Kojima\", \"PB Gibbons\", \"SS Chawathe\", \"YE Ioannidis, V Poosala\", \"U Dayal, M Hsu, R Ladin\", \"NH Gehani, HV Jagadish\", \"C Li, B Wang, X Yang\", \"CB Walton, AG Dale, RM Jenevein\", \"RH G\\u00fcting\", \"J Shanmugasundaram, J Kiernan, EJ Shekita, C Fan\\u2026\", \"A Marian, S Abiteboul, G Cobena, L Mignet\", \"S Chaudhuri, G Weikum\", \"K Ono, GM Lohman\", \"R Pottinger, AY Levy\", \"A Arasu, J Widom\", \"A Makinouchi\", \"AC Kakas, P Mancarella\", \"J Wang, JR Wen, F Lochovsky, WY Ma\", \"A Natsev, YC Chang, JR Smith, CS Li, JS Vitter\", \"MN Garofalakis, PB Gibbons\", \"N Tatbul, S Zdonik\", \"PA Bernstein, U Dayal\", \"D Grigori, F Casati, U Dayal, MC Shan\", \"A Sahuguet, F Azavant\", \"ML Yiu, N Mamoulis\", \"AY Levy, Y Sagiv\", \"Y Papakonstantinou, S Abiteboul, H Garcia-Molina\", \"RJ Miller, YE Ioannidis, R Ramakrishnan\", \"PB Gibbons, Y Matias, V Poosala\"], \"col3\": [1999, 1998, 2001, 1997, 1996, 1995, 2001, 1996, 2001, 1981, 1998, 2001, 2000, 2000, 1996, 2004, 1996, 2005, 1994, 2000, 2001, 1999, 2001, 2004, 1980, 1999, 1992, 2000, 1997, 1988, 1998, 2001, 2006, 1997, 1981, 2001, 1998, 1997, 2001, 2001, 1999, 1992, 1997, 2005, 1997, 1997, 2001, 2001, 1996, 2007, 1998, 1987, 2000, 1999, 1999, 2005, 1996, 1995, 51, 1994, 2007, 1998, 1987, 1986, 2004, 1997, 1995, 1997, 2001, 1998, 2000, 2001, 1999, 1999, 2001, 1991, 2007, 1991, 1994, 2001, 2001, 2000, 1990, 2000, 2004, 1977, 1990, 2004, 2001, 2001, 2006, 1994, 2001, 1999, 2007, 1993, 1996, 1993, 1997], \"col4\": [3899, 2251, 2030, 1956, 1897, 1649, 1482, 1392, 1361, 1341, 1182, 966, 946, 931, 913, 897, 790, 792, 764, 754, 741, 713, 722, 691, 675, 662, 652, 615, 622, 627, 609, 625, 585, 613, 566, 564, 555, 547, 529, 503, 491, 534, 499, 482, 487, 469, 437, 414, 452, 407, 403, 392, 404, 397, 393, 369, 416, 372, 355, 361, 344, 360, 329, 351, 345, 360, 492, 331, 299, 294, 317, 283, 280, 292, 306, 448, 250, 278, 258, 373, 327, 266, 279, 317, 248, 353, 304, 252, 255, 228, 224, 257, 246, 282, 210, 273, 363, 282, 283], \"col5\": [\"http://www.dblab.ntua.gr/~gtsat/collection/lsh/LSH-VLDB-gionis99.pdf\", \"http://vldb.org/conf/1998/p194.pdf\", \"https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/tr-2001-58.pdf\", \"http://suraj.lums.edu.pk/~cs536a04/handouts/STING.pdf\", \"https://www.cin.ufpe.br/~jtalr/Mestrado/toiSample.pdf\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.39.8968&rep=rep1&type=pdf\", \"http://www.vldb.org/conf/2001/P109.pdf\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.40.2497&rep=rep1&type=pdf\", \"http://www.vldb.org/conf/2001/P361.pdf\", \"https://www.hpl.hp.com/techreports/tandem/TR-81.3.pdf\", \"http://webdocs.cs.ualberta.ca/~zaiane/courses/cmput695-00/papers/vldb98.pdf\", \"http://www.vldb.org/conf/2001/P301.pdf\", \"https://www.researchgate.net/profile/Yannis_Theodoridis/publication/2395927_Novel_Approaches_to_the_Indexing_of_Moving_Object_Trajectories/links/0c960516f90ac7862e000000.pdf\", \"http://www.vldb.org/conf/2000/P527.pdf\", \"ftp://ftp.cs.wisc.edu/pub/techreports/1997/TR1314.pdf\", \"https://books.google.co.jp/books?hl=ja&lr=lang_ja|lang_en&id=R780l9ETyw8C&oi=fnd&pg=PA180&dq=source:VLDB&ots=XJC2O0ESZl&sig=dvfu6EWtiv6OY2IDDxmU3DHveQY\", \"https://www2.cs.duke.edu/courses/cps296.1/spring02/papers/DFJST-VLDB1996.pdf\", \"http://www.charuaggarwal.net/privh.pdf\", \"http://www.vldb.org/conf/1994/P606.PDF\", \"http://www.cse.iitb.ac.in/infolab/Data/Courses/CS632/2017/2013/Papers/index-view-sel-vldb2000.pdf\", \"http://www.vldb.org/conf/2001/P491.pdf\", \"http://www.vldb.org/conf/1999/P22.pdf\", \"http://www.vldb.org/conf/2001/P381.pdf\", \"https://www.cs.ucr.edu/~vagelis/publications/ObjectRankExtended.pdf\", \"http://users.ece.northwestern.edu/~peters/references/Linearhash80.pdf\", \"http://www.academia.edu/download/45215609/Finding_Intensional_Knowledge_of_Distanc20160429-4547-dz5g0r.pdf\", \"http://hanj.cs.illinois.edu/pdf/vldb92.pdf\", \"https://www.academia.edu/download/49844185/miller00schema.pdf\", \"https://www.madgik.di.uoa.gr/sites/default/files/2018-06/vldb97_pp486-495.pdf\", \"https://books.google.co.jp/books?hl=ja&lr=lang_ja|lang_en&id=RtrSEU9HEX8C&oi=fnd&pg=PA331&dq=source:VLDB&ots=t-K9UAyV8b&sig=3jU6lMDmlrqTvuQV1LnH-hEREU0\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.30.2620&rep=rep1&type=pdf\", \"http://www.vldb.org/conf/2001/P341.pdf\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.324.1235&rep=rep1&type=pdf\", \"https://apps.dtic.mil/dtic/tr/fulltext/u2/a383046.pdf#page=79\", \"https://www.researchgate.net/profile/Mihalis_Yannakakis/publication/200034379_Algorithms_for_Acyclic_Database_Schemes/links/5745c2a708ae9f741b430b62/Algorithms-for-Acyclic-Database-Schemes.pdf\", \"http://www.vldb.org/conf/2001/P079.pdf\", \"http://engineering.nyu.edu/~suel/papers/vopt.pdf\", \"https://www.researchgate.net/profile/Ernest_Teniente/publication/2600059_Materialized_View_Selection_in_a_Multidimensional_Database/links/0fcfd50aa0b5c7ad97000000.pdf\", \"http://www.vldb.org/conf/2001/P241.pdf\", \"http://www.vldb.org/conf/2001/P169.pdf\", \"http://www.cs.cmu.edu/~natassa/courses/15-823/syllabus/papers/boncz99database.pdf\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.108.2501&rep=rep1&type=pdf\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.629.1804&rep=rep1&type=pdf\", \"http://www.eecs.yorku.ca/research/techreports/2004/CS-2004-06.pdf\", \"https://www.researchgate.net/profile/Kamalakar_Karlapalem/publication/2598345_Algorithms_for_Materialized_View_Design_in_Data_Warehousing_Environment/links/00463515be6b973e41000000/Algorithms-for-Materialized-View-Design-in-Data-Warehousing-Environment.pdf\", \"https://www.researchgate.net/profile/Marc_Gyssens/publication/2314443_A_Foundation_for_Multi-Dimensional_Databases/links/02bfe50ed7a3726193000000/A-Foundation-for-Multi-Dimensional-Databases.pdf\", \"http://www.vldb.org/conf/2001/P019.pdf\", \"http://www.vldb.org/conf/2001/P421.pdf\", \"https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.48.5095&rep=rep1&type=pdf\", \"https://www.research.ed.ac.uk/portal/files/17886909/Cong_Fan_ET_AL_2007_Improving_Data_Quality_Consistency_and_Accuracy.pdf\", \"http://www.vldb.org/conf/1998/p488.pdf\", \"http://vldb.org/conf/1987/P071.PDF\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.37.5&rep=rep1&type=pdf\", \"http://vldb.org/conf/1999/P60.pdf\", \"http://www-db.deis.unibo.it/courses/SI-LS/papers/CG99.pdf\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.122.2301&rep=rep1&type=pdf\", \"https://homes.cs.washington.edu/~alon/files/vldb96-agg.pdf\", \"http://vldb.org/conf/1995/P311.PDF\", \"https://www.dis.uniroma1.it/~degiacom/papers/2005/BCDHM_VLDB2005.pdf\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.33.1669&rep=rep1&type=pdf\", \"http://dbs.mathematik.uni-marburg.de/Publications/myPapers/2007/DS07.pdf\", \"http://www.dsi.unive.it/~dm/gehrke98rainforest.pdf\", \"http://vldb.org/conf/1987/P217.PDF\", \"https://pdfs.semanticscholar.org/2a21/d8b106066c90c3a7c81e0a9b7a66c5c9a1a3.pdf\", \"https://books.google.co.jp/books?hl=ja&lr=lang_ja|lang_en&id=R780l9ETyw8C&oi=fnd&pg=PA444&dq=source:VLDB&ots=XJC2O0ES1i&sig=Tr4mDc_Ja6_PkRDczkO4EMgi6Mo\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.49.7859&rep=rep1&type=pdf\", \"http://www.vldb.org/conf/1995/P054.PDF\", \"http://www.dblab.ntua.gr/~dwq/vldb_dwq.pdf\", \"http://www.vldb.org/conf/2001/P149.pdf\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.172.7310&rep=rep1&type=pdf\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.110.4107&rep=rep1&type=pdf\", \"http://www.vldb.org/conf/2001/P541.pdf\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.31.4695&rep=rep1&type=pdf\", \"http://www.vldb.org/conf/1999/P15.pdf\", \"http://www.vldb.org/conf/2001/P003.pdf\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.34.661&rep=rep1&type=pdf\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.120.1926&rep=rep1&type=pdf\", \"http://vldb.org/conf/1991/P537.PDF\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.52.3865&rep=rep1&type=pdf\", \"http://www.vldb.org/conf/2001/P261.pdf\", \"http://www.vldb.org/conf/2001/P581.pdf\", \"https://www.mpi-inf.mpg.de/~weikum/vldb00.pdf\", \"https://pdfs.semanticscholar.org/c50c/a444a4aa5b701670fdee589df6668c0c10d5.pdf\", \"http://www.vldb.org/conf/2000/P484.pdf\", \"https://books.google.co.jp/books?hl=ja&lr=lang_ja|lang_en&id=R780l9ETyw8C&oi=fnd&pg=PA336&dq=source:VLDB&ots=XJC2O0ES2l&sig=CR8pO8HQ7u4gdzM-scY9jBclhLM\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.86.3877&rep=rep1&type=pdf\", \"https://www.researchgate.net/profile/Antonis_Kakas/publication/221310516_Database_Updates_through_Abduction/links/00b7d518ab26387e84000000/Database-Updates-through-Abduction.pdf\", \"https://books.google.co.jp/books?hl=ja&lr=lang_ja|lang_en&id=R780l9ETyw8C&oi=fnd&pg=PA408&dq=source:VLDB&ots=XJC2O0ES2l&sig=TJk8vbCSnQSydM5vs3l5Z0OS6LU\", \"http://www.vldb.org/conf/2001/P281.pdf\", \"http://www.vldb.org/conf/2001/tut4.pdf\", \"http://people.csail.mit.edu/tatbul/publications/vldb06.pdf\", \"http://www.vldb.org/conf/1994/P705.PDF\", \"http://www.vldb.org/conf/2001/P159.pdf\", \"http://www.fing.edu.uy/inco/grupos/csi/esp/Cursos/cursos_posg/Inter2002/presentaciones/vldb99.pdf\", \"http://vldb.org/conf/2007/papers/research/p483-yiu.pdf\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.96.6183&rep=rep1&type=pdf\", NaN, \"https://pdfs.semanticscholar.org/c10f/15974e5af4e2dd4ef648eb9561a7af23191e.pdf\", \"http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.63.5414&rep=rep1&type=pdf\"], \"col6\": [8819805256031800277, 5623307406251539980, 12400328878822275772, 18399849071317195831, 1947417731565120283, 10170241709649310064, 2238350008592659688, 6746036302712498834, 18069358375787009501, 15553426371650547409, 7551061922644605284, 15076212385425117578, 3161753311470712869, 11679367004010026485, 8624620981335983298, 16274034098843644426, 255857260659170402, 1911198696550168568, 54026715598358569, 1230153639822613926, 4143253108621800460, 6639916719465555665, 10349558671112969999, 12607792507088209667, 12075333076740679543, 16198633439049355368, 16277172792739199218, 4196861274122979988, 11913203670532209411, 14159545694908363979, 11472512577855864179, 9263905110603930954, 4007797585320632150, 14661803332761417492, 11707657302403374552, 14578234391772784920, 1712319662956318931, 1518795054128430790, 6872787089534604727, 4752802751686493945, 1779171342376060467, 6387381457190907737, 17964755600477780442, 12424779558192453190, 9047502979874951403, 10892449734188189405, 1098753575267767331, 6802497760838263642, 159745057928089897, 10211669575881145299, 17997236781353917039, 18428998826912104463, 16023399584297435589, 6903868523096370256, 5172987613491551932, 6329141319810652265, 10008666722428623783, 13628882306051665362, 18206360052661275664, 271103950934645112, 7753324347996753306, 2645624839455201820, 3843437852310558647, 9361416547259119390, 13768212667454712855, 7932220144124280450, 11906190939880071114, 3344970903904929933, 8457995997384129446, 3013648788461956393, 3704911035633412242, 18208159645671603334, 13335423855313168728, 10818520946737416793, 998061164772699297, 13883821531353137752, 14249077435787570778, 14636682183475258203, 13399994808804526895, 2935918237935383613, 6879107729890268842, 6783087558569022422, 5144610119819043766, 9545398175090927348, 13832404233570618312, 3952093412755888221, 1742723347275995321, 9317809196290695888, 11030113766373439774, 11545626887968698394, 10837530436044882003, 8622998130847510180, 5071725152406394205, 5119390792718163390, 12177040012520949591, 4503299026297532456, 882404138395242937, 1780492265533408108, 6453178254518126369], \"col7\": [\"The nearest-or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing interest in building search/index structures for performing similarity search over high\\u00a0\\u2026\", \"For similarity search in high-dimensional vector spaces (or 'HDVSs'), researchers have proposed a number of new methods (or adaptations of existing methods) based, in the main, on data-space partitioning. However, the performance of these methods generally degrades\\u00a0\\u2026\", \"Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first\\u00a0\\u2026\", \"Spatial data mining, ie, discovery of interesting characteristics and patterns that may implicitly exist in spatial databases, is a challenging task due to the huge amounts of spatial data and to the new conceptual nature of the problems which must account for spatial\\u00a0\\u2026\", \"Discovery of association rules. is an important database mining problem. Current algorithms for finding association rules require several passes over the analyzed database, and obviously the role of I/O overhead is very significant for very large databases. We present\\u00a0\\u2026\", \"Previous studies on mining association rules nd rules at single concept level, however, mining association rules at multiple concept levels may lead to the discovery of more speci c and concrete knowledge from data. In this study, a top-down progressive deepening method\\u00a0\\u2026\", \"The paper investigates techniques for extracting data from HTML sites through the use of automatically generated wrappers. To automate the wrapper generation and the data extraction process, the paper develops a novel technique to compare HTML pages and\\u00a0\\u2026\", \"Classi cation is an important data mining problem. Although classi cation is a wellstudied problem, most of the current classication algorithms require that all or a portion of the the entire dataset remain permanently in memory. This limits their suitability for mining over\\u00a0\\u2026\", \"With the advent of XML as a standard for data representation and exchange on the Internet, storing and querying XML data becomes more and more important. Several XML query languages have been proposed, and the common feature of the languages is the use of\\u00a0\\u2026\", \"A traDsac: tion is a transformation of state which has the properties of atomicity (all or nothing), durability (effeets survive failures) and consistency (a correet transformation). The transaction concept is key to the structuring of data management applications. The concept\\u00a0\\u2026\", \"Many applications require the management of spatial data. Clustering large spatial databases is an important problem which tries to find the densely populated regions in the feature space to be used in data mining, knowledge discovery, or efficient information\\u00a0\\u2026\", \"In this paper, we focus on the retrieval of a set of interesting answers called the skyline from a database. Given a set of points, the skyline comprises the points that are not dominated by other points. A point dominates another point if it is as good or better in all dimensions and\\u00a0\\u2026\", \"The domain of spatiotemporal applications is a treasure trove of new types of data and queries. However, work in this area is guided by related research from the spatial and temporal domains, so far, with little attention towards the true nature of spatiotemporal\\u00a0\\u2026\", \"Maintaining currency of search engine indices by exhaustive crawling is rapidly becoming impossible due to the increasing size and dynamic content of the web. Focused crawlers aim to search only the subset of the web related to a specific category, and offer a potential\\u00a0\\u2026\", \"At the heart of OLAP or multidimensional data analysis applications is the ability to simultaneously aggregate across many sets of dimensions. Computing multidimensional aggregates is a performance bottleneck for these applications. We explore various schemes\\u00a0\\u2026\", \"Detecting changes in a data stream is an important area of research with many applications. In this paper, we present a novel method for the detection and estimation of change. In addition to providing statistical guarantees on the reliability of detected changes, our method\\u00a0\\u2026\", \"We propose a semantic model for client-side caching and replacement in a client-server database system and compare this approach to page caching and tuple caching strategies. Our caching model is based on, and derives its advantages from, three key ideas. First, the\\u00a0\\u2026\", \"In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed for privacy preserving data mining of multidimensional data records. One of the\\u00a0\\u2026\", \"Making a database system active entails developing an expressive event specification language with well-defined semantics, algorithms for the detection of composite events, and an architecture for an event detector along with its implementation. Thii paper presents the\\u00a0\\u2026\", \"Automatically selecting an appropriate set of materialized views and indexes for SQL databases is a non-trivial task. A judicious choice must be cost-driven and influenced by the workload experienced by the system. Although there has been work in materialized view\\u00a0\\u2026\", \"String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more complex queries involving joins. This is due, for example, to the prevalence of typographical\\u00a0\\u2026\", \"Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventional mining systems provide users with only a very restricted mechanism (based\\u00a0\\u2026\", \"Cleaning data of errors in structure and content is important for data warehousing and integration. Current solutions for data cleaning involve many iterations of data \\u201cauditing\\u201d to find errors, and long-running transformations to fix them. Users need to endure long waits\\u00a0\\u2026\", \"The ObjectRank system applies authority-based ranking to keyword search in databases modeled as labeled graphs. Conceptually, authority originates at the nodes (objects) containing the keywords and flows to objects according to their semantic connections. Each\\u00a0\\u2026\", \"Linear hashing is a hashing in which the address space may grow or shrink dynamically. A file or a table may then support ally number of insertions or deletions without access or memory load performance deterioration. A record in the file is, in general, found in pale\\u00a0\\u2026\", \"Existing studies on outliers focus only on the identi cation aspect; none provides any intensional knowledge of the outliers| by which we mean a description or an explanation of why an identi ed outlier is exceptional. For many applications, a description or explanation is\\u00a0\\u2026\", \"Abstract Knowledge discovery in databases, or data mining, is an important issue in the development of data-and knowledge-base systems. An attribute-oriented induction method has been developed for knowledge discovery in databases. The method integrates a\\u00a0\\u2026\", \"To enable modern data intensive applications including data warehousing, global information systems and electronic commerce, we must solve the schema mapping problem in which a source (legacy) database is mapped into a different, but fixed, target schema\\u00a0\\u2026\", \"The result size of a query that involves multiple attributes from the same relation depends on these attributes' joinr data distribution, ie, the frequencies of all combinations of attribute values. To simplify the estimation of that size, most commercial systems make the artribute\\u00a0\\u2026\", \"Disk shadowing is a technique for maintaining a set of two or more identical disk images on separate disk devices. Its primary purpose is to enhance reliability and availability of secondary storage by providing multiple paths to redundant data. However, shadowing can\\u00a0\\u2026\", \"A broad spectrum of data is available on the Web in distinct heterogeneous sources, and stored under di erent formats. As the number of systems that utilize this heterogeneous data grows, the importance of data translation and conversion mechanisms increases greatly. In\\u00a0\\u2026\", \"Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special index that is highly optimized for long and complex keys. We describe the Index Fabric, an\\u00a0\\u2026\", \"ABSTRACT A major impediment to the widespread adoption of RFID technology is the unreliability of the data streams produced by RFID readers; a 30% drop rate is not uncommon for RFID deployments. To compensate, most RFID middleware systems provide\\u00a0\\u2026\", \"Garlic is a middleware system that provides an integrated view of a variety of legacy data sources, without changing how or where data is stored. In this paper, we describe our architecture for wrappers, key components of Garlic that encapsulate data sources and\\u00a0\\u2026\", \"AfSSTRACT: Many real-world situations can be captured by a set of functional dependencies and a single join dependency of a particular form called acyclic [B..]. The join dependency corresponds to a natural decomposition into meaningful1 objects (an acyclic\\u00a0\\u2026\", \"We present techniques for computing small space representations of massive data streams. These are inspired by traditional wavelet-based approximations that consist of specific linear projections of the underlying data. We present general \\u201csketch\\u201d based methods for capturing\\u00a0\\u2026\", \"Histograms are commonly used to capture attribute value distribution statistics for query optimizers. More recently, histograms have also been considered as a way to produce quick approximate answers to decision support queries. This widespread interest in histograms\\u00a0\\u2026\", \"A multidimensional database is a data repository that supports the efficient execution of complex business decision queries. Query response can be significantly improved by storing an appropriate set of materialized views. These views are selected from the\\u00a0\\u2026\", \"9 C ' \\\"!$#&%(' ( 132547 6 8@9A ABDCF EG CIHP %( Q6$R9A#S)T 6 #UCV# WC 8S'YX` #SBa6 \\nG cD d Wfe8&CICI8 %gXih $} 5 &# ( 4 %&# 9 p A Fe h& ! 4 g ' 4 m&# cr2 &# rq$ tr & ' cru & E \\ns D ! \\\" D h &# p Ie ts 1 k D Iet &# i I p0 c F $4 g y&# X D crr u vtwyx $ w U 4 T\\u00a0\\u2026 D fr # 4 y D t t\\u00a0\\u2026\", \"Relational database systems have traditionally optimzed for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM)(aka, slotted pages). Recent research, however, indicates that cache utilization and performance is\\u00a0\\u2026\", \"In the past decade, advances in speed of commodity CPUs have far out-paced advances in memory latency. Main-memory access is therefore increasingly a performance bottleneck for many computer applications, including database systems. In this article, we use a simple\\u00a0\\u2026\", \"Active database systems require facilities to specify triggers that fire when specified events occur. We propose a language for specifying composite events as eveti expressions, formed using event operators and events (primitive or composite). An event expression maps an\\u00a0\\u2026\", \"In this paper we describe novel techniques that make it possible to build an industrial-strength tool for automating the choice of indexes in the physical design of a SQL database. The tool takes as input a workload of SQL queries, and suggests a set of suitable indexes\\u00a0\\u2026\", \"Finding the maximals in a collection of vectors is relevant to many applications. The maximal set is related to the convex hull\\u2014and hence, linear optimization\\u2014and nearest neighbors. The maximal vector problem has resurfaced with the advent of skyline queries for relational\\u00a0\\u2026\", \"Data warehouses may contain multiple views accessed by queries. When these views are related to each other and de ned over overlapping portions of the base data, it may be more e cient not to materialize all the views, but rather to materialize certain\\\\shared\\\" portions of\\u00a0\\u2026\", \"We present a multi-dimensional database model, which we believe can serve as a conceptual model for On-Line Analytical Processing (OLAP)-based applications. Apart from providing the functionalities necessary for OLAP-based applications, the main feature of the\\u00a0\\u2026\", \"Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer's estimates for the number of rows that will result at each step of the QEP for complex queries\\u00a0\\u2026\", \"In this paper, we present an efficient method, called iDistance, for K-nearest neighbor (KNN) search in a high-dimensional space. iDistance partitions the data and selects a reference point for each partition. The data in each cluster are transformed into a single dimensional\\u00a0\\u2026\", \"Data mining evolved as a collection of applicative problems and e cient solution algorithms relative to rather peculiar problems, all focused on the discovery of relevant information hidden in databases of huge dimensions. In particular, one of the most investigated topics is\\u00a0\\u2026\", \"Two central criteria for data quality are consistency and accuracy. Inconsistencies and errors in a database often emerge as violations of integrity constraints. Given a dirty database D, one needs automated methods to make it consistent, ie, find a repair D\\u2032 that satisfies the\\u00a0\\u2026\", \"To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hierarchies. However, the problem of what to precompute is difficult and intriguing. The\\u00a0\\u2026\", \"ABS! l'RACT A theory of probabilistic databases is outlined. This theory is one component of an integrated approach to data-modelling that accomodates both probabilistic and relational data. In fact, many of the results presented here were developed in the context of a\\u00a0\\u2026\", \"Database designers often point out that eager, update everywhere replication su ers from high deadlock rates, message overhead and poor response times. In this paper, we show that these limitations can be circumvented by using a combination of known and novel\\u00a0\\u2026\", \"The subject of this paper is the creation of knowledge bases by enumerating and organizing all web occurrences of certain subgraphs. We focus on subgraphs that are signatures of web phenomena such as tightly-focused topic communities, webrings, taxonomy trees, keiretsus\\u00a0\\u2026\", \"In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typically a rank of the \\u201ctop k\\u201d tuples that best match the given attribute values. In this paper, we study the\\u00a0\\u2026\", \"In an \\u201cuncertain database\\u201d, an object o is associated with a multi-dimensional probability density function (pdf), which describes the likelihood that o appears at each position in the data space. A fundamental operation is the \\u201cprobabilistic range search\\u201d which, given a value\\u00a0\\u2026\", \"We present novel algorithms for the problem of using materialized views to compute answers to SQL queries with grouping and aggregation, in the presence of multiset tables. In addition to its obvious potential in query optimization, this problem is important in many\\u00a0\\u2026\", \"We provide several new sampling-based estimators of the number of distinct values of an attribute in a relation. We compare these new estimators to estimators from the database and statistical literature empirically, using a large number of attribute-value distributions\\u00a0\\u2026\", \"In this paper we present Colombo, a framework in which web services are characterized in terms of (i) the atomic processes (ie, operations) they can perform;(ii) their impact on the \\u201creal world\\u201d(modeled as a relational database);(iii) their transition-based behavior; and (iv)\\u00a0\\u2026\", \"In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we present transformations that make it possible to push group-by operation past one or more\\u00a0\\u2026\", \"In this paper, for the first time, we introduce the concept of Reverse Skyline Queries. At first, we consider for a multidimensional data set P the problem of dynamic skyline queries according to a query point q. This kind of dynamic skyline corresponds to the skyline of a\\u00a0\\u2026\", \"Classification of large datasets is an important data mining problem. Many classification algorithms have been proposed in the literature, but studies have shown that so far no algorithm uniformly outperforms all other algorithms in terms of quality. In this paper, we\\u00a0\\u2026\", \"Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by\\u00a0\\u2026\", \"State-of-the-art optimization approaches for relational database systems, eg, those used in systems such as OBE, SQL/DS, and commercial INGRES. when used for queries in non-traditional database applications, suffer from two problems. First, the time complexity of their\\u00a0\\u2026\", \"We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable in large-scale parallel databases, as well as in peer-to-peer (P2P) systems. As tuples are\\u00a0\\u2026\", \"Datacube queries compute aggregates over database relations at a variety of granularities, and they constitute an important class of decision support queries. Real-world data is frequently sparse, and hence e ciently computing datacubes over large sparse relations is\\u00a0\\u2026\", \"Abstract The World-Wide Web (WWW) is an ever growing, distributed, non-administered, global information resource. It resides on the worldwide computer network and allows access to heterogeneous information: text, image, video, sound and graphic data. Currently\\u00a0\\u2026\", \"In the data warehousing approach to the integration of data from multiple information sources, selected information is extracted in advance and stored in a repository. A data warehouse (DW) can therefore be seen as a set of materialized views de ned over the\\u00a0\\u2026\", \"New generation of e-commerce applications require data schemas that are constantly evolving and sparsely populated. The conventional horizontal row representation fails to meet these requirements. We represent objects in a vertical format storing an object as a set\\u00a0\\u2026\", \"In this paper, we consider the filter step of the spatial join problem, for the case where neither of the inputs are indexed. We present a new algorithm, Scalable Sweeping-Based Spatial Join (SSSJ), that achieves both efficiency on real-life data and robustness against\\u00a0\\u2026\", \"We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the A-tree is the introduction of Virtual Bounding Rectangles (VBRs), which contain and approximate MBRs and data objects. VBRs can be\\u00a0\\u2026\", \"Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has shown powerful negative results on the quality of distinct-values estimates based on\\u00a0\\u2026\", \"We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, respectively, 4mn+7m+5n, 6S, andO (MN+(M+N) S1: 5), where M and N are the input tree\\u00a0\\u2026\", \"Answering queries approximately has recently been proposed as a way to reduce query response times in on-line decision support systems, when the precise answer is not necessary or early feedback is helpful. Most of the work in this area uses sampling-based\\u00a0\\u2026\", \"Over the past decade, there has been a lot of work in developing middleware for integrating and automating enterprise business processes. Today, with the growth in e-commerce and the blurring of enterprise boundaries, there is renewed interest in business process\\u00a0\\u2026\", \"Ode [2, 3] is a database system and environment based on the object paradigm. The database is defined, queried, and manipulated using the database programming language O++, which is an upward-compatible extension of the object-oriented programming\\u00a0\\u2026\", \"Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in another (possibly the same) collection of strings? Many algorithms are developed using fixed-length\\u00a0\\u2026\", \"Recent work on parallel joins and data skew has concentrated on algorithm design without considering the causes and chara. cteristics of data. skew itself. Existming ana. lyt, ic models of skew do not cont. ain enough informat, ion to fully describe data skew in parallel\\u00a0\\u2026\", \"We propose a data model and query language that integrates an explicit modeling and querying of graphs smoothly into a standard database environment. For standard applications, some key features of object-oriented modeling are offered such as object\\u00a0\\u2026\", \"XML has emerged as the standard data exchange format for Internet-based business applications. This has created the need to publish existing business data, stored in relational databases, as XML. A general way to publish relational data as XML is to provide XML views\\u00a0\\u2026\", \"We present a change-centric method to manage versions in a Web WareHouse of XML data. The starting points is a sequence of snapshots of XML documents we obtain from the web. By running a di algorithm, we compute the changes between two consecutive versions. We\\u00a0\\u2026\", \"Database technology is one of the cornerstones for the new millennium's IT landscape. However, database systems as a unit of code packaging and deployment are at a crossroad: commercial systems have been adding features for a long time and have now reached\\u00a0\\u2026\", \"Introduction 314 (the second operand of the join) is the result of a join that must be materialized in memory or-if it is too big-on disk. The heuristic saves this materialization, but may exclude better plans for certain qucrics. As an example, suppose a query with four large\\u00a0\\u2026\", \"The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing the database relations. The problem has received significant attention because of its\\u00a0\\u2026\", \"We consider the problem of resource sharing when processing large numbers of continuous queries. We specifically address sliding-window aggregates over data streams, an important class of continuous operators for which sharing has not been addressed. We present a suite\\u00a0\\u2026\", \"In this paper definitions of unnormalized relation, functional dependency on it and Normal Form are presented. The Normal Form plays a key role in our relational data model in which unnormalized relations are admitted as does the Third Normal Form of Codd in the data\\u00a0\\u2026\", \"The problem of view updates in deductive databases is studied by casting this in a naturally associated abductive framework. It is shown that this abductive approach deals successfully, in a simple yet powerful way, with the difficulties related to the presence of negation in the\\u00a0\\u2026\", \"In a Web database that dynamically provides information in response to user queries, two distinct schemas, interface schema (the schema users can query) and result schema (the schema users can browse), are presented to users. Each partially reflects the actual schema\\u00a0\\u2026\", \"This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. This problem arises in many important applications dealing with ordered inputs and multiple\\u00a0\\u2026\", \"+ Seeing entire data is very helpful (provably & in practice)(But must construct synopses for a family of queries)+ Often faster: better access patterns, small synopses can reside in memory or cache+ Middleware: Can use with any DBMS, no special index striding+ Also\\u00a0\\u2026\", \"Data stream management systems may be subject to higher input rates than their resources can handle. When overloaded, the system must shed load in order to maintain low-latency query results. In this paper, we describe a load shedding technique for queries consisting of\\u00a0\\u2026\", \"A repository is a shared database of information about engineered artifacts. We define a repository manager to be a database application that suPports checkout/checkin, version and configuration management, notification, context management, and workflow control\\u00a0\\u2026\", \"Business process automation technologies are being increasingly used by many companies to improve the efficiency of both internal processes as well as of e-services offered to customers. In order to satisfy customers and employees, business processes need to be\\u00a0\\u2026\", \"The Web has become a major conduit to information repositories of all kinds. Today, more than 80% of information published on the Web is generated by underlying databases (however access is granted through a Web gateway using forms as a query language and\\u00a0\\u2026\", \"The top-k dominating query returns k data objects which dominate the highest number of objects in a dataset. This query is an important tool for decision support since it provides data analysts an intuitive way for finding significant objects. In addition, it combines the\\u00a0\\u2026\", \"This paper considers the problem of detecting independence of a queries expressed by datalog programs from updates. We provide new insight into the independence problem by reducing it to the equivalence problem for datalog programs (both for the case of insertion\\u00a0\\u2026\", \"In this paper, we carefully explore the assumptions behind using information capacity equivalence as a measure of correctness for judging transformed schemas in schema integration and translation methodologies. We present a classification of common\\u00a0\\u2026\", \"\\u0425 \\u0432\\u043d \\u0433\\u0431\\u0431 \\u0436 \\u0430 \\u0438 \\u0437 \\u0437\\u043d\\u0437\\u0438 \\u0431\\u0437 \\u0431 \\u0432\\u0438 \\u0432 \\u0437\\u0438\\u0433 \\u0436 \\u0431\\u0437 \\u0438\\u0433 \\u0437\\u0439\\u0431\\u0431 \\u0436 \\u043e \\u0438 \\u0433\\u0432\\u0438 \\u0432\\u0438\\u0437 \\u0433 \\u0430 \\u0436 \\u0436 \\u0419 \\u0430 \\u0438 \\u0433\\u0432\\u0437 \\u0432 \\u0434 \\u0436\\u0431 \\u0438 \\u0426 \\u0432\\u0438 \\u0437\\u0438 \\u0431 \\u0438 \\u0433\\u0432 \\u0433 \\u0435\\u0439 \\u0436\\u043d \\u0436 \\u0437\\u0439\\u0430\\u0438 \\u0437 \\u043e \\u0437 \\u0433\\u0436 \\u0439\\u0437 \\u0432 \\u0435\\u0439 \\u0436\\u043d \\u0433\\u0434\\u0438 \\u0431 \\u043e \\u0436\\u0437\\u041a \\u0430 \\u043d \\u0432 \\u0438 \\u0434\\u0436\\u0433\\u0434 \\u0438 \\u0433\\u0432 \\u0433 \\u0438 \\u0437 \\u0439\\u0434 \\u0438 \\u0437 \\u0438\\u0433 \\u0438 \\u0437\\u0438\\u0433 \\u0436 \\u0431 \\u0433 \\u0438 \\u0432 \\u0432\\u0438\\u0436\\u0433 \\u0439 \\u0437 \\u0436\\u0436\\u0433\\u0436\\u0437 \\u0432 \\u0438 \\u0437\\u0438 \\u0431 \\u0438 \\u0433\\u0432\\u041a \\u042c \\u0437 \\u0434 \\u0434 \\u0436 \\u0434\\u0436 \\u0437 \\u0432\\u0438\\u0437 \\u0432 \\u043b \\u0437 \\u0431\\u0434\\u0430 \\u0432 \\u0419 \\u0437 \\u0434\\u0434\\u0436\\u0433 \\u0437 \\u0433\\u0436 \\u0432 \\u0436 \\u0431 \\u0432\\u0438 \\u0430\\u00a0\\u2026\", \"Many decision support systems, which utilize association rules for discovering interesting patterns, require the discovery of association rules that vary over time. Such rules describe complicated temporal patterns such as events that occur on the \\u201cfirst working day of every\\u00a0\\u2026\"]}, \"column_text\": [\"A Gionis, P Indyk, R Motwani\", \"R Weber, HJ Schek, S Blott\", \"J Madhavan, PA Bernstein, E Rahm\", \"W Wang, J Yang, R Muntz\", \"H Toivonen\", \"J Han, Y Fu\", \"V Crescenzi, G Mecca, P Merialdo\", \"J Shafer, R Agrawal, M Mehta\", \"Q Li, B Moon\", \"J Gray\", \"G Sheikholeslami, S Chatterjee, A Zhang\", \"KL Tan, PK Eng, BC Ooi\", \"D Pfoser, CS Jensen, Y Theodoridis\", \"M Diligenti, F Coetzee, S Lawrence, CL Giles, M Gori\", \"S Agarwal, R Agrawal, PM Deshpande, A Gupta\\u2026\", \"D Kifer, S Ben-David, J Gehrke\", \"S Dar, MJ Franklin, BT Jonsson, D Srivastava, M Tan\", \"CC Aggarwal\", \"S Chakravarthy, V Krishnaprasad, E Anwar, SK Kim\", \"S Agrawal, S Chaudhuri, VR Narasayya\", \"L Gravano, PG Ipeirotis, HV Jagadish, N Koudas\\u2026\", \"MN Garofalakis, R Rastogi, K Shim\", \"V Raman, JM Hellerstein\", \"A Balmin, V Hristidis, Y Papakonstantinou\", \"W Litwin\", \"EM Knorr, RT Ng\", \"J Han, Y Cai, N Cercone\", \"RJ Miller, LM Haas, MA Hern\\u00e1ndez\", \"V Poosala, YE Ioannidis\", \"D Bitton, J Gray\", \"T Milo, S Zohar\", \"BF Cooper, N Sample, MJ Franklin, GR Hjaltason\\u2026\", \"SR Jeffery, M Garofalakis, MJ Franklin\", \"MT Roth, PM Schwarz\", \"M Yannakakis\", \"AC Gilbert, Y Kotidis, S Muthukrishnan, M Strauss\", \"HV Jagadish, N Koudas, S Muthukrishnan, V Poosala\\u2026\", \"E Baralis, S Paraboschi, E Teniente\", \"I Manolescu, D Florescu, D Kossmann\", \"A Ailamaki, DJ DeWitt, MD Hill, M Skounakis\", \"PA Boncz, S Manegold, ML Kersten\", \"NH Gehani, HV Jagadish, O Shmueli\", \"S Chaudhuri, VR Narasayya\", \"P Godfrey, R Shipley, J Gryz\", \"J Yang, K Karlapalem, Q Li\", \"M Gyssens, LVS Lakshmanan\", \"M Stillger, GM Lohman, V Markl, M Kandil\", \"C Yu, BC Ooi, KL Tan, HV Jagadish\", \"R Meo, G Psaila, S Ceri\", \"G Cong, W Fan, F Geerts, X Jia, S Ma\", \"A Shukla, P Deshpande, JF Naughton\", \"R Cavallo, M Pittarelli\", \"B Kemme, G Alonso\", \"R Kumar, P Raghavan, S Rajagopalan, A Tomkins\", \"S Chaudhuri, L Gravano\", \"Y Tao, R Cheng, X Xiao, WK Ngai, B Kao, S Prabhakar\", \"D Srivastava, S Dar, HV Jagadish, AY Levy\", \"PJ Haas, JF Naughton, S Seshadri, L Stokes\", \"D Berardi, D Calvanese, G De Giacomo, R Hull\\u2026\", \"S Chaudhuri, K Shim\", \"E Dellis, B Seeger\", \"J Gehrke, R Ramakrishnan, V Ganti\", \"M Lacroix, P Lavency\", \"R Krishnamurthy, H Boral, C Zaniolo\", \"P Ganesan, M Bawa, H Garcia-Molina\", \"KA Ross, D Srivastava\", \"D Konopnicki, O Shmueli\", \"D Theodoratos, T Sellis\", \"R Agrawal, A Somani, Y Xu\", \"L Arge, O Procopiuc, S Ramaswamy, T Suel, JS Vitter\", \"Y Sakurai, M Yoshikawa, S Uemura, H Kojima\", \"PB Gibbons\", \"SS Chawathe\", \"YE Ioannidis, V Poosala\", \"U Dayal, M Hsu, R Ladin\", \"NH Gehani, HV Jagadish\", \"C Li, B Wang, X Yang\", \"CB Walton, AG Dale, RM Jenevein\", \"RH G\\u00fcting\", \"J Shanmugasundaram, J Kiernan, EJ Shekita, C Fan\\u2026\", \"A Marian, S Abiteboul, G Cobena, L Mignet\", \"S Chaudhuri, G Weikum\", \"K Ono, GM Lohman\", \"R Pottinger, AY Levy\", \"A Arasu, J Widom\", \"A Makinouchi\", \"AC Kakas, P Mancarella\", \"J Wang, JR Wen, F Lochovsky, WY Ma\", \"A Natsev, YC Chang, JR Smith, CS Li, JS Vitter\", \"MN Garofalakis, PB Gibbons\", \"N Tatbul, S Zdonik\", \"PA Bernstein, U Dayal\", \"D Grigori, F Casati, U Dayal, MC Shan\", \"A Sahuguet, F Azavant\", \"ML Yiu, N Mamoulis\", \"AY Levy, Y Sagiv\", \"Y Papakonstantinou, S Abiteboul, H Garcia-Molina\", \"RJ Miller, YE Ioannidis, R Ramakrishnan\", \"PB Gibbons, Y Matias, V Poosala\"]}" "{\"table_id\": \"GitTables_1511_dbpedia\", \"target_column\": \"7\", \"annotation_id\": \"http://dbpedia.org/ontology/length\", \"annotation_label\": \"length\", \"id\": \"1925\", \"table_text\": {\"col0\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], \"col1\": [\"boundary\", \"boundary\", \"boundary\", \"boundary\", \"bar\", \"bar\", \"jar\", \"bar\", \"circle\", \"circle\", \"User Circle\"], \"col2\": [\"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Dynamic\", \"Static\", \"Dynamic\", \"Dynamic\", \"Dynamic\"], \"col3\": [\"Black\", \"Black\", \"Black\", \"Black\", \"Black\", \"Black\", \"Gray\", \"Black\", \"Blue\", \"Green\", \"Red\"], \"col4\": [128.0, -2.5, 128.0, 258.5, 10.208284378051758, 245.79171752929688, 119.46711730957033, 128.0, 119.4666748046875, 96.73912048339844, 32.0], \"col5\": [-2.5, 128.0, 258.5, 128.0, 52.33304214477539, 52.33304214477539, 2.502014636993408, 104.06861114501952, 22.483665466308597, 131.38755798339844, 196.0], \"col6\": [0.0, 0.0, 0.0, 0.0, -0.9162978529930116, 0.9162978529930116, 2.1531066522584297e-05, -0.1745329201221466, NaN, NaN, NaN], \"col7\": [256.0, 5.0, 256.0, 5.0, 128.0, 128.0, 59.94038190332165, 90.0, NaN, NaN, NaN], \"col8\": [5.0, 256.0, 5.0, 256.0, 5.12, 5.12, 5.004029273986816, 5.12, NaN, NaN, NaN], \"col9\": [NaN, NaN, NaN, NaN, NaN, NaN, 39.822222222222216, NaN, NaN, NaN, NaN], \"col10\": [NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, 12.5, 8.5, 31.0]}, \"column_text\": [256.0, 5.0, 256.0, 5.0, 128.0, 128.0, 59.94038190332165, 90.0, NaN, NaN, NaN]}" "{\"table_id\": \"GitTables_1511_dbpedia\", \"target_column\": \"2\", \"annotation_id\": \"http://dbpedia.org/ontology/state\", \"annotation_label\": \"state\", \"id\": \"1926\", \"table_text\": {\"col0\": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], \"col1\": [\"boundary\", \"boundary\", \"boundary\", \"boundary\", \"bar\", \"bar\", \"jar\", \"bar\", \"circle\", \"circle\", \"User Circle\"], \"col2\": [\"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Dynamic\", \"Static\", \"Dynamic\", \"Dynamic\", \"Dynamic\"], \"col3\": [\"Black\", \"Black\", \"Black\", \"Black\", \"Black\", \"Black\", \"Gray\", \"Black\", \"Blue\", \"Green\", \"Red\"], \"col4\": [128.0, -2.5, 128.0, 258.5, 10.208284378051758, 245.79171752929688, 119.46711730957033, 128.0, 119.4666748046875, 96.73912048339844, 32.0], \"col5\": [-2.5, 128.0, 258.5, 128.0, 52.33304214477539, 52.33304214477539, 2.502014636993408, 104.06861114501952, 22.483665466308597, 131.38755798339844, 196.0], \"col6\": [0.0, 0.0, 0.0, 0.0, -0.9162978529930116, 0.9162978529930116, 2.1531066522584297e-05, -0.1745329201221466, NaN, NaN, NaN], \"col7\": [256.0, 5.0, 256.0, 5.0, 128.0, 128.0, 59.94038190332165, 90.0, NaN, NaN, NaN], \"col8\": [5.0, 256.0, 5.0, 256.0, 5.12, 5.12, 5.004029273986816, 5.12, NaN, NaN, NaN], \"col9\": [NaN, NaN, NaN, NaN, NaN, NaN, 39.822222222222216, NaN, NaN, NaN, NaN], \"col10\": [NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, 12.5, 8.5, 31.0]}, \"column_text\": [\"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Static\", \"Dynamic\", \"Static\", \"Dynamic\", \"Dynamic\", \"Dynamic\"]}" "{\"table_id\": \"GitTables_1517_dbpedia\", \"target_column\": \"7\", \"annotation_id\": \"http://dbpedia.org/ontology/title\", \"annotation_label\": \"title\", \"id\": \"1937\", \"table_text\": {\"col0\": [217193, 217192, 217191, 217190, 217189, 217188, 217187, 217186, 217185, 217184, 217183, 217182, 217181, 217180, 217179, 217178, 217177, 217176, 217175, 217174, 217173, 217172, 217171, 217170, 217169, 217168, 217167, 217166, 217165, 217164, 217162, 217161, 217159, 217158, 217157, 217156, 217155, 217154, 217153, 217152, 217151, 217150], \"col1\": [\"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"comment\", \"story\", \"story\", \"comment\", \"comment\", \"story\", \"story\", \"comment\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"story\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"story\", \"comment\", \"comment\"], \"col2\": [216323.0, 216446.0, 216835.0, NaN, 217162.0, 216323.0, 217114.0, 217114.0, NaN, 217162.0, 217182.0, NaN, NaN, 216803.0, 216895.0, NaN, NaN, 216835.0, NaN, 216835.0, 217114.0, 216960.0, 216835.0, 217114.0, 216861.0, 188489.0, 216323.0, 216960.0, 216861.0, 216960.0, NaN, 216760.0, NaN, NaN, 217087.0, 216872.0, 216960.0, 216760.0, NaN, NaN, 216975.0, 217087.0], \"col3\": [217167.0, 217113.0, 216835.0, NaN, 217162.0, 216775.0, 217173.0, 217114.0, NaN, 217162.0, 217182.0, NaN, NaN, 216803.0, 216895.0, NaN, NaN, 217171.0, NaN, 216837.0, 217170.0, 217164.0, 217090.0, 217114.0, 217012.0, 188489.0, 216323.0, 216960.0, 217012.0, 216960.0, NaN, 217042.0, NaN, NaN, 217087.0, 216872.0, 217035.0, 216842.0, NaN, NaN, 216975.0, 217130.0], \"col4\": [0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 2, 3, 0, 0, 6, 19, 0, 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 25, 0, 12, 1, 0, 0, 0, 0, 2, 6, 0, 0], \"col5\": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 19, 0, 4, 0, 0, 0, 0, 0, 1, 0, 0, 0], \"col6\": [\"markbao\", \"Xichekolas\", \"comatose_kid\", \"ralphb\", \"pmjordan\", \"markbao\", \"comatose_kid\", \"GrandMasterBirt\", \"hhm\", \"davidw\", \"lakeeffect\", \"lakeeffect\", \"markbao\", \"krschultz\", \"ComputerGuru\", \"ideas101\", \"markbao\", \"extantproject\", \"pbnaidu\", \"extantproject\", \"tjr\", \"elsewhen\", \"GrandMasterBirt\", \"byrneseyeview\", \"drawkbox\", \"dbrunton\", \"sridharvembu\", \"babul\", \"drawkbox\", \"god\", \"technoguyrob\", \"brent\", \"ideas101\", \"acyment\", \"davidw\", \"sofal\", \"cedsav\", \"brent\", \"frankus\", \"Mystalic\", \"rw\", \"art_wells\"], \"col7\": [NaN, NaN, NaN, \"The Virtue of Failing Fast\", NaN, NaN, NaN, NaN, \"The undecidable G\\u00f6del sentence\", NaN, NaN, \"Types of Languages\", \"If it can't find a solution, Google should kill YouTube\", NaN, NaN, \"Why Yahoo Passed On Microsoft's Search Deal (New Details!)\", \"Now you can upload your PDFs to Google Docs\", NaN, \"2008 Design Trends\", NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, \"Ask YC: Your most interesting bugs / bug fixes?\", NaN, \"Google Drives Towards Microsoft and Adobe With Gears\", \"You've been aggiorned, Mr. Kothari!\", NaN, NaN, NaN, NaN, \"Ask YC: Opinions on PowerDNS or other DB-backed DNS servers?\", \"Microsoft\\u2019s Yahoo Offer: $8 Billion Stock Buyback; $1 Billion for Search\", NaN, NaN], \"col8\": [NaN, NaN, NaN, \"http://www.scotthyoung.com/blog/2007/12/06/the-virtue-of-failing-fast/\", NaN, NaN, NaN, NaN, \"http://www.tachyos.org/godel/Godel_statement.html\", NaN, NaN, \"http://jorgetown.blogspot.com/2007/12/dimensions-of-type-checking.html\", \"http://news.cnet.com/8301-13506_3-9968220-17.html\", NaN, NaN, \"http://www.alleyinsider.com/2008/5/hey_yahoo_please_explain_again_why_you_passed_on_microsoft_search_deal\", \"http://googledocs.blogspot.com/2008/06/upload-your-pdfs.html\", NaN, \"http://www.webdesignerwall.com/trends/2008-design-trends/\", NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, \"http://www.techcrunch.com/2008/06/13/google-drives-towards-microsoft-and-adobe-with-gears/\", \"http://www.aggiorno.com/blog/post/Youve-been-aggiorned2c-Mr-Kothari!.aspx\", NaN, NaN, NaN, NaN, NaN, \"http://kara.allthingsd.com/20080613/microsofts-yahoo-offer-8-billion-stock-buyback-1-billion-for-search/\", NaN, NaN], \"col9\": [\"Agreed. Maybe it's teen angst (age on profile), but the reason I'm trying to do well in high school is to... get into a better college... and then what? shrug
Something to think about is what the role of high school is - is it to try to get a numerical GPA on how your work ethic is? (Absolutely not. If you love your job, you'll enjoy working at it. Likewise for school. I love hacking, not so much school.)
Or is it to let people find out what they're really interested in? (Only a few people that I know have gone through this by senior year, wanting to apply themselves to x career.)
College, at least after the first or second year, is definitely targeted to one's own career interest, and although it is much more in-depth than high school, for certain careers it can't replicate the amount of learning you have to actually do. In other words: take hacking or entrepreneurship. You'll need experience in the field, and you can't really be taught it like you can be taught biology or chemistry.\", \"Yeah I learned about the XPCNativeWrapper objects last night too. Basically GM has access to every object (from window/document on down) as one of these for security purposes (so the target page can't redefine standard methods). Due to the vagaries of the way they are implemented, you can't call the onclick/onkeypress/etc methods directly. It actually states in the documentation that addEventListener is the preferred (and only working) method.
You can supposedly get access to the underlying JS object from the XPCNativeWrapper object with the wrappedJSObject property and then act on it, but it's a big security no-no. I tried it anyway to no avail.
Your thought on the page not being loaded is kind of where I ended up too. However, my understanding was that GM ran user scripts after the window.onload finished, but I could be completely wrong here. If I assign all the links id attributes in the GM script and then manually add event listeners in my Firebug console, they work fine. Also, you'll notice that later in my script I add click listeners on other items (buttons and links) that work swimmingly, so it's either entirely arbitrary or I'm missing something very obvious.
Thanks for looking at this, I'll look forward to any other thoughts you have.
EDIT: Looks like I was very wrong about the GM script executing after the window load event. I have been playing with wrapping code in a load event listener and have indeed got it working that way. Thanks for the suggestion! I'll hopefully have something polished and posted soon.\", \"Why do you need an investor?\", \"
\\\"If you pick up just about any self-help book, you\\u2019ll get the same information: making mistakes is a good thing. What I don\\u2019t hear often enough is that you should be making those mistakes faster.\\\"\\\\nNot that a debugger helped that much after they managed to get a fairly reliable but convoluted repro. It turned out that really stressing the scripting system with certain patterns would cause the crash to happen much more frequently, so I could see it in the debugger. It didn't help all that much, it was an apparently random memory stomp, and by the time it crashed, it was much too late to tell where it came from. I forget how I figured this out but I eventually managed to narrow the cause down to garbage collection runs. Now, GC runs were periodic, but consoles place hard limits on memory. You can't just swap to disk when the going gets tough, so we had memory budgets for each game component, including the scripting system. So if scripts got particularly greedy, they'd run out of memory before the next GC run.
Now, as the memory limits were hard, some clever sod had put a GC call in the Lua malloc hook that was supplying the memory to run when there was no memory available (and the game would have crashed) - no doubt in order to fix an earlier bug. Most of our scripts didn't create hash tables, arrays, and strings frequently, so this bug hadn't been a big enough problem for what must have been years. In Lua, those types of objects require two allocations, one for the base object and one for the data storage. You can see where this is going.
If Lua ran out of memory halfway through creating a hash table, array, or string, that is, after successfully creating the base object, but failing on the data store, it would trigger a GC run. Thankfully this was actually not that hard to hit, as the data store memory generally was way bigger than the 16 or so bytes used for primitive types (i.e. base objects, numbers, ...) so the probability of not having enough contiguous space was much higher than not having a 16-byte slot. In any case, the hash table (etc) constructor had of course not returned yet, and therefore there were no references to the hash table object yet, and it promptly got collected. The memory was initialised as a hash table and returned from the constructor, and it was just a matter of time until another allocation wrote straight over that. Not just any allocation of course, as re-allocating it as a (legal) primitive type wouldn't have caused a crash.
The fix was of course easy once the cause was known: don't put the base object in the allocated list for GC consideration until the whole object had been assembled.
Took me days. And I wasn't even the first person to be assigned the bug, it was one of those hot potatoes that went round all the senior people until it landed on the junior tech programmer's list. (mine)
I looked in the checkin history for the malloc hook, and they had shipped at least one game with that bug in. (records didn't go back far enough to rule out the game before) If you figure out what scripts to trigger repeatedly, you can make that game crash.
I can't really blame just one person for this. Putting the GC call in the malloc was thoughtless. Maybe I would have done the same without checking that it was safe. In Lua itself, that was a pretty careless way to handle object creation given that the malloc hook is user-defined, so Lua has no control what goes on in there.
More bedtime war stories another time.\", \"Hell, my idea of enjoying life is hacking around and coding products. Not many things are better than learning useful stuff. check profile for age\", \"It's noise.\", \"We just hit that straight on a few days ago. Client wanted something (obviously overdramaticized it), catering to their needs we came up with an elaborate and unfortunately ugly solution, which we thought was ridiculous but necessary. Then my co-worker asked the client a REALLY good question \\\"Did you really have 'this[something]' in mind?\\\" and after a yes from the client the solution was ridiculously simple. And everyone went home happy.
Next time just step back and ask yourself \\\"what did the client really want?\\\" Then ask the client if you guessed correctly.\", NaN, \"I love doing quick, hacks to improve stuff. Sometimes it's even more fun if it's a system I'm not familiar with. Not really a 'bug', but I made Linux boot faster off of USB pen drive type devices by adding a wait queue:
http://www.welton.it/freesoftware/patches/blkdev_wakeup-2.6....
Although I don't know if it ever made it into the official kernel, as I got tired of prodding those guys to either accept it or reject it (and in the meantime they put in some lame hack telling the kernel to wait N seconds before proceeding in the hope that that was long enough to mount the device), but a number of people have thanked me for it over the years.
BTW, I'm in awe of people who spend all their time hacking kernel stuff. It's hard work, and for many things, you risk crashing your whole computer if things go wrong.\", \"Further Analysis
http://jorgetown.blogspot.com/2007/12/types-and-programming-...\", NaN, NaN, \"We use them and like them a lot. Our site is all Rails, it scaled through a few slashdot/digg spikes easily, no downtime. You are paying for no headaches and stress, and so far we have had none. Worth the price is subjective, but for us, they are.\", \"Honestly, this reads like a (poor?) PR move on Google's behalf - explain why .exe is a bad idea to cover up the obvious flaw in blocking .0 extensions. Everyone knows exe is executable, but .0 can (very easily and clearly) refer to non-executable stuff...\", NaN, NaN, \"Right on.\", NaN, \"Right. Don't put the carriage before the horse. If you have living expenses taken care of and time to spend then you can create something. It does not take investment to get started. Don't think about it too much and just make something.
... or as Guy Kawasaki put it (http://www.changethis.com/1.ArtOfTheStart):
\\\"GET GOING. Start creating and delivering your product or service. Think soldering irons, compilers, hammers, saws, and AutoCAD -\\u2014 whatever tools you use to build products and services. Don't focus on pitching, writing, and planning.\\\"
i.e. make something first.\", \"Why is that?\", \"http://www.coolest-gadgets.com/\", \"You need investors when you need heavy funding. For now just live with your parents or wherever and make a prototype. From there you might be able to convince an investor that this is the next big thing. If you are hosting a website, then start it up, and show it off.
Hell I am 24 and I am not waiting for an investor to make my company a reality. If it fails, who cares, I got many years to try again :)\", \"The first time I saw this on reddit, I realized the Good Days were over. I think that was in late 2005.\", \"Here's the MTV version of what I am talking about. http://www.youtube.com/watch?v=_6uKZWnJLCM and keep on hating rather than debating because the fallacy works!\", \"I wrote a long-format response to this essay on Jottit: http://lies.jottit.com. It's kind of too long to make as a comment, hence this pointer.\", \"Thanks for all the feedback. As a regular Hacker News reader, I am thrilled to see my post here!
Hexstream made a great comment about the wasted potential of teen years. It echoes what PG has said - boredom being the biggest problem in high school (or even college for that matter). Kids are getting smarter every generation (really true - IQ is going up world-wide), yet they don't feel challenged. Tapping that wasted potential is a huge opportunity, leave aside the \\\"doing good\\\" aspect of it.\", \"It would be very interesting to to see the yearly profile and time and effort invested to determine the effort/reward ratio for blogs like this.
People are unlikely to provide such information on public sites (if at all), but it still would be nice to see.
I ask this as I dare say you could scrape certain ecommerce sites to automatically feed a blog based on a theme e.g. gadgets, and for little/no effort thereafter get a supplementary income source if you so wished ...thinking about it, there are probably many already doing this?\", \"Well I tried to spill too much in one thread. You have no idea what you are saying because you are judging by one thread. I have studied neutrinos intently and I hope the LHC will reveal more about them as a building block. But go ahead be a hater, I can use you for fuel. btw if those are big words I am sorry.\", \"Whats the url of the \\\"gadget blog\\\"?\", \"I ran across this Reddit story:
http://www.reddit.com/info/6n7k3/comments/
And enjoyed both the article and the commentary on people's own bug troubles. Do you guys have any of your own stories (preferably as detailed as possible) about bugs and bug fixes?
This has to be one of my favorites:
http://www.ibiblio.org/harris/500milemail.html\", \"I think this is dead on. The OP should look towards publishing in a conference proceedings. In CS this is much more common than journals and his odds of getting it accepted are probably much higher. You nailed the top conferences in this area. However, these are still quite competitive. Perhaps the OP could be more specific about the area where he made an improvement and experts on the forum can try to suggest the best places to submit it.\", NaN, NaN, \"I'm not so sure wine is a commodity like he says. Well, some wine is, the kind you buy bulk from the guys who make it. My father in law gets the stuff for around a euro a liter or something, and it's actually pretty good for table wine. You can certainly taste the difference between good and bad wines, and different varieties, with a bit of experience. That's in Italy, though...\", \"It would be nice to know what the algorithm is for the movement and location of developer names, since that isn't made clear on the project page. It seems to have something to do with the average location of the files when they light up and start flying. If that's the case, what's the algorithm for the location of the appearing files?
Without knowing some of the finer details of what is going on, I find it to be more entertaining than educational. Can we learn something other than a general idea and appreciation of the activity that went into a project?\", \"What would really bother me with that business model is that you are highly dependent on your Google rank. You can lose all your revenues instantly if you are removed from the index or outranked by a competitor.\", \"If I had to guess I would presume the OP has not done a formal analysis of the algorithm. This would undoubtedly be the contribution of the professor/researcher assuming the analysis proves it is an improvement over prior algorithms. This analysis/proof is certainly worth being a second author even if it is not a contribution to the algorithm itself.\", \"I'm in charge of a web-based interface for adding and removing DNS entries for virtual hosts.
Right now we're using a kludgey system of having a webserver hit an inetd script that copies and fills in a template zone file, rsyncs it across servers, and reloads named. This is slow and somewhat unreliable.
It would be nice to be able to write to a MySQL server with slave or two instead and simply have the changes show up in subsequent DNS queries.
PowerDNS (http://en.wikipedia.org/wiki/PowerDNS) is one such server, which can use a variety of backends including RDBMSes. Do any readers have experience with this or a similar product? If so, what is the reliability and resource-intensity?\", NaN, \"Cubicle 2.0\", \"Once you begin focusing on brand, you are embracing the path of a commodity--it's a defensive posture that subtracts from quality and identity.
Anyone can buy branding and in among commodities, that is the only hope. Identity and quality, however, must be built in.\"], \"col10\": [1213394187, 1213393988, 1213393985, 1213393830, 1213393807, 1213393735, 1213393709, 1213393702, 1213393477, 1213393252, 1213393216, 1213393147, 1213393106, 1213393075, 1213393004, 1213392779, 1213392773, 1213392750, 1213392750, 1213392720, 1213392689, 1213392417, 1213392387, 1213392267, 1213392199, 1213392075, 1213391849, 1213391846, 1213391821, 1213391792, 1213391666, 1213391662, 1213391505, 1213391496, 1213391375, 1213391352, 1213391282, 1213391252, 1213391014, 1213390881, 1213390804, 1213390804]}, \"column_text\": [NaN, NaN, NaN, \"The Virtue of Failing Fast\", NaN, NaN, NaN, NaN, \"The undecidable G\\u00f6del sentence\", NaN, NaN, \"Types of Languages\", \"If it can't find a solution, Google should kill YouTube\", NaN, NaN, \"Why Yahoo Passed On Microsoft's Search Deal (New Details!)\", \"Now you can upload your PDFs to Google Docs\", NaN, \"2008 Design Trends\", NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, \"Ask YC: Your most interesting bugs / bug fixes?\", NaN, \"Google Drives Towards Microsoft and Adobe With Gears\", \"You've been aggiorned, Mr. Kothari!\", NaN, NaN, NaN, NaN, \"Ask YC: Opinions on PowerDNS or other DB-backed DNS servers?\", \"Microsoft\\u2019s Yahoo Offer: $8 Billion Stock Buyback; $1 Billion for Search\", NaN, NaN]}" "{\"table_id\": \"GitTables_1517_dbpedia\", \"target_column\": \"1\", \"annotation_id\": \"http://dbpedia.org/ontology/type\", \"annotation_label\": \"type\", \"id\": \"1938\", \"table_text\": {\"col0\": [217193, 217192, 217191, 217190, 217189, 217188, 217187, 217186, 217185, 217184, 217183, 217182, 217181, 217180, 217179, 217178, 217177, 217176, 217175, 217174, 217173, 217172, 217171, 217170, 217169, 217168, 217167, 217166, 217165, 217164, 217162, 217161, 217159, 217158, 217157, 217156, 217155, 217154, 217153, 217152, 217151, 217150], \"col1\": [\"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"comment\", \"story\", \"story\", \"comment\", \"comment\", \"story\", \"story\", \"comment\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"story\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"story\", \"comment\", \"comment\"], \"col2\": [216323.0, 216446.0, 216835.0, NaN, 217162.0, 216323.0, 217114.0, 217114.0, NaN, 217162.0, 217182.0, NaN, NaN, 216803.0, 216895.0, NaN, NaN, 216835.0, NaN, 216835.0, 217114.0, 216960.0, 216835.0, 217114.0, 216861.0, 188489.0, 216323.0, 216960.0, 216861.0, 216960.0, NaN, 216760.0, NaN, NaN, 217087.0, 216872.0, 216960.0, 216760.0, NaN, NaN, 216975.0, 217087.0], \"col3\": [217167.0, 217113.0, 216835.0, NaN, 217162.0, 216775.0, 217173.0, 217114.0, NaN, 217162.0, 217182.0, NaN, NaN, 216803.0, 216895.0, NaN, NaN, 217171.0, NaN, 216837.0, 217170.0, 217164.0, 217090.0, 217114.0, 217012.0, 188489.0, 216323.0, 216960.0, 217012.0, 216960.0, NaN, 217042.0, NaN, NaN, 217087.0, 216872.0, 217035.0, 216842.0, NaN, NaN, 216975.0, 217130.0], \"col4\": [0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 2, 3, 0, 0, 6, 19, 0, 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 25, 0, 12, 1, 0, 0, 0, 0, 2, 6, 0, 0], \"col5\": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 19, 0, 4, 0, 0, 0, 0, 0, 1, 0, 0, 0], \"col6\": [\"markbao\", \"Xichekolas\", \"comatose_kid\", \"ralphb\", \"pmjordan\", \"markbao\", \"comatose_kid\", \"GrandMasterBirt\", \"hhm\", \"davidw\", \"lakeeffect\", \"lakeeffect\", \"markbao\", \"krschultz\", \"ComputerGuru\", \"ideas101\", \"markbao\", \"extantproject\", \"pbnaidu\", \"extantproject\", \"tjr\", \"elsewhen\", \"GrandMasterBirt\", \"byrneseyeview\", \"drawkbox\", \"dbrunton\", \"sridharvembu\", \"babul\", \"drawkbox\", \"god\", \"technoguyrob\", \"brent\", \"ideas101\", \"acyment\", \"davidw\", \"sofal\", \"cedsav\", \"brent\", \"frankus\", \"Mystalic\", \"rw\", \"art_wells\"], \"col7\": [NaN, NaN, NaN, \"The Virtue of Failing Fast\", NaN, NaN, NaN, NaN, \"The undecidable G\\u00f6del sentence\", NaN, NaN, \"Types of Languages\", \"If it can't find a solution, Google should kill YouTube\", NaN, NaN, \"Why Yahoo Passed On Microsoft's Search Deal (New Details!)\", \"Now you can upload your PDFs to Google Docs\", NaN, \"2008 Design Trends\", NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, \"Ask YC: Your most interesting bugs / bug fixes?\", NaN, \"Google Drives Towards Microsoft and Adobe With Gears\", \"You've been aggiorned, Mr. Kothari!\", NaN, NaN, NaN, NaN, \"Ask YC: Opinions on PowerDNS or other DB-backed DNS servers?\", \"Microsoft\\u2019s Yahoo Offer: $8 Billion Stock Buyback; $1 Billion for Search\", NaN, NaN], \"col8\": [NaN, NaN, NaN, \"http://www.scotthyoung.com/blog/2007/12/06/the-virtue-of-failing-fast/\", NaN, NaN, NaN, NaN, \"http://www.tachyos.org/godel/Godel_statement.html\", NaN, NaN, \"http://jorgetown.blogspot.com/2007/12/dimensions-of-type-checking.html\", \"http://news.cnet.com/8301-13506_3-9968220-17.html\", NaN, NaN, \"http://www.alleyinsider.com/2008/5/hey_yahoo_please_explain_again_why_you_passed_on_microsoft_search_deal\", \"http://googledocs.blogspot.com/2008/06/upload-your-pdfs.html\", NaN, \"http://www.webdesignerwall.com/trends/2008-design-trends/\", NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, \"http://www.techcrunch.com/2008/06/13/google-drives-towards-microsoft-and-adobe-with-gears/\", \"http://www.aggiorno.com/blog/post/Youve-been-aggiorned2c-Mr-Kothari!.aspx\", NaN, NaN, NaN, NaN, NaN, \"http://kara.allthingsd.com/20080613/microsofts-yahoo-offer-8-billion-stock-buyback-1-billion-for-search/\", NaN, NaN], \"col9\": [\"Agreed. Maybe it's teen angst (age on profile), but the reason I'm trying to do well in high school is to... get into a better college... and then what? shrug
Something to think about is what the role of high school is - is it to try to get a numerical GPA on how your work ethic is? (Absolutely not. If you love your job, you'll enjoy working at it. Likewise for school. I love hacking, not so much school.)
Or is it to let people find out what they're really interested in? (Only a few people that I know have gone through this by senior year, wanting to apply themselves to x career.)
College, at least after the first or second year, is definitely targeted to one's own career interest, and although it is much more in-depth than high school, for certain careers it can't replicate the amount of learning you have to actually do. In other words: take hacking or entrepreneurship. You'll need experience in the field, and you can't really be taught it like you can be taught biology or chemistry.\", \"Yeah I learned about the XPCNativeWrapper objects last night too. Basically GM has access to every object (from window/document on down) as one of these for security purposes (so the target page can't redefine standard methods). Due to the vagaries of the way they are implemented, you can't call the onclick/onkeypress/etc methods directly. It actually states in the documentation that addEventListener is the preferred (and only working) method.
You can supposedly get access to the underlying JS object from the XPCNativeWrapper object with the wrappedJSObject property and then act on it, but it's a big security no-no. I tried it anyway to no avail.
Your thought on the page not being loaded is kind of where I ended up too. However, my understanding was that GM ran user scripts after the window.onload finished, but I could be completely wrong here. If I assign all the links id attributes in the GM script and then manually add event listeners in my Firebug console, they work fine. Also, you'll notice that later in my script I add click listeners on other items (buttons and links) that work swimmingly, so it's either entirely arbitrary or I'm missing something very obvious.
Thanks for looking at this, I'll look forward to any other thoughts you have.
EDIT: Looks like I was very wrong about the GM script executing after the window load event. I have been playing with wrapping code in a load event listener and have indeed got it working that way. Thanks for the suggestion! I'll hopefully have something polished and posted soon.\", \"Why do you need an investor?\", \"
\\\"If you pick up just about any self-help book, you\\u2019ll get the same information: making mistakes is a good thing. What I don\\u2019t hear often enough is that you should be making those mistakes faster.\\\"\\\\nNot that a debugger helped that much after they managed to get a fairly reliable but convoluted repro. It turned out that really stressing the scripting system with certain patterns would cause the crash to happen much more frequently, so I could see it in the debugger. It didn't help all that much, it was an apparently random memory stomp, and by the time it crashed, it was much too late to tell where it came from. I forget how I figured this out but I eventually managed to narrow the cause down to garbage collection runs. Now, GC runs were periodic, but consoles place hard limits on memory. You can't just swap to disk when the going gets tough, so we had memory budgets for each game component, including the scripting system. So if scripts got particularly greedy, they'd run out of memory before the next GC run.
Now, as the memory limits were hard, some clever sod had put a GC call in the Lua malloc hook that was supplying the memory to run when there was no memory available (and the game would have crashed) - no doubt in order to fix an earlier bug. Most of our scripts didn't create hash tables, arrays, and strings frequently, so this bug hadn't been a big enough problem for what must have been years. In Lua, those types of objects require two allocations, one for the base object and one for the data storage. You can see where this is going.
If Lua ran out of memory halfway through creating a hash table, array, or string, that is, after successfully creating the base object, but failing on the data store, it would trigger a GC run. Thankfully this was actually not that hard to hit, as the data store memory generally was way bigger than the 16 or so bytes used for primitive types (i.e. base objects, numbers, ...) so the probability of not having enough contiguous space was much higher than not having a 16-byte slot. In any case, the hash table (etc) constructor had of course not returned yet, and therefore there were no references to the hash table object yet, and it promptly got collected. The memory was initialised as a hash table and returned from the constructor, and it was just a matter of time until another allocation wrote straight over that. Not just any allocation of course, as re-allocating it as a (legal) primitive type wouldn't have caused a crash.
The fix was of course easy once the cause was known: don't put the base object in the allocated list for GC consideration until the whole object had been assembled.
Took me days. And I wasn't even the first person to be assigned the bug, it was one of those hot potatoes that went round all the senior people until it landed on the junior tech programmer's list. (mine)
I looked in the checkin history for the malloc hook, and they had shipped at least one game with that bug in. (records didn't go back far enough to rule out the game before) If you figure out what scripts to trigger repeatedly, you can make that game crash.
I can't really blame just one person for this. Putting the GC call in the malloc was thoughtless. Maybe I would have done the same without checking that it was safe. In Lua itself, that was a pretty careless way to handle object creation given that the malloc hook is user-defined, so Lua has no control what goes on in there.
More bedtime war stories another time.\", \"Hell, my idea of enjoying life is hacking around and coding products. Not many things are better than learning useful stuff. check profile for age\", \"It's noise.\", \"We just hit that straight on a few days ago. Client wanted something (obviously overdramaticized it), catering to their needs we came up with an elaborate and unfortunately ugly solution, which we thought was ridiculous but necessary. Then my co-worker asked the client a REALLY good question \\\"Did you really have 'this[something]' in mind?\\\" and after a yes from the client the solution was ridiculously simple. And everyone went home happy.
Next time just step back and ask yourself \\\"what did the client really want?\\\" Then ask the client if you guessed correctly.\", NaN, \"I love doing quick, hacks to improve stuff. Sometimes it's even more fun if it's a system I'm not familiar with. Not really a 'bug', but I made Linux boot faster off of USB pen drive type devices by adding a wait queue:
http://www.welton.it/freesoftware/patches/blkdev_wakeup-2.6....
Although I don't know if it ever made it into the official kernel, as I got tired of prodding those guys to either accept it or reject it (and in the meantime they put in some lame hack telling the kernel to wait N seconds before proceeding in the hope that that was long enough to mount the device), but a number of people have thanked me for it over the years.
BTW, I'm in awe of people who spend all their time hacking kernel stuff. It's hard work, and for many things, you risk crashing your whole computer if things go wrong.\", \"Further Analysis
http://jorgetown.blogspot.com/2007/12/types-and-programming-...\", NaN, NaN, \"We use them and like them a lot. Our site is all Rails, it scaled through a few slashdot/digg spikes easily, no downtime. You are paying for no headaches and stress, and so far we have had none. Worth the price is subjective, but for us, they are.\", \"Honestly, this reads like a (poor?) PR move on Google's behalf - explain why .exe is a bad idea to cover up the obvious flaw in blocking .0 extensions. Everyone knows exe is executable, but .0 can (very easily and clearly) refer to non-executable stuff...\", NaN, NaN, \"Right on.\", NaN, \"Right. Don't put the carriage before the horse. If you have living expenses taken care of and time to spend then you can create something. It does not take investment to get started. Don't think about it too much and just make something.
... or as Guy Kawasaki put it (http://www.changethis.com/1.ArtOfTheStart):
\\\"GET GOING. Start creating and delivering your product or service. Think soldering irons, compilers, hammers, saws, and AutoCAD -\\u2014 whatever tools you use to build products and services. Don't focus on pitching, writing, and planning.\\\"
i.e. make something first.\", \"Why is that?\", \"http://www.coolest-gadgets.com/\", \"You need investors when you need heavy funding. For now just live with your parents or wherever and make a prototype. From there you might be able to convince an investor that this is the next big thing. If you are hosting a website, then start it up, and show it off.
Hell I am 24 and I am not waiting for an investor to make my company a reality. If it fails, who cares, I got many years to try again :)\", \"The first time I saw this on reddit, I realized the Good Days were over. I think that was in late 2005.\", \"Here's the MTV version of what I am talking about. http://www.youtube.com/watch?v=_6uKZWnJLCM and keep on hating rather than debating because the fallacy works!\", \"I wrote a long-format response to this essay on Jottit: http://lies.jottit.com. It's kind of too long to make as a comment, hence this pointer.\", \"Thanks for all the feedback. As a regular Hacker News reader, I am thrilled to see my post here!
Hexstream made a great comment about the wasted potential of teen years. It echoes what PG has said - boredom being the biggest problem in high school (or even college for that matter). Kids are getting smarter every generation (really true - IQ is going up world-wide), yet they don't feel challenged. Tapping that wasted potential is a huge opportunity, leave aside the \\\"doing good\\\" aspect of it.\", \"It would be very interesting to to see the yearly profile and time and effort invested to determine the effort/reward ratio for blogs like this.
People are unlikely to provide such information on public sites (if at all), but it still would be nice to see.
I ask this as I dare say you could scrape certain ecommerce sites to automatically feed a blog based on a theme e.g. gadgets, and for little/no effort thereafter get a supplementary income source if you so wished ...thinking about it, there are probably many already doing this?\", \"Well I tried to spill too much in one thread. You have no idea what you are saying because you are judging by one thread. I have studied neutrinos intently and I hope the LHC will reveal more about them as a building block. But go ahead be a hater, I can use you for fuel. btw if those are big words I am sorry.\", \"Whats the url of the \\\"gadget blog\\\"?\", \"I ran across this Reddit story:
http://www.reddit.com/info/6n7k3/comments/
And enjoyed both the article and the commentary on people's own bug troubles. Do you guys have any of your own stories (preferably as detailed as possible) about bugs and bug fixes?
This has to be one of my favorites:
http://www.ibiblio.org/harris/500milemail.html\", \"I think this is dead on. The OP should look towards publishing in a conference proceedings. In CS this is much more common than journals and his odds of getting it accepted are probably much higher. You nailed the top conferences in this area. However, these are still quite competitive. Perhaps the OP could be more specific about the area where he made an improvement and experts on the forum can try to suggest the best places to submit it.\", NaN, NaN, \"I'm not so sure wine is a commodity like he says. Well, some wine is, the kind you buy bulk from the guys who make it. My father in law gets the stuff for around a euro a liter or something, and it's actually pretty good for table wine. You can certainly taste the difference between good and bad wines, and different varieties, with a bit of experience. That's in Italy, though...\", \"It would be nice to know what the algorithm is for the movement and location of developer names, since that isn't made clear on the project page. It seems to have something to do with the average location of the files when they light up and start flying. If that's the case, what's the algorithm for the location of the appearing files?
Without knowing some of the finer details of what is going on, I find it to be more entertaining than educational. Can we learn something other than a general idea and appreciation of the activity that went into a project?\", \"What would really bother me with that business model is that you are highly dependent on your Google rank. You can lose all your revenues instantly if you are removed from the index or outranked by a competitor.\", \"If I had to guess I would presume the OP has not done a formal analysis of the algorithm. This would undoubtedly be the contribution of the professor/researcher assuming the analysis proves it is an improvement over prior algorithms. This analysis/proof is certainly worth being a second author even if it is not a contribution to the algorithm itself.\", \"I'm in charge of a web-based interface for adding and removing DNS entries for virtual hosts.
Right now we're using a kludgey system of having a webserver hit an inetd script that copies and fills in a template zone file, rsyncs it across servers, and reloads named. This is slow and somewhat unreliable.
It would be nice to be able to write to a MySQL server with slave or two instead and simply have the changes show up in subsequent DNS queries.
PowerDNS (http://en.wikipedia.org/wiki/PowerDNS) is one such server, which can use a variety of backends including RDBMSes. Do any readers have experience with this or a similar product? If so, what is the reliability and resource-intensity?\", NaN, \"Cubicle 2.0\", \"Once you begin focusing on brand, you are embracing the path of a commodity--it's a defensive posture that subtracts from quality and identity.
Anyone can buy branding and in among commodities, that is the only hope. Identity and quality, however, must be built in.\"], \"col10\": [1213394187, 1213393988, 1213393985, 1213393830, 1213393807, 1213393735, 1213393709, 1213393702, 1213393477, 1213393252, 1213393216, 1213393147, 1213393106, 1213393075, 1213393004, 1213392779, 1213392773, 1213392750, 1213392750, 1213392720, 1213392689, 1213392417, 1213392387, 1213392267, 1213392199, 1213392075, 1213391849, 1213391846, 1213391821, 1213391792, 1213391666, 1213391662, 1213391505, 1213391496, 1213391375, 1213391352, 1213391282, 1213391252, 1213391014, 1213390881, 1213390804, 1213390804]}, \"column_text\": [\"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"comment\", \"story\", \"story\", \"comment\", \"comment\", \"story\", \"story\", \"comment\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"story\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"story\", \"comment\", \"comment\"]}" "{\"table_id\": \"GitTables_1518_dbpedia\", \"target_column\": \"6\", \"annotation_id\": \"http://dbpedia.org/ontology/author\", \"annotation_label\": \"author\", \"id\": \"1939\", \"table_text\": {\"col0\": [4060505, 4060504, 4060503, 4060502, 4060500, 4060499, 4060498, 4060497, 4060496, 4060495, 4060494, 4060493, 4060492, 4060491, 4060490, 4060489, 4060488, 4060487, 4060486, 4060485, 4060484, 4060483, 4060482, 4060481, 4060480, 4060479, 4060478, 4060477, 4060476, 4060475, 4060474, 4060473, 4060472, 4060471, 4060470, 4060469, 4060468, 4060467, 4060466, 4060465, 4060464, 4060463, 4060462, 4060461, 4060460, 4060459, 4060458, 4060457, 4060456, 4060455], \"col1\": [\"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"story\", \"story\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"comment\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\"], \"col2\": [4056790.0, 4060351.0, 4059820.0, 4060463.0, 4060264.0, 4060438.0, 4059586.0, 4059074.0, 4058840.0, 4060351.0, 4059820.0, 4059820.0, 4059820.0, NaN, 4059820.0, 4060289.0, 4036083.0, 4056311.0, NaN, 4058840.0, 4056311.0, 4060284.0, NaN, 4059820.0, NaN, NaN, NaN, 4056311.0, 4060264.0, 4060248.0, 4058874.0, NaN, NaN, 4060351.0, 4058874.0, 4056311.0, 4059586.0, 4058834.0, NaN, 4052719.0, 4059820.0, NaN, 4058874.0, 4058818.0, 4059356.0, 4060453.0, 4058513.0, 4058818.0, 4060264.0, 4058874.0], \"col3\": [4058633.0, 4060495.0, 4059820.0, 4060463.0, 4060371.0, 4060438.0, 4060204.0, 4059788.0, 4059744.0, 4060351.0, 4059820.0, 4060464.0, 4060253.0, NaN, 4060364.0, 4060331.0, 4037876.0, 4057635.0, NaN, 4058896.0, 4058018.0, 4060284.0, NaN, 4059820.0, NaN, NaN, NaN, 4058146.0, 4060385.0, 4060248.0, 4059496.0, NaN, NaN, 4060351.0, 4059578.0, 4057638.0, 4059946.0, 4059533.0, NaN, 4054423.0, 4060440.0, NaN, 4060370.0, 4059390.0, 4060140.0, 4060453.0, 4058513.0, 4059849.0, 4060378.0, 4060443.0], \"col4\": [2, 2, 3, 1, 21, 4, 2, 1, 1, 13, 2, 2, 4, 35, 1, 1, 3, 3, 1, 1, 1, 1, 2, 1, 1, 2, 4, 1, 15, 2, 2, 2, 1, 3, 1, 1, 1, 2, 1, 0, 2, 2, 1, 1, 4, 1, 1, 5, 18, 2], \"col5\": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0], \"col6\": [\"thenomad\", \"keithpeter\", \"moe\", \"jejones3141\", \"ars\", \"PoppyPlant\", \"speg\", \"almost\", \"s_kilk\", \"swombat\", \"ditoa\", \"faulty\", \"stevengg\", \"craigkerstiens\", \"moe\", \"alperakgun\", \"enko\", \"batista\", \"strictfp\", \"pjmlp\", \"arvinjoar\", \"iProject\", \"iProject\", \"evangineer\", \"florinmuresan\", \"evanlong\", \"iProject\", \"batista\", \"jmgao\", \"gexla\", \"tluyben2\", \"iProject\", \"joschi\", \"keithpeter\", \"tluyben2\", \"batista\", \"aw3c2\", \"tjic\", \"yunifang21rs\", \"woodall\", \"culturestate\", \"samuellevy\", \"6ren\", \"JoachimSchipper\", \"tomjen3\", \"gurraman\", \"hetman\", \"almost\", \"ars\", \"sathish316\"], \"col7\": [NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, \"Static Sites on Heroku\", NaN, NaN, NaN, NaN, \"Ask HN: What was that article on designing as a team?\", NaN, NaN, NaN, \"E-Learning: Course Hero - Study Guides, Lecture Notes, Ed. Videos...\", NaN, \"10,000 Users of Cif2.net - We doubled our numbers in 4 months\", \"Tornado gets SPDY support\", \"Thinking Digital: The UK's Answer to TED\", NaN, NaN, NaN, NaN, \"On Chinas Twitter, telling lies will get you kicked out\", \"Your Cloud, Your Data, Your Way - ownCloud 4.0 On CentOS 6.2/nginx/PostgreSQL\", NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, \"Why PHP?\", NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN], \"col8\": [NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, \"http://anti-pattern.com/2012/6/2/static-sites-on-heroku\", NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, \"http://www.coursehero.com/\", NaN, \"http://www.cif2.net/10000_users_of_cif2net__we_doubled_our_numbers_in_4_months-pagblog-article_id18537.html\", \"https://github.com/facebook/tornado/pull/525\", \"http://thenextweb.com/uk/2012/06/03/thinking-digital-the-uks-answer-to-ted/\", NaN, NaN, NaN, NaN, \"http://arstechnica.com/tech-policy/2012/06/on-chinas-twitter-telling-lies-will-get-you-kicked-out/\", \"http://www.howtoforge.com/your-cloud-your-data-your-way-owncloud-4.0-nginx-postgresql-on-centos-6.2\", NaN, NaN, NaN, NaN, NaN, \"http://home.51.com/89074692/diary/item/10051029.html\", NaN, NaN, \"http://blog.samuellevy.com/index.php?p=post&id=17\", NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN], \"col9\": [\"Sample size of one here, but if I could reasonably easily get the Adobe Production Suite, 3DSMax, and a couple of other pieces of unique 3D software to run on Linux, I'd probably move as and when Windows 8 became otherwise inevitable.\", \"I understand what you are saying in the context of the audience for this forum; coders and those running software start ups, and I think you have a point. Those who see refining their coding craft as their central interest do need to link up with market facing people to become successful.
However, I think the gentleman running the sushi bar in the original article has no big money worries if he is charging $600 a head for 10 seats with half hour turnaround!\", \"I haven't used XMonad but I've been a heavy ion3 user for many years.
Last I checked none of the available bolt-ons (including Sizeup which the author proposes) would come anywhere near a true tiling WM.
The only candidate that would even try to automatically tile windows was TylerWM - but that was buggy as hell. All the others only act on keyboard-shortcuts, which largely defeats the purpose.
I'd happily pay $200+ for ion3 as a native OSX WM. The OSX window manager is just absurdly terrible.\", \"\\\"PHP makes writing clean code a challenge...\\\"
If that works for you, great, but it sounds like a reason to stay as far away from PHP as possible to me.\", \"BTW, I hope you are aware of the massive selection bias you have going on. You are only reading about the decisions you disagree with because the forums you choose to read are those you agree with. (And because the decisions no one agrees with will be featured on the news.)
If you read all - or at least a random sampling, of decisions you will reach a different conclusion.\", \"Plants grow heroin now?\", \"Instapaper has a setting to restrict downloads to wifi. I'm assuming this new feature respects that.
edit: Apparentley Instapaper = Instagram when I am on HN way too early for a Sunday.\", \"CoffeeScript relies heavily on the underlying JavaScript semantics (which is one of the main reasons it's so useful: It's Just JavaScript) so other backends would most likely be a lot harder to do than the JS one.\", \"Ardour is a cool project but again, it's not remotely close to Pro Tools, Logic, Cubase, or even REAPER. It's like comparing a military aircraft carrier with a canoe, sure they both float on water but they're not even in the same league.
I've kept up with Ardour progress over the past 6 years and it has consistently gone nowhere while the major players innovate continuously. The assertion that Ardour has a chance at competing with the professional packages is absurd given that they've been promising basic MIDI support for years now, a feature that was present in software packages on the Atari. Add to that the fact that the project doesn't even have a roadmap for future development and it all looks pretty grim.
My previous career was audio engineering, and I can't help but laugh when the FOSS crowd insist that Ardour and Audacity are capable of replacing the industry leading software packages.\", \"I completely disagree with many points in this article.
There are a great many people out there who are very good at building stuff but utterly fail at \\\"being successful\\\". And conversely, there are people out there who suck at doing the stuff they're supposed to do but are very good at being successful. The two are orthogonal.
If you focus entirely on \\\"your craft\\\", whatever it may be, and ignore the skills that will enable you to deliver the resulting mastery to actual people (in particular sales and marketing, which most \\\"I just want to be really good at X\\\" people seem to think is beneath them), then you won't be successful. You'll just be one of those people who spends their life wondering why they were always penniless and couldn't get the things they wanted or have the impact they deserved to have even though they were really good.
The world is full of smart, competent people who don't know how to build their success, don't know how to market and sell themselves. Don't be one of those. Be a master - sure - but also learn how to translate that mastery into real success.
Re: mastery being more satisfying than success - that's only true if you're not broke. An empty belly, or the inability to afford even the most basic things you really want, makes mastery a hell of a lot less satisfying.\", \"You bought a new computer because of a fan error?! You could have got a new fan with next day delivery (so Tuesday in your case) for a hell of a lot less than a new computer and all the time it took you to get OS X setup how you want.
Or do you earn such crazy amounts of money that you made enough money on that Monday to cover the cost of the new Mac and your time configuring it?\", \"Which hardware does use thunderbolt? Never heard of anything that used it. Except for apple stuff, of course.\", \"Linus uses a macbook air [1]
Linus Torvalds: \\\"That said, Im have to admit being a bit baffled by how nobody else seems to have done what Apple did with the Macbook Air even several years after the first release, the other notebook vendors continue to push those ugly and clunky things. Yes, there are vendors that have tried to emulate it, but usually pretty badly. I dont think Im unusual in preferring my laptop to be thin and light.\\\"
http://techcrunch.com/2012/04/19/an-interview-with-millenium...\", NaN, \"Last I tried (admittedly a few months back) it was still alpha-quality. I.e. the entire screen would get shuffled unpredictably, windows would end up misaligned (partly overlapping each other) etc. - nowhere near usable.\", \"Thanks for the links; Now I noticed, I had encounted the title, nookd on HN; and took it for an article about a Linux daemon; \\\"nookd\\\".\", \"Well, that's your opinion and it's your right to have it. When you make a web page, don't put women in lingerie on it. Done.
But that's not what you said. You said it was NSFW, which I thought was a ludicrous claim and still do.
Trying to whip up a storm of righteous outrage about sexism and misogyny out of this is just ridiculous. Don't you have anything better to do?
And the hilarious thing is how you just assume the author of the page is a guy. Because, y'know, only guys can make web pages, and only guys would read hacker news! Who's sexist now?\", \">Sincerely, I don't know how the US manages to be the second most touristic country in the world. Travelling to the US can be a nightmare - customs, TSA, metal detectors, body scanners, etc. As a tourist, I've never felt as unwelcomed as when travelling there.
That is mostly a small BS business that ends in, like, 15 minutes. Then you are in the US and you can start your travel.
I've visited the US six times, road-tripping for 40 days each time, and visited (more than once) all states but Vermont (just for lack of time, next time).
You can opt for a traditional holiday (i.e pick a place, like NY, Chicago, Miami, L.A, S.F etc) or have excellent road trips, or go explore huge natural parks.
In any case, you will find great city life, places untouched by tourism at all (e.g. I remember Langtry, TX, where the nearest shop was like 50 miles away, or Avalon, MS, where only 2-3 blues buffs a year ever venture), and generally helpful and curious folk (with the occasional idiot).
Everywhere you go with a small drive you can find 99% of anything you want (just walk into the nearest Walmart for example), and you can find places to sleep ranging from $3000 a day hotels to $30 a day motels, with even the latter being just fine compared to shitholes you can get in other countries.
What I want to say is, this TSA/Airport business is an INSIGNIFICANT part of the trip. Act along with the security theater, and it is over in a few minutes.
In contrast, there are countries where you even have to bribe some officials to get in (or to avoid trouble).\", \"Not too long ago there was a link posted on HN on how to successfully come up with a design together as a team.
Out of my head it described a procedure somewhat like this:
Every team member should first think of the problem and put together a presentation stating the problem and their proposed solution. They also have to list pros and cons with their solution. Presentations are subsequently shared and members have to pick a favorite among all. In the end everybody meets to boil all suggestions down to the best overall solution.
Ring any bells?
Thank you.\", \"> Some of the best tools in the industry (Audacity, Blender, Inkscape, others?) are already free, open source, and native on Linux.
Best to whom? None of the listed ones are used at all by professional game studios.\", \"schjooo (ljudet en norrlnning gr d hen hller med)\", \"Try looking at \\\"Favorite HN threads of all time\\\":
http://news.ycombinator.com/item?id=3996652\", NaN, \"Having made a similar transition a few years ago from a mouseless linux desktop using ruby-wmii on a thinkpad to osx on a macbook, I find ShiftIt works for tiling windows using the keyboard.\", NaN, NaN, NaN, \"I've eaten in 48 states, including tons of malls. If that is what the book is saying, it is bullshit. Not to mention that in most malls you only find the same generic franchised BS.\", \"His middle name is Haskell. (Really!)\", \"If you are doing this as a contractor, then this is partly the client being dumb and you not selling. You tell the client how many hours you can work and part time / full time is largely irrelevant. If pressed, tell the client that 20 hours per week IS full time (you have a business to run!)
There may be exceptions if the project has stiff hourly requirement needs that you need to fulfill because of a tight deadline, but those expectations should have been set up front (on both sides.)
Another exception may be a salaried W2 worker. Even in that case you may only get 20 - 30 good hours of coding in a week, but I suppose everyone has to play the paperwork game.\", \"Selectorgadget is great; without checking out your creations in real life, did you consider taping selectorgadget to a proxy so you can scrape sites and store the paths you found in one go? That would massively enhance the process imho :) Maybe Apify can do that, but I hope they put that in github as well; i'm not a great fan of closed source/cloud development tools.\", NaN, NaN, \"\\\"9. A tiny little sushi bar in some random subway station. Yet people wait in line, people book a stool at his sushi bar as much as a year in advance, a prices starting around $600 a head. People have been known to fly all the way from America or Europe, just to experience a 30-minute meal. In a subway station!\\\"
Can authenticity be scaled up?
This particular establishment isn't really a humble 10 seat Tokyo sushi bar in my (perhaps odd) way of thinking, it is a very good simulation of one but wrenched from the ecology of such street food places.
So by acknowledging the mastery, we have changed the practice.\", \"I was going to suggest here that you do. And opensource your creation on github so we can all improve it.\", \">For example, people here generally eat lamb only once or twice a year
Well, as a Greek, I beg to differ. We eat lamb more than \\\"once a year\\\" (you probably refer to easter, but forget the mighty paidakia). Plus, this cow meat we mostly eat now is a recent development.
The traditional meat until 4-5 decades ago was lamb and goat (mostly because Greek domestic cows where too skinny and the grass unfit to support them. Post 1981 they were replaced with foreign cow breeds plus tons of imports).
As for hummus: \\\"Greek\\\" restaurants abroad are often mixed Greek/Middle-Eastern, and some are run by Lebanese and use the \\\"Greek\\\" just to attract some additional customers.
A funny aside: the traditional american \\\"diner\\\" (the chrome plated, hamburger joint etc) was more often than not, a Greek business. Greeks pwned the diner business in the US in the '40 to '80s. If you check a series like \\\"Diners, Drive-Ins and Dives\\\", a disproportionate percentage of iconic food joints are still in Greek hands, including the majority of NY hot dog stands. I have travelled extensively in the US (only missed Vermont), and I chanced upon several, such as:
Lou Mitchels, the Chicago diner at the start point of Route 66. Nick's, in Albq., NM at the crossing of Route 66 (old route) and Route 66 (later bypass) (!), Leopold's, considered the best ice cream in Savannah, GA (and featured in top-10 US lists) Ariston, on Route 66, IL, suggested by every guide, Mike's Chilly Parlor, in Seattle, etc. nom nom nom nom...\", \"I tried to get a friend to use XMPP/Jabber for free (private, secure) text messaging but it failed because of this. Improved my impression that iOS is not capable of much while being pretty good at what it can.\", \"Three. One I walk dogs with daily.\", NaN, \"Philosophicalness: -5\\\\nCraziness: 982374982374082348912823
You guys need to get off the internet and into the real world a bit more.\", \">How does one use a data projector from an Apple laptop these days?
I carry Thunderbolt-to-VGA, DVI, and HDMI adapters with my laptop at all times. It's kind of a pain, to be honest.\", NaN, \"You need to specify a unique index for the attribute - you specified it as \\\"tweet\\\", but not how to scrape it. The error messages are not informative at this stage; it might be something else too.
I tried to fix your e.g. but couldn't get it to work (I tried //span@data-time (xpath) - what is the unique index of a tweet?)\", \"I don't agree. First, the people complaining about downvotes often really did write a comment worth being downvoted (I didn't look at your history). Second, HN is still very valuable if the top comments are all good - it's much less necessary that all good comments are on the top. And despite what people say, the key source of groupthink on HN is not the voting system (rather, the homogeneity of the user base.)\", \"I realise this is a dangerous subject, but I am genuinly curious: given the business you run and the work you do for the Freebsd team, why would you object to using c++, but not c?
I could understand why you would object to both, but why only the lower level language.\", \"I've been using this wonderful piece of software for a couple of weeks now. It's extremely powerful when you need to implement multiple interfaces (including non-HTTP-based) to the same data-source.
The performance (only done preliminary testing) looks very promising as well.
A huge amount of kudos to the author!\", \"I suppose that depends on how one defines \\\"engineering\\\". I consider engineering to be a way of formalising methodology to get consistent, repeatable, and verifiable results. My opinion on this topic is based both on this view of engineering as well as experience having worked at different times as an electrical engineer and software developer. I would say yes, mathematics is indispensable for good software engineering, although it certainly isn't the only requisite skill to meet the above definition (nor always the most important).\", \"Don't feed the trolls! If a comment is bad enough for me to want to downvote it I certainly don't want to engage the author in conversation. In fact, by downvoting I hope to push the comment further down so there to let the better comments float up and to make it less likely it will start a stupid pointless argument thread, replying would do the oposite usually.
Also, I think that, in general, quoting in comments tends to lead to lower quality comments. It's a lot easier to do a point by point nitpick than the write a proper response to the ideas contained in the parent post.\", \"I like to read judges decisions occasionally and I've always been impressed - I haven't always agreed, but they are always well written and well reasoned.
Maybe it's a bit of selection bias in my choice of decisions to read (typically the cases that are on the news), but I suspect most judges are extremely smart and very good at what they do.
If you (plural you) don't read them, you should - they are not written for lawyers (aside from a tiny bit of jargon that is easy to lookup - usually Latin words). Typically before deciding any law the Judge will include an introduction with an explanation of how the law is structured, and it's clear that that's not written for lawyers (who would be expected to know this already), but for the general public.\", \"Thanks for the feedback. Will fix it in a future version.
Service is just an extension of this library:
https://github.com/sathish316/scrapify
The intent of service is to make mobile apps without a backend/db like Parse for read only APIs\"], \"col10\": [1338721180, 1338721024, 1338720841, 1338720824, 1338720682, 1338720533, 1338720520, 1338720499, 1338720475, 1338720467, 1338720333, 1338720310, 1338720306, 1338720303, 1338720231, 1338720158, 1338720120, 1338719999, 1338719980, 1338719970, 1338719867, 1338719747, 1338719618, 1338719618, 1338719616, 1338719512, 1338719137, 1338719118, 1338719097, 1338719066, 1338719023, 1338718961, 1338718949, 1338718940, 1338718893, 1338718868, 1338718538, 1338718474, 1338718367, 1338718364, 1338718250, 1338718242, 1338718215, 1338718064, 1338717986, 1338717819, 1338717787, 1338717764, 1338717680, 1338717601]}, \"column_text\": [\"thenomad\", \"keithpeter\", \"moe\", \"jejones3141\", \"ars\", \"PoppyPlant\", \"speg\", \"almost\", \"s_kilk\", \"swombat\", \"ditoa\", \"faulty\", \"stevengg\", \"craigkerstiens\", \"moe\", \"alperakgun\", \"enko\", \"batista\", \"strictfp\", \"pjmlp\", \"arvinjoar\", \"iProject\", \"iProject\", \"evangineer\", \"florinmuresan\", \"evanlong\", \"iProject\", \"batista\", \"jmgao\", \"gexla\", \"tluyben2\", \"iProject\", \"joschi\", \"keithpeter\", \"tluyben2\", \"batista\", \"aw3c2\", \"tjic\", \"yunifang21rs\", \"woodall\", \"culturestate\", \"samuellevy\", \"6ren\", \"JoachimSchipper\", \"tomjen3\", \"gurraman\", \"hetman\", \"almost\", \"ars\", \"sathish316\"]}" "{\"table_id\": \"GitTables_1518_dbpedia\", \"target_column\": \"10\", \"annotation_id\": \"http://dbpedia.org/ontology/created\", \"annotation_label\": \"created\", \"id\": \"1940\", \"table_text\": {\"col0\": [4060505, 4060504, 4060503, 4060502, 4060500, 4060499, 4060498, 4060497, 4060496, 4060495, 4060494, 4060493, 4060492, 4060491, 4060490, 4060489, 4060488, 4060487, 4060486, 4060485, 4060484, 4060483, 4060482, 4060481, 4060480, 4060479, 4060478, 4060477, 4060476, 4060475, 4060474, 4060473, 4060472, 4060471, 4060470, 4060469, 4060468, 4060467, 4060466, 4060465, 4060464, 4060463, 4060462, 4060461, 4060460, 4060459, 4060458, 4060457, 4060456, 4060455], \"col1\": [\"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"story\", \"story\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"story\", \"comment\", \"comment\", \"story\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\", \"comment\"], \"col2\": [4056790.0, 4060351.0, 4059820.0, 4060463.0, 4060264.0, 4060438.0, 4059586.0, 4059074.0, 4058840.0, 4060351.0, 4059820.0, 4059820.0, 4059820.0, NaN, 4059820.0, 4060289.0, 4036083.0, 4056311.0, NaN, 4058840.0, 4056311.0, 4060284.0, NaN, 4059820.0, NaN, NaN, NaN, 4056311.0, 4060264.0, 4060248.0, 4058874.0, NaN, NaN, 4060351.0, 4058874.0, 4056311.0, 4059586.0, 4058834.0, NaN, 4052719.0, 4059820.0, NaN, 4058874.0, 4058818.0, 4059356.0, 4060453.0, 4058513.0, 4058818.0, 4060264.0, 4058874.0], \"col3\": [4058633.0, 4060495.0, 4059820.0, 4060463.0, 4060371.0, 4060438.0, 4060204.0, 4059788.0, 4059744.0, 4060351.0, 4059820.0, 4060464.0, 4060253.0, NaN, 4060364.0, 4060331.0, 4037876.0, 4057635.0, NaN, 4058896.0, 4058018.0, 4060284.0, NaN, 4059820.0, NaN, NaN, NaN, 4058146.0, 4060385.0, 4060248.0, 4059496.0, NaN, NaN, 4060351.0, 4059578.0, 4057638.0, 4059946.0, 4059533.0, NaN, 4054423.0, 4060440.0, NaN, 4060370.0, 4059390.0, 4060140.0, 4060453.0, 4058513.0, 4059849.0, 4060378.0, 4060443.0], \"col4\": [2, 2, 3, 1, 21, 4, 2, 1, 1, 13, 2, 2, 4, 35, 1, 1, 3, 3, 1, 1, 1, 1, 2, 1, 1, 2, 4, 1, 15, 2, 2, 2, 1, 3, 1, 1, 1, 2, 1, 0, 2, 2, 1, 1, 4, 1, 1, 5, 18, 2], \"col5\": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0], \"col6\": [\"thenomad\", \"keithpeter\", \"moe\", \"jejones3141\", \"ars\", \"PoppyPlant\", \"speg\", \"almost\", \"s_kilk\", \"swombat\", \"ditoa\", \"faulty\", \"stevengg\", \"craigkerstiens\", \"moe\", \"alperakgun\", \"enko\", \"batista\", \"strictfp\", \"pjmlp\", \"arvinjoar\", \"iProject\", \"iProject\", \"evangineer\", \"florinmuresan\", \"evanlong\", \"iProject\", \"batista\", \"jmgao\", \"gexla\", \"tluyben2\", \"iProject\", \"joschi\", \"keithpeter\", \"tluyben2\", \"batista\", \"aw3c2\", \"tjic\", \"yunifang21rs\", \"woodall\", \"culturestate\", \"samuellevy\", \"6ren\", \"JoachimSchipper\", \"tomjen3\", \"gurraman\", \"hetman\", \"almost\", \"ars\", \"sathish316\"], \"col7\": [NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, \"Static Sites on Heroku\", NaN, NaN, NaN, NaN, \"Ask HN: What was that article on designing as a team?\", NaN, NaN, NaN, \"E-Learning: Course Hero - Study Guides, Lecture Notes, Ed. Videos...\", NaN, \"10,000 Users of Cif2.net - We doubled our numbers in 4 months\", \"Tornado gets SPDY support\", \"Thinking Digital: The UK's Answer to TED\", NaN, NaN, NaN, NaN, \"On Chinas Twitter, telling lies will get you kicked out\", \"Your Cloud, Your Data, Your Way - ownCloud 4.0 On CentOS 6.2/nginx/PostgreSQL\", NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, \"Why PHP?\", NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN], \"col8\": [NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, \"http://anti-pattern.com/2012/6/2/static-sites-on-heroku\", NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN, \"http://www.coursehero.com/\", NaN, \"http://www.cif2.net/10000_users_of_cif2net__we_doubled_our_numbers_in_4_months-pagblog-article_id18537.html\", \"https://github.com/facebook/tornado/pull/525\", \"http://thenextweb.com/uk/2012/06/03/thinking-digital-the-uks-answer-to-ted/\", NaN, NaN, NaN, NaN, \"http://arstechnica.com/tech-policy/2012/06/on-chinas-twitter-telling-lies-will-get-you-kicked-out/\", \"http://www.howtoforge.com/your-cloud-your-data-your-way-owncloud-4.0-nginx-postgresql-on-centos-6.2\", NaN, NaN, NaN, NaN, NaN, \"http://home.51.com/89074692/diary/item/10051029.html\", NaN, NaN, \"http://blog.samuellevy.com/index.php?p=post&id=17\", NaN, NaN, NaN, NaN, NaN, NaN, NaN, NaN], \"col9\": [\"Sample size of one here, but if I could reasonably easily get the Adobe Production Suite, 3DSMax, and a couple of other pieces of unique 3D software to run on Linux, I'd probably move as and when Windows 8 became otherwise inevitable.\", \"I understand what you are saying in the context of the audience for this forum; coders and those running software start ups, and I think you have a point. Those who see refining their coding craft as their central interest do need to link up with market facing people to become successful.
However, I think the gentleman running the sushi bar in the original article has no big money worries if he is charging $600 a head for 10 seats with half hour turnaround!\", \"I haven't used XMonad but I've been a heavy ion3 user for many years.
Last I checked none of the available bolt-ons (including Sizeup which the author proposes) would come anywhere near a true tiling WM.
The only candidate that would even try to automatically tile windows was TylerWM - but that was buggy as hell. All the others only act on keyboard-shortcuts, which largely defeats the purpose.
I'd happily pay $200+ for ion3 as a native OSX WM. The OSX window manager is just absurdly terrible.\", \"\\\"PHP makes writing clean code a challenge...\\\"
If that works for you, great, but it sounds like a reason to stay as far away from PHP as possible to me.\", \"BTW, I hope you are aware of the massive selection bias you have going on. You are only reading about the decisions you disagree with because the forums you choose to read are those you agree with. (And because the decisions no one agrees with will be featured on the news.)
If you read all - or at least a random sampling, of decisions you will reach a different conclusion.\", \"Plants grow heroin now?\", \"Instapaper has a setting to restrict downloads to wifi. I'm assuming this new feature respects that.
edit: Apparentley Instapaper = Instagram when I am on HN way too early for a Sunday.\", \"CoffeeScript relies heavily on the underlying JavaScript semantics (which is one of the main reasons it's so useful: It's Just JavaScript) so other backends would most likely be a lot harder to do than the JS one.\", \"Ardour is a cool project but again, it's not remotely close to Pro Tools, Logic, Cubase, or even REAPER. It's like comparing a military aircraft carrier with a canoe, sure they both float on water but they're not even in the same league.
I've kept up with Ardour progress over the past 6 years and it has consistently gone nowhere while the major players innovate continuously. The assertion that Ardour has a chance at competing with the professional packages is absurd given that they've been promising basic MIDI support for years now, a feature that was present in software packages on the Atari. Add to that the fact that the project doesn't even have a roadmap for future development and it all looks pretty grim.
My previous career was audio engineering, and I can't help but laugh when the FOSS crowd insist that Ardour and Audacity are capable of replacing the industry leading software packages.\", \"I completely disagree with many points in this article.
There are a great many people out there who are very good at building stuff but utterly fail at \\\"being successful\\\". And conversely, there are people out there who suck at doing the stuff they're supposed to do but are very good at being successful. The two are orthogonal.
If you focus entirely on \\\"your craft\\\", whatever it may be, and ignore the skills that will enable you to deliver the resulting mastery to actual people (in particular sales and marketing, which most \\\"I just want to be really good at X\\\" people seem to think is beneath them), then you won't be successful. You'll just be one of those people who spends their life wondering why they were always penniless and couldn't get the things they wanted or have the impact they deserved to have even though they were really good.
The world is full of smart, competent people who don't know how to build their success, don't know how to market and sell themselves. Don't be one of those. Be a master - sure - but also learn how to translate that mastery into real success.
Re: mastery being more satisfying than success - that's only true if you're not broke. An empty belly, or the inability to afford even the most basic things you really want, makes mastery a hell of a lot less satisfying.\", \"You bought a new computer because of a fan error?! You could have got a new fan with next day delivery (so Tuesday in your case) for a hell of a lot less than a new computer and all the time it took you to get OS X setup how you want.
Or do you earn such crazy amounts of money that you made enough money on that Monday to cover the cost of the new Mac and your time configuring it?\", \"Which hardware does use thunderbolt? Never heard of anything that used it. Except for apple stuff, of course.\", \"Linus uses a macbook air [1]
Linus Torvalds: \\\"That said, Im have to admit being a bit baffled by how nobody else seems to have done what Apple did with the Macbook Air even several years after the first release, the other notebook vendors continue to push those ugly and clunky things. Yes, there are vendors that have tried to emulate it, but usually pretty badly. I dont think Im unusual in preferring my laptop to be thin and light.\\\"
http://techcrunch.com/2012/04/19/an-interview-with-millenium...\", NaN, \"Last I tried (admittedly a few months back) it was still alpha-quality. I.e. the entire screen would get shuffled unpredictably, windows would end up misaligned (partly overlapping each other) etc. - nowhere near usable.\", \"Thanks for the links; Now I noticed, I had encounted the title, nookd on HN; and took it for an article about a Linux daemon; \\\"nookd\\\".\", \"Well, that's your opinion and it's your right to have it. When you make a web page, don't put women in lingerie on it. Done.
But that's not what you said. You said it was NSFW, which I thought was a ludicrous claim and still do.
Trying to whip up a storm of righteous outrage about sexism and misogyny out of this is just ridiculous. Don't you have anything better to do?
And the hilarious thing is how you just assume the author of the page is a guy. Because, y'know, only guys can make web pages, and only guys would read hacker news! Who's sexist now?\", \">Sincerely, I don't know how the US manages to be the second most touristic country in the world. Travelling to the US can be a nightmare - customs, TSA, metal detectors, body scanners, etc. As a tourist, I've never felt as unwelcomed as when travelling there.
That is mostly a small BS business that ends in, like, 15 minutes. Then you are in the US and you can start your travel.
I've visited the US six times, road-tripping for 40 days each time, and visited (more than once) all states but Vermont (just for lack of time, next time).
You can opt for a traditional holiday (i.e pick a place, like NY, Chicago, Miami, L.A, S.F etc) or have excellent road trips, or go explore huge natural parks.
In any case, you will find great city life, places untouched by tourism at all (e.g. I remember Langtry, TX, where the nearest shop was like 50 miles away, or Avalon, MS, where only 2-3 blues buffs a year ever venture), and generally helpful and curious folk (with the occasional idiot).
Everywhere you go with a small drive you can find 99% of anything you want (just walk into the nearest Walmart for example), and you can find places to sleep ranging from $3000 a day hotels to $30 a day motels, with even the latter being just fine compared to shitholes you can get in other countries.
What I want to say is, this TSA/Airport business is an INSIGNIFICANT part of the trip. Act along with the security theater, and it is over in a few minutes.
In contrast, there are countries where you even have to bribe some officials to get in (or to avoid trouble).\", \"Not too long ago there was a link posted on HN on how to successfully come up with a design together as a team.
Out of my head it described a procedure somewhat like this:
Every team member should first think of the problem and put together a presentation stating the problem and their proposed solution. They also have to list pros and cons with their solution. Presentations are subsequently shared and members have to pick a favorite among all. In the end everybody meets to boil all suggestions down to the best overall solution.
Ring any bells?
Thank you.\", \"> Some of the best tools in the industry (Audacity, Blender, Inkscape, others?) are already free, open source, and native on Linux.
Best to whom? None of the listed ones are used at all by professional game studios.\", \"schjooo (ljudet en norrlnning gr d hen hller med)\", \"Try looking at \\\"Favorite HN threads of all time\\\":
http://news.ycombinator.com/item?id=3996652\", NaN, \"Having made a similar transition a few years ago from a mouseless linux desktop using ruby-wmii on a thinkpad to osx on a macbook, I find ShiftIt works for tiling windows using the keyboard.\", NaN, NaN, NaN, \"I've eaten in 48 states, including tons of malls. If that is what the book is saying, it is bullshit. Not to mention that in most malls you only find the same generic franchised BS.\", \"His middle name is Haskell. (Really!)\", \"If you are doing this as a contractor, then this is partly the client being dumb and you not selling. You tell the client how many hours you can work and part time / full time is largely irrelevant. If pressed, tell the client that 20 hours per week IS full time (you have a business to run!)
There may be exceptions if the project has stiff hourly requirement needs that you need to fulfill because of a tight deadline, but those expectations should have been set up front (on both sides.)
Another exception may be a salaried W2 worker. Even in that case you may only get 20 - 30 good hours of coding in a week, but I suppose everyone has to play the paperwork game.\", \"Selectorgadget is great; without checking out your creations in real life, did you consider taping selectorgadget to a proxy so you can scrape sites and store the paths you found in one go? That would massively enhance the process imho :) Maybe Apify can do that, but I hope they put that in github as well; i'm not a great fan of closed source/cloud development tools.\", NaN, NaN, \"\\\"9. A tiny little sushi bar in some random subway station. Yet people wait in line, people book a stool at his sushi bar as much as a year in advance, a prices starting around $600 a head. People have been known to fly all the way from America or Europe, just to experience a 30-minute meal. In a subway station!\\\"
Can authenticity be scaled up?
This particular establishment isn't really a humble 10 seat Tokyo sushi bar in my (perhaps odd) way of thinking, it is a very good simulation of one but wrenched from the ecology of such street food places.
So by acknowledging the mastery, we have changed the practice.\", \"I was going to suggest here that you do. And opensource your creation on github so we can all improve it.\", \">For example, people here generally eat lamb only once or twice a year
Well, as a Greek, I beg to differ. We eat lamb more than \\\"once a year\\\" (you probably refer to easter, but forget the mighty paidakia). Plus, this cow meat we mostly eat now is a recent development.
The traditional meat until 4-5 decades ago was lamb and goat (mostly because Greek domestic cows where too skinny and the grass unfit to support them. Post 1981 they were replaced with foreign cow breeds plus tons of imports).
As for hummus: \\\"Greek\\\" restaurants abroad are often mixed Greek/Middle-Eastern, and some are run by Lebanese and use the \\\"Greek\\\" just to attract some additional customers.
A funny aside: the traditional american \\\"diner\\\" (the chrome plated, hamburger joint etc) was more often than not, a Greek business. Greeks pwned the diner business in the US in the '40 to '80s. If you check a series like \\\"Diners, Drive-Ins and Dives\\\", a disproportionate percentage of iconic food joints are still in Greek hands, including the majority of NY hot dog stands. I have travelled extensively in the US (only missed Vermont), and I chanced upon several, such as:
Lou Mitchels, the Chicago diner at the start point of Route 66. Nick's, in Albq., NM at the crossing of Route 66 (old route) and Route 66 (later bypass) (!), Leopold's, considered the best ice cream in Savannah, GA (and featured in top-10 US lists) Ariston, on Route 66, IL, suggested by every guide, Mike's Chilly Parlor, in Seattle, etc. nom nom nom nom...\", \"I tried to get a friend to use XMPP/Jabber for free (private, secure) text messaging but it failed because of this. Improved my impression that iOS is not capable of much while being pretty good at what it can.\", \"Three. One I walk dogs with daily.\", NaN, \"Philosophicalness: -5\\\\nCraziness: 982374982374082348912823
You guys need to get off the internet and into the real world a bit more.\", \">How does one use a data projector from an Apple laptop these days?
I carry Thunderbolt-to-VGA, DVI, and HDMI adapters with my laptop at all times. It's kind of a pain, to be honest.\", NaN, \"You need to specify a unique index for the attribute - you specified it as \\\"tweet\\\", but not how to scrape it. The error messages are not informative at this stage; it might be something else too.
I tried to fix your e.g. but couldn't get it to work (I tried //span@data-time (xpath) - what is the unique index of a tweet?)\", \"I don't agree. First, the people complaining about downvotes often really did write a comment worth being downvoted (I didn't look at your history). Second, HN is still very valuable if the top comments are all good - it's much less necessary that all good comments are on the top. And despite what people say, the key source of groupthink on HN is not the voting system (rather, the homogeneity of the user base.)\", \"I realise this is a dangerous subject, but I am genuinly curious: given the business you run and the work you do for the Freebsd team, why would you object to using c++, but not c?
I could understand why you would object to both, but why only the lower level language.\", \"I've been using this wonderful piece of software for a couple of weeks now. It's extremely powerful when you need to implement multiple interfaces (including non-HTTP-based) to the same data-source.
The performance (only done preliminary testing) looks very promising as well.
A huge amount of kudos to the author!\", \"I suppose that depends on how one defines \\\"engineering\\\". I consider engineering to be a way of formalising methodology to get consistent, repeatable, and verifiable results. My opinion on this topic is based both on this view of engineering as well as experience having worked at different times as an electrical engineer and software developer. I would say yes, mathematics is indispensable for good software engineering, although it certainly isn't the only requisite skill to meet the above definition (nor always the most important).\", \"Don't feed the trolls! If a comment is bad enough for me to want to downvote it I certainly don't want to engage the author in conversation. In fact, by downvoting I hope to push the comment further down so there to let the better comments float up and to make it less likely it will start a stupid pointless argument thread, replying would do the oposite usually.
Also, I think that, in general, quoting in comments tends to lead to lower quality comments. It's a lot easier to do a point by point nitpick than the write a proper response to the ideas contained in the parent post.\", \"I like to read judges decisions occasionally and I've always been impressed - I haven't always agreed, but they are always well written and well reasoned.
Maybe it's a bit of selection bias in my choice of decisions to read (typically the cases that are on the news), but I suspect most judges are extremely smart and very good at what they do.
If you (plural you) don't read them, you should - they are not written for lawyers (aside from a tiny bit of jargon that is easy to lookup - usually Latin words). Typically before deciding any law the Judge will include an introduction with an explanation of how the law is structured, and it's clear that that's not written for lawyers (who would be expected to know this already), but for the general public.\", \"Thanks for the feedback. Will fix it in a future version.
Service is just an extension of this library:
https://github.com/sathish316/scrapify
The intent of service is to make mobile apps without a backend/db like Parse for read only APIs\"], \"col10\": [1338721180, 1338721024, 1338720841, 1338720824, 1338720682, 1338720533, 1338720520, 1338720499, 1338720475, 1338720467, 1338720333, 1338720310, 1338720306, 1338720303, 1338720231, 1338720158, 1338720120, 1338719999, 1338719980, 1338719970, 1338719867, 1338719747, 1338719618, 1338719618, 1338719616, 1338719512, 1338719137, 1338719118, 1338719097, 1338719066, 1338719023, 1338718961, 1338718949, 1338718940, 1338718893, 1338718868, 1338718538, 1338718474, 1338718367, 1338718364, 1338718250, 1338718242, 1338718215, 1338718064, 1338717986, 1338717819, 1338717787, 1338717764, 1338717680, 1338717601]}, \"column_text\": [1338721180, 1338721024, 1338720841, 1338720824, 1338720682, 1338720533, 1338720520, 1338720499, 1338720475, 1338720467, 1338720333, 1338720310, 1338720306, 1338720303, 1338720231, 1338720158, 1338720120, 1338719999, 1338719980, 1338719970, 1338719867, 1338719747, 1338719618, 1338719618, 1338719616, 1338719512, 1338719137, 1338719118, 1338719097, 1338719066, 1338719023, 1338718961, 1338718949, 1338718940, 1338718893, 1338718868, 1338718538, 1338718474, 1338718367, 1338718364, 1338718250, 1338718242, 1338718215, 1338718064, 1338717986, 1338717819, 1338717787, 1338717764, 1338717680, 1338717601]}"
"{\"table_id\": \"GitTables_1524_dbpedia\", \"target_column\": \"1\", \"annotation_id\": \"http://dbpedia.org/ontology/type\", \"annotation_label\": \"type\", \"id\": \"1945\", \"table_text\": {\"col0\": [\"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\", \"s4pi.Interfaces\"], \"col1\": [\"AApiVersionedFields\", \"AApiVersionedFields\", \"AApiVersionedFields\", \"AApiVersionedFields\", \"AApiVersionedFields\", \"AApiVersionedFields\", \"AApiVersionedFields\", \"AApiVersionedFields\", \"AApiVersionedFields\", \"AApiVersionedFields\", \"AApiVersionedFields\", \"AApiVersionedFields\", \"AApiVersionedFields\", \"AApiVersionedFields\", \"AApiVersionedFields\", \"PriorityComparer\", \"PriorityComparer\", \"Comparer