ppxscal/embedding_network huggingface dataset:
Robust fuzzy stabilization of dithered chaotic systems using island-based random optimization algorithm
Authors: Zhi-Ren Tsai, Yau-Zen Chang, Jiing-Dong Hwang, Jye Lee
Venue: Information Sciences: an International Journal (2008)

Applying dither to highly nonlinear systems may suppress chaotic phenomena, but dynamic performance, such as convergence rate and disturbance attenuation, is usually not guaranteed. This paper presents a dithered H"~ robust fuzzy control scheme to stabilize chaotic systems that ensures disturbance attenuation bounds. In the proposed scheme, Takagi-Sugeno (T-S) fuzzy linear models are used to describe the relaxed models of the dithered chaotic system, and fuzzy controllers are designed based on an extension to the concept of parallel distributed compensation (PDC). Sufficient condition for the existence of the H"~ robust fuzzy controllers is presented in terms of a novel linear matrix inequalities (LMI) form which takes full consideration of modeling error and disturbances, but cannot be solved by the standard procedures. In order to solve the LMI problem and to identify the chaotic systems as T-S fuzzy modes, we propose a compound optimization strategy called the island-based random-walk algorithm (IRA). The algorithm is composed of a set of communicating random-walk optimization procedures concatenated with the down-hill simplex method. The design procedure and validity of the proposed scheme is demonstrated via numerical simulation of the dithered fuzzy control of a chaotic system.
Interactive Recognition of Handprinted Characters for Computer Input
Authors: Jean Ward, Barry Blesser
Venue: IEEE Computer Graphics and Applications (1985)

With all the variations found in people's handprinting, can any input device read everything correctly?
Broadcast scheduling in wireless sensor networks using fuzzy Hopfield neural network
Authors: Yu-Ju Shen, Ming-Shi Wang
Venue: Expert Systems with Applications: An International Journal (2008)

In this paper we describe fuzzy Hopfield neural network (FHNN) technique to solve the TDMA (time division multiple access) broadcast scheduling problem in wireless sensor networks (WSN). We formulate it as discrete energy minimization problem and map it into Hopfield neural network with the fuzzy c-means strategy to find the TDMA schedule for nodes in a communication network. The broadcast scheduling problem for wireless sensor networks is an NP-complete problem. Each time slot is regarded as a data sample and every node is taken as a cluster. Time slots are adequately distributed to the dedicated node while satisfying the constraints. The aim is to minimize the TDMA cycle length and maximize the node transmissions avoiding both primary and secondary conflicts. The FHNN reduces the processing time and increases the convergence rate for Broadcast Scheduling Problem. Simulation results show that the FHNN improves performance substantially through solving well-known benchmark problems.
Missile Guidance Law Design Using Nonlinear Output Regulation and T-S Model
Authors: Li-Ying Yuan, Shi-Yong Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

The design of missile guidance law based on output regulation theory and Takagi--Sugeno fuzzy model have been studied. In this design, the guidance problem is converted to the nonlinear regulator problem. The three-dimensional command to line-of-sight guidance problem is formulated as a tracking problem of a time-varying nonlinear system. It is provided the solution in terms linear matrix inequalities allowing the use of numeric techniques in the search of a guidance controller. Simulation results for different engagement scenarios illustrate the validity of the proposed guidance law.
Query processing for high-volume XML message brokering
Authors: Yanlei Diao, Michael Franklin
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

XML filtering solutions developed to date have focused on the matching of documents to large numbers of queries but have not addressed the customization of output needed for emerging distributed information infrastructures. Support for such customization can significantly increase the complexity of the filtering process. In this paper, we show how to leverage an efficient, shared path matching engine to extract the specific XML elements needed to generate customized output in an XML Message Broker. We compare three different approaches that differ in the degree to which they exploit the shared path matching engine. We also present techniques to optimize the post-processing of the path matching engine output, and to enable the sharing of such processing across queries. We evaluate these techniques with a detailed performance study of our implementation.
An Approach to a Real World Dynamic Route Guidance Problem
Authors: Ahmet Yildiz, Canan Yildiz
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Internationally organised large-scaled events often cause an overload of the host city's public transportation network as the number of people who use the network increases immensely within a relative small timespan and their flow is concentrated to one direction in the network. To efficiently and individually route participants to the events' location using public transport we would like to provide each individual with the quickest path on a network whose attributes constantly change over time. In this paper we give a formal description of this problem, review related work, discuss to what extent they can be used to solve the problem efficiently and finally introduce our approach.
Book Review: An Assay of Biochips
Authors: Sachin Sapatnekar
Venue: IEEE Design Test (2007)

