|Publication number||US5933825 A|
|Application number||US 08/897,696|
|Publication date||Aug 3, 1999|
|Filing date||Jul 21, 1997|
|Priority date||Jul 21, 1997|
|Also published as||CA2297680A1, EP0996903A1, EP0996903A4, EP2278499A1, WO1999004352A1|
|Publication number||08897696, 897696, US 5933825 A, US 5933825A, US-A-5933825, US5933825 A, US5933825A|
|Inventors||Patrick McClaughry, Max McFarland, Peter McInerney, Wayne Loofburrow, Daniel Walkowski|
|Original Assignee||Apple Computer, Inc.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (11), Referenced by (110), Classifications (16), Legal Events (7)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This invention generally relates to techniques and systems for accessing objects in computers and, more particularly, to techniques and systems which efficiently arbitrate concurrent access to objects in multithreaded or multitasking computer systems.
The evolution of the computer industry is unparalleled in its rate of growth and complexity. Personal computers, for example, which began as little more than feeble calculators with limited memory, tape-driven input and monochrome displays, are now able to tackle almost any data processing task. While this meteoric increase in power was sufficient to satisfy the demands of most application programmers and end users, the corresponding increase in complexity associated with computers created an ease-of-use problem which the industry was somewhat slower in solving. Thus, designers were faced with a new challenge: to harness this computing power in a form usable by even those with relatively little computer training to smooth the transition of other industries into a computer-based information paradigm.
As a result, in the early to mid-1980's, many new I/O philosophies, such as "user friendly", "WYSIWYG" and "menu driven" came to the forefront of the industry. These concepts are particularly applicable to microcomputers, also known as personal computers, which are intended to appeal to a broad audience of computer users, including those who previously feared and mistrusted computers. An important aspect of computers which employs these concepts was, and continues to be, the interface which allows the user to input commands and data and receive results, which is commonly referred to as a graphical user interface (GUI).
One type of GUI is based on a visual metaphor which uses a monitor screen as a work surface called a "desktop" where documents are presented in relocatable regions termed "windows". The user interacts with the computer by, for example, moving objects on the desktop, choosing commands from menus and manipulating window controls, such as checkboxes and scrollbars. These objects may include, for example, files and folders which are iconically represented on the desktop and whose contents are stored by a file management system. An exemplary desktop screen is reproduced as FIG. 1.
The success of this type of interface is evident from the number of companies which have emulated the desktop environment. Even successful concepts, however, must continually be improved upon to keep pace with the rapid growth in this industry. For example, the advent of multimedia, especially CD-ROM devices, has provided vast quantities of secondary storage which have been used to provide video capabilities, e.g., live animation and video clips, as regular components of application displays. As these new capabilities are developed, the GUIs and underlying operating system software are modified or rewritten to take advantage thereof.
In the last few years, personal computers have been evolving towards multitasking, i.e., the capability to run several applications concurrently. Initial steps toward true multitasking included the capability to display several applications at once, i.e., in different windows, albeit only one application was active at a time, and to allow the user to easily switch between the windowed applications. In true multitasking environments, each application is associated with one or more threads which independently coordinate the processing for that application. This leads to the possibility that two or more threads may attempt to operate on a file system object, e.g., a file or a folder, at the same time. In certain situations, e.g. when one thread is altering data while another is reading the same data, concurrent access to file system objects is problematic.
For example, consider the hierarchical arrangement of file system objects illustrated in FIG. 2. Therein, a tree is illustrated with a root folder A having two child folders B and C, each containing a pair of files D and E and F and G, respectively. Suppose that a user wants to copy folder A to a new folder A' as illustrated and, while the copying process is ongoing, attempts to modify the contents of file E. The question then arises as to whether this latter operation should be permitted and, if so, will the contents of the copy A' include the original file E or the modified version of file E.
These types of concurrent access problems for file systems have been addressed in conventional multitasking systems. According to one solution, which has implemented as part of the WINDOWS 95 operating system, access to an object and its children is completely restricted while an operation involving the object is in progress. Thus, in the context of the example of FIG. 2, the user would not be permitted to modify (or even view) any of the objects A-G while folder A was being copied to create folder A'. However, this solution has the drawback that it may severely limit a user's access to many objects (for example if a very large copy operation is being performed), which frustrates the objectives behind multitasking. Moreover, such a complete access restriction is unwarranted for certain combinations of activities, e.g., viewing an object while copying that object or moving an object while copying that object, which can be performed in parallel.
Another solution to concurrent access of file system objects is to simply provide no access restrictions. This solution is found, for example, in the NeXT operating system and provides the user with the freedom to perform plural operations on the same object at the same time. However, completely unrestricted access to the same objects also creates certain problems. Consider again the example of FIG. 2 with unrestricted access. If the user modifies file E before that file has been copied to folder A', then folder A and folder A' will be identical at the end of the copy operation. If, however, the user modifies file E after file E has been copied then the contents of folder A and folder A' will be different. This is just one example of the uncertainty of results which manifests itself as a result of completely unrestricted multithreaded access to file system objects.
Accordingly, it would be desirable to provide techniques and systems for managing file system objects in a multithreaded enviromnent in which multiple threads can simultaneously operate on the same object whenever possible to maximize throughput and availability of objects to a user, but without causing object incoherency and inconsistent file operation results.
These and other problems of previous computer systems and methods are solved by Applicants' invention, wherein a locking scheme is provided to arbitrate threaded access to file system objects. This locking scheme has been developed to allow multiple threads simultaneous access to file system objects for certain concurrently compatible operations, while forbidding concurrently incompatible operations. According to exemplary embodiments of the present invention, separate locks are provided for hierarchical relationships between objects and the contents (e.g., data) of the objects themselves.
According to exemplary embodiments of the present invention, three read locks and three write locks are provided. A read contents lock indicates that an object is currently being read by a thread. A hierarchical read contents lock indicates that a descendant of an object is currently being read. A read children lock indicates that all of the children of a particular object are being read. A write contents lock indicates that an object is being written. A hierarchical write contents lock indicates that a descendant of a particular object is being written. A write children lock indicates that the children of an object are being written. These locks can be used in combination to determine when to allow a second thread access to an object which is currently being manipulated by a first thread. When access is denied, the user can be so notified.
The features and objects of Applicants' invention will be understood by reading this description in conjunction with the drawings, in which:
FIG. 1 is an exemplary desktop GUI illustration;
FIG. 2 illustrates a hierarchical file system object structure used to describe the operation of conventional file system access techniques as well as file system access techniques according to the present invention;
FIG. 3 is an exemplary computer system in which the present invention can be implemented;
FIG. 4 is a lock record format according to an exemplary embodiment of the present invention;
FIG. 5 is a table depicting permissible and impermissible concurrent accesses according to an exemplary embodiment of the present invention; and
FIG. 6 is a flowchart illustrating an exemplary copy operation according to the present invention;
FIGS. 7(a) and 7(b) depict exemplary file system object hierarchies used to explain lock transfer according to the present invention; and
FIG. 8 is a table depicting permissible and impermissible concurrent accesses according to another exemplary embodiment of the present invention.
The following description includes exemplary embodiments wherein locks are maintained (e.g., granted, denied, released, etc.) by an application, e.g., the Finder application in the MACINTOSH computer system, which provides an interface between the user and the file system. However, those skilled in the art will appreciate that the present invention is equally applicable in other contexts, e.g., wherein the file management system itself maintains locks and arbitrates object access. Moreover, although those skilled in the art will be familiar with the hardware components of such computer systems, exemplary components are briefly described herein to provide a thorough understanding of the manner in which the features of the invention cooperate with the components of a computer system to produce the desired results.
Referring to FIG. 3, the computer system includes a computer 10 having a variety of external peripheral devices 12 connected thereto. The computer 10 includes a central processing unit 14 and associated memory. This memory generally includes a main memory which is typically implemented in the form of a random access memory 16, a static memory that can comprise a read only memory 18, and a permanent storage device, such as a magnetic or optical disk 20. The CPU 14 communicates with each of these forms of memory through an internal bus 22. The peripheral devices 12 include a data entry device such as a keyboard 24, and a pointing or cursor control device 26 such as a mouse, trackball, pen or the like. A display device 28, such as a CRT monitor or an LCD screen, provides a visual display of the information that is being processed within the computer, for example the contents of a document or a computer-generated image. A hard copy of this information can be provided through a printer 30, or similar such device. Each of these external peripheral devices communicates with the CPU 14 by means of one or more input/output ports 32 on the computer. According to exemplary embodiments of the present invention, the computer system of FIG. 3 is adapted to handle multitasking or multithreaded operation using a combination of hardware and software which is well known to those skilled in the art.
As mentioned above, a GUI such as that illustrated in FIG. 1 may be used to allow a user to interact with the computer system of FIG. 3. For each icon viewable on the GUI, a file system object is stored in memory, e.g., one or more of devices, 16, 18 and 20. Since the computer 10 is capable of performing multiple tasks simultaneously, requests may be made to operate on one file system object at the same time. For example, suppose that a user "drags and drops" the System folder depicted in FIG. 1 onto the desktop to initiate a copy operation on that file system object and, while the copying operation is ongoing, attempts to manipulate one of the objects within the System folder.
Additionally, handling these concurrent file system object accesses is complicated by certain idiosyncracies of file system operation. For example, file system operations occur individually rather than as a transaction involving a unified set of operations as, e.g., many databases operate. Moreover, file systems typically provide no recovery from partially executed operations and are subject to periodic failures associated with, for example, contaminated memory media. Exemplary embodiments of the present invention, described below, provide techniques for arbitrating this type of concurrent file system object request in a robust manner designed to accommodate file system operations.
In order to provide a more complete understanding of the present invention, but without limiting the scope thereof, certain terminology is used throughout this specification and is defined as follows.
The term "ancestor" refers to an object that is on the path between another object and the root in a hierarchy of objects. For example, returning to FIG. 2, the ancestors of object E include folders A and B, while the ancestors of object G include folders A and C.
The term "descendant" or "child" refers to an object that is on the path from an object away from the root in a hierarchy of objects. For example, again in FIG. 2, objects D and E are descendants (children) of folders A and B, while objects F and G are descendants (children) of folders A and C.
In order to distinguish between permissible (compatible) concurrent object operations and impermissible (incompatible) concurrent object operations, the present invention uses a plurality of locks and access rules involving these locks. According to exemplary embodiments of the present invention, six different kinds of read and write locks are provided, however those skilled in the art will appreciate that the number of different kinds of locks used can be reduced or increased depending upon, for example, the number of combinations of operations to be arbitrated. From an implementation perspective these locks can, for example, be manipulated using a lock record associated with each file system object.
Lock records are maintained by the interface application (or file system), an exemplary format of which is illustrated as FIG. 4. As can be seen in FIG. 4, a lock record contains a plurality of fields associated with the various locks used in systems and techniques according to the present invention. Note that the order of the fields illustrated in FIG. 4 is merely exemplary and that these fields can be stored in any desired order within the locked record. Each of the six locks described herein has a corresponding counter or flag depending upon whether an object can acquire plural locks of the same type as will be described below. The write children (WK) lock also has associated therewith an owner ID field. This field can be used by program code to determine ownership of a particular WK lock which will enable that code to determine whether it has access to a particular object. For example, consider a command which operates as a sequence of subcommands. If the command acquires a WK lock with respect to a certain object and one of its subcommands subsequently needs a WK lock with respect to the same object, then this identifier provides a mechanism whereby the arbiter can permit the subcommand to perform its intended write operation despite the existing WK lock. These lock records can be stored in memory using any conventional data storage techniques. Typically, lock records are created when a first lock is acquired for an object and erased when a last lock record is released for that object, so as to reduce the storage associated with maintaining these records for each object.
There are three types of read locks. A Read Contents (RC) lock is required to read an object's data. For example, in order to read a file system object (e.g., copy a file within a folder to some other location), an application or thread must first acquire an RC lock for that object. This is accomplished by checking the lock record associated with that particular object to determine if an RC lock is available. If no lock record exists at all for a particular object, then the application would create a lock record for that object having an RC field value set equal to one. As seen in FIG. 4, the RC field can be formatted as a reference count field which is incremented as RC locks are acquired and decremented as RC locks are released, since there may be multiple simultaneous readers of any given object.
If a lock record does exist for this particular object, then that record is evaluated by the application to determine if the existing locks permit an RC lock to be acquired. This procedure will be described below with respect to FIG. 5. Failure to obtain an RC lock implies that the object is currently involved in an operation during which reading is undesirable, e.g., its data is being rewritten or erased, and a message to that effect can be generated on the GUI to notify the user that the desired operation is currently impermissible.
When an RC lock is acquired by the application for a particular object, a second type of read lock, referred to herein as a Hierarchy Read Contents (HRC) lock, is propagated up the hierarchy of objects from the object which has been RC locked, to the root. That is, in addition to incrementing an RC lock field in that object's lock record, the application also increments an HRC field associated with each ancestor of that object. This allows the application to quickly determine, for other access requests, whether a descendant of any particular object has an RC lock. For example, referring again to FIG. 2, if the application acquires an RC lock on file E, then both folders A and B would acquire an HRC lock. Those skilled in the art will appreciate that this feature of the present invention provides a mechanism to more quickly determine whether locks exist in the file system object hierarchy, as compared with searching down through the hierarchy to actually locate any existing RC locks. Like the RC field in the lock record, the HRC field is reference counted since multiple threads may read an object's contents simultaneously. Thus, if one thread obtains an RC lock for file D and another thread obtains an RC lock for file E, both folders A and B will have two HRC locks.
The third type of read lock is used to arbitrate concurrent access to the immediate descendants of a particular object and is referred to herein as a Read Children lock (and which is abbreviated "RK" so as to distinguish this type of lock from a Read Contents lock). Like content locking, RK locks are used by arbitration schemes according to the present invention to allow multiple threads to read an object's children simultaneously, but only allow one thread to write (e.g., add or remove) children at any one time. Unlike content locking, however, RK locks permit a thread to read an object's children while another thread is reading or writing the contents of that object. This capability allows certain system functionality, e.g., window redrawing, to be performed without delay. To accommodate simultaneous reading and writing of children, a copy of the initial state of the children can be created so that one or more threads can read the backup collection while another thread is writing to the original set of children. Like the other two types of read locks, the RK lock can be implemented as a reference count in the lock record since multiple RK locks can be associated with an object at any given time.
There are also three types of write locks according to exemplary embodiments of the present invention. For example, in order to make changes to a file system object (e.g., update contents of a file), the application must acquire a Write Contents (WC) lock for that object. This can be accomplished by evaluating the lock record (if any exists) associated with the object that is to be changed as will be described below with respect to FIG. 5. If a lock record exists for this object with a WC flag set to indicate an existing WC lock (i.e., another thread is currently writing this object), then this lock request is denied and the user can be notified. Otherwise, if no lock record currently exists for that object, or if one exists without a WC lock indication, then the WC field is set equal to a value indicating that a WC lock has been acquired, e.g., one. Unlike the RC lock, however, the WC field in the lock record may be a boolean field since only one write operation is permitted on an object at a time.
When a WC lock is acquired each of the ancestors of that object acquires a Hierarchical Write Contents (HWC) lock which indicates that a write operation is taking place on an object lower in the hierarchy. The field associated with HWC locks in a lock record is also formatted for counting since it is permissible for a write operation in one sub-branch to co-exist with a write operation in another sub-branch of the hierarchy. For example, if a WC lock is acquired for both files F and G in FIG. 2, folder C would have two HWC locks indicated in its lock record.
Analogously to read locks, the third type of write lock is the Write Children (WK) lock. In conjunction with the RK lock, the WK lock permits simultaneous writing of an object's contents and reading or writing of that object's children as will be described below with respect to FIG. 5.
Having briefly described the various types of locks used to arbitrate concurrent access to file system objects by multiple threads according to the present invention, the ways in which these locks are used by the application to permit or deny concurrent access will now be described with respect to FIG. 5. As mentioned above, for the general case where an object has no current locks, a request for any one of the six locks would be granted. Thus, the lock table in FIG. 5 depicts all of the various permutations where a lock exists for an object and another thread requests another lock for the same object. The results of the second lock request are given by the cells in FIG. 5, wherein Y=lock granted, N=lock denied and n/a=request not logically possible. Each cell in the table will now be described to provide an understanding as to how arbitration schemes delineate which concurrent activities are permissible and which are not.
Starting with the upper leftmost corner of the table, if an RC lock exists for a particular object and another thread also requests an RC lock on that object, then the application would grant the second RC lock. This allows multiple threads to, for example, copy the contents of the same file or folder to two different places at the same time.
As mentioned above, an HRC lock is requested for an object when a descendant of that object has acquired an RC lock. Thus, referring again to FIG. 2, if an RC lock is acquired for file E, an HRC lock will be requested for folder B. If another thread is currently reading folder B, i.e., folder B has an RC lock indicated in its lock record, the HRC lock will nonetheless be granted as indicated in FIG. 5. This permits operations such as the concurrent copying of a file or folder contained within a folder that is itself being copied.
An RK lock may be granted for an object having an RC lock, since it is permissible, for example, to read the children of a folder that is being copied. However, it is not permissible to change the children of a folder that is being copied, since doing so would result in a corrupt copy which might contain more or fewer children than the original object. As mentioned earlier, this is one of the drawbacks of conventional schemes which permit all concurrent accesses to file system objects. Thus, a WK lock will not be granted if an RC lock already exists.
Moving now to the third row of the table in FIG. 5, wherein an HRC lock exists for the object, an RC lock may be granted for that object since it is permissible to copy a folder while one (or more) of its descendants are being copied. Similarly, it is permissible for more than one of a folder's descendants to be copied at the same time, including the same descendant more than once. This is why the HRC field in each object's lock record is formatted as a variable count field.
An RK lock can be acquired for an object having an HRC lock. This permits iterations over a folder's children while the contents of a descendant of the folder are being copied. Likewise, a WK lock can be acquired for an object having an HRC lock, which permits the children of a folder to be changed while one or more of those children are being copied. Of course the same child cannot be changed and copied at the same time since that would require concurrent granting of an RC lock and a WC lock for the same child, which is not permitted as illustrated in FIG. 5.
If one thread seeks to read the contents of an object (e.g., folder B) while another thread is changing the contents of a descendant of that object (e.g., file D), such a request will be denied since corrupt copying may ensue. Thus, as seen in the leftmost cell of the fourth row of FIG. 5, an RC lock will not be granted for an object having an HWC lock. An HRC lock can be granted for an object having an HWC lock, since the contents of a descendant of an object can be copied while the contents of a different descendant are being written. Either an RK or a WC lock may be granted for an object having an HWC lock, since it is permissible to read or change the children of an object, respectively, while the contents of a descendant of that object are being written.
An RK lock indicates that the children of a particular object are being read. All other locks are permissible (except WC) for objects having an RK lock as seen in FIG. 5. It is even permissible to add children to, and remove children from, a folder while another operation is reading the children, i.e., to acquire a WK lock on an object having an RK lock. As mentioned above in the initial discussion of RK locks, when a WK lock is requested, a backup copy of the children list is kept before any changes are made to permit concurrent reading and writing.
Moving now to the last row in FIG. 5, an RC lock cannot be obtained for an object already having a WK lock, because it is not permissible for an object to be copied while the children of the object are changing. Similarly, another WK lock cannot be obtained for the same object, since it is impermissible to allow more than one operation (thread) to change the children of an object at one time. Other locks can be acquired, however, for an object having a Write Children lock.
Having provided a more detailed explanation of the various types of locks used to arbitrate concurrent file system object access according to the present invention, several examples will now be provided to illustrate the way in which these locks operate to allow permissible concurrent accesses and prevent impermissible concurrent accesses.
To provide a contrast to the conventional techniques for handling concurrent file system accesses described above, this example describes how the situation illustrated in FIG. 2 would be handled according to the present invention. The steps involved in this copy operation according to the present invention are illustrated in the flow chart of FIG. 6.
When the copy operation is initiated from folder A to a new file system object, a WK lock is acquired for the new folder A' at step 60. Then, at step 62, an RK lock is acquired for the original folder A. Next, at step 64, the objects associated with the new folder A', i.e., those objects which correspond to folders B and C and files D, E, F and G, are created as pseudo-items.
Pseudo-items are not true file system objects in the sense that there currently exists no standard file system representation for these pseudo-items. Instead, the pseudo-items exist for the purpose of name conflict detection and for locking but are not visible to the user on the GUI until the copying operation has been completed. This prevent the user from having the option of manipulating objects that have not yet been copied. Moreover, the system can use the pseudo-items to avoid duplicating object names and to avoid impermissible concurrent file system object accesses.
Next, at step 66, an RC lock is acquired for the children of folder A and, at step 68, a WC lock is acquired for the children of A', i.e., the pseudo-items. Once the content locks have been acquired, then the WK and RK locks can be released at step 70 since their purpose was to freeze this portion of the object hierarchy until the pseudo-items could be created and context locks acquired. Next, at step 72, the objects themselves can now be copied. Then, the contents locks can be released at step 74, the pseudo-items deleted at step 76 and actual items created at step 78, whereupon the user can then see the visual representations of these objects on the GUI and manipulate same.
In this example, the contemplated concurrent accesses involve duplicating an item C in folder A and then moving five files (1-5) into folder A while the duplication takes place. The Duplicate operation will acquire a Write Children lock (WK) lock on folder A. Once it has the WK lock, it will obtain a Read Contents lock (RC) on item C, create a pseudo-item "C copy" and acquire a Write Contents lock (WC) on the pseudo-item. Once the pseudo-item is created, the WK lock is released and the duplication proceeds.
The move operation will acquire a Write Children lock (WK) on the source of the move and a Write Children Lock (WK) on folder A. The move operation will be able to obtain the WK lock on folder A because the duplicate operation no longer has a WK lock. At this point, no other thread can change the children of folder A until the WK lock is released. The move operation iterates over the selection (items 1-25) and determines if there are name conflicts to resolve. At this point, a dialog window may appear on the GUI so that the user can resolve any possible name conflicts. Note that the WK lock on folder A remains in place the entire time. Once any name conflicts are resolved, the items are moved to folder A and both WK locks are released.
Consider the scenario where one of the five items being moved had the same name as the item C that was being duplicated. In this example, the duplicate operation would have started normally, and then the move operation would have noticed a name conflict with one of the items it was trying to move. Since the duplicate operation has a Write Content lock on the item, the move operation would know that it cannot resolve the conflict (i.e, that it could not replace the WC locked item), and would tell the user that the move could not be completed because items with the same name in the destination are busy.
In this example we are trying to copy the same item A to two different locations, e.g., folder B and the Desktop, at the same time. If the name conflicts can be resolved, this combination of concurrent actions should be successful.
The first copy (item A to folder B) acquires a Write Children lock (WK) on folder B and a Read Contents lock (RC) on item A, creates a pseudo-item "A" in folder B, and obtains a Write Contents lock (WC) on pseudo-item A. Once the content locks are in place, the operation releases the WK locks and proceeds with the copy.
The second copy operation acquires an RK lock on the source, and a WK lock on the Desktop. The second copy operation also needs to get an RC lock on item A. Item A already has an RC lock on it associated with the first copy operation, but that is acceptable since multiple readers are permitted at one time. Thus, the second operation obtains an RC lock on item A, creates a pseudo-item "A" on the Desktop, and gets a WC lock on pseudo-item A. Once the content locks are in place, the operation releases the RK and WK locks and proceeds with the copy.
It can be seen that copying the same item to two different locations is relatively straight-forward. A problem might arise, however, if the operation could not create the pseudo-item in the destination because of a name conflict. Name conflicts are not difficult to resolve using locking mechanisms according to the present invention. If an item is not locked, the operation can ask the user if they would like to replace the existing item. If the user responds positively, the new pseudo-item replaces the old item. Since the new pseudo-item is WC locked until it is completely copied, other processes are prevented from deleting or replacing it until the copy operation is finished. On the other hand, if the new pseudo-item already exists and is locked (either a Read or Write Content lock), the operation does not replace the item and will notify the user that item is busy and cannot be replaced.
In this example, the concurrent accesses involve duplicating an item (folder A) and moving a child of that item (a subfolder B) into the Trash (seen in FIG. 1). According to the principles described above, this operation should fail, i.e., be identified as impermissible, because it is unknown whether the copy operation will or will not copy the moved item.
The duplicate operation acquires a Write Children lock (WK) lock on the parent of folder A and a Read Contents lock (RC) on folder A. Hierarchy Read Contents locks (HRC) are acquired for all ancestors of folder A. The operation creates a pseudo-item "A copy" and acquires a WC lock on pseudo-item A copy. Once the pseudo-item has been created and locked, the WK lock is released and the duplication proceeds.
The move operation attempts to acquire WK locks on folder B's parent and on the Trash so that it can remove folder B from the children list of B's parent and add it to the children list of the Trash. To acquire a WK lock, the operation will look up the hierarchy for conflicting locks and see that there is an RC lock on one of B's ancestors. This means is that somewhere up the hierarchy, a thread is reading contents and, therefore, nothing in the subtree (e.g., subfolder B) can be moved at this time. The move operation fails to acquire to WK lock and notifies the user that the move could not be completed because folder B was busy.
According to exemplary embodiments of the present invention, the locks described hereinabove are transferrable under certain circumstances. For example, consider the situation depicted in FIG. 7(a). Therein, at a first time T1, folder A has two threads operating on it at the same time. One thread is copying the contents of folder A to some other, unillustrated object. Another thread is moving folder A from its position in the hierarchy under the folder FOO to a position in the hierarchy where it will be a descendant of the folder bar.
At the time T1 illustrated in FIG. 7(a), the lock situation is as follows. The folder A has two RC locks acquired by the two concurrent read operations being performed thereon. Due to those two RC locks associated with folder A, each of its ancestors, i.e., the folder FOO and volume DISK, has two HRC locks.
At time T2, the move operation has been completed, but the copy operation is still ongoing. Then the lock situation will be as illustrated in FIG. 7(b). Therein, folder A now has one RC lock associated with its ongoing copy operation and is now a descendant of a folder BAR. Thus, both BAR and DISK have each one HRC lock associated with the current read operation of folder A. This transferring of locks provides consistency in the arbitration access schemes according to the present invention.
It will be understood that Applicants' invention is not limited to the particular embodiments described above and that modifications may be made by persons skilled in the art. For example, although the foregoing exemplary embodiment describes the copying of children to provide a backup during certain operations, such a backup may be undesirable in exemplary implementations where making the backup copy takes too much time. Accordingly, this feature of the previously described exemplary embodiments can be omitted as long as the access rules illustrated in FIG. 5 are modified to prevent object corruption. For example, the cells wherein the desired lock is RK and the current lock is WK, and the desired lock is WK and the current lock is RK should be changed from `Y` to `N` in FIG. 5.
Moreover, as mentioned earlier, locking techniques according to the present invention may also be implemented at the file system level. In such exemplary embodiments, the access rules illustrated in FIG. 5 could be modified as illustrated in FIG. 8, wherein the "n/a" cell values have been replaced by "Y" or "N" values to reflect the fact that multiple applications may have simultaneous access to file system objects and that pseudo-items need not be used for locking purposes.
As will be appreciated by those skilled in the art, the present invention can be implemented as software written using any appropriate programming language. Thus, the present invention can be embodied on a computer-readable medium, e.g., magnetic or optical, which is read by a computer to perform the above-described functions.
Accordingly, the scope of Applicants' invention is determined by the following claims, and any and all modifications that fall within that scope are intended to be included therein.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5129083 *||Jun 29, 1989||Jul 7, 1992||Digital Equipment Corporation||Conditional object creating system having different object pointers for accessing a set of data structure objects|
|US5371885 *||Aug 29, 1989||Dec 6, 1994||Microsoft Corporation||High performance file system|
|US5414839 *||Jun 19, 1992||May 9, 1995||Digital Equipment Corporation||Hybrid lock escalation and de-escalation protocols|
|US5493728 *||Jul 23, 1993||Feb 20, 1996||Borland International, Inc.||System and methods for optimized access in a multi-user environment|
|US5568639 *||Nov 24, 1993||Oct 22, 1996||Menai Corporation||Method and apparatus for providing an object-oriented file structuring system on a computer|
|US5590326 *||Sep 13, 1994||Dec 31, 1996||Kabushiki Kaisha Toshiba||Shared data management scheme using shared data locks for multi-threading|
|US5664189 *||Oct 21, 1996||Sep 2, 1997||Menai Corporation||Method and apparatus for providing object-oriented file structuring system on a computer|
|US5692178 *||Jul 16, 1996||Nov 25, 1997||Borland International, Inc.||System and methods for improved file management in a multi-user environment|
|US5692180 *||Jan 31, 1995||Nov 25, 1997||International Business Machines Corporation||Object-oriented cell directory database for a distributed computing environment|
|US5737536 *||Nov 2, 1995||Apr 7, 1998||Borland International, Inc.||System and methods for optimized access in a multi-user environment|
|US5787439 *||Dec 13, 1996||Jul 28, 1998||Novell, Inc.||Method and system for maintaining a preferred sequence for accessing a plurality of objects|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US6172676 *||Jul 17, 1998||Jan 9, 2001||International Business Machines Corporation||Method and computer program product for implementing multiple drag and drop operations for large objects without blocking an operating system interface|
|US6253273 *||Feb 6, 1998||Jun 26, 2001||Emc Corporation||Lock mechanism|
|US6681225||May 31, 2000||Jan 20, 2004||International Business Machines Corporation||Method, system and program products for concurrent write access to a global data repository|
|US6922729 *||Jul 30, 1999||Jul 26, 2005||International Business Machines Corporation||Multi-connection control system|
|US7000050 *||Nov 14, 2003||Feb 14, 2006||Matsushita Electric Industrial Co., Ltd||Apparatus, method and program for contention arbitration|
|US7028300 *||Nov 13, 2001||Apr 11, 2006||Microsoft Corporation||Method and system for managing resources in a distributed environment that has an associated object|
|US7188344 *||Dec 21, 1999||Mar 6, 2007||Unisys Corporation||Architecture for a read/write thread lock|
|US7216114 *||Aug 9, 2001||May 8, 2007||International Business Machines Corporation||Transfer of mail folders between e-mail users|
|US7222119 *||Jun 30, 2003||May 22, 2007||Google Inc.||Namespace locking scheme|
|US7236974||Apr 29, 2003||Jun 26, 2007||International Business Machines Corporation||System and method for a multi-level locking hierarchy in a database with multi-dimensional clustering|
|US7246119||Mar 7, 2003||Jul 17, 2007||Kabushiki Kaisha Toshiba||Method and implementation of session-based file locking for network applications|
|US7251645 *||Apr 5, 2000||Jul 31, 2007||Ns Solutions Corporation||Data processing apparatus, data processing system, data processing method, and recording medium|
|US7289992||May 1, 2003||Oct 30, 2007||International Business Machines Corporation||Method, system, and program for lock and transaction management|
|US7346664||Apr 23, 2004||Mar 18, 2008||Neopath Networks, Inc.||Transparent file migration using namespace replication|
|US7380073 *||Nov 26, 2003||May 27, 2008||Sas Institute Inc.||Computer-implemented system and method for lock handling|
|US7383368||Sep 25, 2003||Jun 3, 2008||Dell Products L.P.||Method and system for autonomically adaptive mutexes by considering acquisition cost value|
|US7406519||Nov 13, 2001||Jul 29, 2008||Microsoft Corporation||Method and system for locking resources in a distributed environment|
|US7406698 *||Dec 30, 2003||Jul 29, 2008||Microsoft Corporation||Driver framework component for synchronizing interactions between a multi-threaded environment and a driver operating in a less-threaded software environment|
|US7454516||Aug 3, 2000||Nov 18, 2008||Microsoft Corporation||Scalable virtual partitioning of resources|
|US7483981 *||Dec 3, 2004||Jan 27, 2009||Microsoft Corporation||Scalable virtual partitioning of resources|
|US7487152 *||May 31, 2000||Feb 3, 2009||International Business Machines Corporation||Method for efficiently locking resources of a global data repository|
|US7487278||Feb 15, 2006||Feb 3, 2009||Microsoft Corporation||Locking multiple resources in a distributed environment|
|US7496574||May 1, 2003||Feb 24, 2009||International Business Machines Corporation||Managing locks and transactions|
|US7548920 *||Dec 30, 2005||Jun 16, 2009||Sap Ag||Systems and methods of accessing and updating recorded data via an inter-object proxy|
|US7587422||Apr 23, 2004||Sep 8, 2009||Neopath Networks, Inc.||Transparent file replication using namespace replication|
|US7587428||Mar 11, 2003||Sep 8, 2009||Microsoft Corporation||Maintaining a relationship between two different items of data|
|US7593941 *||Dec 29, 2005||Sep 22, 2009||Sap Ag||Systems and methods of accessing and updating recorded data|
|US7594091||May 23, 2008||Sep 22, 2009||Sas Institute Inc.||Computer-implemented system and method for lock handling|
|US7606800 *||May 8, 2006||Oct 20, 2009||Symantec Operating Corporation||Systems, methods and apparatus for creating stable disk images|
|US7660796 *||Feb 26, 2004||Feb 9, 2010||Canon Kabushiki Kaisha||Information processing method and apparatus|
|US7689560 *||Apr 9, 2004||Mar 30, 2010||Miosoft Corporation||Persistent data storage techniques|
|US7698274 *||Sep 22, 2004||Apr 13, 2010||The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration (Nasa)||Selective access and editing in a database|
|US7720796||Jan 3, 2006||May 18, 2010||Neopath Networks, Inc.||Directory and file mirroring for migration, snapshot, and replication|
|US7827302||Oct 9, 2008||Nov 2, 2010||Microsoft Corporation||Scalable virtual partitioning of resources|
|US7831641||Apr 26, 2004||Nov 9, 2010||Neopath Networks, Inc.||Large file support for a network file server|
|US7844585||Aug 17, 2007||Nov 30, 2010||International Business Machines Corporation||Method, system, and program for managing locks and transactions|
|US7870111||Jul 13, 2007||Jan 11, 2011||International Business Machines Corporation||Method, system, and program for lock and transaction management|
|US8015570||Jun 30, 2006||Sep 6, 2011||Microsoft Corporation||Arbitration mechanisms to deal with conflicting applications and user data|
|US8108451||Feb 2, 2009||Jan 31, 2012||International Business Machines Corporation||System and program products for efficiently locking resources of a global data repository|
|US8131689||Oct 2, 2006||Mar 6, 2012||Panagiotis Tsirigotis||Accumulating access frequency and file attributes for supporting policy based storage management|
|US8161018||Jun 26, 2008||Apr 17, 2012||International Business Machines Corporation||Managing locks and transactions|
|US8180843||Jan 24, 2008||May 15, 2012||Neopath Networks, Inc.||Transparent file migration using namespace replication|
|US8190741||Mar 31, 2006||May 29, 2012||Neopath Networks, Inc.||Customizing a namespace in a decentralized storage environment|
|US8195627||Sep 30, 2005||Jun 5, 2012||Neopath Networks, Inc.||Storage policy monitoring for a storage network|
|US8200643||Dec 6, 2010||Jun 12, 2012||International Business Machines Corporation||Lock and transaction management|
|US8341237||Oct 23, 2006||Dec 25, 2012||International Business Machines Corporation||Systems, methods and computer program products for automatically triggering operations on a queue pair|
|US8458125 *||Jan 31, 2005||Jun 4, 2013||Oracle America, Inc.||Dynamic creation of replicas of streaming data from a storage device without added load|
|US8489567||Feb 24, 2010||Jul 16, 2013||Microsoft Corporation||Persistent data storage techniques|
|US8495131||Oct 8, 2002||Jul 23, 2013||International Business Machines Corporation||Method, system, and program for managing locks enabling access to a shared resource|
|US8539081||Sep 15, 2004||Sep 17, 2013||Neopath Networks, Inc.||Enabling proxy services using referral mechanisms|
|US8572617||Jul 21, 2009||Oct 29, 2013||Sas Institute Inc.||Processor-implemented systems and methods for event handling|
|US8768905||Mar 12, 2012||Jul 1, 2014||International Business Machines Corporation||Managing locks and transactions|
|US8832697||Jun 29, 2006||Sep 9, 2014||Cisco Technology, Inc.||Parallel filesystem traversal for transparent mirroring of directories and files|
|US8935225||Mar 14, 2013||Jan 13, 2015||Miosoft Corporation||Persistent data storage techniques|
|US9075762 *||Jan 4, 2013||Jul 7, 2015||International Business Machines Corporation||Setting copy permissions for target data in a copy relationship|
|US9189536||Aug 5, 2009||Nov 17, 2015||Miosoft Corporation||Maintaining a relationship between two different items of data|
|US9213586||Mar 18, 2009||Dec 15, 2015||Sas Institute Inc.||Computer-implemented systems for resource level locking without resource level locks|
|US9304870||Nov 4, 2013||Apr 5, 2016||International Business Machines Corporation||Setting copy permissions for target data in a copy relationship|
|US9354986||May 8, 2015||May 31, 2016||International Business Machines Corporation||Setting copy permissions for target data in a copy relationship|
|US20030031457 *||Jul 30, 2002||Feb 13, 2003||Sanyo Electric Co., Ltd.||Electronic album device and file copying method for use in the device|
|US20030033271 *||Aug 9, 2001||Feb 13, 2003||Melanie Hendricks||Transfer of mail folders between e-mail users|
|US20030093457 *||Nov 13, 2001||May 15, 2003||Microsoft Corporation||Method and system for allocating locks in a distributed environment|
|US20030105871 *||Nov 13, 2001||Jun 5, 2003||Microsoft Corporation,||Method and system for modifying lock properties in a distributed environment|
|US20030182285 *||Mar 7, 2003||Sep 25, 2003||Katie Kuwata||Method and implementation of session-based file locking for network applications|
|US20030233370 *||Mar 11, 2003||Dec 18, 2003||Miosoft Corporation, A Delaware Corporation||Maintaining a relationship between two different items of data|
|US20040068563 *||Oct 8, 2002||Apr 8, 2004||International Business Machines Corporation||Method, system, and program for managing locks enabling access to a shared resource|
|US20040098526 *||Nov 14, 2003||May 20, 2004||Michiko Matsumoto||Apparatus, method and program for contention arbitration|
|US20040172448 *||Feb 26, 2004||Sep 2, 2004||Canon Kabushiki Kaisha||Information processing method and apparatus|
|US20040205066 *||Apr 29, 2003||Oct 14, 2004||International Business Machines Corporation||System and method for a multi-level locking hierarchy in a database with multi-dimensional clustering|
|US20040220913 *||May 1, 2003||Nov 4, 2004||International Business Machines Corporation||Method, system, and program for lock and transaction management|
|US20040267752 *||Apr 23, 2004||Dec 30, 2004||Wong Thomas K.||Transparent file replication using namespace replication|
|US20040267807 *||Apr 9, 2004||Dec 30, 2004||Miosoft Corporation, A Delaware Corporation||Persistent data storage techniques|
|US20040267830 *||Apr 23, 2004||Dec 30, 2004||Wong Thomas K.||Transparent file migration using namespace replication|
|US20050080963 *||Sep 25, 2003||Apr 14, 2005||International Business Machines Corporation||Method and system for autonomically adaptive mutexes|
|US20050081204 *||Sep 25, 2003||Apr 14, 2005||International Business Machines Corporation||Method and system for dynamically bounded spinning threads on a contested mutex|
|US20050091342 *||Sep 30, 2003||Apr 28, 2005||International Business Machines Corporation||Method, system, and storage medium governing management of object persistence|
|US20050108362 *||Dec 3, 2004||May 19, 2005||Microsoft Corporation||Scaleable virtual partitioning of resources|
|US20050114609 *||Nov 26, 2003||May 26, 2005||Shorb Charles S.||Computer-implemented system and method for lock handling|
|US20050125503 *||Sep 15, 2004||Jun 9, 2005||Anand Iyengar||Enabling proxy services using referral mechanisms|
|US20050144330 *||Dec 30, 2003||Jun 30, 2005||Richardson John J.||Multi-threaded synchronization adapter|
|US20050240622 *||Jun 24, 2005||Oct 27, 2005||Ibm Corp||Multi-connection control system|
|US20060053111 *||Mar 28, 2005||Mar 9, 2006||Computer Associates Think, Inc.||Distributed locking method and system for networked device management|
|US20060080371 *||Sep 30, 2005||Apr 13, 2006||Wong Chi M||Storage policy monitoring for a storage network|
|US20060136637 *||Feb 15, 2006||Jun 22, 2006||Microsoft Corporation||Locking multiple resources in a distributed environment|
|US20060136926 *||Jan 25, 2006||Jun 22, 2006||Microsoft Corporation||Allocating locks in a distributed environment|
|US20060161746 *||Jan 3, 2006||Jul 20, 2006||Wong Chi M||Directory and file mirroring for migration, snapshot, and replication|
|US20060271598 *||Mar 31, 2006||Nov 30, 2006||Wong Thomas K||Customizing a namespace in a decentralized storage environment|
|US20070024919 *||Jun 29, 2006||Feb 1, 2007||Wong Chi M||Parallel filesystem traversal for transparent mirroring of directories and files|
|US20070112836 *||May 8, 2006||May 17, 2007||Veritas Operating Corporation||Systems, methods and apparatus for creating stable disk images|
|US20070136308 *||Oct 2, 2006||Jun 14, 2007||Panagiotis Tsirigotis||Accumulating access frequency and file attributes for supporting policy based storage management|
|US20070156688 *||Dec 29, 2005||Jul 5, 2007||Sap Ag||Systems and methods of accessing and updating recorded data|
|US20070156690 *||Dec 30, 2005||Jul 5, 2007||Sap Ag||Systems and methods of accessing and updating recorded data via an inter-object proxy|
|US20070282839 *||Jul 13, 2007||Dec 6, 2007||International Business Machines Corporation||Method, system, and program for lock and transaction management|
|US20070282966 *||Aug 17, 2007||Dec 6, 2007||International Business Machines Corporation||Method, system, and program for managing locks and transactions|
|US20080114854 *||Jan 24, 2008||May 15, 2008||Neopath Networks, Inc.||Transparent file migration using namespace replication|
|US20080126349 *||Jun 30, 2006||May 29, 2008||Microsoft Corporation||Arbitration mechanisms to deal with conflicting applications and user data|
|US20080147822 *||Oct 23, 2006||Jun 19, 2008||International Business Machines Corporation||Systems, methods and computer program products for automatically triggering operations on a queue pair|
|US20080222331 *||May 23, 2008||Sep 11, 2008||Shorb Charles S||Computer-Implemented System And Method For Lock Handling|
|US20080263549 *||Jun 26, 2008||Oct 23, 2008||International Business Machines Corporation||Managing locks and transactions|
|US20080307138 *||Jun 24, 2008||Dec 11, 2008||Microsoft Corporation||Method and system for locking resources in a distributed environment|
|US20090049176 *||Oct 9, 2008||Feb 19, 2009||Microsoft Corporation||Scalable virtual partitioning of resources|
|US20090171963 *||Feb 2, 2009||Jul 2, 2009||International Business Machines Corporation||System and program products for efficiently locking resources of a global data repository|
|US20100153397 *||Aug 5, 2009||Jun 17, 2010||Miosoft Corporation||Maintaining a relationship between two different items of data|
|US20100242043 *||Mar 18, 2009||Sep 23, 2010||Charles Scott Shorb||Computer-Implemented Systems For Resource Level Locking Without Resource Level Locks|
|US20110078126 *||Dec 6, 2010||Mar 31, 2011||International Business Machines Corporation||Method, system, and program for lock and transaction management|
|US20130117858 *||Dec 31, 2012||May 9, 2013||Eran Werner||Method and System for Ensuring a Sharing Violation Free Environment for a Trusted Software Agent|
|US20140195751 *||Jan 4, 2013||Jul 10, 2014||International Business Machines Corporation||Setting copy permissions for target data in a copy relationship|
|US20150032976 *||Apr 4, 2013||Jan 29, 2015||Schneider Electric Industries Sas||Method of secure management of a memory space for microcontroller|
|DE10059145B4 *||Nov 29, 2000||Jun 14, 2006||Mitsubishi Denki K.K.||Fahrzeuginformationsprozessor zum Bereitstellen von Karteninformation auf Grundlage von Kartendaten|
|WO2007002855A3 *||Jun 29, 2006||Jun 28, 2007||Neopath Networks Inc||Parallel filesystem traversal for transparent mirroring of directories and files|
|U.S. Classification||1/1, 714/E11.136, 707/E17.007, 710/200, 707/999.008, 707/999.202, 707/999.2|
|International Classification||G06F17/30, G06F11/14|
|Cooperative Classification||Y10S707/99953, Y10S707/99938, G06F11/1435, G06F17/30171|
|European Classification||G06F17/30F7S1L, G06F11/14A8F, G06F17/30C|
|Sep 16, 1997||AS||Assignment|
Owner name: APPLE COMPUTER, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MCCLAUGHRY, PATRICK;MCFARLAND, MAX;MCINERNEY, PETER;AND OTHERS;REEL/FRAME:008871/0461;SIGNING DATES FROM 19970730 TO 19970811
|Feb 7, 2000||AS||Assignment|
Owner name: APPLE COMPUTER, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MCLAUGHRY, PATRICK;MCFARLAND, MAX;MCINERNEY, PETER;AND OTHERS;REEL/FRAME:010592/0348;SIGNING DATES FROM 19990730 TO 19990811
|Apr 17, 2001||CC||Certificate of correction|
|Jan 30, 2003||FPAY||Fee payment|
Year of fee payment: 4
|Jan 12, 2007||FPAY||Fee payment|
Year of fee payment: 8
|Apr 24, 2007||AS||Assignment|
Owner name: APPLE INC., CALIFORNIA
Free format text: CHANGE OF NAME;ASSIGNOR:APPLE COMPUTER, INC.;REEL/FRAME:019235/0583
Effective date: 20070109
Owner name: APPLE INC.,CALIFORNIA
Free format text: CHANGE OF NAME;ASSIGNOR:APPLE COMPUTER, INC.;REEL/FRAME:019235/0583
Effective date: 20070109
|Jan 5, 2011||FPAY||Fee payment|
Year of fee payment: 12


