ppxscal/embedding_network huggingface dataset:
A hybrid approach to concept selection through fuzzy analytic network process
Authors: Z. Ayağ, R. G. Özdemir
Venue: Computers and Industrial Engineering (2009)

Evaluating conceptual design alternatives in a new product development (NPD) environment has been one of the most critical issues for many companies which try to survive in the fast-growing world markets. Therefore, most companies have used various methods to successfully carry out this difficult and time-consuming evaluation process. Of these methods, analytic hierarchy process (AHP) has been widely used in multiple-criteria decision-making (MCDM) problems. But, in this study, we used analytical network process (ANP), a more general form of AHP, instead of AHP due to the fact that AHP cannot accommodate the variety of interactions, dependencies and feedback between higher and lower level elements. Furthermore, in some cases, due to the vagueness and uncertainty on the judgments of a decision-maker, the crisp pairwise comparison in the conventional ANP is insufficient and imprecise to capture the right judgments of the decision-maker. Therefore, a fuzzy logic is introduced in the pairwise comparison of ANP to make up for this deficiency in the conventional ANP, and is called as fuzzy ANP. In short, in this paper, a fuzzy ANP-based approach is proposed to evaluate a set of conceptual design alternatives developed in a NPD environment in order to reach to the best one satisfying both the needs and expectations of customers, and the engineering specifications of company. In addition, a numerical example is presented to illustrate the proposed approach.
A Polynomial-Based Countermeasure to Selective Forwarding Attacks in Sensor Networks
Authors: Xie Lei, Xu Yong-jun, Pan Yong, Zhu Yue-fei
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

In data-centric wireless sensor networks (WSN), the malicious nodes may drop some crucial data packets, which serious destroy the network's data collection and decrease the availability of sensor services. In this paper, we present a lightweight security scheme based on polynomial modeling for preventing selective forwarding attacks. Both theoretical analysis and simulations show that the proposed scheme can alleviate the impact of this type of attack and improve the robustness of the network under conditions of a good tradeoff between the security reliability and the communication overhead. The simulation results show that our scheme can achieve a high success sending ratio in face of a large number of malicious nodes, while the communication overhead can be controlled within reasonable bounds.
Ensemble component selection for improving ICA based microarray data prediction models
Authors: Kun-Hong Liu, Bo Li, Jun Zhang, Ji-Xiang Du
Venue: Pattern Recognition (2009)

Independent component analysis (ICA) has been widely used to tackle the microarray dataset classification problem, but there still exists an unsolved problem that the independent component (IC) sets may not be reproducible after different ICA transformations. Inspired by the idea of ensemble feature selection, we design an ICA based ensemble learning system to fully utilize the difference among different IC sets. In this system, some IC sets are generated by different ICA transformations firstly. A multi-objective genetic algorithm (MOGA) is designed to select different biologically significant IC subsets from these IC sets, which are then applied to build base classifiers. Three schemes are used to fuse these base classifiers. The first fusion scheme is to combine all individuals in the final generation of the MOGA. In addition, in the evolution, we design a global-recording technique to record the best IC subsets of each IC set in a global-recording list. Then the IC subsets in the list are deployed to build base classifier so as to implement the second fusion scheme. Furthermore, by pruning about half of less accurate base classifiers obtained by the second scheme, a compact and more accurate ensemble system is built, which is regarded as the third fusion scheme. Three microarray datasets are used to test the ensemble systems, and the corresponding results demonstrate that these ensemble schemes can further improve the performance of the ICA based classification model, and the third fusion scheme leads to the most accurate ensemble system with the smallest ensemble size.
The Strong Diagnosability of Regular Networks and Product Networks under the PMC Model
Authors: Sun-Yuan Hsieh, Tsung-Yen Chuang
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

Strong diagnosability is a more precise concept for measuring the reliability of multiprocessor systems than the traditional global measurement. In this paper, we study the strong diagnosability of multiprocessor systems under the PMC model. Our main objective is to determinate the strong diagnosability of two wide classes of networks, namely regular networks and product networks, subject to certain conditions. Based on our results, we demonstrate the strong diagnosability of several well-known networks, including variants of hypercubes and many others.
On scaling strategies for the full-body postural control of virtual mannequins
Authors: Ronan Boulic, Damien Maupu, Daniel Thalmann
Venue: Interacting with Computers (2009)