This is an integrated review of two related books, Design Automation Methods and Tools for Microfluidics-Based Biochips (edited by Krishnendu Chakrabarty and Jun Zeng) and BioMEMS (edited by Gerald A. Urban). Both books include contributions from several authors on topics related to their areas of expertise. Together, they provide a good introduction to the field of biochips. All in all, both books are well written and constitute excellent sources for a first, or second, look at this field.
Swing-Up Control of Double Inverted Pendulum Based on Adaptive Neuro-fuzzy Inference System
Authors: Jianshi Yao, Yueting Chai
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Neuro-fuzzy controller based on Adaptive Neuro-Fuzzy Inference System (ANFIS) is proposed for swinging up a double pendulum from its hanging position to the inverted position. The controller is designed through two stages. In learning stage, the controller, which is an inverse mapping model from state variable to controlled quantity, is con- structed off-line. While in control stage, control output is derived from the built model. To obtain training samples for inverse mapping model, hybrid genetic algorithms are ap- plied to optimize computation of state variables and control law during the swing-up. Simulation results showed the ef- fectiveness of the controller and the theoretical discussions.
Adaptive sampling for geometric problems over data streams
Authors: John Hershberger, Subhash Suri
Venue: Computational Geometry: Theory and Applications (2008)

Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefield simulations, scientific measurements of earth or atmospheric phenomena, etc. This paper focuses on the problem of summarizing such geometric data streams using limited storage so that many natural geometric queries can be answered faithfully. Some examples of such queries are: report the smallest convex region in which a chemical leak has been sensed, or track the diameter of the dataset, or track the extent of the dataset in any given direction. One can also pose queries over multiple streams: for instance, track the minimum distance between the convex hulls of two data streams, report when datasets A and B are no longer linearly separable, or report when points of data stream A become completely surrounded by points of data stream B, etc. These queries are easily extended to more than two streams. In this paper, we propose an adaptive sampling scheme that gives provably optimal error bounds for extremal problems of this nature. All our results follow from a single technique for computing the approximate convex hull of a point stream in a single pass. Our main result is this: given a stream of two-dimensional points and an integer r, we can maintain an adaptive sample of at most 2r+1 points such that the distance between the true convex hull and the convex hull of the sample points is O(D/r^2), where D is the diameter of the sample set. The amortized time for processing each point in the stream is O(logr). Using the sample convex hull, all the queries mentioned above can be answered approximately in either O(logr) or O(r) time.
Improving performance with bulk-inserts in Oracle R-trees
Authors: Ning An, Ravi Kanth, V. Kothuri, Siva Ravada
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Spatial indexes play a major role in fast access to spatial and location data. Most commercial applications insert new data in bulk: in batches or arrays. In this paper, we propose a novel bulk insertion technique for R-Trees that is fast and does not compromise on the quality of the resulting index. We present our experiences with incorporating the proposed bulk insertion strategies into Oracle 10i. Experiments with real datasets show that our bulk insertion strategy improves performance of insert operations by 50%-90%.
Assessing the Quality Impact of Design Inspections
Authors: Christopher Ackermann, Forrest Shull, Ralf Carbon, Christian Denger, Mikael Lindvall
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Inspections are widely used and studies have found them to be effective in uncovering defects. However, there is less data available regarding the impact of inspections on different defect types and almost no data quantifying the link between inspections and desired end product qualities. This paper addresses this issue by investigating whether design inspection checklists can be tailored so as to effectively target certain defect types without impairing the overall defect detection rate. The results show that the design inspection approach used here does uncover useful design quality issues and that the checklists can be effectively tailored for some types of defects.
An Effective Approach for the Diagnosis of Transition-Delay Faults in SoCs, based on SBST and Scan Chains
Authors: J. Lagos-Benites, D. Appello, P. Bernardi, M. Grosso, D. Ravotto, E. Sanchez, M. Sonza Reorda
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

