Abstract: A storage system comprises a production site in operable communication with a replication site, and an object store, comprising a plurality of data objects associated with data stored in at least one data storage entity of the production site, disposed at the replication site. The replication site is configured to generate a virtual access point in time (PIT) based at least in part on the plurality of data objects, by providing a plurality of nodes in operable communication with the storage system, where each respective node is configured to, substantially concurrently, perform a MapReduce operation to generate a respective first set of disk objects based on the plurality of data objects, and to create a respective set of metadata objects. The first set of disk objects and the first set of metadata objects are merged together into a virtual access PIT from each of the plurality of parallel nodes.

Abstract: A method of synchronizing transactions between blockchains comprising receiving first and second pluralities of transactions on a first private blockchain network and recording them to first and second private blocks on the first private blockchain network, respectively, generating a first merged block comprising the first private block and the second private block and recording the first merged block to a single block on a second blockchain network, recording each of the first and second private blocks and the first merged block to a first private smart contract linked to the first private blockchain network, performing a synchronization process between the first private smart contract and a second smart contract linked to the second blockchain network, defining a second smart contract, and performing a checkpointing process between the first private smart contract and the second smart contract. The first private blockchain network has a parameter difference from the second blockchain network.

Abstract: Large amounts of unstructured or semi-structured log data generated by software and infrastructure components of a computing system are processed to identify anomalies and potential problems within the computing system. Stored log messages may be queried and analyzed according to dynamic fields constructed from the content of the log messages. As time goes on, the dynamic fields may be converted into static fields which are extracted and indexed at the time of ingestion of the log messages.

Abstract: Passive monitoring of a large-scale network using multiple tiers of ordinary network switches, as opposed to purpose-built network monitoring hardware, is accomplished by initially providing network communications to an initial tier of monitoring switches, either from existing switches that copy frames and provide them to the monitoring switches, or from network taps to which the monitoring switches are connected. The initial tier of monitoring switches comprises flow tables that initially simply drop all frames provided to those switches and, subsequently, when specific network issues arise, they are modified to include a specification particular frame criteria whose frames are either forwarded to subsequent tiers of monitoring switches, or statistics regarding those frames are collected. Subsequent tiers of monitoring switches receive frames from the initial tier and direct them to one or more appropriate analysis computing devices.

Abstract: Systems and methods are provided for adaptive data replication. A first data object is stored. One or more first network characteristics of a communication network are detected. A first replication mode is triggered (e.g., a single-master replication mode) based on the one or more first network characteristics of the communication network. The single-master replication may be configured to facilitate real-time synchronizations (e.g., for critical updates). One or more second network characteristics of the communication network are detected. A second replication mode (e.g., a multi-master replication mode) is triggered based on the one or more second network characteristics. The second replication may be configured to facilitate a delayed synchronization (e.g., for non-critical updates) of the first data object and the second data object using the second update file.

Abstract: The present disclosure relates to systems, methods, and computer program products for keeping multiple caches updated, or coherent, on multiple servers when the multiple caches contain independent copies of cached data. Example methods may include receiving a request to write data to a block of a first cache associated with a first server in a clustered server environment. The methods may also include identifying a second cache storing a copy of the block, where the second cache is associated with a second server in the clustered environment. The methods may further include transmitting a request to update the second cache with the received write data, and upon receiving a subsequent request to write subsequent data, identifying a third cache for invalidating based on access patterns of the blocks, where the third cache is associated with a third server in the clustered environment.

Abstract: Local distributed backup techniques are described, where each client device calculates a manifest of its files and sends the manifest to a central server. The server performs deduplication based on the received manifest to determine which files are missing and need to be backed up, and notifies the client of those files. At this point, instead of uploading the missing files to the central server, the files are instead uploaded to another peer client device that has sufficient disk space and resides in the network vicinity of the original client device. The upload may be done to multiple peers for redundancy. Upon backup completion, the client state may be left as-is, in which case the client periodically uploads incremental updates to keep any changes synchronized with the backup peer. Alternatively, the client can be centralized to the central server, but at a later time when more resources are available.

Abstract: In accordance with an embodiment, a system and method for supporting RESTful management in an application server environment for operating application software includes an interface configured to receive input for interacting with the application server environment. When a request to manage the application server environment is received, REST resources are dynamically generated using bean trees and other bean information within the application server environment. The REST resources are then usable as input to the interface to manage the application server environment.

