ppxscal/embedding_network huggingface dataset:
Application of Clustering Algorithm to Blast Furnace Expert System
Authors: Guo Hongwei, Zhang Jianliang, Zuo Haibin, Zhang Xu
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Focusing on the complex, nonlinear and great hysteresis characteristics in the iron making process of blast furnace, the mathematical model of metallurgical can not satisfy the requirement of guiding operation, so the expert system based on the blast furnace experts’ knowledge and experience developed rapidly. However, because of the limitation of the experts’ knowledge and experience, this paper applied clustering algorithm to the development of blast furnace expert system. Based on the clustering algorithm, this system developed not only operational furnace profile management model, but also two methods of gas flow distribution pattern recognition to cross thermometric and top infrared imaging. This new system had achieved satisfying results when applied in blast furnaces of WISGCO, Jinan steel and Ansteel.
Finding Dense Subgraphs with Size Bounds
Authors: Reid Andersen, Kumar Chellapilla
Venue: Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph (2009)

We consider the problem of finding dense subgraphs with specified upper or lower bounds on the number of vertices. We introduce two optimization problems: the densest at-least-k-subgraph problem (dalks), which is to find an induced subgraph of highest average degree among all subgraphs with at least k vertices, and the densest at-most-k-subgraph problem (damks), which is defined similarly. These problems are relaxed versions of the well-known densest k-subgraph problem (dks), which is to find the densest subgraph with exactly k vertices. Our main result is that dalks can be approximated efficiently, even for web-scale graphs. We give a (1/3)-approximation algorithm for dalks that is based on the core decomposition of a graph, and that runs in time O(m&thinsp;+&thinsp;n), where n is the number of nodes and m is the number of edges. In contrast, we show that damks is nearly as hard to approximate as the densest k-subgraph problem, for which no good approximation algorithm is known. In particular, we show that if there exists a polynomial time approximation algorithm for damks with approximation ratio &gamma;, then there is a polynomial time approximation algorithm for dks with approximation ratio &gamma; 2/8. In the experimental section, we test the algorithm for dalks on large publicly available web graphs. We observe that, in addition to producing near-optimal solutions for dalks, the algorithm also produces near-optimal solutions for dks for nearly all values of k.
Systemic interaction analysis (SInA) in HRI
Authors: Manja Lohse, Marc Hanheide, Katharina J. Rohlfing, Gerhard Sagerer
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Recent developments in robotics enable advanced human-robot interaction. Especially interactions of novice users with robots are often unpredictable and, therefore, demand for novel methods for the analysis of the interaction in systemic ways. We propose Systemic Interaction Analysis (SInA) as a method to jointly analyze system level and interaction level in an integrated manner using one tool. The approach allows us to trace back patterns that deviate from prototypical interaction sequences to the distinct system components of our autonomous robot. In this paper, we exemplarily apply the method to the analysis of the follow behavior of our domestic robot BIRON. The analysis is the basis to achieve our goal of improving human-robot interaction iteratively.
A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation
Authors: Stefano Bistarelli, Francesco Santini
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We present an extension of the Soft Concurrent Constraint language that allows the nonmonotonic evolution of the constraint store. To accomplish this, we introduce some new operations: the retract(c) reduces the current store by c, the update"X(c) transactionally relaxes all the constraints of the store that deal with the variables in the set X, and then adds a constraint c; the nask(c) tests if c is not entailed by the store. We present this framework as a possible solution to the management of resources (e.g. web services and network resource allocation) that need a given Quality of Service (QoS). The QoS requirements of all the parties should converge, through a negotiation process, on a formal agreement defined as the Service Level Agreement, which specifies the contract that must be enforced. c-semirings are the algebraic structures that we use to model QoS metrics.
A property of the elementary symmetric functions on the frequencies of sinusoidal signals
Authors: Loredana Coluccio, Alfredo Eisinberg, Giuseppe Fedele
Venue: Signal Processing (2009)

