ppxscal/embedding_network huggingface dataset:
Languages not recognizable in real time by one-dimensional cellular automata
Authors: Katsuhiko Nakamura
Venue: Journal of Computer and System Sciences (2008)

This paper discusses real-time language recognition by one-dimensional cellular automata (CA), focusing on limitations of the parallel recognition power. We investigate language recognition of strings containing binary representations B(|w|) of their own lengths. It is shown that:(1)The language L"X={w@?{0,1}^+:w contains the binary number(s) B(|w|)} is recognizable by CA in linear time, but is not recognizable in real time; and (2)The class of languages that are recognizable by CA in real time is not closed under concatenation and not closed under reversal. These results are solutions to the problems posed by Smith III in [A.R. Smith III, Real-time language recognition by one-dimensional cellular automata, J. Comput. System Sci. 6 (1972) 233-253].
Control of Distributed Processes
Authors: H. S. Stone
Venue: Computer (1978)

Cost-effective control of distributed computing systems requires practical models for reassigning program modules among the processors in real time.
Does the Answer to eGovernment Lie in Intermunicipal Collaboration? An Exploratory Italian Case Study
Authors: Maddalena Sorrentino, Enrico Ferro
Venue: Proceedings of the 7th international conference on Electronic Government (2008)

The paper analyses Italy's recent attempt to build new intermunicipal structures to support eGovernment development also in peripheral areas of the country. Preliminary findings for an individual region (the Piedmont Region) show that intermunicipal collaborations can facilitate the coordination of interdependent subjects, rationalize existing resources (e.g. through the use of application software solutions), and prevent the dispersal of government funds. At the same time, the new intermunicipal structures alone do not seem to have the authority needed to ensure that the decisions made by the technical round table participants will automatically translate into a concrete and binding commitment for all the municipalities potentially involved. The paper seeks to use the analytical frameworks offered by organization science to interpret the effects of collaborative arrangements on eGovernment implementation.
Towards Case-Based Support for e-Science Workflow Generation by Mining Provenance
Authors: David Leake, Joseph Kendall-Morwick
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

e-Science brings large-scale computation to bear on scientific problems, often by performing sequences of computational tasks organized into workflows and executed on distributed Web resources. Sophisticated AI tools have been developed to apply knowledge-rich methods to compose scientific workflows by generative planning, but the required knowledge can be difficult to acquire. Current work by the cyberinfrastructure community aims to routinely capture provenance during workflow execution, which would provide a new experience-based knowledge source for workflow generation: large-scale databases of workflow execution traces. This paper proposes exploiting these databases with a "knowledge light" approach to reuse, applying CBR methods to those traces to support scientists' workflow generation process. This paper introduces e-Science workflows as a CBR domain, sketches key technical issues, and illustrates directions towards addressing these issues through ongoing research on Phala, a system which supports workflow generation by aiding re-use of portions of prior workflows. The paper uses workflow data collected by the myGrid and myExperiment projects in experiments which suggest that Phala's methods have promise for assisting workflow composition in the context of scientific experimentation.
Performance evaluation of virtual machine-based Grid workflow system
Authors: Lizhe Wang, Marcel Kunze, Jie Tao
Venue: Concurrency and Computation: Practice Experience (2008)

Grid computing has now become the de facto standard for distributed computing and provides huge computing resources for high-performance scientific and engineering applications. Recent advantages of virtual computing technologies make it possible to efficiently employ computing resources on-demand. Distributed virtual machines (VMs) can help to build scalable, manageable and efficient Grid infrastructures. This paper is engaged to organize compact muon solenoid applications in virtual data system workflows and execute them on VMs in computational Grids. The work is implemented on VMware VMs. Test results are discussed and the performance is evaluated with comparison of related work. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Interactive visual exploration of large relation data
Authors: Li Yang
Venue:  (2008)

As data become ubiquitous and immense in many activities from business decision making to scientific analysis, effective analysis of such data becomes an important research area. Data analysis requires active involvement of human beings and visualization is a powerful tool to capture profound insights from data. However, interactive visual exploration of massive data poses fundamental technical challenges to both data visualization and database management systems. Millions of billions of data records clutter the screen and existing database management systems are inadequate for overview-and-drill-down data access for interactive data exploration. We have proposed a density-based methodology to address the above challenge. We present multiresolution data aggregation as an intermediate representation of data between visualization tools and databases. Data aggregated at multiple resolutions are stored in internal nodes of a partition-based high dimensional tree index while the individual records are stored in leaf nodes. Such a piggyback ride of aggregated data efficiently supports resolution-based data access patterns of large relational data. Thus, multiresolution data aggregation conveys density-based data input to visualizations. Therefore, many existing visualization techniques which are inefficient in visualizing large data can accept this new data input and participate in analysis of large data. To demonstrate the feasibility and effectiveness of the new representation, a client-server visualization tool is developed. The server, KDBMS, is a kdB-tree variant to organize data in multiple resolutions and the client, mVis, is a dynamic, flexible, and extendible visualization framework. We have extended 3D footprint splatting with grand tour, density-based parallel coordinates, and density-based scatterplot matrices to render data aggregations. The framework provides a data-independent and plug-in-based environment for quick development and integration of new visualization techniques, in addition to the linking mechanism to interconnect its components.
Optimal command of aircrafts' move using a reduced order observer
Authors: Lungu Mihai, Lungu Romulus, Jula Nicolae, Cepisca Costin, Calbureanu Madalina
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

