ppxscal/embedding_network huggingface dataset:
Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem
Authors: M. D. Mahdi Mobini, M. Rabbani, M. S. Amalnik, J. Razmi, A. R. Rahimi-Vahed
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

The resource-constrained project scheduling problem is one of the classical problems in the field of operations research. There are many criteria to efficiently determine the desired schedule of a project. In this paper, a well-known criterion namely project&#x2019;s makespan is considered. Due to the complexity of the problem, it is very difficult to obtain optimum solution for this kind of problems by means of traditional methods. Therefore, an enhanced scatter search, based on a new path relinking and two prominent permutation-based and crossover operators, is devised to solve the problem. In order to validate the performance of the proposed algorithm, in terms of solution quality, the algorithm is applied to various test problems available on the literature and the reliability of it, is compared with well-reported benchmark algorithms. The computational results reveal that the proposed algorithm has appropriate results in comparison with the existing benchmark algorithms.
A Heterogeneous Multicore SoC Optimized for Embedded Visual Media Process
Authors: Ming Yan, Sikun Li, Jianliang Shen, Lei Xie, Lei Liu, Guowei Wan, Liangze Yin
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Embedded high performance computing is a challenge to both software and hardware engineers. Visual media process is a computing intensive and complex application. A heterogeneous multicore SoC is described which is optimized for embedded visual media process. Optimization begins from the very beginning of the chip design, by analyzing of application workload characteristics, such as computing model, data formats, memory access modes and data arrangements. Through a case study of three dimensional reconstruction from multi images, the efficiency and usability of the SoC proved to be high.
A systolic processor for signal processing
Authors: G. A. Frank, E. M. Greenawalt, A. V. Kulkarni
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

A systolic array is a natural architecture for a high-performance signal processor, in part because of the extensive use of inner-product operations in signal processing. The modularity and simple interconnection of systolic arrays promise to simplify the development of cost-effective, high-performance, special-purpose processors. ESL Incorporated has built a proof of concept model of a systolic processor. It is flexible enough to permit experimentation with a variety of algorithms and applications. ESL is exploring the application of systolic processors to image- and signal-processing problems. This paper describes this experimental system and some of its applications to signal processing. ESL is also pursuing new types of systolic architectures, including the VLSI implementation of systolic cells for solving systems of linear equations. These new systolic architectures allow the real-time design of adaptive filters.
Controlling a drone: Comparison between a based model method and a fuzzy inference system
Authors: K. M. Zemalache, H. Maaref
Venue: Applied Soft Computing (2009)

The work describes an automatically on-line self-tunable fuzzy inference system (STFIS) of a new configuration of mini-flying called XSF (X4 Stationnary Flyer) drone. A fuzzy controller based on on-line optimization of a zero order Takagi-Sugeno fuzzy inference system (FIS) by a back propagation-like algorithm is successfully applied. It is used to minimize a cost function that is made up of a quadratic error term and a weight decay term that prevents an excessive growth of parameters. Thus, we carried out control for the continuation of simple trajectories such as the follow-up of straight lines, and complex (half circle, corner, and helicoidal) by using the STFIS technique. This permits to prove the effectiveness of the proposed control law. Simulation results and a comparison with a static feedback linearization controller (SFL) are presented and discussed. We studied the robustness of the two controllers used in the presence of disturbances. We presented two types of disturbances, the case of a breakdown of an engine as well as a gust of wind.
Mathematical models towards self-organizing formal federation languages based on conceptual models of information exchange capabilities
Authors: Andreas Tolk, Saikou Y Diallo, Charles D Turnitsa
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Conceptual models capture information that is crucial for composability of legacy solutions that is not formally captured in the derived technical artifacts. It is necessary to make this information available for the selection (or elimination) of available solutions, their orchestration, and their execution. Current standards barely address this class of problems. The approach presented in this paper is the first step towards self-organizing federation languages. The system interfaces are described in form of exchangeable data. The context of information exchange (syntax, semantics, and pragmatics) is captured as metadata. These metadata are used to identify the elements of a formal federation language that links model composability and simulation interoperability based on conceptual model elements. The paper describes the formal process of selection, orchestration, and execution and the underlying mathematics for the information exchange specifications that bridge conceptual and engineering levels of the federation process.
Optimized Parallel Implementation of Gillespie's First Reaction Method on Graphics Processing Units
Authors: Cristian Dittamo, Davide Cangelosi
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

