Home
About
Portfolio
Blog
Contact
Search
Studio Lian
Studio Lian Preview
Lian Creative Agency
Minimal Freelance Portfolio
Design & Branding
We Deliver Quality Results
Studio Lian Gallery
All
Logo
Mobile App
Wordpress
Web Design
UI/UX
Branding
Subject One
Subject Two
Subject Three
Subject Four
Subject Five
Subject Six
Subject Seven
Subject Eight
Subject Nine
Subject Ten
Load More
Search
Search


105 the one giving the block definition, this script always means the innermost ring. But the upvar means the outer ring: It’s analogous to using explicit formal parameters when you nest calls to higher order functions. C. Macros Users of languages in the C family have learned to think of macros as entirely about text strings, with no relation to the syntax of the language. So you can do things like #define foo baz) with the result that you can only use the foo macro after an open parenthesis. In the Lisp family of languages we have a different tradition, in which macros are syntactically just like procedure calls, except that the “procedure” is a macro, with different evaluation rules from ordinary procedures. Two things make a macro different: its input expressions are not evaluated, so a macro can establish its own syntax (but still delimited by parentheses, in Lisp, or still one block, in Snap ! ); and the result of a macro call is a new expression that is evaluated as if it appeared in the caller of the macro, with access to the caller’s variables and, implicitly, its continuation.


Drop your email here and we will tell you when it is available!
We mean add in what you want and takeaway what you don't
Select your ingredients and customize your supplements with the click of a mouse.
Easily drag and drop any ingredients into your custom supplement mixture creating your personalized blend.
Add ingredients in the right amounts. If you want more, add it. If you want less, trim it down.
Our ingredients are of the highest quality to ensure performance and caliber.
See some of our example ingredients:
Beta Alanine 2g
L-Arginine 1.5g
Citrulline Malate 1.5g
Niacin 5mg
L-Leucine 3.5g
L-Isoleucine 1.75g
L-Valine 1.75g
Whey Protein 23g
Glutamine 1.5g
BCAA Blend
Creatine
Caffeine
Fish Oil
L-Carnitine
Protein
Vitamin B12
Vitamin C


9 February 2009 - The Ministry of Health and Population of Egypt has announced a new human case of avian influenza A(H5N1) virus infection. The case is a one and a half year old male from the Maghagha District of Menia Governorate. His symptoms began on 6 February and he was hospitalized at the Maghagha Fever Hospital on 7 February where he remains in a stable condition. Infection with the H5N1 avian influenza virus was confirmed by the Egyptian Central Public Health Laboratory.
Investigations into the source of his infection indicate a history of close contact with dead poultry prior to becoming ill.
Of the 55 cases confirmed to date in Egypt, 23 have been fatal.


What I Eat
Version 0.1.
Jurij Zilcov
Change log
License
Several open source products are in use:
Tesseract OCR
Tesseract Tools for Android
ZXing


| Uniplex 262 General Information
-
| Synonyms: |
1,4-Cyclohexanedimethanol dibenzoate; 1,4-Bis(benzoyloxymethyl) cyclohexane; [4-(phenylcarbonyloxymethyl)cyclohexyl]methyl benzoate |
| Molecular Formula: |
C22H24O4 |
| CAS Registry No.: |
35541-81-2 |
| Chemical Category: |
Benzoates |
Usage and Performance Characteristics
-
| Manufacturer: |
Unitex Chemical Corporation |
| Used for Products: |
Coatings, cleaning materials for roll coaters |
Physical Properties
-
| Aggregate State at 25°C: |
Crystalline particles (lumps or granules) |
| Vapor Pressure, kPa: |
0.001333 (160°C) |
Chemical Properties
Optical Properties
Hazard-Related Data
-
| OSHA Hazard Class: |
Not hazardous 29 CFR 1910.1200 |
| Eye Irritation (human): |
May cause irritation, with pain |
| Flash Point Temperature, °C: |
>232 |
| HMIS Personal protection: |
Safety glasses, gloves, lab. coat |
| Skin Irritation: |
May cause irritation, redness & swelling |
Environmental Parameters
-
| Octanol-Water Partition Coeff., log Kow: |
6 |
| Theoretical Oxygen Demand, ThOD, g/g: |
2.36 |
Plasticizers Database (2nd Electronic Edition) Copyright © 2004 by ChemTec Publishing |


Harsh Sharma
Collaborator
Electronics Undergrad
NSUT Delhi
Help kids directly by recharging their phones, paying for refurbishing of the phones and the necessary accesories. Visit the link here to know more about how to help
Help us make an impact; if you are the 'Peritus' to guide the kids, fill the form on the link above and we will contact you.
Being one of the most important collaborations we look for: to devote time teaching, brainstorming new ideas, or just helping us out in reaching the vision. We will match you to tasks under your expertise for your growth.
Especially for those who cannot afford a smartphone even and this vicious cycle directly impacts how young kids end up in this country. We want to change it with a small step, through collaborations and public support, get SmartPhones to those who cannot afford it. This vision is largely dependant on collaboration and volunteering and so we expect support from you to acheive these deliverables to make it successful.
Help develop curriculum for kids and using chatbots broadcasting knowledge at scale.
Helping the kids realise the importance of being self dependant/ AatmaNirbhar and help realise the goal with collaborative activities over the web.
We are remote,CEHRO, JNU
Delhi, 110067
+91<PHONE_NUMBER>
+91<PHONE_NUMBER> (other)
Click Here or use
the onscreen Chatbot
Anytime during the day, just
make sure we at +5:30GMT


|
clang::tidy PagesJaunes rules
1.0
Rules for manipulating PagesJaunes eSQL requests
|
#include <ExecSQLLOBReadToFunctionCall.h>
Classes | |
| struct | AssignmentRecord |
| struct | ReqFmtRecord |
| class | SourceRangeBefore |
| class | SourceRangeForIntegerNStringLiterals |
| struct | VarDeclMatchRecord |
Public Types | |
| using | source_range_set_t = std::multiset< SourceRangeForIntegerNStringLiterals, SourceRangeBefore > |
Public Member Functions | |
| ExecSQLLOBReadToFunctionCall (StringRef, ClangTidyContext *) | |
| Constructor for the ExecSQLLOBReadToFunctionCall rewriting check. More... | |
| void | storeOptions (ClangTidyOptions::OptionMap &Opts) override |
| Store options for this check. More... | |
| void | registerMatchers (ast_matchers::MatchFinder *) override |
| Register the ASTMatcher that will found nodes we are interested in. More... | |
| void | registerPPCallbacks (CompilerInstance &Compiler) override |
| Register callback for intercepting all pre-processor actions. More... | |
| void | check (const ast_matchers::MatchFinder::MatchResult &) override |
| This method is called each time a visited AST node matching our ASTMatcher is found. More... | |
Public Attributes | |
| ClangTidyContext * | TidyContext |
Protected Attributes | |
| std::vector< struct ReqFmtRecord * > | m_req_fmt_collector |
| std::vector< struct VarDeclMatchRecord * > | m_req_var_decl_collector |
| std::vector< struct AssignmentRecord * > | m_req_assign_collector |
Definition at line 27 of file ExecSQLLOBReadToFunctionCall.h.
| using clang::tidy::pagesjaunes::ExecSQLLOBReadToFunctionCall::source_range_set_t = std::multiset<SourceRangeForIntegerNStringLiterals, SourceRangeBefore> |
Definition at line 87 of file ExecSQLLOBReadToFunctionCall.h.
| clang::tidy::pagesjaunes::ExecSQLLOBReadToFunctionCall::ExecSQLLOBReadToFunctionCall | ( | StringRef | Name, |
| ClangTidyContext * | Context | ||
| ) |
Constructor for the ExecSQLLOBReadToFunctionCall rewriting check.
ExecSQLLOBReadToFunctionCall constructor
The rule is created a new check using its ClangTidyCheck
base class. Name and context are provided and stored locally. Some diag ids corresponding to errors handled by rule are created:
| Name | A StringRef for the new check name |
| Context | The ClangTidyContext allowing to access other contextsInit check (super class) Init our TidyContext instance Request grouping option: Filename containing a json map for a group name indexing a vector of requests name |
Definition at line 150 of file ExecSQLLOBReadToFunctionCall.cpp.
|
override |
This method is called each time a visited AST node matching our ASTMatcher is found.
check
This method will navigated and inspect the found AST nodes for:
| Result | The match result provided by the recursive visitor allowing us to access AST nodes bound to variables |
Definition at line 1133 of file ExecSQLLOBReadToFunctionCall.cpp.
|
override |
Register the ASTMatcher that will found nodes we are interested in.
registerMatchers
This method register 1 matcher for each oracle ProC generated statement to rewrite. The matcher bind elements we will use, for detecting the found statement we want to rewrite , and for writing new code.
| Finder | the recursive visitor that will use our matcher for sending us AST node. |
Definition at line 566 of file ExecSQLLOBReadToFunctionCall.cpp.
|
override |
Register callback for intercepting all pre-processor actions.
ExecSQLLOBReadToFunctionCall::registerPPCallbacks
Allows to register a callback for executing our actions at every C/C++ pre-processor processing. Thanks to this callback we will collect all string literal macro expansions.
| [in] | compiler | the compiler instance we will intercept |
Definition at line 587 of file ExecSQLLOBReadToFunctionCall.cpp.
|
override |
Store options for this check.
storeOptions
This check support one option for customizing comment regex
| Opts | The option map in which to store supported options |
Definition at line 540 of file ExecSQLLOBReadToFunctionCall.cpp.
|
protected |
Definition at line 179 of file ExecSQLLOBReadToFunctionCall.h.
|
protected |
Definition at line 115 of file ExecSQLLOBReadToFunctionCall.h.
|
protected |
Definition at line 130 of file ExecSQLLOBReadToFunctionCall.h.
| ClangTidyContext* clang::tidy::pagesjaunes::ExecSQLLOBReadToFunctionCall::TidyContext |
Definition at line 31 of file ExecSQLLOBReadToFunctionCall.h.


"The broadcast industry is on a fast migration path from tape delivery of contribution material to file delivery. Our playout servers are fairly rigid about file format compatibility and we used to spend many hours attempting to discern file characteristics when troubleshooting client contribution. We need to be able to identify codecs, bitrate info, frame rates, scan rates and more. Prior to discovering this program we had no hardware/software solution for assisting our clients in providing usable content."
"An HD camera and edit system is so inexpensive these days that people who know nothing about video production can become a Video Producer. These users are completely unfamiliar with export settings on their systems. MediaInfo is an invaluable tool to evaluate a file and identify issues within seconds. It provides every bit of information we need discover why a file will not work within our systems and provide info back to the contributor to correct these issues."
"MediaInfo is widely used in the Broadcast Television industry and has become our little secret in presenting ourselves as the ultimate authority in file based content delivery."
— Mark Dunham, Chief Engineer, KXAN-TV.