In this paper, a relation between the elementary symmetric functions on the frequencies of multi-sine wave signal and its multiple integrals is proposed. The approach used herein is based on the algebraic derivative method in the frequency domain, which allows to yield exact formula in terms of multiple integrals of the signal when placed in the time domain. Moreover, it allows to free oneself from the hypothesis of uniform sampling. Two different ways to approach the estimation are advised, the first is based on least-squares estimation, while the second one is based on the solution of a linear system of dimension equal to the number of sinusoidal components involved. For an easy time realization of such formula, a time-varying filter is proposed. Due to use of multiple integrals of the signal, the resulting parameters estimation is accurate in the face of large measurement noise. To corroborate the theoretical analysis and to investigate the performance of the developed algorithm, computer simulated and laboratory experiments data records are processed.
Touch and toys: new techniques for interaction with a remote group of robots
Authors: Cheng Guo, James Everett Young, Ehud Sharlin
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Interaction with a remote team of robots in real time is a difficult human-robot interaction (HRI) problem exacerbated by the complications of unpredictable real-world environments, with solutions often resorting to a larger-than-desirable ratio of operators to robots. We present two innovative interfaces that allow a single operator to interact with a group of remote robots. Using a tabletop computer the user can configure and manipulate groups of robots directly by either using their fingers (touch) or by manipulating a set of physical toys (tangible user interfaces). We recruited participants to partake in a user study that required them to interact with a small group of remote robots in simple tasks, and present our findings as a set of design considerations.
Low energy level converter design for sub-Vth logics
Authors: Hui Shao, Chi-Ying Tsui
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

A low energy consumption level converter (LC) is presented for logic voltage conversion from sub-Vth voltage to nominal high voltage. By employing the multi-stage architecture and implementing a unique circuit inside each stage, the proposed LC can reduce its energy consumption by almost 3 orders and at the same time ensure the robustness of its function. The LC was fabricated and measured to verify its operation and the performance improvement.
Rich interfaces for reading news on the web
Authors: Earl J. Wagner, Jiahui Liu, Larry Birnbaum, Kenneth D. Forbus
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

Using content-specific models to guide information retrieval and extraction can provide richer interfaces to end-users for both understanding the context of news events and navigating related news articles. In this paper we discuss a system, Brussell, that uses semantic models to organize retrieval and extraction results, generating both storylines explaining how news event situations unfold and also biographical sketches of the situation participants. We generalize these models to introduce a new category of knowledge representation, an explanatory structure, that can scale up to include information from hundreds of documents, yet still provide model-based UI support to end-users. An informal survey of business news suggests the broad prevalence of news event situations indicating Brussell's potential utility, while an evaluation quantifies its performance in finding kidnapping situations.
An algorithm for complex spread spectrum in downlink line of mobile link systems CDMA2000 and UMTS
Authors: Petar Petrov, Valentin Mutkov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

An algorithm for formation of modulating complex-scrambling chip-signal in DSSS/CDMA-modulators, characterising the complex envelope with quadrature and polar components of the information, the spreading and the scrambling signals, is considered. The possible signal constellations are analysed.
Dialogue games that agents play within a society
Authors: Nishan C. Karunatillake, Nicholas R. Jennings, Iyad Rahwan, Peter McBurney
Venue: Artificial Intelligence (2009)

Human societies have long used the capability of argumentation and dialogue to overcome and resolve conflicts that may arise within their communities. Today, there is an increasing level of interest in the application of such dialogue games within artificial agent societies. In particular, within the field of multi-agent systems, this theory of argumentation and dialogue games has become instrumental in designing rich interaction protocols and in providing agents with a means to manage and resolve conflicts. However, to date, much of the existing literature focuses on formulating theoretically sound and complete models for multi-agent systems. Nonetheless, in so doing, it has tended to overlook the computational implications of applying such models in agent societies, especially ones with complex social structures. Furthermore, the systemic impact of using argumentation in multi-agent societies and its interplay with other forms of social influences (such as those that emanate from the roles and relationships of a society) within such contexts has also received comparatively little attention. To this end, this paper presents a significant step towards bridging these gaps for one of the most important dialogue game types; namely argumentation-based negotiation (ABN). The contributions are three fold. First, we present a both theoretically grounded and computationally tractable ABN framework that allows agents to argue, negotiate, and resolve conflicts relating to their social influences within a multi-agent society. In particular, the model encapsulates four fundamental elements: (i) a scheme that captures the stereotypical pattern of reasoning about rights and obligations in an agent society, (ii) a mechanism to use this scheme to systematically identify social arguments to use in such contexts, (iii) a language and a protocol to govern the agent interactions, and (iv) a set of decision functions to enable agents to participate in such dialogues. Second, we use this framework to devise a series of concrete algorithms that give agents a set of ABN strategies to argue and resolve conflicts in a multi-agent task allocation scenario. In so doing, we exemplify the versatility of our framework and its ability to facilitate complex argumentation dialogues within artificial agent societies. Finally, we carry out a series of experiments to identify how and when argumentation can be useful for agent societies. In particular, our results show: a clear inverse correlation between the benefit of arguing and the resources available within the context; that when agents operate with imperfect knowledge, an arguing approach allows them to perform more effectively than a non-arguing one; that arguing earlier in an ABN interaction presents a more efficient method than arguing later in the interaction; and that allowing agents to negotiate their social influences presents both an effective and an efficient method that enhances their performance within a society.
Evaluation Method and Application Based on Rough Set-Support Vector Regression Model
Authors: Xiu-mei Wang, Xing Zhang, Chong Gao
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Support Vector Machine has the convenient superiority in the classification. Recently it has been extended to the domain of regression problems. However, due to the increasing index, excess input data and complicated system structure, it is difficult to achieve good accuracy in results. This paper adopts combination method of rough set and support vector machine so as to establish rough set attribute reducing support vector regression model to carry out the comprehensive evaluation of the innovative talents training in engineering universities. The experimental results show that this method has strong objectivity and impartiality, and can increase the computing speed.
Strong difference families, difference covers, and their applications for relative difference families
Authors: Koji Momihara
Venue: Designs, Codes and Cryptography (2009)

