review_requested
by Kevin Reiss at 2021-01-15 00:01:23.labeled
by James R. Griffin III at 2021-01-14 16:20:15.labeled
by James R. Griffin III at 2021-01-14 16:20:15.assigned
by James R. Griffin III at 2021-01-14 16:20:15.closed
by James R. Griffin III at 2021-01-14 16:26:43.Ingested as ScannedResources to be converted to maps later.
closed
by Cliff Wulfman at 2021-01-14 14:39:02.closed
by Cliff Wulfman at 2021-01-14 14:45:25.all have been migrated
closed
by Cliff Wulfman at 2021-01-14 21:32:22.@joycebcat was right. This was never in the PUDL; it was shot at RBSC's request for another project.
closed
by Cliff Wulfman at 2021-01-14 21:34:00.mentioned
by Joyce at 2021-01-14 21:34:00.subscribed
by Joyce at 2021-01-14 21:34:00.done.
closed
by Cliff Wulfman at 2021-01-14 21:34:36.head_ref_force_pushed
by None at 2021-01-14 15:46:26.labeled
by Christina Chortaria at 2021-01-13 22:33:26.assigned
by Eliot Jordan at 2021-01-13 22:46:29.labeled
by None at 2021-01-14 15:46:17.Coverage remained the same at 78.245% when pulling 95b7650fd27c835e0b749af1903c7fed577b41e2 on 947-call-number-browse into 3c437c6f084184cebf969a8dd4f44145c27d74ea on alma.
head_ref_force_pushed
by Christina Chortaria at 2021-01-13 22:31:37.review_requested
by Christina Chortaria at 2021-01-14 01:14:23.head_ref_force_pushed
by Christina Chortaria at 2021-01-14 14:00:29.referenced
by Christina Chortaria at 2021-01-14 18:06:10.merged
by Christina Chortaria at 2021-01-14 18:06:10.closed
by Christina Chortaria at 2021-01-14 18:06:11.head_ref_deleted
by Christina Chortaria at 2021-01-14 18:06:12.referenced
by Christina Chortaria at 2021-01-13 22:26:53.referenced
by Christina Chortaria at 2021-01-13 22:31:36.closed
by Christina Chortaria at 2021-01-14 18:32:17.Coverage increased (+0.4%) to 78.645% when pulling 43ca1c2a2390975aadda7cd54e21333673300869 on scsbrecordenrichment into 3c437c6f084184cebf969a8dd4f44145c27d74ea on alma.
renamed
by Trey Pendragon at 2021-01-14 00:20:47.ready_for_review
by Trey Pendragon at 2021-01-14 00:21:44.head_ref_force_pushed
by Trey Pendragon at 2021-01-14 17:14:46.review_requested
by Trey Pendragon at 2021-01-14 18:06:59.referenced
by None at 2021-01-14 18:50:30.merged
by None at 2021-01-14 18:50:30.closed
by None at 2021-01-14 18:50:30.head_ref_deleted
by None at 2021-01-14 18:50:31.You can't get an API response at all if there are no active barcodes. We're not sure why some people have barcodes that aren't active. But we aren't going to worry about this.
There's a user identifier type table in alma if you search for "user identifier types"
Outstanding data needs (@pmgreen will pursue these): * Need netids in the records * Need an entry in the user identifier types table tied to netids.
In the meantime we can work on this issue by obtaining fixtures using user_id_type=BARCODE
with a barcode and/or user_id_type=all_unique
with an institution id, then mocking them as responses to a request with user_id_type=NET_ID
.
NetIDs are currently in Alma as user_title
(having migrated from PATRON.TITLE
). To get netids into Alma as NET_ID
, we need to run an SIS integration profile job, after data has been checked. Fulfillment staff are doing the methodical checks of patron records. If no issues have been found, ExL suggests that we could begin testing netids by adding some manually (identifiers tab in patron records).
mentioned
by Peter Green at 2021-01-13 22:10:48.subscribed
by Peter Green at 2021-01-13 22:10:48.Coverage increased (+0.07%) to 78.712% when pulling 94c71d12101cd94191b2bfb04219a7af37ee1733 on more_scsb into ebde1f1b79063ea49ad64ba0202c8b448042aa58 on alma.
head_ref_force_pushed
by Trey Pendragon at 2021-01-14 20:59:49.referenced
by None at 2021-01-14 21:18:31.merged
by None at 2021-01-14 21:18:32.closed
by None at 2021-01-14 21:18:32.head_ref_deleted
by None at 2021-01-14 21:18:33.Coverage decreased (-3.9%) to 78.712% when pulling 3ed84014d083d7b613add1901e3fb8de0a0c9310 on alma into b3ecd66028801434ad5f7d9b56a01f41cbf5e2bd on main.
deployed
by Trey Pendragon at 2021-01-14 19:03:53.assigned
by Eliot Jordan at 2021-01-14 22:57:37.Coverage remained the same at 78.712% when pulling 096cf71b669767b94fc5e4b62779ace1fb1e1579 on 974-apikey into 3ed84014d083d7b613add1901e3fb8de0a0c9310 on alma.
head_ref_deleted
by Eliot Jordan at 2021-01-14 23:44:51.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:45:36.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:45:58.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:00.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:02.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:04.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:08.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:10.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:11.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:13.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:16.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:18.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:19.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:21.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:22.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:27.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:29.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:30.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:31.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:32.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:35.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:37.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:38.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:39.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:41.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:42.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:43.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:46.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:48.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:58.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:46:59.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:47:00.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:47:01.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:47:02.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:47:03.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:47:04.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:47:11.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:47:12.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:47:13.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:47:15.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:47:17.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:47:22.head_ref_deleted
by Eliot Jordan at 2021-01-14 23:47:23.Coverage increased (+0.3%) to 79.029% when pulling 90bb0b04057bc1d0bec5b3bcc1049f0f72cc8a89 on scsb_holdings into 3ed84014d083d7b613add1901e3fb8de0a0c9310 on alma.
head_ref_force_pushed
by Trey Pendragon at 2021-01-15 00:52:55.The patron_group appears only to be used by the recall request feature.
Looks like it was a bit of boilerplate that the Voyager Recall Request API request. The Alma request endpoint doesn't look like it requires it. https://developers.exlibrisgroup.com/alma/apis/docs/bibs/UE9TVCAvYWxtYXdzL3YxL2JpYnMve21tc19pZH0vaG9sZGluZ3Mve2hvbGRpbmdfaWR9L2l0ZW1zL3tpdGVtX3BpZH0vcmVxdWVzdHM=/ it
labeled
by None at 2021-01-14 21:53:42.labeled
by Christina Chortaria at 2021-01-13 22:54:54.labeled
by Christina Chortaria at 2021-01-13 22:54:54.unlabeled
by Christina Chortaria at 2021-01-13 22:55:23.deployed
by Trey Pendragon at 2021-01-14 15:51:38.head_ref_force_pushed
by None at 2021-01-14 16:26:32.ready_for_review
by None at 2021-01-14 16:27:52.referenced
by None at 2021-01-14 18:18:42.merged
by None at 2021-01-14 18:18:42.closed
by None at 2021-01-14 18:18:42.head_ref_deleted
by None at 2021-01-14 18:18:43.We have demoed an unpublished site for ephemera, with completed ephemera items that only display in the unpublished DPUL site for review (since it is not linked to catalog records). Emma was happy with this way forward. Closing ticket.
closed
by Kim Leaman at 2021-01-14 15:57:54.referenced
by None at 2021-01-14 13:25:44.merged
by None at 2021-01-14 13:25:44.closed
by None at 2021-01-14 13:25:44.head_ref_deleted
by None at 2021-01-14 13:25:45.convert_to_draft
by None at 2021-01-14 18:52:48.@kayiwa waiting to merge until we see if specific folks need to make the request.
head_ref_force_pushed
by Francis Kayiwa at 2021-01-14 17:19:04.head_ref_force_pushed
by Francis Kayiwa at 2021-01-14 18:58:51.mentioned
by Francis Kayiwa at 2021-01-14 19:23:48.subscribed
by Francis Kayiwa at 2021-01-14 19:23:48.assigned
by None at 2021-01-14 15:09:40.referenced
by Kevin Reiss at 2021-01-14 16:14:07.merged
by Kevin Reiss at 2021-01-14 16:14:07.closed
by Kevin Reiss at 2021-01-14 16:14:07.head_ref_deleted
by Kevin Reiss at 2021-01-14 16:14:11.


