公开(公告)号：WO2015088314A1

公开(公告)日：2015-06-18

申请号：PCT/MY2014/000157

申请日：2014-06-04

Applicant: MIMOS BERHAD

Inventor： NGO, Chuan Hai ,  MOHAMAD YASSIN, Yaszrina ,  KARUPPIAH, Ettikan Kandasamy

IPC: G06F17/30

CPC classification number: G06F17/30985

Abstract: The present invention relates to an apparatus (200) and method (500) for parallel moving adaptive window filtering edit distance computation that utilizes an adaptive window filtering mechanism to accelerate edit distance computation for increased efficiency and shorter times by searching along a critical path that provides a high rate for string similarity matching. The apparatus (200) of the present invention comprising at least one central processing unit (202); at least one storage unit (210); at least one memory module (204, 206); at least one I/O hub (212); a plurality of input devices (214); and at least one parallel computation acceleration device (208). The at least one parallel computation acceleration device (208) further comprising at least one match filtering scoping unit (302) which scopes a region of interest of a reference list that is most similar to a search string for matching operation; at least one edit distance adaptive window determining unit (304) to prepare for window setting based on user input and to calculate distance values on critical path. String filtering is performed automatically, wherein strings are sorted based on character offset to ensure all possibilities of matching are covered. Further, a feedback mechanism is provided for the automatic threshold based filtering to initialize the adaptive window setting based on user input to prepare for the threshold-based filtering and to calculate the distance values on the critical path; and to obtain the final distance value to determine whether the comparison is the intended match or not.

Abstract translation: 本发明涉及一种用于并行移动自适应窗口滤波编辑距离计算的装置（200）和方法（500），其利用自适应窗口滤波机制来加速编辑距离计算，以通过沿着提供的关键路径搜索而提高效率和更短的时间 字符串相似匹配率高。 本发明的装置（200）包括至少一个中央处理单元（202）; 至少一个存储单元（210）; 至少一个存储器模块（204,206）; 至少一个I / O集线器（212）; 多个输入装置（214）; 和至少一个并行计算加速装置（208）。 所述至少一个并行计算加速装置（208）还包括至少一个匹配过滤作用单元（302），所述至少一个匹配过滤作用单元（302）对与参考列表最相似以用于匹配操作的搜索字符串的兴趣区域进行范围; 至少一个编辑距离自适应窗口确定单元（304），用于根据用户输入准备窗口设置并计算关键路径上的距离值。 自动执行字符串过滤，其中基于字符偏移排序字符串，以确保匹配的所有可能性被覆盖。 此外，提供了一种用于基于自动阈值的滤波的反馈机制，以基于用户输入初始化自适应窗口设置，以准备基于阈值的滤波并计算关键路径上的距离值; 并获得最终距离值以确定比较是否是预期的匹配。

公开(公告)号：WO2015084143A1

公开(公告)日：2015-06-11

申请号：PCT/MY2014/000156

申请日：2014-06-04

Applicant: MIMOS BERHAD

Inventor： HARJINTHAR, Singh ,  BATCHA, Mohamed Farid Noor ,  HASEEB, Shariq ,  KARUPPIAH, Ettikan Kandasamy

IPC: A61B5/00 ,  A61B19/00

CPC classification number: A61B5/0037 ,  A61B5/0044 ,  A61B5/0075 ,  A61B5/0261 ,  A61B5/489 ,  A61B5/7485

Abstract: Blood flow in blood vessels is characterised by the movement in 'trains'. The apparatus and method of the present invention is to develop a non-invasive and accurate technique for measuring blood flow, in the form of a train in visible blood vessels, to determine the flow speed and other blood characteristics by performing visual image analytics. The present invention comprising at least one primary (106) and secondary image module (110) to image blood 'trains' connecting to at least one processing device (104); and at least one object of interest that is being studied. The present invention utilizes a camera to image blood 'trains' (group of blood flowing separately). The methodology of the present invention provides for measurement of length and width of the blood train from the image while the volume of the blood train is determined using width to determine the circumference and multiplying it with the length of the blood train. The width is measured by selecting a cross-section line of a number of pixels (e.g. 5 pixels) thickness for colour variation of the selected of the area. The pixel values are measured against the similar neighbouring group of pixels to ascertain the colour change between the pixels. If the values are constant, the colour is consistent and if the value is high, the difference will show a change from red hues (the blood vessel) to a lighter colour (the surrounding fat) and vice-versa. From the width (the diameter), circumference is deduced and by multiplying this with the length, the total volume can be calculated. Measurement of speed is allowed as the initial start and end of a blood train is used to measure the time taken to travel over a length of the blood capillary.

