text:
ReviewGist App
Read reviews on the go.
Highly adjustable stand, Great port selection
Accurate colors, Ergonomic stand, USB hub
Fully adjustable stand, Built-in USB hub
Great monitor
Wide viewing angle
Great IPS monitor
Rich vibrant performance
Good color and viewing angle performance.
Fastest response times of all the IPS monitors
Stylish cabinet design, Responsive touch screen
Great looking monitor with excellent picture, and great price
Sleek design, Great color and viewing angle performance
The most perfect display
Presentations and games look better
Very good viewing angle, Displays smooth gradients
If you find ReviewGist useful let us know by liking our Facebook page below.
ReviewGist helps you find the best products to buy by making sense of online reviews.
We are currently aggregating 374,040 reviews
covering over 29,393 products. See what the press says about ReviewGist here.
Best Smartphones under Rs. 10,000
© 2007-16 ReviewGist.com. All Rights Reserved.


text:
Contact Us Home Groups Privacy Policy Site Map © 2012 Downtown Kalamazoo Inc.
As the weather warms up, spring is a great time to stroll through downtown and pop into boutiques, museums, and restaurants. Check out all that downtown has to offer in our downtown shopping and dining guide.
More Information
Experience world-class pianists right here in Kalamazoo during the biennial Gilmore Keyboard Festival from April 26 - May 14. Performers include Imogen Cooper, Bruce Hornsby, and Tony Bennett.
There are so many good reasons to come downtown all year, but our events are especially enticing! Check out the full calendar of events for 2016 and make your plans to come down!
In a recent Encore magazine article, downtown Kalamzoo is highlighted as "the place to be" for residents and businesses alike. Recent years have brought significant interest and growth to downtown with residential units downtown at 98 percent occupancy and long waiting lists.
Read the whole story here.

subset: commoncrawl