Abstract: Disclosed aspects relate to data management for a mass storage device. The mass storage device may be structured to include an encrypted file system to store a set of data and a token analyzer to manage access to the encrypted file system. A connection between the mass storage device and a computing device may be sensed. In response to sensing the connection, a token corresponding with the computing device may be detected. Based on the token, the token analyzer may determine to provide the computing device a set of selected permissions to the encrypted file system. The set of selected permissions to the encrypted file system may be provided by the mass storage device to the computing device.

Abstract: According to some embodiments, a method for processing input data comprises creating a MapReducer object corresponding to a MapReduce environment; and receiving, by a MapReduce interface, a plurality of input parameters comprising the input data; a mapper function; a reducer function; and the MapReducer object; and using the MapReduce interface to process the input data by one or more processors in the MapReduce environment using the mapper function and the reducer function. According to some embodiments, the method further comprises creating a second MapReducer object, wherein the second MapReducer object corresponds to a second MapReduce environment; receiving, by the MapReduce interface, the second MapReducer object in place of the first MapReducer object; and utilizing the MapReduce interface to process the input data by the one or more processors in the second MapReduce environment using the mapper function and the reducer function.

Abstract: A non-transitory readable storage medium storing one or more instructions that, when executed by the computer, cause the computer to perform a method of managing content and associated metadata in a network by a cache repository. The method comprises receiving content and associated data from a content source located in a local network of an edge facility; storing the content in the cache repository located in the local network of the edge facility; sending the content to an active repository remote from the local network of the edge facility for storage; and determining if a connection to the remote repository can be established in the network. If the connection to the active repository can be established, the method includes retrieving by the cache repository the content from the active repository; and if the connection to the active repository cannot be established, the method retrieves the content from the backup repository.

Abstract: The valet parking and paging system is a wireless signaling apparatus that facilitates communication between a valet parking station and a client of the valet parking station. Specifically, the valet parking and paging system is a wireless signaling apparatus that exchanges status information between the valet parking station and a client. The valet parking and paging system comprises a plurality of valet units, a plurality of client units, and a base stations. The plurality of valet units comprises a collection of individual valet units. The plurality of client units comprises a collection of individual client units. Each individual valet unit selected from the plurality of valet units plugs into and is electrically connected to a location selected from the group consisting of the base station or an individual client unit selected from the plurality of client units.

Abstract: As provided herein, a first device may be registered as authorized to authenticate a user login into a service from a second device (e.g., a smart phone may be used to log the user into a webmail service on a computer without the user having to enter a password through the computer). Responsive to the user attempting to access the service through the second device, a login interface may be displayed on the first device. The user may confirm or deny that the user wants to log into the service on the second device, thus allowing the user to seamlessly log into the service on the second device (e.g., without entering a password) while mitigating unauthorized logins into the service from unknown devices. Further, the user may use the first device to delegate the authority to authenticate the user login into the service to one or more other devices.

Abstract: A field device includes a detector and a converter communicative to the detector. The detector also may include, but is not limited to, a sensor, an analog-to-digital converter, and a first processor. The sensor may be configured to acquire an analog measurement signal. The analog-to-digital converter may be configured to convert the analog measurement signal to a digital signal. The first processor may be configured to convert the digital signal into a measurement value to generate a digital signal representing at least the measurement value. The converter may be configured to convert the digital signal representing at least the measurement value into an instrumentation signal to output the instrumentation signal. The detector may be configured to transmit the digital signal representing at least the measurement value and the analog measurement signal to the converter.

Abstract: An application execution method for improving the operation speed of the application in executing or in the middle of running the application is provided. The application execution method includes detecting a launch of an application, preloading Input/Outputs (I/Os) requested at the launch based on profile data with I/Os requested at a previous launch of the application, and updating the profile data based on at least one of the I/Os requested at current and previous launches of the application.

Abstract: In response to detecting data file creation/revision in a first computing device, one or more other computing devices in which the data file creation/revision is to be synchronized are identified and a user of the first computing device is prompted to specify a message to be communicated to the one or more other computing devices in association with the data file creation/revision. The message specified by the user of the first computing device is received and communicated to the one or more other computing devices together with information that enables the data file creation/revision to be synchronized within the one or more other computing devices.

