ppxscal/embedding_network huggingface dataset:
Serving Text-Mining Functionalities with the Software Architecture Plato
Authors: Juan Jose Garcia Adeva
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

As information systems are dealing with a growing amount of unstructured text information, text mining technologies and their corresponding software tools have become increasingly widespread. However, text mining is still a young discipline that is starting to witness the advent of flexible, robust, and general software architectures that leverage the abundance of research results in benefiting application developers. In this article, we introduce Plato, a new software architecture that is unique in the set of text mining functionalities it provides to general purpose applications. This system is described and compared to other classification, information retrieval, and information extraction systems. We also include two case studies of applications developed with Plato and currently in use.
Throughput Analysis of Synchronous Data Flow Graphs
Authors: A. H. Ghamarian, M. C. W. Geilen, S. Stuijk, T. Basten, B. D. Theelen, M. R. Mousavi, A. J. M. Moonen, M. J. G. Bekooij
Venue: Proceedings of the Sixth International Conference on Application of Concurrency to System Design (2006)

Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for application mapping on platforms. Throughput analysis of these SDFGs is an important step for verifying throughput requirements of concurrent real-time applications, for instance within design-space exploration activities. Analysis of SDFGs can be hard, since the worst-case complexity of analysis algorithms is often high. This is also true for throughput analysis. In particular, many algorithms involve a conversion to another kind of data flow graph, the size of which can be exponentially larger than the size of the original graph. In this paper, we present a method for throughput analysis of SDFGs, based on explicit state-space exploration and we show that the method, despite its worst-case complexity, works well in practice, while existing methods often fail. We demonstrate this by comparing the method with state-ofthe- art cycle mean computation algorithms. Moreover, since the state-space exploration method is essentially the same as simulation of the graph, the results of this paper can be easily obtained as a byproduct in existing simulation tools.
Effects of Divided Attention on fMRI Correlates of Memory Encoding
Authors: Melina R. Uncapher, Michael D. Rugg
Venue: Journal of Cognitive Neuroscience (2005)

Performing a secondary task concurrently with a study task has a detrimental effect on later memory for studied items. To investigate the mechanisms underlying this effect, the processing resources available for an incidental encoding task were varied by manipulating secondary task difficulty. fMRI data were acquired as volunteers (n = 16) made animacy decisions to visually presented study words while concurrently performing either an easy or a hard auditory monitoring task. "Subsequent memory effects"&mdash;greater activity at study for words later remembered versus words later forgotten&mdash;were identified in the left ventral inferior frontal gyrus and the left anterior hippocampus. These effects did not vary according to whether the encoding task was performed concurrently with the easy or the hard secondary task. However, as secondary task difficulty increased, study-item activity declined and auditory-item activity increased in dorsolateral prefrontal and superior parietal regions that have been implicated in the support of executive and control functions. The findings suggest that dividing attention during encoding influences the probability of engaging the encoding operations that support later episodic memory, but does not alter the nature of the operations themselves. The findings further suggest that the probability of engaging these encoding operations depends on the level of general processing resources engaged in service of the study task.
The Emergence of English as a Celestial Language
Authors: Robert C. Meurant
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Given the emergence of English as a Global Language, and the probable eventual intensive human exploration and settlement of Space, what forces will likely shape the structural features of English as it expands into the Cosmos? In the exploration and settlement of Space, we will very probably use English as a Celestial Language. Microgravity, artificial intelligence, isolation, confinement, and the silent environment of Space will transform this language's structural features. Microgravity will precipitate lexical change, as vertical expressions become meaningless and are replaced by proximal and topological expressions. Interfacing with artificial intelligence will induce language change. Isolation of space settlements will induce language change, to enable each settlement to maintain a strong identity while preserving intelligibility with others. Confinement will be compensated for by language change. Finally, fundamental differences in empirical reality will affect the very structure of language, which will evolve to reflect the nature of the cosmic environment.
Component Agent Framework for domain-Experts (CAFnE) toolkit
Authors: Gaya Jayatilleke, John Thangarajah, Lin Padgham, Michael Winikoff
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

