ppxscal/embedding_network huggingface dataset:
A simultaneous bus orientation and bused pin flipping algorithm
Authors: Fan Mo, Robert K. Brayton
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

The orientation of a bus is defined as the direction from the Least Significant Bit (LSB) to the Most Significant Bit (MSB). Bused pin flipping is a property that allows several bused pins to flip without changing the system functionality. In this paper a simultaneous bus orientation and bused pin flipping algorithm is presented. The algorithm can be integrated into a bus-centric floorplanner targeting bus-rich designs such as microprocessors. Experimental results show that a floorplanner enhanced by the algorithm produces high quality floorplans in terms of bus routing.
Fuzzy vs. "manual" control in a FeNi plant
Authors: A. Pouliezos, D. Papadimitriou, G. Tselentis
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

In this paper the effect on energy consumption and pollution of fuzzy automatic control of a rotary kiln is investigated. The computer-based fuzzy control system is installed at the Larko ferronickel plant in Larymna, Greece, by the Danish firm F.L. Smidth & Co. A/S. Operation characteristics for the manual operation against automatic control are defined and compared. Preliminary results show substantial energy savings and reduced pollution levels. Payback period for the investment was calculated at approximately 1.2 years.
Grey Neural Network And Its Application In MCMQC
Authors: Shuhai Fan, Tianyuan Xiao, Yexiang Fang, Wenping Li, Linxuan Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

The biggest problem in MCMQC (mass customization manufacturing quality control) is the lack of quality data. It results in the difficulty to predict quality defects. To solve the problem, we can make use of a new theory (the grey theory). In grey theory, grey means the lack of information and the bodies of information are considered as hierarchical, poly-dimensional and time-variant. Based on grey system, we studied the model building methods of it. To simplified the computation, the author also gave out three simplified model building methods (crosswise modeling method, lengthwise modeling method and hybrid modeling method), which can be intimated into model building of neural network. Finally, the author gave out an example for a typical grey BP neural network in which the crosswise modeling method was used and applied to mass customization manufacturing quality control.
Finding Inputs that Reach a Target Expression
Authors: Matthew Naylor, Colin Runciman
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

We present an automated program analysis, called Reach, to compute program inputs that cause evaluation of explicitly-marked target expressions. Reach has a range of applications including property refutation, assertion breaking, program crashing, program covering, program understanding, and the development of customised data generators. Reach is based on lazy narrowing, a symbolic evaluation strategy from functional-logic programming. We use Reach to analyse a range of programs, and find it to be a useful tool with clear performance benefits over a method based on exhaustive input generation. We also explore different methods for bounding the search space, the selective use of breadth-first search to find the first solution quickly, and techniques to avoid evaluation that is unnecesary to reach a target.
OLAP preferences: a research agenda
Authors: Stefano Rizzi
Venue: Proceedings of the ACM tenth international workshop on Data warehousing and OLAP (2007)

Expressing preferences when querying databases is a natural way to avoid empty results and information flooding, and in general to rank results so that the user may first see the data that better match his tastes. In this paper we outline the main research issues to be faced in order to develop a system for handling user preferences on OLAP cubes.
The Analysis of the Optimal Periodic Ranging Slot Number in IEEE 802.16 OFDMA Systems
Authors: Jihua Zhou, Xin Jin, Jiangtao Dong, Jinglin Shi, Zhongcheng Li
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

As part of the IEEE 802.16 protocol, the random access scheme is used for ranging. The ratio between the numbers of periodic ranging slots and data slots in the uplink subframe decides the contention throughput, ranging delay and data throughput, all of which are important parameters of the system performance. However no specific ratio is standardized in the protocol. So, it is necessary to determine the optimal number of periodic ranging slots which is the decisive factor of the ratio. In this paper, the three parameters above are analyzed and the optimal number of the periodic ranging slots is derived. In addition, an estimation method is proposed to predict the number of contention users. The correctness of the analysis is verified by the simulation results, and it is demonstrated that the contention throughput efficiency is high with the derived optimal number.
Forecasting Solar Activity Using Co-evolution of Models and Tests
Authors: M. Mirmomeni, C. Lucas, B. N. Araabi, B. Moshiri
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

