ppxscal/embedding_network huggingface dataset:
A novel method for real parameter optimization based on Gene Expression Programming
Authors: Kaikuo Xu, Yintian Liu, Rong Tang, Jie Zuo, Jun Zhu, Changjie Tang
Venue: Applied Soft Computing (2009)

Gene Expression Programming (GEP) is a new technique of evolutionary algorithm that implements genome/phoneme representation in computing programs. Due to its power in global search, it is widely applied in symbolic regression. However, little work has been done to apply it to real parameter optimization yet. This paper proposes a real parameter optimization method named Uniform-Constants based GEP (UC-GEP). In UC-GEP, the constant domain directly participates in the evolution. Our research conducted extensive experiments over nine benchmark functions from the IEEE Congress on Evolutionary Computation 2005 and compared the results to three other algorithms namely Meta-Constants based GEP (MC-GEP), Meta-Uniform-Constants based GEP (MUC-GEP), and the Floating Point Genetic Algorithm (FP-GA). For simplicity, all GEP methods adopt a one-tier index gene structure. The results demonstrate the optimal performance of our UC-GEP in solving multimodal problems and show that at least one GEP method outperforms FP-GA on all test functions with higher computational complexity.
Nano-CMOS Design for Manufacturability: Robust Circuit and Physical Design for Sub-65nm Technology Nodes
Authors: Ban P. Wong, Anurag Mittal, Greg W. Starr, Franz Zach, Victor Moroz, Andrew Kahng
Venue:  (2008)

This book is the sequel to Nano-CMOS Circuit and Physical Design, taking design to technology nodes beyond 65nm geometries. It examines the challenges that design engineers face in the nano-scaled era, such as exacerbated effects and the proven design for manufacturability (DFM) methodology in the midst of increasing variability and design process interactions. It also tackles complex issues in the design process and introduces several emerging concepts, including stress proximity effects, contour-based extraction, and design process interactions.
Towards automated ECOs in FPGAs
Authors: Andrew C. Ling, Stephen D. Brown, Jianwen Zhu, Sean Safarpour
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

During the FPGA design flow, engineering change orders (ECOs) have become an essential methodology to apply late-stage specification changes and bug fixes. ECOs are beneficial since they are applied directly to a place-and-routed netlist which preserves most of the engineering effort invested previously. Unfortunately, designers often apply ECOs in a manual fashion which has an unpredictable impact on the design's final correctness and end costs. As a solution, we introduce an automated method to tackle the ECO problem. Specifically, we introduce a resynthesis technique which can automatically update the functionality of a circuit by leveraging the existing logic within the design; thereby removing the inefficient manual effort required by a designer. Our technique is robust enough to handle a wide range of changes. Furthermore, our technique can successfully make late-stage functional changes while minimally perturbing the place-and-routed netlist: something that is necessary for ECOs. When applied to several benchmarks on Altera's Stratix architecture, we show that our approach can automatically apply ECOs in over 80% of the cases presented. Furthermore, our technique does this with a minimal impact to the circuit performance where on average over 90% of the placement and routing wires remain unchanged.
Adaptive key diffusion restriction method for dynamic filtering in sensor networks based on fuzzy logic
Authors: Man Ho Han, Sang Jin Lee, Tae Ho Cho
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

Wireless sensor networks are vulnerable to false data injection attacks, because they are disseminated in hostile environments. Adversaries can inject false report into the network using compromised nodes, with the goal of deceiving the base station and draining the energy resource of forwarding node. The dynamic en-route filtering scheme (DEF) can detect and drop false date for the forwarding process. In this scheme the select of threshold value that restricts the key diffusion is important since it represents a trade-off between detection power and overhead. A large threshold value increases probability that detect false reports, but it consumes too much energy in the key diffusion phase. In this paper, we proposed adaptive key diffusion restriction method with fuzzy-based framework for DEF. A fuzzy-based system controls the adaptive threshold value of DEF through practical factors. The proposed method can provide energy saving and sufficient resilience against false data injection attacks and show simulation.
Large Eddy Simulation of Combustion on Massively Parallel Machines
Authors: Gabriel Staffelbach, Jean Mathieu Senoner, Laurent Gicquel, Thierry Poinsot
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