Due to its intrinsic complexity, full-body postural input has been mostly limited to off-line motion capture and to on-line puppetry of a virtual character with little interaction with its environment (e.g. floor). The motion capture technology is now mature enough to envision the on-line full-body postural control of virtual mannequins involved in precise reaching tasks. We have investigated such tasks for mannequins of differing body heights in comparison to that of the system user. Such broad-range avatar control is relevant for virtual prototyping in various industrial sectors as a single person is responsible for evaluating a virtual prototype for a full range of potential end-users. In the present paper we report on two scaling strategies that can be enforced in such a context of height-differing avatar control. Both scaling strategies have been evaluated in a wide-range reach study both in front of a stationary immersive display and with an HMD. A comparison is also made with a baseline scenario, which exploits a simple rigid shape (i.e. a proxy), to assess the specific influence of controlling a complex articulated avatar.
Signal skew aware floorplanning and bumper signal assignment technique for flip-chip
Authors: Cheng-Yu Wang, Wai-Kei Mak
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Flip-chip is a solution for designs requiring more I/O pins and higher speed. However, the higher speed demand also brings the issue of signal skew. In this paper, we propose a new 3-stage design layout methodology for flip-chip considering signal skew. Firstly, we produce an initial bumper signal assignment, and then solve the flip-chip floorplanning problem using a partitioning-based technique to spread the modules across the flip-chip as the distribution of its bumpers. With an anchoring and relocation strategy, we can effectively place I/O buffers at desirable locations. Finally, we further reduce signal skew and monotonic routing density by refining the bumper signal assignment. Experimental results show that signal skew of traditional floorplanners range from 4% to 280% higher than ours. And the total wirelength of other floorplanners is as much as 100% higher than ours. Moreover, our signal refinement method can further decrease monotonic routing density by up to 8% and signal skew by up to 11%.
Influence des syst&egrave;mes de r&eacute;f&eacute;rence sur les profils de collaboration dans un environnement virtuel
Authors: Amine Chellali, Isabelle Milleville-Pennel, Cedric Dumas
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

Virtual collaborative environment are 3D shared spaces in which people can work together. To collaborate through these systems users must have a shared comprehension of the environment. In this study we manipulated contents of a virtual environment to understand how people construct compatible comprehensions of this shared environment. Results show that the use of stable visual landmarks leads to different collaboration profiles.
Note: k-difference matching in amortized linear time for all the words in a text
Authors: Cinzia Pizzi
Venue: Theoretical Computer Science (2009)

Given a text x of length n, we study the problem of solving the k-difference problem for all the words, either with fixed or variable length, taken from the text itself. The result finds its application in pattern discovery in biosequences where over- or under-represented words are extracted from the input sequences. The proposed algorithm runs in amortized linear time per word. This improves the complexity obtained by applying well-known algorithms to each of the O(n) fixed length words or O(n^2) variable length words in x by factor of k, klogk, or mlogm, depending on the chosen algorithm. The space required is O(n) if we just count the occurrences, or O(n^2) if we also store the positions. This second scenario can be used as the basis for other applications, such as searching gapped factors with mismatches or approximate pattern matching extended to any word.
The MWF method for kinetic equations system
Authors: Carlo Bianca, Francesco Pappalardo, Santo Motta
Venue: Computers Mathematics with Applications (2009)

Many physical or biological phenomena deal with the dynamics of interacting entities. These class of phenomena are well described in physics, using a kinetic approach based on Boltzmann equation. A Generalized Kinetic theory has been proposed to extend this approach to biological scenarios. An analytical solution of Boltzmann equation can be found only in very simple cases, so numerical methods become extremely relevant. The particle method is a class of numerical methods used to find a numerical solution of Boltzmann equations. The MWF-method for kinetic equations was firstly proposed by S. Motta and J. Wick in 1992. Here, we show that the MWF-method can be extended to system of Boltzamm equations.
Sensor Web Oriented Web-Based GIS
Authors: Shaoqing Shen, Xiao Cheng, Peng Gong
Venue: Proceedings of the 8th International Symposium on Web and Wireless Geographical Information Systems (2008)

Web-Based GIS has brought a lot of convenience to the public. However, traditional Web-Based GIS cannot meet the needs in applications that request for many different data types and real-time updates. A Sensor Web is a computer accessible network of many, spatially distributed devices using sensors to monitor conditions at different locations. In this paper we demonstrate the concept of Sensor Web Oriented Web-Based GIS, which is a new type of Web-Based GIS using Sensor Web as data source.We first describe the concept of Sensor Web Oriented Web-Based GIS after analyzing the disadvantages of traditional Web-Based GIS and Sensor Web. Then we demonstrate the distributed architecture for such a system. At last, a prototype application of Sensor Web Oriented Web-Based GIS is described.
Paints, paper, and programs: first steps toward the computational sketchbook
Authors: Leah Buechley, Sue Hendrix, Mike Eisenberg
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