text:
|Publication number
|Publication type
|Application number
|Publication date
|Feb 18, 2003
|Filing date
|Aug 23, 1999
|Priority date
|Aug 23, 1999
|Fee status
|Publication number
|Albert T. Montroy, Eric C. Graves, Douglas M. Dyer
|Original Assignee
|Harris-Exigent, Inc.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (9), Referenced by (48), Classifications (12), Legal Events (6)
|External Links: USPTO, USPTO Assignment, Espacenet
(Not Applicable)
(Not Applicable)
1. Technical Field
This invention concerns a method for locking of critical memory regions in a multiple workstation environment utilizing shared data.
2. Description of the Related Art
Satellite ground stations today are required to process and distribute more data from even more space vehicles (SVs) than ever before (or even imagined). In the past, a ground station would have a single SV in view at any given point in time or in the case of a station supporting geosynchronous systems, separate hardware systems dedicated to a single SV would perform the isolated processing to determine vehicle state. Newer satellite constellations containing up to 80 SVs are being supported by ground stations consisting of up to 50 workstations, which are constantly sharing data, and performing activities that must be serialized among all processes on all the workstations.
The multiple workstation environment described above results in a distributed system where the shared data is typically replicated within the context of each workstation's memory. The distributed memory and processing creates critical regions that must be protected such that only one process can operate in a critical region at a time. These critical regions may be shared data or instructions to be executed. The problem in guaranteeing a process solitary access to a critical region in a distributed environment is called distributed locking. Significantly, the problem is not unique to the satellite command and control environment and can be encountered in any distributed system of workstations utilizing scarred data.
Distributed locking is the concept of guaranteeing serialized access to a critical region in a multiple processor environment where each processor is operating within the context of it's own memory and cannot access the memory of another processor. For the purpose of understanding the present invention, it is helpful to understand some lock specific terminology as will be used herein. For example a "request" is a solicitation to be granted a lock for access to a critical region. A "grant" is an issuance of a lock in response to a lock request. A "holder" is an instance of a process or thread that has been granted a lock and has not yet released the lock. Finally, a "release" is the act of freeing the lock so that other requests for that lock may be granted. A release is typically performed when access to the critical region is no longer required.
One of the problems associated with distributed locking concerns efficient lock granting. In particular, a difficult obstacle to overcome in designing a distributed locking system is minimizing the amount of work involved in granting a lock. Most solutions for distributed locking typically present an algorithm for lock granting that has a complexity of N2 where N is the number of workstations (nodes) in the system. This means that each time a lock is granted there are N2 inter-process messages or communications between the different nodes to agree on the granting of the lock. In distributed systems, where there is already a lot of network traffic, this solution is inefficient and prohibitive to real time processing. The cost of obtaining a lock grant can exceed time critical windows in which the lock must be granted. The reason for the high amount of communication is to ensure that each node in the system agrees on the state of the lock. There are other algorithms which require a lower number of interprocess messages or communications between different nodes in order to agree on granting the lock. For example, one such system has a complexity of N, where N is the number of nodes in the system. While these alternatives are less expensive in terms of messaging traffic requirements, there are tradeoffs associated with such system as concerns recovering from network or communication failures.
Deadlock is another problem associated with any distributed resource such as locks. Deadlock is a state where no forward progress can be made due to contention for a specific resource. In the case of distributed locks, deadlock is most common in when request is made for a lock that will not be released by a previous holder of the lock. The absence of a release may be due to several different reasons. For example (1) the holder process may have terminated abnormally, (2) the holder process may have deliberately not released the lock, or (3) the node on which the holder process is running may have lost connectivity on the network.
Another problem encountered in distributed locking systems relates to recovery from network failures. a failure in the network can cause a node or group of nodes to become isolated. The loss of network connectivity usually results in either locks that will never be granted until the network is connected again or an expensive process of re-establishing the lock resources when the failure is corrected.
If locks are not granted because of a network failure, the result can be deadlock, reduced performance, or the inability to perform time critical tasks that require the granting of locks. The process of re-establishing lock resources upon regaining connectivity to isolated nodes is very often expensive requiring that all nodes once again communicate with all other nodes to determine the state of the lock. This again is typically an N2 algorithm, where N is the number of nodes.
Yet another problem with distributed locking systems concerns static lock definitions. In particular, most solutions to the distributed lock problem involve the pre-runtime or static definition of all locks in the system. This means that prior to system startup all locks are usually defined and while the system is running no new locks may be created. This can be burdensome in circumstances where it is necessary add functionality to a system, particularly where system downtime must be minimized. For example, if the need for a new/undefined lock to perform a time critical task is needed, then with static lock definitions this could mean brining the distributed system down and restarting. The act of stopping and restarting the system can take an excessive amount of time that a real time system cannot afford.
The present invention concerns a method for dynamic distributed memory locking in a computer network. According to the method a local lock process executing on a node receives from an application program a lock request for exclusive access to a memory location. The lock process identifies a first lock process executing on any node of the network that is currently a designated lock manager for granting locks for the particular memory location for which the lock was requested. Subsequently, the local lock process requests from the designated lock manager a lock for the particular memory location. Finally, the local lock process notifies the requesting application program when a lock has been granted by the lock manager.
The method can further include the step of designating a local lock process executing on a selected node as the lock manager when no lock manager is currently designated for the particular memory location for which a lock has been requested. The application program and the local lock process can both be executing on the same selected node, but can also be executing on separate nodes.
According to another aspect of the invention, the method can include the step of determining whether an option to create a lock manager is enabled prior to designating the local lock process as the lock manager, and causing the lock request to fail if the option is not enabled. This feature permits a user to control the operation of the distributed locking system by limiting the complexity of a return to connectivity situation after nodes have been disconnected.
According to another aspect of the invention, in response to detecting a loss of connectivity with a node, a local node can determine whether a disconnected lock process executing on the disconnected node has been designated as the lock manager for any the particular memory location. In this situation the local lock process updates a lock manager file to remove the designation of the disconnected lock process as lock manager for the memory location.
Upon detecting a return of connectivity with any node which is a lock manager, the method further includes the steps of determining whether any conflicting lock manager designations exist with a local list of lock managers and resolving conflicting lock manager designations by a priority designation assigned to each network node. The priority designation is preferably a statically assigned enumerated value which permits a higher priority node to be reassigned responsibility as lock manager upon a return to connectivity.
According to another aspect of the invention, any lock which has been granted by a lock manager can be treated as terminated after a predetermined period of time. However, the system provides users with a further option so that after the predetermined period of time has expired, a lock process requesting a new lock will continue to wait for a release of the previously granted lock to occur before accessing the memory location which is the subject of the existing lock.
The invention can also include a computer network having a dynamic distributed memory locking system. Programming is provided for receiving from an application program a lock request for exclusive access to a memory location; for identifying a first lock process executing on any node of the network that is currently a designated lock manager for granting locks for the memory location; for requesting from the lock manager a lock for the memory location; and for notifying the application program when a lock has been granted.
Suitable programming is similarly provided for designating a local lock process executing on a selected node as the lock manager when no lock manager is currently designated for the memory location. According to one embodiment, the application program and the local lock process are both installed and execute on the selected node. However, the application program and the local lock process can also be executing on separate nodes, and the invention is not intended to be limited in this regard.
According to another aspect of the invention, programming is provided for determining whether an option to create a lock manager is enabled prior to designating the local lock process as the lock manager. In that case, programming is also preferably provided for causing the lock request to fail if the option is not enabled and no lock manager is currently designated.
According to yet another aspect of the invention, programming is provided which is responsive to detecting a loss of connectivity with a node. Such programming is configured for determining whether a disconnected lock process executing on the disconnected node has been designated as the lock manager for the requested memory location. If so, the system updates a lock manager file on the local node to remove the designation of the disconnected lock process as lock manager for the memory location.
Finally, the computer network system preferably includes programming responsive to detecting a return of connectivity with any node which is a lock manager. Such programming determines whether any conflicting lock manager designations exist by comparing the connecting node's lock manager file with a local list of lock managers. In addition such programming preferably resolves conflicting lock manager designations by a priority designation of each network node. The priority designation is preferably a statically assigned enumerated value. However, it will be appreciated that the invention is not limited in this regard and other priority designation schemes may also be used.
There are shown in the drawings embodiments which are presently preferred, it being understood, however, that the invention is not limited to the precise arrangements and instrumentalities shown, wherein:
FIG. 1 is a block diagram showing a set of network nodes.
FIG. 2 is a flow chart showing a lock request flowchart for the network of FIG. 1.
FIG. 3 is a flow chart showing a deadlock avoidance flow chart for the network of FIG. 1.
FIG. 4 is a flow chart showing a loss of connectivity flowchart for the network of FIG. 1.
FIG. 5 is a block diagram of the network nodes in FIG. 1 when connectivity is lost.
FIG. 6 is a flow chart showing a return to connectivity for the network of FIG. 1.
FIG. 7 is block diagram of the network nodes in FIG. 1 showing a return to connectivity.
FIG. 8 is a flow chart showing lock creation for the network of FIG. 1.
The present invention provides lock granting with a complexity of 1. The complexity of 1 indicates that there is only one inter-process message needed to request a lock and the number of communications is not related to the number of nodes in the system. The Fault Tolerant Dynamic Distributed Locking accomplishes the low level of complexity for lock granting by designating only one node as the "Lock Manager" for that lock. All nodes can be managers of different locks but there is only one manager per lock.
FIG. 1 shows a computer network system 12 with four computer network nodes 10. Each node 10 includes a lock process 16 and can also include one or more additional processes 18. Each lock process 16 can also be a lock manager which can manage one or more locks. For example, in FIG. 1, the manager of the critical table memory is node A. Similarly, the lock manager for the critical data memory is node B, and the lock manager for critical procedure memory is node C. Node D in FIG. 1 is part of the computer network but is not designated as a lock manager.
As shown in FIG. 1, the lock manager information is kept up to date in each node throughout the system. In particular, each node 10 has a lock manager file 14 showing the respective node associated with managing each lock. According to a preferred embodiment, a lock is managed by the node on which the lock is first created. Further, a lock will preferably always be managed by the same node unless the same lock is recreated during a network failure on a node that cannot communicate with the current manager.
Referring to FIG. 2, a process 18 executing on any node 10 which requires a lock will issue to its local lock process 16 a lock request relating to particular data or files. The lock request is received by the lock process 16 in step 20. In step 22, the lock process determines from its lock manager file 14 whether any lock process on an existing node 10 has been designated for managing locks for the particular data or file indicated. For example, if process 18 on node C in FIG. 1 requires a table lock, then in step 22 the lock process 16 for that node would examine its lock manager file 14 and determine that table locks are managed by the lock process 16 on node A.
If it is determined in step 22 that a lock process 16 has previously been designated as lock manager for a particular file or data, then a lock request is sent in step 24 to that designated lock process. Thus, the lock process 16 on node C in the foregoing example would send its request for a table lock to the lock process 16 on node A. If the node requesting the lock is the same node which manages the requested class of locks, then the lock process 16 for that node preferably proceeds to directly process the lock request. In either case, the lock process 16 on the node requesting the lock waits in step 26 for confirmation that the requested lock has been granted by the lock manager. If a message is received from the lock manager indicating that the requested lock has been granted, then the process 18 which initiated the lock request is notified in step 28.
If in step 22, it is determined that no lock process 16 is designated as lock manager with regard to a particular type lock request, or that designated lock process 16 is not otherwise available, then a determination is made in step 30 whether a create option has been enabled. If so, then the local lock process 16 is designated in step 32 as the lock manager for the requested lock. In step 34, the create lock manager option is disabled and the lock request is resubmitted at step 20. Now, in step 22, the lock process 16 will determine that it is the lock manager for the requested data or file and the process will proceed as previously described relative to steps 24, 26 and 28. In step 30, if the user has disabled the create option, the lock request will simply fail in step 36.
Those skilled in the art will recognize that any suitable messaging technique can be used for communicating lock requests and grants between nodes 10 comprising the network. For example TCP/IP messaging techniques or multicast can be used for this purpose.
FIG. 3 is a lock process 16 flowchart showing the way in which lock requests are processed when the particular lock process has been designated as a lock manager. Lock requests received from various nodes 10 are stored in a lock request queue for processing in step 40. In step 42, a determination is made as to whether a lock request is pending. If so, the process checks in step 44 as to whether a lock is currently granted for the relevant data or files. If no lock is currently granted, the lock process 16 will grant the request and will send a confirming message in step 46 to the lock process which originated the request.
Alternatively, if it is determined in step 44 that a lock is already granted, then in step 48 a determination can be made as to whether the current grant has exceeded a timeout period. If so, then the requested lock will again be granted in step 46 as described above. If the current grant has not exceeded the timeout then the process terminates in step 50 until the next lock request processing cycle.
As shown in FIG. 3, the problem of deadlock is preferably solved in the present invention with the use of a configurable lock timeout in step 48. The lock timeout, which is preferably configurable by the user, allows a lock to be granted for other requests after the configurable. amount of time has passed, regardless of a release from the holder.
The user of the distributed locking system also preferably has the ability to use or ignore the timeout associated with locks via the logic in the processes that make use of the locking interfaces. The ability to ignore the timeout mechanism allows the user more control to tailor the locking to the specific needs of the system. If a timeout on a lock grant occurs, the user can choose to ignore the timeout and attempt to ascertain the state of the holding process to maintain the integrity of the critical region prior to requesting the lock again. If the timeout is ignored and the user does not take the steps to query the state of the holder, then any deadlock that occurs as a result is considered part of the system design.
With the locking system as described herein, the loss of network connectivity will not result in the types of problems experienced by conventional systems. For example, the system prevents the occurrence of (1) locks that cannot be granted until the network is connected again or (2) a time consuming process of re-establishing the lock resources when a network failure is corrected.
FIG. 4 is a flowchart illustrating the steps performed by a lock process 16 when a loss of connectivity occurs among nodes 10 of network 12. In step 52, a lock process 16 detects loss of connectivity with other nodes of network 12. In step 54, a determination is made as to whether any of the disconnected nodes were designated as lock managers. If so, then the lock process 16 updates the lock manager file 14 in step 56 to remove any designation of those nodes as lock managers. It should be noted that once the lock manager file 14 has been updated in step 56, then step 22 in FIG. 1 will return a negative result for any lock request in which the disconnected nodes 10 were formerly designated lock manager. If in step 54, none of the disconnected nodes 10 include a lock process 16 which has been designated a node manager, then the process does not update the lock manager file 14 and the process is done at step 58.
As previously explained relative to step 30 of FIG. 1, the user has the option to permit a new lock to be created if the manager of the desired lock has become isolated from a particular node's view (and therefore deleted from the lock manager file in step 56). If the create option is enabled, then in step 32 the node 10 requiring the lock is designated the manager for that lock within the scope of that node's visible network.
FIG. 5 illustrates an example of a network where Nodes A and C lose connectivity with nodes B and D. For the purposes of improved clarity, processes 16 and 18 are not shown in FIG. 5. It will be noted that prior to the loss of connectivity, B managed the DATA_LOCK lock. After the loss of connectivity, the lock process on node C recreates the lock as described relative to FIG. 1 steps 22, 30 and 32. Referring to FIG. 5, the events or steps involved are as follows:
1. Nodes A and C lose connectivity with nodes B and D.
2. A process on node C request the DATA_LOCK lock but the request fails in step 22 of FIG. 1 because the lock no longer exists.
3. In step 32 the process on node C recreates the DATA_LOCK lock.
4. Node C sends a message to its visible network (in this case, node A) directing each lock process 16 to update its lock manager file 14 to reflect that node C is now the lock manager for DATA_LOCK.
When there are multiple managers for a single lock, a lock conflict results.
For the purpose of re-establishing lock resources when connectivity returns to the network, the dynamic distributed locking system of the present invention has an algorithm with N complexity, where N is the number of nodes in the network. According to a preferred embodiment, lock conflict resolution makes use of node priority to determine the true manager of the lock. Node priority is preferably a statically assigned enumerated value where each node has a unique priority. For example, node priority may be defined in a configuration file that is processed at system startup. The configuration file can contain the name of each node in the lock system and a corresponding priority. Each node preferably has a different priority and each node has the same view of the system with respect to the priority assignments in the configuration file.
In an alternative embodiment, node priority can be assigned simply by comparing the different node names through an alpha-numeric string comparison which always results in any two different nodes having a greater than/less than relationship. Those skilled in the art will appreciate that the foregoing methods for defining node priority are merely exemplary in nature and that the node priority assignments can be achieved through numerous means in the implementation provided that each node has a resulting unique priority assigned thereto for the purpose of resolving lock conflicts.
FIG. 6 is a flowchart illustrating the steps associated with a return of connectivity and resolution of lock conflict in network 12. In step 60 a lock process 16 detects connectivity with another node and exchanges lock manager file 14 data with the lock process 16 operating on such node. The system preferably detects nodes leaving or entering the network or locking system by means of a multicasted health and status message that is periodically sent out and received by each lock process on each node. This probing of the network allows the efficient detection of loss of connectivity, resumption of connectivity, or new nodes entering the network/lock system. The sharing of data or information between lock managers is achieved via interprocess communication, such as TCPIP point to point, multicast or any other suitable mechanism available for interprocess communication.
In step 62, for each lock managed by the other node, the local lock process 16 compares the other node's lock manager data to the local lock manager file 14. In step 62, if the local lock manager file 14 has no designation for the particular lock, then the other node's lock designation is used in step 70 to update the local node's lock manager file. However, if the local table also contains a designation for the same type lock, then the system proceeds on to step 64.
A determination is made in step 64 as to whether the designated lock manager in the local lock manager file 14 is the same as the designated lock manager in the other node's data. If the same node is designated, then the designation is confirmed and the local lock manager file 14 is not updated. However, if a determination is made in step 64 that the designated lock manager in the local lock manager file 14 is not the same as the designated lock manager in the other node's data, then the process proceeds on to step 66.
In step 66 a determination is made as to whether the lock manager designation in the local lock manager file has a higher priority than the other node's designation. If so, then the local lock manager file 14 is not updated. However, if the other node's designation has a higher priority, then the designation contained in the local lock manager file 14 is deleted in step 68 and the other node's lock manager designation is used to update the local lock manager file. The process in FIG. 6 preferably continues until data for each lock managed by the other node has been compared to the data in the local lock manager file.
In the example of FIG. 5, it will be appreciated by those skilled in the art that upon return of connectivity, node C shares its data with nodes B and D but not node A. The reason for this is that node C could always see node A, even during the network outage.
FIG. 7 depicts connectivity returning to the nodes shown in FIG. 5. For improved clarity, processes 16 and 18 are not shown in FIG. 7. In FIG. 7 if it is assumed that node C has a higher priority than node B, the time line of events listed below results:
1. Nodes A and C share their data with nodes B and D. Nodes B and D share their data with A and C.
2. Lock conflict for the DATA_LOCK is resolved locally on each node with C becoming the manager. No updates are needed on nodes A and C because they already had C as the manager of DATA_LOCK.
As shown in FIG. 8 the invention as disclosed herein preferably allows for the creation of any new, previously non-existent locks at runtime. This is called dynamic lock definition. Each lock is uniquely identified by its name and new locks with different names may be created without starting or stopping the system. In step 80, a lock process 16 receives a create lock request and subsequently determines in step 82 whether the requested lock already exists. If so, the system returns a "lock created" notification in step 88 and the process ends. If the requested lock does not currently exist, the lock process requests a system lock in step 84 and in step 86 sends a message to the lock manager (lock process) to create the new lock. In step 88, the process returns the "lock created" notification to the application which initiated the request.
The ability to create new locks at runtime is made possible by internally by using a "hidden" system lock that is created when the system is started. The serialization of lock created through this mechanism guarantees the uniqueness of the lock. The use of the system lock means that there will never be more than one instance of a lock in the "visible" system.
In order to implement the system lock, each lock manager process has a phased startup and defined states that correspond to those phases. As part of that phased startup each lock manager creates the CREATE_LOCK (the "hidden" system lock). Each lock manager subsequently shares its lock manager file information with the other lock managers. Once a particular lock manager has shared this information with other lock managers, that lock manager advances it's state to ONLINE.
The distributed lock system also has an associated state that is derived from the state of all the lock managers in the system. The entire distributed lock system advances to a LOCK_SYSTEM_ONLINE state only when all the lock managers in the visible/connected portion of the system are in an ONLINE state. Thus, if a previously disconnected nodes re-joins the network, the distributed lock system will temporarily revert to an offline state until after each lock process 16 in the distributed network has shared its lock manager information file 14 with the other lock managers and any conflicts as between lock managers have been resolved as previously described.
This phased startup concept at both the node and system granularity allows the lock system to prohibit user applications from performing any lock activity unless the lock system is in a LOCK_SYSTEM_ONLINE state. Thus, the LOCK_SYSTEM_ONLINE state is always a precondition for the distributed lock system performing any lock activity requested by an application. This restriction prevents the corruption of the distributed lock system when a new node/lock manager comes into an existing system or when connectivity returns to a network that has been disrupted. The derived state of the system provides protection during times when lock conflicts may occur and provides the system time to resolve the conflicts. It should be appreciated that within the lock system as described herein, the CREATE_LOCK is really no different than any other lock which the system creates except that the CREATE_LOCK is created, owned, used, and cared for internally with respect to the lock managers.
In view of the foregoing, it will be apparent to those skilled in the art that the present invention has advantages in all of the areas of distributed locking which present issues or obstacles in conventional systems. For example, the system provides the user with lock granting requiring only one interprocess message as opposed to the N2 or N (where N is the number of nodes) required by other solutions. This is very important in a distributed environment since it reduces the amount of traffic on the network and expedites the granting of locks, thereby keeping network traffic flowing without delay or interruption.
Further, because the system of the present invention provides a configurable timeout for locks, and inter-nodal communication regarding the holder of a lock, the problem of deadlock is avoided. The foregoing arrangement permits the user to configure the system to either issue subsequent grants with reliance upon the time-out system, or alternatively require processes to wait for a release on a lock to occur before receiving another grant.
The system also minimizes the impact of network or connectivity failures by limiting the amount of communication needed upon re-connection. The degree of difficulty involved in a network outage are also controllable by the user's choice to recreate or not recreate locks under such circumstances. In any case, when the network is reconnected, the reestablishment of the distributed lock system is optimized by only needing to communicate between those specific nodes where the lock data may have been conflicting.
Finally the system as described herein provides a further advantage in that locks may be defined at runtime. The ability to create new locks at runtime means that the system does not have to be stopped and restarted to add new locks. Since the stopping and starting of a distributed system may take time and detract from productivity, the dynamic creation of locks can be an important advantage.
|Cited Patent
|Filing date
|Publication date
|Oct 22, 1993
|Aug 23, 1994
|Digital Equipment Corporation
|Apparatus and method for ensuring that lock requests are serviced in a multiprocessor system
|Jun 22, 1994
|Oct 31, 1995
|International Business Machines Corporation
|High-performance, multi-bank global memory card for multiprocessor systems
|Aug 4, 1994
|May 28, 1996
|Panasonic Technologies, Inc.
|Method for updating value in distributed shared virtual memory among interconnected computer nodes having page table with minimal processor involvement
|Aug 25, 1995
|Oct 14, 1997
|System and method for restricting user access rights on the internet based on rating information stored in a relational database
|Jun 16, 1997
|Jun 15, 1999
|Telefonaktiebolaget L M Ericsson
|Lingering locks for replicated data objects
|May 2, 1997
|Nov 16, 1999
|Mangosoft Corporation
|Remote access and geographically distributed computers in a globally addressable storage environment
|Jun 27, 1996
|Apr 4, 2000
|Hewlett-Packard Company
|Creation and migration of distributed streams in clusters of networked computers
|Aug 28, 1998
|Aug 7, 2001
|International Business Machines Corporation
|Method and system for automatic detection and distribution of code version updates
|Mar 26, 1999
|Apr 30, 2002
|Hewlett-Packard Company
|Mechanism for implementing bus locking with a mixed architecture
|Citing Patent
|Filing date
|Publication date
|Apr 10, 2001
|Jun 1, 2004
|Hewlett-Packard Development Company, Lp.
|Method and a device for enabling intercommunication among user processes in a communication management system regardless of the availability of the user processes
|Sep 27, 2004
|Nov 25, 2008
|Ximeta Technology, Inc.
|System using a single host to receive and redirect all file access commands for shared data storage device from other hosts on a network
|Apr 22, 2004
|Jan 27, 2009
|Ximeta Technology, Inc.
|Scalable server architecture based on asymmetric 3-way TCP
|Oct 27, 2004
|Sep 15, 2009
|Hewlett-Packard Development Company, L.P.
|Method and system for processing concurrent events in a provisional network
|Jun 12, 2003
|Oct 6, 2009
|I See Tech Ltd.
|Method and apparatus for a multisensor imaging and scene interpretation system to aid the visually impaired
|Jun 3, 2004
|Dec 15, 2009
|Cisco Technology, Inc.
|Arrangement in a network for passing control of distributed data between network nodes for optimized client access based on locality
|Dec 29, 2009
|Advanced Micro Devices, Inc.
|Implementing locks in a distributed processing system
|Jun 12, 2006
|Jan 12, 2010
|Hewlett-Packard Development Company, L.P.
|Transactional shared memory system and method of control
|Feb 16, 2010
|Zhe Khi Pak
|Device and method for booting an operation system for a computer from a passive directly attached network device
|May 27, 2003
|Apr 27, 2010
|Harris Corporation
|System and method for propagating data
|Jul 22, 2005
|Jun 29, 2010
|Zhe Khi Pak
|Low-level communication layers and device employing same
|Aug 24, 2010
|Zhe Khi Pak
|Scheme for dynamically connecting I/O devices through network
|Oct 9, 2001
|Sep 7, 2010
|Zhe Khi Pak
|Disk system adapted to be directly attached to network
|Dec 7, 2010
|Zhe Khi Pak
|Disk system adapted to be directly attached
|Jan 6, 2006
|Dec 7, 2010
|Zhe Khi Pak
|Method and apparatus for storing and retrieving data
|Feb 23, 2006
|Dec 28, 2010
|Zhe Khi Pak
|Enhanced network direct attached storage controller
|Jan 11, 2011
|Zhe Khi Pak
|Disk system adapted to be directly attached to network
|Jul 24, 2008
|Apr 5, 2011
|Zscaler, Inc.
|Feature based data management
|Jul 17, 2012
|Oracle International Corporation
|Using local locks for global synchronization in multi-node systems
|Jul 28, 2008
|Sep 18, 2012
|International Business Machines Corporation
|Managing locks across distributed computing nodes
|May 10, 2012
|Dec 30, 2014
|Ori Software Development Ltd.
|Efficient distributed lock manager
|Dec 2, 2010
|Feb 3, 2015
|International Business Machines Corporation
|Locking access to data storage shared by a plurality of compute nodes
|Mar 20, 2001
|Feb 21, 2002
|Garrett John W.
|Service selection in a shared access network using dynamic host configuration protocol
|Oct 9, 2001
|Jun 6, 2002
|Han-Gyoo Kim
|Disk system adapted to be directly attached to network
|Apr 10, 2001
|Oct 17, 2002
|Thiam Wah Loh
|Messaging software offline agent
|Jul 15, 2002
|Jan 16, 2003
|Han-Gyoo Kim
|Scheme for dynamically connecting I/O devices through network
|May 27, 2003
|Dec 2, 2004
|Harris Corporation
|System and method for propagating data
|Aug 14, 2003
|Feb 17, 2005
|Raju Krishnamurthi
|Storing data packets
|Jan 5, 2005
|Jul 7, 2005
|Han-Gyoo Kim
|Virtual multiple removable media jukebox
|Feb 18, 2005
|Sep 1, 2005
|Han-Gyoo Kim
|Portable multimedia player/recorder that accesses data contents from and writes to networked device
|Feb 17, 2005
|Sep 1, 2005
|Han-Gyoo Kim
|Device and method for booting an operating system for a computer from a passive directly attached network device
|Jun 3, 2004
|Dec 22, 2005
|Turner Bryan C
|Arrangement in a network for passing control of distributed data between network nodes for optimized client access based on locality
|Jun 16, 2005
|Jan 12, 2006
|Han-Gyoo Kim
|Disk system adapted to be directly attached
|Jul 22, 2005
|Mar 2, 2006
|Han-Gyoo Kim
|Low-level communication layers and device employing same
|Aug 23, 2005
|Mar 30, 2006
|Han-Gyoo Kim
|Method and apparatus for network direct attached storage
|Feb 27, 2005
|Mar 30, 2006
|Han-Gyoo Kim
|Universal network to device bridge chip that enables network directly attached device
|Oct 27, 2004
|Apr 27, 2006
|John Mendonca
|Method and system for processing concurrent events in a provisional network
|Jun 12, 2003
|May 11, 2006
|Eli Sofer
|Method and apparatus for a multisensor imaging and scene interpretation system to aid the visually impaired
|Apr 22, 2004
|Jul 13, 2006
|Netkingcall, Co., Ltd.
|Scalable server architecture based on asymmetric 3-way TCP
|Feb 23, 2006
|Jan 11, 2007
|Han-Gyoo Kim
|Enhanced network direct attached storage controller
|Jun 20, 2007
|Dec 6, 2007
|Microsoft Corporation
|Unmanaged memory accessor
|Jun 12, 2006
|Dec 13, 2007
|Aguilera Marcos K
|Transactional shared memory system and method of control
|Nov 6, 2007
|Mar 6, 2008
|Oracle International Corporation
|Using Local Locks For Global Synchronization In Multi-Node Systems
|Oct 21, 2008
|Feb 12, 2009
|Ximeta Technology, Inc.
|Data integrity for data storage devices shared by multiple hosts via a network
|Jan 28, 2010
|Safechannel Inc.
|Feature Based Data Management
|Jan 28, 2010
|International Business Machines Corporation
|System and method for managing locks across distributed computing nodes
|Jul 24, 2009
|May 18, 2011
|Zscaler, Inc.
|Feature based data management
|Oct 30, 2014
|May 27, 2015
|Sap Se
|Fast restart of applications using shared memory
|U.S. Classification
|709/229, 711/147, 709/213, 711/152, 709/201, 709/228, 707/999.008, 707/999.01
|International Classification
|Cooperative Classification
|European Classification
|Aug 23, 1999
Owner name: EXIGENT INTERNATIONAL, INC., FLORIDA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MONTROY, ALBERT T.;GRAVES, ERIC C.;DYER, DOUGLAS M.;REEL/FRAME:010201/0923
Effective date: 19990818
|Nov 13, 2002
Owner name: HARRIS-EXIGENT, INC., FLORIDA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:EXIGENT INTERNATIONAL INC.;REEL/FRAME:013507/0957
Effective date: 20010611
|Aug 18, 2006
|Fee payment
Year of fee payment: 4
|Sep 27, 2010
|Maintenance fee reminder mailed
|Feb 18, 2011
|Lapse for failure to pay maintenance fees
|Apr 12, 2011
|Expired due to failure to pay maintenance fee
Effective date: 20110218