Headkrack went in once again in this edition of “Flow And Go!” He covered a bunch of topics, from Troy Ave‘s predicament with the law after the shooting at T.I.‘s concert, Meek Mill‘s lengthened house arrest, the controversial killing of Harambe at the Cincinnati Zoo, and much more.
Sign Up For Our Newsletter!
Take a listen to the player and hear their off the top of the head dopeness for yourself!
Get more HeadKrack’s Flow and Go here and tune in to “The Rickey Smiley Morning Show” daily from 6-10am!
RELATED: Headkrack And Da Brat Freestyle About Azealia Banks, The Hamiltones, Safaree, Chris Brown & More! [EXCLUSIVE VIDEO]
RELATED: Headbrack & Da Brat Freestyle About Drake, Janet Jackson, Rickey Smiley For Real And More! [EXCLUSIVE VIDEO]
RELATED: Headkrack & Da Brat Rap About Bad Boy, Kylie Jenner, And More! [EXCLUSIVE VIDEO]


text:
Mattel marks Barbie’s 65th anniversary with a new doll inspired by the 1959 original
The products and services mentioned below were selected independent of sales and advertising. However, Simplemost may receive a small commission from the purchase of any products or services through an affiliate link to the retailer's website.
Mattel is celebrating 65 years of Barbie with a new doll that may very well be their most glamorous Barbie ever.
Decked out in a black-and-white-striped ball gown, long black gloves and sparkling earrings, the 65th-anniversary doll seems to be inspired by the original Barbie, which made her debut at the New York Toy Fair on March 9, 1959.
Priced at $60, the Barbie Signature 65th Blue Sapphire Anniversary doll is available for pre-order through the Mattel shop and Target. Once the Barbie is released on March 17, it will be available at other stores nationwide.
Like other popular dolls the brand has introduced, there’s always a chance this Barbie doll could sell out during pre-orders, so ordering online now is your best opportunity to guarantee you’ll get one.
The 65th Anniversary Barbie is dressed in a black and white gown reminiscent of the swimsuit worn by the original Barbie.
The doll is also wearing sparkling “sapphire” earrings, which is the gem associated with 65th anniversaries. She has a high ponytail, blue eyes, red lips and cat-eye sunglasses that also pay homage to the original doll.
The Barbie does not stand on its own, so if you want to take it out of the box for display, you’ll want to get a doll stand.
Along with the anniversary doll, Mattel is celebrating nearly seven decades of Barbie by honoring women the brand says are shaping the future through their inspiring stories.
Those honored include Viola Davis, Shania Twain and Dame Helen Mirren, who have all received a one-of-a-kind role model doll made in their likeness.
While the dolls are not available for purchase, other honorees include singer Kylie Minogue, Brazilian content creator Maira Gomez, Mexican director, producer and screenwriter Lila Avilés, Japanese model Nicole Fujita and German comedian Enissa Amani.
Mattel will continue to celebrate Barbie’s anniversary throughout the year with more new products, partnerships and dolls, so keep an eye out for future announcements.