The cyclic solar activity has significant effects on earth, climate, satellites and space missions. Several methods have been introduced for the prediction of sunspot number, which is a common measure of solar activity. In this study a co-evolutionary algorithm is presented for inferring the topology and parameters of a multilayered neural network with the minimum of experimentation to the sunspot number time series which will be used as a predictor in predicting such phenomena. The algorithm synthesizes an explicit model directly from the observed data produced by intelligently generated tests. The algorithm is composed of two co-evolving populations; one population evolves candidate neural networks. The second population evolves informative tests that either extract new information from the hidden system or elicit desirable behavior from it. The fitness of candidate neural networks is their ability to explain behavior of the target chaotic system observed in response to all tests carried out so far; the fitness of candidate tests is their ability to make the models disagree in their predictions. The generality of this modeling-evaluation algorithm is demonstrated by applying the chosen model of this algorithm to predict sunspot number and the results depict the power of this training method which yields proper model to predict such chaotic time series.
Embedded test decompressor to reduce the required channels and vector memory of tester for complex processor circuit
Authors: Yinhe Han, Yu Hu, Xiaowei Li, Huawei Li, Anshuman Chandra
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

An embedded test stimulus decompressor is presented for the test patterns decompression, which can reduce the required channels and vector memory of automatic test equipment (ATE) for complex processor circuit. The proposed decompressor mainly consists of a periodically alterable MUX network which has multiple configurations to decode the input information flexibly and efficiently. In order to reduce the number of test patterns and configurations, a test patterns compaction algorithm, using CI-Graph merging, is proposed. With the proposed periodically alterable MUX network and the patterns compaction algorithm, smaller test data volume and required external pins can be achieved as compared to previous techniques.
Exploration of Transformations between Fuzzy and Evolutionary Techniques
Authors: Alvaro Roberto Silvestre Fialho, Fabio Lopes Caversan
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This work addressed a search and validation of transfor- mations between the Fuzzy Computing and the Evolution- ary Computing domains, which are useful for hybrid sys- tems development in which both methodologies skills can be used in a more intrinsic way, transforming fuzzy elements into evolutionary elements and vice-versa. To validate such transformations, an entire fuzzy knowledge base of a mobile robot controller was designed and further tuned through a genetic algorithm, and the results were presented. With the developed approach, it also became possible to add new be- haviors to an existent controller, which can be useful when new situations need to be handled.
Software Product Lines Approach in Enterprise System Development
Authors: Yuzo Ishida
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

Enterprise Software is an untapped area for Software Product Lines (SPL) approach. Our current understanding of enterprise SPL is as follows. The enterprise SPL is based upon an application centric architecture, which manages variability of platform and non-functional requirements, and achieves variability management for functional requirements in an application layer. NRI has been executing this approach through two projects, (I) development of semi made-to-order package software for the retail chains and (II) restructuring of enterprise systems owned by Seven & i Holdings, the biggest conglomerate of retail industry in Japan. This paper mainly describes what application centric architecture is and how this approach differs from others with lessons learned for the last five years.
IDGSC: An Immunity-Based Approach for Dynamic Grid Service Classification
Authors: Qing Li, Zhishu Li, Gang Liang, Jing-yu Zhang, Liang-yin Chen, Baolin Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Service classification is not only an indispensable method for manually browsing and managing service repositories, but can in fact be used for simple but efficient forms of service annotation and semi-automated discovery, complementary aid for automatic selection. In order to classify services in a service taxonomy dynamically, a new service classification model based on immune theory is proposed in this paper. The concepts of "self", "nonself" and "filter" are given first. Then the model is described in detail. Finally, a simulation experiment is performed, and the important parameters of the model are analyzed. The experimental result shows that the new model possess better adaptability and stability.
Dynamic restoration of the unknown function in the linear stochastic differential equation
Authors: V. L. Rozenberg
Venue: Automation and Remote Control (2007)

For the linear stochastic differential equation with diffusion, consideration was given to the problem of restoration of the unknown parameter characterizing the level of noise. Equations of this kind are used, in particular, in the problem of optimal portfolio selection in order to describe the time profile of the asset prices under risk investments. Restoration must be based on the measurements of the current phase state. The problem under study comes to the inverse problem of the ordinary matrix differential equation satisfied by the covariance matrix of the initial random process. The proposed algorithm which is based on a combination of the methods of the theory of improperly posed problems and the theory of positional control with model is constructed in the class of finite-step algorithms counting on computer-aided realization. The algorithm is stable to the errors in information and computations. The algorithm's precision was estimated in terms of the measurable realizations of the initial process.
The United Hospital Fund meeting on evaluating health information exchange
Authors: George Hripcsak, Rainu Kaushal, Kevin B. Johnson, Joan S. Ash, David W. Bates, Rachel Block, Mark E. Frisse, Lisa M. Kern, Janet Marchibroda, J. Marc Overhage, Adam B. Wilcox
Venue: Journal of Biomedical Informatics (2007)