text:
Sure Grip International & Oakley & Salomon Accessories
The Motion from SGI is certain to meet all of your expectations, and then some. This quad wheel is constructed from a high rebound urethane that has superior grip and maximum durability. It has a wide positrac design skating surface for a smooth, stabl... Read More
{boxId:"compare2fb23f8b424bcd906e1ab6d2fe", id:"147158P"}
The Sure-Grip Century Stopless Roller Skate plate is an artistic plate designed to be strong and agile, a perfect plate for skaters that are accustomed to a standard 10 degree double action plate but also for those who want to do figures. Built with hi... Read More
{boxId:"compareb6d49595b38ff110f7e06025ec", id:"210485P"}
Safely tote your skates in style with the Sure-Grip Premium Leather Saddle Bags! Made with premium top grain leather, these saddle bags feature two separate zippered pockets for each skate so one skate cannot scuff the other as you transport them. Ther... Read More
{boxId:"comparec4a8d4dcd600def80a0dcde85e", id:"211277P"}
Sure-Grip's Power Trac Complete Roller Skate Plates are the lightest, purest racing plates on the market. Made from highly polished 7000 series aircraft aluminum, the Power Trac features a new patent pending Reverse King Pin and aerospace composite, 15... Read More
{boxId:"compare038dd2cf8af51c250fac5cebc7", id:"210714P"}
The QUBE Ceramic bearing uses ceramic ball technology, the best bearings in the world use this same technology. Ceramic material can take more heat than convention steel, making them last longer and perform better under harsh conditions. This bearing i... Read More
{boxId:"comparea23d96f43ab0290a5082ae0f39", id:"210097P"}
Sure-Grip's Century Roller Skate Plates with Trucks are artistic plates that have been designed to be strong and agile, a perfect plate for skaters that are accustomed to a standard 10 degree double action plate. The Century Plate takes adjustable toe ... Read More
{boxId:"comparebb4c3f6adc529cec6a7d852c3b", id:"210521P"}
The Sure Grip Zombie Roller Skate Wheels gives you options that work best for the individual. The 89A Purple Core Wheel is best for polished concrete and other slippery surfaces for insane grip and can also be used as a pusher wheel. The 92A Black Core... Read More
{boxId:"comparefb77c08e4a96f4b9ddde877258", id:"310411P"}
Sure-Grip's Junior Pro Roller Skate Plate with Trucks features an aluminum construction, 15 degree double action aluminum trucks for a super stable skating experience. Takes non-adjustable toe stops (not included), 7mm or 8mm axles and fits boot sizes ... Read More
{boxId:"compare2ee09992b2918d58544a4d9015", id:"210557P"}
Sure-Grip's QUBE Gold Swiss Skate Bearings are engineered with QUBE technology which in lamens terms breaks down to mean - Quality Utilizing Better Equipment. Designed using advanced 3D modeling techniques, Sure-Grip's QUBE Gold Swiss bearings are craf... Read More
{boxId:"compare26c4b26d1cd25d08c67ca05691", id:"210095P"}
Sure-Grip's 93 boots are made of top grain leather and feature an Everdry lining with custom padding memory foam for unbelievable comfort, a fleece lined tongue and knotched uppers for maximum flexibility. Perfect for artistic skating, the Sure-Grip 93... Read More
{boxId:"compare56f715278ae1fe20a5a5a3c18a", id:"210856P"}
The most versatile plate on the market, Sure-Grip's Nova Plate is the perfect plate for speed skating or recreational skating. The Nova is complete with a T brace construction, 15 degree double action polished trucks, adjustable toe stops, precision sp... Read More
{boxId:"compare16797d02c8732a87a23edbf407", id:"210735P"}
You may not be a Fugitive, but your skates may be if you equip them with the Fugitive from SGI. This wheel features a super grip cold pour urethane that was formulated for maximum grip and superior speed. It has a solid core with a Superlite nylon inse... Read More
{boxId:"comparedd650358584fca46af3d484935", id:"147050P"}
Almost an illegal weapon..ok not really, but they could be. The Power Plus from SGI is the perfect wheel for speed skating quad skaters. Made with a Super Grip Cold Pour Urethane, the Power Plus is designed for maximum grip and superior speed. It featu... Read More
{boxId:"compared69392081fbde0692627af5d64", id:"147058P"}
Originally designed for figure skating, the Invader by Sure-Grip was soon adopted by roller derby girls in the late 1970's. Similar to the Cyclone but much stronger, the Invader features 45 degree single action trucks which offer less resistance than a... Read More
{boxId:"compare4358f650609cb85e6f00139b57", id:"210659P"}
Sure-Grip's 93 boots are made of top grain leather and feature an Everdry lining with custom padding memory foam for unbelievable comfort, a fleece lined tongue and knotched uppers for maximum flexibility. Perfect for artistic skating, the Sure-Grip 93... Read More
{boxId:"compare4ef484e0fd1684b0d0bb10bbb0", id:"210866P"}
Sure-Grip's QUBE Juice bearing was the first bearing to use QUBE 3D technology. Sure-Grip is absolutely confident that the QUBE Juice will not only make you roll faster but that it won't break your bank account, either. Skaters from around the country ... Read More
{boxId:"comparecf2156447d1034f9be82e91f80", id:"210090P"}
The Motion from SGI is certain to meet all of your expectations, and then some. This quad wheel is constructed from a high rebound urethane that has superior grip and maximum durability. It has a wide positrac design skating surface for a smooth, stabl... Read More
{boxId:"comparef8ead06814810cd079bbc1b2fe", id:"147162P"}
The Zoom from SGI is the perfect wheel for entry-level skaters. It offers superb durability with great speed. A urethane wheel surrounds the nylon hub to protect the bearings, while keeping them cool. For a wheel that will allow for a smooth ride and s... Read More
{boxId:"comparef1a273000ca96cf88f86a71356", id:"147025P"}
This cool west coast inspired t-shirt will put you in a California state of mind. Featuring O Hydrolix fabric this tee is moisture-wicking and quick drying for performance. Use this as a sport shirt or for everyday wear in warmer climates. The Wild We... Read More
{boxId:"compareed3eedbc39794f8392e63a916a", id:"423029P"}
Sure-Grip's Classic Roller Skate Plate is an artistic plate for the advanced skater that is accustomed to a standard 10 degree double action plate but wants to be able to adjust the pivot action. The Classic is a forged plate with an off set toe stop w... Read More
{boxId:"compare952313c0898416b2ffe0c6872d", id:"210645P"}
This classic surf inspired t-shirt from Oakley is perfect for throwing on after a session. A cool chest pocket and surfboard graphics give it a beach side style. 50/50 cotton poly blend gives you softness next to skin while having the ability to dry ... Read More
{boxId:"comparee43126cf3174bfcb02572f2732", id:"423020P"}
$200.00 - $210.00
The Oakley Game Changer Polarized Sunglasses will offer that subtle style to keep you looking at your best whether you're headed to the beach, the office or just out for some lunch with your friends. Beyond the looks are an array of features to maximiz... Read More
{boxId:"compare73b260268256cc931f715e3899", id:"383466P"}
Quality, performance driven Sure-Grip 73 Roller Skate Boots feature everything you could want in a skate boot. Made of top grain leather uppers with a padded full leather lining that has been specially designed to contour the form of your foot and a de... Read More
{boxId:"comparedf32a691d28a01141fecb7b85a", id:"210848P"}
Sure-Grip's QUBE Pink bearing is a special bearing, a solid ABEC 5 rated bearing. This is a bearing that was designed to help fight against breast cancer. Proceeds from this product go directly to the American Breast Cancer Foundation. An ABEC 5 bearin... Read More
{boxId:"compareb3a8c055c7abc5cf5bce601696", id:"210088P"}


