Abstract: An internal combustion engine piston includes a crown defining an annular cavity between an inner wall and an outer wall. The annular cavity includes an opening opposite a top wall and at least partially defines a cooling gallery. A cover plate is assembled with the annular cavity and the piston crown to form a lower boundary of the cooling gallery and thereby enclose the cooling gallery within the piston crown. The cover plate includes a plurality of crests separated by a plurality of troughs wherein the crests and troughs are arranged to create a variable volume profile of the cooling gallery. The variable volume profile of the cooling gallery can increase or decrease annularly around the piston based on a cross-sectional shape of the cover plate. Optionally, the cover plate includes one or more inlets or outlets for exchanging fluid in the cooling gallery.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media relate to a method for creating a data environment and a computational environment to perform data processing and real-time data request management. The system provides for the creation of definition files to create a data environment to periodically precompute aggregated data values, and the creation of an execution environment in which features may be defined to process a real-time request with at least one of the features accessing one of the created datasets.

Abstract: Embodiments of the present disclosure disclose a Radio Unit (RU) comprising a Double Data Rate (DDR) memory unit, a control unit and a Programmable Logic (PL) unit. The PL unit is configured to capture plurality of data packets exchanged between RU and a Distributed Unit (DU) and determine a timestamp and a data size of the captured data packets. Further, the PL unit generates a data packet header comprising timestamp and data size information of the data packets and appends the header to the data packets before transmitting the data packets for storing in DDR memory unit. Thereafter, the control unit retrieves the data packets from the DDR memory unit and generates a Packet Capture (PCAP) data file, which may be used for validating the data packets exchanged between the RU and the DU, without the need of an external logic analyzer.

Abstract: A computer-implemented method of optimizing charging load on electric vehicle chargers and allocating charging connectors to an electric vehicle fleet at a depot, includes mapping occupancy of charging connectors at each charger, and prior to arrival of an electric vehicle at the depot, checking a priority assigned to unoccupied charging connectors, or sorting unoccupied charging connectors based on their priority. If there is a predetermined priority, mapping the electric vehicle to an unoccupied charging connector depending on priority and if the electric vehicle has a predetermined priority requirement, determining a normalized stress metric, selecting an unoccupied charger with lowest normalized stress metric, calculating an allocation of a connector at the charger based on balancing the normalized stress metric during use, allocating the charging connector to achieve balance, and mapping the electric vehicle to the allocated charging connector.

Abstract: A system and method for managing dispatch of vehicle fleet is provided. The method includes receiving information associated with a plurality of blocks to be served by a fleet of vehicles and determining that information of at least one critical block period is unavailable based on the information associated with the plurality of blocks. Further, the method includes determining the at least one critical block period based on at least one block requiring a number of non-EVs greater than an available number of non-EVs in the fleet of vehicles; scheduling the fleet of vehicles for serving the plurality of blocks by reducing a proportion of a number of non-EVs to serve the at least one critical block period; and dispatching the fleet of vehicles for serving the plurality of blocks including the at least one critical block period.

Abstract: A system, method and computer program product for route planning of electric vehicles (EVs) is provided. The method includes receiving a plurality of parameters associated with an EV fleet. The method includes determining a dttr for each route of a plurality of routes based on the route information associated with each EV of the EV fleet. Further, the method includes determining a set of EVs from the EV fleet based on a validity of each EV of the EV fleet and mapping the set of EVs to a set of the routes of the plurality of routes based on the dttr for each route of the plurality of routes. The method also includes scheduling the set of EVs to the set of the routes based on the mapping.

Abstract: The present disclosure relates to a pre-5th-Generation (5G) or 5G communication system to be provided for supporting higher data rates Beyond 4th-Generation (4G) communication system such as Long Term Evolution (LTE). Embodiments of present disclosure relates to apparatus and method for enabling optimized decoding of data packet in HARQ based communication in wireless communication network. Initially, unsuccessful decoding of instant data packet received from transmitting unit is identified. If number of previous data packets, received preceding the instant data packet, is greater than one, subsequent decoding is enabled in the receiving unit for the instant data packet. The subsequent decoding includes generating sequentially, modified versions of data packets, for decoding. The modified versions comprises all possible weighted combinations of the data packets with at least one of the instant data packet and one or more of the previous data packets.

