Aspects of the disclosure provide a paging method. The method can include performing, by processing circuitry of a user equipment (UE), a downlink synchronization based on an synchronization signal (SS) block of an SS block burst received from a base station in a beamformed wireless communication system, detecting paging downlink control information (DCI) that is collocated with the SS block, and obtaining a paging message or a short message based on the paging DCI.

The background description provided herein is for the purpose of generally presenting the context of the disclosure. Work of the presently named inventors, to the extent the work is described in this background section, as well as aspects of the description that may not otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admitted as prior art against the present disclosure.
High frequency bands (e.g., above 6 GHz) is used in 5th Generation (5G) wireless communication systems to increase system capacity. Beamforming schemes can be employed to focus transmitted and/or received signal in a desired direction to compensate for unfavorable path loss of high frequency signals. For example, a base station may perform a beam sweeping to cover a serving area.
Paging can be used for network-initiated connection setup when a device is in radio resource control (RRC) idle mode. For example, the device can sleep with no receiver processing most of the time, and briefly wake up according to a predefined cycle to monitor paging information from the network.

Paging in beamformed wireless communication system


Disclosed is a data deduplication method for an edge computer. The method is performed in a key-value store, and may include receiving a compaction request occurred from the key-value store to a metadata layer, checking whether deduplication for removing duplicated data is required when compaction of a metadata file is performed in response to the received compaction request, and removing the duplicated data by checking whether the deduplication is required.

Log-structured merge tree (LSM tree)-series key-value stores have become dominating databases for a big data system. The key-value stores provide an interface each to implement, and automatically perform garbage collection by applying a compile procedure on a multi-level structure. A CaseDB provides various advantages by significantly reducing write amplification using a metadata compaction scheme. However, there is a space amplification problem in an update-intensive workload.
Such an LSM tree implements a multi-level structure in which a lower level adopts a greater space than a higher level. New data is first located at the highest level having the smallest space. As the space is filled up, the new data is moved to a lower level through a compaction process. The compaction process merges data of two adjacent levels and then data merged at a lower level. After data is read and compacted according to a specific key range, sorted data is written at a lower level again, and old data at a previous level is deleted.
Through an implementation of the LSM tree structure, the CaseDB does not immediately perform deletion, but delays a deletion task for the compaction process, so that the amount of deprecated data is increased.

Deduplication-adapted CaseDB for edge computing


A wheeled snow shovel is provided with a rotation about two intersecting axis to allow shoveling of snow at one location and discharge of the picked up snow and discharge of snow at a different point by rotation of the shovel with a sidewise rotation.

Shovels for digging in the ground as well as manually lifting and moving particulate material have been used for what can be reasonably referred to as "ages." Perhaps the best known shovel is the conventional spade shaped shovel having a curved blade which is widely used for digging in and moving earth, or the recently ubiquitous coal shovel used for shoveling coal from a coal bin into a heating furnace or firebox of coal stoked steam engines. Coal shovels are designed for scraping along a flat surface, and, unlike shovels for digging in the ground, usually have flat bottoms, plus low sides to self limit the load picked up. It is not surprising then that the conventional coal shovel was in earlier times frequently used to shovel pavements and road surfaces which are also usually desirably flat.
Coal stokers such as "firemen" on trains and "stokers" on ships who "stoked" coal on a regular basis tended to develop strong muscles in their backs and shoulders which could stand up to persistent shoveling. Snow shoveling, however, is performed by most only on an intermittent or as required basis, particularly in the temperate climates. Local government regulations generally require outdoor surfaces such as footpaths, pavements, driveways and the like to be cleared by the owners, many of whom seldom otherwise lift heavy loads and have weak muscles and thus are prone to musculoskeletal strains, especially to the lower back, shoulders, arms, and knees, as well as other physiological maladies from shoveling. Such maladies not infrequently can lead to long term injuries such as slipped discs in the spinal column and progressing into other physical symptoms which can at times be seriously debilitating and cause physical incapacitation due to accompanying pain and other medical problems. In addition, it is well known that strenuous shoveling can cause a sudden increase in blood pressure and heart rate, while the cold constricts the blood vessels and decreases oxygen to the heart, which together can trigger a heart attack, particularly in those with existing risk factors or a sedentary lifestyle.
Not surprisingly, therefore, inventions have been described in patent documents and the literature in general to make snow shoveling easier and to prevent the suffering and expense that such injuries often result in. All kinds of innovations with respect to handle structures, lifting blades and other arrangements for snow shovels have been described and used with varying success. For example, most snow shovels are now made using lighter materials, such as plastic and aluminum, and in general are more ergonomically designed. Nevertheless, there remains a need for a snow shoveling device that further reduces the amount of physical exertion required in manual shoveling and which maximizes the use of mechanical force and leverage to lift and dump loads of snow.


Systems and methods for hydroprocessing a heavy oil feedstock, the system employs a plurality of contacting zones and separation zones and an interstage solvent deasphalting unit. The contacting zones operate under hydrocracking conditions, employing a slurry catalyst for upgrading the heavy oil feedstock, forming upgraded products of lower boiling hydrocarbons. In the separation zones which operates at a temperature within 20° F. and a pressure within 10 psi of the pressure in the contacting zones, upgraded products are removed overhead and optionally, further treated in an in-line hydrotreater. At least a portion of the non-volatile fractions recovered from at least one of the separation zones is sent to the interstage solvent deasphalting unit, for separating unconverted heavy oil feedstock into deasphalted oil and asphaltenes. The deasphalted oil stream is sent to one of the contacting zones for further upgrade.

The petroleum industry is increasingly turning to heavy oil feeds such as heavy crudes, resids, coals, tar sands, etc. as sources for feedstocks. These feedstocks are characterized by high concentrations of asphaltene rich residues, and low API gravities, with some being as low as less than 0° API.
PCT Patent Publication No. WO2008/014947, US Patent Publication No. 2008/0083650, US Patent Publication No. 2005/0241993, US Patent Publication No. 2007/0138057, and U.S. Pat. No. 6,660,157 describe processes, systems, and catalysts for processing heavy oil feeds. In embodiments of the prior art, the slurry catalyst concentration significantly increases in the last reacting zone, creating abnormal distributions of the flow within the reactor, solids deposition and unstable reactor operation. In high conversion slurry hydroprocessing units (with a conversion rate of >90%), if the solids content in the system is not properly controlled, the reactor can ultimately dry up and deposit solids reducing the effective reactor volume.
There is still a need for improved systems and methods to upgrade/treat process heavy oil feeds.

This patent is subject to a terminal disclaimer.

Systems and methods for producing a crude product


A seal pattern of a liquid crystal display ("LCD") is disclosed. First and second seal patterns are formed on a substrate having an active area thereon so as to surround the active area. The second seal pattern is provided with a second liquid crystal injection port which has free ends which are outwardly turned to form a hook shaped cross-section.

The present invention relates to a seal pattern of a liquid crystal display ("LCD"), and more particularly, to a seal pattern of an LCD in which a high quality seal pattern can be repeatedly manufactured.
2. Description of the Related Art
LCD's that are widely used in very small portable TV's and laptop or notebook-type computers consume less power than conventional cathode ray tube displays. These LCD's also make such devices lighter and thinner. Thus, LCD's are finding more and more use. A conventional LCD includes an upper substrate having a common electrode, a lower substrate having pixel electrodes and thin film transistors, metal wiring, etc., for activating the pixel electrodes, a seal pattern for sealing the upper and lower substrates with a predetermined gap therebetween, and a liquid crystal material filling the space between the upper and lower substrates.
FIG. 1 is a plan view of a conventional LCD. An rectangular active area 11 is formed on a central part of a lower substrate 12 made of transparent glass. Pixel electrodes and thin film transistors, metal wiring, capacitors, etc. , for activating the pixel electrodes are provided on the active area 11. A seal pattern 13 is also formed on the lower substrate 12 about the active area 11, spaced a predetermined distance therefrom.
A liquid crystal injection port 14 for injecting the liquid crystal material is provided on one side of the seal pattern 13 as seen in FIG. 1. A seal bar 15 is formed between the liquid crystal injection port 14 and the active area 11. An end seal 16 is provided for sealing the injection port 14. The seal bar 15 prevents the end seal 16 from penetrating into the interior of seal pattern 13. The seal pattern 13, seal bar 15, and end seal 16 are formed with a predetermined height corresponding to the gap between the upper and lower substrates. The seal pattern 13, seal bar 15, and end seal 16 are formed by an adhesive insulating epoxy or the like.
The assembly process of the conventional LCD after forming the seal pattern 13 and the seal bar 15 on the lower substrate is as follows.
The upper substrate (not shown) having a common electrode is positioned and mounted on the lower substrate 12 having seal pattern 13 and seal bar 15 formed thereon. A predetermined amount of pressure is applied to the upper substrate and lower substrate 12 and heat is applied to harden material constituting the seal pattern 13 and seal bar 15. The liquid crystal is then injected through the liquid crystal injection port 14 after a vacuum is created in the space between the upper and lower substrates. Lastly, a cleaning process to remove loose epoxy debris is performed after sealing the liquid crystal injection port 14 with end seal 16.
In the above-described seal pattern process for a conventional LCD, the upper substrate is pressed during a heat treatment step after the upper substrate has been mounted on the lower substrate. At this time, pressure is typically not evenly applied to the seal pattern, causing the gap between the substrates to be irregular. This diminishes the operational reliability of the LCD.
In addition, the seal pattern integrity can be broken be dirt, chemicals, or other contaminants on the seal pattern, or the upper and lower substrates when the gap between the substrates is in a vacuum state. This again diminishes the quality of the LCD.
Finally, the end seal may leak during the cleaning process (typically a brushing process), again diminishing the quality of the LCD. Specifically, the integrity of the end seal is dependent on secure adhesion between the end seal and the injection port. This adhesion is susceptible to being disrupted during the cleaning process.