If you want to change the path environment variable see: Path Manipulation.
If you want to set an environment variable only for the installer process and its sub-processes use:
Save this script
System::Call 'Kernel32::SetEnvironmentVariableA(t, t) i("name", "value").r0'
StrCmp $0 0 error
ExecWait ProgThatReadsEnv.exe
Goto done
error:
MessageBox MB_OK "Can't set environment variable"
done: If you want to set an environment variable that will stick for every other process and after reboots too you should use the functions below. To use them either save them as a .NSH file and include them in your script, or just copy paste them in your script. If you choose to save them as a .NSH file use:
Save this script
!include WriteEnvStr.nsh Section "Add Env Var"
Push MyEnvVar
Push MyEnvVarValue
Call WriteEnvStr
SectionEnd
Section uninstall
Push MyEnvVar
Call un.DeleteEnvStr
SectionEnd
If you want the environment variable to be avaiable to all of the users using the computer define ALL_USERS before you include WriteEnvStr.nsh (or before the part of the script holding these functions if you didn't save it as a .NSH file). For example:
Save this script
!define ALL_USERS
!include WriteEnvStr.nsh The functionsNote: under Windows 9x a reboot is required for changes to take affect. The reboot flag will be set by these functions if a reboot is required.
Warning: this script will only work on NSIS 2.0b2 and above!

|


Child's Play 2
Child's Play 2 is a movie starring Alex Vincent, Jenny Agutter, and Gerrit Graham. While Andy's mother is admitted to a psychiatric hospital, the young boy is placed in foster care, and Chucky, determined to claim Andy's soul, is...


{% extends "legacy_admin.html" %} {% block title %}
On each page, on the upper right, there is a link that says Français / English. Click to switch to that language.
The home page is located at https://www.bscht.org/. On this page, you will see a welcome message and a brief overview of Timoun.
The Navigation bar has several links, each which lead to a separate page.
The about page is meant to give the public more information about Timoun.
This page will allow for users to search for services in the Timoun database. It will also explain how best to search the database. How to use filters, keywords etc to narrow down their search.
This page will explain a little bit about IBESR(Institut du Bien-Etre Social et de recherches), and give contact information for that organization.
This page will allow the public to suggest new community services. Fill in the form, click submit, and IBESR will receive that info.
This page will serve as a directory of mental health services in the database.
This page will allow users to login or logout. This process will be described in more detail below
Users are added by an admin.
An Admin will click Users on the navigation bar. After that, the admin will click the Add User button.
After the admin fills out the form, the user will get a confirmation email, which will explain how they can set their password.
An Admin can click Users on the navigation bar to see all users. On that page, they can see basic user information, and can click on the email to edit or delete that user.
If a user forgets their password, they can click Login and click Forgot Password. Clicking either of these links will log you out. So you'll have to log back in if you use them.
From here, a user will enter their email, and receive and email link explaining how they can reset their password safely.
The Admin user has several User Interface changes to take note of. When on a public page, an Admin user has an extra link at the top that says "Admin". To enter the Admin console, click on that link.
Once there, the Admin has an Admin Nav on the left of the screen. This will allow the admin to explore the database, and track changes. There are options to view the Dashboard of all recent changes, as well as Users, Organizations, Programs, Services, Records, and this Manual.
Timoun keeps track of all changes to the database.
An admin can see all changes by clicking Dashboard on the navigation panel.
The Dashboard displays a table tracking all changes to the system. For instance, if you add a User, or edit a Record, this table will show you who the change was initiated by, what the resource affected was, the security clearance, the resource, the action performed ("Create User", for instance), and the Time. It will also allow you to click "View" to see more detailed information.
This more detailed information will bring you to a separate page, which will show you all changes to that particular resource.
On the Admin panel, click "Organizations". This will show you a list of Organizations in the system. When you click on it, it will bring you to a Record that lists that organization, and all of it's programs and services.
To edit, click "edit" and proceed to make changes that are present on the form.
To add a new organization, click "Add Organization", and fill out the complete form for that record. This new Record will not be connected with iformbuilder in any way.
On the Admin panel, click "Programs". This will show you a list of Programs in the system. When you click on it, it will bring you to a Record that lists that program, and all of it's programs and services.
To edit, click "edit" and proceed to make changes that are present on the form.
To add a new program, click "Add Program", and fill out the complete form for that record. This new Record will not be connected with iformbuilder in any way.
On the Admin panel, click "Services". This will show you a list of Services in the system. When you click on it, it will bring you to a Record that lists that service, and all of it's services and services.
To edit, click "edit" and proceed to make changes that are present on the form.
To add a new service, click "Add Service", and fill out the complete form for that record. This new Record will not be connected with iformbuilder in any way.
On the Admin panel, click "Records". This will show you a list of Records in the system. When you click on it, it will bring you to that's record's info page.
To edit, click "edit" and proceed to make changes that are present on the form.
To add a new record, click "Add Record", and fill out the complete form for that record. This new Record will not be connected with iformbuilder in any way.
There is nothing on the database simply called "Organization", there are only Records. When you are on the Organization index page, what you are seeing is a list of the records, shown by the associated organization name. This allows an admin to interact with everything associated with a record, not just the fields that pertain to it's organization.
There is nothing on the database simply called "Service", there are only Records. When you are on the Service index page, what you are seeing is a list of all of the Services derived from records in the database. When you click a Service, you will be presented a list of records that provide that service. From there you can click to view or edit that individual service.
There is nothing on the database simply called "Service", there are only Records. When you are on the Service index page, what you are seeing is a list of all of the Services derived from records in the database. When you click a Service, you will be presented a list of records that provide that program. From there you can click to view or edit that individual program.
Any user, whether an Admin or not, can click on their own user profile. This will bring them to a pre-populated form that shows them was information we have for them on the system. To edit, make changes to the form, and hit submit. The changes will be stored on the database.


TEXT
Hola Mauricio! Todo en este color es para ti :)
TEXT IS WRITTEN IN RED HERE!
Welcome to Ischemic Stroke Lesion Segmentation (ISLES), a medical image segmentation challenge at the International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI) 2015. We aim to provide a platform for a fair and direct comparison of methods for ischemic stroke lesion segmentation from multi-spectral MRI images. A public dataset of diverse ischemic stroke cases and a suitable automatic evaluation procedure will be made available for the two following tasks:
SISS: sub-acute ischemic stroke lesion segmentation
SPES: perfusion-diffusion mismatch for stroke penumbra estimation
Add a small left margin to above points.
On this page, you can find details on how the challenge works in the About section, the clinical Motivation behind it, the Rules of how to participate, the Data description and the Evaluation scheme.
All dates are subject to change, please keep an eye on the Important notices.
=======All dates are subject to changes, please keep an eye on the Important notices.
>>>>>>> ef976e8a9cebde3b57da94cb21ff53d2b7b1b38e| Official launch of website | |
| Registration opens and distribution of training data | |
| Opening of evaluation system | |
| Short paper submission deadline | |
| Distribution of test data | |
| Short paper final version | |
| Deadline for submitting test data results | |
| MICCAI workshop and award presentation | |
| Compilation of high-impact publication | |
| Training data and evaluation made public |
Medical image processing comprises a large number of tasks, for which new methods are regulary proposed. But, more often than not, it is difficult to to compare their fitness, as the reported results are obtained on private dataset. A challenge aims to overcome these shortcomings by providing (1) a public dataset that reflects the diversity of the problem and (2) a platform for a fair and direct comparison of methods with suitable evaluation measures. Thus, the scientific progress is promoted. (see here for a detailed rationale behind challenges).
During recent years, the need for challenges has been emphasized in the medical image processing community and especially in the scope of the International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI) and the International Symposium on Biomedical Imaging (ISBI) conferences, a number of challenges have been successfully organized. All of these are collect centrally at grand-challenges.org.
With ISLES, we provide such a challenge covering ischemic stroke lesion segmentation in multi-spectral MRI data. The task is backed by a well established clinical and research Motivation and a large number of already existing methods. Each team will be free to participate in either one or both of two sub-tasks: sub-acute ischemic stroke lesion segmentation (SISS) and perfusion-diffusion mismatch for stroke penumbra estimation (SPES).
SISS: Automatic segmentation of ischemic stroke lesion volumes from multi-spectral MRI sequences acquired in the sub-acute stroke development stage.
SPES: One-sentence description
Add a small left margin to above points.
=======During the recent years, the need for challenges has been emphasized in the medical image processing community and especially in the scope of the International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI) and the International Symposium on Biomedical Imaging (ISBI) conferences, a number of challenges have been successfully organized. All of these are collect centrally at grand-challenges.org.
With ISLES, we aim to provide this year such a challenge covering ischemic stroke lesion segmentation in multi-spectral MRI data. The task is backed by a well established clinical and research Motivation and a large number of already existing methods. Each team will be free to participate in either one or both of two sub-tasks: sub-acute ischemic stroke lesion segmentation (SISS) and perfusion-diffusion mismatch for stroke penumbra estimation (SPES).
SISS: What to do here.
SPES: What to do here.
>>>>>>> ef976e8a9cebde3b57da94cb21ff53d2b7b1b38eInterested participants can download a set of training cases with associated expert segmentations of the stroke lesions to train and evaluate their approach. Shortly before the MICCAI takes place, a set of test cases will be made available and the participants upload their segmentation results as well as a shot-paper describing their method. The organizers then evaluate each case and establish a ranking of the participating teams. At the MICCAI conference, the results will be presented in the scope of a workshop and the results discussed together with invited experts. Each team presents their method as a poster and, Furthermore, a number of selected teams will have the opportunity to hold a small presentation detailing their method. After the challenge, the organizers and participants will together compose a high-impact journal paper to publish their findings.
A stroke or colloquially brain attack is a sudden occurrence of brain disease, which often involves the loss of functions of the central nervous system and is caused by disturbance in the blood supply of the brain. Strokes can be classified into the groups ischemic, caused by undersupply of blood in a brain area, and hemorrhagic, caused by undersupply and pressure of leaking blood in a brain area due to a broken vessel.
These lesions can be identified (segmented) in multimodal MRI imaging data. With this challenge, we aim to take a step forward to computer-aided methods for automatic segmentation of brain lesions. One clinical application could be the better understanding of specific brain area functions by connecting the caused dysfunction with the affected brain area. The required processes would be strongly simplified by automatic segmentation algorithms.
Each team wishing to participate in the ISLES challenge is required to:
All types of automatic stroke lesion segmentation methods are welcome. We specifically do not restrict the participation to new, innovative and unpublished methods, but invite research groups from all over the world to enter their existing method in the competition. Semi-automatic methods are eligible for participation and will appear in the ranking, but out of competition, as it is impossible to rate the influence of the manual steps in a fair manner.
We encourage all teams to apply their method to both of the sub-tasks to highlight its generalization ability. But it is equally possible to submit a specialized approach for each of the task or just to ne of them.
ISLES is organized as part of a larger full-day workshop at the MICCAI with the following organizational structure:
The three events should be regarded as a single workshop and a single registration allows to visit all of these and to participate in them. Please note that each part has its own rules of active participation.
Link buttons to web-pages when available.
A number of special rules applies to simplify the participation in multiple of these events.
The organizers of ISLES and BRATS took care to apply the same pre-processing steps to their data, to enable the participants of one of the challenges to furthermore participate in the respective other. Especially machine learning based approaches should be easy to adapt. Double contributions are highly welcome and only one registration at the MICCAI workshop is required.
Participants are free to use the training data from both, ISLES and BRATS, to evaluate methods submitted to BrainLeS, but are then encouraged to also participate in the respective challenge. In such case, they are not required to submit the short-paper to ISLES respectively BRATS, instead their (accepted) BrainLeS manuscript will suffice, as long as it states the results obtained on the training set.
<<<<<<< HEADISLES requires the participating teams to submit a short-paper of 4 pages in LNCS format, that will be reviewed by the organizers. This paper will be distributed among the MICCAI attendees on the MICCAI USB drive and uploaded to the challenge result web-page. See Dates for the associated deadlines. In case the BrainLeS workshop results in a special issue, some selected methods from the BRATS and ISLES challenge will be called upon to contribute an article.
=======ISLE requires the participating teams to submit a short-paper of 4 pages in XXXX format, that will be reviewed by the organizers. This paper will be distributed among the MICCAI attendees on the MICCAI USB drive and uploaded to the challenge result web-page. See Dates for the associated deadlines. In case the BrainLeS workshop will result in a special issue, some selected methods from the BRATS and ISLES challenge will also be called upon to contribute an article.
>>>>>>> ef976e8a9cebde3b57da94cb21ff53d2b7b1b38eA team can submit results from multiple methods, but an extra registration to the MICCAI challenge is required for each additionally submitted result.
By registering, each team agrees to use the provided data only in the scope of the workshop and neither pass it on to a third party nor use it for other publications. After the workshop took place, the data will be released under a research license.
The data for both sub-tasks, SISS and SPES, are pre-processed in a consistent manner to allow easy application of a method to both problems.
Compressed Neuroimaging Informatics Technology Initiative format: *.nii.gz.
(I/O libs: MedPy (Python), NiftiLib (C,Java,Matlab,Python), Nibabel (Python))
=======Compressed Neuroimaging Informatics Technology Initiative format: *.nii.gz.
>>>>>>> ef976e8a9cebde3b57da94cb21ff53d2b7b1b38eAll MRI sequences are skull-stripped, re-sampled to an isotropic spacing of 1^3 (fix!) and co-registered to the FLAIR (SISS) and T1w contrast (SPES) sequences respectively.
SISS
| 50-100 | |
| ~50 | |
| ~30 | |
| 2 | |
| 1 (train), 2 (test) | |
| FLAIR, T2w TSE, T1w TFE, DWI with ADC map |
SISS
For SISS, cases with sub-acute ischemic stroke lesions have been collected from clinical routine acquisition. The following characteristics reflect the diversity of the included cases:
<<<<<<< HEADCompute, when the cases are ready, or place a yet-to-come placeholder here.
SPESS
Could you add here something similar to the description of the SISS data above?Data distribution, registration and automatic evaluation will be handled by the Virtual Skeleton Database:
=======Data distribution, registration and automatic evaluation will be handled by the Virtual Skeleton Database:
>>>>>>> ef976e8a9cebde3b57da94cb21ff53d2b7b1b38eThere you'll find explanations on how to register, how to download the data and how as well as in which format to upload your results. Furthermore, the evaluation scores obtained by each team will be listed there.
Here we explain the evaluation measures used by SISS. Shouldn't we somehow try to use similar ones? And do you not also compute the perfusion, defusion mismatch? How do you evaluate that in the tables on VSD, I've been missing it there. Anyway, you should add the SPES evaluation measures here too.
The evaluation comprises three evaluation measures, each of them highlighting different aspects of the segmentation quality. From the computed evaluation scores, the global rating of each team is established as described below.
All expert segmentation were prepared by experience raters. For SISS, two sets will be made available, for SPES one.
Three principal evaluation measures are employed to evaluate the quality of a segmentation compared to the reference ground-truth: The Dice's coefficient (DC, see [wikiDC]) denotes the volume overlap, the average symmetric surface distance (ASSD) the surface fit and the Hausdorff distance (HD, see [wikiHD]) the maximum error. Furthermore, precision & recall (see [wikiPreAndRec]) are provided to reveal over- resp. under-segmentation, but won't be used in the computation of the team ranks, as they are indirectly reflected by the DC value.
=======Three principal evaluation measures are employed to evaluate the quality of a segmentation compared to the reference ground-truth: The Dice's coefficient (DC, see [wikiDC]) denotes the volume overlap, the average symmetric surface distance (ASSD) the surface fit and the Hausdorff distance (HD, see [wikiHD]) the maximum error. Furthermore, precision & recall (see [wikiPreAndRec]) are provided to reveal over- resp. under-segmentation, but won't be used in the computation of the team ranks, as they are indirectly reflected in the DC value.
>>>>>>> ef976e8a9cebde3b57da94cb21ff53d2b7b1b38eThe DC measures the similarity between two datasets. Considering two sets of volume voxels \(A\) and \(B\), the \(DC\) value is given as:
$$DC=\dfrac{2|A\cap B|}{|A|+|B|}$$A value of 0 indicates no overlap, a value of 1 perfect similarity. During interpretation, it should be kept in mind that the \(DC\) is known to yield higher values for larger volumes i.e. a \(DC\) of 0.9 for lung segmentation is considered average, as is a \(DC\) of 0.60 for MS lesions.
Note that the \(DC\) is the same as the F1-score, monotonic in Jaccard simmilarity and the harmonic mean of precision & recall. See here for more details.
The \(ASSD\) denotes the average distance between the volumes surface points averaged over both directions. Considering two sets of surface points \(A\) and \(B\), the average surface distance (\(ASD\)) is given as:
$$ASD(A,B) = \frac{\sum_{a\in A}min_{b\in B}d(a,b)}{|A|}$$with \(d(a,b)\) being the Euclidean distance between the points \(a\) and \(b\). Since \(ASD(A,B)\neq ASD(B,A)\), the \(ASSD\) is then given as:
$$ASSD(A,B) = \frac{ASD(A,B)+ASD(B,A)}{2}$$It is given in \(mm\), the lower the better, and works equally well for large and small objects.
The \(HD\) denotes the maximum distance between two volumes surface points and hence denotes outliers, especially when multiple objects are considered. It is defined as:
$$HD(A,B)=\text{max}\{\max_{a\in A}\min_{b\in B}d(a,b),\max_{b\in B}\min_{a\in A}d(b,a)\}$$I fear the following part is still not correct (what is displayed in the image is not \(h\)). Will have to re-do it! Or simply remove it?
The directed Hausdorff distance \(h\) is defined as:
$$h(A,B)=\underset{a\in A}{\text{max }}\underset{b\in B}{\text{min }}d(a,b)$$
End of doubtfull part.
Similar to the \(ASSD\), the \(HD\) is given in \(mm\) and a lower value denotes a better segmentation.
The \(precision\) (also called positive predictive value) and \(recall\) (also known as sensitivity) of two sets can be defined as
$$precision=\dfrac{TP}{TP+FP}$$and
$$recall=\dfrac{TP}{TP+FN},$$where \(TP\) (true positive) are the overlapping points, \(FP\) (false positive) are the wrong segmented points in the segmentation and \(FN\) (false negative) are the not segmented points in the reference.
<<<<<<< HEADBoth measure take values in the range of \([0,1]\). A relatively high precision compared to the recall reveals under-segmentation and vice-versa, as depicted in the following figure:
Adapt design and text (gree?), center! =======Both measure take values in the range of \([0,1]\). A relatively high precision compared to the recall reveals under-segmentation and vice-versa, see the following figure.
>>>>>>> ef976e8a9cebde3b57da94cb21ff53d2b7b1b38eTo establish a teams rank, the following steps are performed:
This scheme is furthermore detailed in the following figure:
Put the new one here! =======This scheme is furthermore detailed in the following figure: (if you can describe all this somehow smaller, that would be perfect! As it is, the figure is simply to big. We would have to let it pop-up in another window or such.)
>>>>>>> ef976e8a9cebde3b57da94cb21ff53d2b7b1b38eBy not averaging the actual evaluation measures, but rather the ranks in each, the system is not affected by very difficult or easy cases: If all methods return low results for one case, the small difference will still count in the ranking and the overall impression will not be distorted.
If a case has not been uploaded or could not be processed for some reason, the associated team will be assigned the last place for this case.
A complete mismatch (i.e. a DC value of 0) will be treated as a missing case as detailed above (and the obtained ASSD & HD values ignored).
Multiple teams can share a single rank. This will then be always the highest, e.g.:
>>>>>>> ef976e8a9cebde3b57da94cb21ff53d2b7b1b38eThis challenge is organized by
Maier, Oskar, Institute of Medical Informatics, Universität zu Lübeck, directed by Prof. Dr. rer. nat. habil. Heinz Handels,
Menze, Björn, Computer Science, Technische Universität München and
Reyes, Mauricio, Institute for Surgical Technology & Biomechanics, Universität Bern.
| Friedmann, Laszlo, Institute of Medical Informatics, Universität zu Lübeck | |
| Friedmann, Laszlo, Institute of Medical Informatics, Universität zu Lübeck | |
| Institute for Neuroradiology, Universitätsklinikum Schleswig-Holstein, Lübeck | |
| Clinic for Neuroradiology, Technische Universität München | |
| Institute for Neuroradiology, Universitätsspital Bern Is this correct, Mauricio? And whom should we mention in the two points below? | |
| The Virtual Skeleton Database | |
| The Virtual Skeleton Database | |
| Krämer, Ulrike, Department of Neurology, Universitätsklinikum Schleswig-Holstein, Lübeck |