Abstract: A method and apparatus for collecting, merging, and presenting content is disclosed. The method includes collecting a plurality of selected content from a plurality of different content sources. The method further involves storing the selected content in a temporary file. Additionally, the method involves merging the collected content into a cohesive document.

Abstract: Techniques for file system recovery are disclosed. In one particular exemplary embodiment, the techniques may be realized as a method for file system recovery comprising starting a recovery process for a failed node, utilizing the recovery process to read one or more committed but un-applied transactions from storage associated with the failed node, and recreating the one or more committed but un-applied transactions in memory associated with the recovery process.

Abstract: A mutable multilevel data structure representing a graph structure may include multiple read-only levels and a single writable level. Each read-only level may include a vertex table (with references to edge tables on the same level or a different level containing elements of adjacency lists for some vertices) and an edge table (with elements of adjacency lists that changed since the previous read-only level). A hybrid variant may switch between a performance-optimized variant (whose edge tables include complete adjacency lists for vertices whose edge sets were modified) and a space-optimized variant (whose edge tables include only newly added adjacency list elements). The vertex tables and/or the writable level may be implemented using copy-on-write arrays, each including an indirection table and multiple fixed-sized data pages. Computations may be run on the read-only levels or on the writable level and read-only levels.

Abstract: It is provided a computer system, comprising a plurality of computers configured to execute processing in response to requests received from a plurality of external systems. The plurality of computers each share an acceptance weight statistic value calculated by each of the plurality of computers with another computer within the same network segment. The processor of each of the plurality of computers is configured to: receive a broadcast transmitted from one of the plurality of external systems to the same network segment; determine whether to respond to the received broadcast by referring to the shared acceptance weight statistic value; and send a response to the one of the plurality of external systems that has transmitted the broadcast in order to allow the one of the plurality of external systems to transmit a processing request in a case where it is determined to respond to the received broadcast.

Abstract: A method for avoiding conflicts in a multi-master database cluster is provided. A set of hot spots is identified in the database cluster. When a given node receives a given transaction, the given node selects one or more hot-spot servicing nodes for one or more hot-spot sub-transactions, namely one or more sub-transactions of the given transaction that correspond to one or more hot spots of the set of hot spots. Subsequently, the given node redirects the hot-spot sub-transactions to their respective hot-spot servicing nodes. The hot-spot sub-transactions are then executed at their respective hot-spot servicing nodes.

Abstract: According to one embodiment of the present invention, a system for managing data within a plurality of data management architectures comprises at least one processor. The system persists an entity managed by a first data management architecture to a second data management architecture. The first data management architecture manages entity data within one or more data sources, while the second data management architecture manages persisted entities with data from the one or more data sources within a common repository. A modification to data of the persisted entity is detected within the one or more data sources, and the modified data is synchronized with the persisted entity in the repository of the second data management architecture. Embodiments of the present invention further include a method and computer program product for managing data within a plurality of data management architectures in substantially the same manner described above.

Abstract: Content platform management is enhanced by logically partitioning a physical cluster that comprises a redundant array of independent nodes. Using an interface, an administrator defines one or more “tenants” within the archive cluster, wherein a tenant has a set of attributes including, for example, namespaces, administrative accounts, data access accounts, and a permission mask. A namespace is a logical partition of the cluster that serves as a collection of objects typically associated with at least one defined application. Each namespace has a private file system such that access to one namespace (and its associated objects) does not enable a user to access objects in another namespace. A namespace has capabilities (e.g., read, write, delete, purge, and the like) that a namespace administrator can choose to enable or disable for a given data account.

Abstract: According to one embodiment of the present invention, a system for managing data within a plurality of data management architectures comprises at least one processor. The system persists an entity managed by a first data management architecture to a second data management architecture. The first data management architecture manages entity data within one or more data sources, while the second data management architecture manages persisted entities with data from the one or more data sources within a common repository. A modification to data of the persisted entity is detected within the one or more data sources, and the modified data is synchronized with the persisted entity in the repository of the second data management architecture. Embodiments of the present invention further include a method and computer program product for managing data within a plurality of data management architectures in substantially the same manner described above.