In (M. Buratti, J Combin Des 7:406---425, 1999), Buratti pointed out the lack of systematic treatments of constructions for relative difference families. The concept of strong difference families was introduced to cover such a problem. However, unfortunately, only a few papers consciously using the useful concept have appeared in the literature in the past 10 years. In this paper, strong difference families, difference covers and their connections with relative difference families and optical orthogonal codes are discussed.
Dendritic stylization
Authors: Jeremy Long, David Mould
Venue: The Visual Computer: International Journal of Computer Graphics (2009)

Dendritic or branching structures are commonly seen in natural phenomena such as lightning, cracks, and vegetal growth. They are also often used for artistic or decorative purposes. We present a new procedural method for modeling dendritic structures based on a path planning approach. Our method includes the use of a partial non-scalar distance metric that gives us powerful and responsive control over the evolving dendritic structure. We demonstrate the effectiveness of our approach by creating dendritic stylizations of input images. We also show how our approach can be used to model more complex dendritic structures, such as trees; our algorithm allows us to create pareidolia effects, where an image is embedded within the branches of the tree.
Argumentation-Based Information Exchange in Prediction Markets
Authors: Santi Ontañón, Enric Plaza
Venue: Argumentation in Multi-Agent Systems: Fifth International Workshop, ArgMAS 2008, Estoril, Portugal, May 12, 2008. Revised Selected and Invited Papers (2009)

The purpose of this paper is to investigate how argumentation processes among a group of agents may affect the outcome of group judgments. In particular we will focus on prediction markets (also called information markets) and we will investigate how the existence of social networks (that allow agents to argue with one another to improve their individual predictions) effect on group judgments. Social networks allow agents to exchange information about the group judgment by arguing about the most likely choice based on their individual experience. We develop an argumentation-based deliberation process by which the agents acquire new and relevant information. Finally, we experimentally assess how different social network connectivity and different data distribution affect group judgment.
Musicsim: integrating audio analysis and user feedback in an interactive music browsing ui
Authors: Ya-Xi Chen, Andreas Butz
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

In music information retrieval (MIR), there are two main research directions, which are based either on a folder hierarchy and metadata, or on the actual acoustic content. We believe that both content-based and hierarchy-based retrieval have their respective strengths for browsing and organizing music collections, and that the integration of content analysis techniques in metadata-based media UIs can lead to more powerful UIs. In this paper we present a prototype, in which audio analysis techniques and user feedback are integrated into an interactive UI for browsing and organizing large music collections. We also provide visual assistance to support non-visual perception of music. We discussed our system with test users and received encouragement as well as valuable suggestions for future re-search.
Dynamic Offline Conflict-Free Coloring for Unit Disks
Authors: Joseph Wun-Tat Chan, Francis Y. Chin, Xiangyu Hong, Hing Fung Ting
Venue: Approximation and Online Algorithms: 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers (2009)