Gutters are the dividers between each pane, as shown below. The gutters themselves are white. What you actually see in this picture are the gutter borders.
Previous / Next


---
layout: page
title: "404 - Page Not Found"
permalink: /404
comments: false
---
Oooops something went wrong!
Or
You broke it!
Or
You're in the wrong place.
Or
This is a bug.
Or
There is not such a page.
Or
Don't worry! Everything is gonna be alright.
Foloow this and go home or contact me if you think something is wrong.


Give your business a personalized edge by advertising with a customized Logo that uniquely represents your small business.
 Let us help you show your presence on the World Wide Web.
We believe your business deserves exposure by reaching out to your clients through Social Media. Let us handle that for you.


Recent Major Volcanic Eruptions in the Pacific Northwest
Volcano Name
Location
Last Major Eruption
Type of Eruption
Compiled in 2008 by Ms Jen
Mt. Lassen
California
1914-17
Explosive Eruption
Mt. Hood
Oregon
1790s
Pyroclastic flows and Mudflows
Mt. St. Helens
Washington
1980
Explosive Eruption


Uber loses license in London over safety concerns, vows to appeal
by APLONDON -- London's transit authority on Monday refused to renew Uber's license to operate, putting the ride-hailing company's future in the British capital in doubt.
It's the latest chapter in Uber's rocky history with London transport officials, who have been subjecting the San Francisco-based company to ever tighter scrutiny over concerns about passenger safety and security.
Uber vowed to appeal the decision, which it called "extraordinary and wrong." The company, which has 21 days to file an appeal, can continue operating while the appeals process is under way.
Transport for London cited "several breaches that placed passengers and their safety at risk" in its decision not to extend Uber's license, which expires at midnight Monday.
The transit authority, known as TFL, said that despite addressing some issues, it "does not have confidence that similar issues will not reoccur in the future."
As a result, it deemed Uber "not fit and proper at this time."
The company fired back, pointing out that TFL had found it to be fit and proper in September, when it was given a two-month license renewal.
"We have fundamentally changed our business over the last two years and are setting the standard on safety," Jamie Heywood, Uber's regional general manager for Northern and Eastern Europe, said in a statement.
TFL had already been keeping Uber on a tight leash following concerns about aggressive corporate tactics and passenger safety. It had revoked Uber's license once before, in 2017, but a court later granted it a license lasting only 15 months, which TFL then extended for two more months in September, while also imposing a set of 20 stricter conditions.
In the latest decision, the transit authority said it was concerned that Uber's systems "seem to have been comparatively easily manipulated" by drivers.
One key issue was a change to Uber's systems allowing unauthorized drivers to upload their photos to other driver accounts.
This let them pick up passengers as though they were the booked Uber driver on at least 14,000 trips, which means all those journeys were uninsured, TFL said.
The change also resulted in some passengers traveling with unlicensed drivers, including one whose license was previously revoked by TFL.
TFL also faulted Uber for another "failure" that allowed dismissed or suspended drivers to create a new account and carry passengers. And it cited other "serious breaches" involving unspecified insurance-related issues.
Shares in Uber were down almost 6% in premarket trading in New York.
See more stories on Uber.