domain: entertainment


text:
Without the need of problem, the longest-working silver coin with the Perth Mint is definitely the Australian Silver Kookaburra. A novel bird species native to your continent of Australia, the kookaburra has appeared on the proof silver coin considering that 1990.
The realm was originally set up as being a protected space because of the ruling Spanish, but recognized by American officials on January 17, 1903 subsequent annexation from the island after the Spanish-American War.
“Fiji Taku” was no longer engraved from the sliver of deeply-mirrored Area within the coin. Rather, the word “Turtle” was engraved there.
On this site Now we have mentioned our comprehensive choice of silver bullion bars from all brand names and of all dimensions that you should see. At Silver.com we only get good quality merchandise from the earth’s most trustworthy mints.
The place price of Gold per Troy Ounce along with the date and time of the price is proven underneath the calculator. If your browser is configured to accept Cookies you will notice a button at The underside of the Holdings Calculator. Urgent the button will position a cookie on your own machine made up of the knowledge you entered in the Holdings Calculator. When you return to goldprice.org the cookie will be retrieved out of your device and the values put in the calculator.
While not as collectible as some Silver coins, Silver rounds are minted to an Similarly higher normal with fantastically in depth models and cleanse putting.
These coins characteristic .999 pure silver and are available with a new obverse style each and every year. Initially launched in 2004, these coins are extremely coveted by investors and collectors alike.
The attractive nature of silver is self obvious. It’s been utilized for Many decades for many, a lot of things. Interestingly, silver has some traits that standout above all other metals. Did you know silver has?
The worth of bullion is often determined by the value of its valuable metals written content, which can be described by its purity and mass. To assess the purity of gold bullion, the generations-previous technique of fire assay remains to be used, silver bullion together with fashionable spectroscopic instrumentation, to precisely ascertain its high quality to make sure the operator receives truthful market worth for it. It is also weighed really properly.
Buyers might choose to buy Bodily gold bullion for many good reasons - to try to hedge in opposition to forex risks, inflation challenges, geopolitical pitfalls, or to add diversification to an financial investment portfolio.
This information's lead area does not adequately summarize essential details of its contents. Please think about increasing the guide to deliver an accessible overview of all essential facets of the posting. Make sure you discuss this concern to the post's discuss site. (June 2016)
The brand new Zealand Mint is A personal corporation with its headquarters during the money of Auckland. The mint excels in producing legal tender collectible coins, gold bullion products and solutions, and medallions.
The mining of silver began some 5000 decades in the past and was initial discovered and excavated in exactly what is now modern-day Turkey. The center of silver mining sooner or later shifted to Greece and later to Spain.
Wherever can I invest in Silver bullion? APMEX bargains in top rated-top quality Silver bullion, coins and rounds. Silver bullion is probably the least difficult and most Value-powerful Precious Metals investments just one could make.