Abstract: Workload-responsive segment cleaning of log structured filesystems (LFSs) is disclosed. When multiple independent LFSs overlap on spanning a set of storage disks (including non-volatile memory express storage), a global segment cleaner (GSC) for each disk coordinates the cleaning rates of the local segment cleaners (LSCs) for each LFS having a presence on that disk. LFSs send usage information to relevant GSCs that select usage thresholds to trigger cleaning and cleaning rates. When capacity fullness (e.g., segments having at least one used block) meets a threshold, segment cleaning is performed at a rate based on capacity fullness and an equilibrium cleaning rate. Cleaning rates speed up when storage is more full, to provide capacity for burst writing events, but slow down when less full, to reduce overhead burden. LFSs clean at the highest rate identified for every GSC's usage threshold an LFS meets.

Abstract: Workload-responsive distributed segment cleaning of log structured filesystems (LFSs) is disclosed. When multiple independent LFSs overlap on spanning a set of storage disks (including non-volatile memory express storage), a global segment cleaner (GSC) for each disk coordinates the cleaning rates of the local segment cleaners (LSCs) for each LFS having a presence on that disk. LFSs send usage information to relevant GSCs that select usage thresholds to trigger cleaning and cleaning rates. When capacity fullness (e.g., segments having at least one used block) meets a threshold, segment cleaning is performed at a rate based on capacity fullness and an equilibrium cleaning rate. Cleaning rates speed up when storage is more full, to provide capacity for burst writing events, but slow down when less full, to reduce overhead burden. LFSs clean at the highest rate identified for every GSC's usage threshold an LFS meets.

Abstract: The disclosure relates to a communication method and system for converging a fifth-generation (5G) communication system for supporting higher data rates beyond a fourth-generation (4G) system with a technology for Internet of Things (IoT). The disclosure may be applied to intelligent services based on the 5G communication technology and the IoT-related technology, such as a smart home, a smart building, a smart city, a smart car, a connected car, health care, digital education, smart retail, security and safety services. A method for predicting channel quality status (CQS) in a wireless network by a base station (BS) is provided.

Abstract: Methods, apparatus, and systems are provided for using narrow artificial intelligence (“AI”) to detect and secure confidential data. The methods may include using a camera on a user computer to capture a live camera feed of an area adjacent to the user computer. Methods may include identifying one or more unverified data elements in the captured data. In response to determining an unverified data element, methods may include securing the user computer. Methods may include capturing a screenshot of the user computer screen. Methods may include transmitting data extracted from the screenshot through an object identification algorithm. Methods may include identifying confidential data within the screenshot using a pattern analysis model. Methods may include recreating the screenshot using a narrow AI model. Methods may include blurring the confidential data in the recreated screenshot. Methods may include overwriting the screenshot to display the recreated screenshot on the user computer.

Abstract: A method, computing system, and computer-program product for robust optimization of charging of a plurality of electric vehicles scheduled for charging at a charging station is provided. The charging station includes a plurality of chargers. In an embodiment, the method includes obtaining vehicle data and station data. Based thereon, it is determined if a set of EVs from amongst the plurality of EVs has failed to achieve a pre-defined target SoC, after a pre-defined charging duration. If the set of EVs has failed to achieve the pre-defined target SoC, a target power is computed. Further, the method includes adjusting at least one of the maximum power of each charger associated with charging of each EV from the set of EVs and the maximum power of the set of EVs as per the target power, to reach the target SoC of the set of EVs.

Abstract: Aspects of the disclosure generate independent encryption keys for objects (e.g., virtual machine disks (VMDKs)) without requiring the management of multiple keys. An encryption manager obtains a primary encryption key, an object identifier (ID) comprising a globally unique ID (GUID) for an object, a data salt comprising the object ID and a data salt string, and a metadata salt comprising the object ID and a metadata salt string. A data encryption key is generated using the primary encryption key, the data salt, and a one-way function. A metadata encryption key is generated using the primary encryption key, the metadata salt, and the one-way function. Because the data salt string and metadata salt string differ, the data encryption and metadata encryption keys differ. Object IDs for different objects differ, so each object and its metadata have globally unique keys. Key generation (other than the primary key) is deterministic, simplifying key management.

