ppxscal/embedding_network huggingface dataset:
A tale of two languages
Authors: Daniel Bartholomew
Venue: Linux Journal (2008)

Not all programming languages are created for automating spreadsheets and device drivers' some, like Inform 6 and 7, were created specifically for making games.
A Speech Based Algorithm for Watermarking Relational Databases
Authors: Haiqing Wang, Xinchun Cui, Zaihui Cao
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

This paper studies a novel scheme of watermarking relational databases for copyright protection. Speech signal is introduced as watermark to be embedded into the relations; associated novel watermark insertion algorithm and detection algorithm are proposed. Thus, the watermark signal in this method is expected to be more meaningful and has closer correlative to the copyright holder. Experimental results verify that the proposed method is feasible, effective and robust.
Integrated Coverage and Connectivity in Wireless Sensor Networks: A Two-Dimensional Percolation Problem
Authors: Habib M. Ammari, Sajal K. Das
Venue: IEEE Transactions on Computers (2008)

Abstract: While sensing coverage reflects the surveillance quality provided by a wireless sensor network (WSN), network connectivity enables data gathered by sensors to reach a central node, called the sink. Given an initially uncovered field and as more and more sensors are continuously added to a WSN, the size of partial covered areas increases. At some point, the situation abruptly changes from small fragmented covered areas to a single large covered area. We call this abrupt change as the sensing-coverage phase transition (SCPT). Also, given an originally disconnected WSN and as more and more sensors are added, the number of connected components changes such that the WSN suddenly becomes connected at some point. We call this sudden change as the network-connectivity phase transition (NCPT). The nature of such phase transitions is a central topic in percolation theory of Boolean models. In this paper, we propose a probabilistic approach to compute the covered area fraction at critical percolation for both of the SCPT and NCPT problems. Because sensing coverage and network connectivity are not totally orthogonal, we also propose a model for percolation in WSNs, called correlated disk model, which provides a basis for solving the SCPT and NCPT problems together.
Discrete Spherical Harmonic Transforms: Numerical Preconditioning and Optimization
Authors: J. A. Blais
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

Spherical Harmonic Transforms (SHTs) which are essentially Fourier transforms on the sphere are critical in global geopotential and related applications. Among the best known strategies for discrete SHTs are Chebychev quadratures and least squares. The numerical evaluation of the Legendre functions are especially challenging for very high degrees and orders which are required for advanced geocomputations. The computational aspects of SHTs and their inverses using both quadrature and least-squares estimation methods are discussed with special emphasis on numerical preconditioning that guarantees reliable results for degrees and orders up to 3800 in REAL*8 or double precision arithmetic. These numerical results of spherical harmonic synthesis and analysis using simulated spectral coefficients are new and especially important for a number of geodetic, geophysical and related applications with ground resolutions approaching 5 km.
Testing for crosstalk- and bridge-induced delay faults
Authors: Sandeep Gupta, Melvin Breuer
Venue:  (2007)

Process technology advancements are increasing coupling capacitance values and the resulting crosstalk-induced delay. As a result, noise and timing margins are decreasing and circuits' susceptibility to defects is increasing. The population of defects is also changing and the influence of fluctuations of process parameters during manufacturing is becoming more and more important due to process technology advancements. Due to the above mentioned reasons, crosstalk-induced delay must not only be considered in timing verification but it must also be considered in post-fabrication testing together with realistic populations of manufacturing imperfections and process variations. This dissertation focuses on testing for crosstalk-induced delay faults in the presence of delay faults caused by defects and process variations. Furthermore, with bridges being the predominant type of manufacturing defects in new technologies, this dissertation also focuses on testing for bridge-induced delay faults in the presence of other delay faults. In the presence of delay faults at unknown locations and of unknown sizes, nominal timing information is not valid. We present timing-independent approaches for testing for crosstalk- and bridge-induced delay faults. Using these approaches, under certain circumstances, tests are generated that guarantee testing for crosstalk- or bridge-induced delay faults. No existing approach generates tests that can provide such a guarantee. Certain assumptions about the nature of defects and process variations and the resulting delay faults can be exploited in the test methodology that result in higher coverage of crosstalk or bridge sites and also lower test generation and test application costs. These assumptions and their ramifications are also discussed.
Sufficient Conditions for Zeno Behavior in Lagrangian Hybrid Systems
Authors: Andrew Lamperski, Aaron D. Ames
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