In this paper one presents an algorithm for project of a reduced order observer (ALGLOOR) with applications to aircraft's longitudinal and lateral move. The command law is an optimal one in rapport with state vector of the observer. Numeric calculus examples are also presented; using Matlab/Simulink model of closed loop system one has made numeric calculus program and with it one obtained different time characteristics, which expresses state variables' dynamics of the aircraft dynamic models.
Evaluation of a Cardiac Ultrasound Segmentation Algorithm Using a Phantom
Authors: Yong Yue, Hemant D. Tagare, Ernest L. Madsen, Gary R. Frank, Maritza A. Hobson
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

This paper evaluates the performance of a level set algorithm for segmenting the endocardium in short-axis ultrasound images. The evaluation is carried out using an anthropomorphic ultrasound phantom. Details of the phantom design, including comparison of the ultrasound parameters with in-vitro measurements, are included.In addition to measuring segmentation accuracy, the effectiveness of the energy minimization scheme is also determined. It is argued that using the phantom along with global minimization algorithms (simulated annealing and random search) makes is possible to assess the minimization strategy.
Estimating Individual Cancer Risks in the UK National Breast Screening Programme: A Feasibility Study
Authors: Jennifer Diffey, Alan Hufton, Susan Astley, Claire Mercer, Anthony Maxwell
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

Conventional risk models for the development of breast cancer use inputs such as age, weight, hormonal factors and family history to compute individual breast cancer risk. These are employed in the management of women at high risk. The addition of breast density as an input has been shown to improve the accuracy of such models. An improved risk model could facilitate risk-based population screening. However, in order to use breast density in risk models there is a need to employ objective methods for measuring the density. A feasibility study has been carried out to assess the practicality of using a stepwedge-based technique for measuring breast density from mammograms in the UK National Health Service Breast Screening Programme and to determine whether additional information, relevant to risk, can be collected by questionnaire. Preliminary results suggest that it is practical to use such a technique in the screening environment. In a sample of 100 women, the mean density was 27% (range 2 - 81%). A negative trend in breast density was observed with Body Mass Index.
Design and Implementation Aspects of a Novel Java P2P Simulator with GUI
Authors: Vassilios Chrissikopoulos, George Papaloukopoulos, Evangelos Sakkopoulos, Spyros Sioutas
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

Peer-to-peer networks consist of thousands or millions of nodes that might join and leave arbitrarily. The evaluation of new protocols in real environments is many times practically impossible, especially at design and testing stages. The purpose of this paper is to describe the implementation aspects of a new Java based P2P simulator that has been developed to support scalability in the evaluation of such P2P dynamic environments. Evolving the functionality presented by previous solutions, we provide a friendly graphical user interface through which the high-level theoretic researcher/designer of a P2P system can easily construct an overlay with the desirable number of nodes and evaluate its operations using a number of key distribution. Furthermore, the simulator has built-in ability to produce statistics about the distributed structure. Emphasis was given to the parametrical configuration of the simulator. As a result the developed tool can be utilized in the simulation and evaluation procedures of a variety of different protocols, with only few changes in the Java code.
ORVPF - the Model and its DNC Implementation
Authors: Hong Zhou, Shahram Rahimi, Raheel Ahmad, Marcin Paprzycki, Yufang Wang, Maria Cobb
Venue: Informatica (2005)

Vector Product Format (VPF) based databases store geographical data in a relational framework, where individual VPF files are arranged hierarchically in a directory tree structure. Access and update of the VPF data can become difficult due to fragmentation of data among multiple tables. This paper presents an object-oriented model for the management of a VPF database, which provides easy access and automatic update for the VPF data, and is compatible with ESRI ArcView. This model has been successfully implemented in Java, for Digital Nautical Charts (DNC).
A Model for Measuring Cognitive Complexity of Software
Authors: Sanjay Misra, Ibrahim Akman
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