This paper describes what we believe to be important initial steps toward realizing a novel computational medium that combines elements of programming, painting, and papercrafts. Briefly, this genre of paper computing allows a user to create functional computational artifacts on painted paper substrates. We introduce a construction kit for paper computing that consists of computational elements---microcontrollers, sensors, actuators, and power sources---that are held on paper surfaces by magnetic paint and magnets. Conductive paint applied to these surfaces takes on the role of "wires", connecting the computational elements to one another. These elements can be moved around and from surface to surface, much like magnets on a refrigerator, and the overall result is a tangible medium in which painting, programming, and the affordances of paper blend together. In addition to introducing the kit, we describe example constructions and discuss a variety of potential applications, design projects, and issues for continued research.
A Reconfigurable Bloom Filter Architecture for BLASTN
Authors: Yupeng Chen, Bertil Schmidt, Douglas L. Maskell
Venue: Proceedings of the 22nd International Conference on Architecture of Computing Systems (2009)

Efficient seed-based filtration methods exist for scanning genomic sequence databases. However, current solutions require a significant scan time on traditional computer architectures. These scan time requirements are likely to become even more severe due to the rapid growth in the size of databases. In this paper, we present a new approach to genomic sequence database scanning using reconfigurable field-programmable gate array (FPGA)-based hardware. To derive an efficient mapping onto this type of architecture, we propose a reconfigurable Bloom filter architecture. Our experimental results show that the FPGA implementation achieves an order of magnitude speedup compared to the NCBI BLASTN software running on a general purpose computer.
Modeling Multiscale Subbands of Photographic Images with Fields of Gaussian Scale Mixtures
Authors: Siwei Lyu, Eero P. Simoncelli
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

The local statistical properties of photographic images, when represented in a multi-scale basis, have been described using Gaussian scale mixtures. Here, we use this local description as a substrate for constructing a global field of Gaussian scale mixtures (FoGSMs). Specifically, we model multi-scale subbands as a product of an exponentiated homogeneous Gaussian Markov random field (hGMRF) and a second independent hGMRF. We show that parameter estimation for this model is feasible, and that samples drawn from a FoGSM model have marginal and joint statistics similar to subband coefficients of photographic images. We develop an algorithm for removing additive Gaussian white noise based on the FoGSM model, and demonstrate denoising performance comparable with state-of-the-art methods.
Simulation based planning and scheduling system for TFT-LCD fab
Authors: Bum C. Park, Eui S. Park, Byoung K. Choi, Byung H. Kim, Jin H. Lee
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In a typical LCD factory, a large number of product types are produced concurrently, 24 hours a day and 365 days a year, and there exist various constraints and re-entrant flows in the manufacturing processes. As a result, efficient planning and scheduling of LCD production is a big challenge. Presented in this paper is a simulation-based DPS (daily planning & scheduling) system that was developed by the authors and is being used in a modern LCD Fab in Korea. Also presented in the paper are a business architecture of LCD production management, internal structure of the DPS system, and Fab scheduling logic. The DPS system was installed at a large-size LCD Fab in 2006, and the system has been successfully used for two years leading to a considerable increase in on-time production of LCD panels and a sharp decrease in turn-around time.
A scheduling algorithm with MAP multiplexing in IEEE 802.16 mobile multi-hop relay
Authors: Wen-Hwa Liao, Chen Liu, Avinash Kumar Dubey, Sagar Arora
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

For increasing the service area and decreasing the cost to deploy 802.16 networks, a new architecture named 802.16j of WiMAX which introduced relay station to the network was proposed. Some scheduling algorithms for this network were also proposed and attempted to support relay links in 802.16j, but the benefit still can not reach the potential of 802.16j multi-hop relay system by these scheduling algorithms. For this reason, we consider scheduling lower priority connections when higher priority connections are interfered by other scheduled links at this time. Our algorithm can obviously improve delay and frame utilization of multi-hop relay networks. Simulation results show that the delay of our algorithm can achieve 5%-10% improvement over MAP multiplexing and improved scheduling quality.
A collaborative filtering method based on artificial immune network
Authors: A. Merve Acilar, Ahmet Arslan
Venue: Expert Systems with Applications: An International Journal (2009)