A conflict-free coloring for a given set of disks is a coloring of the disks such that for any point p on the plane there is a disk among the disks covering p having a color different from that of the rest of the disks that covers p. In the dynamic offline setting, a sequence of disks is given, we have to color the disks one-by-one according to the order of the sequence and maintain the conflict-free property at any time for the disks that are colored. This paper focuses on unit disks, i.e., disks with radius one. We give an algorithm that colors a sequence of n unit disks in the dynamic offline setting using O(logn) colors. The algorithm is asymptotically optimal because &Omega;(logn) colors is necessary to color some set of n unit disks for any value of n [9].
Metaphorical affect sensing in an intelligent conversational agent
Authors: Li Zhang
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

We report new developments of an affect detection component on the processing of several different types of metaphorical affective expressions. The component has been embedded in an intelligent conversational AI agent interacting with human users under loose scenarios. The detected affective states also play an important role in producing emotional animation for users' avatars. Evaluation for the affect detection component is provided. Our work contributes to the conference themes on human-robots interaction based on affect sensing, affective computing, learning and children, narrative storytelling and evaluation of affective social interaction.
An Algorithm of Fractal Tree Generate Base on Controllable Random Transform
Authors: Lin Jiang, Xianchun Guo, Ling Lu
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

An algorithm of fractal tree is hot research area in nature scenery simulation. We present a generate algorithm of fractal tree by use a controllable random transform method. This method base on fractal theory, controls some parameters of fractal tree generating in a random scope, which parameters including coordinates, length of tree branch, angle of tree branch transfer, thickness of trunk, color of render. Experiment show fractal tree rendered has a third dimension, although our render method is planar. Our algorithm guarantees the worst-case cost of O(B*level) for rendering a fractal tree, where B is numbers of tree branch and level is numbers of node on each branch.
Easily Reconfigurable Analytical Fuzzy Predictive Controllers: Actuator Faults Handling
Authors: Piotr M. Marusak
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Efficient and easily reconfigurable predictive controllers are described in the paper. They are based on Takagi---Sugeno (TS) fuzzy models with local models in the form of the step responses. In these algorithms the TS fuzzy model is utilized in such a way that the control law can be calculated at each iteration in a simple and easy way. They are computationally efficient and can be easily reconfigured during adaptation to new situations, like e.g. actuator faults that can occur in the control system.
Optimisation of sputnik distributor using numerical method
Authors: Bao-Yu Guo, Ke-Jun Dong, Ai-Bing Yu
Venue: International Journal of Computational Fluid Dynamics (2009)

A coal distributor is necessary to mix and split raw coal for subsequent processing in a parallel module coal preparation plant. The sputnik hydraulic distributor, a static device with two internal chambers and tangential water pipes, is widely employed for this purpose. Biased properties in the discharging slurry streams may lead to many problems. It is useful to develop a mathematical model to aid the design, control and optimisation of the operation. For this purpose, we have recently developed a computational fluid dynamics (CFD) model which uses homogeneous two-phase flow method to solve the three-dimensional distribution of water flow and its volume fraction and a discrete element method (DEM) to describe the motion of coal particles in the distributor. In this article, extensive numerical experiments based on the CFD model are conducted and the detailed fluid flow pattern is analysed to understand the main causes for water maldistribution inside a 12-way coal distributor, aiming to identify the optimum operational condition and design for practice. Variables considered include water flow rate and velocity, layout of water inlets, size and position of the inserted table, geometry of orifice slots and outlet size. The initial momentum of tangential inlet jet is found to be most important to minimise biased mass flow rate among outlets. Three mechanisms, namely, geometric distribution, swirl distribution and gravity distribution, are found to be responsible for the water distribution. To test the outcomes, the flow of coal particles is also simulated using DEM. Several cases with different operational conditions are considered to clarify the influence of water flow on particle flow and the relationship between water distribution and particle flow distribution at the outlets. The findings should be useful in the development of a better understanding of this complicated gas-liquid-particle flow system or new designs and control strategies for coal distributors.
Trading off resources between overlapping overlays
Authors: Brian F. Cooper
Venue: Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware (2006)

Many different overlays with different properties have been proposed. Rather than using one overlay for all applications, it is likely that multiple overlapping overlays will be deployed on the same computing resources for different purposes. We present an architecture, called ODIN-S, for mediating the resources used by overlapping overlays. We can specify priorities for different overlays, and then allow ODIN-S to allocate computation and bandwidth across the network to respect priorities. The key features of ODIN-S include a common middleware runtime supporting multiple overlay logics, and "filters" for throttling, ordering and dropping messages in order to manage resources. We present experimental results that demonstrate ODIN-S's ability to manage resources between different types of overlapping overlays.