text:
CHEYENNE -- After a lively debate, the Wyoming Senate on Tuesday killed a bill on third reading that would have repealed teacher tenure.
While Senate File 52 was defeated by a 28-12 vote, the Senate went on to advance two education and teacher accountability bills.
Senate File 70, education accountability, and Senate File 146, teacher accountability, will come up for third and final Senate votes today.
Supporters of repealing teacher tenure, or continuing-contract status, argued that it is too difficult now to get rid of ineffective teachers who may be partly to blame for subpar student performance scores in a K-12 system that costs the state $1.5 billion per year and pays teachers an average of nearly $59,000 per year.
Opponents said repealing the protection for teachers would discourage students from entering the profession. They also said the move would mean teachers would avoid innovation or doing anything creative that could jeopardize their jobs.
Sen. Hank Coe, R-Cody, the bill's sponsor, said opponents of the bill have been hearing from one side while he believes that 79 to 80 percent of people in the state support getting rid of tenure.
One opponent of the bill, Sen. Phil Nicholas, R-Laramie, said it would not have improved the quality of teachers or education.
If the legislators are serious about modifying teacher contracts, they should order an appropriation and pay each teacher $3,000 to become an "at-will" employee, he said.
Nicholas questioned whether the University of Wyoming's College of Education was rigorous enough. He noted that UW students who major in education have some of the lowest ACT scores on campus but graduate from the College of Education with the highest grade-point averages.
This either means the College of Education is turning students into "geniuses" or there is a "lack of rigor" in the department, Nicholas said.
Majority Floor Leader Tony Ross, R-Cheyenne, argued that the Legislature could be exposing itself to a rash of lawsuits if it were to remove the teacher tenure protection. He said the action could be construed by the courts as taking a property right without due process.
Sen. Cale Case, R-Lander, said he worked without tenure as an economist for a large company, got along with other employees and did not fear upper management.
"It really does work out there in the real world," Case said.
Sen. Larry Hicks, R-Baggs, said the senators who opposed the bill were arguing for the status quo, but the status quo was not helping the school children.
Sen. John Hastert, D-Green River, said the bill would "stifle teachers."
The state, he said, already has a system to get rid of bad teachers.
"This bill is just punitive," said Sen. John Schiffer, R-Kaycee.
"The debate should be about quality teaching," Schiffer said. "This bill is about trying to hammer somebody."
Sen. Chris Rothfuss, D-Laramie, said the bill had the effect of giving more power to principals and administrators -- a group that also had "bad applies" and was no less accountable for student performance than teachers.
Coe succeeded in delaying the effective date of the bill until July1, 2012. During the interval, he said, work could begin setting up the proposed new accountability programs and clearing up any problems with the tenure repeal bill.
But efforts to save the bill failed.
After the vote, Kathryn Valido, president of the Wyoming Education Association, said the debate was thoughtful "and the senators made a good decision."
"They have options on the floor that offer great accountability and they decided this wasn't the best option," she said after the vote.
The senators, she said, looked at all the unintended consequences of the bill, not just the potential for litigation.
Her organization, she said, likes Senate File 46, the Teacher Accountability Act, because it clearly defines how accountability is measured.
"And that is with good teacher evaluation," Valido said. "That's what we always said we wanted -- good, strong teacher evaluation."
She said the current system of terminating poor teachers has been been in place for 53 years and is effective.
The WEA has been on record of supporting Senate File 70, the Education Accountability Act, from the start, she said.