This paper proposes a model for calculating cognitive complexity of a code. This model considers all major factors responsible for (cognitive) complexity. The practical applicability of the measure is evaluated through experimentation, test cases and comparative study.
Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations
Authors: Yoshihito Toyama
Venue: Proceedings of the 19th international conference on Rewriting Techniques and Applications (2008)

S-expression rewriting systems were proposed by the author (RTA 2004) for termination analysis of Lisp-like untyped higher-order functional programs. This paper presents a short and direct proof for the fact that every finite S-expression rewriting system is terminating if it is compatible with a recursive path relation with status. By considering well-founded binary relations instead of well-founded orders, we give a much simpler proof than the one depending on Kruskal's tree theorem.
A Robust Semantic Overlay Network for Microgrid Control Applications
Authors: Geert Deconinck, Koen Vanthournout, Hakem Beitollahi, Zhifeng Qui, Rui Duan, Bart Nauwelaers, Emmanuel Lil, Johan Driesen, Ronnie Belmans
Venue: Architecting Dependable Systems V (2008)

Control systems for electrical microgrids rely ever more on heterogeneous off-the-shelf technology for hardware, software and networking among the intelligent electronic devices that are associated with dispersed energy resources. For distributed microgrid applications in a dynamic environment, overlay networks provide an opportunity for a flexible and robust logical communication infrastructure among these intelligent electronic devices. Agora is a semantic overlay network that allows to efficiently route queries -related to microgrid control- in the overlay network, based on an XML description of the static and dynamic characteristics of the intelligent electronic devices. It is robust against changes in the microgrid and ICT infrastructure, and provides graceful degradation in case of unrecovered failures.
A Comparison of the Isotope Effect for the N + N2 Reaction Calculated on Two Potential Energy Surfaces
Authors: Sergio Rampino, Dimitris Skouteris, Antonio Laganà, Ernesto Garcia
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

The atom-diatom time independent quantum reactive scattering program ABC implemented on the COMPCHEM section of the EGEE computing Grid has been used to compute isotope effects for the nitrogen atom - nitrogen molecule reactions. Exact J = 0 quantum scattering calculations were performed for both the 14N + 28N2 and 14N + 30N2 reactions on two different potential energy surfaces. Related reaction thresholds, reactive resonances and product distributions are discussed. J-shifting thermal rate coefficients are also calculated for a comparison with the experiment.
Data and Information as Property
Authors: Neville Holmes
Venue: Computer (2004)

The legal and information aspects of data are of great concern to the profession.
Wavelet Analysis of Bifurcation in a Competition Model
Authors: Carlo Cattani, Ivana Bochicchio
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

A nonlinear dynamical system which describes two interacting and competing populations (tumor and immune cells) is studied through the analysis of the wavelet coefficients. The wavelet coefficients (also called detail coefficients) are able to reproduce the behaviour of the function, and, being sensible to local changes, are strictly related to the differentiable properties of the function, which cannot be easily derived from the numerical interpolation. So the main features of the dynamical system will be given in terms of detail coefficients that are more adapted to the description of a nonlinear problem.
Show Me How You See: Lessons from Studying Computer Forensics Experts for Visualization
Authors: T. J. Jankun-Kelly, Josh Franck, David Wilson, Jeffery Carver, David Dampier, J. Edward Swan,  Ii
Venue: Proceedings of the 5th international workshop on Visualization for Computer Security (2008)

As the first part of a Analyze-Visualize-Validate cycle, we have initiated a domain analysis of email computer forensics to determine where visualization may be beneficial. To this end, we worked with police detectives and other forensics professionals. However, the process of designing and executing such a study with real-world experts has been a non-trivial task. This paper presents our efforts in this area and the lessons learned as guidance for other practitioners.
Universal active current filter using single differential voltage current conveyor
Authors: Chun-Ming Chang, Jen Hung Lo, Li-Der Jeng, Shu-Hui Tu, Chun-Li Hou, Jiun-Wei Horng
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

The realization of the second-order universal (low-pass, band-pass, high-pass, band-reject, and all-pass) active current filter using a single differential voltage current conveyor (DVCC), two grounded capacitors, and two resistosr is proposed in this paper. Three input signals and one tunable resistance determine the five generic filtering output signals. H-Spice simulations with 0.35µm process are used to validate the theoretical predictions of the filtering output signals, and show the low sensitivities, the fixed component sensitivity as operated from 10Hz to 10MHz, and the variable component sensitivities as operated higher than 10MHz.
Fuzziness and Performance: An Empirical Study with Linguistic Decision Trees
Authors: Zengchang Qin, Jonathan Lawry
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