Abstract: A map-reduce compatible distributed file system that consists of successive component layers that each provide the basis on which the next layer is built provides transactional read-write-update semantics with file chunk replication and huge file-create rates. A primitive storage layer (storage pools) knits together raw block stores and provides a storage mechanism for containers and transaction logs. Storage pools are manipulated by individual file servers. Containers provide the fundamental basis for data replication, relocation, and transactional updates. A container location database allows containers to be found among all file servers, as well as defining precedence among replicas of containers to organize transactional updates of container contents. Volumes facilitate control of data placement, creation of snapshots and mirrors, and retention of a variety of control and policy information.

Abstract: A migration framework includes a migration status data store that stores the migration status of a variety of different databases that are being migrated. A migration manager monitors the migration status of the different databases and invokes migration scripts to perform migration steps on the various databases, based upon their migration status. As the migration steps are completed, a status update component updates the migration status of the various databases that are being migrated.

Abstract: A system that implements a data storage service may store data for database tables in multiple replicated partitions on respective storage nodes. In response to a request to back up a table, the service may export individual partitions of the table from the database and package them to be independently uploaded (e.g., in parallel) to a remote storage system (e.g., a key-value durable storage system). Prior to uploading the exported and packaged partitions to the remote storage system, the service may verify that the exported and packaged partitions can be subsequently restored, which may include unpackaging and/or re-inflating the exported and packaged partitions to create additional unpackaged copies of the partitions, re-importing the additional unpackaged copies of the partitions into the database (e.g., as additional replicas), and/or comparing checksums generated for the exported partitions with checksums generated for the additional unpackaged copies of the partitions.

Abstract: A system facilitates the distribution and redistribution of chunks of data among multiple servers. The system may identify servers to store a replica of the data based on at least one of utilization of the servers, prior data distribution involving the servers, and failure correlation properties associated with the servers, and place the replicas of the data at the identified servers. The system may also monitor total numbers of replicas of the chunks available in the system, identify chunks that have a total number of replicas below one or more chunk thresholds, assign priorities to the identified chunks, and re-replicate the identified chunks based substantially on the assigned priorities.

Abstract: A list of classes found in a core dump file is determined. One or more classes requested by a classloader is also determined. A set of one or more classes requested by the classloader that are found in the core dump file is then determined.

Abstract: A virtualized computing system for executing a distributed computing application, such as Hadoop, is discussed. The virtualized computing system stores data in a distributed filesystem, such as Hadoop Distributed File System, and processes data using a topology awareness that takes into account the virtualization layer of the virtualized computing system. The virtualized computing system employs locality-related policies, including replica placement policies, replica choosing policies, balancer policies, and task scheduling policies that take advantage of the awareness of the virtualization topology.

Abstract: It is provided a computer system, comprising a server and first and second storage systems. The first storage system stores deduplicated data sharing at least a part of data with other data, shared data shared by a plurality of pieces of the deduplicated data, and first type data representing a type of the stored data including the deduplicated data and the shared data. The deduplicated data is associated with the shared data by a pointer to the shared data, and includes differential data indicating a difference from the shared data. The server creates second type data representing a type of the data stored in the second storage system from the first type data. The second storage system stores the shared data associated with the deduplicate data at a reading position before a position at which the deduplicated data is read in sequential reading and stores the second type data.

Abstract: A distributed database system may implement log-structured distributed storage using a single log sequence number space. A log for a data volume may be maintained in a log-structured distributed storage system. The log may be segmented across multiple protection groups according to a partitioning of user data for the data volume. Updates to the log may be assigned a log sequence number from a log sequence number space for the data volume. A protection group may be determined for an update according to which partition of user data space the update pertains. Metadata to be included with the log record may indicate a previous log sequence number of a log record maintained at the protection group. The log record may be sent to the protection group and identified as committed based on acknowledgments received from storage nodes implementing the protection group.

Abstract: A method of managing content in a network by a cache repository that includes receiving content from a content source; storing the content in the cache repository; sending the content to a remote repository for storage; and determining if a connection to the remote repository can be established in the network. If the connection to the remote repository can be established, the method includes retrieving the content from the remote repository; and if the connection to the remote repository cannot be established, the method retrieves the content from a backup repository.