Combustion is the source of eighty percent of the energy produced in the world: it is therefore a topic of major interest in the present context of global warming and decreasing fuel resources. Simulating combustors and especially instability mechanisms in these systems has become a central issue in the combustion community in the last ten years. This can be achieved only on massively parallel computers. This paper presents modern techniques to simulate reacting flows in realistic geometries and shows how parallel computing (typically thousands of processors) has made these simulations possible. The physics of reacting flows are only discussed briefly to concentrate on specific issues linked to massively parallel computing, to the turbulent character of the flow and the effects of rounding errors.
Vaidurya: A multiple-ontology, concept-based, context-sensitive clinical-guideline search engine
Authors: Robert Moskovitch, Yuval Shahar
Venue: Journal of Biomedical Informatics (2009)

We designed and implemented a generic search engine (Vaidurya), as part of our Digital clinical-Guideline Library (DeGeL) framework. Two search methods were implemented in addition to full-text search: (1) concept-based search, which relies on pre-indexing the guidelines in a clinically meaningful fashion, and (2) context-sensitive search, which relies on first semi-structuring the guidelines according to a given ontology, then searching for terms within specific labeled text segments. The Vaidurya engine is fully functional and is used within the DeGeL system. We describe the Vaidurya ontological and algorithmic framework; we also briefly summarize the results of a detailed evaluation in the clinical-guideline domain, demonstrating that both concept-based and context-sensitive ontology-independent search are highly feasible and significantly improve on free text search retrieval performance. We conclude by analyzing the limitations and advantages of the approach, and the steps that we have started to take to extend it based on user feedback.
The Matthew System for Creating Virtual Museums
Authors: Alessandro Grimaldi, Tiziana Catarci
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

An easy-to-use visual authoring tool is proposed to help inexperienced users setting up an exhibition satisfying user-defined and structure-deriving constraints. Trials made with potential users yielded some considerations which have been taken as a basis for the tool interface design. A precise definition of the terms museum and visit is also given, and the placement algorithm is sketched.
Mobi-watchdog: you can steal, but you can't run!
Authors: Guanhua Yan, Stephan Eidenbenz, Bo Sun
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

Recent years have witnessed widespread use of mobile devices such as cell phones, laptops, and PDAs. In this paper, we propose an architecture called Mobi-Watchdog to detect mobility anomalies of mobile devices in wireless networks that track their locations regularly. Given the past mobility records of a mobile device, Mobi-Watchdog uses clustering techniques to identify the high-level structure of its mobility and then trains a HHMM (hierarchical hidden Markov model). Mobi-Watchdog raises an alert by requesting the device holder to reauthenticate himself when it finds an observed mobility trace significantly deviates from the trained model. The time complexity of the original generalized Baum-Welch algorithm, which is used for HHMM parameter reestimation, scales linearly with T3, where T is the number of locations in an observed sequence. Such a high computational cost can significantly impede deployment of Mobi-Watchdog in large-scale wireless networks in practice. To achieve better scalability, we modify this algorithm to make it scale linearly with T instead. Experimental results with realistic mobility traces demonstrate that Mobi-Watchdog detects mobility anomalies with high probability and reasonably low false alarm rates. We also show that Mobi-Watchdog has very low computational overhead, which makes it a viable candidate for mobility anomaly detection in large wireless networks.
Reverse k-nearest neighbor search in dynamic and general metric databases
Authors: Elke Achtert, Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Andreas Züfle
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN search, our approach works on top of any hierarchically organized tree-like index structure and, thus, is applicable to any type of data as long as a metric distance function is defined on the data objects. We will exemplarily show how our approach works on top of the most prevalent index structures for Euclidean and metric data, the R-Tree and the M-Tree, respectively. Our solution is applicable for arbitrary values of k and can also be applied in dynamic environments where updates of the database frequently occur. Although being the most general solution for the RkNN problem, our solution outperforms existing methods in terms of query execution times because it exploits different strategies for pruning false drops and identifying true hits as soon as possible.
An algorithm for creation of an optimized adaptive grid for improved explicit finite difference scheme
Authors: Raka Jovanovic, Milan Tuba, Dana Simian
Venue: WSEAS Transactions on Mathematics (2008)

This paper deals with the two main shortcomings of explicit finite difference schemes: the use of a discretization grid with the same resolution over the entire problem space, and low level of precision and stability. We present a combination of two improvements. Their application is illustrated with the numerical simulation of the propagation of a light beam in a photonic lattice. The discretization problem is avoided by using a multi-resolution grid. An algorithm for the grid creation is developed and that algorithm is optimized for software implementation and parallelization. The efficiency of the algorithm is increased by further improving the precision of the explicit method by use of a multidimensional generalization of the Runge-Kutta scheme. Due to the multidimensionality and nonlinearity of the considered problem, our improved explicit finite difference gave better results than Crank-Nicholson scheme.
Machanisms for the maintenance of MP proxy tables in IEEE 802.11s mesh networks
Authors: Shih-Tsung Liang
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