Generally, there are two main streams of theories for studying uncertainties. One is probability theory and the other is fuzzy set theory. One of the basic ideas of fuzzy set theory is how to define and interpret membership functions. In this paper, we will study tree-structured data mining model based on a new interpretation of fuzzy theory. In this new theory, fuzzy labels will be used for modelling. The membership function is interpreted as appropriateness degrees for using labels to describe a fuzzy concept. Each fuzzy concept is modelled by a distribution on the appropriate fuzzy label sets. Previous work has shown that the new model outperforms some well-known data mining models such as Naive Bayes and Decision trees. However, the fuzzy labels used in previous works were predefined. We are interested in study the influences on the performance by using fuzzy labels with different degrees of overlapping. We test a series of UCI datasets and the results show that the performance of the model increased almost monotonically with the increase of the overlapping between fuzzy labels. For this empirical study with the LDT model, we can conclude that more fuzziness implies better performance.
Personalized Web Search by Constructing Semantic Clusters of User Profiles
Authors: John Garofalakis, Theodoula Giannakoudi, Agoritsa Vopi
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

During the recent years the Web has been developed rapidly making the efficient searching of information difficult and time-consuming. In this work, we propose a web search personalization methodology by coupling data mining techniques with the underlying semantics of the web content. To this purpose, we exploit reference ontologies that emerge from web catalogs (such as ODP), which can scale to the growth of the web. Our methodology uses ontologies to provide the semantic profiling of users' interests based on the implicit logging of their behavior and the on-the-fly semantic analysis and annotation of the web results summaries.
A Bottom-Up Investigation of Emotional Modulation in Competitive Scenarios
Authors: Lola Cañamero, Orlando Avila-García
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

In this paper, we take an incremental, bottom-up approach to investigate plausible mechanisms underlying emotional modulation of behavior selection and their adaptive value in autonomous robots. We focus in particular on achieving adaptive behavior selection in competitive robotic scenarios through modulation of perception, drawing on the notion of biological hormones. We discuss results from testing our architectures in two different competitive robotic scenarios.
Crouzeix-Velte decompositions for higher-order finite elements
Authors: G. Stoyan, Á. Baran
Venue: Computers Mathematics with Applications (2006)

We consider polynomial finite elements of order k >= 1 for the approximation of Stokes and linear elasticity problems which are continuous in the Gauss-Legendre points of the elements sides, i.e., generalize the Crouzeix-Raviart (k = 1), Fortin-Soulie (k = 2) and Crouzeix-Falk (k = 3) elements. We show that, for odd orders, these Gauss-Legendre elements do not possess a Crouzeix-Velte decomposition. For even orders, not only a Crouzeix-Velte decomposition can be shown to exist (which is advantageous when solving the corresponding linear equations and eigenvalue problems) but also the grid singularity of the well-known Scott-Vogelius elements is avoided by these elements which are shown to differ from the former ones by nonconforming bubbles. We also consider quadrilateral elements of order k >= 1 where the requirement of a Crouzeix-Velte decomposition is shown to exclude most commonly used elements.
Designing Genetic Regulatory Network with Fuzzy Logic
Authors: Jianwei Shen, Yi Wang, Zengrong Liu
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Based on the fact that fuzzy system is universal approximator , we made use of fuzzy system to design the genetic regulatory network. First, we viewed the differential equation as difference equation and classified the input data in term of time point and obtained the output data, so the system can be viewed as the two-input and one output system. Second, we fuzzy the spaces of input and output. Third, according to the theory of fuzzy system, we designed a fuzzy genetic regulatory network. In this paper, we established connection between discrete data and continuous data, and investigated the dynamical behaviors of gene network.
Dynamic Velocity Field Angle Generation for Obstacle Avoidance in Mobile Robots Using Hydrodynamics
Authors: Claudia Pérez-D'Arpino, Wilfredis Medina-Meléndez, Leonardo Fermín, José Guzmán, Gerardo Fernández-López, Juan Carlos Grieco
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

In this work, a strategy for the generation of the angle reference for a Velocity Field Controller is presented. For an arbitrary trajectory given in its parametric form, it is possible to create a desired velocity field, that could be modified if obstacles were detected by an artificial vision system. Velocity fields are composed by vectors that can be expressed in polar form, i.e. $V_x=|\overrightarrow{V}|\cdot\cos(\alpha)$ and $V_y=|\overrightarrow{V}|\cdot\sin(\alpha)$. In the velocity field generation technique proposed, the problem is divided into two separate problems: the calculation of the orientation angle ¿ and the calculation of the linear velocity $|\overrightarrow V|$. This paper addresses the calculation of ¿, using the hydrodynamics theory of an incompressible non-viscous fluid, plus the use of conformal mapping, thus generating a trajectory vector field that can evade obstacles. Results obtained show that a smooth and continuous field for both open and closed trajectories is achieved.