This paper presents easily verifiable sufficient conditions for the existence of Zeno behavior in Lagrangian hybrid systems, i.e., hybrid systems modeling mechanical systems undergoing impacts.
Distributed Cross-Modal Search within the MPEG Query Format
Authors: Matthias Gruhne, Peter Dunker, Mario Döller, Ruben Tous
Venue: Proceedings of the 2008 Ninth International Workshop on Image Analysis for Multimedia Interactive Services (2008)

One of the latest developments of the MPEG committee is the Query Format for search and retrieval of multimedia content. This language constitutes the interface between a client and a search engine for searching multimedia data. Another possible scenario is the use of a service provider, which accepts and understands a query from a client and forwards parts of the query to one or more specific databases. Furthermore the service provider is able to retrieve the reply from these databases and postprocesses this result in order to send it to this client. During the last years, the cross-modal search of video and audio signals became more and more important, since using both, the video and the audio signal together turned out to be much more robust for identification of video streams, than the image part of the video alone.This paper describes a cross-modal search based on the MPEG Query Format, using a service provider for splitting and aggregating the query and two different types of databases.
Helping System Users to Be Smarter by Representing Logic in Transaction Frame Diagrams
Authors: David Cox, Simon Polovina
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

We identify a lucid way of conveying complex information to users in a highly visual, easy to follow form. As explanation, we describe several ideas about system user instructions. Several key ideas are clarified using diagrams. A direction for exploration is offered, with the view that ICCS conferees will be aware of a simple, diagrammatic way to explain use of systems dealing with very complex real world problems.
A Novel Cross Layer Power Control Game Algorithm Based on Neural Fuzzy Connection Admission Controller in Cellular Ad Hoc Networks
Authors: Yong Wang, Dong-Feng Yuan, Ying-Ji Zhong
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

The special scenario of the topology in the cellular Ad Hoc networks was analyzed and a novel cross layer power control game algorithm based on Neural Fuzzy Connection Admission Controller (NFCAC) was proposed in this paper. NFCAC has been successfully applied in the control-related problems of neural networks. However, there is no discussion about the power control game algorithm and location recognition based on NFCAC in cellular Ad Hoc networks. The proposed algorithm integrated the attributes both of NFCAC and the topology space in special scenario. The topology and the power consumption of each node can all be optimized due to the minimum link occupation with the help of the algorithm. Simulation results show that the novel algorithm can give more power control guarantee to cellular Ad Hoc networks in the variable node loads and transmitting powers, and make the node more stable to support multi-hops at the same time.
Evaluating the Impact of Information Distortion on Normalized Compression Distance
Authors: Ana Granados, Manuel Cebrián, David Camacho, Francisco B. Rodríguez
Venue: Proceedings of the 2nd international Castle meeting on Coding Theory and Applications (2008)

In this paper we apply different techniques of information distortion on a set of classical books written in English. We study the impact that these distortions have upon the Kolmogorov complexity and the clustering by compression technique (the latter based on Normalized Compression Distance, NCD). We show how to decrease the complexity of the considered books introducing several modifications in them. We measure how the information contained in each book is maintained using a clustering error measure. We find experimentally that the best way to keep the clustering error is by means of modifications in the most frequent words. We explain the details of these information distortions and we compare with other kinds of modifications like random word distortions and unfrequent word distortions. Finally, some phenomenological explanations from the different empirical results that have been carried out are presented.
Failure Analysis for Domain Knowledge Acquisition in a Knowledge-Intensive CBR System
Authors: Amélie Cordier, Béatrice Fuchs, Jean Lieber, Alain Mille
Venue: Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2007)

A knowledge-intensive case-based reasoning system has profit of the domain knowledge, together with the case base. Therefore, acquiring new pieces of domain knowledge should improve the accuracy of such a system. This paper presents an approach for knowledge acquisition based on some failures of the system. The cbr system is assumed to produce solutions that are consistent with the domain knowledge but that may be inconsistent with the expert knowledge, and this inconsistency constitutes a failure. Thanks to an interactive analysis of this failure, some knowledge is acquired that contributes to fill the gap from the system knowledge to the expert knowledge. Another type of failures occurs when the solution produced by the system is only partial: some additional pieces of information are required to use it. Once again, an interaction with the expert involves the acquisition of new knowledge. This approach has been implemented in a prototype, called FrakaS, and tested in the application domain of breast cancer treatment decision support.
Using Geographic Signatures as Query and Document Scopes in Geographic IR
Authors: Nuno Cardoso, David Cruz, Marcirio Chaves, Mário J. Silva
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper reports the participation of the University of Lisbon at the 2007 GeoCLEF task. We adopted a novel approach for GIR, focused on handling geographic features and feature types on both queries and documents, generating signatures with multiple geographic concepts as a scope of interest. We experimented new query expansion and text mining strategies, relevance feedback approaches and ranking metrics.
Inter-organizational relationships and the flow of information through value chains
Authors: Jong-min Choe
Venue: Information and Management (2008)

