The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Currently, the demand on portable medical electronic systems are increasing, for they provide services and information to both patients and doctors that the traditional medical methods cannot achieve. However, the development of portable medical electronic systems has many limitations, i.e., one has to find a sweet spot among performance, power consumption, size, and cost. For instance, if one only...
This paper introduced the new approaches to big data platform, RHadoop and SparkR, and integrated them to form a high-performance big data analysis with multiple platforms as part of business intelligence (BI) to carry out rapid data retrieval and analysis with R programming. This paper aims to develop the optimization for job scheduling using MSHEFT algorithm and implement the optimized platform...
Mining high utility itemsets from a transactional database refers to the discovery of itemsets with high utility like profits. Although a number of relevant approaches have been proposed in recent years, but they incur the problem of producing a large number of candidate itemsets for high utility itemsets. Such a large number of candidate itemsets degrades the mining performance in terms of execution...
The cache replacement policy is a major factor which determines the effectiveness of memory hierarchy. The replacement policy affects both the hit rate and the access latency of the cache. It decides the cache block to be replaced to give room for the incoming block. The replacement policy has to be chosen in such a way that the cache misses are reduced. Last level cache misses causes hundreds of...
We propose a new concept of minmax memory claim (MMC) to achieve cost-effective workflow computations in in-memory cloud computing environments. The minmax-memory claim is defined as the minimum amount of memory required to finish the workflow without compromising its maximum concurrency. With MMC, the workflow tenants can achieve the best performance via the maximum concurrency while minimizing the...
In an attempt to ensure good-quality software, there is need to test all possible inputs. Owing to the fact that the exhaustive testing is hardly feasible, many software testing approaches has been proposed. Combinatorial Interaction Testing (CIT) is very promising technique to minimize the number of test cases. Although useful, most of exiting CIT strategies and tools focus on data inputs and assume...
Techniques for efficient mining of frequent patterns have been studied extensively by many researchers. However, the previously proposed techniques still encounter some performance bottlenecks when mining databases with different data characteristics such as, dense vs. sparse, long vs. short patterns, memory-based vs. disk-based, etc. In this study, explored the unifying feature among the internal...
Mobile environment provides storage as a main service. Data storage is a desired property when users outsource their data to be stored in a place irrespective of the locations. File systems are designed to control how files are stored and retrieved. Without knowing the context and semantics of file contents, file systems often contain duplicate copies and result in redundant consumptions of storage...
High utility quantitative itemset mining refers to discovering sets of items that carry not only high utilities (e.g., high profits) but also quantitative attributes. Although this topic is very important to many applications, it has not been deeply explored and existing algorithms for mining high utility quantitative itemsets remain computationally expensive. To address this problem, we propose a...
Background subtraction is widely used in battery-operated surveillance system. In the system, memory requirement and computational complexity are important issues due to a constraint of the hardware resource. We propose memory-efficient and low computational complexity background subtraction algorithm based on multi-background registration (MBR) technique algorithm.
The pattern growth approach of association rule mining is very efficient as avoiding the candidate generation step which is utilized in Apriori algorithm. This research is about the revisiting the pattern growth approaches to discover the different research works carried out to improve the performance using different criteria like header table dealing, item search order, conditional database representation,...
This paper introduced a method for producing massive and immediate result in multi-join query (DAP Join, for short). Mostly previous research are based on single join operator while DAP join is based on multiple join operators. DAP join distinguishes itself from all previous techniques by concluding benefits of Hash Merge join, Rate Based Progressive Join and State Spilling and its own new approach...
In recent years, the management and processing of data streams has become a topic of active research in several fields of computer science, such as distributed systems, database systems, and data mining. In data streams' applications, such as network monitoring, telecommunication systems and sensor networks, because of online monitoring, answering to the user's queries should be time and space efficient...
In this paper, a new pipelined, reduced memory CORDIC-based architecture is presented for any radix size FFT. A multi-bank memory structure and the corresponding addressing scheme are used to realize the parallel and in-place data accesses. The proposed memory-reduced CORDIC algorithm eliminates the need for storing twiddle factors and angles, resulting in significant area savings with no negative...
Ontology matching is one of the main aspects of semantic Web, which aims at finding correspondences between entities of given ontologies. These found correspondences can be used for applications such as ontology merging, query rewriting, instance transformation, and so on. There has been proposed some algorithms and techniques for matching ontologies. One of these algorithms is multi-level matching...
This paper presents several techniques supported by the TMS320 DSP algorithm standard (referred to as XDAIS) which can be employed by algorithm writers to assist application developers in optimizing their systempsilas performance and sharing of memory resources. The first technique is based on using statically allocated global data structures. The second technique is built on the concepts of scratch...
Processors speed is much faster than memory; to bridge this gap cache memory is used. This paper proposes a preeminent pair of replacement algorithms for Level 1 cache (L1) and Level 2 cache (L2) respectively for the matrix multiplication (MM) application. The access patterns of L1 and L2 are different, when CPU not gets the desired data in L1 then it goes to L2. Thus the replacement algorithm which...
In this paper a BISR architecture for embedded memories is presented. The proposed scheme utilises a multiple bank cache-like memory for repairs. Statistical analysis is used for minimisation of the total resources required to achieve a very high fault coverage. Simulation results show that the proposed BISR scheme is characterised by high efficiency and low area overhead, even for high defect densities...
This paper presents a self-testing framework targeting the LEON3 embedded microprocessor with built-in test-scheduling features. The proposed design exploits existing post production test sets, designed for software-based testing of embedded microprocessors. The framework also includes a constraint-based approach of test-routine scheduling. The initial results show that the test execution time could...
One of the challenges in SOA is to provide an efficient and effective way to select compatible Web service(s) and compose them into a functional service process that satisfies a user's needs. Moreover, the Web services(s) selected may be integrated with structures such as branches and merges to fulfill a task. This paper describes our system architecture and strategies on Web services composition...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.