--- layout: post title: Sed to remove all tags from XML file date: 2011-01-01 23:26:54.000000000 +00:00 type: post parent_id: '0' published: true password: '' status: publish categories: - bash tags: [] meta: _edit_last: '1' _wp_old_slug: '' author: Noel permalink: "/sed-to-remove-all-tags-from-xml-file/" ---
sed -r "s/.*>(.*)<\/.*/\1/"


--- layout: default ---
We are an Agile development team using Ruby on Rails, Meteor and Ionic to craft great web and mobile apps. We work with startups and grown-up companies.
{{ page.offer1 }}
{{ page.offer2}}
Don't hesitate and apply right away! In case of questions - drop us a line at jobs@naturaily.com


Assignments | CISC 3130 Data Structures
Department of Computer & Information Science, Brooklyn College
Table of Contents
Course Page: https://libguides.brooklyn.cuny.edum/cisc3130
Semester: Spring 2020
Professor: Katherine Chuang<EMAIL_ADDRESS>This is part of the OER resource released under Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Assignment Due Dates
This section to summarize the links for submitting assignments.
| Assignment | Due Date | Link |
|---|---|---|
[A1] Top Streaming Music Artists |
2/20/2020 | Form |
[A2] Music Playlist |
3/5/2020 | Form |
[A3] Assignment 3 |
3/19/2020 | Form |
[A4] Assignment 4 |
4/2/2020 | Form |
[A5] Assignment 5 |
4/30/2020 | Form |
Each of the google forms linked above creates a spreadsheet, which I use as my checklist to review the work submitted. I will not be checking my email for assignment submissions and due to technical difficulties with my browser, will not be downloading attachments for submissions.
Please avoid submitting the following types of files: .class
, .jar
, .zip
These 5 assignments make up 20% of your final grade. For more on the grading scheme, please read section 1.3 Grading Rubric.
1 Objective
Take home assignments are opportunities to enhance the concepts and theories we cover in class in a more tangible way. You would find the most value of these assignments if you treat them with the seriousness as if you were employed by a VIP client, albeit with obscure and outdated data processing needs.
Assignments are structured as if you were hired on as a developer in training.
1.1 Your Role
Imagine you are the developer and manager hh on a team of one. This means that you are solely responsible for delivering your code on time, and. That the code you produce you are proud of owning. All the tasks are specified in advance so that you can schedule time to complete them in your own time.
All the assignments boil down to an essence with very similar work flow:
- Read in a text file provided
- Process text file as needed by the task requirements
- Output as specified by the assignment requirements
- Submit the code to the form by the due date
The project tasks are scoped to be bite sized pieces of much more full-fledged programming projects for large companies, which go through the steps to extract, transform, and load (ETL) data into databases.
While full time professions might work with gigabytes or terabytes of data at a time, in this class we will limit data sizes of 1MB or smaller text files per assignment. That being said, we will not be concerned with transforming data from one product to another. We will just be using Java programs to convert data from unstructured to structured data.
Each of the assignments can be completed within an afternoon by an experienced programmer who has grasped the fundamentals of data structure concepts. Since you are learning the data structures this semester, you will likely need more than a couple of hours so the assignments are scheduled such that you have approximately two weeks of time to focus on each.
1.2 Technology requirements
1.3 Grading Rubric
These assignments are designed with the idea that a seasoned, full-time programmer can finish in an afternoon of about 2-4 hours. In translating to an undergraduate curriculum where the student is learning the material, approximately 2 weeks is given in between due dates to allow substantial time to complete the assignments. Thus, late assignments are frowned upon. Late assignments means submitting any time after the specified due date, and will limited to score of one regardless of the level of effort. Not turning in on time will be given a score of zero. Late assignments will be accepted until the close of business on 4/30/2020. All assignments combined are 20% of your final grade.
The assignments will be graded on a scale of strong effort and weak effort.
Weak effort looks like someone who rushed to get the work done. For example,
- Met most of specs but didn't check carefully over their work.
- Noticeable amount of typos, and grammar mistakes.
- Hard to read code, which might be a result of messy code or lacking comments to make it more readable.
Strong effort exhibits work that surpasses weak effort, such as:
- Neatly presented, tidy code base and well documented code (maintainable code)
- Relatively easy to tell what was being done and how (documented code)
- Goes above and beyond what is explicitly stated
While you may discuss your work with class colleagues, submit your own work. Each task comes with specific requirements. Part of your "job" is be able to analyze what's being asked beyond the obvious.
2 General Advice
Here are some general advice related to working through programming assignments.
2.1 The Act of Problem Solving
Programming is not just about the syntax of programming languages.  Computer science as a field is about solving problems, and computing the solution(s). You'll hear many versions of this thing about solving problems. Great computer scientists are great problem solvers.
Programming is about solving problems. You have to understand the problem before you can solve it adequately. You have to understand how to break down the problem into operational steps before you can tell a computer the steps.
Before you begin coding, think about the problem. Reading comprehension skills matter. Think about why you might have been suggested to use that data structure. Ability to be a thinker - to analytically and critically think about problems and solutions - is what separate the amazing and okay tech professionals and what helps determine the prevalence and longevity of your career prospects in any field.
For instance, you might want to ask yourself for each assignment, "What are the advantages and disadvantages of using that data structure? What features come with this data structure to make it the best choice for this problem?" Read relevant material, discuss with class colleagues as necessary to solidify your understanding.
As you code, it helps to be conscious and actively engaged in the activity. Programming involves you to be aware of your state of mind.
2.2 Great code is great pose
Great code is succinct, expressive, and clear the first time you read it. It tries to guide the reader through transitional steps. It aims for functions with a single main idea. Great code is clean, maintainable code.
It's uncommon to write the best looking code on the first try, especially while you're still in school learning. It can take several iterations of refactoring to get code to the most elegant form. It's encouraged that you try to develop an intuitive sense for what great code looks like so you know where to improve.
2.3 Following spec
When you submit your assignment, check carefully the description and the items that should be submitted, and exact formatting of such. These are the specifications for the assignment, and for the rest of the document referred to as "spec". Please be kind to your future self by treating these take home assignments with the same rigor as you would with future employment, in order to practice the skill of adhering to spec.
- Do your best to meet the specs.
- Ensure that the code compiles and works
- Ensure that you meet the “business logic” conditions that were specified work
- Files asked for are in the item turned in
Note that in life by nature of reality and one's discernment abilities, some specs will be obvious, some will be less obvious. Take the opportunity to practice developing the ability to deduce the not stated.
2.4 Other Tips
2.4.1 Don't procrastinate.
Very few developers figure out the code in one sitting. Schedule your work in chunks. Some common chunks:
2.4.2 Be organized.
Being organized helps a lot. Organizational skills is the bread and butter of data structures (the bread and butter of computer science).
2.4.3 Persist.
Don’t give up immediately if you can’t get figure out the error error. Systematically try and try again. Make notes for yourself on what didn’t work, your hypotheses, and also what worked. This can include retracing your code line by line, searching the internet, chatting with someone.
2.4.4 Find the tools that work for you.
Recommended workflow for assignments using linux/unix flavored tools will be explained early on in the semester just to cover briefly one way to complete the assignments. Treat that as a senior developer passing on some advice. You don't have to use the proposed set of tools.
2.4.5 Developing fluency.
Some of you may be more comfortable with what the assignments are asking. Some may be less comfortable. If you’re on the less comfortable side, please make sure to read any suggested reading material. You may ask me for help however note that when you ask for my support, I will ask you what you’ve read and tried to start off discussion.
- We are going to use the department official language, Java 8, for most of the course.
- You're welcome to explore practicing with other programming languages and submit with other languages. You will get credit for work in another language so long as your submission includes a write up explaining why you chose that language over languages. "I don't like programming in the Object Oriented Paradigm" is perfectly fine, if you can give more reasons comparing advantages and disadvantages of features that would be better. Length should be what could constitute as "a long email".
2.5 Asking for help
In previous courses, students have found it helpful to form study groups to discuss the requirements and their solutions with each other. Please feel free to organize a study group.
If anything is unclear please write an email explaining what is confusing you. Writing more detail with what you're struggling with helps, please include a minimal working example (MWE) where relevant to do so.
Office hours are available for students who need further clarification of concepts presented in lecture, or have made solid attempts on the homework assignments or other practice problems and require further assistance understanding how to approach such problems.
3 Project template
When there are multiple waves of similar work to be done for multiple projects, a developer might prepare a standard example of a "core" set of files to reference or reuse. Since the project assignments all require reading in an input text file, I've prepared an example that could potentially be used.
You may create your own template or use the one provided. When you create your own, strive to make files and code easy to find, and easy to read. Think about how you want to organize your files. Do you want one repository per assignment? All assignments in one repository, with different subfolders? Or would you prefer different Java files? There are pros and cons to each design choice, and picking one can sometimes be based on subjective choice.
3.1 Motivations
The prepared code repository aims to show a reasonably good sample, with meeting the following conditions.
- Demonstrates an example of generally good file organization practices, and
- Demonstrates an example of organized easy to read code, and
- Provides sample code to show students how to read from text files, and
- Serves as a baseline for showing students language fluency level needed as prerequisite for the course.
3.2 Where to find it
The link to this template repository is: https://github.com/cisc3130-s20/assignment-template
There is a GitHub organization for this semester named CISC3130-s20
.
4 The Tasks
Descriptions for each assignment is given below.
[A1] Top Streaming Artists
Learning Objectives
- Review prerequisite Java programming knowledge by putting together a small project
- Review the of the Java array type, scaling to 2D arrays
- Review of Java OOP concepts with creating classes, and instantiating them
- Create custom linked list class with appropriate members and methods
- Compare the operations for working with the array type and linked list
Problem Description
A record label executive received text files that contain the top streamed music artists during certain weeks. Each file represents one track by an artist. One track means one song. An artist's name might appear multiple times. The data comes from Spotify Charts.
In order for their in house IT to be able to process the information, they need someone to help process it.
Each text file is a comma separated value (CSV) file that has a few columns like the following table 3:
| Position | Track Name | Artist | Streams | URL |
|---|---|---|---|---|
| 1 | One Dance | Drake, WizKid, Kyla | 100 | … |
| 2 | Lean On | Major Lazer, MØ, DJ Snake | 99 | … |
| 3 | Sunflower - Spider-Man: Into the Spider-Verse | Post Malone, Swae Lee | 98 | … |
| 4 | Somebody That I Used to Know | Gotye, Kimbra | 97 | … |
| 5 | Rolling in the Deep | Adele | 96 | … |
| … | … | … | … | … |
Because it's a CSV file, column delimiters are written with a ,
symbol. Each line in the text file represents one song.
Position,"Track Name",Artist,Streams,URL
- Who appears on the top streamed list?
First, the exec wants to know which artists appears on the list and how many times they appear. Prepare an output file with contents of your nested array so that the record label executive can see this report. Note on data links: These links are provided merely for quick access to data files. You may choose to download any date or country from Spotify Charts of interest. Best practice with any type of data work is to provide a note on whichever data you select and rationale for doing so.
- Link to Data Extract 1: Week ending Jan 23, 2020 (Global)
- Link to Data Extract 2: Week ending Jan 23, 2020 (US)
Not knowing data structures yet, it seems the way to proceed quickly at building is with Java arrays. Read in the text file and then save the
CSV
file format into a nested Java array likemyList
below. If an artist appears multiple times, then that artist probably should only appear once in your nested array./* Java nested array syntax */ int cols = 4; // arbitrary number represents columns to create int rows = 10; // arbitrary number represents rows to create; String[][] myList = new String[rows][cols]; int[][] arr = { { 1, 2 }, { 3, 4 } }; System.out.println("arr[0][0] = " + arr[0][0]);
Will you limit to just the artist name? Perhaps you should discuss your decision with your class colleagues.
- Who are the music artists (in alphabetical order)?
It just so happens that this imaginary VIP client has a thing for alphabetized lists and wants to see the artist names in alphabetical order. Since you learned about linked lists in class, you should know how to create one.
You can probably take the array from part 1, which is hopefully a truncated version of the raw data, and insert artist names into a sorted linked list.
You may use the example classes below to start with to design a sorted list of
TopStreamingArtists
. You may also create your own classes. The classes work like templates because they offer a blueprint, where you can reuse the object oriented structure by creating objects from those classes./* A node represents an artist */ class Artist { private String name; private Artist next; // add constructors } /* The List TopStreamingArtists is composed of a series of artist names */ class TopStreamingArtists { private Artist first; public void TopStreamingArtists(){ first = null; } public boolean isEmpty(){ return (first == null); } }
Using the linked list structure you've designed and created, you can resume with the data processing in order to provide another report to the insert an artist name to the
TopStreamingArtists
linked list.public static void main(String [ ] args) { TopStreamingArtists artistNames = new TopStreamingArtists(); artistNames.insert("Stage Name"); artistNames.displayList(); }
Make sure to print out the report for the exec showing the data in ascending order by Artist name.
Where to Submit
Please fill out this form (link not yet available)
What you should submit is a link to where your code repository is located. Your code repository should have the elements described in the project template section. It should also match the items asked for in parts 1 and 2 above.
Specifically:
[A2] Music playlist
Learning Objectives
- Practice working with multiple input files
- Review the creation of linked list class
- Create custom Stack and Queue ADTs to use
- Perform operations with the custom defined ADTs to see the advantages and disadvantages of each
Problem Description
Your VIP client wants to listen to the music tracks in this week's latest song list to review them and get a sense for what they sound like. This time your client wants you to process all the full weeks of this quarter that have already passed so you're given multiple CSV files of the same format.
Your client also says they want to listen to songs based on song/track titles in ascending order. It must be in this order.
- Can you read from multiple input files?
Instead of reading just one file at a time, process multiple files. It might help to store the file names in a data structure where
myFiles = [week1, week2, week3, weekn]
to make it easier to manage, or perhaps you want to make it possible to read any number of files in a directory.Below is an example of how could try to start the organization of code.
/* Storing one week of data in a queue */ public MyQueue extends LinkedList { // constructor creates a linked list that stores songs from one text file public MyQueue(String filename){ // take the filename, open it and convert to queue } } /* An example for working with multiple text files */ public class MyApp { // The files you'll be reading stored in a data structure to make it iterable myFiles = [week1, week2, week3, weekn]; ArrayList<WeekQueue> allTheWeeks = new ArrayList<>(); for (int i=0; i < myFiles.length-1; i++){ MyQueue dataExtract = new MyQueue(myFiles[i]); allTheWeeks.add(dataExtract); } }
- Can you build a playlist?
In class not too long ago we went over the design of various types of linked list design patterns available. Some of these linked lists are conducive to inserting items to one end and removing from the other end.
/* The Playlist implementation */ class Song { private String track; private Song next; // add constructors } public class Playlist { private Song first; public void Playlist(){ // constructor for creating a new list } public void addSong(Song s){ } public Song listenToSong(){ // retrieves the next song to listen to } }
Once you read in multiple files, you'll likely have sorted lists. Try to merge these multiple arrays together into one single sorted queue. Below is an example of merging 2 sorted lists into one.
/* This function takes two queues and returns one into one */ public MyQueue mergingFunction(MyQueue q1, MyQueue q2){ }
- Can you track what was recently listened to?
As a song is removed from the song playlist, it should go to the data structure tracking the listing history. In class we learned about the stack data structure that can let you easily access the most recently inserted item.
/* The SongHistoryList implementation */ public class SongHistoryList { private Song first; public void SongHistoryList(){ // constructor for creating a new list } public void addSong(Song s){ } public Song lastListened(){ // retrieves the next song to listen to } }
Where to Submit
Please fill out this form (link not yet available)
What you should submit is a link to where your code repository is located. Your code repository should have the elements described in the project template section. It should also match the items asked for in parts 1 and 2 above.
Footnotes:
I am unfamiliar with most of the IDEs in vogue today and therefore unlikely to be a good resource for helping you through IDE issues. Please find a class colleague to help you.
Git is an open source version control system. Some information summarized on the OER course page
This list comes from The Top Songs, Artists, Playlists, and Podcasts of 2019—and the Last Decade (accessed 2020-01-16)


| TABLE 1 |
Demographic profile of respondents. |
| TABLE 2 |
Perceived increase and decrease in climatic events in the st ... |
| TABLE 3 |
Perceived effect of climate variability and change on access ... |
| TABLE 4 |
Perceived vulnerability of forest products to climate change ... |
| TABLE 5 |
Perceived sensitivity of forest products to increase inciden ... |
| TABLE 6 |
Perceived sensitivity of forest products to increase inciden ... |


Components.ModalDialogComponent Class
Item Index
Properties
Events
Methods
_cancel
()
private
_confirm
()
private
cancel
()
confirm
()
shake
(
-
element
Parameters:
-
element
Object
Properties
_clickOutsideModal
String | Function | Boolean
private
Computed property.
_disablePointerEvents
Boolean
private
To disable pointer events set the clickOutsideModal
property to the string disable-pointer-events
.
_disableScroll
Boolean
private
_maskContent
Boolean
private
Computed property
attributeBindings
Array
private
Default: `['tabindex']`
classNameBindings
Array
private
Default: `['dialogOpen:uic-modal-container', '_disablePointerEvents:uic-disable-pointer-events']`
classNames
Array
private
Default: `['uic-modal-dialog', 'no-outline']`
clickOutsideModal
String | Function | Boolean | Null
clickOutsideModal
Specify what should happen when the user clicks outside the modal dialog.
Options
Null
- do nothingBoolean
-true
calls the_confirm
method,false
calls the_cancel
method.String
- if a method is found on the component, then call it.Function
- calls the method
Keywords & built-in methods
confirm
calls the_confirm
methodcancel
calls the_cancel
methodshake
calls theshake
methoddisable-pointer-events
applies theuic-disable-pointer-events
class to the modal container
Default: false
dialog
Object
private
disableScroll
Boolean
Default: `false`
displayModal
Boolean
private
maskContent
Boolean
Default: `true`
tabindex
Integer
private
Default: `1`
Events
click
dialogOpenChanged
private
keyDown
private
Event Payload:
-
event
Object


Sponsored Freelance Jobs
Sponsored & Most Popular Freelance Jobs
Finding out exactly how you can work succesfully on online jobs or freelance jobs
Cloud Jobs
Cloud Jobs the launch of- exactly what is the idea behind the launching of Cloud Jobs
Cloud Jobs
Cloud Jobs the launch of- exactly what is the idea behind the launching of Cloud Jobs
Latest Freelance Jobs
Finding out exactly how you can work succesfully on online jobs or freelance jobs
Cloud Jobs
Cloud Jobs the launch of- exactly what is the idea behind the launching of Cloud Jobs
Cloud Jobs
Cloud Jobs the launch of- exactly what is the idea behind the launching of Cloud Jobs
Cloud Jobs Forums
How to perform certain tasks on cloud jobs in order to maximise your productivity
Online Portfolios
Creating online portofolios to showcase your talent and maximise your conversion rate from your online portfolio
SEO
Search Engine Optimization and how it relates to your online success as a freelancer...


one
two
three
four
five
one
two
three
four
five
one
two
three
four
five
one
two
three
four
five
one
two
i am a line
i am a line
i am a line
i am a line
i am a line
three
four
five
one
two
three
four
five
one
two
three
four
five


Master of Engineering in Computer Science and Information Engineering Candidate
Bachelor of Engineering in Computer Science and Information Engineering
Completed coursework towards Bachelor of Science in Mathematics
| Author | Title | In | Year |
|---|---|---|---|
| Yu-Jing Lin, Min-Yuh Day, Chih-Chien Wang, Chien-Chang Chen | A Text Mining Approach for Analyzing the Politics Similarity of Taiwan Legislative Elections (in Chinese) | Taiwan Academic Network Conference | 2017 |
| Chien-Chang Chen,Ling-Ying Chen,Yu-Jing Lin | Block Sampled Matching with Region Growing for Detecting Copy-Move Forgery Duplicated Regions | Journal of Information Hiding and Multimedia Signal Processing 8 (1) | 2017 |
2017 Taiwan Academic Network Conference (Tung Hai University, Taichung, Taiwan)
2017 CICET MSc/Ph.D. Student Workshop (Tamkang University, New Taipei, Taiwan)
2016 Cross Strait Research Forum (The Hong Kong Polytechnic University, Hong Kong)
2017 NETs International Conference on INTERNET STUDIES (Bali, Indonesia)
| Time | Subject |
|---|---|
| Sep 2016 - Present | Engineering Mathematics |
| Sep 2016 - Present | Special Topics Lab |
| Feb 2017 - Jun 2017 | Introduction to Computer |
| Feb 2017 - Jun 2017 | Introduction to Multimedia |
| Location | Time | Position | Detail |
|---|---|---|---|
| New Taipei City, Taiwan | Jul 2016 – Jan 2017 | Web Developer (Intern) | Design, build and maintain web sites, using scripting languages, content creation tools and management tools. |
| Time | Competition | Result |
|---|---|---|
| 2017 | E.SUN Bank FinTech Hackathon | Preliminary |
| 2016 | Big Data Analytics for Semicanductor Manufacturing
(using Apache Hadoop for manage database) |
Preliminary |
| 2015 | Microsoft student program, SAA of Intern candidate | Final, the top 0.03％ |


本文代码下载
之前介绍了如何用 miniflow 实现 forward pass，现在我们来实现 backward propagation，也就是从loss function 出发，利用链式法则，推导出每一个参数的导数。
首先我们得添加Loss Function 相关的代码。
下面是 MSE （Mean Square Error）的实现。
C(w,b) = 1 / m * ∑_x ∣∣ y(x)−a ∣∣ ^2
class MSE(Node): def __init__(self, y, a): """ The mean squared error cost function. Should be used as the last node for a network. """ Node.__init__(self, [y, a]) def forward(self): """ Calculates the mean squared error. """ # NOTE: We reshape these to avoid possible matrix/vector broadcast # errors. # # For example, if we subtract an array of shape (3,) from an array of shape # (3,1) we get an array of shape(3,3) as the result when we want # an array of shape (3,1) instead. # # Making both arrays (3,1) insures the result is (3,1) and does # an elementwise subtraction as expected. y = self.inbound_nodes[0].value.reshape(-1, 1) a = self.inbound_nodes[1].value.reshape(-1, 1) m = self.inbound_nodes[0].value.shape[0] diff = y - a self.value = np.mean(diff**2)
class Input(Node): def backward(self): # An Input node has no inputs so the gradient (derivative) # is zero. # The key, `self`, is reference to this object. self.gradients = {self: 0} # Weights and bias may be inputs, so you need to sum # the gradient from output gradients. for n in self.outbound_nodes: self.gradients[self] += n.gradients[self]
class Linear(Node): def backward(self): """ Calculates the gradient based on the output values. """ # Initialize a partial for each of the inbound_nodes. self.gradients = {n: np.zeros_like(n.value) for n in self.inbound_nodes} # Cycle through the outputs. The gradient will change depending # on each output, so the gradients are summed over all outputs. for n in self.outbound_nodes: # Get the partial of the cost with respect to this node. grad_cost = n.gradients[self] # Set the partial of the loss with respect to this node's inputs. self.gradients[self.inbound_nodes[0]] += np.dot(grad_cost, self.inbound_nodes[1].value.T) # Set the partial of the loss with respect to this node's weights. self.gradients[self.inbound_nodes[1]] += np.dot(self.inbound_nodes[0].value.T, grad_cost) # Set the partial of the loss with respect to this node's bias. self.gradients[self.inbound_nodes[2]] += np.sum(grad_cost, axis=0, keepdims=False)
class Sigmoid(Node): def backward(self): """ Calculates the gradient using the derivative of the sigmoid function. """ # Initialize the gradients to 0. self.gradients = {n: np.zeros_like(n.value) for n in self.inbound_nodes} # Sum the partial with respect to the input over all the outputs. for n in self.outbound_nodes: grad_cost = n.gradients[self] sigmoid = self.value self.gradients[self.inbound_nodes[0]] += sigmoid * (1 - sigmoid) * grad_cost
class MSE(Node): def backward(self): """ Calculates the gradient of the cost. """ self.gradients[self.inbound_nodes[0]] = (2 / self.m) * self.diff self.gradients[self.inbound_nodes[1]] = (-2 / self.m) * self.diff
def sgd_update(trainables, learning_rate=1e-2): """ Updates the value of each trainable with SGD. Arguments: `trainables`: A list of `Input` Nodes representing weights/biases. `learning_rate`: The learning rate. """ for t in trainables: t.value -= learning_rate * t.gradients[t]
# import numpy as np from sklearn.datasets import load_boston from sklearn.utils import shuffle, resample # Load data data = load_boston() X_ = data['data'] y_ = data['target'] # Normalize data X_ = (X_ - np.mean(X_, axis=0)) / np.std(X_, axis=0) n_features = X_.shape[1] n_hidden = 10 W1_ = np.random.randn(n_features, n_hidden) b1_ = np.zeros(n_hidden) W2_ = np.random.randn(n_hidden, 1) b2_ = np.zeros(1) # Neural network X, y = Input(), Input() W1, b1 = Input(), Input() W2, b2 = Input(), Input() l1 = Linear(X, W1, b1) s1 = Sigmoid(l1) l2 = Linear(s1, W2, b2) cost = MSE(y, l2) feed_dict = { X: X_, y: y_, W1: W1_, b1: b1_, W2: W2_, b2: b2_ } epochs = 10 # Total number of examples m = X_.shape[0] batch_size = 11 steps_per_epoch = m // batch_size graph = topological_sort(feed_dict) trainables = [W1, b1, W2, b2] print("Total number of examples = {}".format(m)) # Step 4 for i in range(epochs): loss = 0 for j in range(steps_per_epoch): # Step 1 # Randomly sample a batch of examples X_batch, y_batch = resample(X_, y_, n_samples=batch_size) # Reset value of X and y Inputs X.value = X_batch y.value = y_batch # Step 2 forward_and_backward(graph) # Step 3 sgd_update(trainables) loss += graph[-1].value print("Epoch: {}, Loss: {:.3f}".format(i+1, loss/steps_per_epoch))


This project was both incredibly rewarding and frustrating at the same time. I was able to experience firsthand the work required to add subtitles to videos that have none and learning that it is not a quick task. It was very labor intensive and required a lot of quality check on my part to make the subtitles as close to accurate as I could.
It took me a few days to find a video that I felt would benefit from subtitles and would be interesting to a modern-day viewer. I decided to use a video that I stumbled on another YouTube user’s channel ricsil2037.
Original Video
I felt the video was a good choice since people today would find it interesting to watch an example of how special effects were created for radio shows back in the 1930’s plus it is a video that is relatively short, so a majority of people would watch it rather than see it as too long.
Radio shows were common before the 1950’s since TV’s were not available to the public, so the radio was a person’s primary form of entertainment in those days. Since the video was made from a ~1930’s radio show according to the original source, the subtitles had several errors.
After uploading the original video to my personal YouTube channel on Thursday and downloading the autogenerated subtitles in the .srt file which were not available until Friday afternoon when I checked.
I read the file and watch the autogenerated CC and decided that a viewer who is hearing impaired would get completely lost if they were only able to read the subtitles.
I spent on average 2-4 hours each day trying to manually fix the .srt file for upload while trying to guesstimate the correct time in the video to sync the speech too. This was meticulous work since I am a perfectionist plus doing something like this, I want to make it as accurate as possible otherwise an individual who is hearing impaired may not understand the video.
The video had 106 views after I published it publicly, which averages out to approx. 12 hours that I re-watched the video trying to improve the subtitles I had taken ownership for.
The tools provided by YouTube were adequate for me or any person to add subtitles to a video, however the tools do make it both difficult and a considerable time investment. I see this has the biggest obstacle for accessibility is that the tools required to make videos, websites, etc. accessible are fairly primitive in that it was completely manual in making sure the speech to text and timing was manually inputted.
The interface for the tools WAS NOT user friendly and anyone who didn’t have accessibility or subtitles as a deliverable or requirement could easily become frustrated. This would result in a majority of people viewing the auto-generated subtitles as sufficient for accessibility when in fact it is hardly sufficient.
Video with Subtitles
Overall, I am happy with my results since I believe anyone who watches my video can get a good understanding of what is happening in the story, both in terms of storyline and what is happening in the video.
I also gained a tremendous amount of knowledge about what is required to add accessibility to our media and that it is not as simple as adding an alt attribute to a div tag. This brings home my belief that accessibility is an area that needs to be prioritized at the beginning of a project to streamline and make it relatively hassle free to incorporate.


Evil twin is a term for a rogue Wi-Fi access point that appears to be a legitimate one offered on the premises, but actually has been set up to eavesdrop on wireless communications.An evil twin is the wireless version of the phishing scam. An attacker fools wireless users into connecting a laptop or mobile phone to a tainted hotspot by posing as a legitimate provider. This type of evil twin attack may be used to steal the passwords of unsuspecting users by either snooping the communication link or by phishing, which involves setting up a fraudulent web site and luring people there.
Evil twins aren't limited to public hotspots. These attacks can occur in offices or dorms – anywhere victims might be tricked into connecting to look-alike APs. Hotspots SSIDs are just really good bait. So, if you're in your hotel room when you see an SSID that's clearly out of place – like linksys or gogoinflight – don't connect. Better yet, disable auto-connect for saved hotspot SSIDs to avoid accidental reconnects.


I'm a codeslinger debugging from the mean streets of Champaign-Urbana, IL. Welcome to my blog, where I'll tell the tales of wondrous things I discover in the digital jungle.


|
|
Sample "Hello, World" Josh
|
public static void main(String []args) {
/* Object creation */
Puppy myPuppy = new Puppy( "tommy" );
/* Call class method to set puppy's age */
myPuppy.setAge( 2 );
/* Call another class method to get puppy's age */
myPuppy.getAge( );
/* You can access instance variable as follows as well */
System.out.println("Variable Value :" + myPuppy.puppyAge );
}
r4 := bufio.NewReader(f)
b4, err := r4.Peek(5)
check(err)
fmt.Printf("5 bytes: %s\n", string(b4))
This is the home page for the HelloWorld Web application.
To prove that they work, you can execute either of the following links:


oqtane/oqtane.framework Modular Application Framework for Blazor. Contribute to oqtane/oqtane.framework development by creating an account on GitHub.
My Crazy Idea To Reduce Draws In Chess The recent article by Vladimir Kramnik was quite fascinating. We've all had some weird "what if..." questions, like "what if people could fly?" or "what if there were no gravity?" Thanks to Kramnik and AlphaZero, we now see what happens to chess if castli...
Using WebAssembly from .NET with Wasmtime Wasmtime, the WebAssembly runtime from the Bytecode Alliance, recently added an early preview of an API for .NET Core, Microsoft’s free, open-source, and cross-platform application runtime. This API enables developers to programmatically...
ardacetinkaya/Blazor.Console A simple component to mock CLI for ASP.NET Core 3.0 Blazor applications to execute some custom commands for an application - ardacetinkaya/Blazor.Console
Stray Cat Strut but it's not swung Brian Setzer Stray Cat Strut but it's straight, not swung Although it was originally made famous by the Stray Cats, this is a later re-recording by the original writer/singer/guitarist with another band. Because deleting 1/3rd of the notes makes it go 3...
GIF Support now available in Xamarin.Forms - Gerald Versluis With the new pre-release version of Xamarin.Forms, you can now use animated GIF images! In this post I will show you how to use it in your app!
Spider-Man: The Animated Series (TV Series 1994–1998) - IMDb Created by Stan Lee, Steve Ditko. With Christopher Daniel Barnes, Sara Ballantine, Edward Asner, Roscoe Lee Browne. A young man with spider-like abilities fights crime as a superhero in New York City while trying to have a normal personal life.
dotnet/core Home repository for .NET Core. Contribute to dotnet/core development by creating an account on GitHub.
3.1.0 GA Windows installers for the runtime are branded "3.1.0 Preview 3" · Issue #492 · dotnet/runtime Reported at dotnet/core#3950 (comment) by @henrikrxn (thank you!) After installing VS 16.4 I checked "Control Panel" and the 3.1 runtime is listed as Name "Microsoft .NET Core Runtim...
.NET Rocks! vNext .NET Rocks! is a weekly talk show for anyone interested in programming on the Microsoft .NET platform. The shows range from introductory information to hardcore geekiness.
Localization in Blazor UI The Telerik UI for Blazor components can now be localized with messages (texts) translated into any language.


The Student Organization for Cognitive Science (SOCS) is a student organization representing students interested in Cognitive Science. We sponsor many activities throughout the year to increase awareness about Cognitive Science and provide an outlet for cogsci students to meet each other and interact. We host many events including weekly discussion meetings and film/discussions where we show a popular movie related to cog. sci. accompanied by a discussion lead by an IU faculty member. As our membership grows we plan to host larger events including guest lectures, forums, and collaborations with other departments and student organizations with interests overlapping with Cognitive Science. Please visit our events page to find a specific list of upcoming events. If you are an IU student who is interested in becoming a member of SOCS, please subscribe to our email list (if you haven't already done so). If you have any questions or would like more information, please contact SOCS or get in touch with one of the officers.
<EMAIL_ADDRESS>JOIN THE COGNITIVE SCIENCE SOCIETY!
Students get a highly discounted membership to the largest international organization for cognitive science. Just $45 per year gets you a subscription to the journal (edited by our own Dr. Robert Goldstone), reduced registration fees at the yearly conference, and much more...
http://www.cognitivesciencesociety.org/contact.html
If you would like to be added to the SOCS mailing list, send an e-mail to<EMAIL_ADDRESS>with nothing in the subject, and "subscribe iusocs_members" in the body.
We have created a message board, for people to toss around any sorts of thoughts they might have- if you have ideas for SOCS events, cognitive science quandries, or want to get philisophical, this is the place to do it! http://www.creationcenter.com/boards/iusocs/
SOCS OFFICERS:
Ben Ashpole<EMAIL_ADDRESS>(Discussion / Events Coordinator)
Ben Motz<EMAIL_ADDRESS>(Webtech)
Jessica Roland<EMAIL_ADDRESS>(Events Coordinator)
Darcy Lemon<EMAIL_ADDRESS>(Publicity Coordinator)
Katy Todryk<EMAIL_ADDRESS>(Secretary)
Drew Finke<EMAIL_ADDRESS>(Events Coordinator)
Picture gallery:
Here's the gang at a farewell party for our outgoing advisor, Melinda Stephan, and our incoming advisor, Kim McBride. (49kb)
Website written by Ben Motz


Version 4.18¶
Release date: 2020-02-06
This release contains a number of bug fixes and new features since the release of pgAdmin4 4.17.
New features¶
Issue #2554 - Added support for a multi-level partitioned table.
Issue #3452 - Added a Schema Diff tool to compare two schemas and generate a diff script.
Issue #4762 - Allow screen-reader to read label & description of non-textable elements.
Issue #4763 - Allow screen-reader to identify the alert errors.
Issue #4770 - Added labels and titles after parsing and validating all the pgAdmin4 web pages for accessibility.
Issue #4993 - Set input controls as read-only instead of disabled will allow tab navigation in the properties tab and also allow screen readers to read it.
Housekeeping¶
Issue #5049 - Improve code coverage and API test cases for the CAST module.
Issue #5050 - Improve code coverage and API test cases for the LANGUAGE module.
Issue #5071 - Improve the test framework to run for multiple classes defined in a single file.
Issue #5072 - Updated wcDocker package which includes aria-label accessibility improvements.
Issue #5096 - Replace node-sass with sass for SCSS compilation.
Bug fixes¶
Issue #3812 - Ensure that path file name should not disappear when changing ext from the dropdown in file explorer dialog.
Issue #4410 - Fixed an issue while editing char[] or character varying[] column from View/Edit data throwing an error.
Issue #4511 - Fixed an issue where Grant wizard unable to handle multiple objects when the query string parameter exceeds its limit.
Issue #4601 - Added tab navigation on close buttons for all the panels and create/properties dialog.
Issue #4827 - Fix column resizable issue in the file explorer dialog.
Issue #5000 - Logout the pgAdmin session when no user activity of mouse move, click or keypress.
Issue #5025 - Fix an issue where setting STORAGE_DIR to empty should show all the volumes on Windows in server mode.
Issue #5065 - Updated the incorrect icon used for the cast node on refresh.
Issue #5066 - Fix an issue where refreshing a package results in the change in the object completely.
Issue #5074 - Fix an issue where select, insert and update scripts on tables throwing an error.
Issue #5076 - Ensure Postfix starts in the container, now it runs as non-root by default.
Issue #5116 - Fixed an issue where Save Password control disappears after clicking on it while creating a server.


{% extends "layout.html" %} {% block page_title %} Apprenticeships {% endblock %} {% block content %} {% include "includes/_authenticated-navigation.html" %} Finance Transaction history Debit detail Confirm organisation Organisation name Red & White Holdings Ltd Companies House number 234234342 Is this the correct organisation? Yes, continue No, search again {% endblock %}


Visit the official government website for more information Click Here
The Aam Aadmi Bima Yojana is a security scheme that provides benefits to low income individuals in case of death or disability. The scheme is targeted at people working in 48 specific vocations like carpentry, handloom weaving, fishing, cobblers, auto drivers etc. For a premium of Rs. 300 per year, the scheme promises an assured sum of Rs. 30,000 after natural death, and Rs. 75,000 in case of accidental death of the policyholder. Only an earning member or head of the family can be insured under this scheme.The death or disability claims which are under this scheme are supposed to be settled by the P&GS Unit of LIC. They make a direct payment to the beneficiaries through NEFT. In the case that there isn't a NEFT facility available, the money for the claim is directly transferred to the bank account of beneficiaries. This would also require prior approval from competent authority, the A/C payee cheque or claim can be paid by any other mode as decided by LIC.


|
Old Name |
Meaning |
New Name |
|
Mishael |
||
|
Azariah |
The Babylonians took the names that these young men’s parents had given them to honor God and replaced them with names that honored the idols worshipped in Babylon. Some of the changes even deliberately mocked their original names and the God they had been raised to worship. For example, Mishael, which meant “Who Is Like Yahweh?” became Meshach, “Who Is Like Aku?”
The challenges to their integrity and faithfulness to God were immediate upon arrival in Babylon. Not only were they renamed; their first meal called their beliefs into question. In Day 1 we saw that in Babylon they were immediately confronted with the choice of whether or not to eat food sacrificed to idols, a form of idol worship.
We may think, What’s the big deal? It’s just a plate of food! Temptation often starts small. Think of Eve and Adam and a single piece of fruit. No big deal, right?  These young men were able to withstand the temptation to gorge themselves on delicious food because they knew it would betray the God they loved.
Read the following Scriptures. What does each say about what we do in secret, even if no one knows but God and us?
Numbers 32:23
Luke 8:16-17
Matthew 6:6, 18
If eating food that had been on the altar of idols seemed like a small thing, Hananiah, Mishael, and Azariah were given bigger challenges soon enough. They faced a decision about whether to bow down to the ninety-foot-high golden idol statue built by King Nebuchadnezzar. They must have stood out, quite literally, as the crowd around them bowed, and they were the sole people left standing in the presence of the huge idol.


Some things don't change - what makes a good web appication
We just need to keep them in mind.
Posted by Stephan H Wissel on 31 May 2012 | Comments (1) | categories: Software
Usability - Productivity - Business - The web - Singapore & Twins
Posted by Stephan H Wissel on 31 May 2012 | Comments (1) | categories: Software
Posted by Stephan H Wissel on 30 May 2012 | Comments (0) | categories: Technology
Posted by Stephan H Wissel on 24 May 2012 | Comments (0) | categories: SocialBusiness
Posted by Stephan H Wissel on 24 May 2012 | Comments (0) | categories: Software
<IP_ADDRESS>:8888
. Note: you need the real IP in the Android phone or emulator. The TCPMon screen then nicely shows the outgoing requests and incoming responses:tools/android
from the install directory to download and install the various versions of the Android OS Emulations from 1.0 all the way to 4.0.3. In the Tools menu you can manage your AVD (Android Virtual Devices) and configure different images. The emulator comes with the option of snapshots, quickstart, cold boot etc.android-sdk-linux/tools/emulator -avd MyPhone -http-proxy <IP_ADDRESS>:8888
and android-sdk-linux/tools/emulator -avd IcecreamPhone -http-proxy <IP_ADDRESS>:8888
resulting inPosted by Stephan H Wissel on 13 May 2012 | Comments (0) | categories: Show-N-Tell Thursday
Posted by Stephan H Wissel on 10 May 2012 | Comments (0) | categories: Lotus
Posted by Stephan H Wissel on 10 May 2012 | Comments (0) | categories: After hours
Posted by Stephan H Wissel on 09 May 2012 | Comments (0) | categories: Business


Copyright © 2014 W3C® (MIT, ERCIM, Keio, Beihang), All Rights Reserved. W3C liability, trademark and document use rules apply.
This draft contains the features of CSS level 3 relating to list styling. It includes and extends the functionality of CSS level 2 [CSS21]. The main extensions compared to level 2 are a pseudo-element representing the list marker, and a method for authors to define their own list-styles. CSS is a language for describing the rendering of structured documents (such as HTML and XML) on screen, on paper, in speech, etc.
This section describes the status of this document at the time of its publication. Other documents may supersede this document. A list of current W3C publications and the latest revision of this technical report can be found in the W3C technical reports index at http://www.w3.org/TR/.
Publication as a Working Draft does not imply endorsement by the W3C Membership. This is a draft document and may be updated, replaced or obsoleted by other documents at any time. It is inappropriate to cite this document as other than work in progress.
The (archived) public mailing list<EMAIL_ADDRESS>(see instructions) is preferred for discussion of this specification. When sending e-mail, please put the text “css-lists” in the subject, preferably like this: “[css-lists] …summary of comment…”
This document was produced by the CSS Working Group (part of the Style Activity).
This document was produced by a group operating under the 5 February 2004 W3C Patent Policy. W3C maintains a public list of any patent disclosures made in connection with the deliverables of the group; that page also includes instructions for disclosing a patent. An individual who has actual knowledge of a patent which the individual believes contains Essential Claim(s) must disclose the information in accordance with section 6 of the W3C Patent Policy.
This draft retains only a part of the features of the previous draft (24 May 2011). The rest has been separated into two other specifications: CSS Counter Styles Level 3 and Predefined Counter Styles.
For an overview of what is new compared to CSS level 2, see the Changes section.
This is an early-stage working draft. None of its contents should be considered suitable for implementation at this point. Please cross-check against CSS 2.1 before implementing anything in this specification.
This specification defines the ::marker pseudo-element, the list-item and inline-list-item display values that generate markers, and several properties controlling the placement and styling of markers.
It also defines counters, which are special numerical objects often used to generate the default contents of markers.

This is the first item.

This is the second item.

This is the third item.

It should produce something like this:
(i) This is the first item. (ii) This is the second item. (iii) This is the third item.
Note: Note that this example is far more verbose than is usually needed in HTML, as the UA default style sheet takes care of most of the necessary styling.
With descendant selectors and child selectors, it’s possible to specify different marker types depending on the depth of embedded lists.
A future release of this module will probably include ways to render tree lists.
A list item is any element with its display property set to list-item or inline-list-item. List items generate ::marker pseudo-elements; no other elements do.
Additionally, list items automatically increment the special list-item counter. Unless the counter-increment property manually specifies a different increment for the list-item counter, it must be incremented by 1 on every list item, at the same time that counters are normally incremented. (This has no effect on the values of the counter-* properties.)
| Name: | display |
|---|---|
| New values: | inline-list-item |
The inline-list-item display value makes the element a list item, with the effects described above. Additionally, the outside value of list-style-position computes to inside on this element. Otherwise, this display value is treated identically to inline.
Note: This display value is silly, and only necessary because we haven’t yet defined display to be split into subproperties. When that happens, "being a list item" will just be a property value that can apply to block, inline, and other elements.
The contents of a ::marker pseudo-element can be generated automatically, rather than being specified explicitly with content. The list-style-image and list-style-type properties control how these contents are generated.
| Name: | list-style-image |
|---|---|
| Value: | <image> | none |
| Initial: | none |
| Applies to: | list items |
| Inherited: | yes |
| Media: | visual |
| Computed value: | computed value fo the <image>, or none |
| Percentages: | n/a |
The list-style-image property specifies an image that will be used as the list marker’s default contents. The values are defined as follows:
<image>
is not an invalid image,
the image is the default contents of the list item’s marker.
Otherwise, the default contents are given by list-style-type instead.
li { list-style-image: url("http://www.example.com/ellipse.png") }
| Name: | list-style-type |
|---|---|
| Value: | <counter-style> | <string> | none |
| Initial: | disc |
| Applies to: | list items |
| Inherited: | yes |
| Media: | visual |
| Computed value: | specified value |
| Percentages: | n/a |
When the value of list-style-image is none or an invalid image, the list-style-type property is used to construct the default contents of a list item’s marker; otherwise, list-style-type is ignored. The values are defined as follows:
The following examples illustrate how to set markers to various values:
ul { list-style-type: "★"; } /* Sets the marker to a "star" character */ p.note { display: list-item; list-style-type: "Note: "; list-style-position: inside; } /* Gives note paragraphs a marker consisting of the string "Note: " */ ol { list-style-type: upper-roman; } /* Sets all ordered lists to use the upper-roman counter-style (defined in the Counter Styles specification [[CSS-COUNTER-STYLES]]) */ ul { list-style-type: symbols(repeating '○' '●'); } /* Sets all unordered list items to alternate between empty and filled circles for their markers. */ ul { list-style-type: none; } /* Suppresses the marker entirely, unless list-style-image is specified with a valid image, or the marker’s contents are set explicitly via the 'content' property. */
| Name: | list-style-position |
|---|---|
| Value: | inside | outside |
| Initial: | outside |
| Applies to: | list items |
| Inherited: | yes |
| Media: | visual |
| Computed value: | specified value (but see prose) |
| Percentages: | n/a |
This property helps control the position of the ::marker pseudo-element in the list item. The values are defined as follows:
If the list item is display: inline-list-item, this value computes to inside.
Note: Note that a marker is only generated if the used value of the content property for the ::marker pseudo-element is not none.

first "inside" list item comes first

second "inside" list item comes first

first "outside" list item comes first

second "outside" list item comes first

The above example may be formatted as:
* first "inside" list item comes first * second "inside" list item comes second ======================== * first "outside" list item comes first * second "outside" list item comes second
| Name: | list-style |
|---|---|
| Value: | <‘list-style-type’> || <‘list-style-position’> || <‘list-style-image’> |
| Initial: | see individual properties |
| Applies to: | list items |
| Inherited: | see individual properties |
| Media: | visual |
| Computed value: | see individual properties |
| Percentages: | see individual properties |
The list-style property is a shorthand notation for setting the three properties list-style-type, list-style-image, and list-style-position at the same place in the style sheet.
UL { list-style: upper-roman inside } /* Any UL */ UL UL { list-style: circle outside } /* Any UL child of a UL */
Using a value of none in the shorthand is potentially ambiguous, as none is a valid value for both list-style-image and list-style-type. To resolve this ambiguity, a value of none in the shorthand must be applied to whichever of the two properties aren’t otherwise set by the shorthand.
list-style: none disc; /* Sets the image to "none" and the type to "disc". */ list-style: none url(bullet.png); /* Sets the image to "url(bullet.png)" and the type to "none". */ list-style: none; /* Sets both image and type to "none". */ list-style: none disc url(bullet.png); /* Syntax error */
ol.alpha li { list-style: lower-alpha; } ul li { list-style: disc; }
The above won’t work as expected. If you nest a ul into an ol class=alpha, the first rule’s specificity will make the ul’s list items use the lower-alpha style.
ol.alpha > li { list-style: lower-alpha; } ul > li { list-style: disc; }
These work as intended.
ol.alpha { list-style: lower-alpha; } ul { list-style: disc; }
These are even better, since inheritance will transfer the list-style value to the list items.
This specification defines a new type of pseudo-element, the ::marker pseudo-element, which is generated by list items to represent the item’s marker (the bullet or number identifying each item).
Like ::before and ::after, the ::marker pseudo-element can be styled with the full range of CSS properties and values, exactly like a real element. Markers are placed at the beginning of their originating element’s content, before the ::before pseudo-element (if it exists). ::marker pseudo-elements are inline by default, though certain values for list-style-position on the list item can make the marker box positioned, which can have an effect on the computed value of display.
The ::marker pseudo-element is only created on list items. On any other element, the ::marker pseudo-element’s content property must compute to none, which suppresses its creation.

This is the first item.

This is the second item.

This is the third item.

should render something like this:
(1) This is the first item. (2) This is the second item. (3) This is the third item.

This is the first paragraph in this document.

This is a very short document.

This is the end.

It should render something like this:
This is the first paragraph in this document. Note 1: This is a very short document. This is the end.

This is a long preceding paragraph ...

This is the first item.

This is the second item.

This is the third item.

This is a long following paragraph ...

The preceding document should render something like this:
This is a long preceding paragraph ... i. This is the first item. ii. This is the second item. iii. This is the third item. This is a long following paragraph ...
Previously the only way to style a marker was through inheritance; one had to put the desired marker styling on the list item, and then revert that on a wrapper element around the list item’s actual contents. Non-inherited properties like margin couldn’t be adjusted at all on the marker.
The ::marker pseudo-element’s content property is set according to its default contents, which are defined by the list-style-image and list-style-type properties:
<counter-prefix> counter(list-item, <counter-style>) <counter-suffix>
,
where <counter-prefix> and <counter-suffix> are the values of the @counter-style/prefix and @counter-style/suffix descriptors for the counter style.
If the computed value of content was an <image>, and it ends up resolving to an invalid image, the used value of the content property is as above, but with the default contents determined solely by list-style-type.
li { display: list-item; list-style-type: decimal /* initial value */; } li::marker { content: normal /* initial value */; }
And the following document fragment:

List Item

The computed value of the content property on the ::marker pseudo-element of the li is:
counter(list-item, decimal) "."
This section is not ready for implementation. It is an unreviewed rough draft that hasn’t even been properly checked for Web-compatibility. Feel free to send feedback, but DON’T USE THIS PART OF THE SPEC.
This section introduces a new positioning scheme, designed to model the way in which list-style-position:outside list markers were traditionally positioned in CSS 2.1. Outside list markers now have their positioning defined in terms of this new value.
The new positioning scheme defined in this section can be used on all elements, not just ::marker pseudo-elements. For example, this can be used to position explicit elements serving as markers in a legal document, so that the list item has a marker whose value is guaranteed to be correct regardless of whether the CSS is applied (often a requirement in legal documents), but which is positioned like a native CSS marker.
| Name: | position |
|---|---|
| New values: | marker |
| Computed value: | see prose, otherwise same as normal |
The marker value for position depends on the element it is set on having a list item ancestor. If the specified value of position is marker and the element does not have a list item ancestor, position must compute to relative on the element. An element with position:marker counts as absolutely positioned.
To calculate the marker’s position, we must first define a few terms:
Otherwise, if the ancestor list item has marker-side:list-container and has a parent element, the marker positioning reference element is the ancestor list item’s parent.
Otherwise, the marker positioning reference element is the ancestor list item.
The marker’s position in the ancestor list item’s block axis is calculated according to the normal flow.
The marker’s position in the ancestor list item’s inline axis must be set such that the marker positioning edge is flush with the list item positioning edge.
Note: The purpose of this somewhat convoluted definition is to position the marker flush against its list item, and then when "marker-side:list-container", keep all the markers for a given list on the same side of their list items even in mixed-direction text, so that authors can specify padding on only one side of the list container and still ensure their markers are visible. And on top of all that, do something sane in the face of potentially differing writing-modes on the marker, list item, and container.
All elements or pseudo-elements with position:marker that share a common ancestor list item are known as markers associated with that list item.
The top, right, bottom, and left properties specify offsets relative to the top, right, bottom, and left edges (respectively) of the element itself, similar to how relative positioning works.

 (a) Definitions.— For purposes of this section—

(1) the term “agency” means agency as...
(2) the term “individual” means a citizen...

 (b) Conditions of Disclosure.— No agency shall disclose...

(1) to those officers and employees of the agency...
(2) required under section 552 of this title;

The preceding document should render something like this:
(a) Definitions.— For purposes of this section—(1) the term “agency” means agency as... (2) the term “individual” means a citizen... (b) Conditions of Disclosure.— No agency shall disclose... (1) to those officers and employees of the agency... (2) required under section 552 of this title;
Importantly, even if the stylesheet is unavailable, the list markers will appear the same (though they will be positioned slightly differently), so other documents can refer to those list markers and be confident that the reference will always be resolvable.
By default, elements or ::marker pseudo-elements with position:marker position themselves according to their list item’s directionality. However, if the list item is grouped with several other list items which may have different directionality (for example, multiple
s with different "dir" attributes in an
 in HTML), it is sometimes more useful to have all the markers line up on one side, so the author can specify a single "gutter" on that side and be assured that all the markers will lie in that gutter and be visible. The marker-side property defined in this section allows an author to control this, switching list items to positioning their markers based off the list container’s directionality instead.
| Name: | marker-side |
|---|---|
| Value: | list-item | list-container |
| Initial: | list-item |
| Applies to: | list items |
| Inherited: | yes |
| Media: | visual |
| Computed value: | specified value |
| Percentages: | n/a |

english one
OWT WERBEH
english three
RUOF WERBEH

| list-item | list-container |
|---|---|
* english one OWT WERBEH * * english three RUOF WERBEH * |
* english one * OWT WERBEH * english three * RUOF WERBEH |
A counter is a special concept used, among other things, to automatically number list items in CSS. Every element has a collection of zero or more counters, which are inherited through the document tree in a way similar to inherited property values. They are created and manipulated with the counter-increment, counter-set and counter-reset properties, and used with the counter() and counters() functions. Counters have a name, an integer value, a creator element, and possibly another counter nested inside themselves.
| Name: | counter-reset |
|---|---|
| Value: | [ <custom-ident> <integer>? ]+ | none |
| Initial: | none |
| Applies to: | all elements |
| Inherited: | no |
| Media: | all |
| Computed value: | specified value |
| Percentages: | n/a |
The counter-reset property creates new counters on an element. Its values are defined as follows:
If an <integer> is provided after an <custom-ident>, the starting value of the new counter is that integer. Otherwise, the starting value of the new counter is 0.
Implementations may have implementation-specific limits on the maximum or minimum value of a counter. If an increment would push the counter’s value beyond these limits, the increment must be ignored, and the counter’s value remain unchanged.
| Name: | counter-set |
|---|---|
| Value: | [ <custom-ident> <integer>? ]+ | none |
| Initial: | none |
| Applies to: | all elements |
| Inherited: | no |
| Media: | all |
| Computed value: | specified value |
| Percentages: | n/a |
| Name: | counter-increment |
|---|---|
| Value: | [ <custom-ident> <integer>? ]+ | none |
| Initial: | none |
| Applies to: | all elements |
| Inherited: | no |
| Media: | all |
| Computed value: | specified value |
| Percentages: | n/a |
The counter-set and counter-increment properties manipulate the value of existing counters. They only create new counters if there is no counter of the given name on the element yet. Their values are defined as follows:
If an <integer> is provided after an <custom-ident>, it sets the innermost counter of the given name’s value to that integer (for counter-set) or increments the value of the innermost counter of the given name by that integer (for counter-increment). Otherwise, the innermost counter of the given name’s value is set to 0 (for counter-set) or incremented by 1 (for counter-increment).
This example shows a way to number chapters and sections with "Chapter 1", "1.1", "1.2", etc.
h1::before { content: "Chapter " counter(chapter) ". "; counter-increment: chapter; /* Add 1 to chapter */ counter-reset: section; /* Set section to 0 */ } h2::before { content: counter(chapter) "." counter(section) " "; counter-increment: section; }
Inheriting counters must be done before resetting counters, which must be done before setting counters, which must be done before incrementing counters, which must be done before using counters (for example, in the content property).
h1 { counter-reset: section -1 } h1 { counter-reset: imagenum 99 }
will only reset imagenum. To reset both counters, they have to be specified together:
H1 { counter-reset: section -1 imagenum 99 }
The same principles apply to the counter-set and counter-increment properties.
Every element has a (possibly empty) set of counters. Like many other CSS values, an element can inherit counters from another element. However, unlike other CSS values, the method that counters are inherited is somewhat complex. A counter and its value are inherited separately, possibly from different elements.
If an element has a previous sibling, it must inherit all of the sibling’s counters. Otherwise, if the element has a parent, it must inherit all of the parent’s counters. Otherwise, the element must have an empty set of counters.
The element then inherits counter values from the immediately preceding element in document order. This must be done by examining the set of counters that the immediately preceding element has, and, for every counter that exists in both the element’s set and the preceding element’s set, giving the element’s counter the same value. (If an element is the first element in the document, and thus has no immediately preceding element, it also doesn’t have a parent or a previous sibling, and thus no counters to begin with.)

 foo
bar

 baz

Recall that "in document order" turns a document tree into an ordered list, where an element comes before its children, and its children come before its next sibling. In other words, for a language like HTML, its the order in which the parser encounters start tags as it reads the document.
In here, the

element establishes a new counter named "example",
and sets its value to 0.
The "foo" element, being the first child of the

,
inherits this counter.
Its parent is also its immediately preceding element in document order,
so it inherits the value 0 with it,
and then immediately increments the value to 1.
The same happens with the "bar" element. It inherits the "example" counter from "foo", and inherits the value 1 from it as well and increments it to 2.
However, the "baz" element is a bit different. It inherits the "example" counter from the "foo" element, its previous sibling. However, rather than inheriting the value 1 from "foo" along with the counter, in inherits the value 2 from "bar", the previous element in document order.
This behavior allows a single counter to be used throughout a document, continuously incrementing, without the author having to worry about the nested structure of their document.
Elements can create additional counters on themselves, which can then be passed onto siblings or children. To create a new counter, specify an element that’s creating it, a name, and a starting value. The effect depends on what other counters of that name exist on the element:
Regardless, the value of the new counter is set to the provided starting value.
Counters are "self-nesting"; creating a new counter in an element which already has a counter with the same name simply creates a new counter of the same name, nested inside the existing counter. This is important for situations like lists in HTML, where lists can be nested inside lists to arbitrary depth. It would be impossible to define uniquely named counters for each level. As explained in a later section, the counter() function only uses the innermost counter of a given name on the element, but the counters() function uses all counters of a given name that contain the element.
ol { counter-reset: item } li { display: block } li::before { content: counter(item) ". "; counter-increment: item }
In this example, an ol will create a counter, and all children of the ol will refer to that counter.
If we denote the nth instance of the "item" counter by item[n], then the following HTML fragment will use the indicated counters. (We assume the style sheet as given in the example above).

item[0] is created, set to 0

item[0] is incremented to 1

item[0] is incremented to 2

item[1] is created, set to 0, nested in item[0]

item[1] is incremented to 1

item[1] is incremented to 2

item[1] is incremented to 3

item[2] is created, set to 0, nested in item[1]

item[2] is incremented to 1

item[1] is incremented to 4

item[3] is created, set to 0, nested in item[1]

item[3] is incremented to 1

item[1] is incremented to 5

item[0] is incremented to 3

item[0] is incremented to 4

item[4] is created, set to 0

item[4] is incremented to 1

item[4] is incremented to 2An element that does not generate a box (for example, an element with display set to none, or a pseudo-element with content set to none) cannot set, reset, or increment a counter. The counter properties are still valid on such an element, but they must have no effect.
h2 { counter-increment: count2; } h2.secret { display: none; }
Other methods of "hiding" elements, such as setting visibility to hidden, still cause the element to generate a box, and so do not apply here.
Counters have no visible effect by themselves, but their values can be used with the counter() and counters() functions. This happens automatically in the default contents of ::marker pseudo-elements, but can be used by an author anywhere that accepts a string. Their syntax is:
counter() = counter( <ident> [, [ <counter-style> | none ] ]? ) counters() = counters( <ident>, <string> [, [ <counter-style> | none ] ]? )
For both functions, the first argument represents the name of a counter, and if the last argument is omitted it defaults to decimal.
A counter() represents a <string>, obtained as follows:
H1::before { content: counter(chno, upper-latin) ". " } /* Generates headings like "A. A History of Discontent" */ H2::before { content: counter(section, upper-roman) " - " } /* Generates headings like "II - The Discontent Part" */ BLOCKQUOTE::after { content: " [" counter(bq, decimal) "]" } /* Generates blockquotes that end like "... [3]" */ DIV.note::before { content: counter(notecntr, disc) " " } /* Simply generates a bullet before every div.note */ P::before { content: counter(p, none) } /* inserts nothing */
A counters() represents a <string>, obtained as follows:

one

two

nested one

nested two

three

The preceding document should render something like this:
(1) one (2) two (2.1) nested one (2.2) nested two (3) three

First H1
 ...
First H2 in H1
 ...
Second H2 in H1
 ...
First H3 in H2
 ...
Second H1
 ...
First H2 in H1
 ...
The preceding document should render something like this:
A First H1 ... A.1 First H2 in H1 ... A.2 Second H2 in H1 ... A.2.i First H3 in H2 ... B Second H1 ... B.1 First H2 in H1 ...
This section is informative, not normative. HTML itself defines the actual default properties that apply to HTML lists.
/* Set up list items */ li { display: list-item; /* counter-increment: list-item; (implied by display: list-item) */ } /* Set up ol and ul so that they reset the list-item counter */ ol, ul { counter-reset: list-item; } /* Default list style types for ordered lists */ ol { list-style-type: decimal; } /* Default list style types for unordered lists up to 3 deep */ ul { list-style-type: disc; } ul ul { list-style-type: square; } ul ul ul { list-style-type: circle; } /* Alternately, if Values & Units Level 3 is supported, replace the above three lines with: */ ul { list-style-type: disc; } ul ul { list-style-type: cycle(disc, square, circle); } /* The type attribute on ol and ul elements */ ul[type="disc"] { list-style-type: disc; } ul[type="circle"] { list-style-type: circle; } ul[type="square"] { list-style-type: square; } ol[type="1"] { list-style-type: decimal; } ol[type="a"] { list-style-type: lower-alpha; } ol[type="A"] { list-style-type: upper-alpha; } ol[type="i"] { list-style-type: lower-roman; } ol[type="I"] { list-style-type: upper-roman; } /* The start attribute on ol elements */ ol[start] { counter-reset: list-item attr(start integer, 1); counter-increment: list-item -1; } /* The value attribute on li elements */ li[value] { counter-set: list-item attr(value integer, 1); counter-increment: none; /* Turn off default increase */ } /* Handling reversed lists */ ol[reversed] { counter-reset: list-item attr(start integer, **magic**); /* Where **magic** is the number of child
 elements. */ counter-increment: list-item -1; } ol[reversed] > li { counter-increment: list-item -1; } /* Box Model Rules */ ol, ul { display: block; margin: 1em 0; marker-side: list-container; } ol:dir(ltr), ul:dir(ltr) { padding-left: 40px; } ol:dir(rtl), ul:dir(rtl) { padding-right: 40px; } ol ol, ol ul, ul ul, ul ol { margin-top: 0; margin-bottom: 0; } li { text-align: match-parent; } li::marker { display: inline; text-align: end; unicode-bidi: isolate; /* 'position' computes to "static" or "marker" depending on list-style-position */ } li:dir(ltr)::marker { margin-right: 1em; } li:dir(rtl)::marker { margin-left: 1em; }
The following people and documentation they wrote were very useful for defining the numbering systems: Alexander Savenkov, Arron Eicholz, Aryeh Gregor, Frank Tang, Jonathan Rosenne, Karl Ove Hufthammer, Musheg Arakelyan, Nariné Renard Karapetyan, Randall Bart, Richard Ishida, Simon Montagu (Mozilla<EMAIL_ADDRESS>As described in the introduction section, there are significant changes in this module when compared to CSS2.1.
Conformance requirements are expressed with a combination of descriptive assertions and RFC 2119 terminology. The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in the normative parts of this document are to be interpreted as described in RFC 2119. However, for readability, these words do not appear in all uppercase letters in this specification.
All of the text of this specification is normative except sections explicitly marked as non-normative, examples, and notes. [RFC2119]
Examples in this specification are introduced with the words "for example"
or are set apart from the normative text with class="example"
,
like this:
This is an example of an informative example.
Informative notes begin with the word "Note" and are set apart from the
normative text with class="note"
, like this:
Note, this is an informative note.
Conformance to this specification is defined for three conformance classes:
A style sheet is conformant to this specification if all of its statements that use syntax defined in this module are valid according to the generic CSS grammar and the individual grammars of each feature defined in this module.
A renderer is conformant to this specification if, in addition to interpreting the style sheet as defined by the appropriate specifications, it supports all the features defined by this specification by parsing them correctly and rendering the document accordingly. However, the inability of a UA to correctly render a document due to limitations of the device does not make the UA non-conformant. (For example, a UA is not required to render color on a monochrome monitor.)
An authoring tool is conformant to this specification if it writes style sheets that are syntactically correct according to the generic CSS grammar and the individual grammars of each feature in this module, and meet all other conformance requirements of style sheets as described in this module.
So that authors can exploit the forward-compatible parsing rules to assign fallback values, CSS renderers must treat as invalid (and ignore as appropriate) any at-rules, properties, property values, keywords, and other syntactic constructs for which they have no usable level of support. In particular, user agents must not selectively ignore unsupported component values and honor supported values in a single multi-value property declaration: if any value is considered invalid (as unsupported values must be), CSS requires that the entire declaration be ignored.
To avoid clashes with future CSS features, the CSS2.1 specification reserves a prefixed syntax for proprietary and experimental extensions to CSS.
Prior to a specification reaching the Candidate Recommendation stage in the W3C process, all implementations of a CSS feature are considered experimental. The CSS Working Group recommends that implementations use a vendor-prefixed syntax for such features, including those in W3C Working Drafts. This avoids incompatibilities with future changes in the draft.
Once a specification reaches the Candidate Recommendation stage, non-experimental implementations are possible, and implementors should release an unprefixed implementation of any CR-level feature they can demonstrate to be correctly implemented according to spec.
To establish and maintain the interoperability of CSS across implementations, the CSS Working Group requests that non-experimental CSS renderers submit an implementation report (and, if necessary, the testcases used for that implementation report) to the W3C before releasing an unprefixed implementation of any CSS features. Testcases submitted to W3C are subject to review and correction by the CSS Working Group.
Further information on submitting testcases and implementation reports can be found from on the CSS Working Group’s website at http://www.w3.org/Style/CSS/Test/. Questions should be directed to the<EMAIL_ADDRESS>mailing list.
| Name | Value | Initial | Applies to | Inh. | %ages | Media | Computed value |
|---|---|---|---|---|---|---|---|
| list-style-image | <image> | none | none | list items | yes | n/a | visual | computed value fo the <image>, or none |
| list-style-type | <counter-style> | <string> | none | disc | list items | yes | n/a | visual | specified value |
| list-style-position | inside | outside | outside | list items | yes | n/a | visual | specified value (but see prose) |
| list-style | <‘list-style-type’> || <‘list-style-position’> || <‘list-style-image’> | see individual properties | list items | see individual properties | see individual properties | visual | see individual properties |
| marker-side | list-item | list-container | list-item | list items | yes | n/a | visual | specified value |
| counter-reset | [ <custom-ident> <integer>? ]+ | none | none | all elements | no | n/a | all | specified value |
| counter-set | [ <custom-ident> <integer>? ]+ | none | none | all elements | no | n/a | all | specified value |
| counter-increment | [ <custom-ident> <integer>? ]+ | none | none | all elements | no | n/a | all | specified value |


{% extends "empty_base.html" %} {% load staticfiles tournament_extras %} {% block title %}Lichess Leagues{% endblock %} {% block body %}
{{ l.description }}
This site is currently being set up. Please check back later.


public class HabitManager
extends java.lang.Object
Created by fraserbulbuc on 2017-10-22.
| Modifier and Type | Method and Description |
|---|---|
void |
addHabit(User user,
Habit habit)
adds habit in elastic search for user
|
void |
addHabitToServer(Habit habit)
method to add a habit to the server
!!!!!Must be called Async!!!!!
|
void |
deleteHabitFromServer(Habit habit)
Method to delete a Habit from the server
*
|
int |
editHabit(Habit oldHabit,
Habit newHabit)
Update the contents of a habit in storage with new information
|
void |
findHabits(AsyncResultHandler<Habit> handler,
User forUser) |
java.util.ArrayList<Habit> |
getHabits()
Relays habit to be added to the habit manager
|
static HabitManager |
getInstance()
Public access to singleton instance
|
boolean |
hasHabit(User user,
Habit habit)
Checks if the user has a particular habit
|
void |
removeHabit(User user,
Habit habit)
removes habit from elastic search for user
|
public static HabitManager getInstance()
public void addHabit(User user, Habit habit)
user
- user who has the habithabit
- habit to be addedpublic void removeHabit(User user, Habit habit)
user
- user who has the habithabit
- habit to be removedpublic int editHabit(Habit oldHabit, Habit newHabit)
oldHabit
- the habit to be updatednewHabit
- the new habit data to replace the old dataHabit
public java.util.ArrayList<Habit> getHabits()
Habit
public void findHabits(AsyncResultHandler<Habit> handler, User forUser)
public boolean hasHabit(User user, Habit habit)
habit
- the habit to look foruser
- the user whose habits should be checkedpublic void addHabitToServer(Habit habit) throws java.lang.Exception
habit
- the habit to add to the server storagejava.lang.Exception
ServerCommandManager
,
Habit


CLOACK APP
BACK
Good morning
Good afternoon
Good eveninging
The hour of start
{{currentTime}}
Start Cloack Timer
The current hour is
{{timeString}}


--- date: 2011-10-18T00:00:00Z published: true title: The Fraud At The Heart Of Student Lending Exposed - The One Sentence Everyone Should Read | ZeroHedge url: /2011/10/18/the-fraud-at-the-heart-of-student-lending-exposed-the-one-sentence-everyone-should-read-zerohedge/ ---
A key reason why a preponderance of the population is fascinated with the student loan market is that as USA Today reported in a landmark piece last year, it is now bigger than ever the credit card market. And as the monthly consumer debt update from the Fed reminds us, the primary source of funding is none other than the US government. To many, this market has become the biggest credit bubble in America. Why do we make a big deal out of this? Because as Bloomberg reported last night, we now have prima facie evidence that the student loan market is not only an epic bubble, but it is also the next subprime!


SP_signal()
#include <sicstus/sicstus.h> typedef void SP_SigFun (int sig, void *user_data); SP_SigFun SP_signal(int sig, SP_SigFun fun, void *user_data);
Installs a function fun
as a handler for the signal
sig
.
It will be called with sig
and user_data
as arguments.
SP_SIG_ERR
if an error occurs error. On success,
some value different from SP_SIG_ERR
.
When the OS delivers a signal sig
for which
SP_signal(sig,func,...)
has been called, SICStus will not call
func
immediately. Instead the call to func
will be delayed
until it is safe for Prolog to do so, in much the same way that functions
installed by SP_event()
are handled.
Since the signal handling function func
will not be called
immediately upon delivery of the signal to the process it only makes
sense to use SP_signal()
to handle certain asynchronous signals
such as SIGINT
, SIGUSR1
, SIGUSR2
. Other
asynchronous signals handled specially by the OS, such as SIGCHLD
are not suitable for handling via SP_signal()
. Note that the
development system installs a handler for `SIGINT', and, under
Windows, `SIGBREAK', to catch keyboard interrupts. Under UNIX,
library(timeout)
currently uses SIGVTALRM
.
When func
is called it may only call other (non SICStus) C code
and SP_event()
. Note that func
will be called in the main
thread.
If fun
is one of the special constants SP_SIG_IGN
or
SP_SIG_DFL
, then one of two things happens:
sig
has already been installed with SP_signal()
, then the
SICStus OS-level signal handler is removed and replaced with,
respectively, SIG_IGN
or SIG_DFL
.
SP_signal()
, then SP_signal()
does
nothing and returns SP_SIG_ERR
.
A signal handler installed by a foreign resource should be
uninstalled in the deinit function for the foreign
resource. This is to prevent the handler in the foreign resource
from being called after the code of the foreign resource has been
unloaded (e.g. by unload_foreign_resource/1
).
Note that SP_signal()
is not suitable for installing
signal handlers for synchronous signals like SIGSEGV
.
SP_event()
, Signal Handling.


Whoops...
Sign-in to this site requires JavaScript. You are either using a browser that does not support JavaScript or has JavaScript disabled. For more information, please visit our
Help article.
Whoops...
The cookies on your web browser are not enabled. This means that some of the applications on our site will not work in your browser. For more information, please visit our
Help article.
Aol.
|
help
Sign In
Username or Email
Password
Forgot password?
Remember Me
Get a Free Username


Demo
Here is the testing process:
- bookmark this
SRT-l-Player in toolbar!
- get SRT from
shooter.cn, unzip and get txt file;
- visit
Stargate Universe S02E16 online Flash Player;
- click the bookmark, wait till loaded, paste srt txt into [SRT!], click [Play] to sync timeline, then ENJOY!
SRT sample: