ppxscal/embedding_network huggingface dataset:
Measures for persuasion dialogs: A preliminary investigation
Authors: Leila Amgoud, Florence Dupin De Saint Cyr
Venue: Proceeding of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008 (2008)

Persuasion is one of the main types of dialogs encountered in everyday life. The basic idea behind a persuasion is that two (or more) agents disagree on a state of affairs, and each one tries to persuade the other to change his mind. For that purpose, agents exchange arguments of different strengths. Several systems, grounded on argumentation theory, have been proposed in the literature for modeling persuasion dialogs. These systems have studied more or less deeply the different protocols required for this kind of dialogs, and have investigated different termination criteria. However, nothing is said about the properties of the generated dialogs, nor on the behavior of the interacting agents. Besides, analyzing dialogs is a usual task in everyday life. For instance, political debates are generally deeply dissected. In this paper we define measures for analyzing dialogs from the point of view of an external agent. In particular, three kinds of measures are proposed: i) measures of the quality of the exchanged arguments in terms of their strengths, ii) measures of the behavior of each participating agent in terms of its coherence, its aggressiveness in the dialog, and finally in terms of the novelty of its arguments, iii) measures of the quality of the dialog itself in terms of the relevance and usefulness of its moves.
A Delegation Logic Based Authorization Mechanism for Virtual Organizations
Authors: Chunhua Gu, Xueqin Zhang, Guoxin Song
Venue: Proceeding of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005 (2005)

Because of the new business trends such as cooperating, downsizing and resource sharing, the use of virtual organization (VO) is gaining increasing importance as a model for building large-scale business information systems. Authorization is essential in VO in order to control the access to shared resources. But authorization in VO is challenging because the participants of VO need to collaborate in a distributed, dynamic and heterogeneous environment, and accordingly the access control policies are complex. A delegation logic based authorization mechanism is put forward in this paper. Our proposed approach translates the access requests, credentials and access policies into unified delegation logic rules. Based on the calculation on those rules, the access decision is made. We introduce the concept of Access Unit (AU), which wraps the AC system of a task. The rule exchange interface of AU is defined. The main contribution of this paper is that it suggests a practical mechanism for implementing authorization for VO. In essence, we propose an approach to enforce RBAC in VO based on task/project structure.
Windows-based software for optimising entropy-based groupings of textural data
Authors: Lachlan K. Stewart, Vladmir E. Kostylev, Alan R. Orpin
Venue: Computers Geosciences (2009)

EntropyMax is a new 32-bit Windows-based software that groups large matrices of grain-size distribution data into a finite number of groups. The software utilises statistical algorithms that minimise the entropy within a group while maximising the entropy between groups. EntropyMax builds upon an existing DOS-BASIC program through the addition of a more robust computational routine, a graphical user interface, incorporation of an improved and more statistically meaningful method for identifying the optimal number of groupings, and better graphical presentation of results. These refinements add significantly to the functionality and statistical rigour of the program on modern computer platforms and large data sets.
Keynote lecture 4: if it's fast it must be Newton's method
Authors: Richard Tapia
Venue: Proceedings of the international conference on Computational and information science 2009 (2009)

Shifted inverse and Rayleigh quotient iteration are well-known algorithms for computing an eigenvector of a symmetric matrix. In this talk we demonstrate that each of these algorithms can be viewed as a standard form of Newton's method from the nonlinear programming literature. This provides an explanation for their good behavior despite the need to solve systems with nearly singular coefficient matrices. Our equivalence result also leads us naturally to a new proof that the convergence of the Rayleigh quotient iteration is q-cubic with rate constant at worst 1.
Descent systems for Bruhat posets
Authors: Lex E. Renner
Venue: Journal of Algebraic Combinatorics: An International Journal (2009)

Let (W,S) be a finite Weyl group and let w¿W. It is widely appreciated that the descent set $$D(w)=\{s\in S\mid l(ws) determines a very large and important chapter in the study of Coxeter groups. In this paper we generalize some of those results to the situation of the Bruhat poset W J where J¿S. Our main results here include the identification of a certain subset S J ¿W J that convincingly plays the role of S¿W, at least from the point of view of descent sets and related geometry. The point here is to use this resulting descent system (W J ,S J ) to explicitly encode some of the geometry and combinatorics that is intrinsic to the poset W J . In particular, we arrive at the notion of an augmented poset, and we identify the combinatorially smooth subsets J¿S that have special geometric significance in terms of a certain corresponding torus embedding X(J). The theory of J-irreducible monoids provides an essential tool in arriving at our main results.
Annotating proteomic mass spectrometry data for qualitative and quantitative experiments
Authors: D. David Page,  Jr.
Venue:  (2008)

This dissertation presents and evaluates algorithms that annotate mass spectrometry data from qualitative and quantitative experiments. The problems encountered when using mass spectrometry to predict the condition of samples (e.g. disease), and to determine the relative differences in protein expression from two samples, motivate the development of these algorithms. This dissertation introduces algorithms that couple statistical learning and dynamic programming to annotate peaks from a mass spectrum into groups that correspond to the underlying chemistry of the studied samples. We demonstrate the utility of annotating these groups over the expert's annotations and other similar algorithms currently in the field. During this process the potential of using a "mostly" correct example set over a "near-miss" example set is shown to improve the annotation results. Using these annotated groups as features for classification, rather than just the individual peaks, improves the prediction accuracy for Prion disease and provides a better reflection upon the underlying chemistry.Next, this dissertation derives and evaluates algorithms that annotate mass spectrometry data from quantitative experiments containing a metabolic label. The algorithm takes as input the annotated groups from the previous algorithm and subsequently matches the "light" and "heavy" pairs of molecules that have the same atomic formula, but are different in their atomic isotope content. Finally, this dissertation compares and contrasts algorithms that calculate the relative quantitative ratios from the annotated isotopic matched pairs. It then presents a metric for measuring the annotation and quantitative calculations simultaneously. Overall, this dissertation demonstrates the potential utility of statistical learning applied to the problems of qualitative and quantitative mass spectrometry.
Learning from and with peers: the different roles of student peer reviewing
Authors: Harald Sondergaard
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

There are many different approaches to student peer assessment. In this paper I lay out the pedagogical philosophy behind my own use of student peer reviews. These should not only be seen as adding to the amount of formative feedback in a class, nor are they only about the development of certain higher-order cognitive skills. Properly aligned with an overall assessment strategy, peer reviewing can help build a stronger learning community. I describe such a strategy and my experience using PRAZE, an online tool for student peer reviewing, as well as students' response to the tool and its use.
Utility-driven solution for optimal resource allocation in computational grid
Authors: Zhi-jie Li, Chun-tian Cheng, Fei-xue Huang
Venue: Computer Languages, Systems and Structures (2009)

Optimal resource allocation is a complex undertaking due to large-scale heterogeneity present in computational grid. Traditionally, the decision based on certain cost functions has been used in allocating grid resource as a standard method that does not take resource access cost into consideration. In this paper, the utility function is presented as a promising method for grid resource allocation. To tackle the issue of heterogeneous demand, the user's preference is represented by utility function, which is driven by a user-centric scheme rather than system-centric parameters adopted by cost functions. The goal of each grid user is to maximize its own utility under different constraints. In order to allocate a common resource to multiple bidding users, the optimal solution is achieved by searching the equilibrium point of resource price such that the total demand for a resource exactly equals the total amount available to generate a set of optimal user bids. The experiments run on a Java-based discrete-event grid simulation toolkit called GridSim are made to study characteristics of the utility-driven resource allocation strategy under different constraints. Results show that utility optimization under budget constraint outperforms deadline constraint in terms of time spent, whereas deadline constraint outperforms budget constraint in terms of cost spent. The conclusion indicates that the utility-driven method is a very potential candidate for the optimal resource allocation in computational grid.
Wide band (0.05-40GHz) characterization and signal propagation in Cu-porous MSQ interconnects
Authors: T. K. S. Wong, R. Kumar, S. C. Rustagi
Venue: Microelectronic Engineering (2009)

Scattering S-parameter measurements of Cu/porous methylsilsesquioxane (pMSQ) damascene interconnects with widths from 0.15@mm to 4@mm have been measured up to 40GHz. For the narrowest conductors, the quasi-transverse electromagnetic mode is attained only at high frequencies. The effect of Cu conductor width on both dc and ac resistivity is also determined.
Effective multiagent interactions for open cooperative systems rich in services
Authors: Maíra Ribeiro Rodrigues, Michael Luck
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

The benefits of open and cooperative systems, popular because of the functionality they offer for sharing resources free of charge, are only achievable if there is an incentive to cooperate, and if participants are able to make effective decisions about the cooperations in which they participate. In this context, the key contribution of this paper is a framework for non-monetary cooperations among self-interested agents, providing non-monetary incentives for service provision and a means to analyse cooperations. The framework is used to support a partner selection mechanism, for decision-making over interaction partners.
Multitarget tracking algorithms using angle innovations and extended Kalman filter
Authors: Sheng-Yun Hou, Hsien-Sen Hung, Yuan-Chang Chang, Shun-Hsyung Chang
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

In this paper, we propose a novel angle tracking algorithm, called as FPAT, for tracking multiple narrowband targets. The proposed algorithm modifies the algorithm presented by Park, et al. in two ways by using the sensor array output vector rather than the sample covariance matrix and by incorporating the extended Kalman filter instead of a simple Kalman filter. It also applies the prediction characteristic of Kalman filter to prevent the data association problem. The proposed algorithm requires lower computational complexity and also improves the tracking performance especially at lower number of snapshots. Combined with the coherent signal-subspace (CSS) method, the FPAT algorithm is extended to track the direction-of-arrival angles of wideband sources. We also extend the FPAT algorithm to track the range, azimuth, and elevation of each narrowband source in 3-D space. Through computer simulations, the effectiveness of each proposed algorithm is verified.
Declarative definition of contexts with polymorphic events
Authors: Angel Núñez, Jacques Noyé, Vaidas Gasiūnas
Venue: International Workshop on Context-Oriented Programming (2009)

This paper introduces a new model of event handling combining explicitly triggered events with events intercepted with aspect-oriented features. The model supports event abstraction, polymorphic references to events, and declarative definition of events as expressions involving references to events from other objects. We show that this model makes it easy to define a declarative and compositional notion of event-based context. We illustrate these ideas with examples in ECaesarJ, a language with concrete support for our model, and relate the events of ECaesarJ to other event-handling and context-handling models.
Technical Section: Assembling curvature continuous surfaces from triangular patches
Authors: Kestutis Karčiauskas, Jörg Peters
Venue: Computers and Graphics (2009)

We assemble triangular patches of total degree at most eight to form a curvature continuous surface. The construction illustrates how separation of local shape from representation and formal continuity yields an effective construction paradigm in partly underconstrained scenarios. The approach localizes the technical challenges and applies the spline approach, i.e. keeping the degree fixed but increasing the number of pieces, to deal with increased complexity when many patches join at a central point.
Concurrent Engineering application on the development of parts for the White Goods industry in Brazil --a case study
Authors: João Pedro Buiarskey Kovalchuk, Osíris Canciglieri Júnior, Antonio Batocchio
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

The classical way to manage product development processes for massive production seems to be changing: high pressure for cost reduction, higher quality standards, markets reaching for innovation lead to the necessity of new tools for development control. Into this, and learning from the automotive and aerospace industries factories from other segments are starting to understand and apply manufacturing and assembly oriented projects to ease the task of generate goods and from this obtain at least a part of the expected results. This paper is intended to demonstrate the applicability of the concepts of Concurrent Engineering and DFMA (Design For Manufacturing and Assembly) in the development of products and parts for the White Goods industry in Brazil (major appliances as refrigerators, cookers and washing machines), showing one case concerning the development and releasing of a component. Finally is demonstrated in a short term how was reached a solution that could provide cost savings and reduction on the time to delivery using those techniques.
A platform for pervasive combinatorial trading with opportunistic self-aggregation
Authors: Antonio Di Ferdinando, Ricardo Lent, Erol Gelenbe, Alberto Rosi, Franco Zambonelli
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

We describe a prototype of trading system platform populated by agents who autonomously decide to buy and/or sell items according to a set of local needs which arise dynamically (also by possibly accessing information provided by pervasive devices) by in the process of fulfilling a given overall utility. The market has combinatorial nature in a way that items to be traded are combined into packages, in accordance with a principle that drives the nature of many current markets. However, differently from these, items belong to a number of distinct sellers distributed in the platform, and are chosen singularly on the basis of buyers preferences and needs. Agents are thus situation-aware, with sellers coming acquainted of the market demand, and buyers price offers, through a Knowledge Network. This latter drives the way market offers balance the demand by gathering the needed information in an autonomous way and taking advantage of pervasive devices. Packaging is realized by agent aggregation into Virtual Sellers, in an autonomous fashion, and we propose an opportunistic policy whereby aggregation is governed by a Combinatorial Auction. The market is studied through proof-of-concept simulation, where the efficiency deriving from the opportunistic aggregation based on Combinatorial Auctions and the influence of contextual self-awareness are studied.
Long-Term and Dynamical Aspects of Information Security
Authors: Matthias Hollick, Dieter Hutter, Takaaki Yamada, Mathias Maier, Isao Echizen, Martin Khmer, E. Damiani, Hiroshi Yoshiura, Rafael Accorsi, V. Bellandi, Satoru Tezuka, C. A. Ardagna, Sebastian Hohn, M. Anisetti, Ralf Steinmetz, Rafael Accorsi, Michael Kreutzer, Andreas U. Schmidt
Venue:  (2007)

The first six papers deal with computer security technology that operates in rapidly changing environments and has to adapt to their shifting conditions. The technology or application envisaged in the second six operates or assumes a static outcome that can, for instance, be used forensically. The second half of the book contains a proposal to quantify the time scales on which IT security lives may be a major contribution of this volume. The authors identify three main axes. First, the time scale of practical relevance. It denominates approximately the middle of the time range during which the problem treated by the technology becomes imminent to the IS&T community, through the demands of the market. Second, the technological research and development (R&D) time scale. It is a forecast of when the technological solution will be there . This means in effect the first of two milestones in technology evolution: a) when a technology has made the breakthrough to be in principle, i.e., theoretically and economically applicable and viable, and b) when it is matured to reach prevalence in IS&T, i.e., to become textbook standard. The second point in time hinges obviously on external factors not amenable to analysis within the discipline proper. Third, we have the event horizon of the technology in question. That deals with the issue of the sustainability of the solution: May it be surpassed by the skills of attackers using advances in other areas? Can it be foreseen that it will be overcome by even better solutions?
Hybrid nanoelectronics: future of computer technology
Authors: Wei Wang, Ming Liu, Andrew Hsu
Venue: Journal of Computer Science and Technology (2006)

Nanotechnology may well prove to be the 21st century's new wave of scientific knowledge that transforms people's lives. Nanotechnology research activities are booming around the globe. This article reviews the recent progresses made on nanoelectronic research in US and China, and introduces several novel hybrid solutions specifically useful for future computer technology. These exciting new directions will lead to many future inventions, and have a huge impact to research communities and industries.
Volatility dynamics of the US business cycle: A multivariate asymmetric GARCH approach
Authors: Kin-Yip Ho, Albert K. Tsui, Zhaoyong Zhang
Venue: Mathematics and Computers in Simulation (2009)

Most empirical investigations of the business cycles in the United States have excluded the dimension of asymmetric conditional volatility. This paper analyses the volatility dynamics of the US business cycle by comparing the performance of various multivariate generalised autoregressive conditional heteroskedasticity (GARCH) models. In particular, we propose two bivariate GARCH models to examine the evidence of volatility asymmetry and time-varying correlations concurrently, and then apply the proposed models to five sectors of Industrial Production of the United States. Our findings provide strong evidence of asymmetric conditional volatility in all sectors, and some support of time-varying correlations in various sectoral pairs. This has important policy implications for government to consider the effective countercyclical measures during recessions.
SEVA: Sensor-enhanced video annotation
Authors: Xiaotao Liu, Mark Corner, Prashant Shenoy
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2009)