Abstract translation: 血管中的血流特征是“火车”中的运动。 本发明的装置和方法是开发用于以可见血管中的列车的形式测量血流的非侵入性和精确的技术，以通过执行视觉图像分析来确定流速和其他血液特性。 本发明包括至少一个初级（106）和次级图像模块（110），用于成像连接到至少一个处理装置（104）的血液列车; 以及正在研究的至少一个感兴趣对象。 本发明利用照相机对血液列车进行成像（血液流动分开）。 本发明的方法提供了从图像中测量血液系列的长度和宽度，同时使用宽度确定血液系统的体积以确定周长并将其与血液系列的长度相乘。 通过选择用于所选区域的颜色变化的多个像素（例如5个像素）厚度的横截面线来测量宽度。 针对相似的相邻像素组测量像素值，以确定像素之间的颜色变化。 如果值不变，颜色是一致的，如果值高，则差异将显示红色（血管）到较浅颜色（周围脂肪）的变化，反之亦然。 从宽度（直径），推算周长，并将其与长度相乘，可以计算总体积。 随着血液列车的起始和终点被用于测量血液毛细血管长度所需的时间，允许测量速度。

公开(公告)号：WO2015088318A1

公开(公告)日：2015-06-18

申请号：PCT/MY2014/000168

申请日：2014-06-05

Applicant: MIMOS BERHAD

Inventor： SINGH, Keeratpal ,  KARUPPIAH, Ettikan Kandasamy

IPC: G06Q10/06

CPC classification number: G06Q10/0631

Abstract: Simulation model based on aggregating multi factor man power requirements of distributed geographical location needs for police which are identifiable from kea area indicators. System (100) comprising Data Extractora (104) for extracting various data sources and Categorizer for categorizing said data sources; Data Aggregator (106) for aggregating resources through multi factor causes; Simulator and Parameter Control (108); Distributor and Statistical Filter (110) for generating DS and Heat Map colours; and Colour Selector and Mapping (112) for selecting colour and mapping to redeploy and allocate resources to different geographical area boundaries with different needs. Methodology comprising steps of extracting and categorizing various data sources (302); aggregating resources through multi factor causes (304); simulating and generating processes; generating Statistical Distributor (DS) and Heat Map colours (308); and selecting colour and mapping to redeploy and allocate resources to different geographical area boundaries with different needs (310). Extracts various data sources, categorize and aggregate resources through multi factor causes, simulated effects, weightage and feedback by using simulation model, aggregation formulation and parameter controls to evaluate the performance indicators such as crime to resource ratio. Further, geographical areas are identified by providing knowledge base to distribute resources via multi factor simulation model by utilizing a Simulator Engine and heat map display generated by utilizing Distributor and Statistical Filters to effectively redeploy, allocate and distribute resources to different geographical area boundaries with different and unique needs.

Abstract translation: 基于从kea区域指标可识别的警察分布式地理位置需求的多因素人力要求聚合的模拟模型。 系统（100）包括用于提取各种数据源的数据提取（104）和用于对所述数据源进行分类的分类器; 数据聚合器（106），用于通过多因素原因聚合资源; 模拟器和参数控制（108）; 分布器和统计滤波器（110），用于生成DS和热图颜色; 和颜色选择器和映射（112），用于选择颜色和映射以重新部署并将资源分配到具有不同需求的不同地理区域边界。 方法包括以下步骤：提取和分类各种数据源（302）; 通过多因素聚合资源（304）; 模拟和生成过程; 生成统计分布器（DS）和热图颜色（308）; 并选择颜色和映射来重新部署和分配不同地理区域的资源（310）。 提取各种数据源，通过多因素原因，模拟效应，权重和反馈，通过使用模拟模型，汇总制定和参数控制对资源进行分类和汇总，以评估犯罪与资源比率等绩效指标。 此外，通过使用模拟引擎和利用分销商和统计过滤器生成的热图显示，通过多因素模拟模型提供知识库来分配资源，从而有效地将资源重新部署，分配和分配到不同的地理区域边界，通过不同的和 独特的需求。

公开(公告)号：WO2016032315A1

公开(公告)日：2016-03-03

申请号：PCT/MY2015/050085

申请日：2015-08-13

Applicant: MIMOS BERHAD ,  UNIVERSITI TUNKU ABDUL RAHMAN

Inventor： MOHD NAZIR, Mohd Amril Nurman ,  KARUPPIAH, Ettikan Kandasamy ,  LIEW, Soung Yue ,  LAU, Phooi Yee ,  TEOH, Ee Na

IPC: H04L29/08

CPC classification number: H04L67/16 ,  H04L67/1065