text:
Salvatore Ferragamo
'Ascanto' Cap Toe Boot
Product not available
Have questions?
Chat with a Designer Specialist or call 1.877.543.7463. (Designer Specialists are available from 7am to 1am Eastern.)
HideDetails & Care
A sturdy, yet lightweight crepe sole grounds classically styled boots crafted from finely weathered leather and fronted by a tasteful toe cap.
- Leather upper and lining/rubber sole.
- By Salvatore Ferragamo; made in Italy.
- Men's Shoes.
'Ascanto' Cap Toe Boot
Write a Review0 Reviews
Enter a valid first name.
Enter a valid last name.
Enter a valid email address in the format: firstname.lastname@example.com.
Close modal


text:
The latest news from your friends at Watson Water Compay:
2016 Annual Meeting
: Watson Water company Inc, held its Annual Meeting on April 25, 2016 at 7:00pm. The meeting was held in the lower meeting room at the Bethany Christian Church, 9007 Hwy 62, Charlestown, IN. Members should have received an official notice in the mail.
2014 Annual Drinking Water Report
We are pleased to present the most recent Annual Water Quality Report
(Consumer Confidence Report) for January 1 – December 31, 2014
Update Your Contact Information
to other helpful websites.
© 2016 Watson Water Company, INC. All Rights Reserved
This institution is an equal opportunity provider and employer.


text:
Not too proud of his one to be honeest, paint jobs iffy and the facial sulpting is naff, for some reason I decided that yellow jackets head on quicksilvers body with quicksilvers ears glued on was a good idea. Oh well trial and error. I have a new costume Invincible in the works along with Allen the Alien for all you Kirkman fans out there. If you do comment please be kind.
|Punisher Warzone
|Submission Order
|Snake Eyes
|Invincible Series
|Invincible - current costume
|Punisher Warzone
|Created by captainsnikt
|Snake Eyes


text:
Tekkaman Blade (TV)
Go back to Tekkaman Blade main page
Paul Schrier, who plays the role of Saber, is the guy that plays Bulk in the first Power Rangers series
Towards the end of the OVA movie Macross II when the camera is panning over the city for a brief moment one of the citizens in the street is Tekkaman Blade in his human "mode".
There is a special episode,but in fact is the episode "0" because is a promotional of the "Tekkaman Blade" TV series,it have details about characters,story,sketchs and the ending "ENERGY OF LOVE" is different.
It has been recently revealed that Tekkaman Blade is one of four new characters that will appear in the U.S. release of "Tatsunoko vs. Capcom" for the Nintendo Wii.
|You can contribute information to this page, but first you must login or register
|add information
|report an error
|lookup sources


text:
The organization called Mobiramos S.L., having three filed documents at the Companies Registry Office, at the postcode 36203, dedicated primarily to other retail trade of new goods in specialized stores, inscribed in Trade Register of Pontevedra, with "sociedad limitada" as company type, with legal address in the Magallanes rua of Vigo, is constituted as a corporation belonging to the province of Pontevedra, country of Spain. This business was visited lately seven times in the last three years and one time in the last month from one country.
|Subscribe to the latest news and changes of this company for free


text:
|ESPN.com: ACC
|[Print without images]
Jimbo Fisher continues to close well down the stretch. With the Jones commitment, FSU likely will be one of the big movers of the day. In Jones, the Seminoles are getting a scheme-versatile defender. We feel he could play OLB or develop into a defensive end with added bulk and strength. He's a tremendous athlete for his size and can be a disruptive presence on the perimeter at either position.Also, on our live chat, Tom Luginbill just said he thinks that UNC can finish with a top-20 class today.


text:
Natural Eyes
Neutral Eye Shadow Collection$36.00
Flaunt your natural
side with a look that appears so effortless you can wear it before breakfast or
after dark. Natural Eyes is a palette of nine richly-pigmented shadows that
pair perfectly and blend beautifully
Look naturally gorgeous for any occasion, from everyday to your wedding day. Our best-selling Natural Eyes collection allows you to perfect the most flattering, most requested look in the glamour universe. Newly made over in the prettiest packaging, the palette features nine matte and shimmer shadows in beautiful neutrals ranging from soft and pretty to slightly sexy and three new shades. Natural Eyes is a 2014 Brides Magazine award winner for Best Palette to Wear On Your Big Day!
More To Love:
- Step-by-Step Instructions: Three, easy-to-follow Glamour Guides teach you everything you need to know to create the perfect Natural Eye for any occasion.
- Portable: All the shades you need in an easy-to-carry, compact purse-size palette.
- Rich Pigments: Our exclusive true color, pure pigmented eye shadows offer true color payoff.
- Blendable: Our luxurious, silky smooth formula blends effortlessly for an airbrushed effect.
Cashmere Bunny, Heaven, Sexspresso
Ingredients/Ingrédients: Mica, Talc, Cetearyl Isononanoate, Ethylene/Acrylic Acid Copolymer, Phenoxyethanol, Sodium Dehydroacetate, Methicone, PEG-8 Dimethicone, Sorbic Acid. May Contain/Peut Contenir/(+/-): Iron Oxides (CI 77491, CI 77492, CI 77499), Manganese Violet (CI 77742), Bismuth Oxychloride (CI 77163), Titanium Dioxide (CI 77891).
Chocolate Martini, Erotica Ingredients/Ingrédients: Silica, Talc, Mica, Synthetic Fluorphlogopite, Zinc Stearate, Ethylhexyl Palmitate, Cetearyl Isononanoate, Phenoxyethanol, Sodium Dehydroacetate, Sorbic Acid, Methicone. May Contain/Peut Contenir/(+/-): Iron Oxides (CI 77491, CI 77492, CI 77499), Manganese Violet (CI 77742), Titanium Dioxide (CI 77891), Ultramarines (CI 77007)
Honey Pot Ingredients/Ingrédients: Mica, Ethylhexyl Palmitate, Talc, Kaolin, Zinc Stearate, Phenoxyethanol, Sodium Dehydroacetate, Silica, Sorbic Acid, Zea Mays (Corn) Starch. May Contain/Peut Contenir/(+/-): Titanium Dioxide (CI 77891), Iron Oxides (CI 77491, CI 77499).
Push-Up, Silk Teddy Ingredients/Ingrédients: Mica, Talc, Ethylhexyl Palmitate, Zinc Stearate, Kaolin, Phenoxyethanol, Sodium Dehydroacetate, Sorbic Acid, Silica, Zea Mays (Corn) Starch, Tin Oxide, Carmine (CI 75470). May Contain/Peut Contenir/(+/-): Titanium Dioxide (CI 77891), Iron Oxides (CI 77491, CI 77492, CI 77499). Manganese Violet (CI 77742), Bismuth Oxychloride (CI 77163), Ferric Ferrocyanide (CI 77510).
Nudie Ingredients/Ingrédients: Cetearyl Isononanoate, Talc, Ethylene/Acrylic Acid Copolymer, Phenoxyethanol, Sodium Dehydroacetate, Sorbic Acid, Carmine (CI 75470). May Contain/Peut Contenir/(+/-): Titanium Dioxide (CI 77891), Iron Oxides (CI 77491, CI 77492, CI 77499). Manganese Violet (CI 77742), Bismuth Oxychloride (CI 77163).
This Too Faced product is amazing! The colors are beautiful & well pigmented. The quality is good & the packaging is cute & makes good size for travel. It has a good variety of shades for a small pallet.
I love the colors, but am always running out of push up well before the others, so I'd love it if that was a single! I haven't been able to find a single in any other brand that is close enough..yet
Edith Soriano
Too faced is my favorite brand and this has got to be one of my first eyeshadow palettes that I bought. I use it so much that i can already see the steel pan on the bottom! The colors are so beautiful and blend so easily. This is a must have so I recommend you add to your cart my dear!
Brandi N Bice
I love this! It makes my blue eyes stand out really good. The colors are awesome and they are smooth. Stays on all day!
I LOVE this palette! the color pay off is amazing and they bring out my eyes so much, i use this palette every time i put on makeup for work and i always get told my makeup looks amazing. the formula for the eyeshadow is great! if your thinking of getting this palette get it!
This product is amazing! I got it as a gift for Christmas and have used nothing but it since. The colors are pigmented and creamy and I use often and the colors have not come close to running out. For such high quality makeup, the price is extremely fortunate and reasonable. Has just the right amount of shimmer and the colors would go well with any skin tone. Too Faced never disappoints me.
Absolutely love it! I used it everyday! It has replaced every eyeshadow that I usually used. The colour honey pot is my favourite!
Kathy Goss
I absolutely love this pallet! I don't wear colors that aren't natural looking on my skin and I bought this pallet and was so pleased with the easy way to blend in the colors to match my skin tone. It only takes a little bit of each color so I know that it will last a long time. I'm already planning on trying one of the other pallets that Two-Faced offers since they have so many great ones to choose from.