CryptoCompare.com - Privacy Policy
This privacy policy sets out how Crypto Coin Comparison LTD uses and protects any information that you give Crypto Coin Comparison LTD when you use this website.
Crypto Coin Comparison LTD is committed to ensuring that your privacy is protected. Should we ask you to provide certain information by which you can be identified when using this website, then you can be assured that it will only be used in accordance with this privacy statement.
Crypto Coin Comparison LTD may change this policy from time to time by updating this page. You should check this page from time to time to ensure that you are happy with any changes. This policy is effective from 18/05/2015.
What we collect
We may collect the following information:
- name and job title
- contact information including email address
- demographic information such as postcode, preferences and interests
- other information relevant to customer surveys and/or offers
What we do with the information we gather
We require this information to understand your needs and provide you with a better service, and in particular for the following reasons:
- Internal record keeping.
- We may use the information to improve our products and services.
- We may periodically send promotional emailsabout new products, special offers or other information which we think you may find interesting using the email address which you have provided.
- From time to time, we may also use your information to contact you for market research purposes. We may contact you by email, phone, fax or mail. We may use the information to customise the website according to your interests.
Security
We are committed to ensuring that your information is secure. In order to prevent unauthorised access or disclosure,we have put in place suitable physical, electronic and managerial procedures to safeguard and secure the information we collect online.
How we use cookies
A cookie is a small file which asks permission to be placed on your computer's hard drive. Once you agree, the file is added and the cookie helps analyse web traffic or lets you know when you visit a particular site. Cookies allow web applications to respond to you as an individual. The web application can tailor its operations to your needs, likes and dislikes by gathering and remembering information about your preferences.
We use traffic log cookies to identify which pages are being used. This helps us analyse data about web page traffic and improve our website in order to tailor it to customer needs. We only use this information for statistical analysis purposes and then the data is removed from the system.
Overall, cookies help us provide you with a better website, by enabling us to monitor which pages you find useful and which you do not. A cookie in no way gives us access to your computer or any information about you, other than the data you choose to share with us.
You can choose to accept or decline cookies. Most web browsers automatically accept cookies, but you can usually modify your browser setting to decline cookies if you prefer. This may prevent you from taking full advantage of the website.
Links to other websites
Our website may contain links to other websites of interest. However, once you have used these links to leave our site, you should note that we do not have any control over that other website. Therefore, we cannot be responsible for the protection and privacy of any information which you provide whilst visiting such sites and such sites are not governed by this privacy statement. You should exercise caution and look at the privacy statement applicable to the website in question.
Controlling your personal information
You may choose to restrict the collection or use of your personal information in the following ways:
- whenever you are asked to fill in a form on the website, look for the box that you can click to indicate that you do not want the information to be used by anybody for direct marketing purposes
- if you have previously agreed to us using your personal information for direct marketing purposes, you may change your mind at any time by writing to or emailing us at<EMAIL_ADDRESS>We will not sell, distribute or lease your personal information to third parties unless we have your permission or are required by law to do so. We may use your personal information to send you promotional information about third parties which we think you may find interesting if you tell us that you wish this to happen.
You may request details of personal information which we hold about you under the Data Protection Act 1998. A small fee will be payable. If you would like a copy of the information held on you please write to<EMAIL_ADDRESS>If you believe that any information we are holding on you is incorrect or incomplete, please write to or email us as soon as possible, at the above address. We will promptly correct any information found to be incorrect.


ToWAs
Login Page
The landing page is the dashboard which we will see later in this User Guide. If the user is not logged in, he will be redirected automatically to the login page. In the login page, the user has the possibility to use the Facebook account, in order for him to save some precious time, not to create a new account and customize it yet again. When he clicks on the login button, he will be presented with a dialog in which he will have to allow ToWAs to use some of the data Facebook provides (name and profile picture). If the login has been successful, he will be redirected to the landing page
User Details Prompt
The first thing he will see in the landing page is a form in which he will provide some basic data, for ToWAs to work. These questions include age range (18-24, 25-35, 36-50, 50+), whether his next trip is a Business Trip, Solo Trip, Family Trip or Friends Trip, whether he already has accommodation, whether he is a sports person, cultural person or in pilgrimage.
After he has completed all the needed details, he can proceed to use ToWAs at it's fullest potential.
Dashboard
This is the main dashboard. Here, the user can surf on the map however he wishes, although, the first time he enters, he will be centered to his current location (if he allows the Geolocation API to retrieve this data). From here, he can either refill the previous form, search for a trip destination to get itineraries or logout
Itineraries
When the user types a destination in the search bar at the top, he will retrieve, faster or slower, depending on his internet speed, a list of points of interest. Most of the results are either Museums, Hotels, Parks or Churches, data retrieved from DBPedia.
If he clicks on a selected marker, he will see more information about that specific point of interest. The details include the name, the ontology url for linked data and a short or long description about that specific place. When he decides to leave, the user can click on the greeting from the navbar (including the profile picture), and proceed to logout, having to log back in when he comes back again. If he doesn't want to do that, if he closes the tab or browser, the Facebook id remains active for some time


A scrollspy for angular. Also working on this site!
An implementation for the nullable design pattern in javascript
TSLint rules to prevent usage of the word "data" in variables and function names


No feeds created
Feeds are where your monitoring data is stored. The recommended route for creating feeds is to start by creating inputs (see the inputs tab). Once you have inputs you can either log them straight to feeds or if you want you can add various levels of input processing to your inputs to create things like daily average data or to calibrate inputs before storage. You may want to follow the link as a guide for generating your request.
Feed API helper