Double seal pattern for a liquid crystal device with curved ends


A method for generating an upgrade plan for assets included in a virtualized computing environment includes receiving a selection of one or more target assets to receive updates. The method further includes receiving a selection of one or more upgrade packages, determining a first set of target assets that is capable of being upgraded with at least one selected upgrade package, determining a second set of target assets that depend on the first set of target assets, and generating an upgrade plan for the first set of target assets and the second set of target assets.

Computer virtualization is a technique that involves encapsulating a physical computing machine platform into a virtual machine that is executed under the control of virtualization software running on a hardware computing platform (also referred to herein as "host system" or "host computer"). A group of hardware computing platforms may be organized as a cluster to provide the hardware resources for virtual machines. In a data center that employs virtual machines, it is common to see hundreds, even thousands, of virtual machines running on multiple clusters of host systems.
Cloud computing refers to distributed allocation of computing resources via a computer network rather than from a single local computer. A "cloud" can include one or more host computers that can be arranged as clusters of host computers. In addition, host computers and clusters of host computer can be arranged in a data center, and multiple data centers can be arranged as "virtual centers."
Both the initial install and upgrade of the cloud computing environment are often complicated because the interrelationships between various components of the cloud computing environment can be hard to track. For example, differences between hardware, firmware, and software versions of the various components can cause problems in a first component as a result of an installation or upgrade in a second component. If any one component does not install or upgrade successfully, then an entire data center can be rendered inoperable. The administrator must often account for many dependencies between assets and their individual versions, further adding complexity to the install and upgrade process.
Using conventional techniques, a system administrator must plan installs and upgrades very carefully. These processes can be quite complex, since upgrading one asset may require upgrading a few others as well, and this may continue as a domino effect. Furthermore, there may be critical systems running on the virtualized computing environment (e.g., at the data center level), leaving no room for error or downtime.
Another problem with current approaches to installs and upgrades is that conventional approaches typically involve a significant amount of effort by the administrator. The administrator must first take the initiative to discover what new features are available. Later, when creating an install and upgrade plan, the administrator must carefully research (e.g., online) for any information about what precautions to take or dependent installs must be run.
Accordingly, there remains a need in the art for a technique for managing a cloud computing environment that addresses the drawbacks and limitations discussed above.

Interactive and visual planning tool for managing installs and upgrades


A system for topology directed subdivision of a pair of surfaces to identify intersecting portions thereof includes the steps of obtaining a pair of surfaces from a main pool of surface representations and performing a mutual point exclusion test to determine if the surfaces may have an intersection. For those pairs of surfaces possibly having an intersection, the transversality of the surface is checked. If transversal, the intersection set is computed. For those pairs which are not transversal, recursive subdivision is performed until transversality is established or until a flatness criteria is met. A parallel processing system including a master processor and a plurality of slave processors performs the subdivision operation on the surfaces in a parallel fashion.