domain: finance


text:
ANTONIO MARRAS – SPRING SUMMER 2018 – Milano Fashion Week 2017
Antonio Marras was born in Alghero in 1961. Marras’ inspiration for his eponymous label is drawn from travels, tradition, history and memories, the narrative influencing the way that the fabric will be treated. In June 2002, during Pitti Uomo in Florence, he presented first menswear collection. In September 2003 the French group LVHM appointed Antonio Marras as the artistic director of Kenzo womenswear, a position Marras held until 2011.

domain: artistic


IPU’s OilAlert oil quality sensors provide real-time oil condition monitoring in vehicles, ships, gensets, turbines and many other types of mechanical devices.
Unlike off-site lubricant testing, OilAlert sensors constantly monitor the condition of your engine oil, transmission oils and hydraulic fluids. If a machine is running, its oil is being checked. With some OilAlert packages the results can even be broadcast back to your service depot in real-time and alarms raised automatically if problems are detected.
OilAlert uses a permittivity sensor that accurately and constantly monitors the condition of any lubricant in engine blocks, gearboxes or axles.
OilAlert oil condition sensors can send oil condition readings to an optional display on a control panel or in a vehicle cab.
Adding this solution to mechanical devices:
Increases the reliability of critical equipment by alerting managers to problems with lubricants or mechanical parts.
Extends the life of your critical equipment by ensuring they are always properly lubricated.
Reduces oil costs by limiting oil changes to when they’re needed rather than when they’re scheduled.
Reduces downtime and loss of productivity by extending service intervals.
Reduces disruption to work by eliminating machine failures caused by lubrication degradation (75% of system failures are related to engine lubrication)
Improves efficiency by being able to plan maintenance cycles.
Understanding the results couldn’t be simpler
A sudden change in values indicates a pending technical problem. By shutting down the equipment quickly the operator can prevent a bad situation turning into a financial disaster.
The sensor can be wired into the equipment’s management system so an automatic shutdown can be triggered if a human operator is not on-hand.
Combining the sensor with IPU’s datalogger produces the ultimate tool for protecting your investment in critical equipment. It transmits data from the OilAlert sensor back to a service depot so an entire fleet of vehicles or equipment can be monitored in realtime. With central management, mechanical problems can be identified early. Preventative action can be taken to avoid major failures and costly downtime.
OilAlert transmits realtime oil condition data back to a service depot anywhere in the world.
Traditional methods of testing lubricant condition can be slow and prone to human error. In open cast mines, for example, a 100t dump truck can be far from its base before the results of a lab-based oil test reveal a critical problem; an operator can miss the alerts being broadcast by his OilAlert display.
Whatever the cause, the result can be disastrous to the profitability and efficiency of your operation.
Data from OilAlert sensors, third-party sensors and the engine management system is instantly sent to a central location by OilAlert.
OilAlert solves the problem by using a cellular (GPRS) link to broadcast real-time lubricant condition reports. These are received by E/LOG, a sophisticated software package that captures and trends a wide range of engine parameters. Problems are detected and identified immediately. If the problem is not urgent it can be added to the vehicle’s next service schedule. If a major failure is predicted the operator can be told to stop before the problem materialises.
OilAlert Lite suits any industry
OilAlert sensors are tough enough to function in any environment. They are built to withstand the dirt-clogged atmosphere in mines and landfill sites, the incessant workload on board ships, the constant vibration in construction and transport vehicles and the huge range in temperatures experienced by diesel generator sets.
OilAlert Lite is an accredited solution
OilAlert’s analysis is so accurate and comprehensive it will transform the profitability and reliability of your operation. But don’t just take our word for it. Bob Cutler, the General Manager of ALcontrol Oil Analysis Laboratories, says
“After several months of testing, we were able to establish that the OilAlert* sensor is an excellent indicator of oil condition”
OilAlert Lite is simple to install
The OilAlert Lite oil condition sensor is integrated into the oil flow that feeds existing pressure sensors and filters. There is no effect on oil flow or pressure in the current system. No modifications are needed to the engine block itself.
OilAlert oil quality sensors do not require any modifications to the engine block.
The importance of lubricant testing
Poor engine lubrication is commonly cited as contributing to 75% of system failures. Few businesses can afford expensive engine rebuilds, the loss of productivity they cause and the damage to their reputation that follows. OilAlert sensors are a simple and cost-effective way to protect your profitability, productivity and reputation.
IPU’s OilAlert sensors can prevent costly breakdowns on essential equipment.
An OilAlert oil quality sensor reduces costs
OilAlert is more than an early-warning system; it reduces costs too. Most organisations operate a dual service schedule with engine oil being changed both during and between major services.
Many of these oil changes are unnecessary. They are timed according to the theoretical life of the oil, not its actual condition. Oil is often discarded and machines taken out of service while the oil is still delivering adequate engine lubrication. OilAlert sensors give you the data and the confidence to change oil when it needs changing, reducing oil and filter costs and extending service intervals.
OilAlert helps your business
OilAlert sensors are perfect partners for all hard-working machinery. The worse the conditions, the heavier the workload, the more critical the application, the more essential OilAlert becomes:
Open cast and underground mining vehicles.
Construction and earth-moving vehicles.
Commercial and military shipping.
Landfill power generation.
Renewable power generation.
Standby power generation.
OilAlert sensors monitor oil condition for mining and quarrying vehicles.
OilAlert sensors reduce the maintenance burden by providing oil condition monitoring for wind turbines.
OilAlert oil condition sensors keep construction equipment working by providing real-time oil condition monitoring.
Everybody’s looking for an edge, the benefit that makes their trucks, lorries or ships stand out from the competition. OilAlert delivers that benefit.
By incorporating OilAlert into your equipment you can deliver benefits far beyond the capabilities of your competitors, benefits that attract new customers and retain old ones:
Longer service intervals.
Stainless Steel AISI304
90mm x 37mm (L x W)
9-30 V DC
Average power consumption
9600 baud bi-directional
9600 baud half duplex
on RS232 & RS485
IP67 when connected
-20°C to +120°C
0 bar to 20 bar
up to 20 bar
6 Pin Lumberg
M32 Hex Head
3/8” or 1/2” BSP Thread
DIN 3869 Ring Seal or Dowty Seal
10 to 100
BS EN 60068-2-30 (Test Db – Cyclic Humidity)
BS EN 60068-2-6 (Test Fc – Sine Vibration)
BS EN 60068-2-27 (Test Ea – Mechanical Shock)
EN 61000-6-4:2007 (Generic Emissions Standard for Industrial Environments)
EN 61000-6-2:2005 (Generic Immunity Standard for Industrial Environments)
IPU’s OilAlert adds an unbeatable edge to any mechanical equipment, vehicle or vessel. OilAlert sensors give you the confidence to extract maximum productivity. Watch our videos to see some typical scenarios:
* We’ve changed the name of the sensor in this quotation to reflect a product rebrand – it’s still the same product though.
With construction companies facing ever-greater pressure to cut costs and improve efficiency, it’s vital that the capital equipment they depend on operates optimally. OilAlert helps to reduce construction costs by keeping vehicles in work not in maintenance. Using efficiency to reduce construction costs OilAlert helps…
A mine’s profitability depends on its ability to extract and transport coal and ore reliably, efficiently and regularly. To reduce mining costs and cost-per-ton it is essential that vehicles stay in work not in maintenance. Using productivity to reduce mining costs OilAlert helps operators reduce mining costs safely by…
Engineers know how hard it is to monitor all the complex mechanical and hydraulic systems on modern ships. A failure in any of these systems can critically restrict a ship’s ability to travel, manoeuvre or handle cargo. To reduce shipping costs, IPU’s OilAlert sensor packages help ships’ engineers to predict and prevent…
Buses and trucks are only profitable when they’re transporting passengers or freight. The more time they spend being serviced or repaired, the less time they spend boosting company revenues. OilAlert helps reduce transport costs by minimising service stops and improving reliability. OilAlert monitors the quality of engine…
Effective oil analysis in power generation is essential. Some generators can operate 7 days a week. Whether a generator is powered by diesel, waste gas, natural gas or even the wind, uptime is critical. Their profitability depends on reducing service costs and downtime. Avoiding service and analysis disruptions is important.…