Abstract: An example method of managing a log-structured file system (LFS) on a storage device includes: receiving, at storage software executing on a host, an operation that overwrites a data block, the data block included in a segment of the LFS; determining from first metadata stored on the storage device, a change in utilization of the segment from a first utilization value to a second utilization value; modifying second metadata stored on the storage device to change a relation between the segment and a first bucket to be a relation between the segment and a second bucket, the first utilization value included in a range of the first bucket and the second utilization value included in a range of the second bucket; and executing a garbage collection process for the LFS that uses the second metadata to identify for garbage collection a set of segments in the second bucket.

Abstract: The present disclosure provides a system and a method that facilitate establishment of an effective machine to machine (M2M) communication in a network. The system and method may provide a series of instructions to provide an efficient and effective communication between two or more machines without loss of information through a converge telephony application server (CTAS) operatively coupled to a next generation telecommunication network.

Abstract: The present disclosure provides a system and a method to facilitate concurrent communication between a user device and a plurality of participating entities. The system may include a network device, which may be associated with a service provider that provides a network service to the user device. The network device may be communicably operational with an external server, where the external server may enable to perform authentication of the user device. The network device may receive input information from the user device, based on which the network device may enable establishing the concurrent communication with the plurality of participating entities. The concurrent communication thus established may not require to sequentially add the participating entities as otherwise required in conventional applications. This may reduce conference establishing time considerably and may also enable to optimize the effective usage of communication time.

Abstract: Example methods and systems for accessing data in a log-structured file system having a plurality of snapshots of storage objects backed by a first-level copy-on-write (COW) B+ tree data structure and a plurality of second-level B+ tree data structures have been disclosed. One example method includes obtaining a first first-level mapping associated with a first snapshot from the plurality of snapshots based on a first logical block address, wherein each of the plurality of snapshots corresponds to each of the plurality of second-level B+ tree data structures, identifying a first second-level B+ tree data structure corresponding to one of the plurality of snapshots based on the first first-level mapping, obtaining a first second-level mapping based on the first logical block address in the first second-level B+ tree data structure, obtaining a first physical block address based on the first second-level mapping, and accessing data at the first physical block address.

Abstract: Chunks of data are identified and deduplication is performed on the chunks of data using associated cyclic redundancy check (CRC) values. A plurality of CRC values is obtained that is associated with consecutive data blocks stored in a payload data store. Cut point CRC values are identified in the plurality of CRC values and CRC chunks are identified based on those cut point CRC values, wherein each CRC chunk is bounded by two consecutive cut point CRC values. A CRC chunk hash value is generated for each CRC chunk. A pair of duplicate CRC chunks is identified using the CRC chunk hash values and a deduplication operation is performed in association with the identified pair of duplicate CRC chunks. Using existing CRC values during the identification of chunk cut points reduces the computing resource costs associated with performing that process using the data blocks.

Abstract: The present disclosure relates to a system (100) and method to facilitate accurate routing of level one (L1) numbers dialed by a user irrespective of the location of the user. The system may include a converge telephony application server (CTAS) (102), associated with a predefined circle, a centralized database accessible by the at least one CTAS (102), a centralized data layer (CDL) server (104) maintaining a mapping table comprising L1 routing information between an ECI and SDCA of the predefined circle. The CTAS may (102) receive one or more predefined request signals from one or more UE (110) by dialling an L1 number based on which the CTAS (102) may generate, a routing control signal for routing the UE (110) communication to a target site or for supplying one or more corresponding handling strategies to the target site.

Abstract: A system and method for block scheduling for an electric vehicle are provided. The method includes obtaining route information including designated routes and their distances in a defined operation period for the EV, and battery information including a consumption factor and a charging rate for a battery of the EV. The method further includes adding dummy routes representative of a predefined charging time period for the battery in the defined operation period. The method further includes defining a dummy factor having a first value for each of the designated routes for the energy being consumed, and a second value for each of the dummy routes for the energy being replenished. The method further includes determining a schedule for the designated routes and the dummy routes for the EV using an optimization model having constraints for the route information, the battery information and the dummy factor.