Solid-modeling in the realm of computer-aided shape design has rapidly emerged as one of the most important and challenging fields of manufacturing research and development. Although activity in this area was initiated by computerized drafting systems serving as no more than electronic drafting tables, its applications today exist in areas ranging from realistic image generation to CAD/CAM and robotics.
The roots of solid-modeling technology can be traced back to the computer-aided drafting systems that were developed during the early 70's; these systems--aptly called wireframe systems--could only handle the drafting of primitive points and curves. Soon, however, the need was felt for extending this facility to not only drafting with CAD systems but designing with them. Since solid parts cannot be modeled unambiguously by only points and lines, drafting systems were soon replaced by the so called solid-modeling systems. Today there are a host of solid-modeling systems available from commercial vendors or from universities.
The use of solid-modeling systems, however, has not been able to graduate much beyond producing shaded-graphics and computing mass-properties. Even for these simple applications, the domain of the modeling system is severely restricted. Amongst the variety of reasons that can be cited for the break in the previously phenomenal growth-rate of this technology is the fact that the algorithms used for various processing needs within solid-modeling systems are either not efficient, not reliable, or not general enough in their domain of application.
The ability to compute the intersection of two surfaces usually forms the heart of a solid-modeling system. Such processing is useful not only in building an internal representation for the object from its description, but also in applications such as collision-detection, that are built upon it. Many algorithms have been proposed to compute intersections of surfaces. However, the lack of a computationally efficient algorithm applicable to a wide range of surfaces has made the application of solid modeling systems infeasible in areas such as robotics, where complex processing operations such as sweeping are required.
Reliable intersection algorithms are known for quadric surfaces but they are not applicable to other surfaces such as bicubic patches or B-spline surfaces since they capitalize heavily on properties specific to the class of quadric surfaces. On the other hand, there are edge-tracking algorithms implemented in solid-modeling systems such as BUILD, ROMULUS and TIPS-1 that are potentially applicable to a wide variety of surfaces, but they need an initial point on each component of the intersection set before they can trace it out. Since there are no known reliable methods to even determine mine the number of components of the intersection set in general, these algorithms tend to be unreliable. In general, each algorithm has some advantages and disadvantages; there is no clear supremacy of any one intersection algorithm over the others and research continues on almost all of them.
Algorithms designed to compute intersections of surfaces need to satisfy certain criteria that arise in the context of solid-modeling. Some of these considerations are generality, reliability, accuracy, robustness and speed. An intersection algorithm should be general enough to handle as wide a variety of surfaces as exits in the domain of a solid-modeling system. For systems that model all surfaces under a uniform scheme the criterion is met automatically by any one intersection algorithm. However, for systems that use surface-specific properties in order to design special purpose, high speed algorithms, the amount of work required to include a new surface in the modeling domain can be prohibitive. This inhibits the upward expansion of a solid-modeling system and supports, at best, a very constrained modeling environment.
The intersection for geometric entities may be invoked in a solid-modeling environment towards two different ends.
1. to detect the intersection of two solids--here only a boolean result is desired--or PA0 2. to construct a representation of the intersection set from the representations of the intersection solids.
Lack of reliability has different implications in the two above cases.
For purely detection purposes, reliability is important from the point of view of functionality. For example, in the automatic generation of numerical code for machining, a rapid traversal command may be inserted along a path where no collision with the workpiece or the fixtures is detected. However, if, in fact, there is a collision, then the tool is liable to break since tools are typically not designed to handle cutting at feed-rates of the order of rapid-traversal speeds. Similarly reliability is crucial in applications such as robot-motion-simulation and part-assembly verification systems.
When the intersection operation is used to construct a representation of the intersection set from the representation of the intersecting solids then unreliable intersections can cripple the algorithm by creating inconsistent topological data which do not permit proper termination of the algorithm. Considerable care therefore needs to be taken to detect all components of the intersection set. Algorithms suffering from this problem can be found in solid-modeling systems such as TIPS-1. The property of a solid-modeling system that prevents a system from terminating due to such internal errors, is also referred to in literature as robustness.
An intersection algorithm that computes approximate intersections from object representations does so only with a certain accuracy. The inaccuracies due to the algorithm itself are different from and in addition to those due to roundoff errors in floating point digital arithmetic. Such systems must then be able to compute how close the approximations are to the actual intersection sets. Different definitions of "closeness" may be formulated--each meaningful in the context of a desired application. One could, for example, call an intersection small if the diameter of each face is smaller than a defined .epsilon.. On the other hand it may be called negligible if two planes can be determined that are some .epsilon. apart and contain the intersection set between them.
The need to determine whether an intersection is meaningful or not exists, for example, in keeping topological information consistent and in applications such as part assembly verification. Accuracy measures are also needed in order to estimate faithfulness of representation under various operations. In a flexible modeling system, intersection sets may be further operated on by functions such as sweep, intersect, etc. The representation of the final object so created may be geometrically--and even topologically--far from its actual representation because of accumulation of inaccuracies and magnifications thereof during operations. Such magnifications occur, for example, when points near a singularity are mapped; small errors in the points can get magnified to appreciable amounts in such operations.
The desire for high speed intersection operations, although practically contradictory to the idea of reliable intersections, is almost as important. Speed is essential for an effective design and manufacturing environment based on solid-modeling. In applications such as NC machining, thousands of swept volumes are typically created--one due to each cutter move. Each one of these is treated as a solid and subtracted from the workpiece. Constructing the actual representation of the finished workpiece from such complex solids can take upwards of 2 to 3 hours on a high speed mainframe.
The existing methods for intersections of solids may broadly be classified into two categories: exact and approximate methods. This categorization is not very rigid and is based broadly on the level of approximations that the intersection algorithm may assume. It is emphasized that this distinction is fairly nebulous and a wide-variety of algorithms pass off as what is known in literature as "semi-analytical methods".
The methods that fall into the exact method category are those that derive an exact representation of the intersection set through algebraic or semi-algebraic means from exact representations of the intersecting surfaces. They incorporate techniques from algebraic geometry and numerical linear-algebra to yield algorithms that are systematic are reliable. The substitution method, quantifier elimination method, Levin's Algorithm and Ocken's Method, are examples of the exact method intersection algorithm.
In contrast with the exact methods, the number of algorithms in the category of approximate methods is much larger. Also these methods are much more widely used in current systems because they are easier to encode and often more general. However, this is almost always at the cost of reliability and accuracy. Some algorithms are based on fairly sophisticated mathematical techniques while others are purely searching schemes adapted for the intersection problem. One numerical method, known as Morgan's Method and incorporated into GMSolid, has been found successful in practice. However, the method is good only for the intersections of three surfaces that yield a finite set of points and is not meant to compute a representation of the intersection of two surfaces. It can be used to compute a set of points along an edge of intersection, but it is not clear if it does so reliably and efficiently. Moreover, the method is limited to algebraic surfaces and degrades very fast with the degree of equations involved.
Also in the class of approximate methods are the polygonal algorithms. These algorithms compute intersections of a faceted representation (a piece-wise linear approximation) of the intersection surfaces. The computations involved are simple and fast, and hence, numerous commercial geometric modeling systems (such as Geomod, CITIA etc.) based on this intersection algorithm have cropped up. A very serious disadvantage of this algorithm, however, is its lack of reliability and accuracy: approximating badly oriented surface patches as flat polygons is subject to serious pitfalls whereby erroneous results may be obtained.
Tracking algorithms are also in the approximate method category and use an iterative procedure that assumes facilities such as computations of normal vectors and computation of the distance of a point from a surface. The main idea is that given a point x on the intersection edge, a good estimate to the next one may be obtained by stepping out in the direction of the tangent vector to the edge at x. Iterative techniques can then be used to "pull" the point down to an actual intersection point.
The tracking method is very general, and has been implemented in geometric modeling systems such as TIPS-1 and ROMULUS. The disadvantage of this algorithm is again the lack of reliability: Firstly, it assumes that the intersection set is actually an edge--in reality it may be only a point or itself a surface. Secondly, it needs an initial point on each component of the intersection set to start the tracking procedure. This has to be done by some heuristic means. The method is in general inefficient as well since the number since the "pulling" operation can be very expensive.
One other algorithm belonging to the class of approximate algorithms and the one germane to the present invention is the subdivision algorithm. The subdivision algorithm for computing intersections of surfaces is based on the divide and conquer paradigm. Given a surface and a processing task, the idea is to recursively subdivide the surface into smaller and smaller patches until each patch is small enough that processing a geometric approximation to the patches instead of the patches themselves yields results accurate to within acceptable bounds. This approach was first used by Catmull (See E Catmull, "A subdivision Algorithm for Computer Display of Curved Surfaces," University of Utah Comp. Sci Dept. UTEC-CSC-74-133, 1974), in generating shaded images of curved surfaces. A very natural extension of this scheme was found in computing intersections of curved surfaces. The intersection algorithm was first developed for B-spline surfaces (See Jeffery M. Lane and Richard R. Riesenfeld, "A Theoretical Development for the computer Generation and Display of Piecewise Polynomial Surfaces," Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-2, No. 1, January 1980), and later extended to include general parametric surfaces (See S. P. Madur, P. A. Koparkar, "Interval Methods for Processing Geometric Objections", IEEE CG&A, February 1984). The subdivision algorithm is very general in terms of the surfaces it can be used for. The disclosures of the above three publications are hereby incorporated by reference herein with particular respect to computation of intersections in the Madur publication.
A big advantage of the subdivision algorithm for intersection of surfaces lies in the fact that it works with a clear interface between the intersection algorithm and representation schemes. Hence, it is not tied to any representation scheme and is limited only by the existence of the defined interface. In this respect it is similar to approximate schemes such as the tracking method for computing intersections. Another advantage of the intersection algorithm is its reliability: theoretically, since surfaces can be subdivided to as small a size as possible, all intersections can be found. However, as will be shown below the current form of the algorithm cannot be both reliable and efficient.
The subdivision algorithm is capable of computing an arbitrarily close approximation to the intersection set by subdividing the surfaces to finer and finer levels. The prescribed way of controlling the closeness of the approximation is by suitably changing the flatness criterion. It may be noted, however, that in reported versions of the algorithm, the quantitative relationship between these two measures has not been explored or exploited.
A serious drawback of the subdivision algorithm is that, since in practice infinite sub-divisions are not possible and a linear approximation is used at some stage, it can sometimes miss a component of the intersection set. This becomes quite obvious if we assume that the surfaces shown in FIGS. 1 and 2 are flat to within the prescribed flatness criterion and follow the steps of the subdivision algorithm. For the case in FIG. 1, the intersection of the planar approximations to the surfaces will result in a straight line closely approximating the actual curve of intersection. For the situation in FIG. 2, however, such an approximation is not assured because the curve of intersection is a closed curve lying entirely in the interior of the surfaces. Interestingly, a curve with such a topology cannot possibly be obtained by the intersection of planar polygons.
As explained above, for some applications an intersection such as the one in FIG. 2 may be negligible. In fact, since the surfaces are flat to within some predefined tolerance limit and it may be acceptable to neglect intersections of such a nature. But for certain other applications, such an intersection may not be negligible. For example, it may be required to produce a new surface by sweeping the curve obtained by intersecting the given surfaces. In this case, it is not the flatness but the diameter of the intersection that has to be small for the intersection to be negligible. In general, a reliable solid-modeling system cannot choose to neglect such intersection.
To get around this problem, one may think of prescribing a more stringent flatness criterion. This, however, is not a general solution since--as emphasized by reported subdivision-algorithm implementations (See Elizabeth G. Houghton, Robert F. Emnett, James D. Factor, and Chaman L. Sabharwal, "Implementation of a divide-and-conquer method for the intersection of parametric surfaces", Computer Aided Geometric Design, 2, 1985, 173-183--one can construct a case as in FIG. 2 for any given flatness criterion.
A surer remedy, motivated by the fact that computer arithmetic and real life applications work only with finite precision, is to subdivide each surface until the patches are smaller than some working precision. Another approach on similar lines would be to subdivide each surface until it is flat to within such a working precision. Once the new definition of intersection based on the working precision has been incorporated into the algorithm (mainly in the polygon-intersection procedure), it could conceivably be made to yield approximations to the intersection set that are accurate to around the working precision. However, without even going into the details of implementation of such approaches, the following objections can be raised against them. First, the initial approach will be wasteful in general since it will subdivide surfaces intersecting as in FIG. 1 to the same extent as surfaces in FIG. 2. In the latter case, some new topological information may be uncovered by the refined subdivision. However, the only result of refined subdivision for a situation as in FIG. 1 is to further improve the already good approximation of the edge of intersection. Secondly, similar objection can be raised against the second approach. The intersection for all cases will have to be computed to working precision before the topological aspects--such as the number of components of the intersection set--are known. This is clearly wasteful in an application such as collision detection where it would be sufficient to determine the existence of non-existence of any components. Thirdly, a small tolerance would cause a proliferation of surface patches. Hence intersections may be computed reliably, but only at a considerably cost in terms of storage and computations.

Solid-modeling system using topology directed subdivision for determination of surface intersections


A method and apparatus for routing a telephone signal having a call destination indicator via a client-server network to a desired user, wherein a server contains an association between user identifiers and telephone destination identifiers, and the server associates each user having a user identifier with a client machine having a client identifier that is employed by the user. The server directs the telephone signal over the client-server network to a telephone appliance coupled to a client machine having a client indicator associated with the user call destination identifier that matches the call destination identifier of the telephone signal.

N/A
N/A
The present invention relates to client-server networks and more particularly a method and system for directing an incoming telephone call to a desired user over a client-server network.
A client-server network architecture is a network in which one computer, the client, requests access to data, software, or services from another computer, the server, which then supplies the requested data, software, or services for the client. In one type of client-server network known as a file server network, a user at a client machine is connected to the server via a local area network (LAN) and accesses data that is centrally located on the server. In general, the user retrieves the centrally located data from the server and locally processes this data using software applications that are stored and executed on the client machine. This type of client, typically referred to as a xe2x80x9cfat clientxe2x80x9d, performs most or all of the processing locally, leaving little or no processing to be performed by the server.
Client-server networks have several advantages over individual personal computers (PCs). One advantage is that by providing centrally stored data, a client server network ensures that the most recent data is always available to the users. Individual clients may operate on the data, but after processing, the data will again be centrally stored on the server. Also, as new data becomes available it becomes available to all of the clients. In addition to allowing multiple clients access to the centrally located data, a user may access this data at a remote client machine. Provided that the needed software is installed on the remote client machine, a user may log onto the server, retrieve data, and then process that data from the remote location thus enhancing productivity. Also, a user may be able to dial into the LAN via a remote client and access the server remotely, for example from their home. This would allow the user to download the desired data, process this data at home and, when finished, save the data back onto the server.
A disadvantage to the client-server network architecture, however, is that when a user is operating a client machine other than their primary client machine, the user will not have access to their computer xe2x80x9cdesktopxe2x80x9d, and any local data stored on their xe2x80x9cownxe2x80x9d or primary machine. For example, a user may use a particular set of macros when using a word processor, spreadsheet, or presentation program. These macros typically are stored locally and would be a part of the user""s desktop. Other examples of items available on a users personal desktop may include particular programming tools or productivity tools the user has developed or purchased. Thus, although a user may have access to the centrally located data, the lack of availability of their personalized desktop and software tools may limit their ability to work efficiently.
Another disadvantage of client-server network architectures is that a user operating at a client machine other than the user""s primary client machine may not have access to incoming telephone calls directed to them. Although a LAN may provide easy user access to centrally located data from different clients, the standard telephone system does not provide a mechanism by which the user""s calls automatically follow the user. The traditional telephone system paradigm that is embodied in the public switched telephone system (PSTN) and private branch exchanges (PBX) is that a user""s phone number is coupled to a single physical telephone located physically proximate to the user""s principle work area. Unless the user manually forwards their telephone calls to a specified remote location, incoming calls will be directed to the single telephone associated with the user.
Recently, another form of the client-server network architecture, known as a xe2x80x9cthin-clientxe2x80x9d network has been developed that addresses some of the problems of a traditional client-server network. In this architecture, a client machine referred to as a thin-client machine is employed. The thin client performs minimal processing, and stores little or no data. The thin client is employed to provide a graphical user interface and to display data and information generated by the server. The thin client includes an interface for communicably coupling the thin client to the server. The server provides the processing power and data storage that is required by the respective thin client. A user may log onto any thin client machine connected to the server and the server, which may store the applications software and the user""s data and desktop, provides the user with their customary operating environment associated with that user. The server performs all the data processing and data storage functions. The thin client provides only the user interfaces to display graphics, text, and data, and to receive user input data. The ability of a user to log onto any one of a plurality of thin clients and obtain access to his usual desktop and computational configuration is known in the art as xe2x80x9chot deskingxe2x80x9d.
A thin-client network architecture offers several advantages over traditional client-server network architectures. One advantage of the thin client network is that a user can access their desktop features including their personal software, data, and tools from the server from any thin-client machine in the network. Flexibility is therefore afforded since multiple users may utilize a single thin-client machine at different times during the day depending on individual schedules, work hours and needs. In addition, a user may select a different thin client machine to use each day, depending on the availability of the machines. This flexibility may result in better asset management, a higher availability of machines, and a concomitant increase in productivity and efficiency of the users.
However as discussed above, a user of a remote client machine may not have access to the user""s incoming telephone calls directed to a single telephone. A thin-client network architecture may exacerbate this problem even more because of the use of a thin-client network architecture, it is likely that users may not be physically proximate to their telephone. Thus, it is likely that increasing numbers of telephone calls may be missed.
Various methods such as voice mail, electronic messaging and call forwarding have been attempted to overcome this lack of telephone connectivity, but all have had substantial disadvantages.
It would therefore be desirable to be able to connect telephone signals to a particular user at a telephone communicably coupled to a client station being employed by the respective user so that telephone calls track the user in a hot-desking environment.
Consistent with the present invention, a method and system is disclosed for directing a telephone signal intended for a user of a client-server network to a telephone appliance communicably coupled to the client being employed by that user and for creating a telephone connection between the telephone appliance and a calling party. The user is identified to the client via a logon process, a smartcard, biometric identification, or any other suitable user identification technique. The client forwards a user identifier associated with the user to a server within the client-server network. A telephone number or other such user call destination identifier is associated with each user and the server maintains a mapping table that stores the user identifier for the respective user along with the associated user call destination identifier for that user. In response to receipt of the user identifier from a particular client, the server associates a client identifier associated with that client with the entry in the table that includes the corresponding user identifier. In response to receipt at the server of a telephone signal initiated by a calling party and having a specified call destination identifier from a calling party, the server directs the telephone signal to the client associated with the matching user call destination identifier in the mapping table and establishes a connection to permit voice communication between the user at a telephone appliance coupled to the respective client and the calling party.
Other forms, features and aspects of the above-described methods and system are described in the detailed description that follows.

Method and system for integrating telephone voice communications into a client-server architecture


This disclosure relates to a system for monitoring walls. The system receives first and second image data representing two-dimensional locations of multiple points of the wall associated with a first and second point in time, the second point in time being later than the first point in time. The system also receives depth data from a depth sensor indicative of a change in depth of the wall between the first point in time and the second point in time. The system then determines data indicative of a change of the two-dimensional locations of the multiple points of the wall between the first point in time and the second point in time based on the first image data, the second image data, and the depth data. This means correlations between the image data and the depth data can be considered, which allows accurate perpendicular line of sight monitoring.

FIG. 1 refers to application in mining and illustrates a simplified open-pit mine 100. The mine 100 comprises an ore deposit 102, two blasthole drills 104 and 105, a shovel 106, empty trucks 108 and 110 and loaded trucks 112, 114 and 116. The mine 100 further comprises a supply machine 118, such as a fuel truck. The drill 104 drills blastholes, the material is blasted and then loaded onto truck 110. The truck 110 then transports the material to a processing plant 118. Similarly, drill 105 also drills blastholes for later blasting.
While some of the examples herein relate to the mining of iron ore, it is to be understood that the invention is also applicable to other mining and non-mining operations, such as extraction of coal, copper or gold or monitoring of deformations of natural or man-made slopes, excavations, constructions and mobile plants.
Mine 100 further comprises a control centre 122 connected to an antenna 124 and hosting on a computer 126 a mine control system. The mine control system 126 monitors operation and status data received from the mining machines wirelessly via antenna 124. In one example, the control centre 122 is located in proximity to the mine site while in other examples, the control centre 122 is remote from the mine site, such as in the closest major city or in the headquarters of the resource company.
As a result of in situ stresses in the rock mass, sub-optimal mine design given the uncertain geological conditions, continuous blasting and extraction of material from mine 100 or a combination of the above, some areas of mine 100 may become unstable. For example, an area 130 is highlighted in FIG. 1, which may become unstable. Unstable areas, and in particular, unstable walls, such as slopes, can fail and collapse, which poses a significant risk to the live of staff as well as to the commercial operation of the mine.
There exist monitoring systems that monitor potentially unstable areas, such as systems using laser range finders and radars. These existing systems generally monitor the line of sight movement. That is, these existing systems monitor whether the potentially unstable area moves towards or away from the laser and/or radar. A significant acceleration can indicate that the area is unstable and the system can raise an alarm. In many cases, however, the prediction of instability is inaccurate and in particular, areas have become unstable where the line of sight movement and/or acceleration did not indicate any problems.
US 2004/0046690 discloses a phase map calculated from radar images and video data to serve as a visual history of faults. While this offers a visual aid to the operator for monitoring line of sight movements, the outcome suffers from the above problem of insufficient inaccuracy especially when used for automatic monitoring without relying on a human operator.
U.S. Pat. No. 8,154,435 Pett discloses using a 2D interferometric synthetic aperture radar (InSAR) technique that provides a third resolving dimension. In particular, the third dimension is resolved by using a multi-baseline differential InSAR approach from two separate phase centres. While this solution is not limited to line of sight movement, it relies on multiple radar locations, which increases installation cost and complexity. Further, radar measurements have poor spatial resolution, which again leads to inaccurate results.
Any discussion of documents, acts, materials, devices, articles or the like which has been included in the present specification is not to be taken as an admission that any or all of these matters form part of the prior art base or were common general knowledge in the field relevant to the present disclosure as it existed before the priority date of each claim of this application.
Throughout this specification the word "comprise", or variations such as "comprises" or "comprising", will be understood to imply the inclusion of a stated element, integer or step, or group of elements, integers or steps, but not the exclusion of any other element, integer or step, or group of elements, integers or steps.

Commonwealth Scientific and Industrial Research Organisation


A rubber pad comprises a support plate having substantially the same shape as an outer surface of an iron shoe plate provided on its outer surface with lugs, a rubber block vulcanized and adhered to the support plate, wherein the support plate is provided with a bolt or a female member fixed to at least one side face of the support plate, a hook member fixed to the support plate at a position opposite to the bolt or female member. Further, the rubber pad is provided with a fastening member securing the rubber pad to the iron shoe plate through another female member or bolt.

1. Field of the Invention
This invention relates to a rubber pad post-fitted to an iron shoe crawler.
2. Description of Related Art
Recently, a shoe pad is widely used in a traveling portion of a construction machine, earth-moving machine or the like. Since the shoe pad is formed by covering an iron shoe plate fixed to a link with a rubber pad, there are many advantages in that the shoe pad does not damage the road surface, and vibrations transmitted to an operator are reduced, and the like. Furthermore, if the rubber pad is broken, only the broken rubber pad is replaced with a new rubber pad.
In general, the rubber pad is fixed to the iron shoe plate by utilizing a bolt produced from the rubber pad through a nut. However, it is difficult to attach the rubber pad to the iron shoe plate at a state of fixing the iron shoe plates to a machine body. Also, the detachment of the nut from the bolt becomes frequently difficult.
Particularly, it is difficult to conduct the attachment or detachment between the bolt and the nut at the inside of the machine body and also it is difficult to remove the rubber pad from the iron shoe plate in the replacement of the broken rubber pad. Thus, there is a need to facilitate the replacing operation. Because, the attaching or detaching operation between the bolt and the nut must be carried out at a narrow space, and further substantial labor is taken in the operation of removing mud and the like from the nut potion before the detachment of the nut.
Additionally, a mudhole is formed in the iron shoe plate between lugs of the plate. The mudhole is a path of removing mud that has invaded into a back face of the shoe plate. When the rubber pad having no mudhole is fixed to such an iron shoe plate, a support plate for the rubber pad is deformed by an invasion force of mud into the back face of the shoe plate, so that the combination of the shoe plate and the rubber pad does not come into a practical use.


A batch vapor deposition process for applying adhesion promoter during manufacturing of nanoimprinted discrete track media and bit-patterned media, and mono-molecular layer lubricant on magnetic recording media are disclosed. The adhesion promoter is simultaneously coated on both sides of numerous disk substrates, and minimal solution is wasted. In another step, the lubricant is applied at a uniform thickness that is on the order of a single molecular layer. The lubricant is also applied on the entire disk surfaces while processing multiple disks at a time. Batch processing increases throughput, and vapor lubricant reduces costs compared to conventional techniques. Limited air exposure controls bonding and monolayer adsorption guarantees uniformity.

1. Technical Field
The present invention relates in general to vapor deposition and, in particular, to an improved system, method and apparatus for batch vapor deposition of adhesion promoter for manufacturing imprinted discrete track media and bit-patterned media, and/or a mono-molecular layer of lubricant on magnetic recording media.
2. Description of the Related Art
The first step in the nanoimprinting process of discrete track media (DTM) or bit patterned media (BPM) is to apply an adhesion promoter (AP) onto the substrates. Without AP the resist material applied in the subsequent step would be peeled off from the substrate during the later release step. AP is normally applied through conventional spin-coating techniques. Spin-coating can only coat one side of the substrate at a time, and much of the expensive AP material is spun off and wasted during this inefficient process. Moreover, the throughput of spin-coating is limited to one substrate at a time. A more efficient process needs to be developed for coating both sides of a disk substrate at the same time, while using a minimal amount of AP material to reduce waste.
In a related matter, the areal density of magnetic recording media continues to increase. As a result, the thickness of the lubricant used to coat the media after the media is fabricated must become thinner to avoid affecting the performance of the media. Although currently not possible, the lubricant thickness is expected to approach the absolute minimum thickness of a single molecule of the lubricant (i.e., on the order of 6 to 8 Å). In the future, manufacturing processes will need to be capable of applying much thinner layers of lubricant to sustain the areal density requirements. At such minimal thicknesses, however, it is difficult to achieve uniformity and reproducibility using conventional liquid dipping processes, as the thickness-versus-concentration slope becomes steeper. Another drawback of the dipping process is its slow bonding kinetics due to air exposure after sputtering. In addition, the dipping process requires the use of a solvent, which further increases cost.
One known solution to these problems is vapor lubricant deposition, such as those disclosed in U.S. Pat. No. 6,183,831 to Hughes, and U.S. Pat. No. 6,830,600 to McLeod. In those processes, both sides of a single disk are exposed to a diffused lubricant vapor in a line of sight inside a vacuum chamber. Unfortunately, those processes produce excessive lubricant thicknesses. Additional drawbacks of such approaches are very low throughput and poor uniformity of lubricant thickness compared to dipping. Thus, an improved solution is needed for applying ultra-thin lubricant films on magnetic recording media.

System, method and apparatus for batch vapor deposition of adhesion promoter for manufacturing discrete track media and bit-patterned media, and mono-molecular layer lubricant on magnetic recording media


An apparatus for affixing garment parts, such as pockets to a tubular knit garment body (for example, a T-shirt) which permits conversion of conventional pocket setting equipment, the apparatus providing means to convert the tubular body essentially into a flat undistorted .garment surface prior to and during the stitching operation; followed by subsequent restoration of the tubular garment body prior to stacking.

There are currently a number of pocket setters available which are designed to pre-fold and sew pockets onto essentially flat, single ply garment parts. These machines are used primarily by the shirt, jean and uniform portions of the apparel industry and to some extent by makers of T-shirts. However, since the bodies of T-shirts are made of tubes that are knitted to size, the utilization of pocket setting equipment designed for single-ply garments on or in connection with tubular knit bodies, prior to the present invention, has been extremely difficult, or impossible, without stretching and distortion of the area of the garment body to which a pocket is stitched. Subsequent relaxation of the distorted area after pocket setting results in disparity (puckering) between the garment body and the pocket resulting in unacceptable quality and a high rate of rejection. In fact, it has only been possible to set pockets (although poorly) onto men's size T-shirt bodies (but not youth's or children's sizes) because only the largest sizes may be stretched and distorted sufficiently.
The apparatus of the present invention solves this problem in a unique manner, permits the utilization of standard flat garment pocket setting equipment on tubular knit bodies or alternatively the use of such apparatus on flat garment parts, knitted or woven.

Pocket setter for flat and tabular garments


A top support structure of a tent frame includes a top pivot holder (1), to which a plurality of support poles (10) are pivotally coupled. An elastic member (9) is provided between each support pole and the pivot holder. The elastic member folds and stores elasticity energy when the tent frame is folded and automatically springs the support poles when the elasticity energy is released. A control holder (2) is pivotally coupled to the bottom of the pivot holder, and the control holder has lock pieces (211) which can prop the support poles up to limit their rotation and release grooves (212) adjacent to the lock pieces which can release the limitation. On the top of pivot grooves (12) of the pivot holder are provided with position-limited devices (D) to prevent the support poles from rotating upwards.

1. Field of the Invention
The present invention relates to a tent part, and more particularly to a top support structure of a tent frame.
2. Description of the Prior Art
A conventional automatic extendable tent frame comprises a top pivot holder. The pivot holder has pivot troughs for connection of support poles and elastic units which correspond in number to the support poles. When the support poles are folded downward with respect to the pivot holder, the elastic units provide elasticity. Each support pole is movably connected to the pivot holder and rotatable with relative to the pivot holder. One end of each elastic unit is connected to the support pole and another end of each elastic unit is connected to the pivot holder. It is required to apply a force to retract the support poles inward when folding the tent. When unfolding the tent, the restoring force of the elastic units will expand the support poles up relative to the pivot holder, providing an automatic extendable function. This shows that the top support frame of this tent depends on the elasticity of the elastic units. If the top of the tent is applied with a force, the support poles are easy to be folded downward. Thus, the support strength of the support poles is not enough. The outer support poles may be raised relative to the pivot holder subject to the elastic action of the elastic units. When the tent is influenced by wind force or external force, the tent frame is easy to shake. The tent lacks support stability.


The timing controller determines the number of data lanes (11, 12, 13), which are used to transfer data, based on information in relation to an amount of data to be transferred during a predetermined time period. Out of the plurality of data lanes (11, 12, 13), the determined number of data lane(s) (11, 12, 13) are used to transfer data. Further, a data lane(s) (11, 12, 13) which is not used in the data transfer is deactivated.

In recent years, flat panel displays such as a liquid crystal display device have employed a high-speed serial interface such as LVDS (Low Voltage Differential Signaling) so as to carry out data transfer. In accordance with such a high-speed serial interface, the data transfer is carried out by (i) a transmitter circuit section for transmitting serialized data as a differential signal and (ii) a receiver circuit for differentially amplifying the differential signal.
Patent Literature 1 discloses a technique to carry out the data transfer with reduced power consumption. Specifically, according to Patent Literature 1, a transmitter circuit section includes a plurality of transmitter sections, and data is gathered in a blank bit of data, which is to be transmitted by a certain transmitter section, so that data to be transmitted by another transmitter section is reduced or is reduced to zero. Here, a transmitter section that transfers a small amount of data is set to a low transfer mode, and a transmitter section that does not transfer data (i.e., transfer data amount is 0) is set to a sleep mode. With the configuration, power consumption is suppressed.

Data forwarding circuit, data forwarding method, display device, host-side device, and electronic apparatus


A computer readable medium comprising computer readable code for data transfer. The computer readable code, when executed, performs a method. The method includes receiving, at a first Axon, an ARP request from a source host directed to a target host. The method also includes obtaining a first route from the first Axon to the second Axon, and generating a target identification corresponding to the target host. The method further includes sending an Axon-ARP request to the second Axon using the first route, and receiving an Axon-ARP reply from the second Axon, where the Axon-ARP reply includes a second route. The method further includes storing the first route in storage space on the first Axon, where the storage space is indexed by the target identification, and sending an ARP reply to the first host where the source host is configured to send a packet to the target host.

Ethernet interfaces are standard equipment in a wide range of computer systems, from embedded devices to mainframes. Moreover, switched Ethernet is deployed in a variety of environments, including home networks, office networks, data center networks, and campus networks. A key reason for switched Ethernet's wide-spread deployment is its ease of operation. First, Ethernet equipment will operate with little or no manual configuration. Second, switched Ethernet is self healing (e.g., it can automatically take advantage of redundant network connectivity to recover from network failures).
Switched Ethernet's ease of operation is derived in large part from its ability to flood packets throughout the network. Specifically, flooding enables a packet to reach the destination host's interface without any configuration of that interface or the network, regardless of the interface's location in the network topology. However, because Ethernet packets do not have a time-to-live field, the network topology must not have any cycles. Otherwise flooded packets will circulate endlessly inside the network cycles.


Duty-cycle correction circuits, clock distribution networks, and methods for correcting duty-cycle distortion are disclosed, including methods and apparatus for correcting duty-cycle distortion of differential output clock signals provided from a clock distribution network. In one such method, a single-ended clock signal is generated from differential input clock signals for distribution over a clock distribution network and from which the differential output clock signals are generated. A delay of a model delay path is matched to a propagation delay of the clock distribution network, and the single ended clock signal is adjusted to compensate for duty-cycle distortion.

Clock signals are often used in electronic circuits for timing internal operation of various circuits necessary to execute an operation. For example, in synchronous memories, external clock signals are provided to the memory and internally distributed to different circuits of the circuit to carry out memory operations. Typically, a clock distribution network is used to route internal clock signals generated from the external clock signal to the different circuits. In this manner, operation of the integrated circuit can be coordinated with the external clock signals.
When generating and routing the internal clock signals, however, maintaining the quality of the clock signals while being distributed to the various circuits can present challenges. An example of a challenge to maintaining the quality of the clock signals is generating internal clock signals while maintaining the duty-cycle of the external clock signals. The duty-cycle of a clock signal becomes distorted when the ratio of the high and low portions of a generated clock signal is different than that of the clock signal from which it is generated. Duty-cycle distortion may be process-induced, that is, the device characteristics of the clock generation circuits and clock distribution circuits can shift due to variation in the manufacturing process for the integrated circuit causing the resulting internal clock signal to be distorted. As a result of the duty-cycle distortion, when generating and distributing the internal clock signal, the various circuits receive a distorted version of the external clock signal. Due to the duty-cycle distortion, performance of the integrated circuit may be reduced, and in extreme cases, may cause the integrated circuit to function incorrectly.
Various approaches have been used to manage duty-cycle distortion in generating and distributing internal clock signals. For example, where external differential clock signals (i.e., both a clock signal and its complement) are used, the clock distribution network includes differential clock paths having separate clock paths for each of the differential clock signals. As known, using differential clock paths may reduce duty-cycle distortion in distributing internal differential clock signals to various circuits. This approach, however, consumes significant power to drive the circuitry of the differential clock path and requires considerable space to accommodate the parallel clock paths of the differential clock path.
Another example approach is to generate two internal single-ended clock signals (sometimes referenced as "pseudo-differential") from an external differential clock signal and distribute the single-ended clock signals to be used to generate an internal differential clock signal for the various circuits. This approach also requires two separate clock paths to distribute the single-ended clock signals and suffers from the same issues as using a differential clock path, that is, significant power consumption and space for the two clock paths. Another example approach is to convert an external differential clock signal into a single-ended clock signal for distribution to the circuits. Although this approach has the benefits of using less power and requiring less space for the clock path in comparison to the previously discussed approaches, as known, distributing a single-ended clock signal and generating an internal differential clock signal from the single-ended clock signal is more susceptible to introducing duty-cycle distortion, such as that related to process-induced distortion.

Circuits and methods for clock signal duty-cycle correction


The present invention relates to hematopoietic stem and progenitor cells of neonatal or fetal blood that are cryopreserved, and the therapeutic uses of such stem and progenitor cells upon thawing. In particular, the present invention relates to the therapeutic use of fetal or neonatal stem cells for hematopoietic (or immune) reconstitution. Hematopoietic reconstitution with the cells of the invention can be valuable in the treatment or prevention of various diseases and disorders such as anemias, malignancies, autoimmune disorders, and various immune dysfunctions and deficiencies. In another embodiment, fetal or neonatal hematopoietic stem and progenitor cells which contain a heterologous gene sequence can be used for hematopoietic reconstitution in gene therapy. In a preferred embodiment of the invention, neonatal or fetal blood cells that have been cryopreserved and thawed can be used for autologous (self) reconstitution.

2.1. Hematopoietic Stem and Progenitor Cells
The morphologically recognizable and functionally capable cells circulating in blood include erythrocytes, neutrophilic, eosinophilic, and basophilic granulocytes, B-, T-, nonB-, non T-lymphocytes, and platelets. These mature cells derive from and are replaced, on demand, by morphologically recognizable dividing precursor cells for the respective lineages such as erythroblasts for the erythrocyte series, myeloblasts, promyelocytes and myelocytes for the granulocyte series, and megakaryocytes for the platelets. The precursor cells derive from more primitive cells that can simplistically be divided into two major subgroups: stem cells and progenitor cells (for review, see Broxmeyer, H. E., 1983, "Colony Assays of Hematopoietic Progenitor Cells and Correlations to Clinical Situations," CRC Critical Reviews in Oncology/Hematology 1(3):227-257). The definitions of stem and progenitor cells are operational and depend on functional, rather than on morphological, criteria. Stem cells have extensive self-renewal or self-maintenance capacity (Lajtha, L. G., 1979, Differentiation 14:23), a necessity since absence or depletion of these cells could result in the complete depletion of one or more cell lineages, events that would lead within a short time to disease and death. Some of the stem cells differentiate upon need, but some stem cells or their daughter cells produce other stem cells to maintain the precious pool of these cells. Thus, in addition to maintaining their own kind, pluripotential stem cells are capable of differentiation into several sublines of progenitor cells with more limited self-renewal capacity or no self-renewal capacity. These progenitor cells ultimately give rise to the morphologically recognizable precursor cells. The progenitor cells are capable of proliferating and differentiating along one, or more than one, of the myeloid differentiation pathways (Lajtha, L.G. (Rapporteur), 1979, Blood Cells 5:447).
Stem and progenitor cells make up a very small percentage of the nucleated cells in the bone marrow, spleen, and blood. About ten times fewer of these cells are present in the spleen relative to the bone marrow, with even less present in the adult blood. As an example, approximately one in one thousand nucleated bone marrow cells is a progenitor cell; stem cells occur at a lower frequency. These progenitor and stem cells have been detected and assayed for by placing dispersed suspensions of these cells into mice, and noting those cells that seeded to an organ such as the spleen and which found the environment conducive to proliferation and differentiation. These cells have also been quantified by immobilizing the cells outside of the body in culture plates (in vitro) in a semi-solid support medium such as agar, methylcellulose, or plasma clot in the presence of culture medium and certain defined biomolecules or cell populations which produce and release these molecules. Under the appropriate growth conditions, the stem or progenitor cells will go through a catenated sequence of proliferation and differentiation yielding mature end stage progeny, which thus allows the determination of the cell type giving rise to the colony. If the colony contains granulocytes, macrophages, erythrocytes, and megakaryocytes (the precursors to platelets), then the cell giving rise to them would have been a pluripotential cell. To determine if these cells have self-renewal capacities, or stemness, and can thus produce more of their own kind, cells from these colonies can be replated in vivo or in vitro. Those colonies, which upon replating into secondary culture plates, give rise to more colonies containing cells of multilineages, would have contained cells with some degree of stemness. The stem cell and progenitor cell compartments are themselves heterogeneous with varying degrees of self-renewal or proliferative capacities. A model of the stem cell compartment has been proposed based on the functional capacities of the cell (Hellman, S., et al., 1983, J. Clin. Oncol. 1:227-284). Self-renewal would appear to be greater in those stem cells with the shortest history of cell division, and this self-renewal would become progressively more limited with subsequent division of the cells.
A human hematopoietic colony-forming cell with the ability to generate progenitors for secondary colonies has been identified in human umbilical cord blood (Nakahata, T. and Ogawa, M., 1982, J. Clin. Invest. 70:1324-1328). In addition, hematopoietic stem cells have been demonstrated in human umbilical cord blood, by colony formation, to occur at a much higher level than that found in the adult (Prindull, G., et al., 1978, Acta Paediatr. Scand. 67:413-416; Knudtzon, S., 1974, Blood 43(3):357-361). The presence of circulating hematopoietic progenitor cells in human fetal blood (Linch, (Fauser, A. A. and Messner, H. A., 1978, Blood 52(6):1243-1248) has also been shown. Human fetal and neonatal blood has been reported to contain megakaryocyte and burst erythroblast progenitors (Vainchenker, W., et al., 1979, Blood Cells 5:15-42), with increased numbers of erythroid progenitors in human cord blood or fetal liver relative to adult blood (Hassan, M. W., et al., 1979, Br. J. Haematol. 41:477-484; Tchernia, G., et al., 1981, J. Lab. Clin. Med. 97(3):322-331). Studies have suggested some differences between cord blood and bone marrow cells in the characteristics of CFU-GM (colony forming unit-granulocyte, macrophage) which express surface Ia antigens (Koizumi, S., et al., 1982, Blood 60(4):1046-1049).

Preservation of fetal and neonatal hematopoietic stem and progenitor cells of the blood


A method for inserting images includes the following steps. Sense a touch trace of a user forming a closed loop having an enclosed region and generating a trigger signal if the touch trace forms a closed loop having an enclosed region. Sense handwritten touch input by the user within the enclosed region and generating signals associated with the user's handwritten touch input. Display the closed loop and the sensed handwritten touch input of the user. Determine whether the sensed handwritten touch input associates with an image inserting command in response to the trigger signal. Retrieve an image selected by the user from a storage unit, if the sensed handwritten touch input associates with an image inserting command. And display the selected image within the an enclosed region of the closed loop. An electronic device using the method is also provided.

1. Technical Field
The present disclosure relates to an electronic device and a method for inserting images thereof.
2. Description of Related Art
Many electronic devices provide a function for users to insert images. The user moves the cursor displayed on the electronic device to a position where the user wants to insert an image, and then selects the item for inserting images from a displayed menu to insert a selected image. The user can also select an image before selecting the item for inserting images. Then the electronic device displays the selected image at the position the cursor stops. However, it is inconvenient for the user because the user needs to first select a menu, then select a menu item, as well as selecting an image. Additionally, if the image is not the right size and orientation for the selected insertion point, then the user must go through many more steps and perhaps open other programs to modify the image.
Therefore, what is needed is an electronic device and a method for inserting images thereof to alleviate the limitations described above.

Electronic device and method for inserting images thereof

Hong Fu Jin Precision Industry (ShenZhen) Co., Ltd.


A railcar body comprises at least one panel assembly having a first panel and a second panel, both extending longitudinally along the railcar body and adjacently to each other. The inner wall of the first and second panels, which are longer than their outer wall, respectively have at least a first and a second mating interface which are different from each other and compatible so as to be located at a predetermined distance from each other, thereby creating a gap of a predetermined width between two juxtaposed edges of the panels. This panel assembly is designed to be compatible with a laser welding process.

Several welding processes, such as the Laser Cold Wire (LCW) or MIG welding processes, tolerate very little variation in the width of a gap between two adjacent components to be filled by weld during the welding process and therefore require precise dimensional control. However, the stack-up of tolerances of many intricate welded assemblies can make the width of the gap fall outside the dimensional requirements of these welding processes, resulting in manufacturing difficulties.
There is therefore a need for an assembly, especially for a railcar body, and for a method of assembling such a railcar body, which helps in mitigating such manufacturing problems.

Railcar body made of mating panels having a predetermined gap there in between


An 8 mm video tape cassette capable of rendering back-tension of a tape optimum to minimize damage to a tape edge and and clogging of a head. A hub of a feed reel on which a magnetic tape of 11.0 .mu.m or less in thickness is wound is formed with a diameter of 25 mm or more and preferably 25 to 31 mm.

1. Field of the Invention
This invention relates to an 8 mm vide tape cassette.
2. Description of Related Art
In general, a conventional 8 mm video tape cassette is so constructed that a magnetic tape is arranged in a cassette casing while being wound on hubs of feed and take-up reels each formed with a diameter of about 16 mm. A magnetic tape for the 8 mm video tape cassette is generally classified into two kinds based on its thickness. More particularly, it includes a 13 .mu.m type magnetic tape (thickness: 13.0 .+-.1.0 .mu.m) and a 10 .mu.m one (10.0 .+-.0.8 .mu.m). When recording time is set to be 60 minutes or less, the 13 .mu.m type magnetic tape is typically used because it permits the hub of each of the reels to take up the tape with a sufficient space and exhibits sufficient strength.
When a magnetic tape of a smaller thickness is substituted for the 13 .mu.m type magnetic tape in the 8 mm video tape cassette, the cassette is deteriorated in durability and reliability because the magnetic tape is decreased in stiffness and can be damaged at an edge thereof.


A form fitting heating surface for children's safety car seats having a contoured deformable apertured shape that is adaptable within a car seat on which the child is positioned. The heating surface is electrically connected to the automobile's power supply and is thermostatically controlled. Attachment elements adjustably extend from the heating surface for engagement over a portion of the car seat holding the heating surface insert in place within.

1. Technical Field
This device relates to electrical devices for applying heat to the body of a person by electric resistant wires and more specifically heating pads made of flexible fabric material with a plurality of loop heating wires defining a circuit within.
2. Description of Prior Art
Prior art devices of this type are generally referred to as electric blankets and heating pads. The electric blankets are generally used on beds to add additional heat to the sleeping environment. Heating pads are typically smaller and provide heat to specific portions of the user's body. These devices have electrical resistant heating wires positioned within. See for example U.S. Pat. Nos. 2,281,578, 4,736,088 and 5,151,578.
In U.S. Pat. No. 3,281,578 an electric heating mat is disclosed having a main body member with a plurality of heating elements within.
U.S. Pat. No. 4,736,088 is directed to a therapeutic heating pad and hand muff having a laminated structure which directs the flow of heat into the effective body member.
U.S. Pat. No. 5,151,578 discloses an anisotropically bendable heating pad having stiffening member channels that provide indirect stiffness thereto.


Carrier-bound multicomponent detection system for the colorimetric determination of esterolytically- and/or proteolytically-active ingredients of body fluids, wherein the components of the detection system are present in different reagent layers, and where a liquid exchange between the layers is possible.

The present invention is concerned with a carrier-bound, multicomponent detection system for the colorimetric determination of esterolytically- and/or proteolytically-active ingredients of body fluids.
The detection of esterolytically- and/or proteolytically-active ingredients of body fluids is of great importance, especially in diagnosis of diseases of the kidneys and of the urogenital tract. In these cases, it is important to detect leukocytes in urine on the basis of their inherent esterolytic and/or proteolytic activity. Carrier-bound detections systems, for example in the form of test strips, have proven to be especially advantageous for this purpose because these only need to be dipped briefly into the liquid sample to be investigated and then subsequently, after removal of the strip from the sample, permit a determination of the number of leukocytes/ml of sample, for example on the basis of color formed, within a short period of time. It is thus possible to provide a clean, simple and rapid method for the detection of such ingredient materials in body fluids without complicated time- and cost-consuming manipulations having to be carried out with or on the sample for this purpose.
From the prior art, so-called multicomponent systems are taught as being advantageous detection systems for the colorimetric determination of esterolytically- and/or proteolytically-active ingredients of body fluids, for example of leukocytes, in urine. These multicomponent systems are those reagent systems which comprise several chemical substances, at least one of which is so changed by esterolytically- and/or proteolytically-active ingredients materials of body fluids that the reaction product reacts directly with another component of the detection system or reacts in a reaction sequence with several of the other components of the detection system to give a colored substance which can then be determined colorimetrically. The amount of colored substance formed is a measure of the amount of esterolytically- and/or proteolytically-active ingredients in the sample investigated.
Especially suitable for this type of detection are two-component systems in which an ester is first cleaved by the ingredient materials to be detected, followed by reaction of the resultant hydroxy compound with a further reactive substance to give a colored material. Carrier-bound multicomponent systems based upon this principle are known, for example, from U.S. Pat. Nos. 4,551,428 and 4,749,648.
These patents concern, inter alia, a carrier-bound detection system in which an ester and a diazonium salt are present on the same reagent layer. The ester reacts with a ingredient of body fluid, such as urine, which is esterolytically and/or proteolytically active. The product of the reaction is a hydroxy compound, which then reacts with the diazonium salt, forming a colored product. The joint presence of all components of the detection system on one and the same reagent layer appears to be optimal insofar as it appears to be ensured that the product resulting by reaction with the esterolytically- and/or proteolytically-active component can quickly react further to give a colored end product.
Rapid and complete detection reactions form the basis for a sensitive test. In the case of the above-mentioned detection system, the detection limit for leukocytes in urine for reading off the value after about 2 minutes is about 15 to 25 leukocytes/ul of urine. However, from the point of view of the physician, it is desirable to have available detection agents which are even more sensitive. Comparatively long waiting periods for reading off the value to be determined are undesirable.

Apparatus for determining a proteolytic or esterolytic substance and method for determining a proteolytic or esterolytic substance using a layered apparatus


A method for operating a mobile radio network is proposed which makes possible improved error protection of the control data to be transmitted while requiring as small a transmission bandwidth as possible. In this context, payload data is transmitted in payload data packets. The payload data packets are each assigned at least one header information item containing control data for routing the payload data packets in the mobile radio network. The control data and the payload data are transmitted with different error protection.

A method for operating a mobile radio network in which payload data is transmitted in payload data packets is already known from German Published Patent Application No. 198 47 679. In this context, each payload data packet is assigned control data in the form of at least one header information item, the control data being required for passing on the payload data in the mobile radio network.
The publication "Forward Error Correction Schemes For Wireless ATM Systems", Aikawa S. et al., IEEE International Conference an Communications (ICC), US, New York, IEEE Jun. 23, 1996, describes a method for operating a mobile radio network in which payload data is transmitted in payload data packets, and the payload data packets are each assigned at least one header information item containing control data for routing the payload data packets in the mobile radio network, the control data and the payload data being transmitted with different error protection. The publication "General Packet Radio Service (GPRS); Mobile Station (MS)-Servicing GPRS Support Note (SGSN); Sub-Network Dependent Convergence Protocol (SNDCP), ETSI, 1998, describes that the data packets are prefixed with an allocation information item, which informs the receiver of the order of transmission of the packets, thus permitting correction of the order of reception. In this context, however, no provision is made to use different radio channels for transmitting data of an application.

Method for operating a mobile radio network


Methods for a server include defining a starting element and an element step size. A pad mapping is applied to a data Random Cipher Pad (RCP) to obtain a Key RCP using each element of the data RCP once in a predetermined non-sequential order. The starting element and the element step size are combined with the data RCP. The data RCP is encrypted using the Key RCP to produce a subsequent data RCP. The subsequent data RCP is transmitted to another computer. Methods for clients include applying a pad mapping to a data RCP to obtain a Key RCP using each element of the data RCP once in a predetermined non-sequential order to develop the Key RCP. The Key RCP is encrypted using the data RCP to produce a subsequent Key RCP. A data structure is encrypted using the data RCP to produce an encrypted data structure.

Cryptography is important for many types of communications including, but certainly not limited to, communications involving financial data, medical data, and government classified data. Many types of encryption are very difficult to decrypt, but can eventually be broken. Other types of encryption have significant vulnerabilities making decryption relatively easy. Conventional one-time pads are generally considered completely secure and unbreakable. However, conventional one-time pads have a drawback related to how to convey the one-time pads to keep them secret. Moreover, for conventional one-time pads, the length of the key is equal to the length of the data to be encrypted, which may be unsuitable for low-bandwidth applications even if secure conveyance of the one-time pad is possible.


In a processor device according to the present invention, a memory access unit reads data to be processed from an external memory and writes the data to a first register group that a plurality of processors does not access among a plurality of register groups. A control unit sequentially makes each of the plurality of processors implement a same instruction, in parallel with changing an address of a register group that stores the data to be processed. A scheduler, based on specified scenario information, specifies an instruction to be implemented and a register group to be accessed for the plurality of processors, and specifies a register group to be written to among the plurality of register groups and data to be processed that is to be written for the memory access unit.

In recent years, a processing device capable of performing a very large amount of processing, such as image processing, simply and at high speed is desired. As a means for performing such a large amount of processing at high speed, parallel processing is promising. However, the parallel processing requires a high degree of expertise in various fields, such as expertise in program construction, and transmission between processors due to data dependency. Thus, a patent document 1 proposes a technique wherein, in a multiprocessor device having a plurality of processors and a register memory, the plurality of processors repetitively processes the same instruction by performing processing of only a given quantity while changing addressing for the register memory, when the processing of the given quantity is finished, the command is switched to a next command, and processing of only a next given quantity is performed.

Processor device for executing SIMD instructions


Provided is a method of inducing oligodendrocyte precursor cells (OPCs) through direct reprogramming from human somatic cells into which a nucleic acid molecule encoding an Oct4 protein or Oct4 protein-treated human somatic cells. The method of inducing OPCs by treating Oct4-overexpressing human somatic cells with a low molecular weight substance may establish OPCs with high efficiency in a short period of time through direct reprogramming without via neural stem cells, and thus the OPCs are useful as a cell therapeutic agent for an intractable demyelinating disease.

The present invention relates to a method of inducing oligodendrocyte precursor cells (OPCs) through direct reprogramming from human somatic cells into which a nucleic acid molecule encoding an Oct4 protein has been introduced or Oct4 protein-treated human somatic cells.
Due to the progression of an aging society, personalized cell therapeutic agents for healthier aging and a healthy life without disease are medications essential for improving the quality of life. Multiple sclerosis known as a disease of the central nervous system is a demyelinating disease whose cause is unknown, and in severe cases, is accompanied by sensory and motor impairment. However, there is no fundamental therapy, except treatment with medications for reducing symptoms. Accordingly, transplantation of OPCs (OPC) that can differentiate into oligodendrocytes enabling the generation of myelin sheaths has attracted attention as a main therapeutic method, and research to obtain cells which will be used for the transplantation is progressing using embryonic stem cells and adult stem cells.
Embryonic stem cells are pluripotent cells which are able to differentiate into all types of human cells having the ability to divide indefinitely, unlike somatic cells. Adult stem cells are multipotent cells which are able to be extracted from a patient, and as a representative example, neural stem cells (NSCs) are well known. NSCs, which are adult stem cells, can overcome immune rejection in the treatment of neurological diseases, and therefore has attracted attention as a cell therapeutic agent. However, NSCs are not effective because they have a considerably low ability to differentiate into oligodendrocytes, and are limited in number of cells because they should be obtained from a patient's own cerebral tissue. Embryonic stem cells also have disadvantages to be overcome for clinical use. First, there is an ethical issue because it is necessary to destroy a fertilized embryo to obtain embryonic stem cells, and when cells differentiated from the embryonic stem cells are transplanted into a patient, immune rejection occurs.
Among various methods attempting to overcome such problems, a method of dedifferentiation from differentiated cells to undifferentiated cells has attracted attention, and dedifferentiation encompasses the generation of pluripotent stem cells such as embryonic stem cells using differentiated cells. After induced pluripotent stem cells (iPS cells) were developed through gene introduction by Prof. Shinya Yamanaka, Japan in 2006, a variety of studies for applying such cells to a therapeutic agent are progressing.
After the report in which stem cells having similar characteristics to embryonic stem cells are established when four genes (dedifferentiation-inducible factors; Oct4, Sox2, c-Myc and Klf4) were introduced into mouse or human somatic cells, and then cultured under embryonic stem cell culture conditions for a long time (Cell 126:663-676, 2006; Science 318:1917-1920, 2007) had been suggested, various methods capable of replacing genes for clinical use have been studied. However, because of still insufficient results of the study on human somatic cells, difficulty in defining a dedifferentiation-inducing mechanism, and a risk of forming teratoma, it is difficult to apply iPS cells to clinical trials. A direct reprogramming method is a method which has been recently suggested as an alternative for such iPS cells, and includes two types of techniques for introducing genes specifically expressed in cells and inducing the cells to desired cells without the pluripotency stage through the regulation of a growth signal by combination of dedifferentiation-inducible factors and low molecular weight substances. Such a method is highly appreciated in that it has only advantages of various stem cells, and eliminates many of the factors which inhibit a clinical use.
In recent years, the possibility of establishment of mouse OPCs has been shown by the Marius Wernig research team using three genes (Olig2, Sox10, Zfp536) and by the Paul J Tesar research team using three genes (Olig2, Sox10, NKX6.2) in the United States, and it has been reported that they made a success of direct reprogramming from mouse somatic cells to OPCs. However, there is no still report in which human somatic cells are used. In addition, the Shengding and Mickie Bhatia research teams in the United States demonstrated the establishment of neural stem cells through direct reprogramming by introducing an Oct4 gene into a human somatic cell, and thus suggested a new paradigm in which the Oct4 gene can regulate the expression of nervous system-related genes in cells.
Therefore, the inventors intensively attempted to induce OPCs from human somatic cells through direct reprogramming, resulting in confirming the possibility of induction of OPCs by introducing Oct4 into human somatic cells and treating several low molecular weight substances involved in forming oligodendrocytes, and thus completed the present invention.

Method for inducing oligodendrocyte precursor cells from Oct4-induced human somatic cells through direct reprogramming