I developed a framework that can identify types of inter-organizational relationships. Various kinds of information exchanged between trading partners were grouped into two broad types: transactional and managerial. I then examined the effects of inter-organizational information systems (IOS) and traditional communication media (TCM) on the amount of information exchanged. Stepwise regression analyses showed that the use of value chains was the most significant factor influencing the exchange of both types of information. In examining the impact of the information exchanged to improve production performance, it appeared that different kinds of information influenced different aspects. Depending on the usage level of the media and the types of information exchanged, four categories of inter-organizational relationships and their particular characteristics were defined: traditional links for coordination, strategic alliances, electronic links for coordination, and virtual organizations.
GA-Driven Fuzzy Set-Based Polynomial Neural Networks with Information Granules for Multi-variable Software Process
Authors: Seok-Beom Roh, Sung-Kwun Oh, Tae-Chon Ahn
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

In this paper, we investigate a GA-driven fuzzy-neural networks---Fuzzy Set---based Polynomial Neural Networks (FSPNN) with information granules for the software engineering field where the dimension of dataset is high. Fuzzy Set---based Polynomial Neural Networks (FSPNN) are based on a fuzzy set-based polynomial neuron (FSPN) whose fuzzy rules include the information granules obtained through Information Granulation. The information Granules are capable of representing the specific characteristic of the system. We have developed a design methodology (genetic optimization using real number type gene Genetic Algorithms) to find the optimal structures for fuzzy-neural networks which are the number of input variables, the order of the polynomial, the number of membership functions, and a collection of the specific subset of input variables. The augmented and genetically developed FSPNN (gFSPNN) with aids of information granules results in being structurally optimized and information granules obtained by information granulation are able to help a GA-driven FSPNN showing good approximation on the field of software engineering. The GA-based design procedure being applied at each layer of FSPNN leads to the selection of the most suitable nodes (or FSPNs) available within the FSPNN. Real number genetic algorithms are capable of reducing the solution space more than conventional genetic algorithms with binary genetype chromosomes. The performance of GA-driven FSPNN (gFSPNN) with aid of real number genetic algorithms is quantified through experimentation where we use a Boston housing data.
Crosstalk and Signalling Pathway Complexity - A Case Study on Synthetic Models
Authors: Zheng Rong Yang
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

Crosstalk between signalling pathways have been intensively studied in wet laboratory experiments. More and more experimental evidences show that crosstalk is a very important component for maintaining biology systems robustness. In wet laboratory experiments, crosstalk are normally predicted by applying specific stimulus, i.e., various extra-cellular cues or individual gene suppressors or protein inhibitors. If significant difference between a control group without a specific stimulus and an experimental group with a specific stimulus is found, crosstalk is predicted. In terms of time complexity and cost, such experiments are commonly limited to small scales by using very few sampling time points. At the same time, few mathematical models have been proposed to analyse or predict crosstalk. This work investigates how crosstalk affects signalling pathway complexity and if such effect is significant for discrimination purpose, hence providing evidence for crosstalk prediction. Two crosstalk activities (positive and negative) based on simple synthetic transcription models are used for study. The study has found that crosstalk can change the steady-state gene expression order, hence making signalling pathway complex. The finding indicates that crosstalk is predictable using computer programs in top-down systems biology research.
The PWM Servo and LQR Control of a Dual-Wheel Upright Self-Balancing Robot
Authors: Xiaogang Ruan, Jianwei Zhao
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

The servo control system is designed with TMS320F2812 DSP chip as its core. It solves the problem of the generating of PWM signals, motor velocity feedback and direction and the feedback of the motor current in the servo control system. The structure and mathematical modeling of a dual-wheel upright self-balancing robot are studied. The real experiments are done. The right and left wheels are driven separately by two high precision Direct Current (DC) servo motors with photoelectric encoder. Direct current servo control system of Pulse Width Modulation (PWM) is based on the application of pulse width modulation DC-DC converters. Based on the construction of the structure model for the system, the systematic mathematical model is worked out according to the dynamic mechanics theory. The state feedback controller (LQR) with good robustness is designed on Matlab. The stability of the system is proved by simulation results. The human-like robot can realize all kinds of walking control. Validity and rationality of the system modeling and the controller designing are verified through the performance experiments of the prototype.
Towards Mathematical Knowledge Management for Electrical Engineering
Authors: Agnieszka Rowinska-Schwarzweller, Christoph Schwarzweller
Venue: Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference (2007)