The Component Agent Framework for domain-Experts (CAFnE) toolkit is an extension to the Prometheus Design Tool (PDT). It uses the detailed design produced by PDT with further annotations by domain experts to automatically generate executable code into a desired agent platform. The key feature of CAFnE is that it allows domain experts with limited programming skills to easily build and modify agent systems.
AwareOffice: Integrating Modular Context-Aware Applications
Authors: Tobias Zimmer, Michael Beigl
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Developing valuable context-aware applications is at the centre of research in Ubicomp. In this paper we want to describe our experience over the last years in designing and developing such applications and in integrating them to build homogeneous Ubicomp environments. We introduce the concept of modular integration of context-aware application by presenting the AwareOfficeTecO's test bed for all kinds of context-aware applications form the office domain. We will show how we can easily build new applications by simply exploiting the modularity of our system. Therefore we introduce some base applications of the AwareOffice in some detail and show how to build more complex applications by modularly integrating them.
Distributing cognition or how they don't: an investigation of student collaborative learning
Authors: Wendy C. Newstetter, Cindy E. Hmelo
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

In recent years, collaborative activity has become more prevalent in both the worlds of work and schooling. In the workplace, its function is generally to ensure that complex problems are solved through the combined application of various types of expertise. Industrial design teams exemplify such a process. In the development of new products, teams composed of engineers, marketers, industrial designers, and financial managers work together to bring a design concept to market. Individuals in such teams apply their particularized expertise to parts of a problem and rely largely on the project manager to make sure that the parts are pulled together in a seamless unified way. This might be thought of as the "divide and conquer" model whereby varied domains of knowledge are brought together for the purpose of complex problem-solving which culminates in the optimization and realization of a new product. This variety of collaboration is appropriate and desirable because when it works it results in the desired goal of innovative product design.
LMI technique for stabilization of a linear plant by a pulse-modulated signal
Authors: A. N. Churilov, A. V. Gessen
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

The paper concerns stabilization of an unstable linear plant by a pulse modulator in feedback. The problem is reduced to finding a solution of some linear matrix inequalities (LMI). The conditions obtained guarantee that all the control system's solutions starting in some neighborhood of a zero equilibrium vanish as time increases. The neighborhood description is found from the LMI.
A Flexible Weight Based Clustering Algorithm in Mobile Ad hoc Networks
Authors: Zouhair El-Bazzal, Michel Kadoch, Basile L. Agba, Francois Gagnon, Maria Bennani
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

Clustering has been proven to be a promising approach for mimicking the operation of the fixed infrastructure and managing the resources in multi-hop networks. In order to achieve good performance, the formation and maintenance procedure of clusters should operate with minimum overhead, allowing mobile nodes to join and leave without perturbing the membership of the cluster and preserving current cluster structure as much as possible. In this paper, we propose a Flexible Weight Based Clustering Algorithm (FWCA) in Mobile Ad hoc Networks. The goals are yielding low number of clusters, maintaining stable clusters, minimizing the number of invocations for the algorithm and maximizing lifetime of mobile nodes in the system. Through simulations we have compared the performance of our algorithm with that of WCA in terms of the number of clusters formed, number of re-affiliations, number of states transitions on each clusterhead and number of clusterheads changes. The results demonstrate the superior performance of the proposed algorithm.
Triana Generations
Authors: Ian Taylor
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

This paper discusses the Triana workflow system within the context of the workflow community at large. It provides a brief background for Triana and discusses the ways in which it is has been used in the past for serial as well as distributed tasks. A description of the Triana distributed architecture is given followed by a discussion of its key features, including its user interface and its ability to work simultaneously in heterogeneous distributed environments. The high-level Grid and service-based interfaces that enable this support are outlined along with their corresponding bindings to the underlying middleware, such as WSPeer, Jxta, P2PS, Globus and Web and WS-RF services. New directions are outlined within the peer-to-peer context, followed by a description of two current P2P application domains and two collaborations that provide distributed P2P simulations for testing P2P overlays for use in massively distributed processing and searching, before deployment.
Topological Hole Detection in Sensor Networks with Cooperative Neighbors
Authors: Kun Bi, Kun Tu, Naijie Gu, Wan Lin Dong, Xiaohu Liu
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

In a wireless sensor network, the regions in which a large percentage of sensor nodes are not available may form holes in the network. In holes, sensor nodes may be depleted or not dense enough to communicate with others. So those holes may degrade some applications' performances in sensor networks. In this paper, we study the problem of detecting topological holes in sensor networks with no localization information in any node. We present a distributed cooperative scheme which is only based on the communication topology graph. To identify holes, each node only needs to exchange information with its 1-hop and 2-hop neighbors. With the cooperation of its 2-hop neighbors, each node could independently decide whether it is on the boundary of a hole. Experimental results demonstrate that our algorithm could indeed capture the characteristics of those boundary nodes and describe those holes in sensor networks of moderate node densities.
An event-driven approach with makespan/cost tradeoff analysis for project portfolio scheduling
Authors: Hsing-Pei Kao, Brian Wang, James Dong, Kuo-Cheng Ku
Venue: Computers in Industry (2006)