text:
Here’s how it works…you tell the kids you’re going on a boring business trip, drop them off at the in-laws and then head to the parks for an “adults-only” week of fun. Whether you’re going with your significant other or taking a group of your best girlfriends, here are a few tips to have as [...]
- Disney World, Universal & SeaWorld Orlando Planning for April
- Best Time to Visit Disney World in 2014
- What's Coming to Disney World, SeaWorld & Universal in 2014
- How Much Planning Should You Do for a Disney Vacation?
- Our Disney Tickets Are 100% RFID and FastPass+ Enabled
- How To Use FastPass+ at Disney World in the Parks - Step By Step
- Where to Stay - The Frog Family's Favorites
- Disney World FastPass+ Tips and Touring Plan Strategies
- 10 Advanced Dining Reservations (ADRs) Worth Making for Your Family
- Disney World Shopping: The Top 5 Places (and Then Some)
- Disney World Character Dining ... The Pros and Cons Plus Photo Tips!
- Universal Reveals Tantalizing New Details About Hogwarts Express
About Undercover Tourist

domain: travel


I have an HP ML110 and inside there are two SAS ports on the mobo. Port 1 is being utilized by the plug that came with the server and it serves four different SAS drives (see pic).
There is a second SAS Port that is open and ready for another SAS connector to service 4 more drives. The tag on the current connector says "HPE Spare PN: 791719-001"
When I search for an additional spare SAS connector I get $300+. Is that correct? Certainly there's a cheaper alternative to expanding from 4 drives to 8?