Abstract: A distributed database system may efficiently replicate distributed storage system changes on one or more read-only nodes. Storage metadata that indicates an access scheme for obtaining data for a particular view of the database from a distributed storage system may be maintained at a read-only node. An update to the storage metadata may be received that indicates a change to the distributed storage system that affects the validity of read requests for a different particular view of the database. In some embodiments, the change may indicate which storage nodes may be storing data according to the different particular view of the database, such as a change in membership of a protection group for the data at the distributed storage system. The storage metadata at the read-only node may be updated according to the received update such that a subsequent read request for the different particular view of the database is sent to the distributed storage system according to the updated access scheme.

Abstract: A key-value store provides column-oriented access to data in a distributed and fault tolerant manner. Data can be inserted into the data store and data can be retrieved either randomly or sequentially from the data store at high rates. Keys for a table are ordered and the entire table is divided into key ranges. Each key range is handled by a table which itself is divided into key ranges called a partition. Partitions are also divided into segments. Such recursive division into smaller and smaller key ranges provides parallelism. At the highest level, operations on tablets can be distributed to different nodes. At lower levels, different threads can handle operations on individual segments. Large-scale restructuring operations can be decomposed into operations on individual segments so that a global lock on larger objects does not need to be kept across the entire operation.

Abstract: A computer implemented method, system, and computer program product for enabling consistency between zones comprising creating a lease agreement between a first zone and at least a second zone; wherein the lease indicates that the first zone is the owner of an object; wherein the lease agreement dictates that a notification is to be sent before a cached object in the first zone is updated if the lease is still valid; wherein the lease indicates the first zone is to send a heartbeat to the second zone within the predetermined period of time if the object has not been changed and the lease is still valid; and setting up heartbeats from the first zone to at least a second zone within a predetermined amount of time; wherein the heartbeat indicates that the lease is still valid and the object has not been changed.

Abstract: The present invention discloses a method and an apparatus for recommending a suspicious component in problem diagnosis for a cloud application. In the method, firstly a graph data model representing a hierarchical structure of the cloud application is constructed, wherein the graph data model comprises an application node representing the cloud application, a plurality of component nodes representing a plurality of components of the cloud application, and inter-node lines indicating inter-node relationships. Then real-time information of the cloud application is obtained, in response to detecting performance degradation of the cloud application. Impact degrees of the plurality of component nodes on the performance degradation of the cloud application is obtained based on the constructed graph data model and the obtained real-time information, and a suspicious component sequence is generated according to the impact degrees of the plurality of component nodes.

Abstract: A system and method for synchronizing files to a cloud storage service provides an adaptive visual display that offers details of the synchronization process of each file being synchronized. Information included in the display can include details of the progress and status of the file synchronization for a particular file, as well as a group of files. Files being actively synchronized are locked in the display for the user view. Files that are not actively synchronized may scroll in the display so that the user can view information about multiple files being synchronized during a given synchronization.

Abstract: One exemplary aspect comprises a method comprising: (a) storing, in a first database, data specific to a client; (b) based on the data, identifying with a processing system comprising one or more processors one or more fields of a record to be updated in a second database managed by the client; (c) obtaining write-only access to one or more fields of the identified one or more fields of the record; and (d) updating, based on the data stored in the first database, one or more fields of the identified one or more fields of the record in the second database.

Abstract: A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas of partitions that are stored on respective computing nodes in the system. The system may split a data partition into two new partitions, and may split the replica group that stored the original partitions into two new replica groups, each storing one of the new partitions. To split the replica group, the master replica may propagate membership changes to the other members of the replica group for adding members to the original replica group and for splitting the expanded replica group into two new replica groups. Subsequent to the split, replicas may attempt to become the master for the original replica group or for a new replica group. If an attempt to become master replica for the original replica group succeeds, the split may fail.

Abstract: System and method for location aware fine-grained multi-channel synchronization of mobile repositories along with aggregate analytic computation is disclosed. The System is able to improve upon existing systems by allowing for custom policies on synchronization to be stored and applied when data synchronization happens, these policies are persisted in the Sync Data Repository and applied during sync. The System is able to improve upon existing systems by allowing for persistent marking of states of the sync repository as Sync Points. This way data can be pulled from a sync point. The System is able to improve upon existing systems by having a computation framework that is able to push down aggregate analytics to user, these analytics are computed by analyzing data in the Sync Channel along various dimensions such as temporal, geo.