Health information exchange (HIE) projects are sweeping the nation, with hopes that they will lead to high quality, efficient care, yet the literature on their measured benefits remains sparse. To the degree that the field adopts a common set of evaluation strategies, duplicate work can be reduced and meta-analysis will be easier. The United Hospital Fund sponsored a meeting to address HIE evaluation. HIE projects are diverse with many kinds of effects. Assessment of the operation of the HIE infrastructure and of usage should be done for all projects. The immediate business case must be demonstrated for the stakeholders. Rigorous evaluation of the effect on quality may only need to be done for a handful of projects, with simpler process studies elsewhere. Unintended consequences should be monitored. A comprehensive study of return on investment requires an assessment of all effects. Program evaluation across several projects may help set future policy.
Algebraic Approach to Linking the Semantics of Web Services
Authors: Huibiao Zhu, Jifeng He, Jing Li, Jonathan P. Bowen
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

Web Services have become more and more important in these years, and BPEL4WS (BPEL) is a de facto standard for the web service composition and orchestration. It contains several distinct features, including the scope-based compensation and fault handling mechanism. We have considered the operational semantics and denotational semantics for BPEL, where a set of algebraic laws can be achieved via these two models respectively. In this paper, we consider the inverse work, deriving the operational semantics and denotational semantics from algebraic semantics for BPEL. In our model, we introduce four types of typical programs, by which every program can be expressed as the summation of these four types. Based on the algebraic semantics, the strategy for deriving the operational semantics is provided and a transition system is derived by strict proof. This can be considered as the soundness exploration for the operational semantics based on the algebraic semantics. Further, the equivalence between the derivation strategy and the derived transition system is explored, which can be considered as the completeness of the operational semantics. Finally, the derivation of the denotational semantics from algebraic semantics is explored, which can support to reason aboutmore program properties easily.
Model for Parallel Verification of Programs
Authors: He Pei, Kang Lishan, Li Qiongzhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Program verification is a major concern and challenge to our highly computer-dependent societies. Under a closed environment, this paper explores proof reusing and organizing methodology. After making some extension to Hoare's convention, and defining the verification task, we present a model suitable for verifying numerous programs simultaneously.
Situational Secure Web Services Design Methods
Authors: Dhafer Thabet, Lamia Hassine, Henda Ben Ghezala
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Web Services security is a major concern in the web engineering domain. Several approaches emphasizing Secure Web Services Design (SWSD) process have been proposed. However, they provide a little guidance as to what developers should do exactly to conduct this highly intellectual process. SWSD practices cannot be defined independently of the situation in which they are applied. To address this challenge, we propose an approach for guiding the construction and execution of situational SWSD methods by reengineering and integrating different existing SWSD method components suited to the specific situation on hand.
MICSIM - a microprogrammed expression parsing simulator: part II - the simulator
Authors: S. Habib
Venue: ACM SIGMICRO Newsletter (1972)

This section describes the microprogrammed architecture of the translator. This architecture might very well represent a subset of the total computer required to implement the other chores of translation and execution.
A framework to design and solve Markov Decision Well-formed Net models
Authors: M. Beccuti, D. Codetta-Raiteri, G. Franceschinis, Serge Haddad
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