A system is seriously required for helping users to find their path on the shopping and entertainment web sites where the amounts of on-line information vastly increase. Therefore, recommender systems, new type of internet based software tool, appeared, and became an appealing subject for researchers. Collaborative filtering (CF) technique based on user is the one of the method widely used by recommender systems but they have some problems for waiting to be developed solutions that are more efficient. One of these mainly problems is data sparsity. While the number of products is increase, the ratio of common rated products is decrease so calculating the computations of neighbourhood become difficult. The other one is scalability which is the performance problem of the existing algorithms on the datasets has large amounts of information. In this article, we tackle these two questions: (1) how the data sparsity can be reduced ? (2) How to make recommendation algorithms more scalable? We present an approach to addressing the both of these problems at the same time by using a new CF model, constructed based on the Artificial Immune Network Algorithm (aiNet). It is chosen because aiNet is capable of reducing sparsity and providing the scalability of dataset via describing data structure, including their spatial distribution and cluster inter-relations. The new user-item ratings dataset reduced by applying aiNet (aiNetDS) given more stable results and produced predictions more quickly than the raw user-item ratings dataset (rawDS). Besides, the effects of using clustering for forming the neighbourhoods to the system performance are investigated. For this, both of these dataset are clustered by using k-means algorithm and then these cluster partitions are used as neighbourhoods. As a result, it has been shown that the clustered aiNetDS is given more accurate and quick results than the others are.
Predictive vs. passive animation learning tools
Authors: David Scot Taylor, Andrei F. Lurie, Cay S. Horstmenn, Menko B. Johnson, Sean K. Sharma, Edward C. Yin
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

We investigate the effectiveness of a predictive interaction animation tool for understanding graph algorithms. We compare performance improvement of students after they have used two different animation tools for the given algorithms, when one of the tools forces a more active, predictive approach while the other is a more traditional animation. Results show significant improvement in performance after students use the predictive tool.
Bit Allocation for Spatio-temporal Wavelet Coding of Animated Semi-regular Meshes
Authors: Aymen Kammoun, Frédéric Payan, Marc Antonini
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

In this paper, we propose a compression scheme for animated semi-regular meshes. This scheme includes a spatio-temporal wavelet filtering to exploit the coherence both in time and space. In order to optimize the quantization of both spatial and temporal wavelet coefficients, the proposed compression scheme also includes a model-based bit allocation. The experimental results show that this approach significantly improves the compression performances, when comparing with previous similar approaches.
Progressive Correspondence Approach Based on Edge
Authors: Fangzhou Zhang, Linlin Zhang, Dan Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Stereo correspondence is the key approach to recover range information in stereo vision. Considering area matching and feature matching, the stereo correspondence approach based on edge feature is proposed in this paper. As the research object controlled by threshold binary domain, the procedure of correspondence is fulfilled by matching constraint and iterative operation, and algorithm mentioned is valid by experiment.
Temporally-Periodic Solitons of the Parametrically Driven Damped Nonlinear Schrödinger Equation
Authors: E. V. Zemlyanaya, I. V. Barashenkov, N. V. Alexeeva
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

Time-periodic solitons of the parametrically driven damped nonlinear Schrödinger equation are determined as solutions of the boundary-value problem on a two-dimensional domain. We classify stability and bifurcations of single and double-periodic solutions.
Anomaly Based Intrusion Detection Using Data Mining and String Metrics
Authors: Evgeniya Nikolova, Veselina Jecheva
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Computer systems and networks are subject to electronic attacks with increasing number and severity. Intrusion detection is an important technology in the contemporary world as well as an active area of research. The present paper introduces an adaptive approach of data mining techniques and string metrics in anomaly based intrusion detection systems. The conducted simulation experiments and represented results substantiate the proposed method produces reliable results while monitoring the protected system and alarming the detected attacks.
Harmonic variations in three-phase induction motors fed by PWM inverter with different stator coil pitches
Authors: Yasar Birbir, H. Selcuk Nogay
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

A sinusoidal pulse-width modulation (SPWM) inverter feeding five different chorded three-phase induction motors were tested for low-order odd harmonic voltage component and efficiency at different loads. Total harmonic distortion (THD) due to 3rd, 5th, 9th, 11th and 13th harmonics were less in a motor with (1-7) 120° coil pitch. Particular harmonic order for each coil pitch was suppressed and the increasing quantity of efficiency in a motor with (1-6)100° coil pitch was increased by 4,92 %. The full pitch motor with (1-10) 180° coil pitch has more harmonics than other motors.