The simulation of chemical reacting systems is one of the most challenging topics in Systems Biology, due to their complexity and inherent randomness. The Gillespie's Stochastic Simulation Algorithm (SSA) is a standard algorithm to simulate well-stirred biochemical systems, butthe computational burden makes this algorithm slow to compute for many realistic problems. Recent programmability improvements allow non-graphics applications to leverage the Graphics Processing Units'(GPUs) computational power. This paper describes practical issues arising by a parallel implementation on GPU technology, shows how to reduce the memory space required by one of the most known versions of SSA, and presents the application of the implemented algorithm to a test model.
Getting sidetracked: display design and occasioning photo-talk with the photohelix
Authors: Otmar Hilliges, David Stanley Kirk
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

In this paper we discuss some of our recent research work designing tabletop interfaces for co-located photo sharing. We draw particular attention to a specific feature of an interface design, which we have observed over an extensive number of uses, as facilitating an under-reported but none-the-less intriguing aspect of the photo-sharing experience - namely the process of 'getting sidetracked'. Through a series of vignettes of interaction during photo-sharing sessions we demonstrate how users of our tabletop photoware system used peripheral presentation of topically incoherent photos to artfully initiate new photo-talk sequences in on-going discourse. From this we draw implications for the design of tabletop photo applications, and for the experiential analysis of such devices.
Study on the Risk Prediction of Real Estate Investment Whole Process Based on Support Vector Machine
Authors: Wanqing Li, Yong Zhao, Wenqing Meng, Shipeng Xu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

With the rapid development of real estate, the risk of investment is also increasing rapidly. So the risk of predicting and controlling the real estate investment has become the key to the success or failure of the project. In this paper, a support vector machine (SVM) modeling approach for real estate investment risk prediction is proposed at first, which is made use of its merits of structural risk minimization principle, the small study sample and non-linear to analyze the risk factors during investment every stage in real estate projects, then a model based on support vector machines in real estate investment risk is built up, at last, an example is given to prove that this model is effective and practical. All these are used of providing useful help of the future of real estate investment risk control and management.
Comparing semiliterate and illiterate users' ability to transition from audio+text to text-only interaction
Authors: Leah Findlater, Ravin Balakrishnan, Kentaro Toyama
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Multimodal interfaces with little or no text have been shown to be useful for users with low literacy. However, this research has not differentiated between the needs of the fully illiterate and semiliterate - those who have basic literacy but cannot read and write fluently. Text offers a fast and unambiguous mode of interaction for literate users and the exposure to text may allow for incidental improvement of reading skills. We conducted two studies that explore how semiliterate users with very little education might benefit from a combination of text and audio as compared to illiterate and literate users. Results show that semiliterate users reduced their use of audio support even during the first hour of use and over several hours this reduction was accompanied by a gain in visual word recognition; illiterate users showed no similar improvement. Semiliterate users should thus be treated differently from illiterate users in interface design.
Disk Scheduling with Quality of Service Guarantees
Authors: John Bruno, Jose Brustoloni, Eran Gabber, Banu Ozden, Abraham Silberschatz
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper introduces YFQ, a new disk scheduling algorithm that allows applications to set aside for exclusive use portions of the disk bandwidth. We implemented YFQ as part of the Eclipse/BSD operating system, which is derived from FreeBSD, a version of 4.4 BSD Unix. YFQ's disk bandwidth reservations can guarantee file accesses with high throughput, low delay, and good fairness. Such quality of service (QoS) guarantees to individual applications unfortunately can also hinder global disk scheduling optimizations. We propose and evaluate several disk scheduling enhancements that promote global optimizations and give to YFQ aggregate disk thoughput approaching that of FreeBSD's conventional disk scheduler, which does not provide QoS guarantees. We believe that our enhancements may be helpful also in other disk scheduling algorithms.
Early analysis of design concepts using rough set theory
Authors: D. Alisantoso, L. P. Khoo
Venue: International Journal of Systems Science (2009)

This article proposes a rough-set-based approach to early analysis of design concepts. The approach aims at providing a metrics to facilitate the evaluation of design concepts and enable early detection of inadequacy in design. Based on the rough set theory, an information system can be constructed using information such as design concepts and product capabilities gleaned from past designs. This information is then used to derive a set of design rules for the analysis of new design concepts. The proposed approach embodies a novel technique for the handling of unavailable information, which is a frequent occurrence in product design. It is augmented with a mechanism for incremental updating of design rules. The details of the approach, the mechanism for incremental updating of design rules and two case studies are presented in this article.
3D Face Recognition Benchmarks on the Bosphorus Database with Focus on Facial Expressions
Authors: Neşe Alyüz, Berk Gökberk, Hamdi Dibeklioğlu, Arman Savran, Albert Ali Salah, Lale Akarun, Bülent Sankur
Venue: Biometrics and Identity Management: First European Workshop, BIOID 2008, Roskilde, Denmark, May 7-9, 2008. Revised Selected Papers (2008)