In this paper, a Software-Based Diagnosis (SBD) procedure suitable for SoCs is proposed to tackle the diagnosis of transition-delay faults. The illustrated methodology takes advantage of an initial Software-Based Self-Test (SBST) test set and of the scan-chains included in the final SoC design release. In principle, the proposed methodology consists in partitioning the considered SBST test set in several slices, and then proceeding to the evaluation of the diagnostic ability owned by each slice with the aim of discarding diagnosis-ineffective test programs portions. The proposed methodology is aimed to provide precise feedback to the failure analysis process focusing the systematic timing failures characteristic of new technologies. Experimental results show the effectiveness and feasibility of the proposed approach on a suitable SoC test vehicle including an 8-bit microcontroller, 4 SRAM memories and an arithmetic core, manufactured by STMicroelectronics, whose purpose is to provide precise information to the failure analysis process. The reached diagnostic resolution is up to the 99.75%, compared to the 93.14% guaranteed by the original SBST procedure.
Towards Light-weight Semantic Descriptions for Decentralized Service-oriented Systems
Authors: Heiko Pfeffer, David Linner, Carsten Jacob, Ilja Radusch, Stephan Steglich
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Service Oriented Computing has significantly changed the style of designing software for distributed communication systems. However, the promise to loosen the dependencies of application components to allow the usage of any functionally equivalent services was only kept in part. The emergence of expressive semantic descriptions of services, the consequent adaptation of service matching, and the introduction of autonomic service composition concepts meant a real step towards openness and reusability. Semantic markup languages describing service interfaces, characteristics, and functionality, paired with inference and advanced querying methods facilitated situation-aware service adaptation and rapid service creation. However, most of today's solutions for the semantic enhancement of service architectures are tied to specific application domains and do crucially increase the development complexity. For this reason, our work indicates approaches aiming at light-weight semantic service descriptions, their autonomous creation, and adaptation. Moreover, simplified service descriptions address a broader range of computing devices, including those with limited physical capabilities, e.g., regarding their available processing power and memory capacity. Finally, we address decentralized methods for the progressive creation and adaptation of service descriptions utilizing novel interaction models.
Accuracy vs. Lifetime: Linear Sketches for Aggregate Queries in Sensor Networks
Authors: Vasundhara Puttagunta, Konstantinos Kalpakis
Venue: Algorithmica (2007)

The in&#x2013;network aggregation paradigm in sensor networks provides a versatile approach for evaluating aggregate queries. Traditional approaches need a separate aggregate to be computed and communicated for each query and hence do not scale well with the number of queries. Since approximate query results are sufficient for many applications, we use an alternate approach based on summary data&#x2013;structures. We consider two kinds of aggregate queries: location range queries that compute the sum of values reported by sensors in a given location range, and value range queries that compute the number of sensors that report values in a given range. We construct summary data&#x2013;structures called linear sketches, over the sensor data using in&#x2013;network aggregation and use them to answer aggregate queries in an approximate manner at the base&#x2013;station. There is a trade&#x2013;off between accuracy of the query results and lifetime of the sensor network that can be exploited to achieve increased lifetimes for a small loss in accuracy. Most commonly occurring sets of range queries are highly correlated and display rich algebraic structure. Our approach takes full advantage of this by constructing linear sketches that depend on queries. Experimental results show that linear sketching achieves significant improvements in lifetime of sensor networks for only a small loss in accuracy of the queries. Further, our approach achieves more accurate query results than the other classical techniques using Discrete Fourier Transform and Discrete Wavelet Transform.
An Improved Genetic Algorithm with Limited Iteration for Grid Scheduling
Authors: Hao Yin, Huilin Wu, Jiliu Zhou
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

In Grid environment the numbers of resources and tasks to be scheduled are usually variable. This kind of characteristics of grid makes the scheduling approach a complex optimization problem. Genetic algorithm (GA) has been widely used to solve these difficult NPcomplete problems. However the conventional GA is too slow to be used in a realistic scheduling due to its time-consuming iteration. This paper presents an improved genetic algorithm for scheduling independent tasks in grid environment, which can increase search efficiency with limited number of iteration by improving the evolutionary process while meeting a feasible result.
Research on Interaction Control Model of Artificial Fish in Virtual Environment
Authors: Xiangsong Meng, Xiaojua Ban, Shujun Zhang, Daoping Jiang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Artificial fish has attracted significant attention from researchers on artificial life. Previous studies have shown great progress on its perception, decision-making, self-learning and breeding models. However, little focus has been put on the interaction between artificial fish and the animator. This paper proposes a multi-tier interaction control model of artificial fish through integration of virtual reality technology and Markov sequence. Formalized description of interaction model between artificial fish and the virtual marine world and that of the artificial fish and the animator are given in order to build a more realistic marine ecosystem inhabited by artificial fish.
A stage model of knowledge management: an empirical investigation of process and effectiveness
Authors: Hsiu-Fen Lin
Venue: Journal of Information Science (2007)

