Citrix Systems, Inc.

International Business Machines Corporation

Marc A Bloomfield

Bradley Jay Pedersen

Anatoliy Panasyuk

Jeffrey Isaac Krantz

Martin Duursma

Anthony Ungerman

Tom Davis, Iii

Christopher A Andrew

Jeff Muir

Robert Ciraldo

Thanh Luu

Scott A Kliger

Elias Behrakis

Peter G Magid

Anatoly Panasyuk

Tom C Davis

An apparatus and method for determining a program neighborhood of a client node in a client-server network is described. The program neighborhood of the client node includes application programs hosted by application servers on the network. The present invention enables a user of a client node to learn of these application programs. The user is not required to know where to find such applications or to manually establish links to such applications. To make the client node aware of its program neighborhood, a host server collects application-related information corresponding to application programs hosted by the servers in the network. The application-related information can include the application name, the server location of the application, minimum capabilities required of client nodes for executing the application, and those users who are authorized to use that application. User credentials are received from the client system. The user credentials are used to filter the application-related information. Information representing those application programs that are available to the client node is transmitted from the host server to the client system for display. In a Windows-based client node, the information can be represented by a graphical icon for each available application program.

Apparatus and method for determining a program neighborhood for a client node in a client-server network

The invention enables the display of application-output data within application-output windows embedded in a web browser window. The application-output windows can be dynamically moved, resized and otherwise manipulated within the web browser window even when the application program providing the source of the application-output data is non-web enabled (e.g., legacy applications). The invention receives window attribute information associated with the application-output windows via a first virtual channel and displays application-output data received via a second virtual channel within the application-output windows, which are formed and/or modified using the window attribute information.

Interacting with software applications displayed in a web page

Apparatus and method for determining a program neighborhood for a client node in a client-server network using markup language techniques

A method for displaying an executing application in an HTML page includes the steps of receiving an indication that execution of an application should begin, determining the parameters of a window in which the executing application will be displayed, creating a communication channel to the HTML page using the determined window parameters, and displaying the output of the application, which is executing on a server, in the window via the communications channel. A related apparatus includes a parameter handler and a network executive. The parameter handler determines the parameters of the application window and passes the parameters to a network executive. The network executive uses the parameters to begin execution of the desired applications program on a server and causes the output of the program to be displayed in the window.

Apparatus and method for displaying application output in an HTML document

In a distributed computer system, a method for lossless compression of a graphical line within an application server allows the compressed line data to be transmitted over a low bandwidth transport mechanism to a graphical user interface for display on a workstation. The application server determines, from graphical line data representative of the graphical line, coordinate locations for the endpoints of each sub-path of the graphical line and attributes of each sub-path. The application server generates a compressed line data packet of variable length which includes the coordinate location data and attribute data for each sub-path of the graphical line.

Method for the lossless compression of lines in a distributed computer system

The present invention is directed to an improved mobile data processing device and a method of operating a mobile data processing device. The mobile data processing device includes a relatively small display screen. The present invention utilization by the mobile data processing device of an application which includes a plurality of screens which have been written for use in a data processing system having a relatively large display screen. When the application is loaded into the mobile data processing device and started, at least a portion of a particular one of the plurality of screens of the application is displayed on the relatively small display screen of the mobile data processing device. Next, the mobile data processing device is utilized to determine whether or not display items from said particular one of said plurality of screens are not fully displayed within said relatively small display screen of said mobile data processing device. If it is determined that said display items from said particular one of said plurality of screens are not fully displayed within said relatively small display screen of said mobile data processing device, then said mobile data processing device automatically generates a substitute screen for said particular one of said plurality of screens in said application. The substitute screen relocates said display items to render them visible on said relatively small display screen of said mobile data processing device.

Method and system for providing size adjustment for a maximized window

A method for dynamically caching data objects in a logical cache memory begins by organizing the logical cache memory into a set of maximally equally-sized, contiguous pages that begin at a logical cache base address. Any one of the maximal size logical cache pages may be dynamically subdivided into a set of smaller pages of equal size. The smaller size pages cache data objects having a smaller size than the maximum possible data object size. Each subdivided page stores only those smaller size data objects. The logical address for a page is mapped to at least a maximal size page index identifying the position of the maximal size logical page in the cache and, if the page is a smaller size page, the page location is also mapped to a smaller size page index which identifies a particular one of the smaller size pages located within a maximal size page. Pages are dynamically reconfigured based on a least-recently-used policy. A maximal size page may be reconfigured to provide for storage of multiple smaller sized pages and a set of smaller sized pages may be reconfigured to provide storage for a maximal size page. In one aspect, maximally sized pages may be chained together to provide for storage of data objects which exceed the size of the pages. Chained pages may be contiguous or non-contiguous.

Method for dynamically and efficiently caching objects received from an

A lossless bandwidth compression method for use in a distributed processor system for communicating graphical text data from a remote application server to a user workstation over a low bandwidth transport mechanism enables the workstation display to support the illusion that the application program is running locally rather than at the remote application server. At the application server, the graphical text data is represented by a string of glyphs, each glyph being a bit mask representing the foreground/background state of the graphical text data pixels. Each unique glyph is encoded by assigning a unique identification code (IDC). Each IDC is compared with the previous IDCs in the string and, if a match is found, the IDC is transmitted to the workstation. If a match with a prior IDC is not found, the IDC and the corresponding glyph pattern are transmitted to the workstation. At the workstation, the IDCs are queued in the order received while the glyph patterns are cached using the corresponding IDCs as addresses. The string of glyphs is reconstructed by using the queued IDCs in their natural order for accessing the cached glyph patterns as required to reproduce the original string of glyphs.

Method for lossless bandwidth compression of a series of glyphs

Method for the lossless compression of lines in a distributed computer

Method for dynamically and efficiently caching objects by subdividing

A method for allowing anonymous user login to a computer begins when an application request is received from a client. The next available anonymous user name is determined and assigned to the client's application request. The anonymous user name is authenticated and a new session is created, which invokes the application targeted by the client's application request. When the client terminates execution of the application, the anonymous user name is returned to the anonymous user name pool and is available to be reassigned to the next anonymous user.

Method and apparatus for simultaneously providing anonymous user login

A graphical user interface, executable on a computer system, includes a first user-selectable icon, displayable on the computer system and representing an object having desired properties within the computer system. A second user-selectable icon, also displayable on the computer system, appears visually distinguishable from the first icon and likewise represents the same object. The second icon has associated therewith at least one of user-selectable command, which enables manipulation of the properties of the object upon selection thereof. The second icon may be located remotely from the first icon on the graphical user interface to provide for convenient manipulation of the object properties without having to access the first icon repeatedly.

Growing community of inventors

Lighthouse Point, FL, United States of America

Marc A Bloomfield