Project Portfolio Management (PPM) has become increasingly important in managing multiple projects simultaneously. However, during execution, the project portfolio is associated with considerable uncertainty that leads to resource contention among projects and schedule disruptions. Regarding the need to revise a schedule when unexpected events occur, we adopt an event-driven approach to develop a tradeoff decision framework for project portfolio scheduling and rescheduling. In the framework, High Level Petri nets, Activity-Based Costing and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) are applied in sequence to generate feasible schedules, estimate their makespan and costs, and select the best compromise schedule. This framework is advantageous in the evaluation of scheduling performance from a multi-criteria perspective and the incorporation of both objective and subjective measurements in the decision process.
Anisotropic Mesh Refinement: The Conditioning of Galerkin Boundary Element Matrices and Simple Preconditioners
Authors: Ivan G. Graham, William McLean
Venue: SIAM Journal on Numerical Analysis (2006)

In this paper we obtain upper and lower bounds on the spectrum of the stiffness matrix arising from a finite element Galerkin approximation (using nodal basis functions) of a bounded, symmetric bilinear form which is elliptic on a Sobolev space of real index m \in [-1,1]. The key point is that the finite element mesh is required to be neither quasi-uniform nor shape-regular, so that our theory allows anisotropic meshes often used in practice. (However, we assume that the polynomial degree of the elements is fixed.) Our bounds indicate the ill-conditioning which can arise from anisotropic mesh refinement. In addition we obtain spectral bounds for the diagonally scaled stiffness matrix, which indicate the improvement provided by this simple preconditioning. For the special case of boundary integral operators on a two-dimensional screen in R3, numerical experiments show that our bounds are sharp. We find that diagonal scaling essentially removes the ill-conditioning due to mesh degeneracy, leading to the same asymptotic growth in the condition number as arises for a quasi-uniform mesh refinement. Our results thus generalize earlier work by Bank and Scott [SIAM J. Numer. Anal., 26 (1989), pp. 1383-1394] and Ainsworth, McLean, and Tran [SIAM J. Numer. Anal., 36 (1999), pp. 1901-1932] for the shape-regular case.
Multiobjective Tuning of Grid-Enabled Earth System Models Using a Non-dominated Sorting Genetic Algorithm (NSGA-II)
Authors: A. R. Price, I. I. Voutchkov, G. E. Pound, N. R. Edwards, T. M. Lenton, S. J. Cox
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The tuning of parameters in climate models is essential to provide reliable long-term forecasts of Earth system behaviour. In this paper we present the first application of the multiobjective non-dominated sorting genetic algorithm (NSGA-II) to the GENIE-1 Earth System Model (ESM). Twelve model parameters are tuned to improve four objective measures of fitness to observational data. Grid computing and data handling technology is harnessed to perform the concurrent simulations that comprise the generations of the genetic algorithm. Recent advances in the method exploit Response Surface Modelling to provide surrogate models of each objective. This enables more extensive and efficient searching of the design space. We assess the performance of the NSGA-II using surrogates by repeating a tuning exercise that has been performed using a proximal analytical centre plane cutting method and the Ensemble Kalman Filter on the GENIE-1 model. We find that the multiobjective algorithm locates Pareto-optimal solutions which are of comparable quality to those obtained using the single objective optimisation methods.
Granulometries and pattern spectra for radar signals
Authors: Jean-F. Rivest
Venue: Signal Processing (2006)

Granulometries and pattern spectra are morphological tools used to obtain size distributions in images. This paper presents the application of these techniques to radar signals. It uses a new approach which is more appropriate for RF signals than the classical approach. It uses complex openings, closings and power measurements instead of the usual gray-tone operators and the Lebesgue measure. Examples for simulated and real radar signals are given.
Monotonic concession protocols for multilateral negotiation
Authors: Ulle Endriss
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

The most natural way of thinking about negotiation is probably a situation whereby each of the parties involved initially make a proposal that is particularly beneficial to themselves and then incrementally revise their earlier proposals in order to come to an agreement. This idea has been formalised in the so-called monotonic concession protocol, a set of rules defining the range of acceptable moves during a negotiation process intended to follow this general scheme. In the case of negotiation between just two agents, the monotonic concession protocol has become a textbook example and its formal properties are well-understood. In the case of multilateral negotiation, where more than two agents need to come to an agreement, on the other hand, it is not at all clear how to set up a monotonic concession protocol. As it turns out, the design of such a protocol boils down to the question of what constitutes a multilateral concession. In this paper, we make several proposals as to what might be an appropriate definition and analyse the properties of the proposed concession criteria.
On Elkan's theorems: Clarifying their meaning via simple proofs: Research Articles
Authors: Radim Bělohlávek, George J. Klir
Venue: International Journal of Intelligent Systems (2007)