Knowledge management (KM) is now widely recognized to be important to the success or failure of business management. Seeking to better understand the determinants of the evolution of KM, this study focuses on two main problems: (1) whether firms change their KM processes over time to improve KM effectiveness as well as develop their KM practices, and (2) whether socio-technical support results in more mature KM practices. This study draws on the previous literature to identify key dimensions of KM process (knowledge acquisition, knowledge conversion, knowledge application and knowledge protection), KM effectiveness (individual-level and organizational-level KM effectiveness) and socio-technical support (organizational support and information technology diffusion). The evolution of these dimensions is studied in the form of a stage model of KM that includes initiation, development, and mature stages. Data gathered from 141 senior executives in large Taiwanese organizations were employed to test the propositions. The results show that different stages of KM evolution can be distinguished across dimensions of KM process, KM effectiveness, and socio-technical support. Implications for organizations are also discussed.
Using Interactive Graphics for Fitting Surfaces to Scattered Data
Authors: Laura Bacchelli-Montefusco, Giulio Casciola
Venue: IEEE Computer Graphics and Applications (1984)

Robust software for reconstructing a surface from scattered data has been implemented in an interactive system with graphical facilities and with highly modular machine-independent structure.
Implementation of a Generalized Critical Region Construct
Authors: W. S. Ford
Venue: IEEE Transactions on Software Engineering (1978)

The critical region construct can be usefully extended by adding region entry conditions and replacing the mutual exclusion restriction by a more general restriction. This paper discusses an extended construct of this nature, and presents an implementation approach based on Dijkstra's secretary process concept, with the code for the secretary process generated automatically during program compilation. This type of implementation can produce efficient solutions to many complex synchronization problems. It is also applicable in a wide range of hardware/software environments, including many existing systems. The use of the construct is demonstrated by a number of programming examples.
On the infeasibility of modeling polymorphic shellcode
Authors: Yingbo Song, Michael E. Locasto, Angelos Stavrou, Angelos D. Keromytis, Salvatore J. Stolfo
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

Polymorphic malcode remains a troubling threat. The ability formal code to automatically transform into semantically equivalent variants frustrates attempts to rapidly construct a single, simple, easily verifiable representation. We present a quantitative analysis of the strengths and limitations of shellcode polymorphism and consider its impact on current intrusion detection practice. We focus on the nature of shellcode decoding routines. The empirical evidence we gather helps show that modeling the class of self-modifying code is likely intractable by known methods, including both statistical constructs and string signatures. In addition, we develop and present measures that provide insight into the capabilities, strengths, and weaknesses of polymorphic engines. In order to explore countermeasures to future polymorphic threats, we show how to improve polymorphic techniques and create a proof-of-concept engine expressing these improvements. Our results indicate that the class of polymorphic behavior is too greatly spread and varied to model effectively. Our analysis also supplies a novel way to understand the limitations of current signature-based techniques. We conclude that modeling normal content is ultimately a more promising defense mechanism than modeling malicious or abnormal content.
Optimal Load Balancing in a Multiple Processor System with Many Job Classes
Authors: L. M. Ni
Venue: IEEE Transactions on Software Engineering (1985)

A loosely coupled multiprocessor system contains multiple processors which have their own local memories. To balance the load among multiple processors is of fundamental importance in enhancing the performance of such a multiple processor system. Probabilistic load balancing in a heterogeneous multiple processor system with many job classes is considered in this study. The load balancing scheme is formulated as a nonlinear programming problem with linear constraints. An optimal probabilistic load balancing algorithm is proposed to solve this nonlinear programming problem. The proposed load balancing method is proven globally optimum in the sense that it results in a minimum overall average job response time on a probabilistic basis.
Visualising concordance
Authors: Gaj Vidmar, Nino Rode
Venue: Computational Statistics (2007)

Concordance describes the agreement between m rankings of k objects. Despite the long history of measures of concordance and the recently revived interest in comparison of concordance (c.f. Legendre in J Agric Biol Environ Stat 10(2):226---245, 2005), the task of visualising concordance remained virtually unaddressed. We first show how to depict concordance by simply plotting raw data in parallel coordinates. Then we review further possibilities for depicting concordance using the recently developed plots of inter-rater variability in ordinal ratings (Nelson and Pepe in Stat Methods Med Res 9:475---496, 2000) and plots of correlation matrices (Trosset in J Comput Graph Stat 14(1):1---19, 2005). Next, we propose two novel concordance plots. The concordance bubble-plot is based on raw rank data, while the pin-cushion plot depicts rank differences in polar coordinates. We present visualisations of artificial and real-life datasets with different degree of concordance and identify strong and weak points of the proposed plots. In conclusion, we review some other work related to visualisation of concordance and discuss some other options for constructing novel concordance plots.