ppxscal/embedding_network huggingface dataset:
River flow estimation using adaptive neuro fuzzy inference system
Authors: Mahmut Firat, Mahmud Güngör
Venue: Mathematics and Computers in Simulation (2007)

Accurate estimation of River flow changes is a quite important problem for a wise and sustainable use. Such a problem is crucial to the works and decisions related to the water resources and management. In this study, an adaptive network-based fuzzy inference system (ANFIS) approach was used to construct a River flow forecasting system. In particular, the applicability of ANFIS as an estimation model for River flow was investigated. To illustrate the applicability and capability of the ANFIS, the River Great Menderes, located the west of Turkey and the most important water resource of Great Menderes Catchment's, was chosen as a case study area. The advantage of this method is that it uses the input-output data sets. Totally 5844 daily data sets collected in 1985-2000 years were used to estimate the River flow. The models having various input structures were constructed and the best structure was investigated. In addition four various training/testing data sets were constructed by cross validation methods and the best data set was investigated. The performance of the ANFIS models in training and testing sets were compared with the observations and also evaluated. The results indicated that the ANFIS can be applied successfully and provide high accuracy and reliability for River flow estimation.
3-D image reconstruction from exponential X-ray projections using Neumann series
Authors: J.-M. Wagner
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

In two dimensions, the exponential X-ray transform has been well-studied due to its applications of correcting attenuation effects in single photon emission computed tomography (SPECT). Explicit inversion formulas have been known for over 15 years. The three-dimensional (3D) case has not been as thoroughly examined, and inversion formulas are available for only a few of the wide range of possible 3D geometries. The rotating slant-hole (RSH) SPECT geometry is a special case for which no inversion formula has yet appeared. This paper presents a general inversion formula for the 3D exponential X-ray transform using a Neumann series. The method applies to any geometry but convergence of the series depends on the exponential scalar and the size of the region-of-interest. The derivation is presented in the context of the RSH SPECT geometry. Results from computer simulations are given.
Simulation Study of AODV Performance over IEEE 802.15.4 MAC in WSN with Mobile Sinks
Authors: Canfeng Chen, Jian Ma
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Mobility has been incorporated into wireless sensor networks in recent years in order to improve energy efficiency and network coverage. In particular, at the cost of increased message delivery delay, the energy conservation can be achieved by limiting the hop count between the communicating sensor-sink pair. In this paper we allow multihop routing between one sensor and mobile sinks, and consider the delay*energy metric, which is a compound metric to evaluate the performance of diverse data collection schemes. Through extensive simulation experiments of AODV performance over IEEE 802.15.4 MAC with clustered wireless sensor network setting, we investigate the fundamental problems of AODV without information of 802.15.4 MAC, and analyze the influence of incorporating multiple sinks.
Constraint-Based Policy Negotiation and Enforcement for Telco Services
Authors: Maria Grazia Buscemi, Laura Ferrari, Corrado Moiso, Ugo Montanari
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

Telco services are evolving under several aspects: for instance, services may combine different telecommunication features (messaging, multi-media, etc.) and may be activated and controlled by applications deployed in a 3rd party domain. Telco infrastructures are following this trend by adopting Service Oriented Architecture solutions, e.g. for composing services and for introducing uniform interaction models among services. In a SOA-based system, capabilities, requirements and general features of services can be expressed in terms of policies. Such policies are negotiated in order to define a Service Level Agreement among the involved parties. In this paper we show how to specify, negotiate, and enforce policies for Telco services by using a constraint-based model, the cc-pi calculus. This language extends concurrent constraint programming with synchronous communication and local names, and with the notion of soft constraints, that generalise classical constraints to represent preference levels. In cc-pi calculus, policies are expressed as soft constraints and the parties involved in the negotiation as communicating processes. The model allows to specify complex scenarios in which policy negotiations and validations can be arbitrarily nested.
Finding Relevant Applications For Prototyping
Authors: Mark Grechanik, Kevin M. Conroy, Katharina A. Probst
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

When gathering requirements for new software projects, it is often cost-effective to find similar applications that can be used as the basis for prototypes rather than building them from scratch. However, finding such sample applications can be difficult, often making prototyping time-consuming and expensive. We offer a novel approach called Exemplar (EXEcutable exaMPLes ARchive) for finding highly relevant software projects from a large archive of executable applications. Af- ter a programmer enters a query that contains high-level concepts (e.g., toolbar, download, smart card), Exemplar uses information retrieval and program analysis to retrieve applications that implement these concepts. We hypothe- size that Exemplar will be effective and efficient in helping programmers to quickly find highly relevant applications to support prototyping.
A model of the dynamics of the market of COTS software, in the absence of new entrants
Authors: Michele Marchesi, Giancarlo Succi, Barbara Russo
Venue: Information Systems Frontiers (2007)