According to the IEEE 802.11s draft standard, a proxy table is maintained in each MP to facilitate the proxy routing of the devices outside of the WLAN Mesh. The proxy table plays a very important role in wireless mesh network, for a "miss" in the search of the proxy table may introduce additional delays when forwarding frames. Current IEEE 802.11s draft standard specifies two basic mechanisms related to the maintenance of MP proxy tables -- the proxy registration procedure and the associated station discovery. In this paper, we propose a simple yet effective scheme for the maintenance of the proxy table. Analytic results show that the proposed scheme outperforms over the two specified in IEEE 802.11s in terms of routing delay, control overhead, proxy table size, and compatibility among stations bridged through a variety of IEEE 802 LANs.
Tracking and identification of regime-switching systems using binary sensors
Authors: G. Yin, Le Yi Wang, Shaobai Kan
Venue: Automatica (Journal of IFAC) (2009)

This work is concerned with tracking and system identification for time-varying parameters. The parameters are Markov chains and the observations are binary valued with noise corruption. To overcome the difficulties due to the limited measurement information, Wonham-type filters are developed first. Then, based on the filters, two popular estimators, namely, mean squares estimator (MSQ) and maximum posterior (MAP) estimator are constructed. For the mean squares estimator, we derive asymptotic normality in the sense of weak convergence and in the sense of strong approximation. The asymptotic normality is then used to derive error bounds. When the Markov chain is infrequently switching, we derive error bounds for MAP estimators. When the Markovian parameters are fast varying, we show that the averaged behavior of the parameter process can be derived from the stationary measure of the Markov chain and that can be estimated using empirical measures. Upper and lower error bounds on estimation errors are also established.
Accessing a data base through a minicomputer
Authors: Charles A. Lupien, R. D. Harrison,  Jr., E. Lowenthal, T. Richley
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Several speakers will address the notion of using small scale computing devices (or minicomputers) and associated data storage units as data base management "machines." These machines communicate with larger host processors to satisfy data handling requests emanating from programs running on the host. This is tantamount to removing the DBMS software from large main frames (e.g., IMS and total) and housing such software in one or more peripheral computers.
PM2.5 concentration prediction using hidden semi-Markov model-based times series data mining
Authors: Ming Dong, Dong Yang, Yan Kuang, David He, Serap Erdal, Donna Kenski
Venue: Expert Systems with Applications: An International Journal (2009)

In this paper, a novel framework and methodology based on hidden semi-Markov models (HSMMs) for high PM"2"."5 concentration value prediction is presented. Due to lack of explicit time structure and its short-term memory of past history, a standard hidden Markov model (HMM) has limited power in modeling the temporal structures of the prediction problems. To overcome the limitations of HMMs in prediction, we develop the HSMMs by adding the temporal structures into the HMMs and use them to predict the concentration levels of PM"2"."5. As a model-driven statistical learning method, HSMM assumes that both data and a mathematical model are available. In contrast to other data-driven statistical prediction models such as neural networks, a mathematical functional mapping between the parameters and the selected input variables can be established in HSMMs. In the proposed framework, states of HSMMs are used to represent the PM"2"."5 concentration levels. The model parameters are estimated through modified forward-backward training algorithm. The re-estimation formulae for model parameters are derived. The trained HSMMs can be used to predict high PM"2"."5 concentration levels. The validation of the proposed framework and methodology is carried out in real world applications: prediction of high PM"2"."5 concentrations at O'Hare airport in Chicago. The results show that the HSMMs provide accurate predictions of high PM"2"."5 concentration levels for the next 24h.
Continuous privacy preserving publishing of data streams
Authors: Bin Zhou, Yi Han, Jian Pei, Bin Jiang, Yufei Tao, Yan Jia
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Recently, privacy preserving data publishing has received a lot of attention in both research and applications. Most of the previous studies, however, focus on static data sets. In this paper, we study an emerging problem of continuous privacy preserving publishing of data streams which cannot be solved by any straightforward extensions of the existing privacy preserving publishing methods on static data. To tackle the problem, we develop a novel approach which considers both the distribution of the data entries to be published and the statistical distribution of the data stream. An extensive performance study using both real data sets and synthetic data sets verifies the effectiveness and the efficiency of our methods.
Local query translation and optimization in a distributed system
Authors: Emmanuel Onuegbe, Said Rahimi, Alan R. Hevner
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