This article deals with the claims that &ldquo;a standard version of fuzzy logic collapses mathematically to two-valued logic&rdquo; made by Charles Elkan in two papers [Proc 11th National Conf on AI, Menlo Park, CA: AAAI Press, 1993, pp 698&ndash;703; IEEE Expert 1994;9:3&ndash;8]. Although Elkan's effort to trivialize fuzzy logic has been questioned by numerous authors, our aim is to examine in detail his formal arguments and make some new observations. We present alternative, considerably simpler proofs of Elkan's theorems and use these proofs to argue that Elkan's claims are unwarranted. &copy; 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 203&ndash;207, 2007.
On the realization of current transfer function using voltage amplifiers: Research Articles
Authors: R. Raut
Venue: International Journal of Circuit Theory and Applications (2006)

Current transfer function is a feature of current-mode filters. Current-mode filters have so far been realized principally using current amplifiers and current conveyors. Some current-mode filter architecture using operational amplifiers have also been reported. In this article it is shown that by using the principles of transposed network and nullor model for the active device, a current transfer function can be realized in a very simple way using a voltage amplifier, i.e. operational amplifier (OA). The key concept is the knowledge that each ideal (i.e. infinite gain) controlled source is exactly equivalent to a nullor. Thus, a voltage-mode filter implemented using an ideal three terminal (output, input and ground) OA can be very easily converted to a current-mode filter using the same OA. The principle has been illustrated by considering single-OA- and multi-OA-based second-order voltage-mode filters. SPICE simulation results are provided to validate the theoretical concept. Copyright &copy; 2006 John Wiley & Sons, Ltd.This article was published online on 18 April 2006. An error was subsequently identified and corrected by an erratum notice that was published online only on DOI:10.1002&#x002F;cta.382. This printed version incorporates the amendments identified by the erratum notice.
An Enhanced Chaos Based Image Encryption Algorithm
Authors: Guosheng Gu, Guoqiang Han
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Chaos has been given much consideration as a feasible image encryption technique in current research. Nevertheless, some chaotic sequences can be reconstructed precisely owing to the finite computational precision. The focus of the work presented in this paper is to incorporate permutation and substitution methods, to present a strong image encryption algorithm. An optimized treatment and a cross-sampling disposal are introduced for enhancing the irregular and pseudorandom characteristics of chaotic sequences. Its design and implementation has been detailedly discussed and tested. Through simulation and analysis, the favorable performances of the proposed algorithm are evaluated.
Optimization and Performance Analysis of Zero Forcing Decision Feedback Detector for MIMO Block-Fading Channels with Per-Antenna Power Control
Authors: Kun Zhao, Ling Qiu, Jinkang Zhu
Venue: Wireless Personal Communications: An International Journal (2006)

In multiple-input multiple-output (MIMO) antenna systems, the zero forcing decision feedback detector (ZF-DFD) is used to recover transmit signals. In this paper, we propose a per-antenna power control (PAPC) scheme based on ZF-DFD for MIMO block-fading channels. The optimal power controlled ZF-DFD can minimize the block error rate (BLER) and maximize the lower bound of the channel's free distance at high signal-to-noise ratio (SNR) region subject to a power constraint. Additionally, the optimal power controlled ZF-DFD can achieve this BLER performance without any ordering operation at the receiver. The performance analysis among the conventional ZF-DFD without feedback, the optimal power controlled ZF-DFD with power feedback, and the ZF-DFD with full channel state information feedback shows that the optimal ZF-DFD achieves a tradeoff between performance and feedback overhead. We compare the bit error rate (BER) and BLER performance of the optimal ZF-DFD with other detectors without power feedback by simulation. In simulations, the execution times required by these detectors are also reported to compare their complexity. It comes straight that the optimal power controlled ZF-DFD proposed in this paper can achieve good performance with small feedback overhead and have low complexity.
On a class of Rellich inequalities
Authors: G. Barbati, A. Tertikas
Venue: Journal of Computational and Applied Mathematics (2006)

We prove the Rellich and the improved Rellich inequalities that involve the distance function from a hypersurface of codimension k, under a certain geometric assumption. In case, the distance is taken from the boundary, that assumption is the convexity of the domain. We also discuss the best constant of these inequalities.