Abstract: The invention provides a method for a Service Consumer node (300) in a peer-to-peer network to locate resources in the network whereby a Directory Node (200) for a specific service is an intermediate peer node at which Service Provider nodes make an advertisement, and from which Service Consumer nodes discover said Service Provider nodes. A level-R Directory Node (200) of a specific service wherein the NodeID shares the same first R digits with the ServiceID of that particular service. The maximum number of levels that the algorithm will explore the Directory Nodes (200) is defined by M. A Service Provider node (100) uses a systematic routing protocol to identify Directory Nodes (200) for service advertisement. A Service Consumer node (300) uses a systematic routing protocol to identify Directory Nodes (200) to get the list of Service Provider nodes that provide the service in required.

Abstract translation: 本发明提供了一种用于对等网络中的服务使用者节点（300）的方法，用于定位网络中的资源，由此用于特定服务的目录节点（200）是服务提供商节点所在的中间对等节点 广告，服务消费者节点从哪个服务提供商节点发现。 特定服务的级别R目录节点（200），其中NodeID与该特定服务的ServiceID共享相同的第一R数字。 算法将探索目录节点（200）的最大级数由M.A定义。服务提供商节点（100）使用系统路由协议来识别用于服务广告的目录节点（200）。 服务消费者节点（300）使用系统路由协议来识别目录节点（200）以获得提供所需服务的服务提供商节点的列表。

公开(公告)号：WO2016072838A1

公开(公告)日：2016-05-12

申请号：PCT/MY2015/050136

申请日：2015-10-30

Applicant: MIMOS BERHAD

Inventor： PRETU, Harjinthar Singh ,  LIM, Su Jin ,  KAMALURRADAT, Zeldi Suryady ,  KARUPPIAH, Ettikan Kandasamy ,  NOOR BATCHA, Mohamed Farid

IPC: H04W40/04 ,  H04W40/24 ,  H04W84/18

CPC classification number: H04W40/04 ,  H04W40/24 ,  H04W84/18 ,  Y02D70/00 ,  Y02D70/22 ,  Y02D70/32

Abstract: The system (100, 200) and method (300) of the present invention provides for next hop selection in a wireless sensor network. The system (100, 200) of the present invention comprising at least one sensor node (102) for sensing and transmitting sensing information through the wireless sensor network to a specified destination; and at least one sensor Gateway (104) for routing sensor information. The at least one sensor node (102) further comprising at least one Neighbor Discovery Module (210) for transmitting and receiving packets to discover neighbor nodes; at least one Measurement Module (212) for measuring network resources between sensor node and its neighboring nodes; at least one Prediction Module (216) for determining network resources between sensor node and its neighboring nodes without any measurement; and at least one Next Hop Selection Module (214) for selecting next hop route upon predicting most suitable neighboring node. The present invention speeds up the selection of cluster head in wireless sensor networks in order to reduce latency, reduce computation and to minimize excessive power consumption in transmission signals in a non-direct power supply nodes.

Abstract translation: 本发明的系统（100,200）和方法（300）提供了无线传感器网络中的下一跳选择。 本发明的系统（100,200）包括至少一个传感器节点（102），用于通过无线传感器网络感测和传输感测信息到指定的目的地; 以及用于路由传感器信息的至少一个传感器网关（104）。 所述至少一个传感器节点（102）还包括用于发送和接收分组以发现相邻节点的至少一个邻居发现模块（210） 至少一个测量模块（212），用于测量传感器节点及其相邻节点之间的网络资源; 至少一个用于确定传感器节点与其相邻节点之间的网络资源而不进行任何测量的预测模块（216） 以及至少一个下一跳选择模块（214），用于在预测最适合的相邻节点时选择下一跳路由。 本发明加速了无线传感器网络中的簇头的选择，以便减少等待时间，减少计算并且最小化非直接电源节点中的传输信号中的过多功耗。

公开(公告)号：WO2016028143A1

公开(公告)日：2016-02-25

申请号：PCT/MY2015/050088

申请日：2015-08-20

Applicant: MIMOS BERHAD

Inventor： MOHD TAHIR, Shahirina ,  ONG, Peng Shen ,  LEE, Chin Yang ,  KARUPPIAH, Ettikan Kandasamy ,  NGO, Chuan Hai

IPC: G06K9/00

CPC classification number: G06K9/00973 ,  G06K9/00771 ,  G06K9/00993

Abstract: Video Analytics (VA) is a compute intensive and time consuming process. The method and apparatus of the present disclosure addresses this problem by creating a parallel mechanism for data reuse and eliminating resource and compute redundancy for multiple video analytics execution. The method involves identifying common VA modules for execution across VA operations, collating outputs of the executed VA modules in a parallel configuration and analysing the collated outputs for detecting occurrence of an event associated with pre-defined specifications.

