id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
8,055,999,642,943,060,000 | O'Reilly logo
Stay ahead with the world's most comprehensive technology and business learning platform.
With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.
Start Free Trial
No credit card required
Raspberry Pi Android Projects
Book Description
Create exciting projects by connecting the Raspberry Pi to your Android phone
About This Book
• Manage most of the fundamental functions of Raspberry Pi from your Android phone
• Use the projects created in this book to develop even more exciting projects in the future
• A project-based learning experience to help you discover amazing ways to combine the power of Android and Raspberry Pi
Who This Book Is For
The target audience for this book includes Raspberry Pi enthusiasts, hobbyists, and anyone who wants to create engaging projects with Android OS. Some knowledge of Android programming would be helpful.
What You Will Learn
• Install the tools required on your Pi and Android to manage and administer the Pi from Android
• Share your files between different Android devices using the Pi as a server
• Set up the Pi to live-stream the camera in surveillance mode and customize Android to receive this content
• Turn your Pi into a media center and control it from your Android
• See your Android display on a large screen using Raspberry Pi
• Connect your car's dashboard to your Android device using Raspberry Pi
In Detail
Raspberry Pi is the credit card-sized, general purpose computer which has revolutionized portable technology. Android is an operating system that widely used in mobile phones today both on the high and low ends of the mobile phone market. However, there is little information about how to connect the two in spite of how popular both of them are.
Raspberry Pi Android Projects starts with simple projects that help you access the command prompt and the desktop environment of Raspberry Pi from the comfort of your Android phone or tablet. Then, you will be introduced to more complex projects that combine the strengths of the Pi and Android in amazing ways. These projects will teach you how to manage services on the Pi from Android, share files between Android devices using the Pi as a server, administer and view the Pi’s camera from Android in surveillance mode, and connect your car to the Pi and make data more accessible using Android.
The introductory projects covered will be useful each time you need to access or administer your Pi for other purposes, and the more advanced projects will continue to be valuable even after you become an expert on Pi.
By the end of this book, you will be able to create engaging and useful projects that will help you combine the powers of both Android and Raspberry Pi.
Style and approach
A quick and easy-to-follow guide that will show how you can add up the power of Pi and Android by combining them.
Downloading the example code for this book. You can download the example code files for all Packt books you have purchased from your account at http://www.PacktPub.com. If you purchased this book elsewhere, you can visit http://www.PacktPub.com/support and register to have the code file.
Table of Contents
1. Raspberry Pi Android Projects
1. Table of Contents
2. Raspberry Pi Android Projects
3. Credits
4. About the Author
5. About the Reviewers
6. www.PacktPub.com
1. Support files, eBooks, discount offers, and more
1. Why subscribe?
2. Free access for Packt account holders
7. Preface
1. What this book covers
2. What you need for this book
3. Who this book is for
4. Conventions
5. Reader feedback
6. Customer support
1. Downloading the example code
2. Downloading the color images of this book
3. Errata
4. Piracy
5. Questions
8. 1. Make a Remote Desktop Connection to Your Pi from Anywhere
1. Prerequisites
2. Installing Linux on your Pi
1. Installing using NOOBS
2. Installing using a Raspbian image
3. Extracting the OS image to an SD card
3. Making necessary changes in settings
4. Installing necessary components in the Pi and Android
5. Connecting the Pi and Android
1. What if I want to use Wi-Fi on the Pi?
2. Connecting from anywhere
6. Problems with dynamic LAN IP addresses and external IP addresses
7. Summary
9. 2. Server Management with Pi
1. Remote console to the Pi from Android
2. Exchanging files between the Pi and Android
3. A simple database and web server implementation
1. Connecting the sensor
2. Installing the database
3. Installing the web server
4. Simple management of servers
5. Summary
10. 3. Live Streaming of a Surveillance Camera from the Pi
1. Hardware and software configurations
2. Streaming video to an Android device
1. Manual VLC configurations
3. The surveillance mode
1. Accessing surveillance images on the Web
4. Summary
11. 4. Turn Your Pi into a Media Center
1. Installing and setting up a media center on Pi
1. Starting Kodi on boot
2. Connecting to the media center via remote control from Android
3. Getting more from your media center
1. Watching videos using Kodi on an Android device
2. Streaming the Android display to Kodi
4. Installing the media center using NOOBS
5. Summary
12. 5. Missed Calls with Pi
1. Installing the necessary components
2. Adding a sensor service to Bluetooth Low Energy
3. Connecting from an Android app
4. Sending the reboot command from your Android phone to the Pi
5. Sending more commands from your Android phone to the Pi
1. Lighting the LEDs
2. Playing sounds on your Pi
3. Combining the commands and being informed on incoming calls
6. Summary
13. 6. The Vehicle Pi
1. Finding out the car location
2. Collecting the car data
1. Getting the car data to the Pi
3. Using your Android device as an access point
1. An alternative to rooting
2. Rooting Samsung Galaxy S2
3. Enabling tethering on being connected to a power source
1. Automatic restart on power connect
2. Auto tethering
4. Sending data to the cloud
5. Putting it all together
1. Sending measurements
2. Retrieving measurements
6. Summary
14. Index | {
"url": "https://www.safaribooksonline.com/library/view/raspberry-pi-android/9781785887024/",
"source_domain": "www.safaribooksonline.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "44847",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F6HSMNOWA3DRTXV2N4KBKWF2B76YHZIT",
"WARC-Concurrent-To": "<urn:uuid:b2dbad12-6b2c-4e8b-8a7d-5fcb938961ec>",
"WARC-Date": "2018-06-22T02:30:23Z",
"WARC-IP-Address": "151.101.201.132",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4TVAW7KHFQL57HGJSJTGBHAMNZ24YW6T",
"WARC-Record-ID": "<urn:uuid:caade26b-34a9-42d2-896e-8e3b55597d04>",
"WARC-Target-URI": "https://www.safaribooksonline.com/library/view/raspberry-pi-android/9781785887024/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0a7c1a31-f95c-4725-8715-59bb90fd43a3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-232-173-31.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
14,
15,
105,
106,
251,
252,
269,
270,
294,
295,
325,
326,
343,
344,
422,
423,
439,
440,
525,
620,
743,
744,
765,
766,
968,
969,
989,
990,
1089,
1169,
1280,
1350,
1416,
1491,
1492,
1502,
1503,
1850,
1851,
2449,
2450,
2669,
2670,
2823,
2824,
2843,
2844,
2958,
2959,
3248,
3249,
3267,
3268,
3303,
3328,
3365,
3380,
3404,
3431,
3455,
3513,
3539,
3588,
3603,
3634,
3671,
3701,
3722,
3747,
3773,
3813,
3866,
3884,
3902,
3923,
3991,
4014,
4051,
4085,
4130,
4179,
4225,
4288,
4327,
4377,
4413,
4487,
4504,
4540,
4587,
4640,
4697,
4730,
4765,
4802,
4840,
4857,
4920,
4966,
5012,
5049,
5080,
5132,
5149,
5193,
5249,
5282,
5354,
5399,
5458,
5507,
5556,
5573,
5605,
5650,
5707,
5747,
5817,
5882,
5911,
5948,
6019,
6036,
6062,
6100,
6133,
6175,
6229,
6266,
6303,
6370,
6418,
6446,
6481,
6514,
6546,
6581,
6598
],
"line_end_idx": [
14,
15,
105,
106,
251,
252,
269,
270,
294,
295,
325,
326,
343,
344,
422,
423,
439,
440,
525,
620,
743,
744,
765,
766,
968,
969,
989,
990,
1089,
1169,
1280,
1350,
1416,
1491,
1492,
1502,
1503,
1850,
1851,
2449,
2450,
2669,
2670,
2823,
2824,
2843,
2844,
2958,
2959,
3248,
3249,
3267,
3268,
3303,
3328,
3365,
3380,
3404,
3431,
3455,
3513,
3539,
3588,
3603,
3634,
3671,
3701,
3722,
3747,
3773,
3813,
3866,
3884,
3902,
3923,
3991,
4014,
4051,
4085,
4130,
4179,
4225,
4288,
4327,
4377,
4413,
4487,
4504,
4540,
4587,
4640,
4697,
4730,
4765,
4802,
4840,
4857,
4920,
4966,
5012,
5049,
5080,
5132,
5149,
5193,
5249,
5282,
5354,
5399,
5458,
5507,
5556,
5573,
5605,
5650,
5707,
5747,
5817,
5882,
5911,
5948,
6019,
6036,
6062,
6100,
6133,
6175,
6229,
6266,
6303,
6370,
6418,
6446,
6481,
6514,
6546,
6581,
6598,
6611
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6611,
"ccnet_original_nlines": 138,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3183707296848297,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01246882975101471,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2086450457572937,
"rps_doc_frac_unique_words": 0.3423597812652588,
"rps_doc_mean_word_length": 4.675048351287842,
"rps_doc_num_sentences": 118,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.091360569000244,
"rps_doc_word_count": 1034,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04220107942819595,
"rps_doc_frac_chars_dupe_6grams": 0.03558129817247391,
"rps_doc_frac_chars_dupe_7grams": 0.03558129817247391,
"rps_doc_frac_chars_dupe_8grams": 0.013653290458023548,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01654944010078907,
"rps_doc_frac_chars_top_3gram": 0.014894500374794006,
"rps_doc_frac_chars_top_4gram": 0.021514270454645157,
"rps_doc_books_importance": -405.2718505859375,
"rps_doc_books_importance_length_correction": -405.2718505859375,
"rps_doc_openwebtext_importance": -282.4361267089844,
"rps_doc_openwebtext_importance_length_correction": -282.4361267089844,
"rps_doc_wikipedia_importance": -193.91224670410156,
"rps_doc_wikipedia_importance_length_correction": -193.91224670410156
},
"fasttext": {
"dclm": 0.5001761317253113,
"english": 0.8355141878128052,
"fineweb_edu_approx": 2.179978847503662,
"eai_general_math": 0.013166430406272411,
"eai_open_web_math": 0.05937749147415161,
"eai_web_code": 0.0017125599551945925
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-4,759,492,377,130,306,000 | CocoaDev
Edit AllPages
Hello,
I’m working on an app that deals heavily with color, and I would prefer to use the NSColor device color space. But I don’t want that grey triangle to show up in the corner of all of my color wells and dragged colors.
So short of using the calibrated color space which I know gets rid of the triangle, is there any way to prevent the triangle from showing up when using the device color space?
Thanks!
Well… there’s no public method to do that. But it certainly draws somewhere in the drawing hierarchy of NSColorWell, so I would suggest that you try overriding methods one at a time (- drawRect:, - drawWellInside:, and - _drawBorderInRect: would be the three) to do nothing until the triangle no longer appears. The last method you overrode would be the one that draws the triangle, so once you’ve found the culprit, you can reimplement whatever that method is responsible for yourself. I have some code that draws an appropriate swatch complete with white/black triangle on transparent colors if you need it. On the other hand, it might be best to just leave the whole thing alone: Apple put that triangle there for a reason, and it’s not generally good mojo to change the appearance of standard controls without good reason. – AndyMatuschak
Hey Andy,
Thanks for the response. After my first message I did figure out that overriding drawWellInside: for NSColorWell did the trick. However, this still left the triangle on colors as they are being dragged (any idea what method controls the drawing for a dragged color from [NSColorPanel dragColor:withEvent:fromView]?).
But I also had the same thought you did: Apple probably put it there for a reason. All things equal I would rather use the calibrated color space.
The problem is when I draw an object on the screen as, say, RGB: 255,0,0 in the calibrated space, and then sample the color of the object later with NSReadPixel, the color I get back is not 255,0,0 because the calibrated space makes a number of transformations on the original color causing it to change.
The device space works as intended with no transformations and keeps my raw RGB values, but the only drawback is the big ugly triangles all over my color wells and dragged colors.
So that’s the reason I’m trying to just remove the device color triangles and work in the device space. Would you (or anyone) know of any work-arounds for my issues with the calibrated color space? Would it be a bad idea to just remove the triangles and work in the device color space? I’d really appreciate any thoughts or advice.
Thanks so much!
Being a developer on a graphics program myself, I can say with pretty good confidence that you want to use calibrated colors in just about all cases; otherwise, your users end up with colors that don’t look like what they really picked. When you read with NSReadPixel, you get a device color. All you have to do to get it back to the original 255, 0, 0 is do [NSReadPixel(point) colorUsingColorSpaceName:NSCalibratedRGBColorSpace]. But that’s slow… so I’d suggest that you not use NSReadPixel in the first place. Try just using an NSBitmapImageRep (or unsigned char*) for your data model instead of an NSImage. That’ll prevent conversion into an NSCachedImageRep and will allow you to directly read and write data on the image. Keep in mind that if you do that, however, you’ll have to worry about premultiplying your alpha (and undoing that on export). In any case, if you decide you do want to use the device colors but don’t want, you might try overriding - dragImage:at:offset:event:pasteboard:source:slideBack: to call super with an image of your own. Presuming that NSColorWell uses that method. – AndyMatuschak
Hi Andy,
Just wanted to say thanks a ton for all of your suggestions so far. As I said, I’d love to use the calibrated space, but for some reason I’m having a problem with what you described above.
I draw a rectangle to my view using [NSBezierPath fillRect:rect] after setting my color using [[NSColor colorWithCalibratedRed:1.0 green:0.0 blue:0.0 alpha:1.0] set] (sets color to RGB 255,0,0). I then use [NSReadPixel(point) colorUsingColorSpaceName:NSCalibratedRGBColorSpace] exactly as you mentioned above to grab the color I just painted to my view. Except that the color that I get back from this operation is RGB: 233,23,5 - not 255,0,0 as I originally painted to my view.
Now I know a number of conversions and transformations are taking place when converting between calibrated and device and back again, but is there any way to get my original 255,0,0 back from the screen in the calibrated color space? Have you had any luck with this? Because no matter what color I paint to the screen in calibrated space, I always get a different color back from [NSReadPixel(point) colorUsingColorSpaceName:NSCalibratedRGBColorSpace].
Thanks again for all of your insight. I really, really appreciate it!
squint That’s interesting. The conversions between calibrated and device are complicated, but except for rounding errors that crop up every once in a while, they’re pretty much reversible. I have noticed that if you lockFocus on an NSImage, it becomes cached, right? Which means it’s probably on the video card’s memory banks… which I suppose implies device. This is sorta why we recently stopped using NSImages to store data for Pixen. Try using an NSBitmapImageRep and then filling rects using the bitmapData pointer; that might be more reliable. – AndyMatuschak
Hi Andy,
I’ll definitely give the NSBitmapImageRep a try…but are you sure that the conversions are reversible? The only reason I ask is because if you:
This leads me to believe that the conversions might not be reversible since Apple’s own color picker can’t seem to convert back and forth between them correctly…Do you get similar results? | {
"url": "http://cocoadev.github.io/NSColorWellDeviceTriangle/",
"source_domain": "cocoadev.github.io",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "7777",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GBVLDM7KTKQMYLGURQBX56ZGRKZSJKYS",
"WARC-Concurrent-To": "<urn:uuid:5166e600-1f5a-4af0-8ba4-135531b62626>",
"WARC-Date": "2019-01-18T12:38:00Z",
"WARC-IP-Address": "185.199.109.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CFRFGIA62CHHSZKEGAYGR6QIY2A26ST7",
"WARC-Record-ID": "<urn:uuid:ffb5f682-f6c5-4847-aea3-8a18d8760687>",
"WARC-Target-URI": "http://cocoadev.github.io/NSColorWellDeviceTriangle/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3a44813c-499b-4ff0-a954-aae5d362b388>"
},
"warc_info": "isPartOf: CC-MAIN-2019-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-182-67-179.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
9,
10,
24,
25,
32,
33,
250,
251,
427,
428,
436,
437,
438,
1281,
1282,
1283,
1293,
1294,
1611,
1612,
1759,
1760,
2065,
2066,
2246,
2247,
2579,
2580,
2596,
2597,
2598,
3716,
3717,
3718,
3727,
3728,
3917,
3918,
4397,
4398,
4851,
4852,
4922,
4923,
4924,
5489,
5490,
5491,
5500,
5501,
5644,
5645
],
"line_end_idx": [
9,
10,
24,
25,
32,
33,
250,
251,
427,
428,
436,
437,
438,
1281,
1282,
1283,
1293,
1294,
1611,
1612,
1759,
1760,
2065,
2066,
2246,
2247,
2579,
2580,
2596,
2597,
2598,
3716,
3717,
3718,
3727,
3728,
3917,
3918,
4397,
4398,
4851,
4852,
4922,
4923,
4924,
5489,
5490,
5491,
5500,
5501,
5644,
5645,
5833
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5833,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4497528672218323,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028830310329794884,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17957165837287903,
"rps_doc_frac_unique_words": 0.3716356158256531,
"rps_doc_mean_word_length": 4.827122211456299,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0.004118619952350855,
"rps_doc_unigram_entropy": 5.241497993469238,
"rps_doc_word_count": 966,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.030881410464644432,
"rps_doc_frac_chars_dupe_6grams": 0.02444778010249138,
"rps_doc_frac_chars_dupe_7grams": 0.012867249548435211,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.015011790208518505,
"rps_doc_frac_chars_top_3gram": 0.015440699644386768,
"rps_doc_frac_chars_top_4gram": 0.019729789346456528,
"rps_doc_books_importance": -458.1314697265625,
"rps_doc_books_importance_length_correction": -458.1314697265625,
"rps_doc_openwebtext_importance": -261.7958984375,
"rps_doc_openwebtext_importance_length_correction": -261.7958984375,
"rps_doc_wikipedia_importance": -161.12135314941406,
"rps_doc_wikipedia_importance_length_correction": -161.12135314941406
},
"fasttext": {
"dclm": 0.08656156063079834,
"english": 0.9132658839225769,
"fineweb_edu_approx": 1.3464206457138062,
"eai_general_math": 0.8384435772895813,
"eai_open_web_math": 0.28860175609588623,
"eai_web_code": 0.5220733880996704
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-6,749,814,690,114,309,000 | Skip to main content
QVD files
A QVD (QlikView Data) file is a file containing a table of data exported from QlikView. QVD is a native QlikView format and can only be written to and read by QlikView. The file format is optimized for speed when reading data from a QlikView script but it is still very compact. Reading data from a QVD file is typically 10-100 times faster than reading from other data sources.
QVD files can be read in two modes: standard (fast) and optimized (faster). The selected mode is determined automatically by the QlikView script engine. Optimized mode can be utilized only when all loaded fields are read without any transformations (formulas acting upon the fields), though the renaming of fields is allowed. A WHERE clause causing QlikView to unpack the records will also disable the optimized load. An optimized .qvd is extracted and handled according to standard Extract-Transform-Load (ETL ) when a field transformation is performed, this results in a degradation of performance. The specified format will not be maintained and the underlying raw number format will be used instead and recognized. Transformations of the field in a .qvd is allowed, the former "Optimized" .qvd then becomes a standard non-optimized .qvd.
A QVD file holds exactly one data table and consists of three parts:
1. A well formed XML header (in UTF-8 char set) describing the fields in the table, the layout of the subsequent information and some other meta-data.
2. Symbol tables in a byte stuffed format.
3. Actual table data in a bit-stuffed format.
Purpose of QVD Files
QVD files can be used for many purposes. At least four major uses can be easily identified. More than one may apply in any given situation:
Increasing Load Speed
By buffering non-changing or slowly changing blocks of input data in QVD files, script execution becomes considerably faster for large data sets.
Decreasing Load on Database Servers
The amount of data fetched from external data sources can also be greatly reduced. This reduces work load on external databases and network traffic. Furthermore, when several QlikView scripts share the same data it is only necessary to load it once from the source database into a QVD file. The other applications can make use of the same data via this QVD file.
Consolidating Data from Multiple QlikView Applications
With the binary script statement it is possible to load data from only one single QlikView application into another one, but with QVD files a QlikView script can combine data from any number of QlikView applications. This opens up possibilities e.g. for applications consolidating similar data from different business units etc.
Incremental Load
In many common cases the QVD functionality can be used for facilitating incremental load, i.e. exclusively loading new records from a growing database.
Using QVD files for incremental load
Create QVD Files
A QVD file can be created by one of three different methods:
1. Explicit creation and naming using the store command in the QlikView script. Simply state in the script that a previously read table or part thereof is to be exported to an explicitly named file at a location of your choice.
2. Automatic creation and maintenance from script. By preceding a load or select statement with the buffer prefix, QlikView will automatically create a QVD file which under certain conditions can be used instead of the original data source when reloading data.
3. Explicit, manual creation and naming from layout or via the Internal Macro Interpreter. Data can be exported from the QlikView layout via GUI commands or Automation macros. In the GUI you will find QVD as one of the possible export formats under the Export... command, found on the object menu of most sheet objects.
Internal Macro Interpreter
There is no difference between the resulting QVD files, e.g. with regard to reading speed etc.
Reading Data from QVD Files
A QVD file can be read into or accessed by QlikView by the following methods:
1. Loading a QVD file as an explicit data source. QVD files can be referenced by a load statement in the QlikView script just like any other type of text files (csv, fix, dif, biff etc). The File Wizard: Type handles QVD files by the same principles.
File Wizard: Type
2. Examples:
load * from xyz.qvd (qvd);
load Name, RegNo from xyz.qvd (qvd);
load Name as a, RegNo as b from xyz.qvd (qvd);
3. Automatic loading of buffered QVD files. When using the buffer prefix on load or select statements, no explicit statements for reading are necessary. QlikView will determine the extent to which it will use data from the QVD file as opposed to acquiring data via the original load or select statement.
4. Accessing QVD files via the script. A number of script functions (all beginning with qvd) can be used for retrieving various information on the data found in the XML header of a QVD file.
File functions
Importing QVD with asterisks are not supported.
QVD encryption
You can encrypt sensitive data in QVD files with customer supplied key pairs which allows you to control who gets access to your data.
The encryption is configured in the settings.ini file where encryption is enabled and the certificate thumbprint is added. QVD encryption is not enabled by default.
Older versions of Qlik Sense and QlikView returns an error when reading encrypted QVDs files.
QVD Encryption. | {
"url": "https://help.qlik.com/en-US/qlikview/May2021/Subsystems/Client/Content/QV_QlikView/QVD_files.htm",
"source_domain": "help.qlik.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "47307",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BGUQVCTEPH6UAIE6EXF3MM6Z3RZ4V44T",
"WARC-Concurrent-To": "<urn:uuid:e9918360-3df1-4696-a31e-14552a56f4c0>",
"WARC-Date": "2021-09-19T21:03:33Z",
"WARC-IP-Address": "13.32.150.78",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HMLN6PASWUOPQO75YZVW3SHSAKFD344E",
"WARC-Record-ID": "<urn:uuid:074cf3f3-d970-4145-af86-7651c1fa0337>",
"WARC-Target-URI": "https://help.qlik.com/en-US/qlikview/May2021/Subsystems/Client/Content/QV_QlikView/QVD_files.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b96c4a64-55e9-440a-b182-8df8c999c727>"
},
"warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-22\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
21,
22,
32,
33,
412,
413,
1255,
1256,
1325,
1326,
1479,
1524,
1572,
1573,
1594,
1595,
1735,
1736,
1758,
1759,
1905,
1906,
1942,
1943,
2306,
2307,
2362,
2363,
2692,
2693,
2710,
2711,
2863,
2864,
2901,
2902,
2919,
2920,
2981,
2982,
3212,
3475,
3797,
3798,
3829,
3830,
3925,
3926,
3954,
3955,
4033,
4034,
4287,
4288,
4310,
4311,
4328,
4329,
4360,
4401,
4452,
4758,
4951,
4952,
4971,
4972,
5020,
5021,
5036,
5037,
5172,
5173,
5338,
5339,
5433,
5434
],
"line_end_idx": [
21,
22,
32,
33,
412,
413,
1255,
1256,
1325,
1326,
1479,
1524,
1572,
1573,
1594,
1595,
1735,
1736,
1758,
1759,
1905,
1906,
1942,
1943,
2306,
2307,
2362,
2363,
2692,
2693,
2710,
2711,
2863,
2864,
2901,
2902,
2919,
2920,
2981,
2982,
3212,
3475,
3797,
3798,
3829,
3830,
3925,
3926,
3954,
3955,
4033,
4034,
4287,
4288,
4310,
4311,
4328,
4329,
4360,
4401,
4452,
4758,
4951,
4952,
4971,
4972,
5020,
5021,
5036,
5037,
5172,
5173,
5338,
5339,
5433,
5434,
5449
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5449,
"ccnet_original_nlines": 76,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36994218826293945,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.045279379934072495,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13487476110458374,
"rps_doc_frac_unique_words": 0.3705357015132904,
"rps_doc_mean_word_length": 4.840401649475098,
"rps_doc_num_sentences": 71,
"rps_doc_symbol_to_word_ratio": 0.0009633899899199605,
"rps_doc_unigram_entropy": 5.079524517059326,
"rps_doc_word_count": 896,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.019368229433894157,
"rps_doc_frac_chars_dupe_6grams": 0.009684110060334206,
"rps_doc_frac_chars_dupe_7grams": 0.009684110060334206,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.027668900787830353,
"rps_doc_frac_chars_top_3gram": 0.01475674007087946,
"rps_doc_frac_chars_top_4gram": 0.00830067042261362,
"rps_doc_books_importance": -398.3648376464844,
"rps_doc_books_importance_length_correction": -398.3648376464844,
"rps_doc_openwebtext_importance": -200.82693481445312,
"rps_doc_openwebtext_importance_length_correction": -200.82693481445312,
"rps_doc_wikipedia_importance": -129.07237243652344,
"rps_doc_wikipedia_importance_length_correction": -129.07237243652344
},
"fasttext": {
"dclm": 0.1207726001739502,
"english": 0.857022762298584,
"fineweb_edu_approx": 2.879002332687378,
"eai_general_math": 0.7459118366241455,
"eai_open_web_math": 0.18774926662445068,
"eai_web_code": 0.6434284448623657
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-6,999,421,350,338,047,000 | Over the past couple of years or so I’ve been getting into the Julia programming language; it’s been great to watch the language mature over time. Many people proclaim the virtues of its speed (it’s very fast for a dynamic language) but really I like its elegance - it’s a very well designed language that makes full use of multiple dispatch. (Multiple dispatch is something that I doubt most coders know much about but once you are used to it, it’s indispensable!)
My first foray into the world of Julia package development is BarycentricInterpolation.jl, a small package to do polynomial interpolation using a Barycentric representation. This approach is espoused in Berrut and Trefethen, SIAM Review 2004 as a way to do polynomial interpolation with O(n) operations, rather than O(n2) operations as is more typical for interpolation with Lagrange polynomials.
While this package isn’t really a general purpose interpolation code (see Interpolations.jl for that), it is good for building numerical algorithms such as collocation.
One example of this is a simple(ish) simulation of a dynamic cantilever beam. The Euler-Bernoulli equation is the most straightforward, non-trivial model we can use -
$$ \frac{EI}{\rho AL^4}\frac{\partial^4u}{\partial x^4} + \frac{\partial^2 u}{\partial t^2} + \xi\frac{\partial u}{\partial t} = 0 $$
where $E$ is Young’s modulus, $I$ is the second moment of area, $\rho A$ is the mass per unit length, $L$ is the length, and $\xi$ is the (external) damping coefficient.
Since it is a fourth-order partial differential equation in space we need four boundary conditions. For a cantilever beam we have (primes denote derivatives with respect to $x$)
$u(0, t) = 0$ (zero displacement at wall)
$u'(0,t) = 0$ (zero slope at wall)
$u''(1,t) = 0$ (zero torque at free end)
$u'''(1,t) = 0$ (zero shear at free end)
To solve the Euler-Bernoulli equation we discretise the model in space using Chebyshev polynomials (for an introduction to Chebyshev approximations to differential equations see the excellent, and relatively short, book Spectral Methods in Matlab by Nick Trefethen). This is where BarycentricInterpolation.jl comes in.
In a nutshell, we’re going to use an $N$ degree polynomial to approximate the solution in the $x$ direction by constraining the polynomial to satisfy the four boundary conditions at $x=0$ and $x=1$ and then evaluating the fourth derivative for the interior of the Euler-Bernoulli equation.
I’m going to arbitrarily choose to evaluate the Euler-Bernoulli equation at the Chebyshev nodes of the $N-2$ degree Chebyshev polynomial, excluding the end points, so $N-3$ points in total. Hence these points plus the four boundary conditions gives $N+1$ equations to match the $N+1$ unknowns of the $N$ degree Chebyshev polynomial.
The code to do this is as follows. The end result is a fourth-order derivative matrix defined on the collocation points.
using BarycentricInterpolation
N = 10 # degree of the polynomial
n = N-2
# Construct the polynomial
P = Chebyshev2{N}()
# Generate the differentiation matrix y' ≈ Dy
D = differentiation_matrix(P)
# Collocation points (nodes of the N-2 degree second-kind Chebyshev polynomial)
x_coll = [-cospi(j/n) for j = 1:n-1]
# Interpolation matrix from nodes(P) to x_coll
In = interpolation_matrix(P, x_coll)
# Construct the mapping from the values at the collocation points to the
# values at the nodes of the Chebyshev polynomial, simultaneously
# incorporating the boundary conditions
In⁻¹ = inv([In; # interpolation to collocation points
[1 zeros(1, N)]; # u(0, t) = 0
D[1:1, :]; # u'(0, t) = 0
(D^2)[end:end, :] # u''(1, t) = 0
(D^3)[end:end, :] # u'''(1, t) = 0
])[:, 1:end-4] # remove the boundary condition inputs since they are zero
# Construct the differentiation matrix that incorporates the boundary conditions
D₄ = In*(D^4)*In⁻¹
The basic premise is to construct a fourth-order differentiation matrix on the $N$-degree Chebyshev polynomial whilst incorporating the boundary conditions. This is done by mapping from the collocation points onto the nodes of the Chebyshev polynomial, incorporating the boundary conditions, then applying the differentiation matrix before mapping back to the collocation points.
To integrate the equations of motion, the second-order (in time) differential equation is rewritten as a system of first-order ODEs and thrown into DifferentialEquations.jl.
function beammodel!(dudt, u, p, t)
n = size(p.D₄, 2) # number of collocation points
dudt[1:n] .= u[n+1:2n] # u̇₁ = u₂
dudt[n+1:2n] .= -p.EI/p.ρA*(p.D₄*u[1:n]) .- p.ξ*u[n+1:2n] # u̇₂ = -EI/ρA*u₁'''' - ξ*u₂
end
Before integrating, we need some initial conditions. To avoid putting energy into the higher modes of the beam, I use the mode shape of the first beam mode for the initial conditions.
# A parameter vector for integration; a steel beam (1m × 10mm × 1mm)
p = (D₄ = D₄, EI = 1666.6, ρA = 8.0, ξ = 0.2)
# Jacobian matrix of the differential equation
using LinearAlgebra
A = [zeros(size(p.D₄)) I; -p.EI/p.ρA*p.D₄ -p.ξ*I]
ev = eigen(A)
idx = argmin(abs.(ev.values)) # lowest mode
u0 = real.(ev.vectors[:, idx]) # ignore rotations
# Integrate!
using OrdinaryDiffEq
prob = ODEProblem(beammodel!, u0, (0, 10.0), p)
sol = solve(prob, Rodas5(), dtmax=0.05) # use a stiff solver
And to plot
using Makie
sc = Scene()
wf = wireframe!(sc, x_coll, sol.t, sol[1:N-3, :])
scale!(wf, 1.0, 1.0, 10.0)
l = lines!(sc, [x_coll[end]], sol.t, sol[N-3, :], color=:red, linewidth=3.0)
The result is at the top of this post!
While this is a largely academic example (we could solve this problem analytically) there are lots of extensions that can be made with this approach. | {
"url": "https://cityinthesky.co.uk/posts/2018/barycentricinterpolation.jl/",
"source_domain": "cityinthesky.co.uk",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "30586",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5O7VVDUIJRYRC2ZEO6Y3BKO4B2LAL5D5",
"WARC-Concurrent-To": "<urn:uuid:22390011-d2b7-44d8-b7bf-b1bccbf999b6>",
"WARC-Date": "2021-06-19T18:36:12Z",
"WARC-IP-Address": "185.199.110.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:55AMQ57Q2XDQH6LDA6ZNU7D57ARW7L7L",
"WARC-Record-ID": "<urn:uuid:a9b093fa-3de9-45b4-957b-d3a5897828c8>",
"WARC-Target-URI": "https://cityinthesky.co.uk/posts/2018/barycentricinterpolation.jl/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:44250920-8b4c-4ed1-9157-3c1723fd8186>"
},
"warc_info": "isPartOf: CC-MAIN-2021-25\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-172.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
466,
467,
864,
865,
1034,
1035,
1202,
1203,
1337,
1338,
1508,
1509,
1687,
1688,
1730,
1731,
1766,
1767,
1808,
1809,
1850,
1851,
2170,
2171,
2461,
2462,
2795,
2796,
2917,
2918,
2949,
2950,
2985,
2995,
3022,
3042,
3088,
3118,
3198,
3235,
3282,
3321,
3322,
3395,
3461,
3502,
3582,
3638,
3695,
3753,
3812,
3898,
3899,
3980,
3999,
4000,
4380,
4381,
4555,
4556,
4591,
4645,
4684,
4776,
4780,
4781,
4965,
4966,
5035,
5081,
5082,
5129,
5149,
5199,
5213,
5258,
5309,
5310,
5323,
5344,
5392,
5454,
5455,
5467,
5468,
5480,
5493,
5543,
5570,
5647,
5648,
5687,
5688
],
"line_end_idx": [
466,
467,
864,
865,
1034,
1035,
1202,
1203,
1337,
1338,
1508,
1509,
1687,
1688,
1730,
1731,
1766,
1767,
1808,
1809,
1850,
1851,
2170,
2171,
2461,
2462,
2795,
2796,
2917,
2918,
2949,
2950,
2985,
2995,
3022,
3042,
3088,
3118,
3198,
3235,
3282,
3321,
3322,
3395,
3461,
3502,
3582,
3638,
3695,
3753,
3812,
3898,
3899,
3980,
3999,
4000,
4380,
4381,
4555,
4556,
4591,
4645,
4684,
4776,
4780,
4781,
4965,
4966,
5035,
5081,
5082,
5129,
5149,
5199,
5213,
5258,
5309,
5310,
5323,
5344,
5392,
5454,
5455,
5467,
5468,
5480,
5493,
5543,
5570,
5647,
5648,
5687,
5688,
5837
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5837,
"ccnet_original_nlines": 93,
"rps_doc_curly_bracket": 0.0030837799422442913,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27221038937568665,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.037668801844120026,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3681592047214508,
"rps_doc_frac_unique_words": 0.4624846279621124,
"rps_doc_mean_word_length": 5.21771240234375,
"rps_doc_num_sentences": 61,
"rps_doc_symbol_to_word_ratio": 0.017057569697499275,
"rps_doc_unigram_entropy": 5.317215442657471,
"rps_doc_word_count": 813,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02357378974556923,
"rps_doc_frac_chars_dupe_6grams": 0.015087219886481762,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.011786890216171741,
"rps_doc_frac_chars_top_3gram": 0.02357378974556923,
"rps_doc_frac_chars_top_4gram": 0.02404526062309742,
"rps_doc_books_importance": -677.0336303710938,
"rps_doc_books_importance_length_correction": -677.0336303710938,
"rps_doc_openwebtext_importance": -347.80914306640625,
"rps_doc_openwebtext_importance_length_correction": -347.80914306640625,
"rps_doc_wikipedia_importance": -286.48211669921875,
"rps_doc_wikipedia_importance_length_correction": -286.48211669921875
},
"fasttext": {
"dclm": 0.8404797911643982,
"english": 0.8417367339134216,
"fineweb_edu_approx": 2.8617258071899414,
"eai_general_math": 0.9998502731323242,
"eai_open_web_math": 0.7054856419563293,
"eai_web_code": 0.910521388053894
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "518.6",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Numerical analysis"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
1,439,697,961,881,454,800 | ActionScript.org Flash, Flex and ActionScript Resources - http://www.actionscript.org/resources
Loading random Background and/or Screensaver
http://www.actionscript.org/resources/articles/176/1/Loading-random-Background-andor-Screensaver/Page1.html
Xavier Martin
Addicted to flash for a long time now.
http://dev.webbymx.net
By Xavier Martin
Published on September 9, 2005
Introduction and Php
Download FLA | example
I. INTRODUCTION
Ok, the aim of this tutorial is to provide a simple way to add a background (and/or a screensaver) to your website with text field showing how many bites are loaded. In this tutorial we will start first with the background. Then we will see the screensaver.
II. SETTING UP YOUR WORKSPACE
Assuming that "MainFolder" is the folder where you will put the final swf.
Create in "MainFolder" a new folder named "background". This is the folder where the background image files and one php file will be.
Create in "MainFolder" a new folder named "screensaver". This is the folder where the screensaver image files and one php file will be.
Create in "MainFolder" a new folder named "inc". This is the folder where you will put the const.inc.php file (and all the other include file you can use for your future website).
So you should have something like this:
MainFolder
• background
• inc
• screensaver
III. THE PHP FILES
a. config.inc.php
First, as all developers I suppose, we will create inside the MainFolder a "config.inc.php" file. This file is here to help development. In fact, all our php files will call this one to get the WEBSITE's PATH.
Here is the file:
[php]
<?php
//folder for include file
$C_INC = $C_ROOT."inc/";
//folder for background file
$C_BG = $C_ROOT."background/";
//folder for screensaver file
$C_SS = $C_ROOT."screensaver/";
?>
[/php]
The $C_ROOT var will be sent by php file including the config.inc.php, it refers to the MainFolder folder. We will see this later on the tutorial.
b. const.inc.php
Now create a new "const.inc.php" php file inside the "inc" folder. This file will have all the constants needed (for our tutorial and for your future website).
Here is the file:
[php]
<?php
//all the valid extension for the background
$C_MYEXTENSION = array ( 'jpg', 'jpeg', 'png', 'gif', 'swf' );
//all the valid extensions for the screensaver
$C_MYEXTENSIONSS = array ( 'swf' );
?>
[/php]
In this file we are creating two arrays. The first one is holding all the extension for the background file, the second for the screensaver. I hope it's enough clear. I could put all in one file, but I think it is better this way: one php file for path, another one for constants used.
c. listfile.php
Ok, now we need to make a php file that will check inside a folder all the file, then keep only the file with the extension we want (those which are define in "const.inc.php"). The php file will finally echo the name of the file to the flash movie.
We will save the file in the folder "background" with the name "listfile.php".
[php]
<?php
//give the relative path of the root (MainFolder) of the
//website.
$C_ROOT = "../";
//get the config.inc.php then know all the relative path from the root.
include_once $C_ROOT."config.inc.php";
//include all the constant like our array of extension
include_once $C_INC."const.inc.php";
//opening the current folder
$handle=opendir(".");
//make an empty array that will get our background
//filename of the actual folder
$ourFile = array();
// while next file in the folder exist
while ($file = readdir($handle)) {
// don't check ./ and ../
if ( ($file != ".") && ($file != "..")) {
// split the string in an array, substring
// separate by a '.'
$ext = explode('.', $file);
// how many value in the array
$howmany = count(ext);
// redefine the var ext. Get the extension ie the
// last substring
$ext = strtolower($ext[$howmany]);
// check the extension of the file. If the
// extension is on our array (const.inc.php file)
// then add the filename to our array of
// background
if( in_array ($ext, $C_MYEXTENSION) ) array_push($ourFile, $file);
};
};
// selecting one of the value of the ourFile array, means
// that we are taking one of the background file name
$theFile = $ourFile[array_rand($ourFile)];
//deleting the handler
closedir($handle);
//send it to flash
echo "&thefile=".$theFile."&";
?>
[/php]
Ok, so now we have a php file that echo a filename, like eg:
"Myfirstpic.jpg".
This file is inside the folder "background", so you need to put some background image files inside the "background" folder.
Then test the file by opening your browser like:
[code]localhost/your_Path_to_MainFolder_From_the_Root_of_The_Webserver/background/lisfile.php[/code]
You should have something like:
[code]&thefile=Myfirstpic.jpg& [/code]
For the screensaver it's the same thing.
Just copy this file, and some image files inside the "screensaver" folder.
Ok so all the php side is done :)
Let's go in Flash now !!! (I was impatient too)
The background
IV. THE FLASH FILES
a. What we need
Ok. So we want to make a class that load a random image file.
The name of the image file is sent by the php file.
We want a dynamic textfield displaying how many bytes are load in total bytes.
We will add some extra stuff:
• the background will be able to refresh itself every X seconds.
• the container will hold TWO containers. Then we will load image the first time in the first sub container, the second in the second sub container, the third in the first sub container... In fact we are using modulo 2. Why? Because while loading the movie we want the background to be displayed. If we are not using this way, when loading a new background inside the container, no background will be displayed during the loading time.
So we will use that object/type inside the class:
• LoadVars object for loading php file
• MovieClip for the main container and the sub container
• MovieClipLoader and listener to get the bytes loaded and all the event (start loading, while loading, end loading, displaying movieclip, on error loading)
• Numbers var to hold the delay, start time of the delay, and the ID of the interval calling the function that will check if the delay is passed.
• textField which displaying the info
This is all we can know for now I think.
b. Add new method to MovieClip class
[as]
MovieClip.prototype.scaleToStage= function () {
//get the value that help me rescaling the mc
this._xscale = 100;
this._yscale = 100;
var W = this._width;
var H = this._height;
var RW = Stage.width;
var RH = Stage.height;
//rescaling
this._xscale = (RW/W)*100;
this._yscale = (RH/H)*100;
this._x = 0;
this._y = 0;
}
[/as]
Some brief explanations:
Why did we use the OLD WAY to add new method to the MovieClip?
Because we need to be able to create new empty movie clip at runtime, and if we are using the new way (means defining a new class extended MovieClip) we are not able to associate at runtime the new class to the MovieClip object created (update 2006: this is no more true ,check for MCE).
This function is rescaling the MovieClip to the stage's size and setting _x and _y to 0.
c. The loadBackground class
Ok so let's start declaring our loadBackground class now:
[as]
class froggies.loadBackground {
private var _nDelay:Number;
private var _nSICheck:Number;
private var _nStartTime:Number;
private var _nModulo:Number;
private var _oBackground:Object;
private var _mcBackground:MovieClip;
private var _mcFirstBackground:MovieClip;
private var _mcSecondBackground:MovieClip;
private var _mclBackground:MovieClipLoader;
private var _sFolder:String;
private var _tfDispInfo:TextField;
function loadBackground (mcBackground, tfDispInfo, nDelay, sFolder) {
//getting the properties send by the user
_nDelay = nDelay;
_mcBackground = mcBackground;
_tfDispInfo = tfDispInfo;
_sFolder = sFolder;
_nStartTime = null;
_nSICheck = null;
_nModulo = -1;
_oBackground = new Object();
_mclBackground = new MovieClipLoader();
_mcFirstBackground = _mcBackground.createEmptyMovieClip("mc0", 0);
//if you want to change background every X milliseconds then need another mc to make transition without waiting the loading
if (_nDelay != -1) _mcSecondBackground = _mcBackground.createEmptyMovieClip("mc1", 1);
_oBackground._owner = this;
//defining my object
_oBackground.onLoadStart = function (cible_mc) {
cible_mc._visible = false;
cible_mc.gotoAndStop(1);
this._owner._tfDispInfo.text = "Loading starting";
this._owner._tfDispInfo._visible = true;
}
_oBackground.onLoadProgress = function (cible_mc, loadedBytes, totalBytes) {
cible_mc._visible = false;
cible_mc.gotoAndStop(1);
this._owner._tfDispInfo.text = "Loading "+Math.ceil(loadedBytes/1024)+" / "+Math.ceil(totalBytes/1024)+" kbytes";
}
_oBackground.onLoadComplete = function (cible_mc) {
cible_mc._visible = false;
cible_mc.gotoAndStop(1);
this._owner._tfDispInfo._visible = false;
}
_oBackground.onLoadInit = function (cible_mc) {
//scale the mc to the size of the stage;
this._owner._mclBackground.removeListener(this._owner._oBackground);
cible_mc.swapDepths(1);
cible_mc._parent.scaleToStage();
cible_mc._visible = true;
cible_mc.gotoAndPlay(1);
if(this._owner._nDelay != -1) this._owner.nextBackground(cible_mc);
}
_oBackground.onLoadError = function (cible_mc, errorCode) {
this._owner._mclBackground.removeListener(this._owner._oBackground);
}
Init();
}
private function Init():Void {
newBackground();
}
private function newBackground ():Void {
_tfDispInfo._visible = true;
_tfDispInfo.text = "Loading php file";
var _lvBackground:LoadVars = new LoadVars();
_lvBackground._owner = this;
//who's the next container?
_nModulo++;
var num:Number = _nModulo%2;
//to make url unique
var dMyDate:Date = new Date();
var unique:Number = dMyDate.getTime();
_lvBackground._nextContainer = _mcBackground["mc"+num];
//loading the php file that returning the background
_lvBackground.onLoad = function (ok):Void {
if(ok) {
/*********************************************************
Add the listener to the MoveiClipLoader object and
load the background inside the movieclip background
**********************************************************/
this._owner._mclBackground.unloadClip(this._nextContainer);
this._owner._mclBackground.addListener(this._owner._oBackground);
this._owner._mclBackground.loadClip(this._owner._sFolder+this.thefile, this._nextContainer);
}
}
_lvBackground.load(_sFolder+"listfile.php?"+unique);
}
private function nextBackground ():Void {
_nStartTime = new Date().getTime();
_nSICheck = setinterval(checktime, 48, this);
}
private function checktime (_owner):Void {
var nNow:Number = new Date().getTime();
if (nNow - _owner._nStartTime > _owner._nDelay) {
clearInterval(_owner._nSICheck);
_owner.newBackground();
}
}
}
[/as]
d. How this class is working?
We are creating a new class inside which is inside froggies package (class froggies.loadBackground ).
We are defining all the properties (var/object) used in this class. All are private (protected in fact).
Then is coming the constructor where we are setting up all the properties.
Four properties are setting up by parameters. It's the delay (if equal to -1 means no delay so no reloading), the MovieClip (container) which is holding the two sub containers, the textField which is displaying the bytes loaded, and the folder where the files (image and php) are.
The other are the
• _nStartTime: we will call another background if currentTime - _nStartTime > _nDelay -,
• _nSICheck which is holding the ID of the setinterval which is calling the function that checking if currentTime - _nStartTime > _nDelay
• _nModulo that let us know in which sub container we have to load the new background, _oBackground which is the listener for the MovieClipLoader,
• _mclBackground which is the MovieClipLoader.
Ok then we are adding a new property to the _ oBackground object defining its parent: (_oBackground._owner = this;).
Then we are defining all the methods of this object:
• onLoadStart , we are hiding the sub container, stopping it at frame 1, adding text on textField and showing it
• onLoadProgress , we are hiding the sub container, stopping it at frame 1, and displaying inside the textField the bytes loaded on total bytes
• onLoadcomplete , we are hiding the sub container, stopping it at frame 1, and make the textField invisible.
• onLoadInit , we are removing the link between this listener and the sub container, putting the sub container to front, scaling the sub container to the stage's size, making it visible and playing it, and calling the function that check for the next background
• onLoadError , we are just removing the link between the listener and the MovieClipLoader.
Then we are calling Init() function. Why making a function with just one call to another one? Because when we will do the screensaver class the Init will not be the same, but the constructor will be. That's all. If we are putting the newBackground call inside the constructor we must rewrite ALL the constructor for the screensaver class. We will see that later.
Ok now the functions (methods) of the class. I put comments on the code, so I think it's enough. That's why here I'm telling briefly what the function are doing.
• newBackground is loading the php file, getting the random filename and then loading inside the sub container this file.
• nextBackground is setting up _nStartTime to now and calling with interval checktime.
• checktime is taking the current time and if currentTime - _nStartTime > _nDelay then call the newBackground methods.
The screensaver
V. AND FOR THE SCREENSAVER?
Ok for the screensaver there are some little things to add. But it will be quite easy after the loadBackground class.
a. What we need
Ok. What are our needs for the screensaver?
First we want it to reload every X seconds, but this thing has been already done in the loadBackground class (yehaaaaaaaaa).
When the background will be loaded?
If the user is not moving the mouse for X seconds then the screensaver will load itself.
So we need an event on the MouseMove: each time the user will move the mouse, we will reset the startTime (don't forget the currentTime - _nStartTime > _nDelay). Then if the difference is bigger than the delay we will load the screensaver.
What else?
Every screensaver get a button to get out, or a mouse event. For my case I prefer to put an event on a button. So if the user is clicking the button, then he's coming back to the website. So we need a button and we need to define the onRelease event for this button.
b. the loadScreensaver class
Ok this is the class:
[as]class froggies.loadScreensaver extends froggies.loadBackground {
//inherit from the loadBackground class
private var _mcContinue:MovieClip;
function loadScreensaver (mcBackground, tfDispInfo, nDelay, sFolder, btn) {
//inherit from the loadBackroung constructor
super(mcBackground, tfDispInfo, nDelay, sFolder);
_mcBackground._owner = this;
_mcBackground.onMouseMove = function() {
this._owner.clearDelay();
}
//btn you click to stop the screensaver
_mcContinue = btn;
//hidding the button
_mcContinue._visible = false;
_mcContinue._owner = this;
_mcContinue.onRelease = function () {
this._owner._mcBackground.onMouseMove = function() {
this._owner.clearDelay();
}
this._owner.clearDelay();
}
_oBackground.onLoadComplete = function (cible_mc) {
delete(this._owner._mcBackground.onMouseMove);
this._owner._mcContinue._visible = true;
cible_mc._visible = false;
cible_mc.gotoAndStop(1);
this._owner._tfDispInfo._visible = false;
}
}
private function Init():Void {
nextBackground();
}
public function clearDelay ():Void {
if(_nSICheck != null) {
//clearing the interval
clearInterval(_nSICheck);
_nSICheck = null;
//removing the listener --> stop loading the contents if loading
_mclBackground.removeListener(_oBackground);
_mclBackground.unloadClip(_mcBackground.mc0);
_mclBackground.unloadClip(_mcBackground.mc1);
//hidding the button
_mcContinue._visible = false;
//hidding the textField
_tfDispInfo._visible = false;
//hiding the container
_mcBackground.mc0._visible = false;
_mcBackground.mc1._visible = false;
//calling the nextScreensaver
nextBackground();
}
}
}
[/as]
c. How this class is working?
We are making a new class inherit from the loadBackground class:
class froggies.loadScreensaver extends froggies.loadBackground
So the new class loadScreensaver get all the methods (functions) and properties (var) of the loadBackground class.
For the loadScreensaver class we need a button (a MovieClip object), so just add a new property to the one existing already:
private var _mcContinue:MovieClip;
Now the constructor.
We are adding some extra stuff and changing others.
So first we need to inherit from the loadBackground constructor - super(mcBackground, tfDispInfo, nDelay, sFolder); - then we are defining our extra stuff.
The main container have a MouseMove event on it where we are calling the method clearDelay - this._owner.clearDelay(); - , so before we need to know which is the owner of the container object - _mcBackground._owner = this; -.
NOTE: When you are using instance of class inside other class (like we have done with button eg, this is called composition) you need to specify the owner of the instance to be able to access the methods and properties of the class holding it.
Still in the constructor, we are setting up our button with the parameter sent in the constructor. Then we are hiding this button, and adding a onRelease event, that clearing the delay (so the screensaver will not more be display), and defining the onMouseMove event of the container.
Why redefining it, because we are deleting this event when the screensaver is loaded. (we want to click on a button, not moving the mouse).
When the screensaver is unload, we need to clearDelay each time the user movethe mouse, so we need to redefine the MouseMove event. That's why. (yeah I know it's a bit confusing but I can't find other way to explain it :/ hé don't forget I'm a froggy)
And we are finally redefining the onLoadComplete event of the listener. We are just adding 2 lines compare to the one in the loadBackground class. We are deleting the MouseMove event of the container (yes it's here) - delete(this._owner._mcBackground.onMouseMove); - and we are making the button visible.
Now the methods (functions) of this class:
Init() is not the same. Here we are calling the function nextBackground() because we want the screensaver to load after X seconds and not as soon as the movie start.
clearDelay() is clearing the setinterval calling the function checktime, removing the listener (stop loading the content then) and unloading the sub containers, hiding the continue button, hiding the info textField and hiding the sub containers, then calling nexBackground() which is checking if the screensaver have to be displayed (after X seconds).
VI. HOW TO USE THOSE CLASSES
a. loadBackground
This is VERY SIMPLE. Just create a new fla . Then add 2 layers.
The upper one is the layer called "infoBG" where you must put the dynamic textField, and call it infoBackground .
Then come the layer "BG", where you need to put an empty MovieClip and call it backgroundImage .
The last one is the layer "action", where you are writing this code:
[as]import froggies.loadBackground
//This will load the Background only once
aBackground = new loadBackground(_root.backgroundImage, _root.infoBackground, -1, "./background/");
//This will load the Background every 1 minute
//aBackground = new loadBackground(_root.backgroundImage, _root.infoBackground, 60000, "./background/");
[/as]
b. loadScreensaver
This is VERY SIMPLE. Just create a new fla . Then add 2 layers.
The upper one is the layer called "infoSS" where you must put the dynamic textField, and call it infoScreensaver .
Then come the layer "SS", where you need to put an empty MovieClip and call it screensaverImage .
The last one is the layer "action", where you are writing this code:
[as]import froggies.loadScreensaver
//This will load the Screensaver every 1 minute
aScreensaver = new loadScreensaver(_root. screensaverImage, _root.infoScreensaver, 60000, "./background/");
[/as]
When using both it's the same thing. Don't forget to put screensaver container and text and button in a upper level than your background (see the fla joined).
VII Conclusion
I hope that you get all. If you need help and/or have comments/feedbacks, email me.
I'll be please to answer you. | {
"url": "http://www.actionscript.org/resources/articles/176/1/LoadingrandomBackgroundand2ForScreensaver/Page1.html/print",
"source_domain": "www.actionscript.org",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "45018",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RORVS6CQ77D2R4WM46HKWWEXV5SE76VO",
"WARC-Concurrent-To": "<urn:uuid:fefb283f-657f-47fd-984d-b9b0c62a860b>",
"WARC-Date": "2014-08-20T08:48:55Z",
"WARC-IP-Address": "104.28.3.93",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:XHYGVF6TZAUPAIIUIZZDGMS3UEHSRCIH",
"WARC-Record-ID": "<urn:uuid:be0b628a-0afb-49be-9617-739aac0b611a>",
"WARC-Target-URI": "http://www.actionscript.org/resources/articles/176/1/LoadingrandomBackgroundand2ForScreensaver/Page1.html/print",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1b087702-fa74-4e0a-bcda-dcb70b02c33b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-136-8.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for August 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
96,
141,
249,
263,
264,
303,
304,
327,
328,
330,
347,
378,
380,
381,
402,
425,
426,
442,
443,
701,
702,
703,
733,
808,
809,
943,
1079,
1259,
1260,
1300,
1311,
1326,
1334,
1350,
1351,
1352,
1372,
1390,
1600,
1618,
1619,
1625,
1631,
1632,
1658,
1659,
1684,
1685,
1714,
1715,
1746,
1747,
1777,
1778,
1810,
1811,
1814,
1815,
1822,
1823,
1970,
1971,
1988,
2148,
2166,
2167,
2173,
2179,
2180,
2225,
2226,
2289,
2290,
2337,
2338,
2374,
2375,
2378,
2379,
2386,
2387,
2673,
2674,
2690,
2939,
3018,
3019,
3025,
3031,
3032,
3089,
3100,
3101,
3118,
3119,
3191,
3192,
3231,
3232,
3287,
3288,
3325,
3326,
3355,
3356,
3378,
3379,
3430,
3462,
3463,
3483,
3484,
3523,
3524,
3559,
3568,
3594,
3603,
3645,
3647,
3690,
3711,
3712,
3740,
3742,
3773,
3775,
3798,
3800,
3850,
3868,
3870,
3905,
3906,
3949,
3999,
4000,
4041,
4055,
4058,
4126,
4134,
4138,
4139,
4142,
4143,
4201,
4255,
4256,
4299,
4300,
4323,
4324,
4343,
4344,
4363,
4364,
4395,
4396,
4399,
4400,
4407,
4408,
4469,
4487,
4488,
4612,
4613,
4662,
4763,
4795,
4834,
4835,
4876,
4951,
4952,
4986,
4987,
5035,
5036,
5037,
5038,
5053,
5054,
5055,
5056,
5076,
5077,
5093,
5155,
5207,
5286,
5287,
5317,
5318,
5385,
5823,
5824,
5874,
5915,
5974,
6133,
6281,
6321,
6366,
6367,
6368,
6405,
6410,
6458,
6460,
6507,
6508,
6528,
6529,
6549,
6551,
6572,
6573,
6595,
6596,
6618,
6619,
6642,
6643,
6655,
6657,
6684,
6685,
6712,
6713,
6726,
6727,
6740,
6741,
6743,
6744,
6750,
6751,
6776,
6839,
7127,
7216,
7217,
7245,
7303,
7308,
7340,
7341,
7377,
7379,
7417,
7418,
7458,
7460,
7497,
7498,
7539,
7540,
7585,
7586,
7636,
7637,
7688,
7689,
7741,
7742,
7779,
7780,
7823,
7824,
7902,
7903,
7961,
7962,
7996,
7997,
8043,
8044,
8086,
8087,
8123,
8124,
8160,
8161,
8195,
8196,
8227,
8228,
8273,
8274,
8330,
8331,
8414,
8415,
8555,
8556,
8659,
8660,
8704,
8706,
8743,
8744,
8809,
8810,
8861,
8862,
8911,
8912,
8987,
8988,
9053,
9054,
9072,
9073,
9166,
9167,
9218,
9219,
9268,
9269,
9407,
9408,
9426,
9427,
9495,
9496,
9547,
9548,
9597,
9598,
9664,
9665,
9683,
9684,
9748,
9749,
9814,
9815,
9908,
9909,
9957,
9958,
10015,
10016,
10066,
10067,
10116,
10117,
10209,
10210,
10228,
10229,
10305,
10306,
10399,
10400,
10418,
10419,
10443,
10444,
10454,
10455,
10456,
10495,
10496,
10529,
10530,
10540,
10541,
10542,
10591,
10592,
10637,
10638,
10693,
10694,
10755,
10756,
10801,
10802,
10846,
10847,
10875,
10876,
10921,
10922,
10959,
10960,
11007,
11008,
11063,
11064,
11136,
11137,
11206,
11207,
11267,
11268,
11301,
11302,
11393,
11394,
11477,
11478,
11562,
11564,
11655,
11657,
11748,
11749,
11846,
11848,
11972,
11973,
11999,
12000,
12018,
12019,
12088,
12089,
12099,
12100,
12101,
12151,
12152,
12204,
12205,
12267,
12268,
12278,
12279,
12280,
12331,
12332,
12388,
12389,
12455,
12456,
12513,
12514,
12562,
12563,
12581,
12582,
12592,
12593,
12595,
12596,
12602,
12603,
12604,
12634,
12736,
12841,
12916,
12917,
13198,
13216,
13217,
13308,
13448,
13597,
13646,
13647,
13764,
13765,
13818,
13819,
13934,
14080,
14192,
14456,
14550,
14551,
14914,
15076,
15078,
15079,
15203,
15292,
15413,
15414,
15415,
15431,
15432,
15433,
15461,
15462,
15580,
15581,
15597,
15641,
15766,
15767,
15803,
15892,
16132,
16133,
16144,
16411,
16412,
16441,
16463,
16464,
16533,
16581,
16624,
16708,
16769,
16835,
16880,
16937,
16987,
17005,
17061,
17096,
17133,
17179,
17222,
17276,
17353,
17411,
17437,
17487,
17505,
17573,
17644,
17709,
17760,
17809,
17875,
17893,
17903,
17942,
17976,
17986,
18031,
18071,
18119,
18169,
18211,
18300,
18369,
18439,
18509,
18554,
18608,
18656,
18710,
18757,
18817,
18877,
18931,
18973,
18991,
19001,
19003,
19015,
19016,
19017,
19047,
19112,
19175,
19290,
19415,
19450,
19451,
19472,
19524,
19680,
19681,
19907,
19908,
20152,
20153,
20438,
20578,
20830,
20831,
21136,
21137,
21180,
21346,
21347,
21699,
21700,
21701,
21731,
21749,
21813,
21927,
22024,
22093,
22094,
22129,
22171,
22271,
22318,
22423,
22429,
22430,
22431,
22433,
22452,
22516,
22631,
22729,
22798,
22799,
22835,
22883,
22991,
22997,
22998,
22999,
23158,
23159,
23160,
23175,
23259
],
"line_end_idx": [
96,
141,
249,
263,
264,
303,
304,
327,
328,
330,
347,
378,
380,
381,
402,
425,
426,
442,
443,
701,
702,
703,
733,
808,
809,
943,
1079,
1259,
1260,
1300,
1311,
1326,
1334,
1350,
1351,
1352,
1372,
1390,
1600,
1618,
1619,
1625,
1631,
1632,
1658,
1659,
1684,
1685,
1714,
1715,
1746,
1747,
1777,
1778,
1810,
1811,
1814,
1815,
1822,
1823,
1970,
1971,
1988,
2148,
2166,
2167,
2173,
2179,
2180,
2225,
2226,
2289,
2290,
2337,
2338,
2374,
2375,
2378,
2379,
2386,
2387,
2673,
2674,
2690,
2939,
3018,
3019,
3025,
3031,
3032,
3089,
3100,
3101,
3118,
3119,
3191,
3192,
3231,
3232,
3287,
3288,
3325,
3326,
3355,
3356,
3378,
3379,
3430,
3462,
3463,
3483,
3484,
3523,
3524,
3559,
3568,
3594,
3603,
3645,
3647,
3690,
3711,
3712,
3740,
3742,
3773,
3775,
3798,
3800,
3850,
3868,
3870,
3905,
3906,
3949,
3999,
4000,
4041,
4055,
4058,
4126,
4134,
4138,
4139,
4142,
4143,
4201,
4255,
4256,
4299,
4300,
4323,
4324,
4343,
4344,
4363,
4364,
4395,
4396,
4399,
4400,
4407,
4408,
4469,
4487,
4488,
4612,
4613,
4662,
4763,
4795,
4834,
4835,
4876,
4951,
4952,
4986,
4987,
5035,
5036,
5037,
5038,
5053,
5054,
5055,
5056,
5076,
5077,
5093,
5155,
5207,
5286,
5287,
5317,
5318,
5385,
5823,
5824,
5874,
5915,
5974,
6133,
6281,
6321,
6366,
6367,
6368,
6405,
6410,
6458,
6460,
6507,
6508,
6528,
6529,
6549,
6551,
6572,
6573,
6595,
6596,
6618,
6619,
6642,
6643,
6655,
6657,
6684,
6685,
6712,
6713,
6726,
6727,
6740,
6741,
6743,
6744,
6750,
6751,
6776,
6839,
7127,
7216,
7217,
7245,
7303,
7308,
7340,
7341,
7377,
7379,
7417,
7418,
7458,
7460,
7497,
7498,
7539,
7540,
7585,
7586,
7636,
7637,
7688,
7689,
7741,
7742,
7779,
7780,
7823,
7824,
7902,
7903,
7961,
7962,
7996,
7997,
8043,
8044,
8086,
8087,
8123,
8124,
8160,
8161,
8195,
8196,
8227,
8228,
8273,
8274,
8330,
8331,
8414,
8415,
8555,
8556,
8659,
8660,
8704,
8706,
8743,
8744,
8809,
8810,
8861,
8862,
8911,
8912,
8987,
8988,
9053,
9054,
9072,
9073,
9166,
9167,
9218,
9219,
9268,
9269,
9407,
9408,
9426,
9427,
9495,
9496,
9547,
9548,
9597,
9598,
9664,
9665,
9683,
9684,
9748,
9749,
9814,
9815,
9908,
9909,
9957,
9958,
10015,
10016,
10066,
10067,
10116,
10117,
10209,
10210,
10228,
10229,
10305,
10306,
10399,
10400,
10418,
10419,
10443,
10444,
10454,
10455,
10456,
10495,
10496,
10529,
10530,
10540,
10541,
10542,
10591,
10592,
10637,
10638,
10693,
10694,
10755,
10756,
10801,
10802,
10846,
10847,
10875,
10876,
10921,
10922,
10959,
10960,
11007,
11008,
11063,
11064,
11136,
11137,
11206,
11207,
11267,
11268,
11301,
11302,
11393,
11394,
11477,
11478,
11562,
11564,
11655,
11657,
11748,
11749,
11846,
11848,
11972,
11973,
11999,
12000,
12018,
12019,
12088,
12089,
12099,
12100,
12101,
12151,
12152,
12204,
12205,
12267,
12268,
12278,
12279,
12280,
12331,
12332,
12388,
12389,
12455,
12456,
12513,
12514,
12562,
12563,
12581,
12582,
12592,
12593,
12595,
12596,
12602,
12603,
12604,
12634,
12736,
12841,
12916,
12917,
13198,
13216,
13217,
13308,
13448,
13597,
13646,
13647,
13764,
13765,
13818,
13819,
13934,
14080,
14192,
14456,
14550,
14551,
14914,
15076,
15078,
15079,
15203,
15292,
15413,
15414,
15415,
15431,
15432,
15433,
15461,
15462,
15580,
15581,
15597,
15641,
15766,
15767,
15803,
15892,
16132,
16133,
16144,
16411,
16412,
16441,
16463,
16464,
16533,
16581,
16624,
16708,
16769,
16835,
16880,
16937,
16987,
17005,
17061,
17096,
17133,
17179,
17222,
17276,
17353,
17411,
17437,
17487,
17505,
17573,
17644,
17709,
17760,
17809,
17875,
17893,
17903,
17942,
17976,
17986,
18031,
18071,
18119,
18169,
18211,
18300,
18369,
18439,
18509,
18554,
18608,
18656,
18710,
18757,
18817,
18877,
18931,
18973,
18991,
19001,
19003,
19015,
19016,
19017,
19047,
19112,
19175,
19290,
19415,
19450,
19451,
19472,
19524,
19680,
19681,
19907,
19908,
20152,
20153,
20438,
20578,
20830,
20831,
21136,
21137,
21180,
21346,
21347,
21699,
21700,
21701,
21731,
21749,
21813,
21927,
22024,
22093,
22094,
22129,
22171,
22271,
22318,
22423,
22429,
22430,
22431,
22433,
22452,
22516,
22631,
22729,
22798,
22799,
22835,
22883,
22991,
22997,
22998,
22999,
23158,
23159,
23160,
23175,
23259,
23288
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 23288,
"ccnet_original_nlines": 621,
"rps_doc_curly_bracket": 0.0022329099010676146,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3147326707839966,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02007937990128994,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.28578099608421326,
"rps_doc_frac_unique_words": 0.22226186096668243,
"rps_doc_mean_word_length": 5.523367881774902,
"rps_doc_num_sentences": 350,
"rps_doc_symbol_to_word_ratio": 0.00023347999376710504,
"rps_doc_unigram_entropy": 5.411674499511719,
"rps_doc_word_count": 2803,
"rps_doc_frac_chars_dupe_10grams": 0.04521379992365837,
"rps_doc_frac_chars_dupe_5grams": 0.11942900717258453,
"rps_doc_frac_chars_dupe_6grams": 0.0641390010714531,
"rps_doc_frac_chars_dupe_7grams": 0.05445032939314842,
"rps_doc_frac_chars_dupe_8grams": 0.04896007850766182,
"rps_doc_frac_chars_dupe_9grams": 0.04521379992365837,
"rps_doc_frac_chars_top_2gram": 0.009688669815659523,
"rps_doc_frac_chars_top_3gram": 0.007750940043479204,
"rps_doc_frac_chars_top_4gram": 0.0041338298469781876,
"rps_doc_books_importance": -2030.675537109375,
"rps_doc_books_importance_length_correction": -2030.675537109375,
"rps_doc_openwebtext_importance": -1126.77685546875,
"rps_doc_openwebtext_importance_length_correction": -1126.77685546875,
"rps_doc_wikipedia_importance": -854.4371337890625,
"rps_doc_wikipedia_importance_length_correction": -854.4371337890625
},
"fasttext": {
"dclm": 0.22891587018966675,
"english": 0.5046549439430237,
"fineweb_edu_approx": 1.71211838722229,
"eai_general_math": 0.6415109634399414,
"eai_open_web_math": 0.44322943687438965,
"eai_web_code": 0.515507698059082
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "006.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-1,460,933,386,027,827,700 | ArtsAutosBooksBusinessEducationEntertainmentFamilyFashionFoodGamesGenderHealthHolidaysHomeHubPagesPersonal FinancePetsPoliticsReligionSportsTechnologyTravel
Instantly Indexing Your Hubpages
Updated on January 4, 2012
I just finished a hub that I'd been working on for a few days and thought I'd submit the final product to some social bookmarking sites, see what indexing results I could get for my efforts. Less than 10 minutes after submitting to 5-10 social sites (I use 5-10 as an estimate because it varies with each Hub, so I don't want to skew the process. It could probably work with less, but I have a system), my Mercedes alloy wheels Hubpage is indexed in Google.
Indexing Hubpages in Google
So, how do I know the page is indexed in Google? Well, I simply copied and pasted the url http://hubpages.com/hub/Mercedes-alloy-wheels into Google search bar at the top of Mozilla Firefox and voila! It popped up as the first listing. So now I'm listed in the first position for my own url, exciting right? Well, yeah. I knew it was possible to index quickly through social sites, but I'd never really experimented with the process in a scientific method/manner before now.
So, what did I do, which sites did I use? I used all the major social sites you've probably heard of or used before, plus a couple others I like.
My criteria: Easy, friendly and quick to use; some don't like people to just drop by and leave a link to an outside site, they prefer interaction and what-not. On average I'd like to be able to visit the site and create a link in less than 2 minutes, soup to nuts...
Digg - Everybody's heard of Digg, and for a very good reason. They rock, enough said
reddit - Another popular social site, this one is very efficient and easy to use
Stumbleupon - The list of popular social sites continues, as this site is a tried and true companion to any IM'er
Delicious - Many claim Delicious is the premiere social bookmarking site on the web. the fact that other social sites will often let you import your Delicious bookmarks over to their site helps qualify this claim
Friendster - Similar to reddit or Delicious, I often submit to this site as well
Google Bookmarks - Now take note because this is mucho important; I never, ever, ever, ever, ever, EVER submit any web property to Google in the true submitting sense of the word. Instead, I use Google Bookmarks. It's similar to just storing bookmarks in my browser, but they are stored on Google's server. If Google doesn't spider their own server and web properties, then what hope would the rest of us have for any of our other sites?! This is one of my favorite ways to manage my bookmarks, especially when my browser bookmarks are on the fritz, which unfortunately happens quite often with Mozilla Firefox
Clickazoo - Not many people are familiar with this site I assume, and I found them quite by accident, but I simply love this social bookmarking site. It allows me to bookmark any page I want in thumbnail form, helping me keep organized and providing links back to my pages
MySpace - Now, don't judge me. I can't think of any other use I have for this site any longer, except for quality linking and bookmarking. MySpace is so 2006, but it still has a huge following
Hellotxt - This site automatically updates Twitter, FriendFeed and Bebo for me, so it's 3 tools in one.
Now, I understand that this probably seems like a lot of work, and you know... You're right, it was a lot of work... The first time I used the sites, there was some initial setup. Now, when I want to bookmark a site I just click on the button on my browser's toolbar for each social site I'd like to visit and submit my site. The fields are then automatically populated for ease of use.
The site I listed took me less than 10 minutes to submit to all the social bookmarking 2.0 sites I highlighted, then 10 minutes after that I typed my url into Google search. Like magic, there it was, ready for me to start backlinking to in order to hopefully drive targeted traffic to it, so that I can hopefully start making money from Google Adsense or Amazon. What? You didn't actually think I liked writing about Mercedes alloy wheels did you?!
Quickly and efficiently getting Hubpages and other web entities indexed in Google is absolutely essential for those who want to drive SEO based traffic to their sites. How else could you climb the Google search rankings if Google didn't already know your sites existed? By making the process instantaneous through social bookmarking sites, I'm now afforded the opportunity to concentrate on other aspects of promotion, and that makes me feel better about the whole process.
On a side note: The one site I don't use to bookmark my sites is the one that everybody touts as the best, and that is Facebook. I actually love Facebook; It's where I go to play Mafia Wars, and Vampire Wars, and all those other activities I like to partake in to take my mind off of the daily grind. But I haven't set up the proper filters that will allow me to post links that won't be shoved down the throats of every 'Friend' have in the community. I'm pretty sure that my old high school buddies, my casual acquaintances, and ex-fiancees want to hear my pitch on polycarbonate roofing panels, or writing desks or how to best utilize Hubpages for profit.
It's best I've found to keep my audience in mind when engaging in social bookmarking activities. Last thing I wanna do is get all 'Spammy' with it.
The last thing I do once I've bookmarked a Hubpage at any social site is to click on the link I've just created. This accomplishes at least two things; Firstly, I know if the link is broken or not. If it's broken for whatever reason, this would be the time to fix it and make it right. Secondly, Hubpages registers the visit as coming from a different site than just my Hubpages account page and lists it in the Hub metrics. I don't know if this helps a Hub rating, but having several page hits from unique IP addresses certainly can't hurt. Lastly, I just like to click on the link to help get things moving, though this is more a superstition than anything based on SEO fact. I'm a creature of habit, though, and so far it's been working.
Good luck...
After much tweaking and trial-n-error here is the comprehensive list of those Social Bookmarking sites that I submit every new Hub I create to in order to gain indexing and backlinks. Some are listed above, here is the complete list:
1. HelloTxt (Twitter, Bebo, FriendFeed)
2. Digg
3. reddit
4. Stumbleupon
5. Delicious
6. Clickazoo
7. Google Bookmarks
8. Blogger
9. MySpace
10. folkd
11. Squidoo
12. Mister Wong
13. YouMob
14. YouBookmarks
15. Tagza
16. A1-Webmarks
17. eLert Gadget
18. Gabbr
19. Simpy (nofollow)
20. BuddyMarks
21. mylinkvault
22. Blinklist
23. friendster
24. Hitmarks
25. Jamespot
26. NetLog
27. Diigo (nofollow)
28. Osmosus
29. Slashdot (nofollow); This site irks me more with each passing day. Don't waste your time!)
30. Technorati (This site's in a flux state currently, but they'll be back even stronger!)
Those are all of the sites I submit to. So you can see that any new Hub I send out to these sites will get some quick love from Google. This is also the EXACT order I submit my sites to, because those at the bottom are my least favorite, so if I get down near the bottom of my list and don't feel like dealing with their B.S. or jumping through too many hoops, or maybe the Hub in question just doesn't need as much juice as some of my marketing Hubs, then I have some wiggle-room.
The sites I've deleted from my list, for whatever reason are:
1. Grumper
2. Propeller
3. DZone
4. Lunch
5. Bordom
6. Polladium
7. Kaboodle
8. Planypus
9. Fark
10. Faves
11. Evernote
12. Bizsugar
Either I didn't like those sites, or those sites didn't like me, or the process was too complex for what I was trying to accomplish, but for whatever reason those sites are no longer on my list.
I timed myself as I submitted my most recent Hub publication, sewer snakes for blocked drains , and it took me exactly 30 minutes to submit the Hub to every one of those social sites. So you see, it is time consuming, but worth it I think. I have some Hubs on backlog to submit now that I have honed the list, so I'll try to get to at least one Hub a night, time permitting, and motivation permitting... 'cuz there's nothing I'd rather be doing right now than watching a movie On-Demand...
Also, one more step I often incorporate into the launch of any new Hub is to 'Ping' the site. This simply involves submitting the url of the Hub to a pinging site like Pingler.com and then they send a bunch of hits out to various destinations to let others know that my url exists. That seems to be the over simplified explanation if what the process entails. I understand pinging on a troubleshooting level, so every now and again I'll submit a url to Pingler.com and let them work their magic.
If you find you don't have the time, the wherewithal or even the patience to bookmark at all the sites listed, then I highly recommend at least getting through the first 15 on the list. They are the best I've come across so far, and it won't take you very long, once you've got everything set up and in place that is.
Good luck!
After further review...
I've now been socially bookmarking my Hubs and other web properties with these various social bookmarking tools, and have actually pared the list down quite a bit. Below is the updated list of sites that I use, mainly because they are all dofollow, and also because some of the sites just didn't live up to the hype for one reason or another.
HelloTxt, Digg, Stumbled, Delicious, Blinklist, Google, Clickazoo, mylinkvault, Blogger, BuddyMarks, Jamespot, Tagza, YouMob, Mister Wong, A1-Webmarks, Gabbr
YouMob isn't necessarily dofollow, but it's so easy to set up and use, plus I get some trickle traffic from them, so they are a keeper.
Comments
0 of 8192 characters used
Post Comment
• profile image
Marquis Canaday
6 years ago
Hey, I can introduce more than 300 bookmarking sites. But I will NOT steal your glory.
• Sam Wroxall profile image
Sam Wroxall
7 years ago
Good information I am constantly trying to get more links and traffic to my hubs and websites so these ideas are great
• Cheeky Girl profile image
Cassandra Mantis
8 years ago from UK and Nerujenia
I have bookmarked this hub page, some very useful info here. Cheers!
• kiranali228 profile image
kiranali228
8 years ago from Islamabad, Pakistan
When i post a hub, it is immediately shown in the google search results but after a day, it is gone. Why is it so? Why does it get indexed and then get de-indexed?
• Canklefish profile imageAUTHOR
Bizz
8 years ago from East Coast
Peter, thanks for the comments. Anybody who tells you they completely understand Google will also sell you ocean-front property in Missouri. Many have a firm grasp of some concepts that can help, but once people begin to think they have Google figured, Google simply mixes up their algorithms. That's what I've heard anyway. I'm still a complete newb compared to many.
As for getting a site indexed, I just bookmark at the most popular social sites, then Google almost has no choice but to notice the site or page. Once indexed, I can seriously consider driving traffic to them by backlinking.
I've also seen sporadic search results when it comes to Google and social media sites. It's just the nature of the beast. I don't think Google even knows how to handle sites marketed in this manner... Yet.
• Peter Dickinson profile image
Peter Dickinson
8 years ago from South East Asia
Interesting approach. Thank you. I just don't fully understand Google though (does anyone?). I have had a couple of hubs at number one on Google search within an hour of publishing and without having done any promotion at all. But then two days later they are on page three or seven. Usually though I will promote on similar lines to you.
• Canklefish profile imageAUTHOR
Bizz
8 years ago from East Coast
gravitywebsources- Yeah, I figured most people would know about the biggies, like Digg and Delicious, but some of my favorites are lesser known like Clickazoo.
I'm also waiting for an approval email from a social site called SheToldMe, which I learned about on another Hub.
• gravitywebsources profile image
gravitywebsources
8 years ago from Hyderabad
eventhough we know about some social bookmarking sites, you had introduced some new good sites. Thank you.
working
This website uses cookies
As a user in the EEA, your approval is needed on a few things. To provide a better website experience, hubpages.com uses cookies (and other similar technologies) and may collect, process, and share personal data. Please choose which areas of our service you consent to our doing so.
For more information on managing or withdrawing consents and how we handle data, visit our Privacy Policy at: https://hubpages.com/privacy-policy#gdpr
Show Details
Necessary
HubPages Device IDThis is used to identify particular browsers or devices when the access the service, and is used for security reasons.
LoginThis is necessary to sign in to the HubPages Service.
Google RecaptchaThis is used to prevent bots and spam. (Privacy Policy)
AkismetThis is used to detect comment spam. (Privacy Policy)
HubPages Google AnalyticsThis is used to provide data on traffic to our website, all personally identifyable data is anonymized. (Privacy Policy)
HubPages Traffic PixelThis is used to collect data on traffic to articles and other pages on our site. Unless you are signed in to a HubPages account, all personally identifiable information is anonymized.
Amazon Web ServicesThis is a cloud services platform that we used to host our service. (Privacy Policy)
CloudflareThis is a cloud CDN service that we use to efficiently deliver files required for our service to operate such as javascript, cascading style sheets, images, and videos. (Privacy Policy)
Google Hosted LibrariesJavascript software libraries such as jQuery are loaded at endpoints on the googleapis.com or gstatic.com domains, for performance and efficiency reasons. (Privacy Policy)
Features
Google Custom SearchThis is feature allows you to search the site. (Privacy Policy)
Google MapsSome articles have Google Maps embedded in them. (Privacy Policy)
Google ChartsThis is used to display charts and graphs on articles and the author center. (Privacy Policy)
Google AdSense Host APIThis service allows you to sign up for or associate a Google AdSense account with HubPages, so that you can earn money from ads on your articles. No data is shared unless you engage with this feature. (Privacy Policy)
Google YouTubeSome articles have YouTube videos embedded in them. (Privacy Policy)
VimeoSome articles have Vimeo videos embedded in them. (Privacy Policy)
PaypalThis is used for a registered author who enrolls in the HubPages Earnings program and requests to be paid via PayPal. No data is shared with Paypal unless you engage with this feature. (Privacy Policy)
Facebook LoginYou can use this to streamline signing up for, or signing in to your Hubpages account. No data is shared with Facebook unless you engage with this feature. (Privacy Policy)
MavenThis supports the Maven widget and search functionality. (Privacy Policy)
Marketing
Google AdSenseThis is an ad network. (Privacy Policy)
Google DoubleClickGoogle provides ad serving technology and runs an ad network. (Privacy Policy)
Index ExchangeThis is an ad network. (Privacy Policy)
SovrnThis is an ad network. (Privacy Policy)
Facebook AdsThis is an ad network. (Privacy Policy)
Amazon Unified Ad MarketplaceThis is an ad network. (Privacy Policy)
AppNexusThis is an ad network. (Privacy Policy)
OpenxThis is an ad network. (Privacy Policy)
Rubicon ProjectThis is an ad network. (Privacy Policy)
TripleLiftThis is an ad network. (Privacy Policy)
Say MediaWe partner with Say Media to deliver ad campaigns on our sites. (Privacy Policy)
Remarketing PixelsWe may use remarketing pixels from advertising networks such as Google AdWords, Bing Ads, and Facebook in order to advertise the HubPages Service to people that have visited our sites.
Conversion Tracking PixelsWe may use conversion tracking pixels from advertising networks such as Google AdWords, Bing Ads, and Facebook in order to identify when an advertisement has successfully resulted in the desired action, such as signing up for the HubPages Service or publishing an article on the HubPages Service.
Statistics
Author Google AnalyticsThis is used to provide traffic data and reports to the authors of articles on the HubPages Service. (Privacy Policy)
ComscoreComScore is a media measurement and analytics company providing marketing data and analytics to enterprises, media and advertising agencies, and publishers. Non-consent will result in ComScore only processing obfuscated personal data. (Privacy Policy)
Amazon Tracking PixelSome articles display amazon products as part of the Amazon Affiliate program, this pixel provides traffic statistics for those products (Privacy Policy) | {
"url": "https://hubpages.com/community/Instantly-Indexing-Your-Hubpages",
"source_domain": "hubpages.com",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "102770",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QOLGQC4ZS5IK7WRHMY2QIR6AGZQZJRGR",
"WARC-Concurrent-To": "<urn:uuid:eb3ccab6-6648-42d4-95e3-7aa1293e7490>",
"WARC-Date": "2018-12-12T04:43:25Z",
"WARC-IP-Address": "34.195.25.205",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VYENPZ3XK5TZCW6MACKXYFOZ6VVO6LYB",
"WARC-Record-ID": "<urn:uuid:4022b6a9-bf84-4f9c-915b-d7acf3b00569>",
"WARC-Target-URI": "https://hubpages.com/community/Instantly-Indexing-Your-Hubpages",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:da9a0a7e-11bf-41a6-b0fd-46f98a74d844>"
},
"warc_info": "isPartOf: CC-MAIN-2018-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-185-234-147.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
157,
158,
191,
192,
219,
220,
678,
679,
707,
708,
1182,
1183,
1329,
1330,
1597,
1598,
1683,
1684,
1765,
1766,
1880,
1881,
2094,
2095,
2176,
2177,
2788,
2789,
3062,
3063,
3256,
3257,
3361,
3362,
3749,
3750,
4199,
4200,
4674,
4675,
5334,
5335,
5483,
5484,
6225,
6226,
6239,
6240,
6474,
6475,
6517,
6527,
6539,
6556,
6571,
6586,
6608,
6621,
6634,
6646,
6660,
6678,
6691,
6710,
6722,
6740,
6759,
6771,
6794,
6811,
6829,
6845,
6862,
6877,
6892,
6905,
6928,
6942,
7039,
7132,
7133,
7615,
7616,
7678,
7679,
7692,
7707,
7718,
7729,
7741,
7756,
7770,
7784,
7794,
7806,
7821,
7836,
7837,
8032,
8033,
8523,
8524,
9020,
9021,
9339,
9340,
9351,
9352,
9376,
9377,
9720,
9721,
9879,
9880,
10016,
10017,
10026,
10027,
10057,
10074,
10075,
10095,
10096,
10119,
10120,
10138,
10139,
10232,
10233,
10265,
10266,
10285,
10286,
10304,
10305,
10430,
10431,
10463,
10464,
10488,
10489,
10529,
10530,
10605,
10606,
10638,
10639,
10658,
10659,
10702,
10703,
10873,
10874,
10911,
10912,
10924,
10925,
10959,
10960,
11335,
11336,
11567,
11568,
11780,
11781,
11817,
11818,
11841,
11842,
11881,
11882,
12227,
12228,
12265,
12266,
12278,
12279,
12313,
12314,
12480,
12481,
12601,
12602,
12640,
12641,
12666,
12667,
12700,
12701,
12814,
12815,
12827,
12828,
12858,
12859,
13146,
13147,
13302,
13303,
13320,
13334,
13475,
13538,
13614,
13679,
13829,
14039,
14147,
14347,
14546,
14559,
14647,
14728,
14839,
15084,
15171,
15247,
15459,
15650,
15733,
15747,
15805,
15906,
15964,
16013,
16069,
16142,
16194,
16243,
16302,
16356,
16450,
16657,
16984,
16999,
17144,
17408
],
"line_end_idx": [
157,
158,
191,
192,
219,
220,
678,
679,
707,
708,
1182,
1183,
1329,
1330,
1597,
1598,
1683,
1684,
1765,
1766,
1880,
1881,
2094,
2095,
2176,
2177,
2788,
2789,
3062,
3063,
3256,
3257,
3361,
3362,
3749,
3750,
4199,
4200,
4674,
4675,
5334,
5335,
5483,
5484,
6225,
6226,
6239,
6240,
6474,
6475,
6517,
6527,
6539,
6556,
6571,
6586,
6608,
6621,
6634,
6646,
6660,
6678,
6691,
6710,
6722,
6740,
6759,
6771,
6794,
6811,
6829,
6845,
6862,
6877,
6892,
6905,
6928,
6942,
7039,
7132,
7133,
7615,
7616,
7678,
7679,
7692,
7707,
7718,
7729,
7741,
7756,
7770,
7784,
7794,
7806,
7821,
7836,
7837,
8032,
8033,
8523,
8524,
9020,
9021,
9339,
9340,
9351,
9352,
9376,
9377,
9720,
9721,
9879,
9880,
10016,
10017,
10026,
10027,
10057,
10074,
10075,
10095,
10096,
10119,
10120,
10138,
10139,
10232,
10233,
10265,
10266,
10285,
10286,
10304,
10305,
10430,
10431,
10463,
10464,
10488,
10489,
10529,
10530,
10605,
10606,
10638,
10639,
10658,
10659,
10702,
10703,
10873,
10874,
10911,
10912,
10924,
10925,
10959,
10960,
11335,
11336,
11567,
11568,
11780,
11781,
11817,
11818,
11841,
11842,
11881,
11882,
12227,
12228,
12265,
12266,
12278,
12279,
12313,
12314,
12480,
12481,
12601,
12602,
12640,
12641,
12666,
12667,
12700,
12701,
12814,
12815,
12827,
12828,
12858,
12859,
13146,
13147,
13302,
13303,
13320,
13334,
13475,
13538,
13614,
13679,
13829,
14039,
14147,
14347,
14546,
14559,
14647,
14728,
14839,
15084,
15171,
15247,
15459,
15650,
15733,
15747,
15805,
15906,
15964,
16013,
16069,
16142,
16194,
16243,
16302,
16356,
16450,
16657,
16984,
16999,
17144,
17408,
17586
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 17586,
"ccnet_original_nlines": 237,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3985176682472229,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0305017102509737,
"rps_doc_frac_lines_end_with_ellipsis": 0.016806719824671745,
"rps_doc_frac_no_alph_words": 0.17160774767398834,
"rps_doc_frac_unique_words": 0.31416696310043335,
"rps_doc_mean_word_length": 4.708001613616943,
"rps_doc_num_sentences": 194,
"rps_doc_symbol_to_word_ratio": 0.002565559931099415,
"rps_doc_unigram_entropy": 5.929540157318115,
"rps_doc_word_count": 2887,
"rps_doc_frac_chars_dupe_10grams": 0.01912890002131462,
"rps_doc_frac_chars_dupe_5grams": 0.06444968283176422,
"rps_doc_frac_chars_dupe_6grams": 0.05569453164935112,
"rps_doc_frac_chars_dupe_7grams": 0.028619779273867607,
"rps_doc_frac_chars_dupe_8grams": 0.028619779273867607,
"rps_doc_frac_chars_dupe_9grams": 0.01912890002131462,
"rps_doc_frac_chars_top_2gram": 0.02869335003197193,
"rps_doc_frac_chars_top_3gram": 0.008093000389635563,
"rps_doc_frac_chars_top_4gram": 0.013243080116808414,
"rps_doc_books_importance": -1820.3992919921875,
"rps_doc_books_importance_length_correction": -1820.3992919921875,
"rps_doc_openwebtext_importance": -879.59375,
"rps_doc_openwebtext_importance_length_correction": -879.59375,
"rps_doc_wikipedia_importance": -670.0975341796875,
"rps_doc_wikipedia_importance_length_correction": -670.0975341796875
},
"fasttext": {
"dclm": 0.06063807010650635,
"english": 0.9285523891448975,
"fineweb_edu_approx": 1.0993281602859497,
"eai_general_math": 0.05146723985671997,
"eai_open_web_math": 0.14974671602249146,
"eai_web_code": 0.03961646929383278
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-6,989,190,471,378,007,000 | Over a million developers have joined DZone.
{{announcement.body}}
{{announcement.title}}
Selenium Vs WebTest
DZone's Guide to
Selenium Vs WebTest
· Java Zone ·
Free Resource
Akka from A to Z, An Architects Guide starting off with Actors and Akka Streams, then on to clustering, sharding, event sourcing & CQRS, and more.
Selenium and WebTest are two frameworks available for web test automation. This article compares both frameworks based on a set of 8 questions to help to choose between them.
1 ) Which one has the better IDE?
2 ) How easy / fast to write a comprehensive test case?
3 ) How easy is it to enhance and modify your test case scenario ?
4 ) Dealing with Javascript errors?
5 ) How easy is it to integrate your web test cases with project ?
6 ) What are the things that are in WebTest that you will miss in Selenium?
7 ) Documentation?
8 ) Generated Reports?
Which one has the better IDE?
Selenium has the better IDE , Selenium IDE is advanced and has a lot of luxuries. WebTest IDE is elementary.
How easy/fast to write a comprehensive test case?
In Selenium and WebTest it is easy to write test cases, but Selenium is much easier than WebTest ... of course this is related to point 1(Selenium IDE is advanced compared with WebTest)!
How easy is it to enhance and modify your test case scenario ?
In Selenium this will be easier because of 2 reasons:
a) The test case is executed on the browser , so anyone can easily guess what is the flow and can suggest enhancements on the test case, no need to take a look at the code to guess what this test case is doing.
b ) Because Selenium IDE gives u the ability to modify your test case in a very friendly straight forward way, WebTest IDE does not.
Dealing with Javascript errors?
Selenium does not care if there is a JavaScript error or not, so you cannot depend on Selenium alone to guess JavaScript errors in the application!!!
WebTest does care about JavaScript errors, and it will not let you continue your test till you fix all JavaScript errors.
The first impression regarding this point that WebTest is better, right?
But this is not the case always, because sometimes you have to deal with a project that has many JavaScript errors and all what you want and need is to test functionality , server-side validation , flow ….
Selenium is your hero here…
WebTest will not continue executing test case if it discover any javascript error so it will let you down here..
The optimum thing in my opinion is to have the ability to test functionality and flow regardless if there is Javascript errors or not, and to have the ability to find JavaScript errors in screens.
I mean Javascript error should not stop you from testing the flow and functionality for screens.
But how we can do that?
Simply you can use FireBug FireFox plugin which catch JavaScript errors while Selenium is executing the TestCases, this helped me a lot before , Trust me in this ;)
So my opinion for this point is:
Selenium + FireBug is much better than WebTest.. .
How easy is it to integrate test cases with project ?
WebTest integration with projects is easy! You can easily integrate it to your build file,and it is will become easier to use continues integration tools like CruiseControl to run test cases.
WebTest much better here.
What the things that are in WebTest that you will miss in Selenium?
In WebTest you can verify text inside Excel and PDF.
Documentation?
The same .. no one wins here!
Generated Reports?
WebTest Reports is better, but the difference is not that much.
Based on the above , I do recommend Selenium ...
Akka from A to Z, An Architects Guide starting off with Actors and Akka Streams, then on to clustering, sharding, event sourcing & CQRS, and more.
Topics:
Opinions expressed by DZone contributors are their own.
{{ parent.title || parent.header.title}}
{{ parent.tldr }}
{{ parent.urlSource.name }} | {
"url": "https://dzone.com/articles/selenium-vs-webtest",
"source_domain": "dzone.com",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "137853",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4XX35WWQ4GONAYGDOTKRKQM533DLLEKH",
"WARC-Concurrent-To": "<urn:uuid:92a4da97-0ab8-4d87-9a65-43f17977d14f>",
"WARC-Date": "2018-04-27T07:25:23Z",
"WARC-IP-Address": "52.72.169.15",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:J3LYBNRVDEQ2FZFKVUMYHRRWGLLKK52X",
"WARC-Record-ID": "<urn:uuid:d660f19d-a96b-403a-a5b9-5e2aa65da544>",
"WARC-Target-URI": "https://dzone.com/articles/selenium-vs-webtest",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f519aea5-2753-49ae-8ed4-02c008be61a4>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-16-217-249.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-17\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for April 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
45,
67,
90,
91,
111,
112,
129,
130,
150,
151,
165,
179,
180,
328,
329,
504,
505,
539,
595,
662,
698,
765,
841,
860,
883,
884,
886,
887,
917,
918,
919,
1028,
1029,
1030,
1080,
1081,
1082,
1269,
1270,
1333,
1334,
1335,
1389,
1600,
1733,
1734,
1735,
1767,
1768,
1769,
1919,
2041,
2042,
2115,
2321,
2349,
2350,
2463,
2660,
2757,
2758,
2782,
2947,
2980,
3031,
3032,
3033,
3087,
3088,
3089,
3281,
3307,
3308,
3309,
3377,
3378,
3379,
3432,
3433,
3448,
3449,
3450,
3480,
3481,
3482,
3501,
3502,
3503,
3567,
3568,
3569,
3618,
3619,
3767,
3768,
3776,
3777,
3833,
3834,
3875,
3876,
3894,
3895
],
"line_end_idx": [
45,
67,
90,
91,
111,
112,
129,
130,
150,
151,
165,
179,
180,
328,
329,
504,
505,
539,
595,
662,
698,
765,
841,
860,
883,
884,
886,
887,
917,
918,
919,
1028,
1029,
1030,
1080,
1081,
1082,
1269,
1270,
1333,
1334,
1335,
1389,
1600,
1733,
1734,
1735,
1767,
1768,
1769,
1919,
2041,
2042,
2115,
2321,
2349,
2350,
2463,
2660,
2757,
2758,
2782,
2947,
2980,
3031,
3032,
3033,
3087,
3088,
3089,
3281,
3307,
3308,
3309,
3377,
3378,
3379,
3432,
3433,
3448,
3449,
3450,
3480,
3481,
3482,
3501,
3502,
3503,
3567,
3568,
3569,
3618,
3619,
3767,
3768,
3776,
3777,
3833,
3834,
3875,
3876,
3894,
3895,
3922
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3922,
"ccnet_original_nlines": 103,
"rps_doc_curly_bracket": 0.0050994399935007095,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.416879802942276,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021739130839705467,
"rps_doc_frac_lines_end_with_ellipsis": 0.01923076994717121,
"rps_doc_frac_no_alph_words": 0.16368286311626434,
"rps_doc_frac_unique_words": 0.3633587658405304,
"rps_doc_mean_word_length": 4.650381565093994,
"rps_doc_num_sentences": 54,
"rps_doc_symbol_to_word_ratio": 0.005115089938044548,
"rps_doc_unigram_entropy": 4.916662216186523,
"rps_doc_word_count": 655,
"rps_doc_frac_chars_dupe_10grams": 0.1398555487394333,
"rps_doc_frac_chars_dupe_5grams": 0.21503610908985138,
"rps_doc_frac_chars_dupe_6grams": 0.19304004311561584,
"rps_doc_frac_chars_dupe_7grams": 0.1398555487394333,
"rps_doc_frac_chars_dupe_8grams": 0.1398555487394333,
"rps_doc_frac_chars_dupe_9grams": 0.1398555487394333,
"rps_doc_frac_chars_top_2gram": 0.0236375592648983,
"rps_doc_frac_chars_top_3gram": 0.01181877963244915,
"rps_doc_frac_chars_top_4gram": 0.01444516982883215,
"rps_doc_books_importance": -349.2662658691406,
"rps_doc_books_importance_length_correction": -349.2662658691406,
"rps_doc_openwebtext_importance": -241.98365783691406,
"rps_doc_openwebtext_importance_length_correction": -241.98365783691406,
"rps_doc_wikipedia_importance": -163.4918975830078,
"rps_doc_wikipedia_importance_length_correction": -163.4918975830078
},
"fasttext": {
"dclm": 0.03495066985487938,
"english": 0.8869317770004272,
"fineweb_edu_approx": 1.5116914510726929,
"eai_general_math": 0.6515013575553894,
"eai_open_web_math": 0.45681077241897583,
"eai_web_code": 0.2649325132369995
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "14",
"label": "Reviews/Critiques"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "12",
"label": "Listicle"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
6,389,457,276,927,072,000 | Tell me more ×
Super User is a question and answer site for computer enthusiasts and power users. It's 100% free, no registration required.
I want to right click where the focus is not where the mouse cursor is (eg. the blinking text cursor or on a file) using only the keyboard.
I've tried mouse keys and it right clicks at the mouse pointer, not the text cursor. I'm open to any 3rd party apps or services.
share|improve this question
Just to clarify, are you looking for functionality on OS X to open up the context menu similar to the Windows Menu key? – fideli Mar 2 '11 at 1:22
1
Most likely, all commands in the context menu are available from the menubar. Press Cmd-? to open Help menu's search field and type your command instead, or use Ctrl-F2 to move the focus to the menu bar and navigate to your desired action there. Or better, assign keyboard shortcuts to often used commands in System Preferences » Keyboard » Keyboard Shortcuts » Applications so you can access them directly. – Daniel Beck Mar 2 '11 at 6:44
For how the Help search field can work, see here. – Daniel Beck Mar 2 '11 at 6:57
2 Answers
up vote 0 down vote accepted
This is a common request of ex-Windows Keyboard Maestro users. Apparently there is a window key which will display a contextual menu based on the insertion point, but there is no equivalent behaviour on the Mac. It is impossible in general to get the screen location of the current insertion point (some applications may allow some method via AppleScript or Assistive services).
So there is no way to move the mouse pointer to the insertion location in general, and the contextual menus are based on the mouse pointer.
This is why Keyboard Maestro doesn't implement this, and without some low level hackery, it is almost certainly impossible.
So essentially you are out of luck. You will need to find an alternative solution to your issue.
share|improve this answer
There could be at least two ways to do it:
• Using a direct action for opening the context menu
• Moving the mouse pointer over the selected items or text, and then triggering a secondary click
But I haven't found a way to do either of those.
Applescript is pretty crappy at working with both selections and mouse stuff. Keyboard Maestro, iKey, QuicKeys or BetterTouchTool don't seem to have any way to do it either. Or MouseTools or XTool.osax. Or KeyRemap4MacBook.
share|improve this answer
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "http://superuser.com/questions/252030/mac-os-x-10-6-5-right-click-at-cursor-position/252518",
"source_domain": "superuser.com",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "46535",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RPAAAM43NUZ6C3O37A36JZOEOVZAHMQL",
"WARC-Concurrent-To": "<urn:uuid:14a1377d-846a-4e03-832a-bf30c54b3915>",
"WARC-Date": "2013-05-23T11:55:55Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ZUWE4PLQE2SDMBWAM6OBLOSIF4RTH55C",
"WARC-Record-ID": "<urn:uuid:0141a0a3-f031-47dd-a114-023e597a441d>",
"WARC-Target-URI": "http://superuser.com/questions/252030/mac-os-x-10-6-5-right-click-at-cursor-position/252518",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:395b128d-18c1-4c91-a760-12265320e07b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-60-113-184.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-20\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Spring 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
15,
140,
141,
281,
282,
411,
412,
440,
587,
591,
1031,
1113,
1114,
1124,
1125,
1154,
1155,
1534,
1535,
1675,
1676,
1800,
1801,
1898,
1899,
1925,
1926,
1969,
1970,
2025,
2125,
2126,
2175,
2176,
2400,
2401,
2427,
2428,
2440,
2441,
2443,
2451,
2452,
2530,
2531
],
"line_end_idx": [
15,
140,
141,
281,
282,
411,
412,
440,
587,
591,
1031,
1113,
1114,
1124,
1125,
1154,
1155,
1534,
1535,
1675,
1676,
1800,
1801,
1898,
1899,
1925,
1926,
1969,
1970,
2025,
2125,
2126,
2175,
2176,
2400,
2401,
2427,
2428,
2440,
2441,
2443,
2451,
2452,
2530,
2531,
2621
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2621,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40515655279159546,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01289134006947279,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16942909359931946,
"rps_doc_frac_unique_words": 0.5098038911819458,
"rps_doc_mean_word_length": 4.503267765045166,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.044668197631836,
"rps_doc_word_count": 459,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01838413067162037,
"rps_doc_frac_chars_dupe_6grams": 0.01838413067162037,
"rps_doc_frac_chars_dupe_7grams": 0.01838413067162037,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.019351720809936523,
"rps_doc_frac_chars_top_3gram": 0.029027579352259636,
"rps_doc_frac_chars_top_4gram": 0.01161103043705225,
"rps_doc_books_importance": -221.2987823486328,
"rps_doc_books_importance_length_correction": -221.2987823486328,
"rps_doc_openwebtext_importance": -122.25308227539062,
"rps_doc_openwebtext_importance_length_correction": -122.25308227539062,
"rps_doc_wikipedia_importance": -102.69939422607422,
"rps_doc_wikipedia_importance_length_correction": -102.69939422607422
},
"fasttext": {
"dclm": 0.06025820970535278,
"english": 0.9013123512268066,
"fineweb_edu_approx": 1.3518821001052856,
"eai_general_math": 0.006846900098025799,
"eai_open_web_math": 0.09674196690320969,
"eai_web_code": 0.001078129978850484
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-6,473,787,619,626,033,000 | Book Review: Designing Virtual Worlds
It has been over a year since my last review of a vintage virtual reality book. I’ve recently come across a good one that I’d like to share.
In 1978, Richard Bartle co-authored MUD, the very first virtual world. In 2003, he shared his twenty-five years of virtual world and MMORPG experience in the book Designing Virtual Worlds. Here are some excerpts from the preface:
Too much virtual world design is derivative. Designers take one or more existing systems as foundations on which to build, sparing little thought as to why these earlier worlds were constructed the way they were.
Are designers even aware that there are decisions they can unmake? Although a good deal of design is evolutionary, that does not mean designers can’t be revolutionary, too.
The key is in recognizing the face that what seems eminently logical to you from your usual perspective might turn out to be disastrous when viewed from another angle — and then realizing that the worlds you’re drawing inspiration from almost certainly contain elements designed by people who didn’t recognize that fact until it was too late.
Obviously, the preface resonated with me on the topic of metaverse design.
The book is an incredible seven hundred and fourty-one pages, filled with decades of experiences and observations in virtual worlds. According to Wikipedia, it has been called “the bible of MMORPG design”.
Designing Virtual Worlds at Amazon
Designing Virtual Worlds at Amazon
The book is not a step-by-step guide to implementing multiplayer virtual worlds. It was published in 2003, so it doesn’t have significant comments to make directly on the topic of virtual reality or more recent MMORPG design elements. But that isn’t why you want the book.
You want the book to open your eyes to new possibilities as much as you want it to help you to question you own design choices. He covers a very wide range of topics from server architecture, player motivations, character attributes, ethics, and so much more. He introduces a topic, explains what has and hasn’t worked, and makes a few comments and suggestions of his own.
The only real controversy in the book seems to be in his observations into gamer psychology. This is based on his 1996 paper Hearts, Clubs, Diamonds, Spades: Players Who Suit MUDs. He proposes four major categories of players: Achievers, Explorers, Socializers, and Killers.
I made much more sense of the Killer category as those looking for dominance over others. A combination of competitive players (the kind that would enjoy DOTA 2), griefers, and in-world politicians. I think that the label of “Killer” is what leads readers down the wrong path, not necessarily the thoughts behind it.
Player Interest Graph
Player Interest Graph
So you can see how his four categories fit on the horizontal axis of Players vs World, and the vertical axis of Acting vs Interacting. In understanding what Bartle is trying to say, I think it makes more sense to put a different label on the vertical axis. Instead of Acting versus Interacting, it should be Dominating versus Exploring.
“Killers” wish to dominate people. “Achievers” wish to dominate the world. “Socializers” wish to explore people. “Explorers” wish to explore the world.
When I shared this observation with Richard, he agreed that the “Killers” quadrant is badly understood and badly named (inherited from a late 1980s perspective). He originally called the vertical axis active/passive, but that didn’t really capture what he wanted. It also had problems during peer review (active is not on the same dimension as passive, just as dominating is not on the same dimension as exploring).
While dominating/exploring may help us better understand what is going on in a two-dimensional player graph, it turns out that it doesn’t fit into the larger picture. Why?
Bartle had developed a third axis to distinguish between explicit and implicit actions. A player with a social interest could be intentionally networking with other people, or just casually making friends. (Our own friends who are developing social VR experiences should take notice.)
His view is that “I wouldn’t say all socialisers were exploring other people anyway; on the 8-types graph, the networker-socialisers would be but the friend-socialisers wouldn’t be.” That said, he thinks the labels aren’t quite capturing what is going on here. Perhaps after reading his book, you may be able to find a better set of labels.
If you are interested in seeing where you fit in to the 4-way classification, you can discover your own primary and secondary classification in the player interest graph via an online test. I’m primarily an achiever/explorer type.
I found it amazing that one of the most relevant titles in my vintage collection of virtual reality books ends up being the one that makes the least number of references to virtual reality itself. But as the author explains, we’re just inheriting and iterating on virtual world design decisions that have been made by others over the past thirty-seven years.
One last thing. Richard points us to his own early metaverse experiment.
Metaverse-wise, players could “seamlessly” walk from MUD to the second world I wrote, Valley (which used the MUD engine). I didn’t let them take anything with them, though, because it was too open for exploits in a game-oriented environment.
Maybe we’re just looking for a new way to implement a long-lost feature.
JUNE 8, 2015: Richard Bartle’s response has been integrated into the article.
Tags: , , , ,
One response to “Book Review: Designing Virtual Worlds”
1. dungeonsurvivalproject says :
Reblogged this on The Dungeon Survival Project and commented:
The quote by Richard Bartle from this article is great, and can easily be seen in the choices made by World of Warcraft’s designers (as well as those that chose to blindly copy WoW itself) when they decided to clone Everquest, but didn’t understand the design decisions of Everquest’s designers, and why Verant created MUD-like combat in the first place.
The stagnation of combat in modern MMOs for the decade can at least partially be attributed to this lack of insight, or lack of desire on the part of the designers to even attempt such introspection.
Leave a Reply
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Google+ photo
You are commenting using your Google+ account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
Connecting to %s
%d bloggers like this: | {
"url": "https://metaversing.com/2015/06/07/book-review-designing-virtual-worlds/",
"source_domain": "metaversing.com",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "75895",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7QYWUKB6J6DLQLEKVKGS5FOJJ2DOHP6P",
"WARC-Concurrent-To": "<urn:uuid:28fe661f-5060-4a77-a91d-ab2f0bd6a576>",
"WARC-Date": "2018-11-15T15:09:32Z",
"WARC-IP-Address": "192.0.78.24",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MDCA3VXYE5Z7CF2GA7XSE6JPMIMU3BRJ",
"WARC-Record-ID": "<urn:uuid:3892490d-c29e-499f-8289-f0d54957bff1>",
"WARC-Target-URI": "https://metaversing.com/2015/06/07/book-review-designing-virtual-worlds/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8b031a2a-eddf-481c-b056-c96d8ff0fc59>"
},
"warc_info": "isPartOf: CC-MAIN-2018-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-166-161-213.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
38,
39,
180,
181,
411,
412,
625,
626,
799,
800,
1143,
1144,
1219,
1220,
1426,
1427,
1462,
1463,
1498,
1499,
1772,
1773,
2146,
2147,
2422,
2423,
2740,
2741,
2763,
2764,
2786,
2787,
3124,
3125,
3277,
3278,
3694,
3695,
3867,
3868,
4153,
4154,
4495,
4496,
4727,
4728,
5087,
5088,
5161,
5162,
5404,
5405,
5478,
5479,
5480,
5559,
5560,
5561,
5563,
5564,
5578,
5579,
5635,
5636,
5671,
5672,
5738,
6097,
6098,
6302,
6303,
6317,
6318,
6373,
6374,
6393,
6394,
6467,
6468,
6482,
6483,
6550,
6551,
6567,
6568,
6635,
6636,
6651,
6652,
6720,
6721,
6738,
6739
],
"line_end_idx": [
38,
39,
180,
181,
411,
412,
625,
626,
799,
800,
1143,
1144,
1219,
1220,
1426,
1427,
1462,
1463,
1498,
1499,
1772,
1773,
2146,
2147,
2422,
2423,
2740,
2741,
2763,
2764,
2786,
2787,
3124,
3125,
3277,
3278,
3694,
3695,
3867,
3868,
4153,
4154,
4495,
4496,
4727,
4728,
5087,
5088,
5161,
5162,
5404,
5405,
5478,
5479,
5480,
5559,
5560,
5561,
5563,
5564,
5578,
5579,
5635,
5636,
5671,
5672,
5738,
6097,
6098,
6302,
6303,
6317,
6318,
6373,
6374,
6393,
6394,
6467,
6468,
6482,
6483,
6550,
6551,
6567,
6568,
6635,
6636,
6651,
6652,
6720,
6721,
6738,
6739,
6761
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6761,
"ccnet_original_nlines": 93,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.420777291059494,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017189839854836464,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15844543278217316,
"rps_doc_frac_unique_words": 0.44748857617378235,
"rps_doc_mean_word_length": 4.948858261108398,
"rps_doc_num_sentences": 62,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.61281156539917,
"rps_doc_word_count": 1095,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04059790074825287,
"rps_doc_frac_chars_dupe_6grams": 0.020298950374126434,
"rps_doc_frac_chars_dupe_7grams": 0.009226789698004723,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.008304120041429996,
"rps_doc_frac_chars_top_3gram": 0.016239160671830177,
"rps_doc_frac_chars_top_4gram": 0.015501010231673717,
"rps_doc_books_importance": -583.7644653320312,
"rps_doc_books_importance_length_correction": -583.7644653320312,
"rps_doc_openwebtext_importance": -352.0823059082031,
"rps_doc_openwebtext_importance_length_correction": -352.0823059082031,
"rps_doc_wikipedia_importance": -282.5899658203125,
"rps_doc_wikipedia_importance_length_correction": -282.5899658203125
},
"fasttext": {
"dclm": 0.02215396985411644,
"english": 0.9594468474388123,
"fineweb_edu_approx": 1.9987696409225464,
"eai_general_math": 0.009413120336830616,
"eai_open_web_math": 0.21275252103805542,
"eai_web_code": 0.0016180899692699313
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "14",
"label": "Reviews/Critiques"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
7,445,848,343,087,548,000 | DiskDigger for Android!
DiskDigger is now available as an app for Android devices! You can find it on the Google Play Store by searching for "DiskDigger".
Please keep in mind that this app is still in the Beta stage, and nowhere near as powerful as the original DiskDigger for Windows. For now, the app will only recover (carve) .JPG, .PNG, and .MP4 files from your device's memory card or internal memory. This is, of course, still quite useful for recovering photos or videos that were accidentally deleted, even if the memory card has been reformatted.
Also, the app will only work on rooted Android devices, since the app requires very low-level access to the memory card, and only rooted devices can allow such access.
The app is compatible with any device (tablet or phone) that uses Android 2.2 (Froyo) or higher.
Using the App
Using DiskDigger for Android is very simple. After launching the app, it will display all the system devices (including the memory card) that you can scan for lost files. For now, it will list them using their Linux device names (not very visually appealing, but this will be improved in the future). The memory card should appear as "/mnt/sdcard" or something similar.
If you're using an Android device without a memory card, you will probably want to scan its internal memory, which usually appears as "/data".
When the program starts, you may see a Superuser request window; make sure to press "Allow" in order to grant DiskDigger root access.
If you don't see any devices in the list, try pressing the "Refresh list" button. If you still don't see any devices, make sure you allowed the Superuser request. (Also make sure your device is actually rooted!)
You can also manually type in the device name, if it doesn't appear in the list.
After you select the device to scan, press the "Scan device" button to proceed. You will then see the main DiskDigger window, which shows you the progress of the scanning, as well as the recoverable files that have been found so far:
You can click on any of the recoverable files, which will show you a preview of the file on the right:
Filtering files
Pressing the "Filter" button will allow you to filter the recoverable files based on file size, and file type. If you want to impose a minimum size on the files shown, press the checkbox next to "Minimum file size", and enter the minimum number of bytes below. By default, a minimum size of 100000 bytes is enabled, to filter out most other (non-photo) images that may be on your memory card (from browser cache, bitmaps from other apps, etc).
Similarly, you can press the checkbox next to each file type (JPG, PNG, etc.) to hide or show them in the list of recoverable files.
Saving files
DiskDigger provides three different ways for you to save the recoverable files: email, FTP upload, and save locally, each which are discussed below.
To recover one or more files, click the check mark next to the recoverable files you want to recover, and press one of the buttons in the lower right corner.
Optionally, you can "select all" files by clicking the topmost checkbox in the upper left corner (uncheck the box to unselect all files):
Saving by email
The "Email" button lets you send one or more recoverable files directly to an email address. DiskDigger will automatically launch the default Email app on your device, and create a blank email with an attachment that contains the recovered files. The attachment is a single Zip file (DiskDiggerFound.zip) that contains all the files you selected for recovery.
Your device may show a prompt for you to select the app to use for processing the attachment. If you have a service such as Dropbox installed on your device, you may also see a choice to add the attachment to Dropbox. Make sure to select the correct app for emailing or uploading the file.
Saving by FTP uploading
The "FTP upload" button lets you upload the recoverable files to an FTP server. In order to do this, you need to have access to an FTP server that is online, with the correct credentials for accessing and uploading to the server. After clicking the "FTP upload" button, DiskDigger will display a dialog for you to enter the FTP server's host name, and your user name and password for logging on to the server:
You can also enter an optional subdirectory on the server where the files will be uploaded.
Click "OK" to begin the uploading process. If the login to the server is successful, you will see status updates at the top of the application, until all files have been uploaded. The files will be named based on the sector number where they were found.
Saving locally
Finally, the "Save local" button provides the option to save the recoverable files to the local device (to the internal memory or SD card of the same device from which the files are being recovered).
After you press the "Save local" button, you are prompted to select the directory where the file(s) will be saved. The directory defaults to the location of the memory card on your device (most commonly "/mnt/sdcard"). The file(s) will be named based on the sector number where they were found.
Important note: You should use this method only if you can save the files onto a different partition than the one from which the files are recovered. For example, if you're recovering files from internal memory, you should save the files onto an external SD card (not internal memory). It is not recommended to save the files onto the same partition from which they were recovered, because that would risk permanently overwriting the very same files that are being recovered! You should attempt to use the first two methods of saving the files (email or FTP upload) before resorting to saving locally.
Inner Workings
The app works very similarly to the "deeper" mode found in the original DiskDigger for Windows, meaning that it searches each sector of the memory card for traces of recoverable files (read more about how DiskDigger works here). This also means that it will "recover" files that haven't been deleted, in addition to files that have. Because of this, you may have wade through a large number of files before seeing the file(s) you're looking for. This will surely be improved in future versions of the app.
Enjoy!
Again, remember that this app is in the Beta stage, and not meant to be as powerful or complete as the original DiskDigger application for Windows.
Of course, all constructive feedback and requests for features are appreciated!
© Dmitry Brant, 2012-2013
| {
"url": "http://diskdigger.org/android",
"source_domain": "diskdigger.org",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "16864",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LOAPTLA2TFAWMY5YAZ2WU5OAWPUP7I6R",
"WARC-Concurrent-To": "<urn:uuid:d0a5727f-23cb-4d48-b667-8cfbaf8f1fb9>",
"WARC-Date": "2014-04-23T11:24:27Z",
"WARC-IP-Address": "208.113.234.201",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:GGQ5MC6WUW2SLVIVPOSYUWSEMITLEEG3",
"WARC-Record-ID": "<urn:uuid:fa01fb6c-30ed-4d0e-885c-88502d12ed7f>",
"WARC-Target-URI": "http://diskdigger.org/android",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dbd014c5-49dc-4cb6-bb06-3dc2a278f9a8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-147-4-33.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-15\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for April 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
24,
25,
156,
157,
559,
560,
728,
729,
826,
827,
841,
842,
1214,
1215,
1358,
1359,
1493,
1494,
1706,
1707,
1788,
1789,
2024,
2025,
2128,
2129,
2145,
2146,
2590,
2591,
2724,
2725,
2738,
2739,
2888,
2889,
3047,
3048,
3186,
3187,
3203,
3204,
3564,
3565,
3856,
3857,
3881,
3882,
4292,
4293,
4385,
4386,
4640,
4641,
4656,
4657,
4857,
4858,
5153,
5154,
5758,
5759,
5774,
5775,
6282,
6283,
6290,
6291,
6439,
6440,
6520,
6521,
6547,
6548,
6550,
6551
],
"line_end_idx": [
24,
25,
156,
157,
559,
560,
728,
729,
826,
827,
841,
842,
1214,
1215,
1358,
1359,
1493,
1494,
1706,
1707,
1788,
1789,
2024,
2025,
2128,
2129,
2145,
2146,
2590,
2591,
2724,
2725,
2738,
2739,
2888,
2889,
3047,
3048,
3186,
3187,
3203,
3204,
3564,
3565,
3856,
3857,
3881,
3882,
4292,
4293,
4385,
4386,
4640,
4641,
4656,
4657,
4857,
4858,
5153,
5154,
5758,
5759,
5774,
5775,
6282,
6283,
6290,
6291,
6439,
6440,
6520,
6521,
6547,
6548,
6550,
6551,
6552
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6552,
"ccnet_original_nlines": 76,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43759286403656006,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011887069791555405,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15230311453342438,
"rps_doc_frac_unique_words": 0.30762410163879395,
"rps_doc_mean_word_length": 4.57446813583374,
"rps_doc_num_sentences": 59,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.06455135345459,
"rps_doc_word_count": 1128,
"rps_doc_frac_chars_dupe_10grams": 0.022868219763040543,
"rps_doc_frac_chars_dupe_5grams": 0.07480619847774506,
"rps_doc_frac_chars_dupe_6grams": 0.022868219763040543,
"rps_doc_frac_chars_dupe_7grams": 0.022868219763040543,
"rps_doc_frac_chars_dupe_8grams": 0.022868219763040543,
"rps_doc_frac_chars_dupe_9grams": 0.022868219763040543,
"rps_doc_frac_chars_top_2gram": 0.0201550405472517,
"rps_doc_frac_chars_top_3gram": 0.025775190442800522,
"rps_doc_frac_chars_top_4gram": 0.010852710343897343,
"rps_doc_books_importance": -518.3751220703125,
"rps_doc_books_importance_length_correction": -518.3751220703125,
"rps_doc_openwebtext_importance": -319.4173889160156,
"rps_doc_openwebtext_importance_length_correction": -319.4173889160156,
"rps_doc_wikipedia_importance": -131.81790161132812,
"rps_doc_wikipedia_importance_length_correction": -131.81790161132812
},
"fasttext": {
"dclm": 0.021967889741063118,
"english": 0.9317376613616943,
"fineweb_edu_approx": 1.815170407295227,
"eai_general_math": 0.33352768421173096,
"eai_open_web_math": 0.09841685742139816,
"eai_web_code": 0.6530109643936157
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
5,365,632,735,588,210,000 | How to Register a Supercell ID Account?
Please let me know that how to register a Supercell ID account. I am facing some issues while trying to register my id. If anyone knows then help me.
Aves
0 3 weeks ago 1 Ans 9582 Views Email Help
Reply
Answer Link
Open Answer 02 February 2024
How To Register a Supercell ID Account? (Complete Steps)
Supercell recently introduced a new account management system called Supercell ID. Now, players only need one game account for playing Supercell games on tabs, PCs and smartphones. The process to set up Supercell ID is quite simple.
You just need to enter the OTP sent to your email ID to log in. This is the easiest method to load games on different devices. A Supercell ID keeps your games safe and helps you stay connected.
After connecting your Supercell ID to your account, you will not be able to play games using your Google Play ID or Game Center account. Below we have mentioned the easy steps that you need to follow to register a Supercell ID account.
How to Create a Supercell ID Account to Save Your Game?
Step 1: Browse to the Supercell game's configurations. You will notice that the Supercell ID section is disconnected. Select "Disconnected" from the menu.
Step 2: Tap Register now next to the Supercell ID registration screen.
Step 3: Click Continue.
Step 4: The email which was used to generate the Supercell ID must be entered next. Tap Register after selecting I want to get news updates from Supercell.
Step 5: The confirmation number that was given in your email will then be needed for you.
You should look under Categories > Promotions to discover this Supercell mail because it won't be included in the standard mail. Write this 6-digit code into the confirmation window to join Supercell ID when you notice which mail is entered. Register Supercell ID with 6-digit code behind this is the mail that has been sent.
If this text appears, you have to register a Supercell ID account.
The Supercell ID account page now displays the green Connected button whenever you access the Settings menu.
One thing to keep in mind while utilizing this Supercell ID account is that it cannot be used by anybody else. It will be hard to delete your Supercell ID account from their device after they input it. You can utilize your own Supercell game account without connecting to any of your email accounts by following all the above steps to register a Supercell ID account.
Important Points to Supercell ID Register Setup
• Please note that you should not be providing your Supercell ID to anyone else because if the other person links your Supercell ID to his gaming account then it won’t be easy to remove your Supercell ID from his gaming account.
• Once you activate your specific Supercell ID register setup you will not be required to link your gaming account with any other external email ID.
Write your answer for "How to Register a Supercell ID Account?"
Chat with
Technical
Experts | {
"url": "https://www.technicalsupporthub.com/how-to-register-a-supercell-id-account",
"source_domain": "www.technicalsupporthub.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "114418",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XQSBXCYGEWDSTT3DRXQKMD35TVC6HUXC",
"WARC-Concurrent-To": "<urn:uuid:e6b8f515-2819-4d43-b886-f680445196cb>",
"WARC-Date": "2024-02-27T03:50:03Z",
"WARC-IP-Address": "75.119.138.168",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:X4XBYHLT7G676UKW5Z67HS3BYZX32IIL",
"WARC-Record-ID": "<urn:uuid:d8ecd9d9-e716-4b9e-954d-f4f403bd7f19>",
"WARC-Target-URI": "https://www.technicalsupporthub.com/how-to-register-a-supercell-id-account",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6cfff0e8-0a95-4daa-8bea-73fd83410969>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-88\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
40,
41,
191,
192,
197,
198,
242,
248,
260,
289,
290,
347,
348,
581,
582,
776,
777,
1013,
1014,
1070,
1071,
1226,
1227,
1298,
1299,
1323,
1324,
1480,
1481,
1571,
1572,
1898,
1899,
1966,
1967,
2076,
2077,
2445,
2446,
2494,
2495,
2728,
2879,
2880,
2944,
2945,
2955,
2965
],
"line_end_idx": [
40,
41,
191,
192,
197,
198,
242,
248,
260,
289,
290,
347,
348,
581,
582,
776,
777,
1013,
1014,
1070,
1071,
1226,
1227,
1298,
1299,
1323,
1324,
1480,
1481,
1571,
1572,
1898,
1899,
1966,
1967,
2076,
2077,
2445,
2446,
2494,
2495,
2728,
2879,
2880,
2944,
2945,
2955,
2965,
2972
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2972,
"ccnet_original_nlines": 48,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39721253514289856,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05574912950396538,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11846689879894257,
"rps_doc_frac_unique_words": 0.4244185984134674,
"rps_doc_mean_word_length": 4.600775241851807,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.726055145263672,
"rps_doc_word_count": 516,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09056445211172104,
"rps_doc_frac_chars_dupe_6grams": 0.09056445211172104,
"rps_doc_frac_chars_dupe_7grams": 0.05391744151711464,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.11583825200796127,
"rps_doc_frac_chars_top_3gram": 0.08340354263782501,
"rps_doc_frac_chars_top_4gram": 0.06402695924043655,
"rps_doc_books_importance": -231.71070861816406,
"rps_doc_books_importance_length_correction": -231.71070861816406,
"rps_doc_openwebtext_importance": -153.61868286132812,
"rps_doc_openwebtext_importance_length_correction": -153.61868286132812,
"rps_doc_wikipedia_importance": -96.67977905273438,
"rps_doc_wikipedia_importance_length_correction": -96.67977905273438
},
"fasttext": {
"dclm": 0.0311697106808424,
"english": 0.9178953170776367,
"fineweb_edu_approx": 1.1759194135665894,
"eai_general_math": 0.0007756900158710778,
"eai_open_web_math": 0.04625147953629494,
"eai_web_code": 0.044865429401397705
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
8,926,758,528,995,202,000 | Are dApps the future of software?
Written by Dan Parry.
October 4, 2021 5 Min Read
Are dApps the future of software?
Are dApps the future of software?
Codesphere
From everyone in the Codesphere Team:)
Table of Contents
Written by Dan Parry.
DApps(Decentralised Applications) run on a decentralized network that is not owned or controlled by any single entity. A DApp will look and feel the same as any other app to the end user, but in contrast to normal applications, dApps exist and run on the blockchain. But why is this better? How do dApps work and why should they play a role in the future of software applications? Let’s start with how, and then it will make sense when we get to the why…
How do dApps work?
Just as any developer can write apps for the app store on Apple’s iOS, a developer can build a dApps on Ethereum’s blockchain infrastructure. A dApps’s front end code and UI can be written in any language that can make calls to the back end but the back end is written on a decentralized peer to peer network, like Ethereum.
In most cases the code is also open source, meaning anyone in the community can view it and add to it. The users of dApps are also completely autonomous and free to govern themselves. This transparency and lack of any 3rd party ownership means dApps are generally considered much more secure and trustworthy than their company own counterparts.
DApps can only be built on Smart Contract Networks. A Smart Contract, in short, is an agreement written in code that is both immutable and distributed so there is no room for human error or outside interference.
They are also Open-source, meaning anyone can view the code, eliminating any dispute of its meaning or interpretation. A Smart contract is programmed to complete a certain action and once the conditions of the contract are met, it will carry out that action no matter what. This rigid simplicity makes them fool proof and ironclad.
A Smart contract network is simply a blockchain platform that is compatible with smart contracts. Thanks to Ethereum’s language Solidity, users are able to create smart contracts on the Ethereum network, making it perhaps the best platform to create dApps. The Bitcoin blockchain, in comparison, was built to only accept the sending of its native coin, and so cannot run dApps.
To address the common misconception here, Ethereum is not a cryptocurrency, it is a blockchain platform that allows for things to be built onto it. It also happens to have a native coin — Ether.
DApps are also Censorship-resistant, meaning they don’t answer to any one person or organization of any kind. The code was written to serve a specific purpose and when the smart contract is triggered, it will carry it out. While there are some obvious pros and cons to this unstoppability, for things like DeFi Apps (decentralised finance apps), removing the ability of a 3rd party to control your money or interfere with it in any way is the whole point.
Advantages of DApps
Being decentralised, dApps have no central control and no single point of failure, meaning they never go offline. Running on the blockchain means a dApp is being run by many hundreds of thousands of devices at any given time and only a failure of every device would cause the app to be offline. This is a luxury centralized applications don’t have, because if the servers go down for, say, all Facebook owned sites, the user has no choice but to wait until they are fixed. This also makes dApps far more resistant to attacks than single-server applications meaning any data stored there is safer by default.
Using a dApp doesn’t require you to hand over your personal information to use. The unfortunate majority of apps require you to agree to a data policy and hand over some level of your personal information for their use. Whether it’s your location, personal details, or contacts, there is usually a requirement expected.
Whether the company collecting the data will misuse it is far beyond the point in today’s climate and there is an ever-growing cry for apps that deliver us great services without the cost of our data. The removal of the 3rd party interest removes the ability for any entity to collect and abuse the user’s data.
Disadvantages of dApps
There is a reason dApps haven’t taken over the market just yet. While they do hint at a future in which we as consumers no longer need to answer to corporations, the tech is still relatively new and there are some growing pains that still need to be addressed.
User base is the first of the double-edged swords dApps are working with. Being run by their user base gives many of the advantages we discussed earlier, but it also means that a lack of the user base leaves the app without enough nodes to operate to its full potential. Accessibility also plays a role in this, dApps are not as easy to sign up for and start using as any given app you might find on the app store in your phone. They require a dApp supported browser to run. DApps are also hard to fix bugs in and developers need to pay the gas fee to push the code. So development, in general, can be much slower.
Are DApps the future?
There is no question that dApps represents a positive alternative to the current status quo, but it seems there is a mountain to climb before we see any real mainstream adoption. This is in no small part due to the enormity of what dApps propose to replace. For decentralized applications to be the norm would require a huge paradigm shift from where we currently are and there isn’t much incentive for big players in the space to support it.
Similar to how the world saw electric cars in the ’90s, dApps are for sure better on paper, the concept is undoubtedly sound, but there are still a few too many kinks to work out before we can all expect to be using them. They are the future, but it depends entirely on what your timeline is for that future.
The infrastructure is still not in place to support a large-scale migration to dApps. They are still too inaccessible, too complex and the problems they solve are not big enough, yet. So in the short term, no dApps are not likely to be the next big thing.
Some day, however, and I won’t venture to predict exactly when the world will be ready to adopt them wholesale, but eventually, decentralization is very likely going to be the way to go.
Agree with our take? Let us know down below!
Happy coding from your friends at Codesphere, the next-generation cloud provider.
About the Author
Are dApps the future of software?
Codesphere
From everyone in the Codesphere Team:)
We are building the next generation of Cloud, combining Infrastructure and IDE in one place, enabling a seamless DevEx and eliminating the need for DevOps specialists.
More Posts | {
"url": "https://codesphere.com/articles/are-dapps-the-future-of-software",
"source_domain": "codesphere.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "62530",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:36PNMO24V75JBY3ZSG5GH7BASQRXPQ4A",
"WARC-Concurrent-To": "<urn:uuid:4498e6b3-f607-474a-b101-f349381ed92f>",
"WARC-Date": "2024-03-02T14:13:51Z",
"WARC-IP-Address": "172.66.43.117",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QWSGH7LNVFKCLB5ZRR2RKL7JMEAJCD7P",
"WARC-Record-ID": "<urn:uuid:901f64e7-3ed2-4610-abc4-8aea0550f74c>",
"WARC-Target-URI": "https://codesphere.com/articles/are-dapps-the-future-of-software",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e12d4cea-f7f1-48f8-ba7f-633dcfbfff32>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-78\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
34,
35,
57,
58,
85,
119,
153,
154,
165,
166,
205,
206,
224,
225,
247,
248,
703,
704,
723,
724,
1049,
1050,
1395,
1396,
1608,
1609,
1941,
1942,
2320,
2321,
2516,
2517,
2973,
2974,
2975,
2995,
2996,
3604,
3605,
3925,
3926,
4238,
4239,
4240,
4263,
4264,
4525,
4526,
5141,
5142,
5143,
5165,
5166,
5609,
5610,
5919,
5920,
6176,
6177,
6364,
6365,
6366,
6411,
6412,
6494,
6495,
6512,
6513,
6547,
6548,
6559,
6560,
6599,
6600,
6768,
6769
],
"line_end_idx": [
34,
35,
57,
58,
85,
119,
153,
154,
165,
166,
205,
206,
224,
225,
247,
248,
703,
704,
723,
724,
1049,
1050,
1395,
1396,
1608,
1609,
1941,
1942,
2320,
2321,
2516,
2517,
2973,
2974,
2975,
2995,
2996,
3604,
3605,
3925,
3926,
4238,
4239,
4240,
4263,
4264,
4525,
4526,
5141,
5142,
5143,
5165,
5166,
5609,
5610,
5919,
5920,
6176,
6177,
6364,
6365,
6366,
6411,
6412,
6494,
6495,
6512,
6513,
6547,
6548,
6559,
6560,
6599,
6600,
6768,
6769,
6779
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6779,
"ccnet_original_nlines": 76,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4745011031627655,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005912790074944496,
"rps_doc_frac_lines_end_with_ellipsis": 0.012987010180950165,
"rps_doc_frac_no_alph_words": 0.10643015801906586,
"rps_doc_frac_unique_words": 0.39546599984169006,
"rps_doc_mean_word_length": 4.553316593170166,
"rps_doc_num_sentences": 61,
"rps_doc_symbol_to_word_ratio": 0.0007390999817289412,
"rps_doc_unigram_entropy": 5.388300895690918,
"rps_doc_word_count": 1191,
"rps_doc_frac_chars_dupe_10grams": 0.025078369304537773,
"rps_doc_frac_chars_dupe_5grams": 0.035035960376262665,
"rps_doc_frac_chars_dupe_6grams": 0.035035960376262665,
"rps_doc_frac_chars_dupe_7grams": 0.025078369304537773,
"rps_doc_frac_chars_dupe_8grams": 0.025078369304537773,
"rps_doc_frac_chars_dupe_9grams": 0.025078369304537773,
"rps_doc_frac_chars_top_2gram": 0.011801590211689472,
"rps_doc_frac_chars_top_3gram": 0.010141990147531033,
"rps_doc_frac_chars_top_4gram": 0.015673980116844177,
"rps_doc_books_importance": -505.6537780761719,
"rps_doc_books_importance_length_correction": -505.6537780761719,
"rps_doc_openwebtext_importance": -308.5162353515625,
"rps_doc_openwebtext_importance_length_correction": -308.5162353515625,
"rps_doc_wikipedia_importance": -211.12637329101562,
"rps_doc_wikipedia_importance_length_correction": -211.12637329101562
},
"fasttext": {
"dclm": 0.343666136264801,
"english": 0.9576332569122314,
"fineweb_edu_approx": 2.1607508659362793,
"eai_general_math": 0.23382169008255005,
"eai_open_web_math": 0.09632492065429688,
"eai_web_code": 0.3620060086250305
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "13",
"label": "News (Org.)"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
4,764,672,972,640,672,000 | Click here to Skip to main content
13,861,061 members
Click here to Skip to main content
Add your own
alternative version
Stats
74.4K views
1.4K downloads
38 bookmarked
Posted 21 Apr 2005
Licenced CPOL
Unicode compliant multilingual word breaker
, 21 Apr 2005
Rate this:
Please Sign up or sign in to vote.
A simple but effective multilingual word breaker for use with text retrieval systems.
Introduction
This article will show a method for breaking input Unicode text into separate words. It also will show an effective method of dealing with languages such as Chinese, Korean, Japanese etc. that do not have a concept of "words" without resorting to complex dictionary / linguistic analysis methods.
Finally some tips for using this in a real world application will be presented.
Background
I am currently working on a business application that must provide a way for users to quickly search for and retrieve information that they have previously entered. Because our application is fully internationalized and globalized, the document indexing and retrieval must support globalization as well.
In our application there are two tables in a SQL Server database, one contains a dictionary of unique words indexed to date and the other contains a cross reference between the word and the document it was originally indexed from. When a new record is entered, it is indexed immediately and the dictionary and index are updated immediately by the same stored procedure that saves the record. This means a user can search immediately at one workstation for something a user had just entered at another.
The input search term is broken apart into words using the same method as the original documents were broken to create the dictionary and index. A SQL query then looks for all documents that contain all the search terms and returns a list of matching documents so the user can open the original document.
I had originally considered the Indexing service built into SQL Server 2005 however it is very limited when working with multiple languages at once, and can not be indexed on the fly as in our application so has to schedule lengthy indexing operations which means users can not search for data just entered previously etc. I then considered using the Microsoft indexing service itself since it's built into all modern versions of Windows. However, it isn't ideal as it also involves some work to ensure it works with every specific language the user needs to support, and there were some questions as to the legality of using it in our own application despite parts of it being the Windows base service API and after a month of not hearing back from Microsoft Legal I have given up on that avenue. What I needed is something simple and effective enough to do the job.
The problem
On the surface it seems easy and you may have implemented this yourself when dealing with English language text: just go over the input text, split out the words by finding the boundaries between them (whitespace, punctuation etc.).
There are several problems with this approach when indexing non-English text:
1. Some languages do not have a concept of a "word" hence no whitespace or punctuation exists to determine word boundaries (Chinese, Japanese, Korean, etc.).
2. In many languages, one or more Unicode characters may make up what the user thinks of as a character or basic unit of the language.
3. Some languages are entered from right to left and must be handled accordingly.
The problem seemed overwhelmingly complex and time consuming: Just the sort of thing that 3rd party components were invented for! However after doing some research, it appears that there is no solution that is small, flexible and not prohibitively expensive. Most solutions revolve around complex word stemming and dictionary matching methods which means that you have to force your users to install a language specific component of quite a large size. It also means that quite a significant investment needs to be made in every language you intend to sell in. This wouldn't work for our application because it is intended to be inexpensive and multi-lingual in a dynamic manner meaning more than one user can be using the same database in different languages at the same time.
I have written a solution that appears to do the job. In the ideal world, it would be perfect, but this world is not ideal so any feedback and suggestions would be gratefully appreciated.
The solution
I won't show any examples of the WordBreaker class source code here because the code is simple, straightforward and well commented, however the techniques are interesting and useful to know:
The right to left issue and the issue with more than one Unicode character being used to represent what the user sees as a single character are both easily solved by the TextElementEnumerator in the System.Globalization class. This handy class will properly iterate through the source text returning each text element. It returns text elements in the correct order depending upon whether the source text is right to left or left to right and it understands the concept of a series of Unicode characters representing a single visual grapheme character as the reader sees it.
The most insurmountable obstacle to making our own solution appeared to be the languages without word boundaries, however after doing some research on the subject, it appears that there is a solution called n-gram or overlapping indexing that is in use and works effectively.
The premise is that since you can't identify the boundaries between Chinese "words" (for example), what you can do is index every second character in an overlapping scheme. For example: if the input text is "C1C2C3C4" (c1 being one Chinese character, c2 another etc.) you break it apart as: "C1C2", "C2C3","C3C4" etc. This works because when the user enters their search term you break it apart similarly. The downside is of course that your index of words is going to be much larger, however you do not need to provide a dictionary and word stemming / linguistic analysis, so in the end the tradeoff may not be bad at all.
There is a good paper on the Microsoft Research website (a lot of good stuff there): "On the use of Words and N-grams for Chinese Information Retrieval" on the n-gram method I use as well as the more advanced methods. The paper indicates that the n-gram method I'm using is as effective as other methods with the downside of the larger time it takes to index (they are basing their paper on an app that indexes all the documents all at once), however since in our app we index on the fly during a save or update, the time delay is negligible. The other downside is of course the size of the dictionary being much larger than indexing Latin text, however in our app there are typically not enough documents with unique words to make much difference either way.
This n-gram breaking is simply accomplished by scrolling a moving "window" over the text in question. The only tricky parts are spotting a boundary between Latin text and CJK text -- it is common for CJK text to contain Latin text within it and we want to ensure that we break apart the Latin text using the more appropriate process of spotting word boundaries. This is solved by looking for characters in the sub 256 decimal Unicode range. This ensures that we catch not only standard Latin characters but extended Latin as well to cover languages other than English that use the extended Latin-1 Unicode block (Spanish, French, Croatian etc.) for Latin characters with Acute, Circumflex, Grave etc. accents.
Using the code
The word breaker is implemented as a static function Break in the class WordBreaker:
public static string Break(bool breakStyleCJK,
bool returnAsXml, params string[] text)
Parameters
• breakStyleCJK - uses rolling overlap 2 n-gram method of breaking the text. If Latin characters are encountered they will be broken using punctuation and spacing as full words.
• returnAsXml - returns the resulting list of unique words as a fragment of XML suitable for passing to a SQL Server stored procedure or whatever you have. If false it will return words as comma delimited strings.
• text - a series of 1 to * strings to be broken.
• Returns - a string containing either a fragment of XML or a series of comma delimited strings.
If the return as XML method is chosen the XML looks like this:
<Items>
<i w="hello" />
<i w="break" />
<i w="text" />
</Items>
Real world implementation
I thought it might be helpful to include some bits and pieces that tie this into a real world application. As stated previously, we use a SQL Server database for persistent storage.
There are two tables used for the searching and indexing: a dictionary table and a key table. The dictionary table contains two columns, one for each word indexed with a unique constraint on it so that no word will be stored more than once and a second column containing a unique ID number for that word.
The index table is the cross reference between the dictionary and the documents that are indexed. In our case, it contains three fields, one for the word ID, one for the source object ID and a third to indicate the type of source object for easy retrieval later on.
Here is an example of a stored procedure that can take the XML generated by the word breaker and insert those words into a dictionary / index, it is called by the stored procedure that saves / updates a business object and the business object level code generates the keyword XML by passing all string fields to the word breaker and then passing on the result of the wordbreak as a ntext parameter. The business object saving / updating stored procedure in turn calls this procedure passing off the keyword XML and the info that uniquely identifies the source object:
/*
Created XXXXXX
Coded by: John
Object: _ProcessKeywords utility sp.
Purpose: Storing keywords for search
Last update: XXXXX
Takes as input an XML fragment formatted like this:
<Items>
<i w="firstword" />
<i w="secondword" />
<i w="etcetc" />
</Items>
Extracts the words and inserts them into the search dictionary table
A constraint on the SearchDictionary table ensures only new words are added
Then the RootObject ID and Type along with the words dictionary ID value
are inserted into the SEarchKey table for later retrieval during a search
RootobjectID and type are used to uniquely identify the source document.
*/
ALTER PROCEDURE dbo._ProcessKeywords
(
@KWXML ntext,
@RootObjectID uniqueidentifier,
@RootObjectType smallint,
@ClearExistingIndex smallint = 0
)
AS
SET NOCOUNT ON
IF DATALENGTH(@KWXML)<1
RETURN
--Clear out any previous indexes for this object id and type in the
--SearchKey table
--This ensures any words that no longer appear in the source document
--are not left hanging around in an old index of that document
IF @ClearExistingIndex = 1
DELETE FROM dbo._SearchKey WHERE (_SourceObjectID=@RootObjectID AND
_SourceObjectType=@RootObjectType)
DECLARE @hDoc int --Handle to xml parser document
DECLARE @word nvarchar(255) --Max 255 characters are indexed
DECLARE @_srchid uniqueidentifier
EXEC dbo.sp_xml_preparedocument @hDoc output, @KWXML
--Declare a cursor that will be used to loop through the
--wordlist xml items one by one
DECLARE wordlist CURSOR
FOR SELECT * FROM OPENXML(@hDoc,'/Items/i',1) WITH (w nvarchar(255))
FOR READ ONLY
OPEN wordlist
FETCH wordlist into @word
--Loop through the XML word list
while(@@FETCH_STATUS=0)
BEGIN
--Insert the word into the dictionary
INSERT dbo._SearchDictionary (Word) values (@word)
--Get the word's ID value from the dictionary table
SET @_srchid = (SELECT ID FROM dbo._SearchDictionary
WHERE (Word = @word))
--Update the search key table with the source object id and word id
INSERT dbo._SearchKey (_WordID, _SourceObjectID, _SourceObjectType)
VALUES (@_srchid, @RootObjectID, @RootObjectType)
--Get the next word
FETCH wordlist into @word
END
--Cleanup cursor
CLOSE wordlist
DEALLOCATE wordlist
EXEC dbo.sp_xml_removedocument @hDoc
This gives us a dictionary full of words and an index. To search for documents, the user's search term is broken using the exact same method as the original document, then it's passed to a query used to find all documents that contain all the keywords (there are other ways of doing this, but for our purposes we only want to return matches that contain all words).
Let's say the user is searching for the phrase "almond pear avocado", that query would look like this:
SELECT dbo._SearchKey._SourceObjectID, dbo._SearchKey._SourceObjectType
FROM dbo._SearchDictionary INNER JOIN
dbo._SearchKey ON dbo._SearchDictionary.ID = dbo._SearchKey._WordID
WHERE (dbo._SearchDictionary.Word = N'almond') OR
(dbo._SearchDictionary.Word = N'pear') OR
(dbo._SearchDictionary.Word = N'avocado')
GROUP BY dbo._SearchKey._SourceObjectID, dbo._SearchKey._SourceObjectType
HAVING (COUNT(*) = 3)
Since the query is grouped by the source object's ID and type and OR is used with the keywords and we know that each keyword is indexed only once per source document, it will return a single result for each document that contains at least one occurrence of each of the keywords searched for. In this case there are three keywords, so there should be three results in each grouping of each document.
The resulting list of ID numbers can then be used to extract an excerpt to display to the user (coming in another article).
Remarks
Hopefully this will be of some use to others and I would appreciate any feedback towards improving it.
History
• 21st April, 2005: initially posted.
License
This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)
Share
About the Author
Member 96
Canada Canada
No Biography provided
You may also be interested in...
Comments and Discussions
QuestionHow to determine language Pin
Scott Elder26-May-10 8:19
memberScott Elder26-May-10 8:19
AnswerRe: How to determine language Pin
Member 9626-May-10 8:51
memberMember 9626-May-10 8:51
GeneralMy vote of 10 Pin
danielm928-Jan-10 4:25
memberdanielm928-Jan-10 4:25
GeneralRe: My vote of 10 Pin
Member 968-Jan-10 6:37
memberMember 968-Jan-10 6:37
GeneralMy vote of 1 Pin
Howard Richards29-Jan-09 23:10
memberHoward Richards29-Jan-09 23:10
GeneralRe: My vote of 1 Pin
David Pritchard21-Sep-09 1:55
memberDavid Pritchard21-Sep-09 1:55
GeneralRe: My vote of 1 Pin
Member 9621-Sep-09 5:58
memberMember 9621-Sep-09 5:58
GeneralThe 'word's you got in Chinese seemed to be not very meaningful to me. Pin
zwu_ca18-Apr-08 14:33
memberzwu_ca18-Apr-08 14:33
GeneralRe: The 'word's you got in Chinese seemed to be not very meaningful to me. Pin
Member 9618-Apr-08 16:28
memberMember 9618-Apr-08 16:28
GeneralThai language Pin
menn30006-Dec-07 20:29
membermenn30006-Dec-07 20:29
GeneralRe: Thai language Pin
Member 9618-Apr-08 16:31
memberMember 9618-Apr-08 16:31
Questionhow to convert english words into japanese Pin
doddamani praveen25-Jul-06 6:09
memberdoddamani praveen25-Jul-06 6:09
AnswerRe: how to convert english words into japanese Pin
Member 9625-Jul-06 9:53
memberMember 9625-Jul-06 9:53
GeneralRe: how to convert english words into japanese Pin
Paul Conrad25-Jul-06 10:21
professionalPaul Conrad25-Jul-06 10:21
GeneralRe: how to convert english words into japanese Pin
Rei Miyasaka6-Jan-08 12:26
memberRei Miyasaka6-Jan-08 12:26
GeneralHelp Pin
sreejith ss nair18-Sep-05 22:33
membersreejith ss nair18-Sep-05 22:33
GeneralRe: Help Pin
Member 9619-Sep-05 5:58
memberMember 9619-Sep-05 5:58
GeneralRe: Help Pin
sreejith ss nair20-Sep-05 20:30
membersreejith ss nair20-Sep-05 20:30
GeneralRe: Help Pin
Member 9621-Sep-05 6:13
memberMember 9621-Sep-05 6:13
GeneralJapanese Pin
Rei Miyasaka26-Apr-05 11:33
memberRei Miyasaka26-Apr-05 11:33
GeneralRe: Japanese Pin
Member 9626-Apr-05 15:50
memberMember 9626-Apr-05 15:50
GeneralRe: Japanese Pin
Rei Miyasaka26-Apr-05 23:10
memberRei Miyasaka26-Apr-05 23:10
GeneralRe: Japanese Pin
steblublu6-Jan-08 11:42
membersteblublu6-Jan-08 11:42
GeneralRe: Japanese Pin
Rei Miyasaka6-Jan-08 12:57
memberRei Miyasaka6-Jan-08 12:57
GeneralRe: Japanese Pin
steblublu7-Jan-08 6:56
membersteblublu7-Jan-08 6:56
General General News News Suggestion Suggestion Question Question Bug Bug Answer Answer Joke Joke Praise Praise Rant Rant Admin Admin
Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.
Permalink | Advertise | Privacy | Cookies | Terms of Use | Mobile
Web02 | 2.8.190214.1 | Last Updated 21 Apr 2005
Article Copyright 2005 by Member 96
Everything else Copyright © CodeProject, 1999-2019
Layout: fixed | fluid | {
"url": "https://www.codeproject.com/Articles/10183/Unicode-compliant-multilingual-word-breaker",
"source_domain": "www.codeproject.com",
"snapshot_id": "crawl=CC-MAIN-2019-09",
"warc_metadata": {
"Content-Length": "163639",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z6MDIVLC7AS7KDPQBWVYBTPITHAUBFLE",
"WARC-Concurrent-To": "<urn:uuid:2cf485ad-5856-4b16-bd7d-4fc191622f9c>",
"WARC-Date": "2019-02-16T15:19:36Z",
"WARC-IP-Address": "76.74.234.210",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FPE5FMQXQAHGCWBOAPEDPLQX5X753CIY",
"WARC-Record-ID": "<urn:uuid:a3913411-a490-4f65-b30b-5652c0fb0e62>",
"WARC-Target-URI": "https://www.codeproject.com/Articles/10183/Unicode-compliant-multilingual-word-breaker",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6c9c4d06-1793-4f74-8f45-e5da3bf16553>"
},
"warc_info": "isPartOf: CC-MAIN-2019-09\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-137-198-92.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
35,
54,
89,
102,
122,
123,
129,
130,
142,
157,
171,
190,
204,
205,
249,
250,
264,
275,
310,
396,
397,
410,
411,
708,
709,
789,
790,
801,
802,
1106,
1107,
1609,
1610,
1915,
1916,
2784,
2785,
2797,
2798,
3031,
3032,
3110,
3111,
3271,
3408,
3492,
3493,
4271,
4272,
4460,
4461,
4474,
4475,
4666,
4667,
5241,
5242,
5518,
5519,
6143,
6144,
6904,
6905,
7615,
7616,
7631,
7632,
7717,
7718,
7766,
7817,
7818,
7829,
7830,
8010,
8226,
8278,
8377,
8378,
8441,
8442,
8450,
8468,
8486,
8503,
8512,
8513,
8539,
8540,
8722,
8723,
9028,
9029,
9295,
9296,
9864,
9865,
9868,
9883,
9898,
9935,
9972,
9991,
9992,
10044,
10045,
10053,
10075,
10098,
10117,
10126,
10127,
10196,
10272,
10273,
10346,
10420,
10421,
10494,
10497,
10534,
10535,
10541,
10563,
10603,
10637,
10678,
10684,
10685,
10688,
10689,
10708,
10737,
10752,
10825,
10847,
10922,
10989,
11020,
11096,
11156,
11161,
11170,
11225,
11291,
11330,
11336,
11394,
11400,
11462,
11499,
11528,
11602,
11621,
11627,
11646,
11652,
11683,
11689,
11727,
11757,
11768,
11814,
11877,
11882,
11942,
12004,
12050,
12055,
12132,
12208,
12270,
12276,
12308,
12342,
12351,
12357,
12379,
12399,
12429,
12435,
12477,
12478,
12844,
12845,
12948,
12949,
13021,
13061,
13136,
13187,
13236,
13285,
13359,
13381,
13382,
13781,
13782,
13906,
13907,
13915,
13916,
14019,
14020,
14028,
14029,
14069,
14070,
14078,
14079,
14197,
14198,
14204,
14205,
14222,
14223,
14233,
14247,
14269,
14270,
14303,
14304,
14329,
14330,
14332,
14370,
14396,
14429,
14469,
14493,
14524,
14549,
14572,
14602,
14631,
14654,
14684,
14708,
14739,
14777,
14805,
14835,
14872,
14900,
14924,
14955,
15037,
15059,
15088,
15174,
15199,
15231,
15256,
15279,
15309,
15338,
15363,
15395,
15450,
15482,
15521,
15578,
15602,
15633,
15691,
15718,
15758,
15816,
15843,
15877,
15893,
15925,
15964,
15984,
16008,
16039,
16059,
16091,
16130,
16150,
16174,
16205,
16225,
16253,
16288,
16312,
16337,
16369,
16393,
16421,
16456,
16480,
16504,
16535,
16559,
16586,
16620,
16644,
16667,
16697,
16698,
16862,
16863,
16974,
16975,
17041,
17089,
17125,
17176
],
"line_end_idx": [
35,
54,
89,
102,
122,
123,
129,
130,
142,
157,
171,
190,
204,
205,
249,
250,
264,
275,
310,
396,
397,
410,
411,
708,
709,
789,
790,
801,
802,
1106,
1107,
1609,
1610,
1915,
1916,
2784,
2785,
2797,
2798,
3031,
3032,
3110,
3111,
3271,
3408,
3492,
3493,
4271,
4272,
4460,
4461,
4474,
4475,
4666,
4667,
5241,
5242,
5518,
5519,
6143,
6144,
6904,
6905,
7615,
7616,
7631,
7632,
7717,
7718,
7766,
7817,
7818,
7829,
7830,
8010,
8226,
8278,
8377,
8378,
8441,
8442,
8450,
8468,
8486,
8503,
8512,
8513,
8539,
8540,
8722,
8723,
9028,
9029,
9295,
9296,
9864,
9865,
9868,
9883,
9898,
9935,
9972,
9991,
9992,
10044,
10045,
10053,
10075,
10098,
10117,
10126,
10127,
10196,
10272,
10273,
10346,
10420,
10421,
10494,
10497,
10534,
10535,
10541,
10563,
10603,
10637,
10678,
10684,
10685,
10688,
10689,
10708,
10737,
10752,
10825,
10847,
10922,
10989,
11020,
11096,
11156,
11161,
11170,
11225,
11291,
11330,
11336,
11394,
11400,
11462,
11499,
11528,
11602,
11621,
11627,
11646,
11652,
11683,
11689,
11727,
11757,
11768,
11814,
11877,
11882,
11942,
12004,
12050,
12055,
12132,
12208,
12270,
12276,
12308,
12342,
12351,
12357,
12379,
12399,
12429,
12435,
12477,
12478,
12844,
12845,
12948,
12949,
13021,
13061,
13136,
13187,
13236,
13285,
13359,
13381,
13382,
13781,
13782,
13906,
13907,
13915,
13916,
14019,
14020,
14028,
14029,
14069,
14070,
14078,
14079,
14197,
14198,
14204,
14205,
14222,
14223,
14233,
14247,
14269,
14270,
14303,
14304,
14329,
14330,
14332,
14370,
14396,
14429,
14469,
14493,
14524,
14549,
14572,
14602,
14631,
14654,
14684,
14708,
14739,
14777,
14805,
14835,
14872,
14900,
14924,
14955,
15037,
15059,
15088,
15174,
15199,
15231,
15256,
15279,
15309,
15338,
15363,
15395,
15450,
15482,
15521,
15578,
15602,
15633,
15691,
15718,
15758,
15816,
15843,
15877,
15893,
15925,
15964,
15984,
16008,
16039,
16059,
16091,
16130,
16150,
16174,
16205,
16225,
16253,
16288,
16312,
16337,
16369,
16393,
16421,
16456,
16480,
16504,
16535,
16559,
16586,
16620,
16644,
16667,
16697,
16698,
16862,
16863,
16974,
16975,
17041,
17089,
17125,
17176,
17197
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 17197,
"ccnet_original_nlines": 309,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33520710468292236,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03402366861701012,
"rps_doc_frac_lines_end_with_ellipsis": 0.003225809894502163,
"rps_doc_frac_no_alph_words": 0.23106509447097778,
"rps_doc_frac_unique_words": 0.31097325682640076,
"rps_doc_mean_word_length": 5.168282508850098,
"rps_doc_num_sentences": 109,
"rps_doc_symbol_to_word_ratio": 0.000295859994366765,
"rps_doc_unigram_entropy": 5.892364978790283,
"rps_doc_word_count": 2579,
"rps_doc_frac_chars_dupe_10grams": 0.008102630265057087,
"rps_doc_frac_chars_dupe_5grams": 0.04929101839661598,
"rps_doc_frac_chars_dupe_6grams": 0.035486530512571335,
"rps_doc_frac_chars_dupe_7grams": 0.025133170187473297,
"rps_doc_frac_chars_dupe_8grams": 0.018230929970741272,
"rps_doc_frac_chars_dupe_9grams": 0.015304969623684883,
"rps_doc_frac_chars_top_2gram": 0.003376099979504943,
"rps_doc_frac_chars_top_3gram": 0.007502439897507429,
"rps_doc_frac_chars_top_4gram": 0.006302049849182367,
"rps_doc_books_importance": -1678.04248046875,
"rps_doc_books_importance_length_correction": -1678.04248046875,
"rps_doc_openwebtext_importance": -996.93017578125,
"rps_doc_openwebtext_importance_length_correction": -996.93017578125,
"rps_doc_wikipedia_importance": -795.8496704101562,
"rps_doc_wikipedia_importance_length_correction": -795.8496704101562
},
"fasttext": {
"dclm": 0.3585941791534424,
"english": 0.861649215221405,
"fineweb_edu_approx": 2.6550004482269287,
"eai_general_math": 0.1408395767211914,
"eai_open_web_math": 0.1481812596321106,
"eai_web_code": 0.08004617691040039
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-7,020,220,765,193,518,000 | Properties
Label 72.4.a
Level $72$
Weight $4$
Character orbit 72.a
Rep. character $\chi_{72}(1,\cdot)$
Character field $\Q$
Dimension $4$
Newform subspaces $4$
Sturm bound $48$
Trace bound $5$
Related objects
Downloads
Learn more
Defining parameters
Level: \( N \) \(=\) \( 72 = 2^{3} \cdot 3^{2} \)
Weight: \( k \) \(=\) \( 4 \)
Character orbit: \([\chi]\) \(=\) 72.a (trivial)
Character field: \(\Q\)
Newform subspaces: \( 4 \)
Sturm bound: \(48\)
Trace bound: \(5\)
Distinguishing \(T_p\): \(5\)
Dimensions
The following table gives the dimensions of various subspaces of \(M_{4}(\Gamma_0(72))\).
Total New Old
Modular forms 44 4 40
Cusp forms 28 4 24
Eisenstein series 16 0 16
The following table gives the dimensions of the cuspidal new subspaces with specified eigenvalues for the Atkin-Lehner operators and the Fricke involution.
\(2\)\(3\)FrickeDim.
\(+\)\(+\)\(+\)\(1\)
\(+\)\(-\)\(-\)\(1\)
\(-\)\(+\)\(-\)\(1\)
\(-\)\(-\)\(+\)\(1\)
Plus space\(+\)\(2\)
Minus space\(-\)\(2\)
Trace form
\( 4 q - 12 q^{5} - 24 q^{7} + O(q^{10}) \) \( 4 q - 12 q^{5} - 24 q^{7} + 72 q^{11} + 64 q^{13} - 132 q^{17} - 136 q^{19} + 48 q^{23} + 212 q^{25} - 60 q^{29} - 40 q^{31} + 384 q^{35} - 168 q^{37} - 84 q^{41} - 344 q^{43} - 768 q^{47} + 68 q^{49} + 372 q^{53} + 1744 q^{55} + 72 q^{59} - 584 q^{61} + 1080 q^{65} - 1240 q^{67} - 1584 q^{71} - 2048 q^{73} + 384 q^{77} + 1528 q^{79} + 1272 q^{83} + 2072 q^{85} - 468 q^{89} + 912 q^{91} - 1200 q^{95} + 800 q^{97} + O(q^{100}) \)
Decomposition of \(S_{4}^{\mathrm{new}}(\Gamma_0(72))\) into newform subspaces
Label Dim. \(A\) Field CM Traces A-L signs $q$-expansion
$a_{2}$ $a_{3}$ $a_{5}$ $a_{7}$ 2 3
72.4.a.a $1$ $4.248$ \(\Q\) None \(0\) \(0\) \(-16\) \(-12\) $-$ $+$ \(q-2^{4}q^{5}-12q^{7}-2^{6}q^{11}+58q^{13}+\cdots\)
72.4.a.b $1$ $4.248$ \(\Q\) None \(0\) \(0\) \(-14\) \(-24\) $+$ $-$ \(q-14q^{5}-24q^{7}+28q^{11}-74q^{13}+\cdots\)
72.4.a.c $1$ $4.248$ \(\Q\) None \(0\) \(0\) \(2\) \(24\) $-$ $-$ \(q+2q^{5}+24q^{7}+44q^{11}+22q^{13}+\cdots\)
72.4.a.d $1$ $4.248$ \(\Q\) None \(0\) \(0\) \(16\) \(-12\) $+$ $+$ \(q+2^{4}q^{5}-12q^{7}+2^{6}q^{11}+58q^{13}+\cdots\)
Decomposition of \(S_{4}^{\mathrm{old}}(\Gamma_0(72))\) into lower level spaces
\( S_{4}^{\mathrm{old}}(\Gamma_0(72)) \cong \) \(S_{4}^{\mathrm{new}}(\Gamma_0(6))\)\(^{\oplus 6}\)\(\oplus\)\(S_{4}^{\mathrm{new}}(\Gamma_0(8))\)\(^{\oplus 3}\)\(\oplus\)\(S_{4}^{\mathrm{new}}(\Gamma_0(9))\)\(^{\oplus 4}\)\(\oplus\)\(S_{4}^{\mathrm{new}}(\Gamma_0(12))\)\(^{\oplus 4}\)\(\oplus\)\(S_{4}^{\mathrm{new}}(\Gamma_0(18))\)\(^{\oplus 3}\)\(\oplus\)\(S_{4}^{\mathrm{new}}(\Gamma_0(24))\)\(^{\oplus 2}\)\(\oplus\)\(S_{4}^{\mathrm{new}}(\Gamma_0(36))\)\(^{\oplus 2}\) | {
"url": "https://www.lmfdb.org/ModularForm/GL2/Q/holomorphic/72/4/a/",
"source_domain": "www.lmfdb.org",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "91214",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HRGB6H3ZGBX5MHQ53HHWD6CD3SGPTENH",
"WARC-Concurrent-To": "<urn:uuid:3dc33e58-53dd-47e5-acd5-a3fed0c5c541>",
"WARC-Date": "2022-01-17T06:47:35Z",
"WARC-IP-Address": "35.241.19.59",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FDNSZJNJCWLQSZVANAM6QEWQ6DHX6KVT",
"WARC-Record-ID": "<urn:uuid:31227bf6-5e7a-429e-80be-03c7bd9e23a8>",
"WARC-Target-URI": "https://www.lmfdb.org/ModularForm/GL2/Q/holomorphic/72/4/a/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:500d4f93-62c6-4a52-9258-7752b1459806>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-21\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
11,
12,
25,
36,
47,
68,
104,
125,
139,
161,
178,
194,
195,
211,
212,
222,
223,
234,
235,
255,
256,
306,
336,
385,
409,
436,
456,
475,
505,
506,
517,
518,
608,
609,
623,
645,
664,
690,
691,
847,
848,
869,
890,
911,
932,
953,
974,
996,
997,
1008,
1009,
1489,
1490,
1569,
1570,
1627,
1663,
1785,
1901,
2013,
2134,
2135,
2215,
2216
],
"line_end_idx": [
11,
12,
25,
36,
47,
68,
104,
125,
139,
161,
178,
194,
195,
211,
212,
222,
223,
234,
235,
255,
256,
306,
336,
385,
409,
436,
456,
475,
505,
506,
517,
518,
608,
609,
623,
645,
664,
690,
691,
847,
848,
869,
890,
911,
932,
953,
974,
996,
997,
1008,
1009,
1489,
1490,
1569,
1570,
1627,
1663,
1785,
1901,
2013,
2134,
2135,
2215,
2216,
2691
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2691,
"ccnet_original_nlines": 64,
"rps_doc_curly_bracket": 0.07506503164768219,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10244988650083542,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02672605961561203,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7082405090332031,
"rps_doc_frac_unique_words": 0.6223021745681763,
"rps_doc_mean_word_length": 5.017985820770264,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.8916192054748535,
"rps_doc_word_count": 278,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1992831528186798,
"rps_doc_frac_chars_dupe_6grams": 0.1992831528186798,
"rps_doc_frac_chars_dupe_7grams": 0.16774193942546844,
"rps_doc_frac_chars_dupe_8grams": 0.11469534039497375,
"rps_doc_frac_chars_dupe_9grams": 0.11469534039497375,
"rps_doc_frac_chars_top_2gram": 0.014336920343339443,
"rps_doc_frac_chars_top_3gram": 0.017204299569129944,
"rps_doc_frac_chars_top_4gram": 0.028673840686678886,
"rps_doc_books_importance": -528.4693603515625,
"rps_doc_books_importance_length_correction": -528.4693603515625,
"rps_doc_openwebtext_importance": -336.6615295410156,
"rps_doc_openwebtext_importance_length_correction": -336.6615295410156,
"rps_doc_wikipedia_importance": -248.74911499023438,
"rps_doc_wikipedia_importance_length_correction": -248.74911499023438
},
"fasttext": {
"dclm": 0.21511220932006836,
"english": 0.37435382604599,
"fineweb_edu_approx": 1.3537685871124268,
"eai_general_math": 0.47379744052886963,
"eai_open_web_math": 0.976427435874939,
"eai_web_code": 0.01489776000380516
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "512.74",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "512.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "2",
"label": "Academic/Research"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-6,034,289,224,773,701,000 | subject
Matemática, 12.04.2017 02:45 daymano
Marcos quer dividir um conjunto de 40 moedas de um real em dois ou mais grupos de modo que cada grupo contenha o
mesmo número de moedas e que haja pelo menos duas moedas em cada grupo. essa divisão pode ser feita de quantos
modos diferentes?
a) 3.
b) 4.
c) 5.
d) 6.
e) 7.
Respostas
Respostas: 1
Outra pergunta: Matemática
question
Matemática, 15.08.2019 00:59
Me ajuda aí pessoal fazendo um favorzao*1)* calcule *x* e *y* que se tenha: {2x + y} = (3) 3x - y 17
Respostas: 1
question
Matemática, 15.08.2019 00:58
Após encontrar o resultado da potência (-5)³ e multiplicá-lo por -30,encontra-se a) 125. b) 225. c) -3750. d) 3750.
Respostas: 1
question
Matemática, 15.08.2019 00:56
05) para ser aprovado na primeira etapa de um concurso ocandidato deve ter um aprovetamento minimo de 70% do total de pontosda prova. essa prova tem o valor de 80 pontos da prova.quantos pontos, no minimo. rafael precisa fazer nessa prova para seraprovado? a) 10b) 24c) 56d)70
Respostas: 1
question
Matemática, 15.08.2019 00:51
Sabendo que o denominador de uma fração algébrica deve representar um número real8a +1 sobre 7+a , qual a condição para o valor real a? a) a diferente de 8b) a diferente de 7c) a igual a 7d) a igual a -7e) a diferente a -7
Respostas: 2
Você sabe a resposta certa?
Marcos quer dividir um conjunto de 40 moedas de um real em dois ou mais grupos de modo que cada grup...
Perguntas
question
História, 15.08.2019 01:09
question
Matemática, 15.08.2019 01:08
Perguntas no site: 13355567 | {
"url": "https://brainanswers.br.com/matematica/marcos-quer-dividir-um-conjunto-de-9073194",
"source_domain": "brainanswers.br.com",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "69860",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:73QBHZARBLP2QB65IM6Z5GCFTSEPUTME",
"WARC-Concurrent-To": "<urn:uuid:389944c4-e47f-4549-80df-aefa5541b7d8>",
"WARC-Date": "2020-08-13T03:08:33Z",
"WARC-IP-Address": "64.74.160.240",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4LIOSFBJVYPQOE2AVHMYKAA7LYTLDOIK",
"WARC-Record-ID": "<urn:uuid:4cbd789d-2c6f-449f-965d-5ce3081a4169>",
"WARC-Target-URI": "https://brainanswers.br.com/matematica/marcos-quer-dividir-um-conjunto-de-9073194",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a28f18c5-27b9-4cb7-9283-9df6afc96c38>"
},
"warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-39.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
8,
45,
46,
159,
270,
288,
294,
300,
306,
312,
318,
319,
329,
342,
343,
370,
371,
380,
409,
511,
524,
533,
562,
679,
692,
701,
730,
1008,
1021,
1030,
1059,
1283,
1296,
1324,
1428,
1438,
1447,
1474,
1483,
1512
],
"line_end_idx": [
8,
45,
46,
159,
270,
288,
294,
300,
306,
312,
318,
319,
329,
342,
343,
370,
371,
380,
409,
511,
524,
533,
562,
679,
692,
701,
730,
1008,
1021,
1030,
1059,
1283,
1296,
1324,
1428,
1438,
1447,
1474,
1483,
1512,
1539
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1539,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0.0012995499419048429,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10941475629806519,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0.024390239268541336,
"rps_doc_frac_no_alph_words": 0.42748090624809265,
"rps_doc_frac_unique_words": 0.5632184147834778,
"rps_doc_mean_word_length": 4.551723957061768,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.0025445299688726664,
"rps_doc_unigram_entropy": 4.652273178100586,
"rps_doc_word_count": 261,
"rps_doc_frac_chars_dupe_10grams": 0.12794612348079681,
"rps_doc_frac_chars_dupe_5grams": 0.22138047218322754,
"rps_doc_frac_chars_dupe_6grams": 0.12794612348079681,
"rps_doc_frac_chars_dupe_7grams": 0.12794612348079681,
"rps_doc_frac_chars_dupe_8grams": 0.12794612348079681,
"rps_doc_frac_chars_dupe_9grams": 0.12794612348079681,
"rps_doc_frac_chars_top_2gram": 0.07996632903814316,
"rps_doc_frac_chars_top_3gram": 0.11363635957241058,
"rps_doc_frac_chars_top_4gram": 0.07323232293128967,
"rps_doc_books_importance": -123.72569274902344,
"rps_doc_books_importance_length_correction": -112.18931579589844,
"rps_doc_openwebtext_importance": -101.46018981933594,
"rps_doc_openwebtext_importance_length_correction": -101.46018981933594,
"rps_doc_wikipedia_importance": -53.339630126953125,
"rps_doc_wikipedia_importance_length_correction": -40.00481033325195
},
"fasttext": {
"dclm": 0.9656431674957275,
"english": 0.005730750039219856,
"fineweb_edu_approx": 1.262557029724121,
"eai_general_math": 0.02348846010863781,
"eai_open_web_math": 0.6630421876907349,
"eai_web_code": 0.9460076093673706
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-7,170,507,561,605,630,000 | Permalink
Switch branches/tags
Nothing to show
Find file Copy path
Fetching contributors…
Cannot retrieve contributors at this time
164 lines (149 sloc) 6.21 KB
////////////////////////////////////////////////////////////////////////////////////////////////////
//// graphics.cfg
////////////////////////////////////////////////////////////////////////////////////////////////////
//// This and other files assembled by unsmell: https://github.com/unsmell/tf2-custom ////
////////////////////////////////////////////////////////////////////////////////////////////////////
//// graphics settings and tweaks
//// information about graphics largely pulled from https://github.com/mastercoms/mastercomfig/
////////////////////////////////////////////////////////////////////////////////////////////////////
echo <graphics>
// several comments below are in this format: ´#L999´
// this means they refer to this file:
// https://github.com/mastercoms/mastercomfig/blob/2e5ef5cf2d47ada938f778499c553a04cd27523a/config/mastercomfig/cfg/comfig.cfg
// simply add the ´#L999´ to the front of that URL and it will point you to where in the file I
// pulled the commands you`re reading.
// my stuff
mat_hdr_level 0 // no HDR
mat_motion_blur_enabled 0 // disable motion blur
mat_phong 1 // enable phong
r_rimlight 1 // rimlight makes it easier to see other players
r_3dsky 1 // enable 3d skybox
tf_particles_disable_weather 0 // disable weather effects
r_dynamic 1 // enable dynamic lighting
r_maxdlights 9 // reduce maximum dynamic lights
r_worldlightmin 0 // render all world lighting, no matter how insignificant it may be
r_shadows 1 // enable shadows
r_shadowrendertotexture 1 // sharper shadows
cl_blobbyshadows 0 // get sharper model shape based shadows
tracer_extra 1 // make bullet lines more visible, low performance impact
r_worldlights 2 // reduce maximum lights applied to a vertex
muzzleflash_light 1 // enable muzzle flash lights
cl_muzzleflash_dlight_1st 1 // enable muzzle flash lights in first person
r_WaterDrawReflection 1 // enable water reflections
r_renderoverlayfragment 1 // enable map image art
r_propsmaxdist 1 // lowest range for props
cl_detaildist 5 // ´detail prop´ distance
snd_spatialize_roundrobin 0 // spatialize every frame
dsp_facingaway 0 // disable the facing away DSP effect
dsp_water 0 // disable water muffling effect
snd_defer_trace 0 // immediately trace on the first frame
// particles
// #L477
cl_particle_batch_mode 1
mat_reduceparticles 1
cl_new_impact_effects 0
r_drawflecks 0
// texture filtering
//#L643
mat_trilinear 0
mat_forceaniso 1
// antialiasing (off)
// #L609
mat_aaquality 0
mat_alphacoverage 0
mat_software_aa_strength 0
mat_software_aa_strength_vgui 0;
// decals
// #L751
r_decals 96
mp_decals 96
r_decal_cullsize 20
r_decal_cover_count 4
r_decal_overlap_area 0.8
r_decal_overlap_count 3
// #L773
r_drawmodeldecals 1
r_maxmodeldecal 9
// allow sprays
// #L813
cl_allowdownload 1
cl_allowupload 1
r_spray_lifetime 2
cl_playerspraydisable 0
// no gibs
// #L834
cl_burninggibs 0
props_break_max_pieces 0
// props
// #L887
r_decalstaticprops 0
cl_phys_props_enable 0
r_drawdetailprops 0
r_staticprop_lod -1
// ragdolls
// #L915
cl_ragdoll_collide 0
cl_ragdoll_fade_time 15
cl_ragdoll_forcefade 0
cl_ragdoll_physics_enable 1
ragdoll_sleepaftertime 1
g_ragdoll_fadespeed 10000
g_ragdoll_lvfadespeed 10000
// textures
// #L971
mat_picmip 0
mat_filtertextures 0
mat_filtertextures 1
// ropes
// #L1033
rope_rendersolid 1
r_ropetranslucent 0
rope_solid_minalpha 0
rope_solid_minwidth 0.1
rope_smooth 0
rope_subdiv 1
rope_collide 0
rope_wind_dist 0
// ´optimization´
// #L1045
fps_max 240 // Prevent a possible memory leak with unlimited FPS using fps_max 0
// Also, some Source systems assume the FPS will not go above 300
// Finally, using 240 is a common multiple for monitor framerates,
// which is recommended for smoothness
mat_vsync 0 // Ensure VSync is disabled by default
engine_no_focus_sleep 0 // Do not limit FPS when the engine is not focused because
// the focus detection can be buggy on some systems or while
// streaming and may limit your FPS, without you knowing
//engine_no_focus_sleep 50 // Power savings while alt-tabbed out of TF2
r_fastzreject 1 // Renders first pass of a scene with a z-buffer on the CPU and
// then has the GPU quickly render the scene in a second pass,
// with the visible parts of the scene already calculated
r_entityclips 1 // Clip entities preferably using clip planes
disp_dynamic 0 // Do not use dynamic meshes for world geometry (displacements)
r_hunkalloclightmaps 1 // Allocate lightmaps in the hunk
r_frustumcullworld 1 // Cull on world draw
r_worldlistcache 1 // Cache some world rendering
mat_clipz 1 // Clips what is drawn for a performance improvement
mat_use_compressed_hdr_textures 1 // Use compressed HDR textures
r_occlusion 1 // Use CPU to have the GPU skip rendering models/props you cannot see
r_occludeemaxarea 40 // Skip occlusion of objects that are likely to be large enough to be visible
r_occluderminarea 2.5 // Skip occluders that are too small to be worth testing
r_occludermincount 2 // If our occlusion settings are too strict, try out some occluders
r_lightcache_zbuffercache 0 // Skip unused cache process
r_drawopaquestaticpropslast 0 // Use the newer rendering mode if possible
mat_tonemapping_occlusion_use_stencil 0 // Do not use stencil buffer for occlusion queries
//mat_tonemapping_occlusion_use_stencil 1 // Use stencil buffer for weak GPUs
host_flush_threshold 0 // Early finish to a Xbox 360 only flush task
r_norefresh 1 // Do not store a useless and unused frame time variable
fast_fogvolume 1 // Use a fast path method to find the visible fog volume
r_pixelfog 1 // Use a pixel shader for fog if possible
//r_pixelfog 0 // Do not use a higher level pixel shader for fog on weak GPUs
mat_compressedtextures 1 // Allow for compressed textures
mat_managedtextures 1 // Use Direct3D to manage textures, uses a bit more system memory
mat_mipmaptextures 1 // Mipmap textures to optimize textures
//nb_shadow_dist 200 // Do not use shadows from far away (NextBot system)
//nb_shadow_dist 0 // Disable shadow distance
//nb_shadow_dist 400 // Default distance for NextBot shadows
cl_ShowBoneSetupEnts 0 // Ensure this debug command is disabled
sv_alternateticks 0 // Run every tick
//sv_alternateticks 1 // Skip every other tick to reduce CPU usage | {
"url": "https://github.com/unsmell/tf2-custom/blob/master/configs/cfg/core/graphics.cfg",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "94009",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WXSI5DWSYI6GVVRJVCIPC5P7QLGBHJOV",
"WARC-Concurrent-To": "<urn:uuid:0d7475c0-7e48-4551-8abb-5d288fb86a2d>",
"WARC-Date": "2018-12-10T01:02:20Z",
"WARC-IP-Address": "192.30.253.113",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:55XZXTPFOYTZCRT4PE6UAPVQCN2ORVMQ",
"WARC-Record-ID": "<urn:uuid:61bc7598-ab3d-400a-b52c-74136c9d520b>",
"WARC-Target-URI": "https://github.com/unsmell/tf2-custom/blob/master/configs/cfg/core/graphics.cfg",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:756d97f8-73c9-43f0-b177-3315f5d33fcf>"
},
"warc_info": "isPartOf: CC-MAIN-2018-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-185-234-147.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
10,
31,
47,
67,
90,
132,
161,
262,
280,
381,
472,
573,
607,
703,
804,
820,
874,
913,
1040,
1136,
1175,
1187,
1213,
1262,
1290,
1352,
1382,
1440,
1479,
1527,
1613,
1643,
1688,
1748,
1821,
1882,
1932,
2006,
2058,
2108,
2151,
2193,
2247,
2302,
2347,
2405,
2418,
2427,
2452,
2474,
2498,
2513,
2534,
2542,
2558,
2575,
2597,
2606,
2622,
2642,
2669,
2702,
2712,
2721,
2733,
2746,
2766,
2788,
2813,
2837,
2846,
2866,
2884,
2900,
2909,
2928,
2945,
2964,
2988,
2999,
3008,
3025,
3050,
3059,
3068,
3089,
3112,
3132,
3152,
3164,
3173,
3194,
3218,
3241,
3269,
3294,
3320,
3348,
3360,
3369,
3382,
3403,
3424,
3433,
3443,
3462,
3482,
3504,
3528,
3542,
3556,
3571,
3588,
3606,
3616,
3697,
3763,
3830,
3869,
3920,
4003,
4064,
4121,
4193,
4273,
4336,
4394,
4456,
4535,
4592,
4635,
4684,
4749,
4814,
4898,
4997,
5076,
5165,
5222,
5296,
5387,
5465,
5534,
5605,
5679,
5734,
5812,
5870,
5958,
6019,
6093,
6139,
6200,
6264,
6302
],
"line_end_idx": [
10,
31,
47,
67,
90,
132,
161,
262,
280,
381,
472,
573,
607,
703,
804,
820,
874,
913,
1040,
1136,
1175,
1187,
1213,
1262,
1290,
1352,
1382,
1440,
1479,
1527,
1613,
1643,
1688,
1748,
1821,
1882,
1932,
2006,
2058,
2108,
2151,
2193,
2247,
2302,
2347,
2405,
2418,
2427,
2452,
2474,
2498,
2513,
2534,
2542,
2558,
2575,
2597,
2606,
2622,
2642,
2669,
2702,
2712,
2721,
2733,
2746,
2766,
2788,
2813,
2837,
2846,
2866,
2884,
2900,
2909,
2928,
2945,
2964,
2988,
2999,
3008,
3025,
3050,
3059,
3068,
3089,
3112,
3132,
3152,
3164,
3173,
3194,
3218,
3241,
3269,
3294,
3320,
3348,
3360,
3369,
3382,
3403,
3424,
3433,
3443,
3462,
3482,
3504,
3528,
3542,
3556,
3571,
3588,
3606,
3616,
3697,
3763,
3830,
3869,
3920,
4003,
4064,
4121,
4193,
4273,
4336,
4394,
4456,
4535,
4592,
4635,
4684,
4749,
4814,
4898,
4997,
5076,
5165,
5222,
5296,
5387,
5465,
5534,
5605,
5679,
5734,
5812,
5870,
5958,
6019,
6093,
6139,
6200,
6264,
6302,
6368
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6368,
"ccnet_original_nlines": 155,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21079429984092712,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030549900606274605,
"rps_doc_frac_lines_end_with_ellipsis": 0.00641026021912694,
"rps_doc_frac_no_alph_words": 0.3065173029899597,
"rps_doc_frac_unique_words": 0.557441234588623,
"rps_doc_mean_word_length": 6.054830074310303,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0.015274950303137302,
"rps_doc_unigram_entropy": 5.55801248550415,
"rps_doc_word_count": 766,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.010349290445446968,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01207416970282793,
"rps_doc_frac_chars_top_3gram": 0.005174640100449324,
"rps_doc_frac_chars_top_4gram": 0.00582147017121315,
"rps_doc_books_importance": -437.26324462890625,
"rps_doc_books_importance_length_correction": -437.26324462890625,
"rps_doc_openwebtext_importance": -238.49160766601562,
"rps_doc_openwebtext_importance_length_correction": -238.49160766601562,
"rps_doc_wikipedia_importance": -180.06951904296875,
"rps_doc_wikipedia_importance_length_correction": -180.06951904296875
},
"fasttext": {
"dclm": 0.07208120822906494,
"english": 0.4761568605899811,
"fineweb_edu_approx": 1.9530988931655884,
"eai_general_math": 0.30584537982940674,
"eai_open_web_math": 0.03241533041000366,
"eai_web_code": 0.530055820941925
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
9,139,001,612,707,837,000 | RASP Security: Everything There Is To Know {2023}
720
views
RASP Security : A security tool called Runtime Application Self Protection (RASP) was created expressly to provide tailored defense for apps. This solution makes use of the internal data and state of an application to efficiently identify possible security vulnerabilities during runtime that other security measures may have overlooked.
The RASP security technology is integrated into the application and starts working as soon as it is launched. In order to reduce the danger of exploiting vulnerabilities, the system is built to recognize and block any possible assaults on the application in real-time.
No matter where the application is located—on a server, virtual machine, container, or serverless function—the runtime application self-protection software seamlessly interacts with the runtime environment of the program and functions alongside the application.
By placing more focus on a single application than other cybersecurity measures, the RASP solution stands out from the competition. This particular focus allows for the provision of several security benefits:
1Contextual awareness:
Once a RASP solution detects a potential threat, it obtains supplementary contextual information regarding the present condition of the application and the impacted data and code. It helps in identifying the location of the vulnerability in the code and provides a clear understanding of how it can be exploited.
2Enhancing Application-Layer Attack Visibility:
RASP (Runtime Application Self-Protection) possesses extensive insight into the application layer due to its integration with a specific application. The acquisition of visibility, insight, and knowledge at the application layer can aid in the identification of a broader spectrum of potential attacks and vulnerabilities.
3Zero-Day Protection:
Although RASP has the capability to utilize signatures for attack identification, its detection approach is not restricted to signature-based methods. RASP has the capability to detect and prevent zero-day attacks by promptly identifying and addressing any anomalous behaviors within the safeguarded application.
4Reduce The Occurrence Of False Positives:
The Runtime Application Self-Protection (RASP) technology possesses a comprehensive understanding of an application’s internal workings, enabling it to analyze the impact of a potential attack on the application’s execution. This significantly enhances the capability of RASP to distinguish genuine attacks, which have a genuinely negative impact on application performance and security, from false positives. The decrease in false positives results in a reduction of workload for security teams, allowing them to concentrate on authentic threats.
5Reduce Capital Expenditures And Operational Expenditures:
The RASP technology has been engineered to facilitate seamless deployment while effectively mitigating an application’s susceptibility to security breaches and minimizing the occurrence of false positive alerts. This integration results in a reduction of both initial capital expenditures (CapEx) and ongoing operational expenditures (OpEx) when compared to the manual application of patches and the use of web application firewalls (WAFs) for effective application protection.
RASP operates on application insights rather than relying on traffic rules, learning algorithms, or blacklists, thereby facilitating easy maintenance.
6Flexible Deployment:
Although RASP is usually founded on HTML standards, it can be readily customized to function with diverse standards and application architectures through its API. This feature allows for the safeguarding of non-web applications through the utilization of established protocols such as XML and RPC.
7Cloud Support Services:
The RASP solution is specifically designed to seamlessly integrate with and be deployed as an integral component of the application it safeguards. This feature allows for deployment in various locations where the protected applications can operate, including cloud-based environments.
8Seamless Integration:
RASP solutions are specifically designed for seamless integration into a DevOps continuous integration and deployment (CI/CD) pipeline. This feature facilitates the deployment of RASP and enables support for DevSecOps operations.
9Use Cases for Runtime Application Self-Protection (RASP)
The flexibility of RASP allows for seamless integration with a wide range of applications by developers. However, there are certain use cases for RASP that are more prevalent, such as:
Protection for Web Applications:
Web applications and APIs are critical elements of an organization’s infrastructure. However, they are susceptible to various forms of attacks. These applications are accessible via the public Internet and are frequently susceptible to exploitable vulnerabilities. By implementing Runtime Application Self-Protection (RASP) to safeguard the applications and APIs, an enterprise can effectively mitigate cybersecurity threats and reduce the attack surface of its web-based infrastructure.
Prevention of Zero-Day Vulnerabilities:
Although an organization may have established protocols to promptly implement patches for crucial applications and systems, the application of a patch is contingent upon its development and release.
Protection of Cloud Applications:
The process of securing the cloud can be intricate due to the fact that applications operate on a rented infrastructure that is situated beyond the perimeter of the organization’s network. The integration of RASP into these applications offers a considerable level of security in a portable and infrastructure-agnostic format.
10Here are some compelling reasons why one should consider the importance of RASP security:
The utilization of RASP technology enhances the security of an application by means of monitoring inputs and obstructing any that may potentially facilitate attacks. Additionally, it serves to safeguard the runtime environment against unauthorized modifications and interference.
Runtime Application Self-Protection (RASP) mitigates the risk of exploitation. The system is capable of detecting various forms of malicious activity, including but not limited to SQL injection, vulnerabilities, and bots, by intercepting all types of traffic. The system has the capability to terminate a user’s session upon detection of a security threat. Additionally, it has the capability to notify security personnel.
The RASP security has the capability to be directly integrated into the application. It is convenient for developers to deploy and inherently capable of monitoring application behavior and implementing self-protection. The system effectively mitigates attacks by accurately distinguishing them from legitimate requests, thereby minimizing false positives.
When RASP is implemented correctly, the application is designed to provide self-protection. This is beneficial for the security team as it allows security engineers to focus solely on reported issues.
11Conclusion of RASP Security:
The rasp security is a security solution that provides protection to a specific application, as opposed to a comprehensive network-level or endpoint-level defense mechanism. The deployment location that has been selected enables RASP to effectively monitor the inputs, outputs, and internal state of the application it is safeguarding. Through the deployment of RASP, developers are able to detect vulnerabilities present within their applications. Furthermore, the Runtime Application Self-Protection (RASP) solution has the capability to prevent any attempts to exploit vulnerabilities that may exist in the deployed applications. | {
"url": "https://www.newsorator.com/rasp-security/",
"source_domain": "www.newsorator.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "118075",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RMICWLRXYA65QCIQGGPSA5MSEZ6ZBI2L",
"WARC-Concurrent-To": "<urn:uuid:526777f9-177e-469f-b44c-a45e175199c8>",
"WARC-Date": "2023-09-26T15:17:46Z",
"WARC-IP-Address": "191.101.104.189",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VDOHH5D3OLKOQL5YKTV66UR4AYQHG6C3",
"WARC-Record-ID": "<urn:uuid:a720de3e-5570-458c-b207-377fabd62dea>",
"WARC-Target-URI": "https://www.newsorator.com/rasp-security/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d3861a7d-0424-4310-85b8-3c6dc257af62>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-16\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
54,
55,
63,
73,
74,
416,
417,
690,
691,
957,
958,
1171,
1172,
1199,
1200,
1517,
1518,
1570,
1571,
1898,
1899,
1925,
1926,
2243,
2244,
2291,
2292,
2844,
2845,
2908,
2909,
3391,
3392,
3547,
3548,
3574,
3575,
3877,
3878,
3907,
3908,
4197,
4198,
4225,
4226,
4460,
4461,
4523,
4524,
4713,
4714,
4751,
4752,
5244,
5245,
5289,
5290,
5493,
5494,
5532,
5533,
5864,
5865,
5961,
5962,
6246,
6247,
6674,
6675,
7035,
7036,
7241,
7242,
7277,
7278
],
"line_end_idx": [
54,
55,
63,
73,
74,
416,
417,
690,
691,
957,
958,
1171,
1172,
1199,
1200,
1517,
1518,
1570,
1571,
1898,
1899,
1925,
1926,
2243,
2244,
2291,
2292,
2844,
2845,
2908,
2909,
3391,
3392,
3547,
3548,
3574,
3575,
3877,
3878,
3907,
3908,
4197,
4198,
4225,
4226,
4460,
4461,
4523,
4524,
4713,
4714,
4751,
4752,
5244,
5245,
5289,
5290,
5493,
5494,
5532,
5533,
5864,
5865,
5961,
5962,
6246,
6247,
6674,
6675,
7035,
7036,
7241,
7242,
7277,
7278,
7914
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7914,
"ccnet_original_nlines": 75,
"rps_doc_curly_bracket": 0.00025271999766118824,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3447999954223633,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.031199999153614044,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12479999661445618,
"rps_doc_frac_unique_words": 0.3949343264102936,
"rps_doc_mean_word_length": 6.106003761291504,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.224117279052734,
"rps_doc_word_count": 1066,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.025195879861712456,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.025810420513153076,
"rps_doc_frac_chars_top_3gram": 0.034413889050483704,
"rps_doc_frac_chars_top_4gram": 0.01659240946173668,
"rps_doc_books_importance": -551.1265258789062,
"rps_doc_books_importance_length_correction": -551.1265258789062,
"rps_doc_openwebtext_importance": -277.1427001953125,
"rps_doc_openwebtext_importance_length_correction": -277.1427001953125,
"rps_doc_wikipedia_importance": -213.30184936523438,
"rps_doc_wikipedia_importance_length_correction": -213.30184936523438
},
"fasttext": {
"dclm": 0.22030985355377197,
"english": 0.9261292219161987,
"fineweb_edu_approx": 1.9942941665649414,
"eai_general_math": 0.6150102615356445,
"eai_open_web_math": 0.4055379629135132,
"eai_web_code": 0.39440441131591797
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
7,546,638,605,979,683,000 | Always getting readytostream false
We are uploading video through file or url but it’s giving success response with readytostream false. And when we click on any of the hls or dash file then it’s says manifest not found. but preview works perfectly. We need hls or dash in outputPlease show some guidance
Here is the sample response which we get.
{
“result”: {
“uid”: “90222ad8d19c40e3a147dc7d1b94c0ff”,
“thumbnail”: “perfect”,
“thumbnailTimestampPct”: 0,
“readyToStream”: false,
“status”: {
“state”: “queued”
},
“meta”: {
“name”: “34795644_633106457031375_2515853649138585095_n.mp4”
},
“created”: “2020-08-14T16:43:02.53133Z”,
“modified”: “2020-08-14T16:43:02.53133Z”,
“size”: 14835528,
“preview”: “https://watch.cloudflarestream.com/90222ad8d19c40e3a147dc7d1b94c0ff”,
“allowedOrigins”: ,
“requireSignedURLs”: false,
“uploaded”: “2020-08-14T16:43:02.531274Z”,
“uploadExpiry”: null,
“maxSizeBytes”: null,
“maxDurationSeconds”: null,
“duration”: -1,
“input”: {
“width”: -1,
“height”: -1
},
“playback”: {
“hls”: “https://videodelivery.net/90222ad8d19c40e3a147dc7d1b94c0ff/manifest/video.m3u8”,
“dash”: “same.mpd”
},
“watermark”: null
},
“success”: true,
“errors”: ,
“messages”:
}
Hey! When you make the request to upload, Stream returns the video details but has not started processing the video. Stream expects you to make another HTTP call to get the video details. After a few moments, readyToStream should be true
Thanks. It’s done now after 2-3 days. But this should be in the documentation.
I completely agree. I already have a few changes to make to the docs already, will do in a few days! | {
"url": "https://community.cloudflare.com/t/always-getting-readytostream-false/199128",
"source_domain": "community.cloudflare.com",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "21877",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2YFNIMAQLONBTUKQZ7XB7C5M2DYLZJVQ",
"WARC-Concurrent-To": "<urn:uuid:03dda7bf-eac9-4ca3-8c81-c8f546d845c8>",
"WARC-Date": "2020-09-22T22:10:24Z",
"WARC-IP-Address": "104.16.133.229",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3ZYUSYUYBQFBO4CMJOUM2MXYD3X7WMM2",
"WARC-Record-ID": "<urn:uuid:f5446341-28e3-4fcc-8737-92b76e96117c>",
"WARC-Target-URI": "https://community.cloudflare.com/t/always-getting-readytostream-false/199128",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a255c1e0-915f-4cea-8848-74f1e8d8b832>"
},
"warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-70.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
35,
36,
306,
348,
349,
351,
363,
406,
430,
458,
482,
494,
512,
515,
525,
586,
589,
630,
672,
690,
772,
792,
820,
863,
885,
907,
935,
951,
962,
975,
988,
991,
1005,
1094,
1113,
1116,
1134,
1137,
1154,
1166,
1178,
1180,
1181,
1419,
1420,
1499,
1500
],
"line_end_idx": [
35,
36,
306,
348,
349,
351,
363,
406,
430,
458,
482,
494,
512,
515,
525,
586,
589,
630,
672,
690,
772,
792,
820,
863,
885,
907,
935,
951,
962,
975,
988,
991,
1005,
1094,
1113,
1116,
1134,
1137,
1154,
1166,
1178,
1180,
1181,
1419,
1420,
1499,
1500,
1600
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1600,
"ccnet_original_nlines": 47,
"rps_doc_curly_bracket": 0.007499999832361937,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1989247351884842,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024193549528717995,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.46236559748649597,
"rps_doc_frac_unique_words": 0.6808510422706604,
"rps_doc_mean_word_length": 6.781914710998535,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.684694290161133,
"rps_doc_word_count": 188,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0188235305249691,
"rps_doc_frac_chars_top_3gram": 0.014117649756371975,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -141.6840362548828,
"rps_doc_books_importance_length_correction": -128.05844116210938,
"rps_doc_openwebtext_importance": -102.72395324707031,
"rps_doc_openwebtext_importance_length_correction": -102.72395324707031,
"rps_doc_wikipedia_importance": -82.09529113769531,
"rps_doc_wikipedia_importance_length_correction": -68.42877197265625
},
"fasttext": {
"dclm": 0.037100788205862045,
"english": 0.7711564302444458,
"fineweb_edu_approx": 1.0921558141708374,
"eai_general_math": 0.17278355360031128,
"eai_open_web_math": 0.0405508317053318,
"eai_web_code": 0.7735194563865662
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-5,351,436,971,534,225,000 | 2
votes
2answers
3k views
public key cryptograpy with Java and OpenSSL
In an application I want to store sensitive data (which can be arbitrarily large) so that it can later be used for researching. The point is that I don't want the data to lie around unprotected, so I ...
2
votes
0answers
112 views
Java openssl encryption / decryption key generation [duplicate]
I'm using Java 8 and I'm attempting to emulate the following openssl calls with Java. Encrypt: echo -n 'hello world' | openssl enc -a -aes-256-cbc -md sha256 -pass pass:97DE:4F76 U2FsdGVkX18PnO/...
2
votes
1answer
237 views
PKCS5 or Password Based Encryption (PBE) in JAVA
I want to write a password based encryption and decryption in Java! It means that I have a K (Password) and P (plain Text) and create such an E (encrypted Text) that I can then decrypt that E with ...
2
votes
0answers
2k views
AES key derivation function
I have a bash script which uses openssl to encrypt data, and Java code which decrypts the result. Based on my earlier post, I'm now able to enter a password in openssl, and copy the resulting key/iv ...
2
votes
2answers
3k views
Encryption/decryption using shared key in java?
I have customer token which i am sending from one webapplication say app1 to another webapplication say app2. I want to encrypt the customer token at app1 and decrypt it at app2 using key which is ...
1
vote
3answers
32k views
How to encrypt and decrypt String with my passphrase in Java (Pc not mobile platform)?
I want to encrypt a string and then put it on a file. Also want to decrypt it when I want. I don’t need very strong security. I just want to make it harder to get my data others. I tried several ...
1
vote
2answers
2k views
Java AES key generation
I'm trying to write a simple password manager in java. I would like to encrypt the file with the stored passwords using AES 256 bit encryption. In addition I would like the user to be able to decrypt ...
1
vote
3answers
171 views
How AES and IV should be used with file upload?
I am developing an application in which the application tracks the user location, writes them to a file and send the file to a server periodically (in this example per hour). Then, people will decrypt ...
1
vote
2answers
3k views
How to turn 64 character string into key for 256 AES encryption
public static byte[] decryptByte(byte[] blahh, byte[] keyExample) throws Exception { Cipher cipher = null; try { cipher = Cipher.getInstance("AES/ECB/PKCS5PADDING"); SecretKeySpec secretKey = ...
1
vote
4answers
4k views
Wanted Compatible AES code Encrypt/Decrypt for Iphone, Android, Windows/XP
I need to be able to send secure information to a variety of phones from Windows. I am a total novice in both iPhone and Android development, but need to create an easy to use app for each ...
1
vote
2answers
135 views
Java AES improve safety, how long does the keystring need to be
Encryption and Decryption in Java is still very difficult for me to understand. I have been using the following class and methods. I wonder how to improve the safety and how long does the keystring (...
1
vote
1answer
37 views
Reading from an encrypted file into a declared string variable
I have an encrypted file that was done using reference from this question .I got the file encrypted.Now my issue is when trying to read the contents out, am getting an empty strings from the returned ...
1
vote
2answers
68 views
Writing encrypted strings from a string array into a file
I have made reference from this question and achieved success in setting up encryption. I am trying to however utilize this encryption on a string of array to write into a file. This is how I am ...
1
vote
2answers
422 views
Generating digital certificate:InvalidKeyException: Illegal key size
Writing code to generate digital certificate Here is the piece of code causing problem PBEKeySpec keySpec = new PBEKeySpec(password); SecretKeyFactory keyFactory = SecretKeyFactory ....
1
vote
2answers
290 views
Securing individual DB fields
My application needs to store bank details and credit card numbers in a database. We support several DB variants and we try to avoid wherever possible any DB specific features that may not port ...
15 30 50 per page | {
"url": "http://stackoverflow.com/questions/linked/992019?page=4&sort=votes",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2016-26",
"warc_metadata": {
"Content-Length": "84489",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7UVKEIRUFRJKF2ZLIST22FYYADACNJ66",
"WARC-Concurrent-To": "<urn:uuid:c1be1871-ff98-4206-af97-eeb9c77eeac3>",
"WARC-Date": "2016-06-30T19:46:52Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:R3E2OVS4XHWFMH6RHWR3ZKJPXGS75IXD",
"WARC-Record-ID": "<urn:uuid:aea4c0e8-3f2a-4c0b-af64-3d7a0fa1c857>",
"WARC-Target-URI": "http://stackoverflow.com/questions/linked/992019?page=4&sort=votes",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8553c97d-8429-4acf-84d2-e74bca2af33c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-164-35-72.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-26\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
2,
8,
17,
26,
27,
72,
73,
277,
279,
285,
294,
304,
305,
369,
370,
568,
570,
576,
584,
594,
595,
644,
645,
846,
848,
854,
863,
872,
873,
901,
902,
1105,
1107,
1113,
1122,
1131,
1132,
1180,
1181,
1382,
1384,
1389,
1398,
1408,
1409,
1496,
1497,
1696,
1698,
1703,
1712,
1721,
1722,
1746,
1747,
1951,
1953,
1958,
1967,
1977,
1978,
2026,
2027,
2232,
2234,
2239,
2248,
2257,
2258,
2322,
2323,
2519,
2521,
2526,
2535,
2544,
2545,
2620,
2621,
2814,
2816,
2821,
2830,
2840,
2841,
2905,
2906,
3109,
3111,
3116,
3124,
3133,
3134,
3197,
3198,
3402,
3404,
3409,
3418,
3427,
3428,
3486,
3487,
3686,
3688,
3693,
3702,
3712,
3713,
3782,
3783,
3969,
3971,
3976,
3985,
3995,
3996,
4026,
4027,
4225,
4226
],
"line_end_idx": [
2,
8,
17,
26,
27,
72,
73,
277,
279,
285,
294,
304,
305,
369,
370,
568,
570,
576,
584,
594,
595,
644,
645,
846,
848,
854,
863,
872,
873,
901,
902,
1105,
1107,
1113,
1122,
1131,
1132,
1180,
1181,
1382,
1384,
1389,
1398,
1408,
1409,
1496,
1497,
1696,
1698,
1703,
1712,
1721,
1722,
1746,
1747,
1951,
1953,
1958,
1967,
1977,
1978,
2026,
2027,
2232,
2234,
2239,
2248,
2257,
2258,
2322,
2323,
2519,
2521,
2526,
2535,
2544,
2545,
2620,
2621,
2814,
2816,
2821,
2830,
2840,
2841,
2905,
2906,
3109,
3111,
3116,
3124,
3133,
3134,
3197,
3198,
3402,
3404,
3409,
3418,
3427,
3428,
3486,
3487,
3686,
3688,
3693,
3702,
3712,
3713,
3782,
3783,
3969,
3971,
3976,
3985,
3995,
3996,
4026,
4027,
4225,
4226,
4243
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4243,
"ccnet_original_nlines": 121,
"rps_doc_curly_bracket": 0.00047135999193415046,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3478773534297943,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06367924809455872,
"rps_doc_frac_lines_end_with_ellipsis": 0.12295082211494446,
"rps_doc_frac_no_alph_words": 0.1662735790014267,
"rps_doc_frac_unique_words": 0.4231843650341034,
"rps_doc_mean_word_length": 4.641061305999756,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.017688680440187454,
"rps_doc_unigram_entropy": 5.1599650382995605,
"rps_doc_word_count": 716,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04393620043992996,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.015046640299260616,
"rps_doc_frac_chars_top_3gram": 0.023472769185900688,
"rps_doc_frac_chars_top_4gram": 0.009629850275814533,
"rps_doc_books_importance": -449.33831787109375,
"rps_doc_books_importance_length_correction": -449.33831787109375,
"rps_doc_openwebtext_importance": -205.39178466796875,
"rps_doc_openwebtext_importance_length_correction": -205.39178466796875,
"rps_doc_wikipedia_importance": -193.99005126953125,
"rps_doc_wikipedia_importance_length_correction": -193.99005126953125
},
"fasttext": {
"dclm": 0.3934571146965027,
"english": 0.9180492758750916,
"fineweb_edu_approx": 1.7319283485412598,
"eai_general_math": 0.11319667100906372,
"eai_open_web_math": 0.09756147861480713,
"eai_web_code": 0.11118108034133911
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-1,132,484,773,869,891,100 | I would never expect a photo editing app to be what you’d call lightweight, but there have been several times this app alone has caused my otherwise snappy M1 MacBook Pro to feel laggy.
When I’d open Resource Monitor it’d show that Lightroom was using between 5-8GB RAM on its own. I don’t recall that being an issue, at least not to this degree, when I first got Lightroom.
By today’s standards admittedly 16GB RAM isn’t high end, especially for photo and video editing. But damn if literally every other aspect of using this computer feel fine, even editing 4K video runs smooth.
I looked into it on various forums and evidently this is normal for Lightroom, sadly.
Others say that the app routinely eats more than half their system memory — even those with 32GB RAM. Most of those people recommend shutting down most of your other apps in the background, and in some cases closing and reopening Lightroom to get it to let go of RAM.
The reason being that Lightroom apparently doesn’t free up RAM well between each photo you’re editing, so if you’re working on quite a sequence of photos the whole collection you’ve touched, complete with all the edits, are stuck in RAM and don’t release until the app is closed.
That means that if you’re editing a sequence of images, it’s not use RAM and then release between photos, but rather keep eating RAM with every batch of edits until the RAM is gone.
I find this seems to happen less noticeably on my iPad Pro than my MacBook — maybe because iPadOS is more locked down.
However, I still notice the normally buttery smooth performance of the M1 iPad Pro becomes a little jittery after a few photos sometimes. Especially if I’d used several masks.
It reads like this isn’t a bug or an oversight, that Adobe does this intentionally to maximize performance for those jumping back and forth between a bunch of images. I get that, but I wish there were an option in the app settings to limit how many edits are saved in previous images.
Personally, I’m only concerned about the image I’m currently working on. If I need to return to a previous one I’m ok with a momentary load. That’s less of a burden than a system starved for RAM because one app is going crazy and everything else suffers for it.
Just my two cents.
Share This | {
"url": "https://digimorphosis.com/adobe-lightroom-is-a-ram-hog-even-in-2023/",
"source_domain": "digimorphosis.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "176740",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y5NWUNF372H7SP4R364KTDIMMRZLZA3H",
"WARC-Concurrent-To": "<urn:uuid:d44423b4-c269-40dc-9857-7f4dea2fc336>",
"WARC-Date": "2024-05-18T11:03:49Z",
"WARC-IP-Address": "35.215.84.198",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FW25MA7V3F6YU64AZGHDFTKVYZIQLHVB",
"WARC-Record-ID": "<urn:uuid:f62b18b2-9037-48c9-adfc-8f6d6a88f679>",
"WARC-Target-URI": "https://digimorphosis.com/adobe-lightroom-is-a-ram-hog-even-in-2023/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a17477ee-d931-42d2-a759-dd0095741c3c>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-28\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
186,
187,
376,
377,
584,
585,
671,
672,
940,
941,
1221,
1222,
1404,
1405,
1524,
1525,
1701,
1702,
1987,
1988,
2250,
2251,
2270,
2271
],
"line_end_idx": [
186,
187,
376,
377,
584,
585,
671,
672,
940,
941,
1221,
1222,
1404,
1405,
1524,
1525,
1701,
1702,
1987,
1988,
2250,
2251,
2270,
2271,
2281
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2281,
"ccnet_original_nlines": 24,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4886597990989685,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06185567006468773,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11958763003349304,
"rps_doc_frac_unique_words": 0.5634146332740784,
"rps_doc_mean_word_length": 4.448780536651611,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.119088172912598,
"rps_doc_word_count": 410,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.009868419729173183,
"rps_doc_frac_chars_top_3gram": 0.012061400339007378,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -205.08990478515625,
"rps_doc_books_importance_length_correction": -205.08990478515625,
"rps_doc_openwebtext_importance": -132.83970642089844,
"rps_doc_openwebtext_importance_length_correction": -132.83970642089844,
"rps_doc_wikipedia_importance": -105.27064514160156,
"rps_doc_wikipedia_importance_length_correction": -105.27064514160156
},
"fasttext": {
"dclm": 0.05879300832748413,
"english": 0.9613056182861328,
"fineweb_edu_approx": 1.2084187269210815,
"eai_general_math": 0.19633084535598755,
"eai_open_web_math": 0.13077181577682495,
"eai_web_code": 0.1429957151412964
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "686.222",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Handicraft and Occupations",
"level_3": "Bookbinding and Printing"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-1,362,685,237,494,528,000 | SOLVED
Converting text field of various units of time to hours
New Contributor
Hello,
I have a text column in excel that includes time but in various units. For example, one cell can be hours (i.e. 24 hours); another can be weeks (i.e. 3 weeks); or days (i.e. 2 days), etc. Is there a formula I can use to covert all to hours and just display the number?
Thank you!
2 Replies
best response confirmed by Sergei Baklan (MVP)
Solution
@Rjonspa Perhaps like in the attached file.
Screenshot 2022-04-11 at 07.56.46.png
Thank you so much Riny! | {
"url": "https://techcommunity.microsoft.com/t5/excel/converting-text-field-of-various-units-of-time-to-hours/td-p/3281431",
"source_domain": "techcommunity.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "445183",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SSLKOKH434VAHQFZT3ZBMJNBARLHINRR",
"WARC-Concurrent-To": "<urn:uuid:e82ff248-b7de-4ca9-9f10-692151489350>",
"WARC-Date": "2022-05-29T03:41:37Z",
"WARC-IP-Address": "23.40.20.8",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:F2ZHEON3NPZJGO2UVGU6NFNWBPUJUFQG",
"WARC-Record-ID": "<urn:uuid:89f1d09f-7046-44fe-8bb9-0938470f1c0c>",
"WARC-Target-URI": "https://techcommunity.microsoft.com/t5/excel/converting-text-field-of-various-units-of-time-to-hours/td-p/3281431",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a4c76395-3704-4a96-b95b-4f39f63257f6>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-189\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
7,
8,
64,
65,
81,
82,
89,
90,
360,
371,
372,
382,
429,
438,
439,
483,
484,
522,
523,
525,
526,
528,
529
],
"line_end_idx": [
7,
8,
64,
65,
81,
82,
89,
90,
360,
371,
372,
382,
429,
438,
439,
483,
484,
522,
523,
525,
526,
528,
529,
552
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 552,
"ccnet_original_nlines": 23,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3484848439693451,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030303029343485832,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.28787878155708313,
"rps_doc_frac_unique_words": 0.7395833134651184,
"rps_doc_mean_word_length": 4.28125,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.167091369628906,
"rps_doc_word_count": 96,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.058394160121679306,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -64.33424377441406,
"rps_doc_books_importance_length_correction": -78.21728515625,
"rps_doc_openwebtext_importance": -41.834938049316406,
"rps_doc_openwebtext_importance_length_correction": -55.717979431152344,
"rps_doc_wikipedia_importance": -23.11920738220215,
"rps_doc_wikipedia_importance_length_correction": -37.00225067138672
},
"fasttext": {
"dclm": 0.8591039180755615,
"english": 0.8654571771621704,
"fineweb_edu_approx": 1.034433364868164,
"eai_general_math": 0.7052274346351624,
"eai_open_web_math": 0.7543822526931763,
"eai_web_code": 0.02324276976287365
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
2,461,201,337,203,463,000 | Help us understand the problem. What is going on with this article?
OpenAPI Generatorで自分好みのpythonクライアントライブラリを生成する方法
OpenAPI Generatorで自分好みのpythonクライアントライブラリを生成する方法
by yuji38kwmt
1 / 21
自己紹介
• yuji38kwmt
• 名古屋のAIの会社でAIやってないエンジニア
icon.png
WebAPIをどう実行していますか？
• curlコマンドですか？
• curlコマンドはつらくないですか？
• pythonで実行したくないですか？
WebAPIをPythonでどう実行していますか？
• APIドキュメントを見ながら、自分で実装していますか？
• 似たようなコードがたくさんあって、飽きませんか？面倒でないですか？
あなたが実行したいWebAPIは何で定義されていますか？
• OpenAPI Specification（OAS）ですか？
• OASで定義されているなら、あなたは幸せです。なぜならOASからソースを自動生成できるツールがあるからです。
OpenAPI Specification（OAS）とは？
REST APIを記述するための言語です。
以下、「OAS」と略します。
The OpenAPI Specification (OAS) defines a standard, programming language-agnostic interface description for REST APIs,
https://github.com/OAI/OpenAPI-Specification 引用
image.png
Qiita API v2をOAS3で記述する
例として、Qiita APIのタグ一覧を返す APIをOASで表現します。
※QiitaはOASで記載されたファイルを公開していません。以下のファイルは非公式です。
image.png
qiita.yaml
openapi: "3.0.0"
info:
version: 0.1.0
title: Qiita API
servers:
- url: https://qiita.com/api/v2
paths:
/tags:
get:
tags:
- tags
summary: タグ一覧を作成日時の降順で返します。
operationId: getTagList
parameters:
- name: page
in: query
description: ページ番号 (1から100まで)
example: "1"
schema:
type: string
- name: per_page
in: query
description: 1ページあたりに含まれる要素数 (1から100まで)
example: "20"
schema:
type: string
- name: sort
in: query
description: 並び順 (countで記事数順、nameで名前順)
example: "count"
schema:
type: string
enum:
- count
- name
responses:
200:
description: タグ一覧
content:
application/json:
schema:
type: array
items:
$ref: "#/components/schemas/Tag"
components:
schemas:
Tag:
properties:
followers_count:
description: このタグをフォローしているユーザの数
example: 100
type: integer
icon_url:
description: このタグに設定されたアイコン画像のURL
example: "https://s3-ap-northeast-1.amazonaws.com/qiita-tag-image/9de6a11d330f5694820082438f88ccf4a1b289b2/medium.jpg"
type: string
id:
description: タグを特定するための一意な名前
example: "qiita"
type: string
items_count:
description: このタグが付けられた記事の数
example: 200
type: integer
OpenAPI Generatorとは？
OASからAPIのクライアントライブラリやサーバのスタブ、ドキュメントなどを生成します。
OpenAPI Generator allows generation of API client libraries (SDK generation), server stubs, documentation and configuration automatically given an OpenAPI Spec (both 2.0 and 3.0 are supported).
https://github.com/OpenAPITools/openapi-generator
OpenAPI Generatorが対応している言語/フレームワーク
Pythonクライアントライブラリや、Flaskのスタブが生成できます。
※マイナーな言語にも対応されています
image.png
とりあえずOpenAPI GeneratorでPythonクライアントライブラリを生成する
以下のコマンドを実行すると、qiita.yamlから生成されたPythonクライアントライブラリが、outディレクトリに出力されます。
$ docker run --rm -u `id -u`:`id -g` -v ${PWD}:/local \
openapitools/openapi-generator-cli generate \
--input-spec /local/qiita.yaml \
--generator-name python \
--output /local/out
Pythonクライアントライブラリのフォルダ構成
ライブラリ用のpythonファイルだけでなく、ドキュメントやテストコード、設定ファイルなど、ライブラリに必要なファイル一式が生成されます。
$ tree -a
.
├── docs
│ ├── Tag.md
│ └── TagsApi.md
├── .gitignore
├── git_push.sh
├── openapi_client
│ ├── api
│ │ ├── __init__.py
│ │ └── tags_api.py
│ ├── api_client.py
│ ├── configuration.py
│ ├── exceptions.py
│ ├── __init__.py
│ ├── models
│ │ ├── __init__.py
│ │ └── tag.py
│ └── rest.py
├── .openapi-generator
│ └── VERSION
├── .openapi-generator-ignore
├── README.md
├── requirements.txt
├── setup.py
├── test
│ ├── __init__.py
│ ├── test_tag.py
│ └── test_tags_api.py
├── test-requirements.txt
├── tox.ini
└── .travis.yml
生成したクライアントライブラリを実行する
import openapi_client
from pprint import pprint
access_token = "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX"
api_client = openapi_client.ApiClient(header_name="Authorization", header_value="Bearer " + access_token)
# タグの一覧を取得する
tags_api_instance = openapi_client.TagsApi(api_client)
tag_list = tags_api_instance.get_tag_list(per_page=15)
pprint(tag_list)
# [{'followers_count': 0, 'icon_url': None, 'id': 'Broadcas', #'items_count': 6},
# ...
自分好みにクライアントライブラリをカスタマイズする
カスタマイズしていないクライアントライブラリのイケていない部分
• 型ヒントが使われていない（Python2, Python3.4以下をサポートしているため）
• query parameterの数だけメソッドの引数が増える（query_parameterをまとめて渡したい）
テンプレートファイルを修正してカスタマイズする
OpenAPI Generatorは、mustache記法で記載されたテンプレートファイルを修正して、カスタマイズできます。
api.mustache
{{#operations}}
{{#operation}}
def {{operationId}}(self, {{#sortParamsByRequiredFlag}}{{#pathParams}}{{paramName}}: {{dataType}}, {{/pathParams}}{{/sortParamsByRequiredFlag}}{{#hasQueryParams}}query_params: Optional[Dict[str, Any]] = None, {{/hasQueryParams}}{{#hasBodyParam}}request_body: Optional[Any] = None{{/hasBodyParam}}) -> Any: # noqa: E501
"""
{{#summary}}{{{.}}}{{/summary}}{{^summary}}{{operationId}}{{/summary}} # noqa: E501
"""
url_path = f'{{{path}}}'
http_method = '{{httpMethod}}'
keyword_params: Dict[str, Any] = {
{{#hasQueryParams}}
'query_params': query_params,
{{/hasQueryParams}}
{{#hasBodyParam}}
'request_body': request_body,
{{/hasBodyParam}}
}
return self._request_wrapper(http_method, url_path, **keyword_params)
{{/operation}}
{{/operations}}
mustacheとは？
• mustacheはロジックがないテンプレート（Logic-less）
• ロジックがないとは、if/elseやloopなどの制御構造がないこと
Mustache is described as a "logic-less" system because it lacks any explicit control flow statements, like if and else conditionals or for loops; however, both looping and conditional evaluation can be achieved using section tags processing lists and lambdas.
https://en.wikipedia.org/wiki/Mustache_(template_system) 引用
なぜmustache（口髭）という名前？
横向きの口髭に似ている波括弧をたくさん使うから。
image.png
It is named "Mustache" because of heavy use of braces, { }, that resemble a sideways moustache.
https://en.wikipedia.org/wiki/Mustache_(template_system) 引用
できあがったライブラリ
手動で生成したファイルと連結したら、sedで置換したりして、自分好みのライブラリを作成できました。
### Qiita APIすべてが定義されたクラスのインスタンスを生成
api_instance = QiitaApi(acess_token)
### タグの一覧を取得する
query_params = {"per_page":15, "sort": "name"}
tag_list = api_instance.get_tag_list(query_params=query_params)
まとめ
• OpenAPI Generatorを使うと、OpenAPI Specification（OAS）でRESTが表現されたAPIのクライアントライブラリが生成できる
• カスタマイズする場合は、msutache(口髭）ファイルを修正する
補足：自動生成は結構ハマる
完全に自動生成するのは難しい。
ハマった場合の対応方法は以下の3つかな？
• 泥臭い手法を取る（sed, awk）
• 自動生成ツールに手を入れる（contributorになる）
• 諦める
Why do not you register as a user and use Qiita more conveniently?
1. We will deliver articles that match you
By following users and tags, you can catch up information on technical fields that you are interested in as a whole
2. you can read useful information later efficiently
By "stocking" the articles you like, you can search right away
Comments
Sign up for free and join this conversation.
If you already have a Qiita account
Why do not you register as a user and use Qiita more conveniently?
You need to log in to use this function. Qiita can be used more conveniently after logging in.
You seem to be reading articles frequently this month. Qiita can be used more conveniently after logging in.
1. We will deliver articles that match you
By following users and tags, you can catch up information on technical fields that you are interested in as a whole
2. you can read useful information later efficiently
By "stocking" the articles you like, you can search right away | {
"url": "https://qiita.com/yuji38kwmt/items/ad89fa0b8690627fea0f",
"source_domain": "qiita.com",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "103978",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6D5HUVWMIZEXFVVOUKIEM4HAAR4LAODB",
"WARC-Concurrent-To": "<urn:uuid:06f4e76b-bc47-4e42-a725-4c88adb32c8c>",
"WARC-Date": "2019-12-09T07:11:51Z",
"WARC-IP-Address": "176.34.13.209",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:K25OR5OEGPPN4YLU5SR3PHNSSMUO73JJ",
"WARC-Record-ID": "<urn:uuid:8e2de849-22fa-4022-8998-eb3a8e07f833>",
"WARC-Target-URI": "https://qiita.com/yuji38kwmt/items/ad89fa0b8690627fea0f",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3c7a331a-1511-4ea3-ae03-f5d83b23c290>"
},
"warc_info": "isPartOf: CC-MAIN-2019-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-206.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
68,
69,
117,
118,
166,
167,
181,
188,
189,
194,
195,
210,
237,
238,
247,
248,
249,
268,
269,
286,
309,
332,
333,
359,
360,
392,
430,
431,
460,
461,
496,
555,
556,
586,
587,
609,
624,
625,
744,
745,
793,
794,
804,
805,
806,
829,
830,
868,
913,
914,
924,
925,
926,
937,
954,
960,
977,
996,
1005,
1039,
1046,
1055,
1064,
1076,
1089,
1123,
1153,
1171,
1192,
1212,
1252,
1275,
1293,
1318,
1343,
1363,
1413,
1437,
1455,
1480,
1501,
1521,
1570,
1597,
1615,
1640,
1658,
1678,
1697,
1714,
1727,
1755,
1774,
1804,
1826,
1854,
1877,
1928,
1940,
1951,
1960,
1978,
2003,
2045,
2068,
2092,
2110,
2154,
2283,
2306,
2318,
2357,
2384,
2407,
2428,
2466,
2489,
2513,
2514,
2535,
2536,
2581,
2582,
2776,
2777,
2827,
2828,
2829,
2864,
2865,
2902,
2921,
2922,
2932,
2933,
2934,
2980,
2981,
3049,
3050,
3106,
3153,
3187,
3214,
3235,
3236,
3261,
3262,
3332,
3333,
3343,
3345,
3354,
3369,
3388,
3403,
3419,
3438,
3450,
3474,
3498,
3520,
3545,
3567,
3587,
3602,
3626,
3645,
3661,
3684,
3700,
3730,
3744,
3765,
3778,
3787,
3807,
3827,
3852,
3878,
3890,
3906,
3907,
3928,
3929,
3951,
3977,
3978,
4031,
4137,
4138,
4151,
4206,
4261,
4278,
4360,
4366,
4367,
4393,
4394,
4395,
4427,
4428,
4478,
4539,
4540,
4564,
4565,
4628,
4629,
4642,
4658,
4673,
4674,
4998,
5010,
5103,
5115,
5116,
5149,
5188,
5231,
5251,
5293,
5313,
5331,
5373,
5391,
5401,
5479,
5480,
5495,
5511,
5512,
5524,
5525,
5564,
5603,
5604,
5864,
5865,
5925,
5926,
5927,
5948,
5949,
5974,
5975,
5985,
5986,
6082,
6083,
6143,
6144,
6145,
6157,
6158,
6208,
6209,
6245,
6282,
6283,
6298,
6345,
6409,
6410,
6414,
6415,
6500,
6538,
6539,
6553,
6554,
6570,
6591,
6592,
6615,
6649,
6657,
6724,
6769,
6889,
6944,
7011,
7020,
7065,
7101,
7168,
7263,
7372,
7417,
7537,
7592
],
"line_end_idx": [
68,
69,
117,
118,
166,
167,
181,
188,
189,
194,
195,
210,
237,
238,
247,
248,
249,
268,
269,
286,
309,
332,
333,
359,
360,
392,
430,
431,
460,
461,
496,
555,
556,
586,
587,
609,
624,
625,
744,
745,
793,
794,
804,
805,
806,
829,
830,
868,
913,
914,
924,
925,
926,
937,
954,
960,
977,
996,
1005,
1039,
1046,
1055,
1064,
1076,
1089,
1123,
1153,
1171,
1192,
1212,
1252,
1275,
1293,
1318,
1343,
1363,
1413,
1437,
1455,
1480,
1501,
1521,
1570,
1597,
1615,
1640,
1658,
1678,
1697,
1714,
1727,
1755,
1774,
1804,
1826,
1854,
1877,
1928,
1940,
1951,
1960,
1978,
2003,
2045,
2068,
2092,
2110,
2154,
2283,
2306,
2318,
2357,
2384,
2407,
2428,
2466,
2489,
2513,
2514,
2535,
2536,
2581,
2582,
2776,
2777,
2827,
2828,
2829,
2864,
2865,
2902,
2921,
2922,
2932,
2933,
2934,
2980,
2981,
3049,
3050,
3106,
3153,
3187,
3214,
3235,
3236,
3261,
3262,
3332,
3333,
3343,
3345,
3354,
3369,
3388,
3403,
3419,
3438,
3450,
3474,
3498,
3520,
3545,
3567,
3587,
3602,
3626,
3645,
3661,
3684,
3700,
3730,
3744,
3765,
3778,
3787,
3807,
3827,
3852,
3878,
3890,
3906,
3907,
3928,
3929,
3951,
3977,
3978,
4031,
4137,
4138,
4151,
4206,
4261,
4278,
4360,
4366,
4367,
4393,
4394,
4395,
4427,
4428,
4478,
4539,
4540,
4564,
4565,
4628,
4629,
4642,
4658,
4673,
4674,
4998,
5010,
5103,
5115,
5116,
5149,
5188,
5231,
5251,
5293,
5313,
5331,
5373,
5391,
5401,
5479,
5480,
5495,
5511,
5512,
5524,
5525,
5564,
5603,
5604,
5864,
5865,
5925,
5926,
5927,
5948,
5949,
5974,
5975,
5985,
5986,
6082,
6083,
6143,
6144,
6145,
6157,
6158,
6208,
6209,
6245,
6282,
6283,
6298,
6345,
6409,
6410,
6414,
6415,
6500,
6538,
6539,
6553,
6554,
6570,
6591,
6592,
6615,
6649,
6657,
6724,
6769,
6889,
6944,
7011,
7020,
7065,
7101,
7168,
7263,
7372,
7417,
7537,
7592,
7658
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7658,
"ccnet_original_nlines": 293,
"rps_doc_curly_bracket": 0.01593104936182499,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.13622526824474335,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0220700204372406,
"rps_doc_frac_lines_end_with_ellipsis": 0.003401360008865595,
"rps_doc_frac_no_alph_words": 0.4786910116672516,
"rps_doc_frac_unique_words": 0.5344311594963074,
"rps_doc_mean_word_length": 8.431138038635254,
"rps_doc_num_sentences": 76,
"rps_doc_symbol_to_word_ratio": 0.017503809183835983,
"rps_doc_unigram_entropy": 5.4687628746032715,
"rps_doc_word_count": 668,
"rps_doc_frac_chars_dupe_10grams": 0.09730114042758942,
"rps_doc_frac_chars_dupe_5grams": 0.12357954680919647,
"rps_doc_frac_chars_dupe_6grams": 0.11860795319080353,
"rps_doc_frac_chars_dupe_7grams": 0.11860795319080353,
"rps_doc_frac_chars_dupe_8grams": 0.11292614042758942,
"rps_doc_frac_chars_dupe_9grams": 0.11292614042758942,
"rps_doc_frac_chars_top_2gram": 0.0078125,
"rps_doc_frac_chars_top_3gram": 0.007102270144969225,
"rps_doc_frac_chars_top_4gram": 0.0078125,
"rps_doc_books_importance": -578.2314453125,
"rps_doc_books_importance_length_correction": -578.2314453125,
"rps_doc_openwebtext_importance": -345.9931335449219,
"rps_doc_openwebtext_importance_length_correction": -345.9931335449219,
"rps_doc_wikipedia_importance": -360.6917724609375,
"rps_doc_wikipedia_importance_length_correction": -360.6917724609375
},
"fasttext": {
"dclm": 0.22421175241470337,
"english": 0.05673696845769882,
"fineweb_edu_approx": 2.6132044792175293,
"eai_general_math": 0.07141447067260742,
"eai_open_web_math": 0.026036260649561882,
"eai_web_code": 0.47428637742996216
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-5,061,643,562,630,198,000 | blob: a6c9c6d88543cd6107f76fe7a9f72d880883bf58 [file] [log] [blame]
/*
* Copyright (c) 2017 Jason Lowe-Power
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met: redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer;
* redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution;
* neither the name of the copyright holders nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* Authors: Jason Lowe-Power
*/
#ifndef __LEARNING_GEM5_PART2_SIMPLE_MEMOBJ_HH__
#define __LEARNING_GEM5_PART2_SIMPLE_MEMOBJ_HH__
#include "mem/port.hh"
#include "params/SimpleMemobj.hh"
#include "sim/sim_object.hh"
/**
* A very simple memory object. Current implementation doesn't even cache
* anything it just forwards requests and responses.
* This memobj is fully blocking (not non-blocking). Only a single request can
* be outstanding at a time.
*/
class SimpleMemobj : public SimObject
{
private:
/**
* Port on the CPU-side that receives requests.
* Mostly just forwards requests to the owner.
* Part of a vector of ports. One for each CPU port (e.g., data, inst)
*/
class CPUSidePort : public SlavePort
{
private:
/// The object that owns this object (SimpleMemobj)
SimpleMemobj *owner;
/// True if the port needs to send a retry req.
bool needRetry;
/// If we tried to send a packet and it was blocked, store it here
PacketPtr blockedPacket;
public:
/**
* Constructor. Just calls the superclass constructor.
*/
CPUSidePort(const std::string& name, SimpleMemobj *owner) :
SlavePort(name, owner), owner(owner), needRetry(false),
blockedPacket(nullptr)
{ }
/**
* Send a packet across this port. This is called by the owner and
* all of the flow control is hanled in this function.
*
* @param packet to send.
*/
void sendPacket(PacketPtr pkt);
/**
* Get a list of the non-overlapping address ranges the owner is
* responsible for. All slave ports must override this function
* and return a populated list with at least one item.
*
* @return a list of ranges responded to
*/
AddrRangeList getAddrRanges() const override;
/**
* Send a retry to the peer port only if it is needed. This is called
* from the SimpleMemobj whenever it is unblocked.
*/
void trySendRetry();
protected:
/**
* Receive an atomic request packet from the master port.
* No need to implement in this simple memobj.
*/
Tick recvAtomic(PacketPtr pkt) override
{ panic("recvAtomic unimpl."); }
/**
* Receive a functional request packet from the master port.
* Performs a "debug" access updating/reading the data in place.
*
* @param packet the requestor sent.
*/
void recvFunctional(PacketPtr pkt) override;
/**
* Receive a timing request from the master port.
*
* @param the packet that the requestor sent
* @return whether this object can consume the packet. If false, we
* will call sendRetry() when we can try to receive this
* request again.
*/
bool recvTimingReq(PacketPtr pkt) override;
/**
* Called by the master port if sendTimingResp was called on this
* slave port (causing recvTimingResp to be called on the master
* port) and was unsuccesful.
*/
void recvRespRetry() override;
};
/**
* Port on the memory-side that receives responses.
* Mostly just forwards requests to the owner
*/
class MemSidePort : public MasterPort
{
private:
/// The object that owns this object (SimpleMemobj)
SimpleMemobj *owner;
/// If we tried to send a packet and it was blocked, store it here
PacketPtr blockedPacket;
public:
/**
* Constructor. Just calls the superclass constructor.
*/
MemSidePort(const std::string& name, SimpleMemobj *owner) :
MasterPort(name, owner), owner(owner), blockedPacket(nullptr)
{ }
/**
* Send a packet across this port. This is called by the owner and
* all of the flow control is hanled in this function.
*
* @param packet to send.
*/
void sendPacket(PacketPtr pkt);
protected:
/**
* Receive a timing response from the slave port.
*/
bool recvTimingResp(PacketPtr pkt) override;
/**
* Called by the slave port if sendTimingReq was called on this
* master port (causing recvTimingReq to be called on the slave
* port) and was unsuccesful.
*/
void recvReqRetry() override;
/**
* Called to receive an address range change from the peer slave
* port. The default implementation ignores the change and does
* nothing. Override this function in a derived class if the owner
* needs to be aware of the address ranges, e.g. in an
* interconnect component like a bus.
*/
void recvRangeChange() override;
};
/**
* Handle the request from the CPU side
*
* @param requesting packet
* @return true if we can handle the request this cycle, false if the
* requestor needs to retry later
*/
bool handleRequest(PacketPtr pkt);
/**
* Handle the response from the memory side
*
* @param responding packet
* @return true if we can handle the response this cycle, false if the
* responder needs to retry later
*/
bool handleResponse(PacketPtr pkt);
/**
* Handle a packet functionally. Update the data on a write and get the
* data on a read.
*
* @param packet to functionally handle
*/
void handleFunctional(PacketPtr pkt);
/**
* Return the address ranges this memobj is responsible for. Just use the
* same as the next upper level of the hierarchy.
*
* @return the address ranges this memobj is responsible for
*/
AddrRangeList getAddrRanges() const;
/**
* Tell the CPU side to ask for our memory ranges.
*/
void sendRangeChange();
/// Instantiation of the CPU-side ports
CPUSidePort instPort;
CPUSidePort dataPort;
/// Instantiation of the memory-side port
MemSidePort memPort;
/// True if this is currently blocked waiting for a response.
bool blocked;
public:
/** constructor
*/
SimpleMemobj(SimpleMemobjParams *params);
/**
* Get a port with a given name and index. This is used at
* binding time and returns a reference to a protocol-agnostic
* port.
*
* @param if_name Port name
* @param idx Index in the case of a VectorPort
*
* @return A reference to the given port
*/
Port &getPort(const std::string &if_name,
PortID idx=InvalidPortID) override;
};
#endif // __LEARNING_GEM5_PART2_SIMPLE_MEMOBJ_HH__ | {
"url": "https://gem5.googlesource.com/public/gem5-website/+/04eef9878d4bf8ee1b5a1dc3bd899fbcd327ef38/_pages/static/scripts/part2/memoryobject/simple_memobj.hh",
"source_domain": "gem5.googlesource.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "82618",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RU2YR463NW2Y4FRF3HSJ5J4GHQR4WWJF",
"WARC-Concurrent-To": "<urn:uuid:282252fd-e3cf-44f4-9fdc-d0cd759eec2a>",
"WARC-Date": "2022-06-30T20:18:20Z",
"WARC-IP-Address": "142.251.16.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5UFJZTEVDQE4NPELPTGC3HN5KWI4VM5R",
"WARC-Record-ID": "<urn:uuid:594d85ab-a6a1-439b-84bf-af51ca2fd22c>",
"WARC-Target-URI": "https://gem5.googlesource.com/public/gem5-website/+/04eef9878d4bf8ee1b5a1dc3bd899fbcd327ef38/_pages/static/scripts/part2/memoryobject/simple_memobj.hh",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:55e0c15a-0a1b-44f0-b17b-aa462a55ed1d>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-163\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
68,
71,
109,
132,
134,
203,
276,
346,
410,
478,
548,
619,
684,
755,
814,
816,
886,
954,
1026,
1097,
1169,
1236,
1308,
1380,
1450,
1522,
1593,
1595,
1623,
1626,
1675,
1724,
1747,
1781,
1810,
1814,
1887,
1939,
2017,
2045,
2048,
2086,
2088,
2097,
2101,
2148,
2194,
2264,
2267,
2304,
2306,
2315,
2367,
2388,
2436,
2452,
2519,
2544,
2552,
2556,
2610,
2613,
2673,
2729,
2752,
2756,
2760,
2826,
2880,
2882,
2907,
2910,
2942,
2946,
3010,
3073,
3127,
3129,
3169,
3172,
3218,
3222,
3291,
3341,
3344,
3365,
3376,
3380,
3437,
3483,
3486,
3526,
3559,
3563,
3623,
3687,
3689,
3725,
3728,
3773,
3777,
3826,
3828,
3872,
3939,
3995,
4012,
4015,
4059,
4063,
4128,
4192,
4221,
4224,
4255,
4258,
4262,
4313,
4358,
4361,
4399,
4401,
4410,
4462,
4483,
4550,
4575,
4583,
4587,
4641,
4644,
4704,
4766,
4770,
4774,
4840,
4894,
4896,
4921,
4924,
4956,
4967,
4971,
5020,
5023,
5068,
5072,
5135,
5198,
5227,
5230,
5260,
5264,
5328,
5391,
5457,
5511,
5548,
5551,
5584,
5587,
5591,
5630,
5632,
5659,
5728,
5761,
5764,
5799,
5803,
5846,
5848,
5875,
5945,
5978,
5981,
6017,
6021,
6092,
6110,
6112,
6151,
6154,
6192,
6196,
6269,
6318,
6320,
6380,
6383,
6420,
6424,
6474,
6477,
6501,
6541,
6563,
6585,
6627,
6648,
6710,
6724,
6732,
6748,
6751,
6793,
6797,
6855,
6917,
6925,
6927,
6954,
7001,
7003,
7043,
7046,
7088,
7124,
7127
],
"line_end_idx": [
68,
71,
109,
132,
134,
203,
276,
346,
410,
478,
548,
619,
684,
755,
814,
816,
886,
954,
1026,
1097,
1169,
1236,
1308,
1380,
1450,
1522,
1593,
1595,
1623,
1626,
1675,
1724,
1747,
1781,
1810,
1814,
1887,
1939,
2017,
2045,
2048,
2086,
2088,
2097,
2101,
2148,
2194,
2264,
2267,
2304,
2306,
2315,
2367,
2388,
2436,
2452,
2519,
2544,
2552,
2556,
2610,
2613,
2673,
2729,
2752,
2756,
2760,
2826,
2880,
2882,
2907,
2910,
2942,
2946,
3010,
3073,
3127,
3129,
3169,
3172,
3218,
3222,
3291,
3341,
3344,
3365,
3376,
3380,
3437,
3483,
3486,
3526,
3559,
3563,
3623,
3687,
3689,
3725,
3728,
3773,
3777,
3826,
3828,
3872,
3939,
3995,
4012,
4015,
4059,
4063,
4128,
4192,
4221,
4224,
4255,
4258,
4262,
4313,
4358,
4361,
4399,
4401,
4410,
4462,
4483,
4550,
4575,
4583,
4587,
4641,
4644,
4704,
4766,
4770,
4774,
4840,
4894,
4896,
4921,
4924,
4956,
4967,
4971,
5020,
5023,
5068,
5072,
5135,
5198,
5227,
5230,
5260,
5264,
5328,
5391,
5457,
5511,
5548,
5551,
5584,
5587,
5591,
5630,
5632,
5659,
5728,
5761,
5764,
5799,
5803,
5846,
5848,
5875,
5945,
5978,
5981,
6017,
6021,
6092,
6110,
6112,
6151,
6154,
6192,
6196,
6269,
6318,
6320,
6380,
6383,
6420,
6424,
6474,
6477,
6501,
6541,
6563,
6585,
6627,
6648,
6710,
6724,
6732,
6748,
6751,
6793,
6797,
6855,
6917,
6925,
6927,
6954,
7001,
7003,
7043,
7046,
7088,
7124,
7127,
7177
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7177,
"ccnet_original_nlines": 219,
"rps_doc_curly_bracket": 0.0016720100538805127,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24415406584739685,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08665750175714493,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2971114218235016,
"rps_doc_frac_unique_words": 0.34662577509880066,
"rps_doc_mean_word_length": 5.562372207641602,
"rps_doc_num_sentences": 58,
"rps_doc_symbol_to_word_ratio": 0.004126550164073706,
"rps_doc_unigram_entropy": 5.1633734703063965,
"rps_doc_word_count": 978,
"rps_doc_frac_chars_dupe_10grams": 0.14889706671237946,
"rps_doc_frac_chars_dupe_5grams": 0.24889706075191498,
"rps_doc_frac_chars_dupe_6grams": 0.2025735229253769,
"rps_doc_frac_chars_dupe_7grams": 0.19154411554336548,
"rps_doc_frac_chars_dupe_8grams": 0.17830881476402283,
"rps_doc_frac_chars_dupe_9grams": 0.1665441244840622,
"rps_doc_frac_chars_top_2gram": 0.009191179648041725,
"rps_doc_frac_chars_top_3gram": 0.01194852963089943,
"rps_doc_frac_chars_top_4gram": 0.00937500037252903,
"rps_doc_books_importance": -489.2800598144531,
"rps_doc_books_importance_length_correction": -489.2800598144531,
"rps_doc_openwebtext_importance": -314.7734680175781,
"rps_doc_openwebtext_importance_length_correction": -314.7734680175781,
"rps_doc_wikipedia_importance": -271.6526794433594,
"rps_doc_wikipedia_importance_length_correction": -271.6526794433594
},
"fasttext": {
"dclm": 0.7966355085372925,
"english": 0.7400801777839661,
"fineweb_edu_approx": 1.3842370510101318,
"eai_general_math": 0.8129078149795532,
"eai_open_web_math": 0.5171146392822266,
"eai_web_code": 0.6550244092941284
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-8,725,406,885,713,367,000 | Help us improve your experience.
Let us know what you think.
Do you have time for a two-minute survey?
GET /config/event_sources/log_source_management/ log_source_bulk_tasks/{id}
Retrieves a log source bulk task by ID.
Table 1: GET /config/event_sources/log_source_management/log_source_bulk_tasks/{id} Resource Details
MIME Type
application/json
Table 2: GET /config/event_sources/log_source_management/log_source_bulk_tasks/{id} Request Parameter Details
Parameter
Type
Optionality
Data Type
MIME Type
Description
id
path
Required
String
text/plain
The ID of the log source bulk task to retrieve.
fields
query
Optional
String
text/plain
Optional - Use this parameter to specify which fields you would like to get back in the response. Fields that are not named are excluded. Specify subfields in brackets and multiple fields in the same object are separated by commas.
Table 3: GET /config/event_sources/log_source_management/log_source_bulk_tasks/{id} Response Codes
HTTP Response Code
Unique Code
Description
200
The log source bulk task was retrieved successfully.
404
1001
The log source bulk task ID was not found.
Response Description
The log source bulk task. A log source bulk task contains the following fields:
• id - String - The ID of the bulk task.
• status - Enum - Indicates the status of the bulk task. Possible values are: IN_PROGRESS, COMPLETED_SUCCESSFULLY, COMPLETED_WITH_ERRORS, CANCELLING, CANCELLED.
• operation_statuses - Array - An array of LogSourceBulkOperationStatus. The size and order of this list matches the list of Log Source DTOs that were passed to the bulk endpoint.
A LogSourceBulkOperationStatus contains the following fields:
• log_source_id - Integer - The ID of the log source being operated on.
• operation_type - Enum - The type of operation. Possible values are: CREATE, UPDATE, DELETE.
• http_status - Integer - The HTTP status of the operation. This will be null until the operation completes.
• message - String - The error message. This will only be set if the operation fails, otherwise it will be null.
• unique_code - Integer - The unique error code. This will only be set if the operation fails, otherwise it will be null.
Response Sample
| {
"url": "https://www.juniper.net/documentation/en_US/jsa7.4.2/jsa-api-140/topics/reference/general/api-140-14.0--config-event-sources-log-source-management-log-source-bulk-tasks-id-get.html",
"source_domain": "www.juniper.net",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "18246",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2ZG3YQF3DAIPBO2WVQHPMPHTUSOKWAJA",
"WARC-Concurrent-To": "<urn:uuid:42f5649d-9c4a-46c3-8db3-7ace6ca09fe9>",
"WARC-Date": "2021-05-09T17:58:46Z",
"WARC-IP-Address": "23.51.185.90",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BNAQRCYFDICA4IGBIUXS2V7DUEEQ2XJW",
"WARC-Record-ID": "<urn:uuid:b5692d7b-327b-4cc7-86eb-9e75042dc23c>",
"WARC-Target-URI": "https://www.juniper.net/documentation/en_US/jsa7.4.2/jsa-api-140/topics/reference/general/api-140-14.0--config-event-sources-log-source-management-log-source-bulk-tasks-id-get.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:45f07d95-ed95-4ca8-a355-a3b6b442b199>"
},
"warc_info": "isPartOf: CC-MAIN-2021-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-20.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
33,
34,
62,
63,
105,
106,
108,
109,
185,
186,
188,
189,
229,
230,
331,
332,
342,
343,
360,
361,
471,
472,
482,
483,
488,
489,
501,
502,
512,
513,
523,
524,
536,
537,
540,
541,
546,
547,
556,
557,
564,
565,
576,
577,
625,
626,
633,
634,
640,
641,
650,
651,
658,
659,
670,
671,
903,
904,
1003,
1004,
1023,
1024,
1036,
1037,
1049,
1050,
1054,
1055,
1057,
1058,
1111,
1112,
1116,
1117,
1122,
1123,
1166,
1167,
1188,
1189,
1269,
1270,
1313,
1314,
1477,
1478,
1660,
1661,
1723,
1724,
1798,
1799,
1895,
1896,
2007,
2008,
2123,
2124,
2248,
2249,
2265,
2266,
2268
],
"line_end_idx": [
33,
34,
62,
63,
105,
106,
108,
109,
185,
186,
188,
189,
229,
230,
331,
332,
342,
343,
360,
361,
471,
472,
482,
483,
488,
489,
501,
502,
512,
513,
523,
524,
536,
537,
540,
541,
546,
547,
556,
557,
564,
565,
576,
577,
625,
626,
633,
634,
640,
641,
650,
651,
658,
659,
670,
671,
903,
904,
1003,
1004,
1023,
1024,
1036,
1037,
1049,
1050,
1054,
1055,
1057,
1058,
1111,
1112,
1116,
1117,
1122,
1123,
1166,
1167,
1188,
1189,
1269,
1270,
1313,
1314,
1477,
1478,
1660,
1661,
1723,
1724,
1798,
1799,
1895,
1896,
2007,
2008,
2123,
2124,
2248,
2249,
2265,
2266,
2268,
2269
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2269,
"ccnet_original_nlines": 103,
"rps_doc_curly_bracket": 0.0035257800482213497,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22871045768260956,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05596106871962547,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24087591469287872,
"rps_doc_frac_unique_words": 0.44625407457351685,
"rps_doc_mean_word_length": 5.687296390533447,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.5237579345703125,
"rps_doc_word_count": 307,
"rps_doc_frac_chars_dupe_10grams": 0.06529209762811661,
"rps_doc_frac_chars_dupe_5grams": 0.17754867672920227,
"rps_doc_frac_chars_dupe_6grams": 0.08705613017082214,
"rps_doc_frac_chars_dupe_7grams": 0.06529209762811661,
"rps_doc_frac_chars_dupe_8grams": 0.06529209762811661,
"rps_doc_frac_chars_dupe_9grams": 0.06529209762811661,
"rps_doc_frac_chars_top_2gram": 0.041237108409404755,
"rps_doc_frac_chars_top_3gram": 0.04467353969812393,
"rps_doc_frac_chars_top_4gram": 0.05841923877596855,
"rps_doc_books_importance": -185.99827575683594,
"rps_doc_books_importance_length_correction": -185.99827575683594,
"rps_doc_openwebtext_importance": -124.79035186767578,
"rps_doc_openwebtext_importance_length_correction": -124.79035186767578,
"rps_doc_wikipedia_importance": -116.1946029663086,
"rps_doc_wikipedia_importance_length_correction": -116.1946029663086
},
"fasttext": {
"dclm": 0.04098593816161156,
"english": 0.7105527520179749,
"fineweb_edu_approx": 2.6260855197906494,
"eai_general_math": 0.008361459709703922,
"eai_open_web_math": 0.23695844411849976,
"eai_web_code": 0.253828227519989
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-5,565,009,574,328,035,000 | PlanetCalypsoForum.com :: Entropia Universe Discussion and Resources
Page 1 of 5 1 2 3 4 5 LastLast
Results 1 to 10 of 42
1. #1
Post Entropia Universe wants you to be able to upload your consciousness into its MMO world - PCGamesN
PCGamesN
Entropia Universe wants you to be able to upload your consciousness into its MMO world
PCGamesN
Swedish developer MindArk, creators of the long-running MMO Entropia Universe, have begun working with AI researchers from several universities on a process for uploading human consciousness to their game. MindArk are working with researchers from ...
More...
News feed provided by Google News.
Last edited by Darkaruki; 05-27-2018 at 17:38.
2. #2
Slayer Spawn's Avatar
Joined
Dec 2005
Gender | Ingame
Male | Male
Location
The Netherlands
Avatar
Storm Spawn Bootcamp
Society
The Ministry
Posts
7,744
Images
439
Ian boudreau, that top notch quality journalist. Excellent article! Applause.
3. #3
Elite Haruto Rat's Avatar
Joined
Jul 2013
Avatar
Cunning Haruto Rat
Society
fode et fuge
Posts
3,318
Images
121
Quote Originally Posted by Spawn View Post
This quote is hidden because you are ignoring this member. Show Quote
Ian boudreau, that top notch quality journalist. Excellent article! Applause.
The guy also wrote this:
Russian bots propel indie game to top of Steam charts
I'll refrain from public comments.
There are many ways to skin a cat but just one way to boil a frog.
4. #4
Guardian yeeck's Avatar
Joined
Dec 2015
Gender | Ingame
Male | Male
Avatar
yee yeeck ck
Posts
329
Well done, EU on expanding science projects.
But, don't forget that the consciousness of EU only exist because of EU players are contributing.
EU = RCE.
Please don't forget and continue to make RCE great and more exciting again.
5. #5
Elite LangeTobias's Avatar
Joined
Nov 2009
Gender | Ingame
Male | Male
Location
Gislaved
Avatar
Edgewise
Posts
3,733
Blog Entries
4
Images
259
Quote Originally Posted by yeeck View Post
This quote is hidden because you are ignoring this member. Show Quote
EU = RCE.
to make RCE great
We would need to build a wall separating Boreas from the rest of Eudoria
and we will make them pay for it
If the stuff that comes out of my mouth upsets you, just think of all the things I keep to myself.
6. #6
Guardian yeeck's Avatar
Joined
Dec 2015
Gender | Ingame
Male | Male
Avatar
yee yeeck ck
Posts
329
Quote Originally Posted by LangeTobias View Post
This quote is hidden because you are ignoring this member. Show Quote
We would need to build a wall separating Boreas from the rest of Eudoria
and we will make them pay for it
Well, that's why I said, the management team cannot be run by simple minded people. They need to work hard and stay professional all-time.
Good reputation is important. Reputation will make you paid for everything
7. #7
Alpha
Joined
Jan 2016
Gender | Ingame
Male | Female
Location
Austria
Avatar
Thomas LMTR14 Reisinger
Posts
652
Quote Originally Posted by Haruto Rat View Post
This quote is hidden because you are ignoring this member. Show Quote
The guy also wrote this:
Russian bots propel indie game to top of Steam charts
I'll refrain from public comments.
what's wrong with that article?
you don't have to walk their way
you don't have to watch the show
you don't have to play their game
and you don't have to die to leave entropia
(c) Pain of Salvation, Leaving Entropia (Epilogue)
8. #8
Stalker Fifth's Avatar
Joined
Jan 2012
Avatar
The "Fifth" Entity
Society
The Ministry
Posts
2,712
Blog Entries
1
Images
263
OK, that's gonna be a wall of text... Sry.
As of now, there's no scientific concept of what the consciousness is. We have a fuzzy idea about combinations of neurons firing in large networks... and then consciousness as some sort of emergent phenomenon on top of this electro-chemical process... but so far nobody has managed to replicate the phenomenon. We have more than enough computational power to do that but we don't have a slightest idea how. Therefore we can't even estimate how far or how close we are to cracking this riddle. Maybe somebody will stumble upon it tomorrow, or maybe we will never achieve this.
We just don't know.
To make things even worse, what we do know is the fact that large part of the information processing in the human brain happens on the unconscious level, both inside and outside the brain.
Outside brain!? Yep, you read it right. There's lot's of extremely important functions, for example intuition/creativity that rely largely on your moods/emotions, which in turn are largely regulated by biochemical substances produced by the glands located in different places all over our physical body. For example, successful completion of an important task is a bit of information that is stored chemically. It is very old system, and has been vitally important in the evolution for our distant forefathers in the primitive animal kingdom. There's a record of positions in the hierarchy of the "tribe". To avoid unnecessary fights every member of this collective/tribe stores it's position in the hierarchy. The memory storage unit for this position is chemical, it's stored in the form of pheromonal balance.
We don't know how exactly it would change the behavior of the human beings (or if the consciousness would even function) if we cut off all the hormonal regulation systems in the body and walk away with only the "purer brain".
We do know that such a brain would challenge another member of the collective to the fight to determine it's position on the hierarchy every time it meets them. It has no previous record about the relative position with that specimen, so it assumes it's their first encounter and the positions are yet to be determined... and it keeps doing that every time, until it dies or is damaged beyond it's capability to fight.
The systems regulating behavior related to reproduction is even more ancient, thus also heavily reliant on pheromones. The glands responsible for the whole system are all located outside our brain. We don't know enough about the science of this, but it's pretty safe to assume that a human being that is 100% cut off from the body will have no feeling of burning love. He/she might have an intellectual concept of "sympathy", but can it understand what "Romeo and Julia" is all about? Forget about it.
So this upload thing, you know what's the problem with it? Two words. Childish. Stupid.
* * *
As a side note: Christianity has always believed to resurrect a person you have to physically reconstruct the whole body. Why's that, one would wonder? Wouldn't it be easier to imagine just a some kind of ethereal spirit?
I mean if it's all just made up stories, why choose the most unlikely option, ghost stories have been known and more or less widely accepted for thousands of years. In a sense, the consciousness transfer is just a modern, upgraded version of the traditional ghost story.
Science, weirdly enough, seems to discard the ghost stories and prefer the Christianity's version.
► Fifth's
9. #9
Dominant
Joined
Feb 2006
Gender | Ingame
Male | Male
Location
France / Romania
Avatar
MORFOC AS SERBAN
Society
AF-RFC
Posts
502
Images
52
I especially laugh at this article, a good part of the% of the community has more or less 10 years of seniority. seeing that MA wants us to transfer our money on their account why not their data our money after our death and your "conscience" so that the money remains on the account as it is immortal
Born in Jason Centre in 2003
Ghost Vagabond in 2017
14 years of loot TT
10. #10
Stalker ZPF's Avatar
Joined
Nov 2007
Gender | Ingame
Male | Male
Location
NYC
Avatar
Zelos 'Playboy' Fargen
Society
Freelancer
Posts
1,915
Images
17
They'll have to at least fix the "falling through the ground" bug first. I do not want my consciousness to experience that
Page 1 of 5 1 2 3 4 5 LastLast
Posting Permissions
• You may not post new threads
• You may not post replies
• You may not post attachments
• You may not edit your posts
•
Follow Planet Calypso on Twitter Follow Planet Calypso on Facebook | {
"url": "https://www.planetcalypsoforum.com/forums/showthread.php?304304-Entropia-Universe-wants-you-to-be-able-to-upload-your-consciousness-into-its-MMO-world-PCGamesN&s=75e1a15c4430c7da3f86fd2053360a10",
"source_domain": "www.planetcalypsoforum.com",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "111271",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TA6SOTG4SIH43GXNSCV63AMXHTQUKJLL",
"WARC-Concurrent-To": "<urn:uuid:d99a7863-b9b5-4866-9733-79adccb26238>",
"WARC-Date": "2020-04-05T20:29:44Z",
"WARC-IP-Address": "108.168.212.2",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:JMQRPJPVHE5JZFHTIYTOQARU4U7K7KCK",
"WARC-Record-ID": "<urn:uuid:a4bd10ee-bb22-48b9-92e6-925cb80dabb1>",
"WARC-Target-URI": "https://www.planetcalypsoforum.com/forums/showthread.php?304304-Entropia-Universe-wants-you-to-be-able-to-upload-your-consciousness-into-its-MMO-world-PCGamesN&s=75e1a15c4430c7da3f86fd2053360a10",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a5a2b611-fda5-4654-bfb7-f339e5723618>"
},
"warc_info": "isPartOf: CC-MAIN-2020-16\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-155.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
69,
100,
122,
130,
131,
238,
239,
240,
253,
254,
255,
346,
359,
615,
616,
617,
618,
619,
631,
632,
671,
722,
723,
731,
757,
768,
781,
801,
817,
830,
850,
861,
886,
898,
915,
925,
935,
946,
954,
1036,
1037,
1045,
1075,
1086,
1099,
1110,
1133,
1145,
1162,
1172,
1182,
1193,
1201,
1248,
1322,
1404,
1433,
1434,
1492,
1493,
1532,
1603,
1604,
1612,
1640,
1651,
1664,
1684,
1700,
1711,
1728,
1738,
1746,
1795,
1796,
1898,
1899,
1913,
1993,
1994,
2002,
2033,
2044,
2057,
2077,
2093,
2106,
2119,
2130,
2143,
2153,
2163,
2180,
2186,
2197,
2205,
2252,
2326,
2327,
2341,
2363,
2364,
2441,
2442,
2479,
2582,
2583,
2591,
2619,
2630,
2643,
2663,
2679,
2690,
2707,
2717,
2725,
2778,
2852,
2929,
2930,
2967,
2968,
3111,
3112,
3191,
3192,
3200,
3210,
3221,
3234,
3254,
3272,
3285,
3297,
3308,
3336,
3346,
3354,
3406,
3480,
3509,
3510,
3568,
3569,
3608,
3644,
3681,
3718,
3756,
3804,
3859,
3860,
3868,
3895,
3906,
3919,
3930,
3953,
3965,
3982,
3992,
4002,
4019,
4025,
4036,
4044,
4091,
4092,
4672,
4673,
4697,
4698,
4891,
4892,
5709,
5710,
5940,
6363,
6364,
6870,
6871,
6963,
6964,
6965,
6975,
6976,
7202,
7477,
7478,
7581,
7595,
7596,
7604,
7617,
7628,
7641,
7661,
7677,
7690,
7711,
7722,
7743,
7755,
7766,
7776,
7784,
7795,
7802,
8108,
8141,
8168,
8192,
8193,
8203,
8228,
8239,
8252,
8272,
8288,
8301,
8309,
8320,
8347,
8359,
8374,
8384,
8394,
8405,
8412,
8539,
8540,
8571,
8572,
8592,
8593,
8626,
8655,
8688,
8720,
8726,
8727
],
"line_end_idx": [
69,
100,
122,
130,
131,
238,
239,
240,
253,
254,
255,
346,
359,
615,
616,
617,
618,
619,
631,
632,
671,
722,
723,
731,
757,
768,
781,
801,
817,
830,
850,
861,
886,
898,
915,
925,
935,
946,
954,
1036,
1037,
1045,
1075,
1086,
1099,
1110,
1133,
1145,
1162,
1172,
1182,
1193,
1201,
1248,
1322,
1404,
1433,
1434,
1492,
1493,
1532,
1603,
1604,
1612,
1640,
1651,
1664,
1684,
1700,
1711,
1728,
1738,
1746,
1795,
1796,
1898,
1899,
1913,
1993,
1994,
2002,
2033,
2044,
2057,
2077,
2093,
2106,
2119,
2130,
2143,
2153,
2163,
2180,
2186,
2197,
2205,
2252,
2326,
2327,
2341,
2363,
2364,
2441,
2442,
2479,
2582,
2583,
2591,
2619,
2630,
2643,
2663,
2679,
2690,
2707,
2717,
2725,
2778,
2852,
2929,
2930,
2967,
2968,
3111,
3112,
3191,
3192,
3200,
3210,
3221,
3234,
3254,
3272,
3285,
3297,
3308,
3336,
3346,
3354,
3406,
3480,
3509,
3510,
3568,
3569,
3608,
3644,
3681,
3718,
3756,
3804,
3859,
3860,
3868,
3895,
3906,
3919,
3930,
3953,
3965,
3982,
3992,
4002,
4019,
4025,
4036,
4044,
4091,
4092,
4672,
4673,
4697,
4698,
4891,
4892,
5709,
5710,
5940,
6363,
6364,
6870,
6871,
6963,
6964,
6965,
6975,
6976,
7202,
7477,
7478,
7581,
7595,
7596,
7604,
7617,
7628,
7641,
7661,
7677,
7690,
7711,
7722,
7743,
7755,
7766,
7776,
7784,
7795,
7802,
8108,
8141,
8168,
8192,
8193,
8203,
8228,
8239,
8252,
8272,
8288,
8301,
8309,
8320,
8347,
8359,
8374,
8384,
8394,
8405,
8412,
8539,
8540,
8571,
8572,
8592,
8593,
8626,
8655,
8688,
8720,
8726,
8727,
8794
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 8794,
"ccnet_original_nlines": 242,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3716012239456177,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018731119111180305,
"rps_doc_frac_lines_end_with_ellipsis": 0.008230449631810188,
"rps_doc_frac_no_alph_words": 0.18791541457176208,
"rps_doc_frac_unique_words": 0.41283735632896423,
"rps_doc_mean_word_length": 4.649161338806152,
"rps_doc_num_sentences": 80,
"rps_doc_symbol_to_word_ratio": 0.009667670354247093,
"rps_doc_unigram_entropy": 5.742590427398682,
"rps_doc_word_count": 1371,
"rps_doc_frac_chars_dupe_10grams": 0.1716347634792328,
"rps_doc_frac_chars_dupe_5grams": 0.19579541683197021,
"rps_doc_frac_chars_dupe_6grams": 0.1716347634792328,
"rps_doc_frac_chars_dupe_7grams": 0.1716347634792328,
"rps_doc_frac_chars_dupe_8grams": 0.1716347634792328,
"rps_doc_frac_chars_dupe_9grams": 0.1716347634792328,
"rps_doc_frac_chars_top_2gram": 0.006275489926338196,
"rps_doc_frac_chars_top_3gram": 0.017571380361914635,
"rps_doc_frac_chars_top_4gram": 0.018826479092240334,
"rps_doc_books_importance": -725.724609375,
"rps_doc_books_importance_length_correction": -725.724609375,
"rps_doc_openwebtext_importance": -461.4469299316406,
"rps_doc_openwebtext_importance_length_correction": -461.4469299316406,
"rps_doc_wikipedia_importance": -299.741943359375,
"rps_doc_wikipedia_importance_length_correction": -299.741943359375
},
"fasttext": {
"dclm": 0.029500659555196762,
"english": 0.9432535767555237,
"fineweb_edu_approx": 1.4712560176849365,
"eai_general_math": 0.0024599400348961353,
"eai_open_web_math": 0.224561870098114,
"eai_web_code": 0.00001632999919820577
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "150",
"labels": {
"level_1": "Philosophy and psychology",
"level_2": "Psychology",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "1",
"label": "News/Editorial"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "13",
"label": "News (Org.)"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-2,578,587,210,283,380,700 | Rootkit detection software...
Discussion in 'other software & services' started by Comp01, Aug 15, 2004.
Thread Status:
Not open for further replies.
1. Comp01
Comp01 Registered Member
Joined:
Sep 4, 2003
Posts:
638
I am wondering, is there any free software to help detect rootkits, or a way to do so?
2. gerardwil
gerardwil Registered Member
Joined:
Jan 17, 2004
Posts:
4,746
Location:
The Netherlands
3. Comp01
Comp01 Registered Member
Joined:
Sep 4, 2003
Posts:
638
Is it safe to use?
4. gerardwil
gerardwil Registered Member
Joined:
Jan 17, 2004
Posts:
4,746
Location:
The Netherlands
I am having no probs using it and nothing unexpected happens on my machine.
Gerard
5. cantthinkof1
cantthinkof1 Guest
http://www.3wdesign.es/entrada.html
This is a direct link to the Spanish manufacturor.I don't speak a word of Spanish,but some of the other software offered sounds a tad dodgy.
I hope those are *patches/protection* against exploits,as opposed to the exploits themselves.Can any Spanish speakers lay my mind to rest?
Sorry to sound paranoid,but I am very cautious were apps I haven't heard of are concerned.
6. Sorry,I didn't capture the full link.
You'll have to click where it says: seguridad informática
7. Does anyone know if rootkits can work on Windows 9x/me operating systems, or are they just something users of nt/2k/xp have to worry about? Thanks.
8. The RKDetector is an awful piece of software.Its database is woefully lacking as it identified several .dlls as "hooked" then swept through my harddrive like an Conquistado on crack attempting to disable componants of my firewall,anti virus scanner and Object Desktop.
It was most unfortunate that it arbitrarilly carries out these actions without even seeking confirmation from a judicious human being with eyes and powers of reason.
I suggest this company makes its database more extensive in order that it may correctly identify less well-known anti-virus and firewall packages.Furthermore,there ought to be a means by which the computer operative is asked for confirmation before any attempts to terminate processes are made.
Clearly,this is a specialist piece of kit.A newbie running it could make their system incredibly vulnerable by believing the false-positives to be correct.They'd then skip off onto the Internet oblivious to the fact this programme had successfully terminated their firewall and anti-virus protection.
Incidentally,one of the two web addresses listed in the text file accompanying the app is as follows:
hxxp://www.haxorcitos.com -mmm,small clue in the name.
Luckilly,I have a test machine and the subsequent re-install of the O.S. was no hassle.Just thought I'd let everyone reading know to handle this app with caution.It is at an immature stage in its development.
Loading...
Thread Status:
Not open for further replies. | {
"url": "http://www.wilderssecurity.com/threads/rootkit-detection-software.44591/",
"source_domain": "www.wilderssecurity.com",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "55499",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IRJBIP4H6QEKM5PHE47E47TSD55P2G34",
"WARC-Concurrent-To": "<urn:uuid:161d2354-584c-4774-8869-5c712009aa9e>",
"WARC-Date": "2016-10-23T15:12:39Z",
"WARC-IP-Address": "104.236.97.180",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:WXB7S7FSA7IXSJUL2X7OY4GD3VIF6NGK",
"WARC-Record-ID": "<urn:uuid:956d2b47-a2fa-4c27-94e3-149ddfb3436d>",
"WARC-Target-URI": "http://www.wilderssecurity.com/threads/rootkit-detection-software.44591/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:287be4ee-520f-4f86-9c62-6b8a82077847>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-6-4.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-44\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for October 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
30,
31,
106,
107,
122,
152,
164,
165,
194,
195,
207,
223,
234,
242,
333,
339,
354,
355,
387,
388,
400,
417,
428,
438,
452,
472,
484,
485,
514,
515,
527,
543,
554,
562,
585,
591,
606,
607,
639,
640,
652,
669,
680,
690,
704,
724,
804,
805,
816,
822,
840,
841,
864,
865,
905,
906,
1051,
1052,
1195,
1196,
1291,
1297,
1340,
1341,
1403,
1409,
1562,
1568,
1842,
1843,
2013,
2014,
2313,
2314,
2619,
2620,
2726,
2727,
2786,
2787,
3000,
3006,
3017,
3032
],
"line_end_idx": [
30,
31,
106,
107,
122,
152,
164,
165,
194,
195,
207,
223,
234,
242,
333,
339,
354,
355,
387,
388,
400,
417,
428,
438,
452,
472,
484,
485,
514,
515,
527,
543,
554,
562,
585,
591,
606,
607,
639,
640,
652,
669,
680,
690,
704,
724,
804,
805,
816,
822,
840,
841,
864,
865,
905,
906,
1051,
1052,
1195,
1196,
1291,
1297,
1340,
1341,
1403,
1409,
1562,
1568,
1842,
1843,
2013,
2014,
2313,
2314,
2619,
2620,
2726,
2727,
2786,
2787,
3000,
3006,
3017,
3032,
3061
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3061,
"ccnet_original_nlines": 84,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33901193737983704,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02214650996029377,
"rps_doc_frac_lines_end_with_ellipsis": 0.023529410362243652,
"rps_doc_frac_no_alph_words": 0.21976150572299957,
"rps_doc_frac_unique_words": 0.6301369667053223,
"rps_doc_mean_word_length": 5.182648181915283,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.0034071600530296564,
"rps_doc_unigram_entropy": 5.316866397857666,
"rps_doc_word_count": 438,
"rps_doc_frac_chars_dupe_10grams": 0.11453744024038315,
"rps_doc_frac_chars_dupe_5grams": 0.1462555080652237,
"rps_doc_frac_chars_dupe_6grams": 0.1462555080652237,
"rps_doc_frac_chars_dupe_7grams": 0.1462555080652237,
"rps_doc_frac_chars_dupe_8grams": 0.11453744024038315,
"rps_doc_frac_chars_dupe_9grams": 0.11453744024038315,
"rps_doc_frac_chars_top_2gram": 0.028193829581141472,
"rps_doc_frac_chars_top_3gram": 0.038766518235206604,
"rps_doc_frac_chars_top_4gram": 0.016740089282393456,
"rps_doc_books_importance": -249.5785675048828,
"rps_doc_books_importance_length_correction": -249.5785675048828,
"rps_doc_openwebtext_importance": -141.63760375976562,
"rps_doc_openwebtext_importance_length_correction": -141.63760375976562,
"rps_doc_wikipedia_importance": -114.02385711669922,
"rps_doc_wikipedia_importance_length_correction": -114.02385711669922
},
"fasttext": {
"dclm": 0.046507660299539566,
"english": 0.9369093775749207,
"fineweb_edu_approx": 1.5940477848052979,
"eai_general_math": 0.030513880774378777,
"eai_open_web_math": 0.2015981674194336,
"eai_web_code": 0.00019758999405894428
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-5,031,041,464,409,517,000 |
Forgot your password?
typodupeerror
Comment: Let's all change our names. (Score 1) 282
by TractorBarry (#47580133) Attached to: UK Government Report Recommends Ending Online Anonymity
A simple solution will be for everbody in the UK to change their name by deed poll to Luther Blisset. Then whenever you sign up for something just pick any old address. We're all Luther Blisset !
The political class in the UIK really are a bunch of evil, selfish, greedy bastards.
Comment: And the technically literate... (Score 1) 191
And the technically literate are even more afraid of the internet because they know how shoddy a lot of the code running it is.
Not to mention the sheer crapulence of the average website (all javascript links, flash abominations, piss poor use of graphics, loading of javascript from multiple domains most of which is not even used etc. etc. etc.)
And let's not get started on how utterly dreadful the usability is on a lot of sites.
I've gone from being an early adopter to refusing to do a lot of things online (i.e. banking, paying bills etc.). It's not worth dealing with the complete suckage.
Comment: Re:I won't upgrade. (Score 1) 681
> i can still run a DOS app on win 7
Yeah but you can't run XP drivers. Which breaks perfectly functional, excellent quality, EXPENSIVE, old hardware which quite a lot of us have.
One of the main reasons many of us had for using Windows was that you almost always used to be able to run your old stuff on the new stuff.
Now they just arbitarily break things on every release, introduce crap that everyone sane hates and release far too often.
My XP machines will be running until I die. In 2038 I'll reset them to 2000 and carry on (assuming I'm still alive). I've got spare motherboards, disks, graphics cards, etc. etc.stockpiled (One of the advantages of the sheeple upgrading when they're told is I get to buy perfectly functioning quality hardware for peanuts)
I run a PC to run the hardware and software I want to use. Not to "experience" the latest desktop metaphor thought up buy some 13 year old hipster who has no fucking clue about what an actual usable, productive interface looks like.
Personally I'd really like a 64 bit DOS based machine which would boot up to a truly minimal set up (kernel, access to hardware and filestore etc.) then just let me run the software I want.
Comment: "Life" != Life (Score 2) 216
by TractorBarry (#47170711) Attached to: Life Sentences For Serious Cyberattacks Proposed In Britain
The phrase "life imprisonment" means nothing in the UK. Recently a man absconded from a prison who was said to be serving 3 life sentences. From reading the newspaper article reporting the case it transpired that his tariff was actually 13 years (sorry can't remember which paper or exact details).
So when being used by the UK justice system the term "life" would seem to refer to about an average dogs life. It's totally meaningless and quite frankly an insult to your intelligence.
This being the case "life" for computer related offences will probably mean you serve about 1/2 hour in an open prison - unless you take some money off someone powerful in which case you'll probably get a "life" sentence of about 10 years.
This doesn't take away fropm the fact that this is anoter pathetic, ill thought out, idea for legislation dreamt up by one of the useless cretins currently in parliament.
The UK justice system is a sad joke whose only purpose is to protect the rich and powerful (same as the world over really)
Comment: Cloud is dead (Score 4, Insightful) 142
by TractorBarry (#47127455) Attached to: Amazon Wants To Run Your High-Performance Databases
Dear America,
Following the Snowden revelations your NSA inspired dream of cloud computing and total social networking (i.e. full access too all the data in the world) is dead.
Nobody with a brain would even think of storing their data on an American computing resource.
Sincerely yours,
The rest of the world.
Comment: And who decides what's available ? (Score 1) 339
by TractorBarry (#47127293) Attached to: The Energy Saved By Ditching DVDs Could Power 200,000 Homes
So who controls what's available for streaming ? Corporations (again)
Ooh look, all those wonderful independent releases just dissapeared from the face of the earth because some uncultutred turd decided it was no longer commerically viable to store them.
Just look at the BBC and how most tapes of the early episodes of Derek and Clive got put into landfill so they could make space for tapes of Pan-o-bloody-rama (crapulent propoganda at it's finest) How many episodes of Dr Who have also been lost ? How many other culturally interesting things have been lost ?
If something's going to be streamed it'd better be in a format that I can make a local copy or I'm totally uninterested. I'm not paying per view and I'm not having what's available at any point controlled by some tasteless old white man in a suit whose only interest is rent seeking from other people's contributions to human culture.
So no thanks I like my local copies. I control them. Once I do get a spinning disc the first thing I do is remove the adverts and convert it to digital format so it only spins the one time I transcode it anyway.
Comment: Re:I have your conversion right here... (Score 1) 860
by TractorBarry (#46409487) Attached to: Microsoft's Attempt To Convert Users From Windows XP Backfires
I hear you. I'm stuck on Windows XP due to using Logic 5.5.1, 2 x Audiowerk8 cards and 2 Unitor interfaces.
The drivers for the hardware don't work post XP, not all the VSTs I use work post XP, not sure if Logic 5 will work post XP (some folks say it does but without the hardware working I've not even bothered to try it) so upgrading this machine simply isn't an option.
I've been using this setup for over a decade and I've got somewhere near a thousand songs/mixes etc. in Logic. This setup does what I need and I can whizz round it at great speed so I don't give a shit what Microsoft thinks about upgrading. I'll be running XP until either the hardware dies or I do (with me being more likely to go first).
Just recently stocked up on spare motherboard, hard drives, PSUs, processor & RAM just in case :)
New does not always mean better (hell, look at Windows 8 - it's absolute shite ;)
Comment: Re:Why? (Score 1) 255
by TractorBarry (#46302741) Attached to: Ubuntu 14.04 Brings Back Menus In Application Windows
Wish I had mod points today because you're spot on. If someone wants to radically experiment with a new interface paradigm they should fork the existing app and damn well leave the existing one alone.
Especially when it comes to the desktop GUI and the file manager. Give the new shit as an option, but damn well leave the old shit in place as an option too and allow the user to choose which one they want to use.
Coders need to learn to respect users. People use computers as tools and tools should not be arbitarily changed.
Can you imagine if programmers made hand tools ? You'd come in to work one morning to find your hammer was a paintbrush head glued to the end of a chopstick and the nails had been replaced with rubber toothpicks because some newbie fresh out of kindergarten has decided that's all they need to do and it "lookz kewl".
In a consumer society there are inevitably two kinds of slaves: the prisoners of addiction and the prisoners of envy.
Working... | {
"url": "http://slashdot.org/~TractorBarry",
"source_domain": "slashdot.org",
"snapshot_id": "crawl=CC-MAIN-2014-42",
"warc_metadata": {
"Content-Length": "95608",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FXC6AKGEOVD74ZRJ5ZXHLPVV7ND2VZ4T",
"WARC-Concurrent-To": "<urn:uuid:0645578c-e0f7-463f-85ea-150b83eb4d60>",
"WARC-Date": "2014-10-24T07:56:21Z",
"WARC-IP-Address": "216.34.181.45",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:KLLQ7UCDHBSS3JM6ESK2MMT7K4KT7BC7",
"WARC-Record-ID": "<urn:uuid:36831973-9d50-4abc-850b-b80da98b2c05>",
"WARC-Target-URI": "http://slashdot.org/~TractorBarry",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a8e575e5-db2a-4459-adb5-0e3beecc01bb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-16-133-185.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-42\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for October 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
2,
3,
4,
5,
27,
41,
42,
93,
94,
191,
192,
388,
389,
474,
475,
530,
531,
659,
660,
880,
881,
967,
968,
1132,
1133,
1176,
1177,
1214,
1215,
1358,
1359,
1499,
1500,
1623,
1624,
1947,
1948,
2181,
2182,
2372,
2373,
2411,
2412,
2513,
2514,
2813,
2814,
3000,
3001,
3241,
3242,
3413,
3414,
3537,
3538,
3587,
3588,
3681,
3682,
3696,
3697,
3860,
3861,
3955,
3956,
3973,
3974,
3997,
3998,
4056,
4057,
4158,
4159,
4229,
4230,
4415,
4416,
4725,
4726,
5061,
5062,
5274,
5275,
5338,
5339,
5443,
5444,
5552,
5553,
5818,
5819,
6159,
6160,
6258,
6259,
6341,
6342,
6373,
6374,
6469,
6470,
6671,
6672,
6886,
6887,
7000,
7001,
7319,
7320,
7438,
7439
],
"line_end_idx": [
2,
3,
4,
5,
27,
41,
42,
93,
94,
191,
192,
388,
389,
474,
475,
530,
531,
659,
660,
880,
881,
967,
968,
1132,
1133,
1176,
1177,
1214,
1215,
1358,
1359,
1499,
1500,
1623,
1624,
1947,
1948,
2181,
2182,
2372,
2373,
2411,
2412,
2513,
2514,
2813,
2814,
3000,
3001,
3241,
3242,
3413,
3414,
3537,
3538,
3587,
3588,
3681,
3682,
3696,
3697,
3860,
3861,
3955,
3956,
3973,
3974,
3997,
3998,
4056,
4057,
4158,
4159,
4229,
4230,
4415,
4416,
4725,
4726,
5061,
5062,
5274,
5275,
5338,
5339,
5443,
5444,
5552,
5553,
5818,
5819,
6159,
6160,
6258,
6259,
6341,
6342,
6373,
6374,
6469,
6470,
6671,
6672,
6886,
6887,
7000,
7001,
7319,
7320,
7438,
7439,
7449
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7449,
"ccnet_original_nlines": 111,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 4,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40963855385780334,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.035510461777448654,
"rps_doc_frac_lines_end_with_ellipsis": 0.008928569965064526,
"rps_doc_frac_no_alph_words": 0.17501585185527802,
"rps_doc_frac_unique_words": 0.4747866690158844,
"rps_doc_mean_word_length": 4.525989055633545,
"rps_doc_num_sentences": 74,
"rps_doc_symbol_to_word_ratio": 0.005707039963454008,
"rps_doc_unigram_entropy": 5.843606472015381,
"rps_doc_word_count": 1289,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.008570450358092785,
"rps_doc_frac_chars_top_3gram": 0.004113819915801287,
"rps_doc_frac_chars_top_4gram": 0.008570450358092785,
"rps_doc_books_importance": -606.4949340820312,
"rps_doc_books_importance_length_correction": -606.4949340820312,
"rps_doc_openwebtext_importance": -361.6712646484375,
"rps_doc_openwebtext_importance_length_correction": -361.6712646484375,
"rps_doc_wikipedia_importance": -249.25997924804688,
"rps_doc_wikipedia_importance_length_correction": -249.25997924804688
},
"fasttext": {
"dclm": 0.4067021608352661,
"english": 0.9531267881393433,
"fineweb_edu_approx": 1.3264774084091187,
"eai_general_math": 0.1579347848892212,
"eai_open_web_math": 0.16606682538986206,
"eai_web_code": 0.06515253335237503
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.01",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "343.73",
"labels": {
"level_1": "Social sciences",
"level_2": "Law",
"level_3": "Criminal law"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-2,391,196,376,280,708,000 | 1
I need to search the current directory and its sub-directories for regular files containing the words: "hello"
Why does this not work for me:
find . -type f | grep "hello"
1
• grep -Rn hello ..
– DopeGhoti
Commented Apr 18, 2017 at 21:02
3 Answers 3
0
You want to pipe find into xargs, which will read correctly the results of find:
find . -type f -print0 | xargs grep "hello"
See the xargs(1) man page for more info.
1
• You'll need -0 for xargs to match that -print0, or to instead just use find . -type f -exec grep "hello" {} +
– thrig
Commented Apr 18, 2017 at 20:55
0
With the command that you are proposing, you are looking for any filenames with the string hello in it RATHER than the string hello in the file contents. Use the below construct:
find . -type f -exec grep -n hello /dev/null {} +
0
So, you can actually use -regex option of the find command.
find . -type f -regex ".*/.*hello.*"
.*hello.* -- matches names contains word "hello". .*/ is needed because find command returns the full path.
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged . | {
"url": "https://unix.stackexchange.com/questions/359782/printing-file-name-and-line-number-of-files-matching-a-pattern",
"source_domain": "unix.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "169730",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:P634BT5Y5Y3QLSSBYGCAOPT3NSDOCF3U",
"WARC-Concurrent-To": "<urn:uuid:b422bcbd-9d7f-4d57-beed-f20f5590e4db>",
"WARC-Date": "2024-08-09T03:06:08Z",
"WARC-IP-Address": "104.18.43.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VF25WVZZ6X3JJDCII6MGFZR4XACRAOYI",
"WARC-Record-ID": "<urn:uuid:2905c88d-7ad5-4c3e-9301-51d4c6b0522a>",
"WARC-Target-URI": "https://unix.stackexchange.com/questions/359782/printing-file-name-and-line-number-of-files-matching-a-pattern",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3b3d2c56-460f-4954-b047-a191bfab66ae>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-156\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
3,
114,
115,
146,
147,
177,
179,
201,
217,
253,
254,
266,
267,
269,
270,
351,
352,
396,
397,
438,
439,
441,
555,
567,
603,
605,
606,
785,
786,
836,
838,
839,
899,
900,
937,
938,
1046,
1047,
1088,
1089
],
"line_end_idx": [
2,
3,
114,
115,
146,
147,
177,
179,
201,
217,
253,
254,
266,
267,
269,
270,
351,
352,
396,
397,
438,
439,
441,
555,
567,
603,
605,
606,
785,
786,
836,
838,
839,
899,
900,
937,
938,
1046,
1047,
1088,
1089,
1155
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1155,
"ccnet_original_nlines": 41,
"rps_doc_curly_bracket": 0.0034632000606507063,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3333333432674408,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007326010148972273,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.32967033982276917,
"rps_doc_frac_unique_words": 0.5555555820465088,
"rps_doc_mean_word_length": 4.1565656661987305,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.388803482055664,
"rps_doc_word_count": 198,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0899149477481842,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.048602670431137085,
"rps_doc_frac_chars_top_3gram": 0.05467801168560982,
"rps_doc_frac_chars_top_4gram": 0.04374241083860397,
"rps_doc_books_importance": -111.46485900878906,
"rps_doc_books_importance_length_correction": -111.46485900878906,
"rps_doc_openwebtext_importance": -74.63905334472656,
"rps_doc_openwebtext_importance_length_correction": -72.48773956298828,
"rps_doc_wikipedia_importance": -40.508087158203125,
"rps_doc_wikipedia_importance_length_correction": -40.508087158203125
},
"fasttext": {
"dclm": 0.11001492291688919,
"english": 0.8274261355400085,
"fineweb_edu_approx": 1.263704776763916,
"eai_general_math": 0.022718610242009163,
"eai_open_web_math": 0.13084709644317627,
"eai_web_code": 0.002368150046095252
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.442",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
8,119,772,469,044,475,000 | Export (0) Print
Expand All
Expand Minimize
SORT Command
Visual Studio .NET 2003
Sorts records in the currently selected table and outputs the sorted records to a new table.
SORT TO TableNameON FieldName1 [/A | /D] [/C]
[, FieldName2 [/A | /D] [/C] ...] [ASCENDING | DESCENDING]
[Scope] [FOR lExpression1] [WHILE lExpression2]
[FIELDS FieldNameList | FIELDS LIKE Skeleton
| FIELDS EXCEPT Skeleton] [NOOPTIMIZE]
Parameters
TableName
Specifies the name of the new table containing the sorted records. Visual FoxPro assumes a .dbf file name extension for tables. A .dbf extension is automatically assigned if the file name you include doesn't have an extension.
ON FieldName1
Specifies the field in the currently selected table on which the sort is based. The contents and data type of the field determine the order of the records in the new table. By default, the sort is done in ascending order. You can't sort on memo or general fields.
The following example sorts a table on the cust_id field. The customer table is opened and sorted, creating a new table named temp. The records in temp are ordered by the cust_id field.
CLOSE DATABASES
OPEN DATABASE (HOME(2) + 'data\testdata')
USE customer && Opens Customer table
CLEAR
LIST FIELDS company, cust_id NEXT 3
SORT TO temp ON cust_id
USE temp
LIST FIELDS company, cust_id NEXT 3
WAIT WINDOW 'Now sorted on CUST_ID' NOWAIT
You can include additional field names (FieldName2, FieldName3) to further order the new table. The first field FieldName1 is the primary sort field, the second field FieldName2 is the secondary sort field, and so on.
[/A | /D] [/C]
For each field you include in the sort, you can specify an ascending or descending sort order. /A specifies an ascending order for the field. /D specifies a descending order. /A or /D can be included with any type of field.
By default, the field sort order for character fields is case sensitive. If you include the /C option after the name of a character field, case is ignored. You can combine the /C option with the /A or /D option. For example, /AC or /DC.
In the following example, a new table named clients is created. The orders table is sorted on the order_date field in ascending order and the freight field in descending order.
USE orders
SORT TO clients ON order_date/A,freight/D
ASCENDING
Specifies an ascending order for all fields not followed by /D.
DESCENDING
Specifies a descending order for all fields not followed by /A.
If you omit either ASCENDING or DESCENDING, the sort order is ascending by default.
Scope
Specifies a range of records to sort. The scope clauses are: ALL, NEXT nRecords, RECORD nRecordNumber, and REST.
The default scope for SORT is ALL records.
FOR lExpression1
Specifies that only the records in the current table for which the logical condition lExpression1 evaluates to true (.T.) are included in the sort. Including FOR lets you conditionally sort records, filtering out undesired records.
Rushmore optimizes a SORT ... FOR command if lExpression1 is an optimizable expression. For best performance, use an optimizable expression in the FOR clause.
A discussion of expressions that Rushmore can optimize appears in Optimizing Applications.
WHILE lExpression2
Specifies a condition whereby records from the current table are included in the sort for as long as the logical expression lExpression2 evaluates to true (.T.).
FIELDS FieldNameList
Specifies fields from the original table to include in the new table that SORT creates. If you omit the FIELDS clause, all fields from the original table are included in the new table.
FIELDS LIKE Skeleton
Specifies that fields from the original table that match the field skeleton Skeleton are included in the new table that SORT creates.
FIELDS EXCEPT Skeleton
Specifies that all fields except those that match the field skeleton Skeleton are included in the new table that SORT creates.
The field skeleton Skeleton supports wildcards. For example, to specify that all fields that begin with the letters A and P are included in the new table, use the following:
SORT TO mytable ON myfield FIELDS LIKE A*,P*
The LIKE clause can be combined with the EXCEPT clause:
SORT TO mytable ON myfield FIELDS LIKE A*,P* EXCEPT PARTNO*
NOOPTIMIZE
Disables Rushmore optimization of SORT.
For more information, see SET OPTIMIZE and Using Rushmore to Speed Data Access.
Remarks
One or more specified fields in the current table determine the order in which the records appear in the new table.
Caution Be sure you have enough disk space for the new table and the temporary work files created during the sort. The disk space needed to perform a sort can be as much as three times the size of the source table. The amount of available disk space can be determined with DISKSPACE( ) and SYS(2020). If you run out of disk space during a sort, Visual FoxPro displays an error message, and the temporary work files are deleted.
Character-type fields that contain numbers and spaces might not sort in the order you expect. Numeric fields fill from right to left, with empty spaces to the left. In contrast, character fields fill from left to right, with empty spaces to the right.
For example, if two records in a table contain a character field with 1724 in one record and 18 in the other, and the table is sorted on this field in ascending order, the record containing 1724 appears before the record containing 18. This is because Visual FoxPro reads each character in the character fields from left to right, and because 17 (in 1724) is less than 18 (in 18), it puts 1724 first. To avoid this problem, always precede lower numbers with leading zeros (0018) or make the field numeric.
See Also
COPY FILE | DISKSPACE( ) | INDEX | SYS(2020) - Default Disk Size
Show:
© 2015 Microsoft | {
"url": "https://msdn.microsoft.com/en-us/library/88deb654(v=vs.71).aspx",
"source_domain": "msdn.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "156325",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ATGPOBYF4PAVLEWAXOWX6WRPLKWGK4LJ",
"WARC-Concurrent-To": "<urn:uuid:f41a99fe-ac10-4187-9189-f82b439deea0>",
"WARC-Date": "2015-05-30T05:06:16Z",
"WARC-IP-Address": "157.56.148.19",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:SAAPTDL52RSPCAVXXLUW6ZR7YTH23NIT",
"WARC-Record-ID": "<urn:uuid:9bbb7ca8-d34c-4853-b986-39209dcb245a>",
"WARC-Target-URI": "https://msdn.microsoft.com/en-us/library/88deb654(v=vs.71).aspx",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ce018497-0b9f-4e2b-9fdb-86b66056c901>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-206-219.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
17,
28,
44,
45,
58,
59,
83,
84,
177,
178,
224,
288,
339,
389,
433,
434,
445,
446,
456,
683,
697,
961,
962,
1148,
1149,
1165,
1207,
1245,
1251,
1287,
1311,
1320,
1356,
1399,
1400,
1618,
1619,
1634,
1858,
1859,
2096,
2097,
2274,
2275,
2286,
2328,
2338,
2402,
2413,
2477,
2478,
2562,
2563,
2569,
2682,
2683,
2726,
2727,
2744,
2976,
2977,
3136,
3137,
3228,
3229,
3248,
3410,
3431,
3616,
3637,
3771,
3794,
3921,
3922,
4096,
4097,
4142,
4143,
4199,
4200,
4260,
4271,
4311,
4312,
4392,
4393,
4401,
4402,
4518,
4519,
4949,
4950,
5202,
5203,
5709,
5710,
5719,
5720,
5785,
5786,
5792
],
"line_end_idx": [
17,
28,
44,
45,
58,
59,
83,
84,
177,
178,
224,
288,
339,
389,
433,
434,
445,
446,
456,
683,
697,
961,
962,
1148,
1149,
1165,
1207,
1245,
1251,
1287,
1311,
1320,
1356,
1399,
1400,
1618,
1619,
1634,
1858,
1859,
2096,
2097,
2274,
2275,
2286,
2328,
2338,
2402,
2413,
2477,
2478,
2562,
2563,
2569,
2682,
2683,
2726,
2727,
2744,
2976,
2977,
3136,
3137,
3228,
3229,
3248,
3410,
3431,
3616,
3637,
3771,
3794,
3921,
3922,
4096,
4097,
4142,
4143,
4199,
4200,
4260,
4271,
4311,
4312,
4392,
4393,
4401,
4402,
4518,
4519,
4949,
4950,
5202,
5203,
5709,
5710,
5719,
5720,
5785,
5786,
5792,
5808
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5808,
"ccnet_original_nlines": 101,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3263707458972931,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.1070496067404747,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1775456964969635,
"rps_doc_frac_unique_words": 0.2867647111415863,
"rps_doc_mean_word_length": 4.80042028427124,
"rps_doc_num_sentences": 62,
"rps_doc_symbol_to_word_ratio": 0.0017406400293111801,
"rps_doc_unigram_entropy": 4.85330867767334,
"rps_doc_word_count": 952,
"rps_doc_frac_chars_dupe_10grams": 0.031509850174188614,
"rps_doc_frac_chars_dupe_5grams": 0.1568927764892578,
"rps_doc_frac_chars_dupe_6grams": 0.0884026288986206,
"rps_doc_frac_chars_dupe_7grams": 0.06564550846815109,
"rps_doc_frac_chars_dupe_8grams": 0.04638950154185295,
"rps_doc_frac_chars_dupe_9grams": 0.031509850174188614,
"rps_doc_frac_chars_top_2gram": 0.02078774943947792,
"rps_doc_frac_chars_top_3gram": 0.024070020765066147,
"rps_doc_frac_chars_top_4gram": 0.019912470132112503,
"rps_doc_books_importance": -438.2401428222656,
"rps_doc_books_importance_length_correction": -438.2401428222656,
"rps_doc_openwebtext_importance": -263.73260498046875,
"rps_doc_openwebtext_importance_length_correction": -263.73260498046875,
"rps_doc_wikipedia_importance": -211.19056701660156,
"rps_doc_wikipedia_importance_length_correction": -211.19056701660156
},
"fasttext": {
"dclm": 0.5684064030647278,
"english": 0.8303337693214417,
"fineweb_edu_approx": 1.7710928916931152,
"eai_general_math": 0.681152880191803,
"eai_open_web_math": 0.26494842767715454,
"eai_web_code": 0.6449322700500488
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-6,647,953,217,575,008,000 | Category:
What Does a Production Analyst Do?
Production analysts may be responsible for installing network switches or ensuring load balance across servers.
Article Details
• Written By: Carol Francois
• Edited By: Heather Bailey
• Last Modified Date: 24 November 2014
• Copyright Protected:
2003-2014
Conjecture Corporation
• Print this Article
Free Widgets for your Site/Blog
The Queen of England legally owns about one-sixth of all of the land on Earth. more...
December 20 , 1860 : South Carolina seceded from the US. more...
A production analyst is a member of the information technology department for a large organization. They are responsible for managing the computer programs and processes that are run in the background of large computer systems. A person in this role requires a combination of mainframe, technical, and processing training. In many organizations, a production analyst is also known as a production controller.
There are four main tasks of a production analyst: scheduling jobs, running jobs, managing resources, and performing maintenance on the system. The exact type of skills required depends on the computer infrastructure, operating system, and related security protocols. This role is central to the ongoing processing of computer programs and is often required to be on-call 24 hours a day, seven days a week.
Scheduling computer jobs is based on the different processors, time required for each job, priority, and data accessed. The system developers or functional manager submits requests for jobs to be added to the schedule. Multiple jobs are typically scheduled simultaneously, but it is important to ensure that each program is updating unrelated systems.
Running the jobs requires updating of the variants with the correct data, monitoring the progress, and controlling the output. The production analyst is responsible for informing the user of any issues with the job and managing the process to ensure the best use of existing resources.
Ad
Resource management includes optimization of databases, cloning of systems, and partitioning the hard drives. Additional processes might include reconfiguration of the infrastructure, installation of network switches, and load balancing tools. This is a very important function, as it is more efficient to maximize existing resources than to purchase new ones.
Performance maintenance involves the regular review of usage reports, down time statistics, and overall system maintenance. All operating system software packages have regular patches or additional code that is used to fix known problems or enhance existing security. The application of these patches requires a skilled production analyst who understands the implication of the changes and can manage the entire process.
The production analyst usually reports to the technical manager. There are often two or three people in this role, due to the need for a resource to be constantly available. This is a mid-level position, as it has significant responsibility.
An error can cause important systems to fail, or undermine the technical infrastructure of the organization. The vast majority of technical managers have worked as a production analyst at some point in their career. This experience is necessary to truly understand the impact of decision making on a large computer system.
Ad
More from Wisegeek
You might also Like
Discuss this Article
Post your comments
Post Anonymously
Login
username
password
forgot password?
Register
username
password
confirm
email | {
"url": "http://www.wisegeek.com/what-does-a-production-analyst-do.htm",
"source_domain": "www.wisegeek.com",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "67895",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F2ZRD4V3S5YVO6YHGA2KKW2MXG6AJZFT",
"WARC-Concurrent-To": "<urn:uuid:2986e2fa-2b0c-45ac-a28b-6cdd4fae567e>",
"WARC-Date": "2014-12-21T05:34:13Z",
"WARC-IP-Address": "162.210.232.130",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:U6XT67JOQUUEYE47JJ5BZIQNIE6AKELL",
"WARC-Record-ID": "<urn:uuid:5da31e39-9565-48fc-ae6e-fec9ccc21b2d>",
"WARC-Target-URI": "http://www.wisegeek.com/what-does-a-production-analyst-do.htm",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e68879f6-55b0-404e-81df-6e21b78bd3f2>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-231-17-201.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-52\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for December 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
11,
12,
47,
48,
160,
176,
207,
237,
278,
303,
317,
344,
367,
399,
487,
488,
556,
557,
966,
967,
1374,
1375,
1727,
1728,
2014,
2015,
2018,
2019,
2380,
2381,
2802,
2803,
3045,
3046,
3369,
3370,
3373,
3374,
3393,
3394,
3414,
3415,
3436,
3437,
3456,
3457,
3474,
3475,
3481,
3482,
3491,
3500,
3517,
3518,
3527,
3528,
3537,
3546,
3554
],
"line_end_idx": [
11,
12,
47,
48,
160,
176,
207,
237,
278,
303,
317,
344,
367,
399,
487,
488,
556,
557,
966,
967,
1374,
1375,
1727,
1728,
2014,
2015,
2018,
2019,
2380,
2381,
2802,
2803,
3045,
3046,
3369,
3370,
3373,
3374,
3393,
3394,
3414,
3415,
3436,
3437,
3456,
3457,
3474,
3475,
3481,
3482,
3491,
3500,
3517,
3518,
3527,
3528,
3537,
3546,
3554,
3559
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3559,
"ccnet_original_nlines": 59,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34590163826942444,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004918029997497797,
"rps_doc_frac_lines_end_with_ellipsis": 0.03333333134651184,
"rps_doc_frac_no_alph_words": 0.13278688490390778,
"rps_doc_frac_unique_words": 0.5149253606796265,
"rps_doc_mean_word_length": 5.417910575866699,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0.0032786899246275425,
"rps_doc_unigram_entropy": 5.107604026794434,
"rps_doc_word_count": 536,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04683196172118187,
"rps_doc_frac_chars_top_3gram": 0.03099174052476883,
"rps_doc_frac_chars_top_4gram": 0.013774099759757519,
"rps_doc_books_importance": -257.54779052734375,
"rps_doc_books_importance_length_correction": -257.54779052734375,
"rps_doc_openwebtext_importance": -155.76039123535156,
"rps_doc_openwebtext_importance_length_correction": -155.76039123535156,
"rps_doc_wikipedia_importance": -78.42852020263672,
"rps_doc_wikipedia_importance_length_correction": -78.42852020263672
},
"fasttext": {
"dclm": 0.06509625911712646,
"english": 0.9304236769676208,
"fineweb_edu_approx": 2.701089859008789,
"eai_general_math": 0.04220492020249367,
"eai_open_web_math": 0.16971242427825928,
"eai_web_code": 0.018462060019373894
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.403",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
1,356,965,992,511,048,000 | Logsedit
Use the Logs UI to explore logs for common servers, containers, and services. Kibana provides a compact, console-like display that you can customize.
Log Console in Kibana
Add dataedit
Kibana provides step-by-step instructions to help you add log data. The Infrastructure Monitoring Guide is a good source for more detailed information and instructions.
Configure data sourcesedit
The filebeat-* index pattern is used to query data by default. If your logs are located in a different set of indices, or use a different timestamp field, you can adjust the source configuration via the user interface or the Kibana configuration file.
Logs and Infrastructure share a common data source definition in each space. Changes in one of them can influence the data displayed in the other.
Configure sourceedit
Configure source can be accessed via the corresponding Configure source icon button in the toolbar.
Configure Logs UI source button in Kibana
This opens the source configuration fly-out dialog, in which the following configuration items can be inspected and adjusted:
• Name: The name of the source configuration.
• Indices: The patterns of the elasticsearch indices to read metrics and logs from.
• Fields: The names of particular fields in the indices that need to be known to the Infrastructure and Logs UIs in order to query and interpret the data correctly.
Configure logs UI source dialog in Kibana
If Spaces are enabled in your Kibana instance, any configuration changes performed via Configure source are specific to that space. You can therefore easily make different subsets of the data available by creating multiple spaces with different data source configurations.
Configuration fileedit
The settings in the configuration file are used as a fallback when no other configuration for that space has been defined. They are located in the configuration namespace xpack.infra.sources.default. See Logs UI settings for a complete list of the possible entries. | {
"url": "https://www.elastic.co/guide/en/kibana/7.0/xpack-logs.html",
"source_domain": "www.elastic.co",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "14763",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SE65LVFGYDMHIKEAPS2NXC3OSAAD4ROJ",
"WARC-Concurrent-To": "<urn:uuid:fdc0c1c1-2a5e-4249-b9a7-c7d684d49e24>",
"WARC-Date": "2021-12-05T23:52:40Z",
"WARC-IP-Address": "146.75.30.217",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6FPPWRPVWIEA75CSOCO77UTMRKZY7NPJ",
"WARC-Record-ID": "<urn:uuid:7985e810-319f-4096-b94e-be6805e95d5e>",
"WARC-Target-URI": "https://www.elastic.co/guide/en/kibana/7.0/xpack-logs.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a8b1201a-5df0-4c96-aeed-9e2b95ce185f>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-6\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
9,
10,
160,
161,
183,
184,
197,
198,
367,
368,
395,
396,
648,
649,
796,
797,
818,
819,
919,
920,
962,
963,
1089,
1090,
1138,
1224,
1391,
1433,
1434,
1707,
1708,
1731,
1732
],
"line_end_idx": [
9,
10,
160,
161,
183,
184,
197,
198,
367,
368,
395,
396,
648,
649,
796,
797,
818,
819,
919,
920,
962,
963,
1089,
1090,
1138,
1224,
1391,
1433,
1434,
1707,
1708,
1731,
1732,
1997
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1997,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3863636255264282,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011363640427589417,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11079545319080353,
"rps_doc_frac_unique_words": 0.4563106894493103,
"rps_doc_mean_word_length": 5.278316974639893,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.476360321044922,
"rps_doc_word_count": 309,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.015328019857406616,
"rps_doc_frac_chars_top_3gram": 0.04046596959233284,
"rps_doc_frac_chars_top_4gram": 0.02575106918811798,
"rps_doc_books_importance": -112.91374206542969,
"rps_doc_books_importance_length_correction": -112.91374206542969,
"rps_doc_openwebtext_importance": -61.98641586303711,
"rps_doc_openwebtext_importance_length_correction": -61.98641586303711,
"rps_doc_wikipedia_importance": -56.12395095825195,
"rps_doc_wikipedia_importance_length_correction": -56.12395095825195
},
"fasttext": {
"dclm": 0.12838852405548096,
"english": 0.8262803554534912,
"fineweb_edu_approx": 2.5296220779418945,
"eai_general_math": 0.5220491290092468,
"eai_open_web_math": 0.09616857767105103,
"eai_web_code": 0.8026448488235474
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-6,265,800,722,454,596,000 | The Difference between Surfaceview and GLSurfaceView
Posted: October 26, 2009 in Android, Java, Mobile
Tags: ,
It seems there may be some confusion or at least this aspect is not highlighted, ie the difference bewteenSrufaceView and GLSurfaceView. Right now before Android 2.0 GLSurfaceView does not entirely play nice with SurfaceFinger.
Let me explain. On G1’s yo can only have one GLSurfaceView. Yes, there are some high end devices coming that can have multiple GLSurfaceViews. Holed on , there is more. GLSurfaceView is not hardware accelerated whereas SurfaceView iis in fact hardware accelerated.
Because of the way GLSurfaceView(pre-Anroid 2.0) takes over the framebuffer/SurfaceFinger you will not be able to get and act on user input in a reliable fashion. 2D rendering si suspeneded while control of the SurfaceFinger framebuiffer is held by GLsurfaceView, ie onSrufaceChanged etc.
While, yes using SurfaceVie w instead would produce an extra copy, on the G1 that is handled by a hardware 2d blitter and on other Andorid devices by a GPU.
Thus, why would you use GLsurfaceView? It has to do with the infrastructure changes that you will see in Android 2.0 and with Android GPU accelerated devices. In other words high end 3d games etc.
Reblog this post [with Zemanta]
Leave a Reply
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Google photo
You are commenting using your Google account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
Connecting to %s | {
"url": "https://mobilebytes.wordpress.com/2009/10/26/the-difference-between-surfaceview-and-glsurfaceview/",
"source_domain": "mobilebytes.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2020-10",
"warc_metadata": {
"Content-Length": "94515",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CMAB6OBPEP4H34Z7R3K6RPG7VDNFD3SB",
"WARC-Concurrent-To": "<urn:uuid:d08b6c1e-3434-4f87-ba16-909d85a93fc7>",
"WARC-Date": "2020-02-29T12:49:10Z",
"WARC-IP-Address": "192.0.78.13",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:PDFANHA3FBRS7P3JNIATDO2OSP3AG3WU",
"WARC-Record-ID": "<urn:uuid:094ab8e3-43f5-4d19-940e-79d830111978>",
"WARC-Target-URI": "https://mobilebytes.wordpress.com/2009/10/26/the-difference-between-surfaceview-and-glsurfaceview/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f436c562-9d4e-48e7-aacc-112452fa0380>"
},
"warc_info": "isPartOf: CC-MAIN-2020-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-238.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
53,
54,
104,
112,
113,
342,
343,
608,
609,
898,
899,
1056,
1057,
1254,
1255,
1287,
1288,
1302,
1303,
1358,
1359,
1378,
1379,
1452,
1453,
1466,
1467,
1533,
1534,
1550,
1551,
1618,
1619,
1634,
1635,
1703,
1704
],
"line_end_idx": [
53,
54,
104,
112,
113,
342,
343,
608,
609,
898,
899,
1056,
1057,
1254,
1255,
1287,
1288,
1302,
1303,
1358,
1359,
1378,
1379,
1452,
1453,
1466,
1467,
1533,
1534,
1550,
1551,
1618,
1619,
1634,
1635,
1703,
1704,
1720
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1720,
"ccnet_original_nlines": 37,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38787877559661865,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015151520259678364,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1818181872367859,
"rps_doc_frac_unique_words": 0.5501858592033386,
"rps_doc_mean_word_length": 5.085501670837402,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.767166614532471,
"rps_doc_word_count": 269,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08040936291217804,
"rps_doc_frac_chars_dupe_6grams": 0.04385964944958687,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.017543859779834747,
"rps_doc_frac_chars_top_3gram": 0.046783629804849625,
"rps_doc_frac_chars_top_4gram": 0.061403509229421616,
"rps_doc_books_importance": -150.53668212890625,
"rps_doc_books_importance_length_correction": -139.50772094726562,
"rps_doc_openwebtext_importance": -96.54307556152344,
"rps_doc_openwebtext_importance_length_correction": -96.54307556152344,
"rps_doc_wikipedia_importance": -67.55284118652344,
"rps_doc_wikipedia_importance_length_correction": -59.939884185791016
},
"fasttext": {
"dclm": 0.09191524982452393,
"english": 0.8640176057815552,
"fineweb_edu_approx": 1.9234514236450195,
"eai_general_math": -0.000009890000001178123,
"eai_open_web_math": 0.1891523003578186,
"eai_web_code": -0.000010009999641624745
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285636",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-4,567,498,590,700,983,000 | 1. Pull an eKuiper Docker image from https://hub.docker.com/r/lfedge/ekuiper/tags. It's recommended to use alpine image in this tutorial (refer to eKuiper Docker for the difference of eKuiper Docker image variants).
2. Set eKuiper source to an MQTT server. This sample uses server locating at tcp://broker.emqx.io:1883. broker.emqx.io is a public MQTT test server hosted by EMQ.
docker run -p 9081:9081 -d --name ekuiper -e MQTT_SOURCE__DEFAULT__SERVERS=[tcp://broker.emqx.io:1883] lfedge/ekuiper:$tag
3. Create a stream - the stream is your stream data schema, similar to table definition in database. Let's say the temperature & humidity data are sent to broker.emqx.io, and those data will be processed in your LOCAL RUN eKuiper docker instance. Below steps will create a stream named demo, and data are sent to devices/device_001/messages topic, while device_001 could be other devices, such as device_002, all of those data will be subscribed and handled by demo stream.
-- In host
# docker exec -it ekuiper /bin/sh
-- In docker instance
# bin/kuiper create stream demo '(temperature float, humidity bigint) WITH (FORMAT="JSON", DATASOURCE="devices/+/messages")'
Connecting to 127.0.0.1:20498...
Stream demo is created.
# bin/kuiper query
Connecting to 127.0.0.1:20498...
kuiper > select * from demo where temperature > 30;
Query was submit successfully.
4. Publish sensor data to topic devices/device_001/messages of server tcp://broker.emqx.io:1883 with any MQTT client tools. Below sample uses mosquitto_pub.
# mosquitto_pub -h broker.emqx.io -m '{"temperature": 40, "humidity" : 20}' -t devices/device_001/messages
5. If everything goes well, you can see the message is print on docker bin/kuiper query window. Please try to publish another message with temperature less than 30, and it will be filtered by WHERE condition of the SQL.
kuiper > select * from demo WHERE temperature > 30;
[{"temperature": 40, "humidity" : 20}]
If having any problems, please take a look at log/stream.log.
6. To stop the test, just press ctrl + c in bin/kuiper query command console, or input exit and press enter.
You can also refer to eKuiper dashboard documentation for better using experience.
Next for exploring more powerful features of eKuiper? Refer to below for how to apply eKuiper in edge and integrate with AWS / Azure IoT cloud.
• No labels | {
"url": "https://wiki.lfedge.org/display/EKUIPER/eKuiper+5+minutes+quick+start",
"source_domain": "wiki.lfedge.org",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "52990",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VJRZ5AZWP6WMAFIKTR2AS4YVO2B4VPVF",
"WARC-Concurrent-To": "<urn:uuid:795eae1d-1355-4fbe-adf5-f9e2be3af791>",
"WARC-Date": "2024-03-04T03:53:54Z",
"WARC-IP-Address": "18.165.98.57",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KVZDJFSSW462ZRYHEFBAE3AZ2WZ5LLMT",
"WARC-Record-ID": "<urn:uuid:67d0e607-9190-4e21-a599-72813f0c0277>",
"WARC-Target-URI": "https://wiki.lfedge.org/display/EKUIPER/eKuiper+5+minutes+quick+start",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d2c3bc8a-862f-4049-aa06-4e776017996e>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-123\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
218,
219,
384,
385,
512,
988,
989,
1004,
1042,
1047,
1073,
1202,
1239,
1267,
1272,
1295,
1332,
1388,
1423,
1428,
1587,
1588,
1699,
1921,
1922,
1978,
2021,
2026,
2027,
2093,
2094,
2205,
2206,
2289,
2290,
2434,
2435
],
"line_end_idx": [
218,
219,
384,
385,
512,
988,
989,
1004,
1042,
1047,
1073,
1202,
1239,
1267,
1272,
1295,
1332,
1388,
1423,
1428,
1587,
1588,
1699,
1921,
1922,
1978,
2021,
2026,
2027,
2093,
2094,
2205,
2206,
2289,
2290,
2434,
2435,
2448
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2448,
"ccnet_original_nlines": 37,
"rps_doc_curly_bracket": 0.001633989973925054,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24339622259140015,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028301889076828957,
"rps_doc_frac_lines_end_with_ellipsis": 0.05263157933950424,
"rps_doc_frac_no_alph_words": 0.322641521692276,
"rps_doc_frac_unique_words": 0.5405405163764954,
"rps_doc_mean_word_length": 5.4234232902526855,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0.01132075022906065,
"rps_doc_unigram_entropy": 4.9017863273620605,
"rps_doc_word_count": 333,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04208194836974144,
"rps_doc_frac_chars_dupe_6grams": 0.04208194836974144,
"rps_doc_frac_chars_dupe_7grams": 0.04208194836974144,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.028792910277843475,
"rps_doc_frac_chars_top_3gram": 0.01993354968726635,
"rps_doc_frac_chars_top_4gram": 0.01439645979553461,
"rps_doc_books_importance": -258.7236633300781,
"rps_doc_books_importance_length_correction": -258.7236633300781,
"rps_doc_openwebtext_importance": -147.8586883544922,
"rps_doc_openwebtext_importance_length_correction": -147.8586883544922,
"rps_doc_wikipedia_importance": -111.04524230957031,
"rps_doc_wikipedia_importance_length_correction": -111.04524230957031
},
"fasttext": {
"dclm": 0.12542802095413208,
"english": 0.642035186290741,
"fineweb_edu_approx": 1.8395473957061768,
"eai_general_math": 0.08232545852661133,
"eai_open_web_math": 0.02075623907148838,
"eai_web_code": 0.5519858598709106
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-3,488,420,042,021,840,400 | Ask Difference
Class in C++ vs. Structure in C++ — What's the Difference?
By Tayyaba Rehman & Fiza Rafique — Published on February 4, 2024
In C++, a class supports both data encapsulation and methods, with default private access. A structure, while similar, defaults to public access and typically represents data only.
Class in C++ vs. Structure in C++ — What's the Difference?
Difference Between Class in C++ and Structure in C++
ADVERTISEMENT
Key Differences
A class in C++ is a blueprint for creating objects, encapsulating data and functions. It supports inheritance and polymorphism, integral for object-oriented programming. In contrast, a structure in C++ is traditionally used to group different types of data. Structures are often used for simpler data representation without the need for additional functionalities like methods.
In a class, member variables and functions are private by default, meaning they can only be accessed by the class's own methods. This promotes data hiding and encapsulation, a cornerstone of object-oriented design. Meanwhile, a structure in C++ has members that are public by default, allowing direct access from outside the structure, which can be less secure but simpler for straightforward data storage.
Classes in C++, with their support for private and protected members, are well-suited for complex applications where control over data access is crucial. They enable the creation of robust and secure software systems. Structures, being more open, are better for when data needs to be accessed directly without the overhead of function calls, useful in scenarios like interfacing with hardware or simpler data manipulation.
A notable feature of classes is the ability to define constructors and destructors, methods called at the creation and destruction of an object. This feature allows for initializing class members and cleaning up resources. Structures can also have constructors and destructors in C++, but they are more commonly used without them, making structures simpler but less flexible compared to classes.
In conclusion, while classes and structures in C++ share many similarities, especially since C++11, they are designed for different purposes. Classes offer more features and control, ideal for complex applications, whereas structures are simpler and more transparent, suitable for basic data aggregation.
ADVERTISEMENT
Comparison Chart
Default Access Modifier
Private
Public
Primary Use
Complex data types with methods
Simple data aggregation
Supports Inheritance
Yes
No
Encapsulation
Encourages data hiding
Allows direct data access
Constructors/Destructors
Commonly used
Less commonly used
Compare with Definitions
Class in C++
In C++, a class can inherit properties from another class, enabling polymorphism.
Class ElectricCar : public Car { private: int batteryLife; };
Structure in C++
A structure in C++ is a user-defined data type primarily for grouping data.
Struct Point { int x, y; };
Class in C++
A class in C++ can have private, protected, and public members.
Class Circle { private: double radius; public: double computeArea(); };
Structure in C++
Structures are often used in C++ for simpler data storage and access.
Struct Employee { string name; int id; };
Class in C++
Classes in C++ can utilize constructors and destructors for initialization and cleanup.
Class Book { public: Book(); ~Book(); private: string title; };
Structure in C++
In C++, a structure has members that are public by default.
Struct Date { int day, month, year; };
Class in C++
A class in C++ allows for object-oriented programming, supporting encapsulation.
Class Rectangle { private: int width, height; public: int area() const; };
Structure in C++
In C++, structures can't inherently support features like inheritance.
Struct Vector2D { float x, y; };
Class in C++
A class in C++ is a user-defined type encompassing data and functions.
Class Car { private: int speed; public: void accelerate(); };
Structure in C++
Structures in C++ can have methods, constructors, and destructors like classes.
Struct RGBColor { RGBColor(int, int, int); int red, green, blue; };
Common Curiosities
What is a class in C++?
A class in C++ is a blueprint for creating objects, combining data and functions.
Are members of a C++ structure public?
Yes, members of a C++ structure are public by default.
Can a class in C++ contain methods?
Yes, a class in C++ can contain methods and functions.
Can a C++ class have private members?
Yes, members in a C++ class are private by default.
What are constructors in C++ classes?
Constructors in C++ classes are special functions for initializing new objects.
Do structures in C++ support inheritance?
No, structures in C++ don't inherently support inheritance.
Can a class in C++ have a destructor?
Yes, classes in C++ can have destructors for cleanup.
What is a structure in C++?
A structure in C++ is a user-defined data type for grouping different data types.
Can a C++ structure have methods?
Yes, structures in C++ can have methods, similar to classes.
Are structures in C++ less complex than classes?
Generally, yes, structures are simpler and more straightforward than classes.
Can a C++ class inherit from another class?
Yes, C++ classes support inheritance.
Do structures in C++ have constructors?
Yes, C++ structures can have constructors.
Can we use polymorphism with C++ classes?
Yes, polymorphism is a key feature of classes in C++.
Can a C++ structure be converted to a class?
Yes, a structure can be converted to a class by changing its default access to private.
Is a structure in C++ more suitable for simple data?
Yes, structures are typically used for simpler data aggregation.
Share Your Discovery
Share via Social Media
Embed This Content
Embed Code
Share Directly via Messenger
Link
Previous Comparison
UHD vs. HD
Author Spotlight
Written by
Tayyaba Rehman
Tayyaba Rehman is a distinguished writer, currently serving as a primary contributor to askdifference.com. As a researcher in semantics and etymology, Tayyaba's passion for the complexity of languages and their distinctions has found a perfect home on the platform. Tayyaba delves into the intricacies of language, distinguishing between commonly confused words and phrases, thereby providing clarity for readers worldwide.
Co-written by
Fiza Rafique
Fiza Rafique is a skilled content writer at AskDifference.com, where she meticulously refines and enhances written pieces. Drawing from her vast editorial expertise, Fiza ensures clarity, accuracy, and precision in every article. Passionate about language, she continually seeks to elevate the quality of content for readers worldwide.
Popular Comparisons
Trending Comparisons
New Comparisons
Trending Terms | {
"url": "https://www.askdifference.com/class-in-c-plus-plus-vs-structure-in-c-plus-plus/",
"source_domain": "www.askdifference.com",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "139895",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y7ZCA775QIBEF7BCFRKQHSX72ZL5D535",
"WARC-Concurrent-To": "<urn:uuid:1fd0befb-4e52-4ff9-bf55-e520573a9c92>",
"WARC-Date": "2024-07-16T20:09:17Z",
"WARC-IP-Address": "104.21.19.213",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XAJAOTSHLU7K7OWK43VEMPIZ6X3YMPZR",
"WARC-Record-ID": "<urn:uuid:cd521d68-e0bd-430a-a132-4ec84f9d83a3>",
"WARC-Target-URI": "https://www.askdifference.com/class-in-c-plus-plus-vs-structure-in-c-plus-plus/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:627d6439-8495-4948-84d2-97f0976e2d36>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-173\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
15,
16,
75,
76,
141,
322,
381,
382,
435,
436,
450,
451,
467,
468,
846,
1253,
1676,
2072,
2377,
2391,
2392,
2409,
2410,
2434,
2435,
2443,
2450,
2451,
2463,
2464,
2496,
2520,
2521,
2542,
2543,
2547,
2550,
2551,
2565,
2566,
2589,
2615,
2616,
2641,
2642,
2656,
2675,
2676,
2701,
2702,
2715,
2716,
2798,
2860,
2861,
2878,
2879,
2955,
2983,
2984,
2997,
2998,
3062,
3134,
3135,
3152,
3153,
3223,
3265,
3266,
3279,
3280,
3368,
3432,
3433,
3450,
3451,
3511,
3550,
3551,
3564,
3565,
3646,
3721,
3722,
3739,
3740,
3811,
3844,
3845,
3858,
3859,
3930,
3992,
3993,
4010,
4011,
4091,
4159,
4160,
4179,
4180,
4204,
4205,
4287,
4288,
4327,
4328,
4383,
4384,
4420,
4421,
4476,
4477,
4515,
4516,
4568,
4569,
4607,
4608,
4688,
4689,
4731,
4732,
4792,
4793,
4831,
4832,
4886,
4887,
4915,
4916,
4998,
4999,
5033,
5034,
5095,
5096,
5145,
5146,
5224,
5225,
5269,
5270,
5308,
5309,
5349,
5350,
5393,
5394,
5436,
5437,
5491,
5492,
5537,
5538,
5626,
5627,
5680,
5681,
5746,
5747,
5768,
5769,
5792,
5811,
5822,
5851,
5856,
5876,
5887,
5888,
5905,
5906,
5917,
5932,
6356,
6370,
6383,
6719,
6720,
6740,
6741,
6762,
6763,
6779,
6780
],
"line_end_idx": [
15,
16,
75,
76,
141,
322,
381,
382,
435,
436,
450,
451,
467,
468,
846,
1253,
1676,
2072,
2377,
2391,
2392,
2409,
2410,
2434,
2435,
2443,
2450,
2451,
2463,
2464,
2496,
2520,
2521,
2542,
2543,
2547,
2550,
2551,
2565,
2566,
2589,
2615,
2616,
2641,
2642,
2656,
2675,
2676,
2701,
2702,
2715,
2716,
2798,
2860,
2861,
2878,
2879,
2955,
2983,
2984,
2997,
2998,
3062,
3134,
3135,
3152,
3153,
3223,
3265,
3266,
3279,
3280,
3368,
3432,
3433,
3450,
3451,
3511,
3550,
3551,
3564,
3565,
3646,
3721,
3722,
3739,
3740,
3811,
3844,
3845,
3858,
3859,
3930,
3992,
3993,
4010,
4011,
4091,
4159,
4160,
4179,
4180,
4204,
4205,
4287,
4288,
4327,
4328,
4383,
4384,
4420,
4421,
4476,
4477,
4515,
4516,
4568,
4569,
4607,
4608,
4688,
4689,
4731,
4732,
4792,
4793,
4831,
4832,
4886,
4887,
4915,
4916,
4998,
4999,
5033,
5034,
5095,
5096,
5145,
5146,
5224,
5225,
5269,
5270,
5308,
5309,
5349,
5350,
5393,
5394,
5436,
5437,
5491,
5492,
5537,
5538,
5626,
5627,
5680,
5681,
5746,
5747,
5768,
5769,
5792,
5811,
5822,
5851,
5856,
5876,
5887,
5888,
5905,
5906,
5917,
5932,
6356,
6370,
6383,
6719,
6720,
6740,
6741,
6762,
6763,
6779,
6780,
6794
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6794,
"ccnet_original_nlines": 187,
"rps_doc_curly_bracket": 0.0029437700286507607,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2818532884120941,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05714286118745804,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20386099815368652,
"rps_doc_frac_unique_words": 0.32220038771629333,
"rps_doc_mean_word_length": 5.2357563972473145,
"rps_doc_num_sentences": 71,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.962555885314941,
"rps_doc_word_count": 1018,
"rps_doc_frac_chars_dupe_10grams": 0.047654781490564346,
"rps_doc_frac_chars_dupe_5grams": 0.1296435296535492,
"rps_doc_frac_chars_dupe_6grams": 0.08217635750770569,
"rps_doc_frac_chars_dupe_7grams": 0.07204502820968628,
"rps_doc_frac_chars_dupe_8grams": 0.05684803053736687,
"rps_doc_frac_chars_dupe_9grams": 0.05684803053736687,
"rps_doc_frac_chars_top_2gram": 0.028142590075731277,
"rps_doc_frac_chars_top_3gram": 0.025515949353575706,
"rps_doc_frac_chars_top_4gram": 0.015196999534964561,
"rps_doc_books_importance": -531.7606811523438,
"rps_doc_books_importance_length_correction": -531.7606811523438,
"rps_doc_openwebtext_importance": -289.1874694824219,
"rps_doc_openwebtext_importance_length_correction": -289.1874694824219,
"rps_doc_wikipedia_importance": -178.05465698242188,
"rps_doc_wikipedia_importance_length_correction": -178.05465698242188
},
"fasttext": {
"dclm": 0.8738632202148438,
"english": 0.8965349793434143,
"fineweb_edu_approx": 2.744933843612671,
"eai_general_math": 0.472586989402771,
"eai_open_web_math": 0.18691670894622803,
"eai_web_code": 0.6770829558372498
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-4,431,364,262,829,573,600 | Attribute._Attribute.GetTypeInfoCount(UInt32) Metoda
Definicja
Pobiera informację o liczbie typów interfejsów, jakie zawiera obiekt (0 lub 1).Retrieves the number of type information interfaces that an object provides (either 0 or 1).
virtual void System.Runtime.InteropServices._Attribute.GetTypeInfoCount([Runtime::InteropServices::Out] System::UInt32 % pcTInfo) = System::Runtime::InteropServices::_Attribute::GetTypeInfoCount;
void _Attribute.GetTypeInfoCount (out uint pcTInfo);
abstract member System.Runtime.InteropServices._Attribute.GetTypeInfoCount : uint32 -> unit
override this.System.Runtime.InteropServices._Attribute.GetTypeInfoCount : uint32 -> unit
Sub GetTypeInfoCount (ByRef pcTInfo As UInteger) Implements _Attribute.GetTypeInfoCount
Parametry
pcTInfo
UInt32
Wskazuje lokalizację, która odbiera informację o liczbie typów dostarczanych przez obiekt.Points to a location that receives the number of type information interfaces provided by the object.
Implementuje
Wyjątki
Dostęp z późnym wiązaniem przy użyciu interfejsu COM IDispatch nie jest obsługiwany.Late-bound access using the COM IDispatch interface is not supported.
Uwagi
Ta metoda umożliwia dostęp do klas zarządzanych z niezarządzanego kodu i nie powinna być wywoływana z kodu zarządzanego.This method is for access to managed classes from unmanaged code, and should not be called from managed code. Więcej informacji o programie IDispatch::GetTypeInfoCount znajduje się w bibliotece MSDN.For more information about IDispatch::GetTypeInfoCount, see the MSDN Library.
Dotyczy | {
"url": "https://docs.microsoft.com/pl-pl/dotnet/api/system.attribute.system-runtime-interopservices-_attribute-gettypeinfocount?view=netframework-4.8",
"source_domain": "docs.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "43113",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:T66G5VE26HOYS7FTWUEO4PZGAFV2UWRU",
"WARC-Concurrent-To": "<urn:uuid:d8c9d511-22aa-4636-a194-8f490a4a1b60>",
"WARC-Date": "2020-11-30T13:01:41Z",
"WARC-IP-Address": "104.108.100.37",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CLYFBVE65X3SDR3O7VTGTV7ZOWYS5STY",
"WARC-Record-ID": "<urn:uuid:2d1d784f-755c-4b80-95b2-714bb2125cb2>",
"WARC-Target-URI": "https://docs.microsoft.com/pl-pl/dotnet/api/system.attribute.system-runtime-interopservices-_attribute-gettypeinfocount?view=netframework-4.8",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:693b4890-0e87-4b16-a741-0a9115ddf86f>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-89.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
53,
54,
64,
65,
237,
238,
435,
488,
580,
670,
758,
759,
769,
770,
778,
785,
786,
977,
978,
991,
992,
1000,
1001,
1155,
1156,
1162,
1163,
1560,
1561
],
"line_end_idx": [
53,
54,
64,
65,
237,
238,
435,
488,
580,
670,
758,
759,
769,
770,
778,
785,
786,
977,
978,
991,
992,
1000,
1001,
1155,
1156,
1162,
1163,
1560,
1561,
1568
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1568,
"ccnet_original_nlines": 29,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1627907007932663,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015503879636526108,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24418604373931885,
"rps_doc_frac_unique_words": 0.739393949508667,
"rps_doc_mean_word_length": 8.030303001403809,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.708418369293213,
"rps_doc_word_count": 165,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05433962121605873,
"rps_doc_frac_chars_dupe_6grams": 0.05433962121605873,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.018113210797309875,
"rps_doc_frac_chars_top_3gram": 0.028679249808192253,
"rps_doc_frac_chars_top_4gram": 0.03773584961891174,
"rps_doc_books_importance": -94.9911117553711,
"rps_doc_books_importance_length_correction": -82.16585540771484,
"rps_doc_openwebtext_importance": -48.77163314819336,
"rps_doc_openwebtext_importance_length_correction": -48.77163314819336,
"rps_doc_wikipedia_importance": -20.97864532470703,
"rps_doc_wikipedia_importance_length_correction": -7.190476894378662
},
"fasttext": {
"dclm": 0.2885257601737976,
"english": 0.11337696760892868,
"fineweb_edu_approx": 2.923656940460205,
"eai_general_math": 0.02969449944794178,
"eai_open_web_math": 0.06956195831298828,
"eai_web_code": 0.4558018445968628
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
-2,535,476,202,103,212,000 | Take the tour ×
Ask Different is a question and answer site for power users of Apple hardware and software. It's 100% free, no registration required.
I'm looking for an app I can leave running and that shows me all necessary info at 1 glance without any need for interaction.
Ideally, it should contain
• a clock
• good, concise news
• weather forecast
• list of my next appointments
• subjects of my unread emails
Other people might also like
• rss feeds
• twitter feed
I already searched for such an app for half an hour and found nothing. Well except for a Dashboard app that was rejected by Apple because it was expandable and looked like the os x dashboard.
There are alternative calendar apps, there are weather apps that show the time, there are twitter apps, rss readers, email apps. Surely somebody has combined all of them?
Can somebody pinpoint me to such apps, or explain why they don't exist? Thanks.
share|improve this question
I might be able to roll one for you. ;) – Moshe Apr 10 '11 at 22:59
Cool! Go ahead! – user5257 Apr 11 '11 at 15:48
Feel free to get in touch with me via email - my info is on my website. – Moshe Apr 11 '11 at 16:31
add comment
5 Answers
Consider Panic's Status Board app: it includes configurable modules for everything you've asked for.
share|improve this answer
add comment
I'm looking for a such app myself and so far I've found one DeskMate Pro. Maybe not ideal, but much better than the other apps.
Hope it will help you.
share|improve this answer
add comment
Notification Center on iOS 5 fits the bill as you can configure it to list the notification in your preferred order and it floats above all programs running whenever you wish to see the notifications.
share|improve this answer
add comment
up vote 0 down vote accepted
I'll answer myself. There is no such app.
The main reason is probably the rejection of that Dashboard app, which made other devs afraid in losing their invested development time if it gets rejected as well.
Future iOS updates might introduce a Dashboard feature, which might be similar to what I was wishing.
share|improve this answer
add comment
You could achieve some of this without an app at all: put iGoogle widgets for the features you desire on your iGoogle page, then keep a browser window open to that page in Safari in your iPad.
There are roughly a billion iGoogle widgets to choose from, and they include widgets for weather, calendars, news, Twitter, RSS, and more. You can choose the color theme too.
The main problems with this approach would seem to be that the display of information is not as compact on the screen as you could achieve with a custom-coded app, so it may be a problem to fit everything that you want so that you can see it all at once. Also, I haven't figured out a way to make the Google search bar go away, and it takes up an unfortunate amount of space at the top of the page (less so in the vertical orientation on an iPad, but more in the horizontal orientation).
share|improve this answer
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service. | {
"url": "http://apple.stackexchange.com/questions/11713/looking-for-a-combined-clock-news-weather-calendar-ipad-app",
"source_domain": "apple.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "64058",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QLJ5YTHPX4H4OEARM73NLPL37PWNK4HV",
"WARC-Concurrent-To": "<urn:uuid:df9bf9a8-5fc9-4daa-a62b-89f67eee5d91>",
"WARC-Date": "2013-12-13T13:46:25Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:TBWH2W6EPOUHOBLCUD76A5B2PDYZ3PVI",
"WARC-Record-ID": "<urn:uuid:d7c98e01-6c10-481b-998b-80788fc4eaed>",
"WARC-Target-URI": "http://apple.stackexchange.com/questions/11713/looking-for-a-combined-clock-news-weather-calendar-ipad-app",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bd1bc6a0-666a-4256-b37e-64b7a55fe196>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
16,
150,
151,
277,
278,
305,
306,
318,
341,
362,
395,
428,
429,
458,
459,
473,
490,
491,
683,
684,
855,
856,
936,
937,
965,
967,
1036,
1038,
1086,
1088,
1189,
1201,
1202,
1212,
1213,
1314,
1315,
1341,
1353,
1354,
1482,
1483,
1506,
1507,
1533,
1545,
1546,
1747,
1748,
1774,
1786,
1815,
1816,
1858,
1859,
2024,
2025,
2127,
2128,
2154,
2166,
2167,
2360,
2361,
2536,
2537,
3025,
3026,
3052,
3064,
3065,
3077,
3078,
3080,
3088,
3089
],
"line_end_idx": [
16,
150,
151,
277,
278,
305,
306,
318,
341,
362,
395,
428,
429,
458,
459,
473,
490,
491,
683,
684,
855,
856,
936,
937,
965,
967,
1036,
1038,
1086,
1088,
1189,
1201,
1202,
1212,
1213,
1314,
1315,
1341,
1353,
1354,
1482,
1483,
1506,
1507,
1533,
1545,
1546,
1747,
1748,
1774,
1786,
1815,
1816,
1858,
1859,
2024,
2025,
2127,
2128,
2154,
2166,
2167,
2360,
2361,
2536,
2537,
3025,
3026,
3052,
3064,
3065,
3077,
3078,
3080,
3088,
3089,
3166
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3166,
"ccnet_original_nlines": 76,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4266263246536255,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015128590166568756,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16187594830989838,
"rps_doc_frac_unique_words": 0.4973357021808624,
"rps_doc_mean_word_length": 4.3836588859558105,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.240322113037109,
"rps_doc_word_count": 563,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06482981890439987,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03889789059758186,
"rps_doc_frac_chars_top_3gram": 0.044570498168468475,
"rps_doc_frac_chars_top_4gram": 0.05064830183982849,
"rps_doc_books_importance": -285.5670166015625,
"rps_doc_books_importance_length_correction": -285.5670166015625,
"rps_doc_openwebtext_importance": -139.98587036132812,
"rps_doc_openwebtext_importance_length_correction": -139.98587036132812,
"rps_doc_wikipedia_importance": -118.7800064086914,
"rps_doc_wikipedia_importance_length_correction": -118.7800064086914
},
"fasttext": {
"dclm": 0.021391689777374268,
"english": 0.9426256418228149,
"fineweb_edu_approx": 1.015859603881836,
"eai_general_math": 0.005649330094456673,
"eai_open_web_math": 0.11173039674758911,
"eai_web_code": 0.0030998599249869585
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | 72317dd8ebe16a28f7d43dafc1ed668f |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.