refM1
refW1
We invited actress Jane Marshall to join us for the day and choose her perfect outfit from our vast range of womens fashion.
This is of course not true as this is just a design for a website and this is simply filler text.
refMJ1
refM2
refW2
refW3
add looks or items to your lookbook for a chance of winning
See an item or a complete look you like, click the button to add it to your lookbook abnd you'll be automatically entered to our monthly draw where one winner gets a £300 gift voucher to spend on our website!
Terms: No purchase necessary. Vouchers are non-transferrable and no cash alternative is offered. Competition is for members only.
add looks or items to your lookbook for a chance of winning
See an item or a complete look you like, click the button to add it to your lookbook abnd you'll be automatically entered to our monthly draw where one winner gets a £300 gift voucher to spend on our website!
Terms: No purchase necessary. Vouchers are non-transferrable and no cash alternative is offered. Competition is for members only.
refW4
refW4


You must log in to access that page.
My orders
No orders
Shipment Address
#{item.address}
Product
#{item.product.name}
Quantity
#{item.quantity}
ID
#{item.id}


Stan sat on a slope. He dug a hole in the wet mud. "I see a slug?a big slug! It is a slug in the mud!" cried Stan. His mom slid down the slope. She gave Stan a tube. "Rescue the slug!" she yelled. Stan put the tube in the mud. The slug slid in. "The slug will not get wet!" said Stan. "I rescued him!" Spike's Slip Drake is on a sled. A young pup slips and takes a spill. Drake puts the pup on the sled. He gets a rope. "I can pull the sled with the rope" says Drake. "I will take him home and name him Spike." Spike and Drake skip home. Drake's dad pets Spike. Graw" I will give you a bone. Then I will get a vet!" says his dad.
in-context


We are an open-minded group of individuals who are passionate about finding solutions in rural India and improving peoples' lives. While our officers put in a lot of effort, it's not an easy task, and we appreciate any and all help from the general members. If you would like to become a general member, please contact us to become involved with project development, hosting large-scale events, and meeting like-minded people!
President - Radhika Gulhar
Radhika Gulhar is a third-year Human Biology major from San Ramon, CA. She plans to attend medical school and pursue the path of plastic surgery in the coming future. Aside form Project RISHI Radhika spends her time practicing with the UCSD Women’s Crew Team, researching on cancer therapy at Bennet Laboratories, and planning events for the Health Medical Professions Preparation Program (HMP3) at UCSD. In her free time she likes shopping, going out with friends, listening to music, cooking, and watching movies.
Vice President - Ahish Chitneni
Ahish Chitneni is from Sunnyvale, CA. He is majoring in Physiology & Neuroscience in Revelle college and this is his third year being a part of Project RISHI. His future plans include having a career in the healthcare field and hopefully applying what he learns here at RISHI there. During his free time he likes to watch and play basketball (Go Lakers!) and listen to music!
Secretary - Ipsita Praharaj
Ipsita Praharaj is a second year NanoEngineering major from San Ramon, CA. In the future, she hopes to specialize in cardiovascular bioengineering and work in the biotechnology industry. Aside from Project RISHI, Ipsita is on the outreach committee of UCSD's Biomedical Engineering Society. She loves to dance, read and hang out with friends in her free time.
Project Planning Chair - Rushil Patel
Rushil Patel is currently a second-year studying Physiology & Neuroscience. He was born and raised in San Jose, California and hopes to eventually pursue a career in medicine. Aside from Project RISHI, Rushil likes to get involved in different leadership organizations like the Associated Students at UCSD. During his free time, he likes to hang out with friends, play video games, and meet new people.
Finance Chair - Samkit Jain
Samkit Jain is a fourth-year, Sixth College student pursuing a degree in Biochemistry & Cell Biology. After his undergraduate career he aspires to become either an Anesthesiologist or an Internist, specializing in pulmonology. He is excited to be a part of Project RISHI this year and hopes to be able to help more people through the organization. Additionally, he is also part of the UCSD Greek life as a member of the Sigma Nu Kappa Rho Chapter and enjoys spending his extra time at the gym, with close friends, and studying.
Fundraising Chair - Vaish Sridhar
Vaish Sridhar is a third-year undergraduate at UC San Diego, pursuing a degree in Physiology and Neuroscience. As fundraising chair, she hopes to aid this Project RISHI chapter in raising more money to further help the community in Anandwan. She grew up in Pleasanton, CA and enjoys eating waffles, playing softball, dancing, helping kids, and being silly. Vaish is also involved in the undergraduate research journal Saltman Quarterly and is a research assistant at Sanford Consortium.
Sponsorship Chair - Shivani Patel
I'm Shivani Patel and am from Bakersfield, CA. I'm currently a sophomore at UCSD and this is my second year being a part of Project Rishi! I'm a human biology major in Revelle College and hope to have a career in the medical field some day. In my free time I love to dance and read. I'm also slightly a shopaholic and it’s a serious problem!
External Affairs - Arun Singh
Arun Singh is from Bakersfield, CA and is majoring in General Biology at ERC. In the future, he hopes to pursue a career in medicine. Outside of Project RISHI, he likes to meet people, go out with friends, watch movies, and watch or play sports—basketball, football, and tennis.
Marketing Chair - Rohan Bhow
Rohan Bhow is a second year student in Roosevelt College here at UCSD. Rohan grew up in Minnesota and went to highschool in Bangalore, India. He hopes to pursue a career in health care and wants to get involved in global health matters regarding less developed countries. He loves traveling and learning about different cultures. In his free time, Rohan likes to hike, bicycle, and cook!
Webmaster - Sonal Prasad
Sonal Prasad is majoring in Computer Science as a third-year student at UCSD. During her earlier years, she lived in India and Canada, but mostly grew up in Palo Alto, California. She hopes to pursue a career in computational biology, and also wants to play a role in improving social and health conditions in rural parts of the world. When she has free time, she likes to run, take pictures, bake, read, and hang out with friends!
Historian - Raj Patel
Raj Patel is a fourth year Human Biology major here at UCSD. He grew up in Moorpark, California and has always called SoCal his home. He joined Project Rishi board in hopes of having a positive impact in the less fortunate areas of India. He spends a majority of his spare time in the gym, on the basketball court, and hopes to learn how to surf sometime before he has to leave the beautiful San Diego beaches. Someday he hopes to practice and do research as an Endocrinologist.
Travel Coordinator - Vaishali Talwar
I am a 3rd year general biology major, from New Delhi, India. I hope to pursue research in the field of genetics in the future, as well as start affordable diagnostic clinics in India. Aside from being part of Project Rishi, I am also a volunteer at the Rady's Childrens' Hospital. I love reading, shopping, hanging out with friends and taking questionably long naps in my free time.
Newsletter Committee - Rohun Iyer
Rohun Iyer is a 2nd year undergraduate pursuing a degree in Mathematics and Computer Science. He was born in Houston, Texas and grew up in Los Alamos, New Mexico. He hopes to pursue a career in data analysis. He joined Project RISHI to have a positive impact on social and health conditions in rural India. In his free time, Rohun likes to play soccer, bike or read just about anything!
Retreat Chair - Rifat Tuly
Rifat Tuly is from Los Angeles, CA. She is a 3rd year majoring in Physiology & Neuroscience in Marshall college. Her future plan involves working in the healthcare field as well as helping reduce global poverty and participating in Doctors without Borders in the near future. She hopes to use the experiences she learns in Project RISHI in order to help accomplish her future ventures. During her free time, she loves watching TV serials (from all over the world), listening to music, sleeping, eating, and goofing off with her friends.
Retreat Chair - Nabila Tabassum
Nabila Tabassum is a third year undergraduate student at UC San Diego, and currently pursuing her major in Biochemistry and Cell biology. She is from Los Angeles, California. In her role as Project RISHI’s Retreat Chair, she wants to help the community and the children who are disadvantaged and compromised. At her free time, Nabila likes to spend time with her family and friends. She also likes to travel, eat and volunteer.