This paper presents an evaluation of several 3D face recognizers on the Bosphorus database which was gathered for studies on expression and pose invariant face analysis. We provide identification results of three 3D face recognition algorithms, namely generic face template based ICP approach, one-to-all ICP approach, and depth image-based Principal Component Analysis (PCA) method. All of these techniques treat faces globally and are usually accepted as baseline approaches. In addition, 2D texture classifiers are also incorporated in a fusion setting. Experimental results reveal that even though global shape classifiers achieve almost perfect identification in neutral-to-neutral comparisons, they are sub-optimal under extreme expression variations. We show that it is possible to boost the identification accuracy by focusing on the rigid facial regions and by fusing complementary information coming from shape and texture modalities.
Efficient multicast routing protocol for mobile ad hoc networks based on dense zones
Authors: Boucif Amar Bensaber, Samir Khali, Ismail Biskri
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

We propose a new tree-based multicast routing protocol for wireless ad hoc networks based on dense zones (DZ-MAODV). This protocol takes into account the nodes' mobility and provides a connectivity that ensures a wide diffusion with a good quality of service. The DZ-MAODV retains all the advantages of the MAODV (multicast ad hoc on-demand distance vector) routing protocol such as high scalability and low route maintenance overhead under high mobility. Moreover, it takes into account the multicast members' concentration in certain areas of the network in order to delegate the network management task from source node to leader node in each dense zone. This is ensured by designing a new algorithm for zone leader election using a best-connective node detection algorithm which maintains more stability and lower overhead traffic.
Quasi-linear transformations and discrete tilings
Authors: M. -A. Jacob-Da Col, P. Tellier
Venue: Theoretical Computer Science (2009)