The Markov Decision Process (MDP) [7] formalism is widely used for modeling systems which exhibit both non deterministic and probabilistic behaviors (e.g. distributed systems, resource management systems, : : :). Unfortunately, if the system is particularly complex then its modeling at the MDP level may be very hard; so in [6] a higherlevel formalism called Markov Decision Well-formed Net (MDWN) was proposed.
Synthesizing Component-Based WSN Applications via Automatic Combination of Code Optimization Techniques
Authors: Zhenyu Zhang, W. K. Chan, T. H. Tse
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Wireless sensor network (WSN) applications sense events in-situ and compute results in-network. Their software components should run on platforms with stringent constraints on node resources. Developers often design their programs by trial-and-error with a view to meeting these constraints. Through numerous iterations, they manually measure and estimate how far the programs cannot fulfill the requirements, and make adjustments accordingly. Such manual process is time-consuming and error-prone. Automated support is necessary. Based on an existing task view that treats a WSN application as tasks and models resources as constraints, we propose a new component view that associates components with code optimization techniques and constraints. We develop algorithms to synthesize components running on nodes, fulfilling the constraints, and thus optimizing their quality. We evaluate our proposal by a simulation study adapted from a real-life WSN application. Keywords: Wireless sensor network, adaptive software design, resource constraint, code optimization technique.
A New Approach for Document Indexing UsingWavelet Trees
Authors: Nieves R. Brisaboa, Yolanda Cillero, Antonio Farina, Susana Ladra, Oscar Pedreira
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The development of applications that manage large text collections needs indexing methods which allow efficient retrieval over text. Several indexes have been proposed which try to reach a good trade-off between the space needed to store both the text and the index, and its search efficiency. Self-indexes are becoming more and more popular in the last years. Not only they index the text, but they keep enough information to recover any portion of it without the need of keeping it explicitly. Therefore, they actually replace the text. In this paper, we focus in a self-index known as wavelet tree. Being originally organized as a binary tree, it was designed to index the characters from a text. We present three variants of this method that aim at reducing its size, while keeping a good trade-off between space and performance, as well as making it well-suited for indexing natural language texts. The first approach we describe joins Huffman compression and wavelet trees. The other two new variants index words instead of characters and use two different word-based compressors.
Man-in-the-middle attacks on auto-updating software
Authors: Bjoern M. Luettmann, Adam C. Bender
Venue: Bell Labs Technical Journal (2007)

Many software packages today have the ability to perform automatic selfupdates, typically via the Internet. Updates, in the form of executable files, are downloaded and then run, with the intent of &ldquo;patching&rdquo; an existing application. This presents a new security risk since there is no established standard for a protocol that performs the update process. This often leads developers to use proprietary schemes that have not been vetted for vulnerabilities. In this paper we analyze several software applications that have an auto-update feature. We also present two generic types of man-in-the-middle attacks that can subvert Hypertext Transfer Protocol (HTTP) downloads, which many auto-updating applications use, and show how these attacks can be tailored to exploit specific updating processes. In addition, we review some countermeasures, including Microsoft's Authenticode* technology. &copy; 2007 Alcatel-Lucent.
Study on Social Relations between Individuals Based on Graph Theory
Authors: Jinping Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

A formulated framework of tolerance relation in the applications of social activities is presented. The formulation can not only describe the activity degree of entities in a society, but also the average cost and the maximum cost at which one completes a task through various social relations. The algorithms for computing the maximum tolerance classes, the activity degree, the average cost and the maximum cost are given. Examples show the algorithms are effective. This is a very preliminary formulation, which need further study. Key words: social set theory, tolerance relation, maximum tolerance classes, activity degree, cost
Challenges and Promising Results in NoC Prototyping Using FPGAs
Authors: Umit Y. Ogras, Radu Marculescu, Hyung Gyu Lee, Puru Choudhary, Diana Marculescu, Michael Kaufman, Peter Nelson
Venue: IEEE Micro (2007)

Although a significant amount of theoretical work supports the potential of NoC architectures, such results need to be demonstrated by actual implementations before the NoC paradigm becomes a reality. Besides demonstrating the feasibility of the overall approach, prototyping enables accurate evaluation of power, performance, area, and various design trade-offs. This article presents four NoC prototypes, discusses the challenges associated with their design, and assesses the potential of the NoC approach.
Extracting Relevant Attribute Values for Improved Search
Authors: Sonia Bergamaschi, Claudio Sartori, Francesco Guerra, Mirko Orsini
Venue: IEEE Internet Computing (2007)

A new kind of metadata offers a synthesized view of an attribute's values for a user to exploit when creating or refining a search query in data-integration systems. The extraction technique that obtains these values is automatic and independent of an attribute domain but parameterized with various metrics for similarity measures. The authors describe a fully implemented prototype and some experimental results to show the effectiveness of "relevant values" when searching a knowledge base.
Simultaneous Feature Selection and Classification via Semi-Supervised Models
Authors: Liming Yang, Laisheng Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Feature selecting for semi-supervised support vector machines (S^3 VM) classifiers is a novel and important research subject in machine learning. For this problem, based on the linear semi-supervised support vector machine (S^3 VM) with 1-norm, we propose two new models using all the available data from labeled and unlabeled data and also utilizing as few of the useful features as possible. Furthermore, two proposed learning models for simultaneous feature selection and S^3 VM classification can be converted to the minimization concave function on the polyhedral set and then solved using successive linear approximation algorithms. Experiments on publicly available datasets prove the effective of our models compared with the linear S^3 VM model for 1-norm.