Abstract: A collection-synchronizing system synchronizes a local data collection with a remote device. During operation, the system can detect the remote device, and receives collection summaries for one or more data collections stored at the remote device. A collection summary can include at least one additive hash value that represents one or more content items of a data collection. Then, for a data collection that exists at the local device and the remote device, the system compares a remote additive hash value for the remote data collection with a local additive hash value for the local data collection. If the system determines that the local additive hash value does not match the remote additive hash value, the system synchronizes structured names for the data collection at the local device and the remote device.

Abstract: In various embodiments, the present invention relates to systems and methods for managing user data in a plurality of storage appliances coupled to a wide area network. In some embodiments, the present invention relates to systems and methods that allow users to view and manipulate files in a shared virtual container. In other embodiments, the present invention also relates to systems and methods that allow users to access virtual containers located on storage appliances that are owned by other users.

Abstract: A controlling method executed by a processor included in an information processing apparatus, the controlling method includes storing identifiers of information processing apparatuses and identifiers of groups, each of the information processing apparatuses belonging to at least one of the groups, a group among the groups storing replications of one or more identifiable data; and detecting, by the information processing apparatus, a failure of other information processing apparatus belonging to one or more groups among the groups to which the information processing apparatus executing the detecting of the failure belongs, based on the identifiers of information apparatuses and the identifiers of groups.

Abstract: A key-value store provides column-oriented access to data in a distributed and fault tolerant manner. Data can be inserted into the data store and data can be retrieved either randomly or sequentially from the data store at high rates. Keys for a table are ordered and the entire table is divided into key ranges. Each key range is handled by a table which itself is divided into key ranges called a partition. Partitions are also divided into segments. Such recursive division into smaller and smaller key ranges provides parallelism. At the highest level, operations on tablets can be distributed to different nodes. At lower levels, different threads can handle operations on individual segments. Large-scale restructuring operations can be decomposed into operations on individual segments so that a global lock on larger objects does not need to be kept across the entire operation.

Abstract: A system includes reception of a first query from a client device at a first database node of a database instance comprising two or more database nodes, determination of a second database node of the two or more database nodes associated with the first query, compilation of the first query at the first database node to generate first compiled code, and transmission of the first compiled code and a first identifier of the second database node from the first database node to the client device.

Abstract: A system and method for generating replication requests for objects in a distributed storage system is provided. For a respective object in a distributed storage system the following is performed. Replication policies for the object that have not been satisfied are determined. Replication requests are ranked for the object whose replication policies have not been satisfied based on a number of replicas of the object that need to be created in order to satisfy the replication policies for the object. Replication requests are generated for the object based at least in part on the replication policies for the object that have not been satisfied and on a current state of the distributed storage system. At least a subset of the replication requests for the objects in the distributed storage system are distributed to respective instances of the distributed storage system corresponding to the replication requests for execution.

Abstract: Multiple servers sharing a distributed file system are used to perform copies of regions of a source file in parallel from a source storage unit to corresponding temporary files at a destination storage unit. These temporary files are then merged or combined into a single file at the destination storage unit in a way that preserves the inode structure and attributes of the source file. A substantial speedup is obtained by copying regions of the file in parallel.

Abstract: A method for synchronizing Customer Relationship Management data between a Software as a Service (“SaaS”) CRM provider and a mobile device. This method enables both read and write access from the mobile device whether a network connection to the SaaS provider is available or not. The method involves creating a local mobile device database to track portions or all of the SaaS provider database. In the case where a network separation occurs and the device and SaaS databases diverge, the synchronization method may be used to make the mobile device database and the SaaS database consistent and coherent again. In one embodiment, multiple local database tables are used to represent a single SaaS CRM table to facilitate synchronization, and a status indicator is used to visually and quickly convey status to the mobile user.

Abstract: According to one embodiment of the present invention, a system for managing data within a plurality of data management architectures comprises at least one processor. The system persists an entity managed by a first data management architecture to a second data management architecture. The first data management architecture manages entity data within one or more data sources, while the second data management architecture manages persisted entities with data from the one or more data sources within a common repository. A modification to data of the persisted entity is detected within the one or more data sources, and the modified data is synchronized with the persisted entity in the repository of the second data management architecture. Embodiments of the present invention further include a method and computer program product for managing data within a plurality of data management architectures in substantially the same manner described above.