text:
Give Now
The U.S. Department of Agriculture actually pays farmers to convert highly erodible land back to native vegetation with the Conservation Reserve Program.
You don't often see orange trees in Nebraska, but Russ Finch says growing citrus was a way of showing that his geothermal greenhouse could work.
In central Nebraska, the Platte River was at or near flood stage for close to two months, submerging crop fields near the river and damaging bridges and fences.
While big swathes of the Great Plains have partially recovered from the extreme 2012 drought, some sections are still desperately dry.
For first-timers, the prospect of hopping on the back of a sheep for a wild ride can stir a range of emotions.
Ecologists in Nebraska are trying to find out what the Great Plains looked like when homesteaders settled there in the 19th century.
Farmers throughout the Great Plains are preparing for what could be a tough growing season. Limited irrigation resources pose a particular problem in Colorado.


text:
you are viewing a single comment's thread.
Or all Nokia has to do is change the product so it no longer infringes the patent... look at HTC and Apple ....Apple got a favorable ruling before the full Commission and HTC modified their code to remove the code from their new phones (OneX) that infringed Apple's data tapping patent (when you write a phone number in text or email software recognizes a such and you can tap the link to dial out).
That logic won't apply to back payments. This started in 2007!


text:
|English for Beginners Practical English Travel English Telephone English Banking English Accounting English Dictionary
|Audio English.org » Dictionary » M » Misinterpret ... Missoula
|Pronunciation (US):
Dictionary entry overview: What does misnomer mean?
• MISNOMER (noun)
The noun MISNOMER has 1 sense:
1. an incorrect or unsuitable name
Familiarity information: MISNOMER used as a noun is very rare.
Dictionary entry details
|Sense 1
|misnomer [BACK TO TOP]
An incorrect or unsuitable name
Classified under:
Nouns denoting communicative processes and contents
Hypernyms ("misnomer" is a kind of...):
name (a language unit by which a person or thing is known)
|Learn English with... Proverbs of the week


text:
Thursday, 5 May 2016
Last updated 17 hours ago
Jul 8 2009 | 10:10am ET
The Hennessee Hedge Fund Index advanced 0.64% in June, bringing its year-to-date gains to 11.74%. By comparison the Standard & Poor's 500 Index increased 0.02% (1.78% year-to-date), the Dow Jones Industrial Average decreased 0.63% ( down 3.75% YTD), while the NASDAQ Composite Index advanced 3.10% (16.36% YTD).
"Most hedge fund managers are not buying into the 'Green Shoots'," said Charles Gradante, co-founder of Hennessee Group. "While markets rallied sharply in April and May, most managers remained conservative. I think we have reached an inflection point as momentum seems to have faded. We should see a return to stock picking based on fundamentals, which are rather negative. In addition, the technicals are also bad, leading us to believe in a summer correction."
The Hennessee Long/Short Equity Index gained 1.10% in June (10.95% YTD) as equity markets lost momentum last month after experiencing strong gains during the first two months of the quarter. The Hennessee Arbitrage/Event Driven Index gained 1.14% in June (13.76% YTD) on the strength of credit markets' continued strong positive.
Hennessee's Distressed Index also advanced 4.45% in June (17.16% YTD). The U.S. high yield default rate increased to 9.5%, up from 2.4% a year ago, and is expected to end the year in a range of 15% to 18%, according to the firm. The Hennessee Convertible Arbitrage Index gained 0.21% (21.48% YTD).
Also, the Hennessee Merger Arbitrage Index posted a 1.21% gain last month (5.33% YTD) as managers found opportunities in strategic acquisition activity as well as distressed merger and acquisition activity. And the Hennessee Global/Macro Index declined 0.46% in June (10.77% YTD).
"Hedge funds have outperformed equity benchmarks by a 10% margin in the first half of 2009," said Lee Hennessee, managing principal of Hennessee Group. "The outperformance is largely due to the ability of hedge funds to profit from their short portfolios, as we saw in January and February. While hedge funds are routinely publicized as high risk vehicles, the reality of the situation is that the average hedge fund has demonstrated significantly less volatility than traditional asset classes for the 22 years we have been advising investors."
May 3 2016 | 6:11pm ET
The cadre of 25 research analysts at Murano Systems speaks with more than 150 investors...
Apr 6 2016 | 8:31pm ET
Billionaire hedge fund manager Steve Cohen has formed a non-profit aimed at treating...
Apr 18 2016 | 5:51pm ET
The recent decision by the New York City Employment Retirement System to exit its...


text:
South Bend Pride Prom 2014
South Bend Guerrilla Gay Bar
Saturday, June 7, 2014 at 9:00 PM - Sunday, June 8, 2014 at 2:00 AM (EDT)
Who's Going
Loading your connections...
3 of your friends are going. Share it to get more people on board! Share
Sara Haughty
San Francisco, California
San Francisco, California
Luke Picard
London, United Kingdom
London, United Kingdom
Rick Vespucio
Florence, Italy
Florence, Italy
Event Details
It's the second annual Pride Prom, a night for Michiana's LGBT community and allies to celebrate in style! We mix a swanky venue with beats from our favorite Guerrilla Gay Bar DJ, Chuck Fry, and a "royal" photobooth to guarantee a memorable night for all. 21+ with cash bars available.
Pre-sale tickets: $15 group (2+) or $20 individual through April 21st
Fashionably late tickets: $20 group (2+) or $25 individual April 22 - June 6th.
Have questions about South Bend Pride Prom 2014? Contact South Bend Guerrilla Gay Bar
When & Where
Palais Royale
105 W Colfax Ave
South Bend,
Saturday, June 7, 2014 at 9:00 PM - Sunday, June 8, 2014 at 2:00 AM (EDT)
Add to my calendar
South Bend Guerrilla Gay Bar
We organize monthly LGBT "takeovers" of favorite local spots and an annual Pride Prom. Request to join our facebook group: Guerrilla Gay Bar, South Bend.
South Bend Pride Prom 2014
South Bend, IN Events