text:
Campsite hiking in centre of Penzance, camp site with fishing in the centre of Penzance and outdoor activities camping in Penzance town centre. Online directory with camping golfing Penzance UK.
Find caravan sites fishing in Penzance town centre. Campsites with bike in Penzance. Adventure caravan park, campsites cycling and activity campsite central Penzance, West Cornwall

domain: hobby


text:
Algood provides the caster solutions to meet your needs.
Low Profile + High Capacity
Our Mighty Maxx™ caster packs a punch while keeping a very low profile. It combines impressively low overall height of 3-5/8” with an equally impressive 1750 lbs. of capacity.
The Mighty Maxx has been engineered for maximum strength. It is manufactured using a work-hardened proprietary steel composition that adds both durability and longevity. A stabilizer added to the front of the yoke strengthens the caster, creating front-to-rear load balance and preventing the caster from failing when subjected to shock loads. In addition, the caster comes with a rollover emboss top plate that features a deep draw curl to add capacity and prevent bending. Even better, the plate is fastened with an M8 nut for quick assembly.
Mighty Maxx comes with dual 2-3/8” x 1-3/8” RollX™ wheels equipped with roller bearings. Made from a proprietary thermoplastic nylon glass fill material, RollX wheels require minimum effort to roll with heavy loads. They withstand hard impacts, are non-marking, do not absorb water and are resistant to most chemicals, solvents, gases, acids and steam cleaning.
Two wheels add capacity and make the caster easier to maneuver. When turning, one wheel pivots, making it almost effortless to navigate curves and corners.
The Mighty Maxx is finished using corrosion resistant zinc with a yoke and raceway that are heat treated. It is available with a thumb screw brake (TSB) and you can order matching rigid casters.
Produced right here in our manufacturing facility just outside Toronto, this caster is a model of North American design and ingenuity. It’s available with reasonable lead times, dependable delivery dates and is backed by our 3-year No-Excuse Warranty.
It’s perfect for heavy duty professional equipment, business machines, industrial automatic dispensers, food/drink dispensing machines, appliances as well as freezer and refrigerator showcases.
If you have an application that needs maximum strength but minimum height, you should be looking at Mighty Maxx™. Find out more from your local Algood representative or a member of our customer service team.
Download the Mighty Maxx™ catalogue page for plate choices and all the specifications
Algood is proud to manufacture its casters and wheels right here in North America. With our fully integrated manufacturing facility in Toronto, we are leaders in quality and innovation. For more information on Algood’s casters and capabilities, visit ourwebsiteor send us anemail, or call us at 1-800-254-6633.