We explore mathematical knowledge in the field of electrical engineering and claim that electrical engineering is a suitable area of application for mathematical knowledge management: We show that mathematical knowledge arising in electrical engineering can be successfully handled by existing MKM systems, namely by the Mizar system. To this end we consider in this paper network theory and in particular stability of networks. As an example for mathematical knowledge in electrical engineering we present a Mizar formalization of Schur's theorem. Schur's theorem provides a recursive, easy method to check for BIBO-stability of networks.
Throughput Maximization with Traffic Profile in Wireless Mesh Network
Authors: Hejiao Huang, Yun Peng
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

Wireless mesh networks (WMNs) are becoming increasingly common for applications, according to its multi-radio and multi-channel advantage over their counterpart, wireless LANs. In WMNs, multiple simultaneous communications over multi-radios using orthogonal channels further improve traffic throughput. Certainly, effective routing and channel assignment are critical, at the same time. Recently, a number of profile-based routing algorithms have emerged, using multi-commodity network flow. Traffic profile used in them records the QoS requirements. But expectant bandwidth requirements may not be assured in wireless condition. Hence, in this paper, we demonstrate a scheme to compute the maximal possible guaranteed bandwidth. Our evaluation demonstrates that our algorithm performs much better than the famous Shortest Path Routing algorithm in routing traffic profile on Grid networks.
Multi-scale Simulations of Gas Flows with Unified Flow Solver
Authors: V. V. Aristov, A. A. Frolova, S. A. Zabelok, V. I. Kolobov, R. R. Arslanbekov
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

The Boltzmann kinetic equation links micro- and macroscale descriptions of gases. This paper describes multi-scale simulations of gas flows using a Unified Flow Solver (UFS) based on the Boltzmann equation. A direct Boltzmann solver is used for microscopic simulations of the rarefied parts of the flows, whereas kinetic CFD solvers are used for the continuum parts of the flows. The UFS employs an adaptive mesh and algorithm refinement procedure for automatic decomposition of computational domain into kinetic and continuum parts. The paper presents examples of flow problems for different Knudsen and Mach numbers and describes future directions for the development of UFS technology.
Next-Generation Multimedia Database Retrieval
Authors: Jaime Gomez, Jose Luis Vicedo
Venue: IEEE MultiMedia (2007)

The authors review a book that offers a human-centered approach on next-generation multimedia database retrieval.
Sequential Automatic Algebras
Authors: Michael Brough, Bakhadyr Khoussainov, Peter Nelson
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

A sequential automatic algebra is a structure of the type (A; f 1,..., f n ), where A is recognised by a finite automaton, and functions f 1, ..., f n are total operations on A that are computed by input-output automata. Our input-output automata are variations of Mealy automata. We study some of the fundamental properties of these algebras and provide many examples. We give classification results for certain classes of groups, Boolean algebras, and linear orders. We also introduce different classes of sequential automatic algebras and give separating examples. We investigate linear orders considered as sequential automatic algebras. Finally, we outline some of the basic properties of sequential automatic unary algebras.
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Authors: Animesh Pathak, Viktor K. Prasanna
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an energy-efficient initial placement of these tasks onto the nodes of the target network poses a set of interesting problems. We present a framework to model this task-mapping problem arising in WSN macroprogramming. Our model can capture task placement constraints, and supports easy specification of energy-based optimization goals. Using our framework, we provide mathematical formulations for the task-mapping problem for two different metrics -- energy balance and total energy spent. Due to the complex nature of the problems, these formulations are not linear. We provide linearization heuristics for the same, resulting in mixed-integer programming (MIP) formulations. We also provide efficient heuristics for the above. Our experiments show that the our heuristics give the same results as the MIP for real-world sensor network macroprograms, and show a speedup of up to several orders of magnitude.
Biochemical Reactions as Computations
Authors: Andrzej Ehrenfeucht, Grzegorz Rozenberg
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

Two main mechanisms behind the functioning of biochemical reactions are facilitation and inhibition; these mechanisms are also central for the interaction between biochemical reactions. This observation underlies the theory of reaction systems which is a formal framework for the investigation of biochemical reactions, and especially interactions between them.