Comments
-
Greg Hurrell
Marking as ASSIGNED.
-
Greg Hurrell
- ** Bug 38 has been marked as a duplicate of this bug. ***
-
Greg Hurrell
For those who are manually copying art to iTunes, I just wanted to note here that the easiest way to do this is to select "Show Album Covers folder" from the Synergy Global menu while the relevant track is playing. This will not only open the folder, but also select the actual cover art file in the Finder, making the task of dragging the art file into iTunes a little easier.
-
reppep
This would make the iPod photo work as well.
See http://wincent.com/a/support/forums/showthreaded.php?Cat=0&Number=572
-
Marius van Wyk
Dragging Album art manually from the Folder into the mp3s is quite a time-consuming task. Automating this would save me hours.
This is by far the most important feature I practically cannot do without.
Please, please make provision for this...
regards,
-
Greg Hurrell
- ** Bug 140 has been marked as a duplicate of this bug. ***
-
Greg Hurrell
This is obviously a fairly popular feature request. What needs to be decided is *how* to implement this from a user interface perspective. There are a number of options:
1. Embed artwork automatically (always). The problem here is that Synergy sometimes gets the wrong art from Amazon and it would be annoying to have to remove the art manually if it were wrong. There would also need to be a mechanism in which Synergy would know not to re-embed the art if the user deleted it and the next time the track was played Synergy noticed that it had no embedded art... It's quite a complicated issue...
2. Embed art when a hot key is pressed. This corrects many of the problems with option "1" above, but there is currently no room for more hot keys in the Synergy preferences UI (I have to keep the window small enough that it will fit on an 800 x 600 iBook screen). Synergy Advance has a totally different UI and the number of possible hot keys is unlimited.
3. Embed art when an item in the Synergy Global Menu is selected. This is the easiest to implement in terms of not breaking the existing UI, and for my part it's the approach I favour most.
4. Embed art when album cover as shown in the floater is clicked. This would require significant tweaking to the floater because it's currently "transparent" to mouse clicks. Also, the cover art would have to appear inside an NSButton (currently it's just drawn in directly in -drawRect:).
or:
5. Embed art when album cover as shown in floater is right-clicked (or control clicked, or clicked-and- held) and an item is selected from a contextual menu. Once again, significant tweaking required, but I favour this approach over option "4" because it's less likely that a user might click the art by accident and embed it without meaning to. I also like the way that having a contextual menu in place opens up a path towards other features that could be controlled from inside the floater. This is an approach I have in mind for Synergy Advance.
6. A separate application for managing cover art, as suggested in bug #140. This is one of the things which Synergy Advance will be.
In an ideal world, *all* of these options would be possible and the user could choose to activate/ deactivate the methods according to their taste. Realistically though, I am suffering from UI crunch in Synergy Classic and it's hard to add more options. My vote goes with option "3" for now. Comments anyone?
-
Eerk
Since you list options, I take it that the ability to get artwork into the iTunes file is not your problem. Just the way to implement it in the current interface.
"My vote goes with option "3" for now."
Although a hot key would be much better, I understand your problem getting it into the current interface. IMHO You could get rid of the hot key to quit Synergy though. That is something you will only do rarely (in my use of Synergy the only reason ever to quit Synergy was to test a new version and I used the Preference Pane 'Stop' button for that).
If you do go for the global menu approach, make sure to have at least the following options: "Embed artwork for [name of currently playing song] in iTunes" "Embed artwork for [name of currently playing album] in iTunes" "Remove aftwork for [name of currently playing album] from Synergy"
The last option I added because you (rightly) state that Synergy sometimes gets the wrong arwork from Amazon. The deletion process should leave a note in the Album Covers folder so Synergy knows not to bother trying to download the artwork again the next time. Otherwise the wrong cover would re-appear the next time you play a song from that album. This happened to me when I manually removed eronous arwork.
-
reppep
As long as it's quick & easy to a) add existing covers without playing each song / album, and b) remove bad covers, I think I'll be happy. If you do write an external app, I'd love the option to have it scan my Library, finding all the covers it thinks are matches, and then later review and approve or reject them.
Thanks!
-
Greg Hurrell
- ** Bug 143 has been marked as a duplicate of this bug. ***
-
Dirk Schober
I have another (maybe it's just me) situation, which would raise the hand for another application:
Most music that I play is at work with my iPod connected to the computer. AFAIK, you cannot change the song files on the iPod from a 'foreign' machine, meaning my office Mac. Still, the cover art is collected by Synergie, which is great.
In this case, automatic assignment would abviously not work right.
-
Greg Hurrell
- ** Bug 220 has been marked as a duplicate of this bug. ***
-
clay
I vote for option #5, but I would love there to be a separate stand alone application also. This would give you the opportunity to manage/organize your iTunes artwork. I don't think there's an application out there today that does that. I think a lot of people would buy Synergy for that feature alone! I know I would because I have over 5000 songs and probably have covers for about 100 of them.
Suggestions for the application: - automated search for covers for all songs (or just selected songs) in iTunes - when it finds a cover for a song it will ask you to accept the cover or ask if you want to view other suggestions for cover, if you still weren't happy it would then ask you if you want to refine your search. If you were still unsuccessful at finding the right cover it would give you the option of skipping the song and then (as suggested in a different post) flag that song so that Synergy would not search for covers anymore for that song. - after your done with one song it will automatically go to the next one in the list - option to use a selected cover for all songs by a certain artist - drag and drop feature when a song is selected (like iTunes does now) - allow you to add your own (generic) graphic to represent all songs that you couldn't find a cover for
That's all I can think of right now off the top of my head. I hope you can do this...please at least consider it. Thanks.
-
Greg Hurrell
If we're talking about a separate application dedicated to managing cover art, I just wanted to make a note here that this request also relates to request #6.
-
John MaCabre
I would also like to request option #5 in Synergy itself, with the possibility of an additional separate app that collects things for the entire library and then presents them for the users review.
Also, since you're working on embedding things in the id3 tag, I think allowing for the option of being able to import the Album Release Year would be incredibly helpful (perhaps including an option to find the *Original* release date since Amazon usually displays the year for the reissue of an album).
-
bugzilla user 246
Option #3, as in selecting something that says "Automatically Apply Covert Art to Albums" (yes albums, not a song). So ft itunes is playing, Synergy does the following:
if (Song Has No Cover) {
getAlbumCover getTrackListFromAlbum for each song in album { applyCover }
}
I dont care about getting a wrong jpg or not. I think Sofa is an application that does this very well (in terms of gettng the job done). As far as HOW it gets the job done, CPU intesive-wise, is the reason why I chose not to use it anymore.
Make a quick fix and include it pronto, that is one feature I really can't live w/o.
(In reply to comment #7)
This is obviously a fairly popular feature request. What needs to be decided is *how* to implement >
3. Embed art when an item in the Synergy Global Menu is selected. This is the easiest to implement in
terms of not breaking the existing UI, and for my part it's the approach I favour most.
-
neilio
- 5, definitely. I don't use the global menu item, and there's more than a good chance that users will have
the floater active (it is one of the main reasons to use Synergy, after all).
It would be nice to have a separate application that would bulk apply existing album art, though - I have just under 10,000 tracks in iTunes and doing this manually is, for obvious reasons, not that appealing. :)
-
Michael Baudis
well, i vote for any option to embed cover art globally, e.g. automatically while a track is played, or an option to play all tracks for some seconds (fixed or until th ecover is grabbed). i mostly use the ipod for playing music, so to have all covers would be very nice.
michael.
-
Greg Hurrell
- ** Bug 330 has been marked as a duplicate of this bug. ***
-
marcushe
I would like the cover art that is downloaded with Synergy to be added to the iTunes library. I just got a new iPod and want to be able to see the covers on it. Thanks!
-
Michael Nordmeyer
Option 1 with a twist:
Automatically add the artwork for the album, not only the song. Synergy always displays the once downloaded artwork regardless if it's correct or not. Therefor it should be embedded. Give an option to turn automatically embedding artwork off.
If the song or album already has artwork embedded then don't embed.
Remember the albums in which the artwork was embedded to not embed them again. Use information from artist, album and number of songs/CDs to identify the album later on. If the user later on deletes wrong or bad quality artwork you don't have to care about. If the user changes the artist/album information? Well, then you would automatically fetch the artwork again, because the remembered information won't match. But don't worry. With this new information you may be able to find the correct artwork and all is fine.
Delete the artwork from the artwork folder after embedding.
I don't like the idea of having the floater act as a mini application. It's just for displaying information. Also you can't judge from the small artwork displayed in the floater if the quality is OK or if you want to look for better ones.
-
Christian Thomas
Add my vote to a global option in Synergy to "Auto add album artwork to iTunes if none exists"
-
Greg Hurrell
- ** Bug 357 has been marked as a duplicate of this bug. ***
-
Greg Hurrell
- ** Bug 371 has been marked as a duplicate of this bug. ***
-
Greg Hurrell
Ok, this is now fixed in the current development build (to be released shortly as version 2.9). To be notified when it is released you can subscribe to the announcements mailing list:
I ended up going with Option 3. More options may be added later, but for the time being I wanted to go with a conservative (non-automated) approach. If the feature proves to be reliable we can look at making it more automated (and therefore less conservative); the three main ideas are: (1) to make it automatic; (2) to make the transfers apply to all the tracks in an album at once instead of just single tracks; (3) a combination of the "1" and "2".
I am going to add the "fixed-in-prerelease" keyword to this entry. Feature request #95 has already been filed with respect to the "entire albums at once" transfer. Have just opened feature request #430 to handle the tracking of the "automation" feature.
-
Greg Hurrell
Changing assignment to reflect my new email address.
http://wincent.com/a/news/archives/2006/05/change_of_email.php
-
Greg Hurrell
- ** Bug 360 has been marked as a duplicate of this bug. ***
Add a comment
Comments are now closed for this issue.


Hello, Ehcache
Introduction
Ehcache is a cache library introduced in October 2003 with the key goal of improving performance by reducing the load on underlying resources. Ehcache is not just for general-purpose caching, however, but also for caching Hibernate (second-level cache), data access objects, security credentials, web pages. It can also be used for SOAP and RESTful server caching, application persistence, and distributed caching.
Definitions
-
cache: Wiktionary defines a cache as “a store of things that will be required in future, and can be retrieved rapidly.” That is the nub of it. In computer science terms, a cache is a collection of temporary data which either duplicates data located elsewhere or is the result of a computation. Once in the cache, the data can be repeatedly accessed inexpensively.
-
cache-hit: When a data element is requested of the cache and the element exists for the given key, it is referrred to as a cache hit (or simply ‘hit’).
-
cache-miss: When a data element is requested of the cache and the element does not exist for the given key, it is referred to as a cache miss (or simply ‘miss’).
-
system-of-record: The core premise of caching assumes that there is a source of truth for the data. This is often referred to as a system-of-record (SOR). The cache acts as a local copy of data retrieved from or stored to the system-of-record. This is often a traditional database, although it may be a specialized file system or some other reliable long-term storage. For the purposes of using Ehcache, the SOR is assumed to be a database.
-
SOR: See system-of-record.
Why caching works
Locality of Reference
While Ehcache concerns itself with Java objects, caching is used throughout computing, from CPU caches to the DNS system. Why? Because many computer systems exhibit “locality of reference”. Data that is near other data or has just been used is more likely to be used again.
The Long Tail
Chris Anderson, of Wired Magazine, coined the term “The Long Tail” to refer to Ecommerce systems. The idea that a small number of items may make up the bulk of sales, a small number of blogs might get the most hits and so on. While there is a small list of popular items, there is a long tail of less popular ones.
The Long Tail
The Long Tail is itself a vernacular term for a Power Law probability distribution. They don’t just appear in ecommerce, but throughout nature. One form of a Power Law distribution is the Pareto distribution, commonly know as the 80:20 rule. This phenomenon is useful for caching. If 20% of objects are used 80% of the time and a way can be found to reduce the cost of obtaining that 20%, then the system performance will improve.
Will an Application Benefit from Caching?
The short answer is that it often does, due to the effects noted above.
The medium answer is that it often depends on whether it is CPU bound or I/O bound. If an application is I/O bound then then the time taken to complete a computation depends principally on the rate at which data can be obtained. If it is CPU bound, then the time taken principally depends on the speed of the CPU and main memory.
While the focus for caching is on improving performance, it it also worth realizing that it reduces load. The time it takes something to complete is usually related to the expense of it. So, caching often reduces load on scarce resources.
Speeding up CPU-bound Applications
CPU bound applications are often sped up by:
- improving algorithm performance
- parallelizing the computations across multiple CPUs (SMP) or multiple machines (Clusters).
- upgrading the CPU speed.
The role of caching, if there is one, is to temporarily store computations that may be reused again. An example from Ehcache would be large web pages that have a high rendering cost. Another caching of authentication status, where authentication requires cryptographic transforms.
Speeding up I/O-bound Applications
Many applications are I/O bound, either by disk or network operations. In the case of databases they can be limited by both.
There is no Moore’s law for hard disks. A 10,000 RPM disk was fast 10 years ago and is still fast. Hard disks are speeding up by using their own caching of blocks into memory.
Network operations can be bound by a number of factors:
- time to set up and tear down connections
- latency, or the minimum round trip time
- throughput limits
- marshalling and unmarhshalling overhead
The caching of data can often help a lot with I/O bound applications. Some examples of Ehcache uses are:
- Data Access Object caching for Hibernate
- Web page caching, for pages generated from databases.
Increased Application Scalability
The flip side of increased performance is increased scalability. Say you have a database which can do 100 expensive queries per second. After that it backs up and if connections are added to it it slowly dies.
In this case, caching may be able to reduce the workload required. If caching can cause 90 of that 100 to be cache hits and not even get to the database, then the database can scale 10 times higher than otherwise.
How much will an application speed up with Caching?
The short answer
The short answer is that it depends on a multitude of factors being:
- how many times a cached piece of data can and is reused by the application
- the proportion of the response time that is alleviated by caching
In applications that are I/O bound, which is most business applications, most of the response time is getting data from a database. Therefore the speed up mostly depends on how much reuse a piece of data gets.
In a system where each piece of data is used just once, it is zero. In a system where data is reused a lot, the speed up is large.
The long answer, unfortunately, is complicated and mathematical. It is considered next.
Applying Amdahl’s Law
Amdahl’s law, after Gene Amdahl, is used to find the system speed up from a speed up in part of the system.
1 / ((1 - Proportion Sped Up) + Proportion Sped Up / Speed up)
The following examples show how to apply Amdahl’s law to common situations. In the interests of simplicity, we assume:
- a single server
- a system with a single thing in it, which when cached, gets 100% cache hits and lives forever.
Persistent Object Relational Caching
A Hibernate Session.load() for a single object is about 1000 times faster from cache than from a database.
A typical Hibernate query will return a list of IDs from the database, and then attempt to load each. If Session.iterate() is used Hibernate goes back to the database to load each object.
Imagine a scenario where we execute a query against the database which returns a hundred IDs and then load each one. The query takes 20% of the time and the roundtrip loading takes the rest (80%). The database query itself is 75% of the time that the operation takes. The proportion being sped up is thus 60% (75% * 80%).
The expected system speedup is thus:
1 / ((1 - .6) + .6 / 1000) = 1 / (.4 + .0006) = 2.5 times system speedup
Web Page Caching
An observed speed up from caching a web page is 1000 times. Ehcache can retrieve a page from its SimplePageCachingFilter in a few ms.
Because the web page is the end result of a computation, it has a proportion of 100%.
The expected system speedup is thus:
1 / ((1 - 1) + 1 / 1000) = 1 / (0 + .0001) = 1000 times system speedup
Web Page Fragment Caching
Caching the entire page is a big win. Sometimes the liveness requirements vary in different parts of the page. Here the SimplePageFragmentCachingFilter can be used.
Let’s say we have a 1000 fold improvement on a page fragment that taking 40% of the page render time.
The expected system speedup is thus:
1 / ((1 - .4) + .4 / 1000) = 1 / (.6 + .0004) = 1.6 times system speedup
Cache Efficiency
In real life cache entrie do not live forever. Some examples that come close are “static” web pages or fragments of same, like page footers, and in the database realm, reference data, such as the currencies in the world.
Factors which affect the efficiency of a cache are:
- liveness—how live the data needs to be. The less live the more it can be cached
- proportion of data cached—what proportion of the data can fit into the resource limits of the machine. For 32 bit Java systems, there was a hard limit of 2GB of address space. While now relaxed, garbage collection issues make it harder to go a lot large. Various eviction algorithms are used to evict excess entries.
- Shape of the usage distribution—If only 300 out of 3000 entries can be cached, but the Pareto distribution applies, it may be that 80% of the time, those 300 will be the ones requested. This drives up the average request lifespan.
- Read/Write ratio—The proportion of times data is read compared with how often it is written. Things such as the number of rooms left in a hotel will be written to quite a lot. However the details of a room sold are immutable once created so have a maximum write of 1 with a potentially large number of reads.
Ehcache keeps these statistics for each Cache and each element, so they can be measured directly rather than estimated.
Cluster Efficiency
Also in real life, we generally do not find a single server? Assume a round robin load balancer where each hit goes to the next server. The cache has one entry which has a variable lifespan of requests, say caused by a time to live. The following table shows how that lifespan can affect hits and misses.
Server 1 Server 2 Server 3 Server 4 M M M M H H H H H H H H H H H H H H H H ... ... ... ...
The cache hit ratios for the system as a whole are as follows:
Entry Lifespan Hit Ratio Hit Ratio Hit Ratio Hit Ratio in Hits 1 Server 2 Servers 3 Servers 4 Servers 2 1/2 0/2 0/2 0/2 4 3/4 2/4 1/4 0/4 10 9/10 8/10 7/10 6/10 20 19/20 18/20 17/20 16/10 50 49/50 48/50 47/20 46/50
The efficiency of a cluster of standalone caches is generally:
(Lifespan in requests - Number of Standalone Caches) / Lifespan in requests
Where the lifespan is large relative to the number of standalone caches, cache efficiency is not much affected. However when the lifespan is short, cache efficiency is dramatically affected. (To solve this problem, Ehcache supports distributed caching, where an entry put in a local cache is also propagated to other servers in the cluster.)
A cache version of Amdahl’s law
From the above we now have:
1 / ((1 - Proportion Sped Up * effective cache efficiency) + (Proportion Sped Up * effective cache efficiency)/ Speed up) effective cache efficiency = (cache efficiency) * (cluster efficiency)
Web Page example
Applying this to the earlier web page cache example where we have cache efficiency of 35% and average request lifespan of 10 requests and two servers:
cache efficiency = .35 cluster efficiency = .(10 - 1) / 10 = .9 effective cache efficiency = .35 * .9 = .315 1 / ((1 - 1 * .315) + 1 * .315 / 1000) = 1 / (.685 + .000315) = 1.45 times system speedup
What if, instead the cache efficiency is 70%; a doubling of efficiency. We keep to two servers.
cache efficiency = .70 cluster efficiency = .(10 - 1) / 10 = .9 effective cache efficiency = .70 * .9 = .63 1 / ((1 - 1 * .63) + 1 * .63 / 1000) = 1 / (.37 + .00063) = 2.69 times system speedup
What if, instead the cache efficiency is 90%. We keep to two servers.
cache efficiency = .90 cluster efficiency = .(10 - 1) / 10 = .9 effective cache efficiency = .9 * .9 = .81 1 / ((1 - 1 * .81) + 1 * .81 / 1000) = 1 / (.19 + .00081) = 5.24 times system speedup
Why is the reduction so dramatic? Because Amdahl’s law is most sensitive to the proportion of the system that is sped up.


% include("/themes/inspinia/include/list-header.html"){}%>
${title!}
${layoutContent}
<% include("/themes/inspinia/include/list-footer.html"){}%>


Course Notes from a tutorial on CFL3D usage are available as a NASA Technical Memorandum (NASA/TM-2006-214301, April 2006), titled "CFL3D Version 6.4 - General Usage and Aeroelastic Analysis." This document summarizes many of the newest features of the code (as of Version 6.4), and also explains in detail how to set up and run it for general cases. Particular emphasis is given to CFL3D's upgraded deforming mesh and aeroelastic analysis capabilities.
The target audience ranges from basic to advanced users. New users should find useful the discussion of general features of the code and the many options that are available, code set-up description, grid-characteristics recommendations, and input requirements. Advanced users should find useful the discussion on new code features, keywords, and discussion on unsteady computations and on parallel (MPI) usage. Although they are generally useful for any CFL3D user, these notes are particularly recommended (if not crucial) for users interested in using CFL3D for deforming mesh and/or aeroelastic analysis.
NASA/TM-2006-214301 (April 2006)... PDF file (5.8 MB)
Responsible NASA Official:
Christopher Rumsey
Page Curator:
Christopher Rumsey
Last Updated: 07/10/2017


Registers up to ten new controls whose state can be moved up and down with two switches.
Example: The flaps slowly move up as long as the up-switch is triggered and move down if the down-switch is triggered.
The input switches can also be proportional which allows even more precise controls.
Combined with a virtual sensors this can also act as an integral over any control or telemetry.
Describes the input value for which the output does not change. Usually it is -1, but can be 0 if one switch is used to control both directions. When the neutral point is 0, both inputs can control both directions. Hence it is useful when the input(s) should be integrated.
The time it takes the output value to change by 1. Defines the movement speed.


I am not going to give away any plot details so this review, won't give anything away, read on.
This movie strives for what every big TV drama wants. To become a box-office hit and still remain a ratings monster on TV. The X-Files may be the first to accomplish this.
Chris Carter wanted to please fans, but also attract new fans to the X-Files. He almost succedes. I am a long time viewer, and I was a little dissapointed, as they don't reveal some answers to plots I was hoping for. I won't tell you which though. The new fans won't be dissapointed. Carter introduces each character perfectly, and it doesn't annoy regular viewers.
As for content, it doesn't get better. Compare this Sci Fi movie, to others and you can see the quality. Mulder says this in a...interesting way. This is one of the best Sc-Fi films out.
Where it does come short is in the fact that it strives to much to be like the TV show. This movie is just too long for that. 1 and a half hours through it I was ready for it to end, but it kept going and going and going. This is probably its only problem.
Overall this is a great movie, one which noone should miss.
Rating (scale of 1-5): 4.5 ~Bared, Aprentice Tailor, Member of COR, Baja Shard
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


This module is used to present media picker as native iOS photo library. It shows media picker as a modal media picker and enables to select multiple images. It supports browsing through the available albums. It also provides flexibility to choose maximum number of images to be selected and also to choose to return full resolution Image or full screen image.
To access this module from JavaScript, you would do the following:
var media library multi access = require("ti.multiAccessLib");
The media library multi access variable is a reference to the Module object.
TODO: If your module has an API, you should document the reference here.
TODO: This is an example of a module function.
TODO: This is an example of a module property.
Check app.js
TODO: Enter your author name, email and other contact details you want to share here.
TODO: Enter your license/legal information here.


A gin company already made a sequel to that dystopian Peloton ad
by Thom DunnLooks like "Grace from Boston" has fallen on some hard times. It's not clear if she's pounding back that smooth Aviation gin during her year-long exercise binge, or after she realizes that her husband's seeming-generosity is actually some terrifying voyeurism. But at least she has some friends looking out for her, right?
(Also, props to this actress and to Aviation gin for getting this out so fast)


{% extends "shared/layout.html" %} {% block content %}
The Talk Python weather service.
Endpoints
city={city}
- the city you want to get the weather at.
state={state}
- the state of the city (US only, two letter
abbreviations).
country={country}
- country, US if none specific (two letter
abbreviations).
units={units}
- units: {metric, imperial, standard}, defaults to metric.


{{define "body"}}
CLI metrics is a system used for gathering diagnostics and metrics data for CLI tools created by WeDeploy.


--- layout: post title: BASH playlist management for your Raspberry Pi date: "2013-05-04" ---
I just recently got a Raspberry Pi, which is a decent piece of hardware, but the fact that it can't really do video playback using any other player than omxplayer left me annoyed. Omxplayer isn't a very nice player, most annoyingly it's missing playlist functionality.
To make the Raspberry Pi a bit more useful for me, I decided to make my own playlist manager around omxplayer, and this is it.
Why would you want to do this? Because you shouldn't be modifying the system folders with your own scripts etc. .. if you feel otherwise, feel free to modify your system any way you want.
Run the following commands on your BASH terminal to create a ~/bin and add it to your path:
{{< highlight bash >}} # Create the local bin folder mkdir "${HOME}/bin" # Set decent permissions on it chmod 0700 "${HOME}/bin" # Add it to your PATH in future sessions echo -e '\nPATH="${PATH}:${HOME}/bin"' >> "${HOME}/.bashrc" # And enable it in the current one export PATH="${PATH}:${HOME}/bin" {{< /highlight >}}If you have other terminal sessions open and want to activate the local bin on them, just run the last line from that on them..
Create the following two scripts in your local bin, or system bin folder if you didn't create a local bin..
process_playlist
{{< highlight bash >}} #!/usr/bin/env bash # # Plays videos from playlist # # Copyright © 2013 Janne Enberg http://lietu.net/ # This work is free.  See http://www.wtfpl.net/ for more details. # # If you want to switch omxplayer to something else, or add parameters, use these PLAYER="omxplayer" PLAYER_OPTIONS="" # Where is the playlist PLAYLIST_FILE="${HOME}/.playlist" # Process playlist contents while [ true ]; do # Sleep a bit so it's possible to kill this sleep 1 # Do nothing if the playlist doesn't exist if [ ! -f "${PLAYLIST_FILE}" ]; then echo "Playlist file ${PLAYLIST_FILE} not found" continue fi # Get the top of the playlist file=$(cat "${PLAYLIST_FILE}" | head -n1) # And strip it off the playlist file cat "${PLAYLIST_FILE}" | tail -n+2 > "${PLAYLIST_FILE}.new" mv "${PLAYLIST_FILE}.new" "${PLAYLIST_FILE}" # Skip if this is empty if [ -z "${file}" ]; then echo "Playlist empty or bumped into an empty entry for some reason" continue fi # Check that the file exists if [ ! -f "${file}" ]; then echo "Playlist entry ${file} not found" continue fi echo echo "Playing ${file} ..." echo "${PLAYER}" ${PLAYER_OPTIONS} "${file}" echo echo "Playback complete, continuing to next item on playlist." echo done {{< /highlight >}}playlist
{{< highlight bash >}} #!/usr/bin/env bash # # Add files to playlist # # Copyright © 2013 Janne Enberg http://lietu.net/ # This work is free.  See http://www.wtfpl.net/ for more details. # # Where is the playlist PLAYLIST_FILE="${HOME}/.playlist" # Check for proper usage if [ $# -eq 0 ]; then echo " Adds files to the system playlist (${PLAYLIST_FILE}) Usage: playlist *.avi playlist /path/to/futurama/*/* " exit 1 fi # Loop through arguments given for entry in "$@"; do if [ ! -f "${entry}" ]; then echo "Invalid entry, ${entry} .. skipping" continue fi # Get full path to the file fullPath=$(readlink -f -- "${entry}") # Append file to playlist echo "${fullPath}" >> "${PLAYLIST_FILE}" echo "Added ${fullPath} to system playlist" done {{< /highlight >}}It is pretty important that there is nothing in the file before the #!, no new lines, no nothing. Otherwise the formatting doesn't matter much...
Make the scripts executable:
{{< highlight bash >}} chmod +x "${HOME}/bin/"* {{< /highlight >}}To make the playlist processing script appear in your menus, you can put the following contents in ~/.local/share/applications/process_playlist.desktop
{{< highlight ini >}} [Desktop Entry] Type=Application Name=Process system playlist Exec=process_playlist Terminal=True Categories=AudioVideo;Player; Icon=/usr/share/icons/nuoveXT2/96x96/categories/applications-multimedia.png {{< /highlight >}}


I’m a post-doc Researcher of Integrated Engineering and Materials Sciences program from Federal University of Paraná, and a Visiting Research Fellow at Athlone Institute of Technology.
Gain insights into my published manuscripts through these informative videos.
Post-graduate course of Termodynamics in materials science.
Post-graduate course of Introduction on Physical chemistry of surfaces.


| include {htmltools} | R Documentation |
Load HTML, text, or rendered Markdown from a file and turn into HTML.
includeHTML(path) includeText(path) includeMarkdown(path) includeCSS(path, ...) includeScript(path, ...)
path |
The path of the file to be included. It is highly recommended to use a relative path (the base path being the Shiny application directory), not an absolute path. |
... |
Any additional attributes to be applied to the generated tag. |
These functions provide a convenient way to include an extensive amount of HTML, textual, Markdown, CSS, or JavaScript content, rather than using a large literal R string.
includeText
escapes its contents, but does no other processing.
This means that hard breaks and multiple spaces will be rendered as they
usually are in HTML: as a single space character. If you are looking for
preformatted text, wrap the call with pre
, or consider using
includeMarkdown
instead.
The includeMarkdown
function requires the markdown
package.


Your sponsorship and association with Infusion will help your organization expose its name to thousands of future leaders from universities throughout the country. The target audience will extend beyond college students and reach out to a community that holds tradition, culture, and values at the utmost respect. Your sponsorship will reach an extensive crowd at a minimal cost and will not be limited by geographic region. The main audience your organization will be exposed to includes (but is not limited to) the South Asian community, which is home to nearly 10% of the United States’ millionaires.
Corporate Packet Local Packet


--- layout: post title: "Too Good To Go!" subtitle: "Mobile application to cut back on waste." date: 2021-07-19 3:40:13 -0400 background: '/img/posts/free-food.jpg' ---
Save Food, Help the Planet" is the motto of this mobile application which aims to reduce food waste!
Find out more information here!


{include file="$include_tpl/includes/head.html"} {include file="$include_tpl/includes/sidebar.html"} {$title} Beranda {$title} {$sub_title} User ID: Nama: Email: No. HP: Update {include file="$include_tpl/includes/footer.html"}