text:
|Publication number
|Publication type
|Publication date
|Jul 10, 1973
|Filing date
|Oct 7, 1971
|Priority date
|Oct 7, 1971
|Also published as
|Publication number
|Harter J
|Original Assignee
|Eastman Kodak Co
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (6), Referenced by (2), Classifications (5)
|External Links: USPTO, USPTO Assignment, Espacenet
[ July 10, 1973 PHOTOGRAPHIC SPOT MONITOR APPARATUS Primary Examiner-Samuel S. Matthews Assistant Examiner-E. M. Bero Attorney-W. H. J. Kline [75] Inventor: James E. Barter, Webster, N.Y. [73] Assignee: Eastman Kodak Company,
[57] ABSTRACT Photographic spot monitor apparatus includes a plural- Rochester, N.Y.
Oct. 7, 1971 [22] Filed:
ity of spot rings adapted to be selectively positioned in [2]] Appl. N0.: 187,481
the near focal plane of a film transparency to thereby project the image of the ring onto the print plane defin- 355/68 ing the area being monitored. The monitoring appara- G03. 27/78 tus positioned adjacent the optical axis of the printer, [58] Field of 355/38, 68
[52] US. 355/38, [51] Int. Cl.
intercepts oblique light emanating through the spot ring from the film transparency and divides the light so References Cited UNITED STATES PATENTS intercepted into its basic color components to facilitate analysis of the color content of the transparency. The
f. m thd S 0130 0 W S 6 H m .1 0 m 5 its r. 0.0. $2M Wye um dnm w .m r m o mpm D .m P 4 M m m m m m [0 w c P .m 6 .m d n m. mwo t .mes o m 8.
8 8 unuuun 5 5 NSBNMS 535553 5 .535 3 "333 "n u c .1 mamy fl me u S Rwo 555 676667 999999 11111... [Ill/l 2 2226 l 1 622736 942684 40028 157728 333333 PATENIEDJUL 1 01913 sum 1 or 2 JAMES E. HARTER INVENTOR.
ATTORNEYS l PHOTOGRAPHIC SPOT MONITOR APPARATUS BACKGROUND OF THE INVENTION This invention relates generally to photographic printing apparatus, and more particularly to improved spot monitoring apparatus for use with a color photographic printer.
In connection with the enlarging of color or black and white film, it is highly desirable to determine the density for color film and the content of the transparency prior to printing. By so evaluating the transparency, it is possible to determine the proper corrective filters and exposure time, for example, necessary to achieve the best printing results.
There are available systems in apparatus which preread the film transparencies, for example, on a densitometer or color negative analyzer, prior to printing and which provide a readout or indication of the necessary corrective action to be taken on the print apparatus. However, this approach is time consuming and requires that special markings and instructions acconpany the film transparency to the printer apparatus, so the printer operator can make the necessary corrections. The apparatus so used must also be compatible with the printing apparatus to be used to enlarge the film.
Other enlarger systems may use monitoring apparatus to analyze light reflected from the print plane or light detected in the print plane. The technique of using light reflected from the print plane can introduce error, depending upon the relative reflective characteristics of the screen or composing surface in the print plane. While introducing a light probe directly into the print plane does not experience this difficulty, it very often distorts the image and makes it difficult for the operator to get a true evaluation of the area of the print being monitored.
In evaluating a color transparency in a projected image to determine the best corrective measures to be taken, it is necessary that the monitoring apparatus accurately define that portion of the image being monitored. For example, in portrait photography it is often highly desirable to utilize the flesh tones to determine the proper settings for the exposure. In this case it is highly important that the monitor be accurately located in the chosen flesh tone area, and furthermore that only light emanating from that area impinge upon the monitoring apparatus. It is also desirable in such situations to have available various sizes of spots for monitoring the selected area of the film transparency.
OBJECTS AND SUMMARY OF THE INVENTION Accordingly, it is a principal object of the invention to provide an improved monitoring apparatus which accurately defines the area of a film being monitored.
Another object of the invention is to provide improved monitoring apparatus which give a visual indication of the area of the transparency being monitored.
Yet another object of the invention is to provide monitoring apparatus which permits variations in the size of the area of the transparency being monitored.
A further object of the invention is to provide improved monitoring apparatus which permits verification of the monitor alignment.
The foregoing and other objects are accomplished according to one aspect of theinvention which utilizes a plurality of spot rings selectively adapted to be moved into the focal plane of the transparency, so that both the image and the ring are projected onto a composing screen. Detection apparatus is obliquely mounted in the system and constructed so that only the light passing through the spot in the focal plane of the transparency passes to the monitoring apparatus, where it is divided into the red, green and blue color components for evaluation. For each spot ring size, there is a corresponding aperture in the detecting apparatus to assure that only the light from within the spot is monitored. The different size rings have associated therewith suitable neutral density filters to compensate for the varying amount of light that will be passed therethrough depending upon the size of the spot ring being used.
DESCRIPTION OF THE DRAWINGS FIG. 1 is a diagrammatic sectional illustration of a photographic printer incorporating monitoring apparatus according to the present invention;
FIG. 2 is an expanded sectional illustration of a portion of the monitoring apparatus of FIG. 1;
FIG. 3 is a perspective view of the apparatus according to the present invention; and
FIG. 4 is a diagrammatic illustration of the various aperture slide 27 used within the monitoring apparatus of FIG. 1.
DESCRIPTION OF THE PREFERRED EMBODIMENT Referring first to FIG. 1, the projection system includes the print plane 11 with a composing screen 13 positioned in front of it. A film transparency 15 is located in the negative focal plane and between the film transparency and the print plane is the printing lens cluster 17 all positioned along the projection axis 18. Immediately in front of the negative focal plane, and essentially located therein, is a spot monitor ring 19, which is associated with the spot monitoring apparatus, as will become evident from the following description. Located to the side of the projection axis 18 is a first surface mirror 21, which directs the light toward a rectangular aperture stop 23 and through a field lens 25. Light from the field lens passes through a field stop 27 located in the primary image plane, through the objective lens 29 and impinges on a first dichroic mirror 31. Light reflected from the dichroic mirror 31 impinges on a surface mirror 33 and is reflected through a filter 35 onto the cathode of a photo multiplier tube 37. Light passing through the dichroic mirror 31 impinges on a second dichroic mirror 39, the reflected light from which passes through a filter 41 onto the cathode of a second photo multiplier tube 43. Light passing through the dichroic mirror 39 passes through a filter 45 onto the cathode of a third photo multiplier tube 47.
In operation, oblique light emanating from a discrete area of the negative defined by the ring 19 is reflected by the surface mirror 21 and passes through the rectangular aperture stop 23 and is collected by the field lens 25. The light therefrom is directed onto a field stop 27, which as will become apparent later, has an opening related to the size of the opening in the spot ring 19. The field stop may also have associated with it a neutral density filter to compensate for the total amount of light passing therethrough. Light from the field stop passes through the object lens and a first color component thereof is reflected by the dichroic mirror 31 to the reflecting mirror 33 to impinge on the cathode of photo multiplier tube 37 after passing through the filter 35. In a particular embodiment this first color reflected would be red, in which case the filter 35 would be in a red filter. In addition then, the dichroic 31 would pass the blue and green color components, which upon striking on the dichroic 39 would have the blue light reflected and the green light transmitted, so that the blue light would pass through the blue filter 41 onto the cathode photo multiplier tube 43. The transmitted green light passes through a green filter 45 onto its respective photo multiplier tube cathode 47. The light detected by the respective photo multiplier tubes 37, 43 and 47 would excite the tubes and give an output proportional to the respective color content of the light emanating through the ring 19. Using standard analytical circuitry, such as that associated with an electronic color viewer, for example as disclosed in US. Pat. No. 3,351,707, the outputs from the photo multiplier tubes are used to generate the necessary information to determine the corrective filtering, exposure times, etc. necessary to produce the desired color print.
Referring next to FIG. 2, there is shown an expanded view of the red light detection portion of the monitoring apparatus with additional components providing the capability for back-projection of light to give an indication of spot alignment. The mirror 33 is mounted on a pivotable plate 49, which is connected by a pivotably mounted arm 51 to a plunger actuator 53. Attached to one end of the plate 49 is a light seal 55. Behind the mirror and plate is a light bafile 57 having a window 59 opening therein. Behind the window is a lamp 61. With the apparatus as shown by the solid lines, the spot monitor functions in the same manner as described in connection with FIG. 1. However, when the plunger actuator 53 is moved downward, the plate 49 with the light seal 55 attached to one thereof is moved upwardly so that light from the lamp 61 is incident upon the reflective dichroic mirror 31, and this light will be backprojected through the apparatus of FIG. 1 onto the ring.
defined area of the film transparency being monitored. As will be readily apparent to those skilled in the art, the optics of the system are such that if the ring is in proper alignment, the light back-reflected from the lamp 61 through the system onto the film transparency would be in direct alignment with the ring 19.
As seen in FIG. 3, a negative having an image thereon is projected through the printing lens 17 onto the composing screen 13. The image 20' on the composing screen is, of course, reversed from that of the film transparency 15. The spot ring 19 located in the near focal plane of the film transparency 15 is also projected onto the composing screen 13 as an image 19', thereby defining accurately the area 63 of the film transparency being monitored. The apparatus described in conjunction with the monitors of FIGS. 1 and 2 might be located in the black box" 65 positioned to the side to intercept oblique rays emanating from the spot ring 19. The rays pass through an opening 67 which would contain the surface mirror 21. As illustrated, the monitor 65 is capable of motion in both the horizontal and vertical directions to permit positioning of the spot ring in the desired area of the transparency. Alternately, the monitor could be mounted to provide rotational motion combined with either horizontal or 6 vertical movement to effect the same positioning capability.
The monitor has mounted on the back side thereof three spot rings 19, 69 and 71 of varying sizes. They are preferably pivotably mounted on a rotatable plate 73 to permit selection of the desired spot size. To accommodate a system having, for example, three spot ring sizes, the field stop 27 would be required to have therein three openings 77, 79 and 81 (see FIG. 4). The field stop slide would be suitably connected, for instance, through a gearing mechanism 89 to shaft 91 of the rotatable plate 73 of FIG. 3, so that the proper stop aperture would be located in the light path depending upon the particular spot ring chosen for monitoring. Positioned behind each of the spot apertures would be suitable neutral density filters 83, 85 and 87 respectively, in order to compensate for the varying amounts of incident light that would impinge upon the dichroic mirrors of the apparatus due to the area differences in the spot sizes.
As can be seen in FIG. 4, the stop apertures 77, 79 and 81 are of an elliptical configuration because of the oblique angle at which the light is detected coming from the negative area defined by the spot ring. Of course, the stop apertures 77, 79 and 81 also configure the back projection from the lamp 61 of FIG. 2 during the spot verification and each is respectively operative through the optics of the system to produce a circular spot over the ring in the negative plane 15.
Therefore, while the invention has been described in detail with particular reference to preferred embodiments thereof, it will be understood that variations and modifications can be effected within the spirit and scope of the invention.
I claim:
1. In photographic printing apparatus including a print plane, means for supporting an image bearing film in an object plane, a printing lens suitably positioned between said print plane and said object plane to focus an image of film supported by said film supporting means through the lens onto the print plane and means for illuminating film supported by said film supporting means for projection through the lens along a projection axis onto the print plane, improved monitoring apparatus comprising:
spot ring apparatus, including at least one ring adapted to be movably positioned immediately adjacent the object plane of said film supporting means whereby projection of the image of film supported by said film supporting means onto the print plane includes projection of an image of said ring onto said print plane to define the area being monitored;
a field lens located with respect to said image bearing film so as to be off the projection axis yet receive light therefrom for forming an image of film supported by said film supporting means in a primary image plane;
stop means located in said primary image plane to restrict light passage to that light passing through said ring; and
light detecting means for receiving light transmitted from said field lens through the stop means to thereby monitor the ring defined portion of the object plane.
2. The invention according to claim 1 wherein said spot ring apparatus includes a plurality of rings of difand further including means responsive to the selection of one of said rings being positioned adjacent said object plane to move the corresponding stop into position in said primary image plane.
3. The invention according to claim 1 further includ ing an objective positioned between said primary image plane and said light detecting means.
4. The invention according to claim 1 additionally comprising a secondary illumination source adapted to be projected through said stop means and said field lens onto said image bearing film, whereby coincidence of the light so projected with said spot ring is indicative of proper alignment of the apparatus, verifying that said light detecting means is monitoring the area of the object film within said ring.
5. The invention according to claim 1, wherein said light detecting means comprises:
a plurality of photo detectors;
a plurality of color selective filters, one positioned proximate each of said photo detectors; and
light splitting means adapted to split the incident light into a plurality of components of white light and direct said plurality of components of white light onto a respective one of said plurality of photo detectors.
6. The invention according to claim 2 wherein each of said stop means has positioned adjacent thereto a neutral density filter adapted to compensate for brightness variations resulting from the area differences of each of said plurality of stop means.
|Cited Patent
|Filing date
|Publication date
|Jun 6, 1958
|Dec 5, 1961
|W M Welch Mfg Company
|Photographic exposure probe device
|Mar 27, 1961
|Feb 16, 1965
|Eastman Kodak Co
|Electro-optical photometer
|May 10, 1961
|Feb 23, 1965
|Agfa Ag
|Photographic enlarger
|May 16, 1962
|Dec 14, 1965
|Satoru Ouchi
|Automatic exposure timing means
|Nov 28, 1967
|Jan 12, 1971
|Agfa Gevaert Ag
|Apparatus for reproducing images of color photographic negatives
|Sep 21, 1967
|Jun 28, 1971
|Eastman Kodak Co
|Photographic color printer
|Citing Patent
|Filing date
|Publication date
|Aug 10, 1976
|May 30, 1978
|Gretag Aktiengesellschaft
|Printing method
|Jun 29, 1988
|Aug 1, 1989
|Reed Roger G
|Diffuser for color analyzer
|U.S. Classification
|355/38, 355/68
|International Classification
|Cooperative Classification
|European Classification


text:
On Wednesday, Feb.20th, men who have experienced the death of someone in their lives are invited to attend a gathering for men only at the Harwood Place, 8220 Harwood Ave., Wauwatosa, from 6:00 – 8:00pm. For more information contact 262-524-4132 or e-mail email@example.com or visit www.churchandchapel.com
Men Journeying Through Grief is a gathering for men only who have experienced the death of a loved one, friend or co-worker and find themselves on the journey called grief. This FREE gathering will include a simple supper, sharing of grief information and area resources, as well as some discussion. Pete Reinl, Director of Grief Support Services for Church and Chapel Funeral Homes, Larry Uglow, Counselor for Stillwaters Cancer Support Services, and Patrick Monaghan will be the facilitators. For planning purposes pre-registration is appreciated (but not necessary) by calling 262-524-4132 or e-mail email@example.com.
More from Your Stories
- Asanas for Support: Endurance Yoga Challenge Takes Aims at Lung Cancer
- Wauwatosa West students, teacher recognized for Stock Market Game Challenge
- Wauwatosa West High School Students Win National Financial Competition Again!
- The Corked Canvas hosts "Paint Your Pet" fundraiser for Elmbrook Humane Society
- Ten Wisconsin High School Seniors Win BBB Foundation's "Student of Integrity" Scholarship
- Ten Wisconsin High School Seniors Win BBB Foundation's "Student of Integrity" Scholarship
- A Parent's Guide to Prom Flowers
- Milwaukee Lutheran High School presents "Man of La Mancha"
- Callen Calls for Eco-Friendly Materials
- Midwest Premiere Event "A Disappearing"


text:
May 4, 2016
HODGEN, Okla. (AP) - Authorities have captured an inmate who escaped last week from a minimum security prison in eastern Oklahoma.
Le Flore County deputies captured Curtis Edward Gibson on Sunday in the unincorporated Summerfield area. Fort Smith, Ark., television station KHBS reports that authorities found Gibson looking for food in a trash bin.
Deputies say Gibson was discovered missing during a headcount July 1 at the Jim Hamilton Correctional Center.
Officials say Gibson was serving time out of Oklahoma County on a conviction of failure to comply with sex offender registration.
(Copyright 2013 The Associated Press. All rights reserved. This material may not be published, broadcast, rewritten or redistributed.)
Click Here to access the online Public Inspection File
Viewers with disabilities can get assistance accessing this station's FCC Public Inspection File by contacting the station with the information listed below. Questions or concerns relating to the accessibility of the FCC's online public file system should be directed to the FCC at 888-225-5322, 888-835-5322 (TTY), or email@example.com.


text:
It was good for Arsenal fans to hear Arsene Wenger state this week that he knew that the Gunners are short on the defensive side of the squad and declare that he expects to be able to solve the situation in the January transfer window.
Tag Archives: Celtic
Arsenal to go back for deadline day defender
Everyone knows that Arsenal desperately needed another central defender during the transfer window, and according to the Mail, Arsene Wenger tried to make a last minute move for the Celtic star Virgil van Dijk.
Arsenal transfer rumours – Grenier, Wanyama and Fellaini
According to unconfirmed media reports in France, Arsenal have made an official bid for Clement Grenier who seemed to be staying at Lyon a few weeks ago. Arsene Wenger apparently tabled around an £8 Million bid but the Lyon club president rejected it straight away.
Does Wanyama to Saints mean Arsenal target is Fellaini?
One of the players most likely to join Arsenal as the new defensive midfielder this summer, or so we were led to believe, was the Celtic and Kenya midfielder Victor Wanyama. That transfer is starting to look dead in the water, unless Arsene Wenger is planning some quick action in the next few days, because Southampton have apparently agreed a fee with the Scottish champions.
Wanyama again confirms Arsenal talks
Last week there were utterings from the Celtic midfielder Victor Wanyama that he was wanted by Arsenal, but since then he has been on international duty with Kenya, but he has re-affirmed that his agent is still continuing the talks with Celtic and the Gunners while he has been playing in the World Cup Qualifiers.
Wanyama hints at Arsenal transfer – Do we want him?
Arsenal and Wanyama by Stefan
Victor Wanyama has admitted that he is in talks with several clubs over a possible transfer in the coming weeks. This news will come as a good and positive sign to the Arsenal fans who have been calling for the club to sign him up immediately, although Wanyama refused to reveal which clubs were talking to him, meaning that it could be several totally unexpected foreign clubs.
What is Ramsey hinting about Arsenal and Wanyama?
Does Ramsey know something we don't? by AH
Arsenal must sign Big Vic Wanyama says former Gunner
When George Graham took over as the manager of Arsenal back in 1986, the first player he signed was the young left winger Perry Groves. Groves went on to become a fans favourite. The Londoner still has the club at his heart and often appears in the media to talk about them. Like all Gooners, Groves has his own ideas about what the Gunners need to do to push on from merely qualifying for the Champions League every season and like most Gooners he feels that a proper defensive midfielder should be one of the main transfer targets this summer.


text:
NEW YORK ( TheStreet) --As the crisis in Europe continues to take its toll on the markets and bank borrowing costs rise, a nation's debt and currency debasement should be of much concern.Most recently, a study indicated that the U.S. national debt has ballooned nearly 12 fold over the last 30 years. Additionally, over this same time span the ratio of debt to GDP has gone from nearly one-third to 85%.
ETFs to Hedge Against Currency Debasement
Check Out Our Best Services for Investors
Action Alerts PLUS
Portfolio Manager Jim Cramer and Director of Research Jack Mohr reveal their investment tactics while giving advanced notice before every trade.
Product Features:
- $2.5+ million portfolio
- Large-cap and dividend focus
- Intraday trade alerts from Cramer
Quant Ratings
Access the tool that DOMINATES the Russell 2000 and the S&P 500.
Product Features:
- Buy, hold, or sell recommendations for over 4,300 stocks
- Unlimited research reports on your favorite stocks
- A custom stock screener
Stocks Under $10
David Peltier uncovers low dollar stocks with serious upside potential that are flying under Wall Street's radar.
Product Features:
- Model portfolio
- Stocks trading below $10
- Intraday trade alerts
Dividend Stock Advisor
David Peltier identifies the best of breed dividend stocks that will pay a reliable AND significant income stream.
Product Features:
- Diversified model portfolio of dividend stocks
- Updates with exact steps to take - BUY, HOLD, SELL
Trifecta Stocks
Every recommendation goes through 3 layers of intense scrutinyquantitative, fundamental and technical analysisto maximize profit potential and minimize risk.
Product Features:
- Model Portfolio
- Intra Day Trade alerts
- Access to Quant Ratings
Real Money
More than 30 investing pros with skin in the game give you actionable insight and investment ideas.
Product Features:
- Access to Jim Cramer's daily blog
- Intraday commentary and news
- Real-time trading forums


text:
|It's the Season of Easter!
Come Celebrate with Us!
|Join us Sundays
8:45am - Pastor's forum
10am - Worship Service
11am - Coffee & Fellowship
| Vacation Bible School is June 20-24th!
Click here to register!
Or you can download a PDF copy here.
Come join the FUN at FPCHS!
Join Us for Worship
- 10:00 a.m. Sunday (8am & 10am Sundays - June through August)
- Worship for all ages
- Children attend Children's Church after the welcome & children's message
- Nursery care available
- Refreshments in the Gathering Place
- Special accommodations include wheel chair accessibility, large print bulletins/hymnals, and hearing assist
- Communion takes place the first Sunday of the month
Now Streaming Live!
Please join our services on-line as they occur (Sundays 9:50 to 11:00 a.m.), by visiting FPCHS Live Streaming.
To view this past Sunday's sermon, please click here.
You may find Archived Sermons on our 'Worship Services' tab above.
Church Location
First Presbyterian Church
7940 Cemetery Road
Harbor Springs, Michigan 49740
Phone: (231) 526-7332
Office Hours:M-F 8:00am-4:00pm
Directions: From Petoskey, travel on M119 to the blinking light in Harbor Springs.
Turn right onto E Lake Rd. and then in about 2 miles right on Cemetery Road. Church is on the corner of
Cemetery and Lake.
This Week's Worship
Sunday, May 8 at 10am
"Easter People Witness"
Pastor Kip Murphy
Click here for 5/1/16 bulletin
Click here for 5/1/16 annoucements
Online Bible Resources
We are a Stephen Ministry church offering Christ-centered care and support, one to another.
For more info on our Stephen Ministry program
Learn about becoming a trained Stephen Minister
Prayers Needed?
Do you know someone who you would like to be added to our prayer list or who needs a visitation? Please let them know first, and then call the office (526-7332). We will ask for the correct name spelling and any other information that they would like to be shared with our Deacons. Stephen Ministers are also available to support these needs.