domain: design


text:
When the varsity boys of the Eastlake Lacrosse team arrived at Camp Casey on a Friday in early March, they stored their phones so they couldn’t access their social media for the weekend.
“It’s just great to get away. You take away all of their phones, and they’re stuck with each other,” said. Eastlake Head Coach Jason Montoya. “It’s good for the boys. They’re forced to hang out.”
Around two dozen high school players of the Eastlake team, also known as the Wolves, spent a weekend at Camp Casey honing their skills and bonding as a team. They were preparing for a 20-game season against teams in King County, Snohomish County, and Oregon. The lacrosse team is not affiliated with Eastlake High School in Sammamish, Washington.
“It was a good way to break away from the normal routine,” said Ron Ortloff, vice president of Eastlake Lacrosse, whose son, Tyler, competes on the team. “The weekend on Whidbey helped the players jell as a team.”
Lacrosse is the oldest team sport in North America, according to USA Lacrosse. The sport dates to the 17th century and originated in Native American communities. High school boys in Washington state compete in the Washington High School Boys Lacrosse Association, while girls compete in the Washington Schoolgirls Lacrosse Association.
Amid the practices and exercising that took place on the open parade field at Camp Casey, teammates spent the evenings roasting marshmallows and making s’mores at the burn pits located near the water, sleeping in the dormitories, enjoying meals prepared on site, and engaging in other team-building activities.
Montoya added that visiting Camp Casey for the weekend was a great way for the kids to get away from the world.
The Wolves enjoyed considerable success in the years before the pandemic. They won the Lacrosse 4A State Championships in 2018 and again in 2019. COVID-19 prompted officials to cancel the 2020 season. In 2021, Eastlake was undefeated for the season, but the championships were canceled because of the pandemic, Ortloff said.
The boys varsity team kicked off its season with a loss to O’Dea on March 12, and then a victory against Seattle Prep on March 16.
More than a high school boys team, the Eastlake Lacrosse program has more than 250 players from kindergarten through high school. The organization also has a girls team, and the numbers of kids competing have increased.
For more information, go to www.eastlakelacrosse.org.
Camp Casey Conference Center is the perfect location for an inspiring group getaway to Whidbey Island, Washington. Ideal for sports camps, church groups, outdoor education camps, summer camps, and other nonprofit endeavors, Camp Casey provides overnight accommodations and food service for groups large and small. Send us an email today to get the conversation started on rates, dates, and your next adventure at firstname.lastname@example.org.

domain: news