This work proposes a simple model to simulate the dynamics of the market related to COTS software products, when there are no new entrants. The model takes in explicit account the interactions between products. The model uses a set of random variables, as the initial condition, to simulate the time evolution. The results of the simulations predict the emergence of monopolies, when the interactions between products are significant, and of open markets, when they are limited. The model is validated, by comparing the results of the simulation with the well established observations related to software markets and by comparing the resulting distribution of COTS software products with real data on the software market, which was provided by PC Data Inc.
Minitrack: Electric Power System Monitoring and Control
Authors: Peter W. Sauer
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This minitrack focuses on topics related to the monitoring and control of complex systems such as power systems to ensure that disturbances have a minimal impact on performance. Specific topics include: steady-state and dynamic security assessment where the impacts of pre-specified contingencies are analyzed; Available Transfer Capability (ATC) which quantifies the ability of the interconnected system to accept increases in power transfers; widearea measurement technologies, state estimation, and the investigation of new realtime control strategies.
NextMove: A Framework for Distributed Task Coordination
Authors: David K. M. Mak, Philippe B. Kruchten
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

This paper presents NextMove, a framework that assists project managers in allocating and managing tasks in an agile, distributed development environment. In such environments, managing tasks dynamically is difficult because of the lack of available informal, lightweight communication mechanisms. The framework simulates the project manager's thought processes involved in prioritizing and allocating tasks, by aggregating the variables involved in a software project, such as schedules, feature priorities and team-member attributes, using multi-criteria decision-resolution methodologies. We implemented the framework as a distributed client- server application using Java and MySQL. In addition, we built a simulator to evaluate the effectiveness of the framework. Preliminary simulation results show that, when compared with randomized selection of tasks, NextMove is more efficiently allocates tasks, so in a way that the project is completed sooner.
A unified approach to fractal dimensions
Authors: W. Kinsner
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

Many scientific papers treat the diversity of fractal dimensions as mere variations on either the same theme or a single definition. There is a need for a unified approach to fractal dimensions for there are fundamental differences between their definitions. This paper presents a new description of three essential classes of fractal dimensions based on: (i) morphology, (ii) entropy, and (iii) transforms, all unified through the generalized entropy-based Renyi fractal dimension spectrum. It discusses practical algorithms for computing 15 different fractal dimensions representing the classes. Although the individual dimensions have already been described in the literature, the unified approach presented in this paper is unique in terms of (i) its progressive development of the fractal dimension concept, (ii) similarity in the definitions and expressions, (iii) analysis of the relation between the dimensions, and (iv) their taxonomy. As a result, a number of new observations have been made, and new applications discovered. Of particular interest are behavioural processes such as dishabituation, irreversible and birth-death growth phenomena e.g., diffusion-limited aggregates, DLAs, dielectric discharges, and cellular automata, as well as dynamical nonstationary transient processes such as speech and transients in radio transmitters, multifractal optimization of image compression using learned vector quantization with Kohonen 's self-organizing feature maps (SOFMs), and multifractal-based signal denoising.
Algorithm for Identifying the Syntactic and Semantic Categories of Prepositions: Case of Over
Authors: Yukiko Sasaki Alam
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

This paper proposes an algorithm for assigning the syntactic categories of over, many uses of which are not used as prepositions. The algorithm, enriched for the semantic capacity from earlier studies, identifies four syntactic categories of over and eleven meanings of the prepositional uses. The ability of the algorithm was tested manually by using five hundred instances of over from British National Corpus. The results are encouraging, with over 95 percent of the instances being correctly classified. This study, while pointing to an ideal direction, will reveal many important points to consider in natural language processing.
An argumentation framework for merging conflicting knowledge bases
Authors: Leila Amgoud, Souhila Kaci
Venue: International Journal of Approximate Reasoning (2007)