In this article, we study how a sensor-rich world can be exploited by digital recording devices such as cameras and camcorders to improve a user's ability to search through a large repository of image and video files. We design and implement a digital recording system that records identities and locations of objects (as advertised by their sensors) along with visual images (as recorded by a camera). The process, which we refer to as Sensor-Enhanced Video Annotation (SEVA), combines a series of correlation, interpolation, and extrapolation techniques. It produces a tagged stream that later can be used to efficiently search for videos or frames containing particular objects or people. We present detailed experiments with a prototype of our system using both stationary and mobile objects as well as GPS and ultrasound. Our experiments show that: (i) SEVA has zero error rates for static objects, except very close to the boundary of the viewable area; (ii) for moving objects or a moving camera, SEVA only misses objects leaving or entering the viewable area by 1--2 frames; (iii) SEVA can scale to 10 fast-moving objects using current sensor technology; and (iv) SEVA runs online using relatively inexpensive hardware.
Using bluetooth device names to support interaction in smart environments
Authors: Nigel Davies, Adrian Friday, Peter Newman, Sarah Rutlidge, Oliver Storz
Venue: Proceedings of the 7th international conference on Mobile systems, applications, and services (2009)

An increasing trend in mobile and pervasive computing is the augmentation of everyday public spaces with local computation - leading to so called smart environments. However, there are no well accepted techniques for supporting spontaneous interaction between mobile users and these smart environments, though a wide range of techniques have been explored ranging from gesture recognition to downloading applications to a user's phone. In this paper we explore an approach to supporting such interaction based on the use of Bluetooth Device (user-friendly) Names as a control channel between users' mobile phones and computational resources in their local environment. Such an approach has many advantages over existing techniques though it is not without limitations. Our work focuses specifically on the use of Device Names to control and customize applications on large public displays in a campus environment. This paper describes our basic approach, a number of applications that we have constructed using this technique and the results of our evaluation work which has included a range of user studies and field trials. The paper concludes with an assessment of the viability of using our approach for interaction scenarios involving mobile users and computationally rich environments.