text:
Syfy released the first images and trailer for “Dominion” (via TVLine, which premieres Thursday, June 19 at 9/8c. It looks like a cheesy cross between that defunct “Wonder Woman” series and some lame superhero movie.
It’s based on characters from the 2010 feature Legion, taking to the year 25 A.E. (After the War of Extinction) when an army assembled by the archangel Gabriel (played by Carl Beukes) wages a war of possession against mankind’s survivors. In that fight, the archangel Michael (300‘s Tom Wisdom) sides with humanity, against Gabriel.
It also stars Christopher Egan (Kings), Roxanne McKee (Game of Thrones), Alan Dale (Lost), Anthony Stewart Head (Buffy the Vampire Slayer), Langley Kirkwood (Generation Kill), Shivani Ghai (EastEnders) and Luke Allen-Gale (The Borgias).
AROUND THE WEB
this week in horror
This Week in Horror - October 9, 2017 - Cynthia, Halloween, As...
Bill Moseley and Sid Haig reunite for a new project, we’ve got an update on the new Halloween movie, and Bruce Campbell is making us very excited about Ash Vs Evil Dead season three!
More in Images
ITN Distribution and Millman Productions have released the first photos from their first co-production,...
Netflix just shared a brand new image and featurette for Bright, the latest film from director David...
Wrong Turn 2 director Joe Lynch brings Steven Yeun (“The Walking Dead”) and Samara Weaving (“Ash vs....
Austin-based Paper Street Pictures announced today that production is now underway on the horror-comedy...


text:
A picture book named “Moving Away,” written and illustrated by Ji Yeon Lee and published by NC’s nursery school—the Laughing Peanut—in October 2022, was awarded a Special Mention in the Fiction category at the 2023 Bologna Ragazzi Award. The Bologna Ragazzi Award is considered the Nobel Prize equivalent for picture books, and it chooses its winners from the Bologna Children’s Book Fair, the world’s largest event of its kind. The Special Mention in the Fiction category is awarded to books that demonstrate exceptional creativity and artistry in addition to their content and editing. “Moving Away” is a picture book that showcases the value of diversity through the eyes of small things hiding around the world.
As a child, you may have encountered a swarm of ants at some point in your life. Perhaps you followed their trail or even disrupted their orderly march. “Moving Away” is a captivating picture book that takes readers on a panoramic journey through the peaceful and tumultuous adventures of ants, injecting imagination into nostalgic memories of the past.
The story takes place in an ordinary yard, illuminated by the warm rays of the sun. Here, the ants assemble one by one, commencing their great migration. The story begins from the viewpoint of a child who observes the activities of these ants. By paying close attention to the minute details of the ant trail, you can observe how they move in coordination with one another. At times, the movements are seamless, while at other times, their journey is fraught with challenges. Despite moments of relief, they also face moments of crisis along the way. Through the chain of events the ants undergo, readers gain a unique perspective on the existence of the tiny, often overlooked creatures in the yard. Moreover, readers come to appreciate that by shifting one’s perspective, a completely new world can emerge from the same scene.
Although the story primarily unfolds from the perspective of a child observing the ant march, readers also get to experience the world through the enlarged images from the ants’ point of view. In the last chapter, the yard is depicted from a distance, providing readers with a glimpse of the location where the ants’ challenging journey took place. The story implies that while the yard may appear small and peaceful to some, for others, it represents a vast and challenging world, conveying the message that readers should view the world through multiple perspectives.
Ji Yeon Lee, the author and illustrator of “Moving Away,” described her inspiration for the book as follows: “There is no fixed interpretation for picture books; A always has to be A, and B can never be C. Anyone is free to interpret and imagine, and share their thoughts with others. My intention was to convey the significance of diversity through a story and illustrations featuring ants that people of all ages and ethnicities can relate to.”
“Moving Away” was highly praised for its exceptional book editing when it received the Bologna Ragazzi Award. The judges described the book as an “invitation to appreciate the significance of the little things.”
To better portray the peaceful yet intricate movements of the ants, “Moving Away” was created in the form of a folding screen instead of a conventional picture book. While readers can turn the pages of the book as they would do with a typical publication, they also have the option of unfolding the pages to create a vast panorama and explore the scene in greater detail. Some scenes in the book depict the ants as unseeable or scattered, while others show them clustered together, creating a more dynamic representation of their movements.
“Moving Away” intentionally eschews written language in favor of a series of images, allowing readers to focus on the panoramic journey of a swarm of ants. To facilitate this, the book’s background is kept monochromatic, drawing the eye to the ants and enabling readers to use their imaginations to fill in the details of the world around them. The ants themselves are depicted in black, standing out starkly against a vibrant orange backdrop. This striking color contrast serves to emphasize the ants’ significance and convey the depth of their tiny world. The book’s creators opted to use hanji, a traditional Korean paper known for its durability and distinctive texture, to give the book a unique and memorable feel.
As the Laughing Peanut prioritizes the value of joy in its brand philosophy, it has been consistently publishing picture books that convey values relatable to both children and adults. Along with “Moving Away,” which won the 2023 Bologna Ragazzi Award, the Laughing Peanut has been acknowledged at various international book fairs. For instance, “Would You Like to Come with Me?” was a recipient of the 3rd Little Hakka International Picture Book Award in 2019, while “The Chimney Ghost” and “I Am a Cat” were selected as featured books for the Korean Collective Stand at the 2019 Guadalajara International Book Fair. Since 2015, the Laughing Peanut has published over ten picture books that incorporate educational content amassed through the management of an in-house daycare center and developmental expertise gained through the in-house foreign language program, NC CONGCONG. Keep an eye out for upcoming picture books from the Laughing Peanut that will creatively convey the importance of future generations through collaboration with talented writers.


text:
I am so excited about these cookies. I love them. I knew I would. They contain two of my favorite ingredients: coconut and almond. They were really, ridiculously easy to make too. I know some recipes call for whipped egg whites, but this one just requires dumping all the ingredients into a bowl and mixing. I doubled the recipe with no problems. Here is the actual recipe I used: Soft Coconut Macaroons.
These are delicious. Of course, I had to have 1 or 2 to taste test. They’re slightly crisp outside but really soft and chewy inside. Yum. I love coconut. and the chopped almonds break up the texture nicely. They’re going to make a great addition to my gift packages. Brent’s review: “The macaroons are pretty good. I wasn’t sure if I would like it, but I was pleasantly surprised.”
This storm stinks. My brother is stranded after his flight got cancelled in Philadelphia and there is a good possibility that my friend flying from New England home for our reunion tomorrow will not make it in on time either. I hope everyone who is dealing with this weather stays safe and warm.

domain: food


text:
This colored pencil painting was inspired by the irises in our front yard. Our Siberian iris have been multiplying like crazy, so we moved some from the back garden to the front. Along with them, we planted a German (bearded) iris of unknown color (it was a freebie). When bloom time came in May, the German was yellow, which is a nice complement to the bluish purple Siberians.
Presenting a floral painting is a great opportunity to offer these words of Jesus:
“Consider the lilies of the field, how they grow: they neither toil nor spin, yet I tell you, even Solomon in all his glory was not arrayed like one of these. But if God so clothes the grass of the field, which today is alive and tomorrow is thrown into the oven, will he not much more clothe you, O you of little faith? Therefore do not be anxious, saying, ‘What shall we eat?’ or ‘What shall we drink?’ or ‘What shall we wear?’ For the Gentiles seek after all these things, and your heavenly Father knows that you need them all. But seek first the kingdom of God and his righteousness, and all these things will be added to you.” Matthew 6:28-34 ESV.
Irises – A German in Siberia was done with colored pencil (Museum Aquarelles and Polychromos) on Stonehenge paper and is 14″ x 11.”
February 20, 2016 at 2:16 am
February 20, 2016 at 6:11 am


text:
SunLit Interview: In “Slow Arrow,” Kathryn Winograd wove threads of her mother’s voice
The author wrote the essay "Skyglow," one of the last in her collection, after her mother moved to Colorado and they developed a "companionable routine"
SunLit Excerpt: In “Skyglow,” a look to the heavens for beauty and meaning
Author Kathryn Winograd's selection from her book of essays, “Slow Arrow: Unearthing the Frail Children,” melds the mysteries of the night sky with the search for truth
For Colorado fence-sitters like me, the coronavirus reinforced a love for our equine companions
Colorado authors, thinkers and readers share their thoughts on living through historic times as the state fights the progress of coronavirus
We asked you to Write On, Colorado during the coronavirus. You delivered.
Readers shared their feelings and experiences through the first year of a pandemic. Here's a selection of some of the most memorable submissions.
From toys to totems, an exploration of how we perceive — and imitate — the animals around us
In this essay from the collection "Mechanical Animals," the author delves deep into the ways that animals inspire everything from brands to high-tech medical instruments

domain: library


text:
Particular shark bracelet, makes you more characteristic.
Made of Titanium steel, very bright appearance and will never fade.
Using polishing process, the bracelet emits brilliant metallic shine.
Big heavy metal, with rough shark design, very punk rock style.
ChloBo MBCRDB579 Women's Sparkle Sun Bracelet MATERIAL - 925 Sterling Silver SIZE - All of our Womens bracelets are handmade to 18cm but as our beads vary there may be some slight variation in this measurement. WARRANTY - Faulty products will be replaced under your 12 month warranty, any accidental damage / breakage can be repaired at a small charge. Pretty yet powerful the Sparkle Sun bracelet has been uniquely handcrafted with 925 sterling silver and rose gold plated faceted sparkle hoop and mini disc beads. Representing the strength of the woman who doesn’t give up and understands great achievements. This beautiful piece will really stand out alone or mixed into a stack. We are a ChloBo UK authorised dealer Brand new stock with full retail boxes & paperwork 1 Year Warranty


text:
Hemoptysis can be caused by diseases of the airways, particularly bronchitis or bronchiectasis. Other causes include bronchogenic carcinoma, metastatic cancer or bronchial carcinoid. Kaposi's sarcoma involving the airways may cause hemoptysis in patients infected with HIV. Hemoptysis can also arise from the lung parenchyma. Autoimmune diseases (such as SLE, mixed connective tissue diseases, etc.), cocaine inhalation, and infections (including tuberculosis, bacterial pneumonia, and lung abscess), as well as pulmonary embolism, pulmonary arteriovenous malformation, mitral stenosis, severe left heart failure, and Wegener's granulomatosis should also be included in the differential diagnosis of hemoptysis.
Teaching topics from the New England Journal of Medicine - Vol. 358, No. 6, February 7, 2008

domain: biology


The Indian car market is slowly getting populated by more and more models, but there are still some models that are sold abroad that have not yet made it to India. We take a look at some practical cars for India that if launched here, will likely catch the fancy of buyers in the volume segment.
These are not very expensive cars and for the most part can be priced very competitively at between Rs. 5 lakh and under Rs. 15 lakh. These cars are selling reasonably well abroad and should do well in India too, if launched here, especially as most of them are focussed on the entry-level end of the market. Also read: Five cars we need in India now
Honda has just launched the N-One mini hatchback in Japan, and this car looks like it is perfectly suited for the Indian market as well. It can slot in under the Honda Brio and directly compete with Maruti’s Wagon-R. The car has a cute design, with boxy retro-styling, which is quite practical, as it frees up quite a bit of interior space, just like the Wagon-R. The car is available with two 660 cc petrol engines in Japan, which is extremely fuel-efficient, with a claimed efficiency of 27 kmpl. But in India, it could be fitted with Honda’s 1.2 litre Brio engine, which should make it even more desirable. Price it at Rs. 3.5 lakh to Rs. 4.5 lakh and Honda has a winner on its hands. Also read: New cars from Honda in the next 2 years
The Skoda Citigo is Skoda’s version of the Volkswagen Up, which VW has said it is not immediately considering for India, although the car has been spotted testing here. The car is available in three-door and five-door configuration, the latter being more suited to the Indian market. It could be launched with the new 1-litre petrol engine it has that puts out 75 bhp of power and also the 1.2 litre diesel from the Skoda Fabia and Volkswagen Polo. If this car is priced between Rs. 4 lakh and Rs. 6 lakh, Skoda can get back in the game with a nice small hatchback.
The Fiat Panda is a car that Fiat is seriously considering for India, but there has been no news on when it will eventually launch the car here. The Panda has been a successful car in Europe, and if launched in India, would probably sell alongside the Punto, a strategy that would give Fiat better coverage of the premium hatchback market with more models. The Panda is a spacious hatchback with plenty of interior space. It is very stylish and the interiors look really good. Internationally the Panda has a choice of six engines and a 4×4 option as well, but in India, Fiat would do well to consider a simple petrol and diesel engine choice to stay price competitive. If the Panda can be priced between Rs. 5.5 lakh and Rs. 7 lakh, it would offer buyers of the Hyundai i20 and Maruti Swift better choice.
Maruti has seen success with the Ertiga, a vehicle that was developed specifically to be a seven-seater multi-purpose vehicle. However, it’s not spacious enough. If Maruti wants to get into the volume segment, it should consider the Suzuki APV, a multi-purpose van that can easily seat seven, and is quite spacious. This vehicle can directly compete with the Mahindra Xylo and Nissan Evalia, and knowing Maruti’s localization capability, it could be competitively priced. The Suzuki APV is a seven-seater, multi-purpose vehicle that’s sold with a 1.6 litre petrol engine (same as the SX4’s engine). In India, Maruti could also offer it with the 1.3-litre multijet diesel – in the same state of tune as the Ertiga. It could be priced between Rs. 7 lakh and Rs. 9 lakh, to compete with Chevrolet’s upcoming Enjoy.
The Ford Focus is a car that would give Ford a competent product to sell in the Rs. 10 lakh to Rs. 14 lakh price segment, just above the Ford Fiesta. It can compete with cars like the Toyota Altis and Skoda Laura. The Focus can slot in just below the Ford Mondeo, a car that Ford may likely bring back to India as well. The Focus is available internationally with an EcoBoost petrol engine (1.6 litre) and a 2-litre diesel engine. Both these engines would do well in India. The diesel puts out close to 160 bhp, while the petrol 1.6 EcoBoost also puts out the same power in the European market. Also read: Five car types India deserves
These are some cars that would do well in the budget end of the market if launched in India. Share your thoughts on them.


text:
- Reforms to the criminal justice system
- Measures to improve women’s safety
- Prevention of violence against women and girls
Seema Malhotra MP, in response to her appointment, said: "I feel very proud to have been appointed as the Labour Party’s first ever Shadow Minister for Preventing Violence Against Women and Girls. It is significant that Labour has made this issue such a priority and I look forward to working with colleagues to try and make a real difference to women who have experienced huge trauma in their lives. The level of violence against women in Britain and indeed the world is shocking and too little is being done to prevent these crimes, support the victims and bring the perpetrators to justice. I will be looking to change this and look forward to working with Ed and Yvette to make sure a Labour Government offers a real alternative to women and children trapped in cycles of violence."
Labour leader Ed Miliband commented: "I am delighted that Seema has agreed to become Labour’s first ever Shadow Minister for Preventing Violence against Women and Girls. She undoubtedly brings real expertise to this important role. Her appointment is another indication of the importance a Labour government will place on tackling violence against women and girls. Yvette has rightly put this at the heart of her vision for the Home Office and I look forward to continuing working with her and Seema to ensure a Labour government can make a real difference to the lives of the victims of these terrible crimes."
Shadow Home Secretary Yvette Cooper, commenting on the appointed, said: "Seema will be a huge asset to the Shadow Home Affairs team. She has always been a champion of women’s equality – from her campaigns promoting the work of women in business, to her hugely successful Presidency of the Fabian’s Women’s Network, which has done so much to improve representation of women and ethnic minorities in politics and public life. I know she will bring all her experience and energy to lead our important work developing a strong policy platform to tackle violence against women and girls."

domain: sociology