The problem of merging multiple sources of information is central in many information processing areas such as databases integrating problems, multiple criteria decision making, etc. To solve this problem, two kinds of approaches have been proposed. The first category of approaches merges the different bases into a unique consistent base, and the second category, such as argumentation, accepts inconsistency and copes with it. It is well known that priorities are crucial to solve conflicts. Recently, powerful approaches have been proposed to merge multiple sources information where priorities are either explicitly or implicitly associated to information [L. Cholvy, Reasoning about merging information, Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 3, 1998, pp. 233-263; S. Konieczny, R. Pino Perez, On the logic of merging, in: Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR'98), Trento, 1998, pp. 488-498; J. Lin, Integration of weighted knowledge bases, Artificial Intelligence 83 (1996) 363-378; J. Lin, A. Mendelzon, Merging databases under constraints, International Journal of Cooperative Information Systems 7(1) (1998) 55-76; N. Rescher, R. Manor, On inference from inconsistent premises, Theory and Decision 1 (1970) 179-219; P.Z. Revesz, On the semantics of theory change: arbitration between old and new information, in: 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Databases, 1993, pp. 71-92; S. Benferhat, D. Dubois, S. Kaci, H. Prade, Possibilistic merging and distance-based fusion of propositional information, Annals of Mathematics and Artificial Intelligence, 34(1-3) (2002) 217-252; S. Benferhat, D. Dubois, H. Prade, M. Williams, A practical approach to fusing and revising prioritized belief bases, in: Proceedings of the 9th Portuguese Conference on Artificial Intelligence (EPIA'99), 1999, pp. 222-236; S. Kaci, Connaissances et Preferences: Representation et fusion en logique possibiliste, These de doctorat, Universite Paul Sabatier, Toulouse, 2002]. In this paper, we present an argumentation framework for solving conflicts which could be applied to conflicts arising between agents in a multi-agent system. We suppose that each agent is represented by a knowledge base and that the different agents are conflicting. We show that the argumentation framework retrieves the results of the merging approaches. Moreover, an argumentation-based approach palliates the limits, due to the drowning problem, of the merging operator when information is pervaded with explicit priorities.
Coordinating Multiple Autonomic Managers to Achieve Specified Power-Performance Tradeoffs
Authors: Jeffrey O. Kephart, Hoi Chan, Rajarshi Das, David W. Levine, Gerald Tesauro, Freeman Rawson, Charles Lefurgy
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

Getting multiple autonomic managers to work together towards a common goal is a significant architectural and algorithmic challenge, as noted in the ICAC 2006 panel discussion regarding "Can we build effective multi-vendor autonomic systems?" We address this challenge in a real small-scale system that processes web transactions. An administrator uses a utility function to define a set of power and performance objectives. Rather than creating a central controller to manage performance and power simultaneously, we use two existing IBM products, one that manages performance and one that manages power by controlling clock frequency. We demonstrate that, with good architectural and algorithmic choices established through trial and error, the two managers can indeed work together to act in accordance with a flexible set of power-performance objectives and tradeoffs, resulting in power savings of approximately 10%. Key elements of our approach include a) a feedback controller that establishes a power cap (a limit on consumed power) by manipulating clock frequency and b) reinforcement learning, which adaptively learns models of the dependence of performance and power consumption on workload intensity and the powercap.
Direct and turbo multi-user spatio-temporal channel estimation schemes for CDMA FDD UMTS uplink
Authors: M. Chenu-Tournier
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Many multi-user receivers have been developed to mitigate the effects of both multipath and interference in CDMA radiocommunication networks. However, despite of these works, very few papers have been devoted to the implementation of these receivers and, more precisely, to the channel estimation problem in both the multi-user and FDD UMTS context. Assuming specular propagation channels and a multi-sensor receiver, the purpose of this paper is to present direct and turbo multi-user schemes for the joint estimation of the impulse response of the propagation channels between each user and each sensor for the FDD UMTS uplink. The quality of the latter are then evaluated through the bit error rate (BER) computation at the output of two receivers (2D-RAKE and decorrelator receiver) adapted to the FDD UMTS uplink.
Decentralized Information Retrieval Systems Based on Contents Information for Ubiquitous Services
Authors: Takeshi Tsuchiya, Hirokazu Yoshinaga, Keiichi Koyanagi
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In this paper, we propose and clarify distributed Information Retrieval (IR) manner uses of Peer-to-Peer (P2P) Technology, which has same accuracy approximately at current index-integrated search engine use of statistical information calculated from the contents. Decentralized IR mechanisms use of statistic information have following problems. One is the manner calculates the statistic information from all contens by the collaborated with distributed peers (nodes). Second problem is the efficient allocation of indices on logical space created by peers, and named it "Multiple-Ring". And the last problem is constructing efficient IR strategies with high accuracy on them. At end, the proposal distributed IR mechanism is suitable for the flexible IR systems from middle scale to small scale such as office, because the system scalability is limited by the propagation time periodically among peers.
An Efficient, Practical Parallelization Methodology for Multicore Architecture Simulation
Authors: James Donald, Margaret Martonosi
Venue: IEEE Computer Architecture Letters (2006)