Abstract translation: 视频分析（VA）是一个计算密集型和耗时的过程。 本公开的方法和装置通过创建用于数据重用的并行机制并消除用于多个视频分析执行的资源和计算冗余来解决该问题。 该方法涉及识别用于在VA操作之间执行的常见VA模块，以并行配置对所执行的VA模块的输出进行整理，并分析整理的输出以检测与预定义规范相关联的事件的发生。

公开(公告)号：WO2016012903A1

公开(公告)日：2016-01-28

申请号：PCT/IB2015/055343

申请日：2015-07-15

Applicant: MIMOS BERHAD

Inventor： SINGH, Keeratpal ,  KARUPPIAH, Ettikan Kandasamy ,  MAT NOR, Fazli

IPC: G06F17/30

CPC classification number: G06F17/30545 ,  G06F17/30477

Abstract: A system (100) and a method for querying heterogeneous data sources have been disclosed. The system (100) based on machine learning and classification rules, predicts a best route for querying at least one data source from the heterogeneous data sources. The system (100) minimizes inefficient use of hardware resources and obtains near real time response from the data source selected through the predicted route for executing the query.

Abstract translation: 已经公开了一种用于查询异构数据源的系统（100）和方法。 基于机器学习和分类规则的系统（100）预测了用于从异构数据源查询至少一个数据源的最佳路由。 系统（100）最小化硬件资源的低效率使用，并且通过用于执行查询的预测路由选择的数据源获得接近实时的响应。

公开(公告)号：WO2014171810A2

公开(公告)日：2014-10-23

申请号：PCT/MY2014/000035

申请日：2014-03-18

Applicant: MIMOS BERHAD

Inventor： MOHD NAZIR, Mohd Amril Nurman ,  ONG, Hong Hoe ,  KARUPPIAH, Ettikan Kandasamy ,  MOHAMAD YASSIN, Yaszrina

IPC: G06F11/14

CPC classification number: G06F11/1484 ,  G06F11/1492 ,  G06F11/202

Abstract: A system and method of fault tolerant for distributed applications in a virtualized environment is provided by utilizing Application Agent (AA) of the application Peer-to-Peer (P2P) overlay network. The system and method of the present invention includes the steps of pre-deployment of Virtual Machine (VM) images by executing application by User by invoking the Application Agent (502) and the Application Agent (AA) contact the nearest front end node (504). The Application Agent (AA) request for deployment of virtual machines (VMs) based on task requirement upon receipt of response from front end node (506). Thereafter, a structured overlay network is formed based on virtual machines (VMs) allocated by the front end node (508) and Application Agent (AA) further tracks the status of virtual machines (VMs). Upon successful deployment of virtual machine (VM) images, tasks are spawn during execution of application (404) by replicating computational tasks and data items in DHT (Distributed Hash Table)-based peer to peer (P2P) overlay network with small overhead. Computational tasks are allocated to virtual machines (VMs) (406) and completed task are registered accordingly (408) upon successful allocation of said tasks. Further, the Application Agent (AA) retrieves output data of each completed task. Pre-deployment of virtual machine (VM) images enables Application Agent (AA) to initiate deployment of virtual machines (VMs) based on task requirement and tracking the deployment of VM status. Further, Distributed Hash Tables (DHTs) are leverage to provide long-term fault tolerance which enables remote computational steering without advance reservation.

Abstract translation: 通过利用应用对等（P2P）覆盖网络的应用代理（AA）提供虚拟化环境中分布式应用的容错系统和方法。 本发明的系统和方法包括以下步骤：通过由用户通过调用应用代理（502）和应用代理（AA）联系最近的前端节点（504）来执行应用来预部署虚拟机（VM） ）。 应用代理（AA）在接收到来自前端节点（506）的响应时，基于任务要求来部署虚拟机（VM）。 此后，基于由前端节点（508）分配的虚拟机（VM）和应用代理（AA）进一步跟踪虚拟机（VM）的状态来形成结构化覆盖网络。 在成功部署虚拟机（VM）映像后，通过在具有较小开销的DHT（分布式散列表）的对等（P2P）覆盖网络中复制计算任务和数据项，在执行应用程序（404）期间产生任务。 计算任务被分配给虚拟机（VM）（406），并且在成功分配所述任务时相应地登记完成的任务（408）。 此外，应用代理（AA）检索每个完成的任务的输出数据。 虚拟机（VM）映像的预部署使应用程序代理（AA）可以根据任务要求启动虚拟机（VM）的部署，并跟踪VM状态的部署。 此外，分布式散列表（DHT）可以提供长期的容错能力，可以实现远程计算转向，无需提前预约。