A new query translation and optimization algorithm is presented. The algorithm is being implemented as the local query translation and optimization technique of Honeywell's Distributed Database Testbed System (DDTS). The algorithm translates local queries expressed in representational schemas (relational) to their equivalent internal schemas (network). The technique is new in that it does not translate each relational command in isolation, but rather attempts to find a collection of relational commands for which an optimized sequence of CODASYL DML commands can be generated. The optimization minimizes the number of disk accesses by taking advantage of the access paths available to the CODASYL local database management systems and the relationship information of the variables used in the relational commands.
Using player proximity in mobile multiplayer games: experiences from Sandman
Authors: Janne Lautamäki, Riku Suomela
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

In addition to using Bluetooth as a communication channel, it can be used to discover other devices nearby. In games, such information can be used in many ways, such as to group people or direct player to player interaction for instance. In this paper, we explore the possibility to use social proximity in multiplayer gaming using mobile phones. As an example, we describe Sandman, which is a context-aware game built on the Multi-User Publishing Environment (MUPE) platform. The game is available for mobile phones with an access to the internet, Bluetooth, and Java MIDP 2.0
Partially ordered pattern algebras
Authors: Endre Vámonostory
Venue: Acta Cybernetica (2008)

A partial order $\preceq$ on a set A induces a partition of each power An into "patterns"' in a natural way. An operation on A is called a $\preceq$-pattern operation if its restriction to each pattern is a projection. We examine functional completeness of algebras with $\preceq$-pattern fundamental operations.
Grey Evaluation Method of Knowledge Management Capability
Authors: Wenshan Zheng, Yangcheng Hu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Knowledge management capability (KMC) evaluation is a required work with strategic significance. However it still has not been addressed in the extant literature. KMC evaluation is involved in multi-criteria decision-making problems and the evaluation indexes are characterized with grey, fuzzy and difficult to quantify. Therefore, the objective of this study is to investigate a grey evaluation method for KMC. First, a framework for evaluating KMC is presented, which includes two dimensions and six attributes. Then, the analytic hierarchy process (AHP) and the theory of grey system are introduced in setting up a comprehensive evaluation model. Additionally, an example is used to illustrate the availability of the proposed method. The result shows that grey evaluation which combines advantages of the qualitative and quantitative methods can be applied to evaluate KMC conveniently and scientifically. Meanwhile the evaluation results can help practitioners judge the necessity to improve the KMC and determine which dimension or attribute is the most needed direction to improve.
Assessing the benefits of multimodal feedback on dual-task performance under demanding conditions
Authors: Ju-Hwan Lee, Charles Spence
Venue: Proceedings of the 22nd British HCI Group Annual Conference on HCI 2008: People and Computers XXII: Culture, Creativity, Interaction - Volume 1 (2008)

The last few years have seen the release of an increasing number of new IT-related devices into the marketplace that have started to utilize tactile feedback. These include those devices incorporating a touch screen that make multimodal feedback incorporating the delivery of two or more sensory modalities possible. The commonly-held view is that the use of such multimodal (or multisensory) feedback, involving the presentation of information to two or more sensory modalities ought, if anything, to improve the usability, performance, and satisfaction of the interface. In particular, an especially beneficial effect of multimodal feedback might be expected in those situations that are highly perceptually and/or cognitively demanding, such as driving a car or monitoring a complex system. In the present study, we examined the potential beneficial effect of the multimodal feedback provided by a touch screen on participants' performance in a perceptually demanding dual-task situation. We compared unimodal (visual) feedback with various kinds of multimodal (bimodal and trimodal) feedback. In addition, we also investigated the consequences of varying the intensity and number of multimodal feedback signals that were presented on driver performance (Experiment 2). Overall, the results of the two experiments reported here show that the presentation of multimodal feedback results in enhanced performance and more pronounced benefits as the intensity of the feedback signals presented to the different modalities is increased.
On Reconstruction of RC4 Keys from Internal States
Authors: Shahram Khazaei, Willi Meier
Venue: Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth (2008)

In this work key recovery algorithms from the known internal states of RC4 are investigated. In particular, we propose a bit-by-bit approach to recover the key by starting from LSB's of the key bytes and ending with their MSB's.