Multiple core designs have become commonplace in the processor market, and are hence a major focus in modern computer architecture research. Thus, for both product development and research, multiple core processor simulation environments are necessary. A well-known positive feedback property of computer design is that we use today's computers to design tomorrow's. Thus, with the emergence of chip multiprocessors, it is natural to re-examine simulation environments written to exploit parallelism.In this paper we present a programming methodology for directly converting existing uniprocessor simulators into parallelized multiple-core simulators. Our method not only takes significantly less development effort compared to some prior used programming techniques, but also possesses advantages by retaining a modular and comprehensible programming structure. We demonstrate our case with actual developed products after applying this method to two different simulators, one developed from IBM Turandot and the other from the SimpleScalar tool set. Our SimpleScalar-based framework achieves a parallel speedup of 2.2X on a dual-CPU dual-core (4-way) Opteron server.
Clock domain crossing fault model and coverage metric for validation of SoC design
Authors: Yi Feng, Zheng Zhou, Dong Tong, Xu Cheng
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Multiple asynchronous clock domains have been increasingly employed in System-on-Chip (SoC) designs for different I/O interfaces. Functional validation is one of the most expensive tasks in the SoC design process. Simulation on register transfer level (RTL) is still the most widely used method. It is important to quantitatively measure the validation confidence and progress for clock domain crossing (CDC) designs. In this paper, we propose an efficient method for definition of CDC coverage, which can be used in RTL simulation for a multi-clock domain SoC design. First, we develop a CDC fault model to present the actual effect of metastability. Second, we use a temporal data flow graph (TDFG) to propagate the CDC faults to observable variables. Finally, CDC coverage is defined based on the CDC faults and their observability. Our experiments on a commercial IP demonstrate that this method is useful to find CDC errors early in the design cycles.
RIVL: a resolution independent video language
Authors: Jonathan Swartz, Brian C. Smith
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

As common as video processing is, programmers still implement video programs as manipulations of arrays of pixels. This paper presents an extension to Tcl called Rivl (pronounced "rival") where video is a first class data type. Programs in Rivl use high level operators that are independent of video resolution and format, increasing portability of programs and allowing rapid prototyping of video effects. This paper gives several examples of still-image and video sequence programs in Rivl. It also discusses efficiency issues and experiences with Tcl as a platform for Rivl.
A Hybrid Real-Time Scheduling Approach for Large-Scale Multicore Platforms
Authors: John M. Calandrino, James H. Anderson, Dan P. Baumberger
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

We propose a hybrid approach for scheduling real-time tasks on large-scale multicore platforms with hierarchical shared caches. In this approach, a multicore platform is partitioned into clusters. Tasks are statically assigned to these clusters, and scheduled within each cluster using the preemptive global EDF scheduling algorithm. We show that this hybrid of partitioning and global scheduling performs better on large-scale platforms than either approach alone. We also determine the appropriate cluster size to achieve the best performance possible, given the characteristics of the task set to be supported.
Pi-Calculus in Logical Form
Authors: Marcello Bonsangue, Alexander Kurz
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

Abramsky's logical formulation of domain theory is extended to encompass the domain theoretic model for pi-calculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is done by defining a logical counterpart of categorical constructions including dynamic name allocation and name exponentiation, and showing that they are dual to standard constructs in functor categories. We show that initial algebras of functors defined in terms of these constructs give rise to a logic that is sound, complete, and characterises bisimilarity. The approach is modular, and we apply it to derive a logical formulation of pi-calculus. The resulting logic is a modal calculus with primitives for input, free output and bound output.
Enhancing the experience of 3D virtual worlds with a cartographic generalization approach
Authors: Cledja Rolim, Alejandro C. Frery, Eliana Almeida, Evandro Costa, Luiz Marcos Gon&#x00e7;alves
Venue: The Visual Computer: International Journal of Computer Graphics (2007)

In this work we propose a new approach for fast visualization and exploration of virtual worlds based on the use of cartographic concepts and techniques. Versions of cartographic maps with different levels of details can be created by using a set of operations named cartographic generalization. Cartographic generalization employs twelve operators and domain-specific knowledge, being the contribution of this work their transposition to 3D virtual worlds. The architecture of a system for 3D generalization is proposed and the system is implemented. Differently from traditional cartographic processes, we use artificial intelligence for both selecting the key objects and applying the operators. As a case study, we present the simplification of the historical quarter of Recife (Brazil).