Tilings of the discrete plane Z^2 generated by quasi-linear transformations (QLT) have been introduced by Nehlig [P. Nehlig, Applications quasi-affines: Pavages par images reciproques, Theoretical Computer Science 156 (1995) 1-38]. We studied these tilings and gave some results, such as periodicity and the number of neighbours of each of them [M.-A. Jacob-Da Col, Applications quasi-affines et pavages du plan discret, Theoretical Computer Science 259 (2001) 245-269. Also available in English: http://dpt-info.u-strasbg.fr/~jacob/articles/paving.pdf]. The aim of this paper is to go on with this study in the discrete n-dimensional space Z^2; we give a lower and an upper bound to the number of distinct tiles. We also give an algorithm to determine the points of a given tile, this algorithm will induce another algorithm to determine the number of distinct tiles associated to a QLT.
Location Estimation Using RSSI and Application of Extended Kalman Filter in Wireless Sensor Networks
Authors: N. Karthick, Keshav Prashanth, K. Venkatraman, Amutha Nanmaran, J. Naren
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Wireless Sensor Networks are mostly used for their monitoring applications In these applications, the network captures the environment and searches for occurrences of events by sensing different physical properties, such as temperature, humidity, pressure,ambient light, and movement. Location in time and space is a paramount issue and nodes are usually required for tracking purpose. The availability of RSSI in the motes help us to estimate finding the location in terms of time and space. And then sensor nodes deliver the coordinate location to base station through neighboring sensor nodes. The availability of RSSI in the sensor networks made us to try an attempt to identify the locations of unknown sensor nodes. It is greatly needed because of their location and data both are combined in a real time manner as they separate with other it becomes meaningless. Our method showed better results in comparison with the existing methods.
Process variation mitigation via post silicon clock tuning
Authors: Kelageri Nagaraj, Sandip Kundu
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Manufacturing process corner, voltage and temperature (PVT) conditions lead to variation in path delays and clock skews. Such variations end up degrading the performance of manufactured chips. Since, such variations are hard to predict in pre-silicon phase, tunable clock buffers have been used in several microprocessor designs. These buffers are tuned to maximize operating clock frequency of a design. In this paper, we report a study on using measured delays on selected patterns to determine which buffers should be targeted for tuning. Based on statistical simulation studies, it is found that the proposed approach can improve clock frequency by as much as 9% in the average case.
A comparative user study on rating vs. personality quiz based preference elicitation methods
Authors: Rong Hu, Pearl Pu
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

We conducted a user study evaluating two preference elicitation approaches based on ratings and personality quizzes respectively. Three criteria were used in this comparative study: perceived accuracy, user effort and user loyalty. Results from our study show that the perceived accuracy in two systems is not significantly different. However, users expended significantly less effort, both perceived cognitive effort and actual task time, to complete the preference profile establishing process in the personality quiz-based system than in the rating-based system. Additionally, users expressed stronger intention to reuse the personality quiz-based system and introduce it to their friends. After using these two systems, 53% of users preferred the personality quiz-based system vs. 13% of users preferred the rating-based system, since most users thought the former is easier to use.
Regularity of the Euclid Algorithm; application to the analysis of fast GCD Algorithms
Authors: Eda Cesaratto, Julien Clément, Benoît Daireaux, Loïck Lhote, Véronique Maume-Deschamps, Brigitte Vallée
Venue: Journal of Symbolic Computation (2009)

There exist fast variants of the gcd algorithm which are all based on principles due to Knuth and Schonhage. On inputs of size n, these algorithms use a Divide and Conquer approach, perform FFT multiplications with complexity @m(n) and stop the recursion at a depth slightly smaller than lgn. A rough estimate of the worst-case complexity of these fast versions provides the bound O(@m(n)logn). Even the worst-case estimate is partly based on heuristics and is not actually proven. Here, we provide a precise probabilistic analysis of some of these fast variants, and we prove that their average bit-complexity on random inputs of size n is @Q(@m(n)logn), with a precise remainder term, and estimates of the constant in the @Q-term. Our analysis applies to any cases when the cost @m(n) is of order @W(nlogn), and is valid both for the FFT multiplication algorithm of Schonhage-Strassen, but also for the new algorithm introduced quite recently by Furer [Furer, M., 2007. Faster integer Multiplication. In: Proceedings of STOC'07. pp. 57-66]. We view such a fast algorithm as a sequence of what we call interrupted algorithms, and we obtain two main results about the (plain) Euclid Algorithm, which are of independent interest. We precisely describe the evolution of the distribution of numbers during the execution of the (plain) Euclid Algorithm, and we exhibit an (unexpected) density @j which plays a central role since it always appears at the beginning of each recursive call. This strong regularity phenomenon proves that the interrupted algorithms are locally ''similar'' to the total algorithm. This ultimately leads to the precise evaluation of the average bit-complexity of these fast algorithms. This work uses various tools, and is based on a precise study of generalised transfer operators related to the dynamical system underlying the Euclid Algorithm.
A robust image watermarking algorithm using SVR detection
Authors: Xiang-Yang Wang, Zi-Han Xu, Hong-Ying Yang
Venue: Expert Systems with Applications: An International Journal (2009)

Geometric distortion is known as one of the most difficult attacks to resist. Geometric distortion desynchronizes the location of the watermark and hence causes incorrect watermark detection. According to the Support Vector Regression (SVR), a new image watermarking detection algorithm against geometric attacks is proposed in this paper, in which the steady Pseudo-Zernike moments and Krawtchouk moments are utilized. The host image is firstly transformed from rectangular coordinates to polar coordinates, and the Pseudo-Zernike moments of the host image are computed. Then some low-order Pseudo-Zernike moments are selected, and the digital watermark is embedded into the cover image by quantizing the magnitudes of the selected Pseudo-Zernike moments. The main steps of watermark detecting procedure include: (i) some low-order Krawtchouk moments of the image are calculated, which are taken as the eigenvectors; (ii) the geometric transformation parameters are regarded as the training objective, the appropriate kernel function is selected for training, and a SVR training model can be obtained; (iii) the Krawtchouk moments of test image are selected as input vector, the actual output (geometric transformation parameters) is predicted by using the well trained SVR, and the geometric correction is performed on the test image by using the obtained geometric transformation parameters; (iv) the digital watermark is extracted from the corrected test image. Experimental results show that the proposed watermarking detection algorithm is not only robust against common signal processing such as filtering, sharpening, noise adding, and JPEG compression etc., but also robust against the geometric attacks such as rotation, translation, scaling, cropping and combination attacks, etc.
Affine double- and triple-product wavelet integrals for rendering
Authors: Bo Sun, Ravi Ramamoorthi
Venue: ACM Transactions on Graphics (TOG) (2009)

Many problems in computer graphics involve integrations of products of functions. Double- and triple-product integrals are commonly used in applications such as all-frequency relighting or importance sampling, but are limited to distant illumination. In contrast, near-field lighting from planar area lights involves an affine transform of the source radiance at different points in space. Our main contribution is a novel affine double- and triple-product integral theory; this generalization enables one of the product functions to be scaled and translated. We study the computational complexity in a number of bases, with particular attention to the common Haar wavelets. We show that while simple analytic formulae are not easily available, there is considerable sparsity that can be exploited computationally. We demonstrate a practical application to compute near-field lighting from planar area sources, that can be easily combined with most relighting algorithms. We also demonstrate initial results for wavelet importance sampling with near-field area lights, and image processing directly in the wavelet domain.