ppxscal/embedding_network huggingface dataset:
A quadratic lower bound for the permanent and determinant problem over any characteristic ≠ 2
Authors: Jin-Yi Cai, Xi Chen, Dong Li
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

In Valiant's theory of arithmetic complexity, the classes VP and VNP are analogs of P and NP. A fundamental problem concerning these classes is the Permanent and Determinant Problem: Given a field F of characteristic ≠2, and an integer n, what is the minimum m such that the permanent of an n x n matrix X=(xij) can be expressed as a determinant of an m x m matrix, where the entries of the determinant matrix are affine linear functions of xij's, and the equality is in F [X]. Mignon and Ressayre (2004) [11] proved a quadratic lower bound m=Ω(n2) for fields of characteristic 0. We extend the Mignon-Ressayre quadratic lower bound to all fields of characteristic ≠2.
How database and XML can be used to master UML models, an investigationa
Authors: Samuel Sambasivam, Philippe Crefcoeur
Venue: Journal of Computing Sciences in Colleges (2008)

Nowadays, it is nearly impossible to bypass modelling, or perhaps in the case of a single-person project. In all system-engineering projects, the accessibility to the information remains the corner stone of the success. UML (Unified Modeling Language) has become the standard modelling notation for software development. Most UML modeling tools are quite good during the code generation phase but have limited introspective capabilities. Databases have extended query capacities and could be a remedy to the querying limitation of UML modeling tools. The paper discusses the conversion process of a project developed in a UML design tool to a database using XML (eXtensible Markup Language) file. This latest is compliant with the XMI (XML Metadata Interchange) standard as transfer medium. Lastly it suggests that the databases certainly offer a perfect complement to UML modeling tools in the field of information retrieval. However the whole process needed to allow the querying of UML data from a database is not trivial and is time consuming.
The application of fuzzy logic to the precautionary principle
Authors: Mirit Shamir, Lior Shamir, Mary H. Durfee
Venue: Artificial Intelligence and Law (2007)

One of the major problems in the implementation of the precautionary principle in environmental cases is the estimation of the weight of evidence. In this paper we propose a formal method that determines the weight of evidence based on the specific parameters of a given case. The proposed method is based on an artificial intelligence approach called fuzzy logic, which is commonly used as an interface between logic and human perception, and often applied to computer-based complex decision making. We use one fuzzy expert system that provides a quantification of the estimated environmental damage, and a second fuzzy expert system that computes the weight of evidence in a given case. The proposed expert system can be easily defined and adjusted by regulators and environmental science and policy experts.
Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
Authors: E. Kaltofen, B. Trager
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

Algorithms are developed that adopt a novel implicit representation for multivariate polynomials and rational functions with rational coefficients, that of black boxes for their evaluation. It is shown that within this evaluation-box representation, the polynomial greatest common divisor and factorization problems as well as the problem of extracting the numerator and denominator of a rational function can be solved in random polynomial time in the usual parameters. Since the resulting evaluation programs for the goal polynomials can be converted efficiently to sparse format, solutions to sparse problems such as the sparse ration interpolation problem follow as a consequence.
Optimal experiment design for the study of thermal destruction
Authors: Aleksey V. Nenarokomov, Dmitriy M. Titov, Eugene Artioukhin
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

Results are presented in the work on mathematical modeling with respect to a simultaneous determining of the emissivity and thermal effect of sublimation for thermal insulating material as functions of temperature. Optimal experiment design based on influence of the external heat fluxes and some other parameters to the accuracy of the considered inverse problems solution has been studied.
Current Situation of Digitalized Ship Navigation System for Safety
Authors: Nobuhiro Sawano
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Automatic Identification System (AIS) has to be on board in every ship over 500 gross tonnages (GT) in Japan from July 1, 2008. This is a response of amendment of maritime relating laws in accordance with SOLAS (International Convention for the Safety of Life at Sea) Convention and IMO (International Maritime Organization) requires all ships over 500 GT or upward are fitted with ship borne AIS. AIS is a system which makes it possible to get precise on-line information from a large area about ships and their movements. AIS is based on a ship borne radio wave of VHF, it continuously and automatically transmits fixed, dynamic and voyage-related information and receives corresponding information from other ships near by. VTS (Vessel Transport Service) is provided by collection of AIS information from ships. Most of the VTS stations around the area of Gulf of Finland have equipped with coastal surveillance system with radar for early warnings to endangering ships. Combinations of AIS and VTS, in addition, practical lane-separation system have also been activated under international agreement of Russia, Estonia and Finland. These three systems are well combined and organised then significant effects of reducing risks of ship borne accidents have been observed. Practices of Gulf of Finland should be introduced other congested sea lanes.
Variational imbedding approach to coefficient identification in an elliptic partial differential equation
Authors: C. I. Christov, T. T. Marinov, R. S. Marinova
Venue: International Journal of Computational Science and Engineering (2007)

We consider the inverse problem for identification of the coefficient in an elliptic partial differential equation inside the unit square D, with overposed boundary data. This problem is not investigated enough in the literature due to the lack of results about the uniqueness of the inverse problem. Following the main idea of the so-called Method of Variational Imbedding, we imbed the solution of the inverse problem into the elliptic Boundary Value Problem (BVP) stemming from the necessary conditions for minimisation of the quadratic functional of the original equation. The system contains a well-posed fourth-order BVP for the sought function and an explicit equation for the unknown coefficient. We solve imbedding BVP numerically by making use of operator-splitting for the fourth-order BVP. The convergence and stability of the numerical method are established. We introduce an effective way for finding the best approximation for the coefficient. Featuring examples are elaborated numerically.
Directed transmission method, a fully asynchronous approach to solve sparse linear systems in parallel
Authors: Fei Wei, Huazhong Yang
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

There are many algorithms to solve large sparse linear systems in parallel; however, most of them acquire synchronization and thus are lack of scalability. In this paper, we propose a new distributed numerical algorithm, called Directed Transmission Method (DTM). DTM is a fully asynchronous, scalable and continuous-time iterative algorithm to solve the arbitrarily-large sparse linear system whose coefficient matrix is symmetric-positive-definite (SPD). DTM is able to be freely running on the heterogeneous parallel computer with arbitrary number of processors, which might be manycore microprocessors, clusters, grids, clouds, and the Internet. We proved that DTM is convergent by making use of the final value theorem of Laplacian Transformation. Numerical experiments show that DTM is efficient.
Gaps-fill of SLC-off Landsat ETM+ satellite image using a geostatistical approach
Authors: C. Zhang, W. Li, D. Travis
Venue: International Journal of Remote Sensing (2007)

Using appropriate techniques to fill the data gaps in SLC-off ETM+ imagery may enable more scientific use of the data. The local linear histogram-matching technique chosen by USGS has limitations if the scenes being combined exhibit high temporal variability and radical differences in target radiance due, for example, to the presence of clouds. This study proposes using an alternative interpolation method, the kriging geostatistical technique, for filling the data gaps. The case study shows that the ordinary kriging techniques may provide a powerful tool for interpolating the missing pixels in the SLC-off ETM+ imagery. While the standardized ordinary cokriging has been shown to be particularly useful when samples of the variable to be predicted are sparse and samples of a second, related variable are plentiful, the case study demonstrates that it provides little improvement in interpolating the data gap in the SLC-off imagery.
A Markovian extension of Valiant's learning model
Authors: D. Aldous, U. Vazirani
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

A model of learning that expands on the Valiant model is introduced. The point of departure from the Valiant model is that the learner is placed in a Markovian environment. The environment of the learner is a (exponentially large) graph, and the examples reside on the vertices of the graph, one example on each vertex. The learner obtains the examples while performing a random walk on the graph. At each step, the learning algorithm guesses the classification of the example on the current vertex using its current hypothesis. If its guess is incorrect, the learning algorithm updates its current working hypothesis. The performance of the learning algorithm in a given environment is judged by the expected number of mistakes made as a function of the number of steps in the random walk. The predictive value of Occam algorithms under this weaker probabilistic model of the learner's environment is studied.
Sedtrans05: An improved sediment-transport model for continental shelves and coastal waters with a new algorithm for cohesive sediments
Authors: Urs Neumeier, Christian Ferrarin, Carl L. Amos, Georg Umgiesser, Michael Z. Li
Venue: Computers Geosciences (2008)

The one-dimensional (vertical) sediment-transport model SEDTRANS96 has been upgraded to predict more accurately both cohesive and non-cohesive sediment transport. Sedtrans05 computes the bed shear stress for a given set of flow and seabed conditions using combined wave-current bottom boundary layer theory. Sediment transport (bedload and total load) is evaluated using one of five methods. The main modifications to the original version of the model are: (1) a reorganization of the code so that the computation routines can be easily accessed from different user interfaces, or may be called from other programs; (2) the addition of the Van Rijn method to the options for non-cohesive sediment transport; (3) the computation of density and viscosity of water from temperature and salinity inputs; and (4) the addition of a new cohesive sediment algorithm. This latter algorithm introduces variations of sediment properties with depth, represents the suspended sediment as a spectrum of settling velocities (i.e. size classes), includes the flocculation process, and models multiple erosion-deposition cycles. The new model matches slightly better the field measurements of non-cohesive sediment transport, than does the predictions by SEDTRANS96. The sand-transport calibration has been extended to high transport rates. The cohesive sediment algorithm reproduced well experimental data from annular flume experiments.
Fully decentralized emulation of best-effort and processor sharing queues
Authors: Rade Stanojevi, Robert Shorten
Venue: Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2008)

Control of large distributed cloud-based services is a challenging problem. The Distributed Rate Limiting (DRL) paradigm was recently proposed as a mechanism for tackling this problem. The heuristic nature of existing DRL solutions makes their behavior unpredictable and analytically untractable. In this paper we treat the DRL problem in a mathematical framework and propose two novel DRL algorithms that exhibit good and predictable performance. The first algorithm Cloud Control with Constant Probabilities (C3P) solves the DRL problem in best effort environments, emulating the behavior of a single best-effort queue in a fully distributed manner. The second problem we approach is the DRL in processor sharing environments. Our algorithm, Distributed Deficit Round Robin (D2R2), parameterized by parameter α, converges to a state that is, at most, O(1/α) away from the exact emulation of centralized processor sharing queue. The convergence and stability properties are fully analyzed for both C3P and D2R2. Analytical results are validated empirically through a number of representative packet level simulations. The closed-form nature of our results allows simple design rules which, together with extremely low communication overhead, makes the presented algorithms practical and easy to deploy.
A parallel algorithm for large systems of Volterra integral equations of Abel type
Authors: G. Capobianco, A. Cardone
Venue: Journal of Computational and Applied Mathematics (2008)

A significative number of recent applications require numerical solution of large systems of Abel-Volterra integral equations. Here we propose a parallel algorithm to numerically solve a class of these systems, designed for a distributed-memory MIMD architecture. In order to achieve a good efficiency we employ a fully parallel and fast convergent waveform relaxation (WR) method and evaluate the lag term by using FFT techniques. To accelerate the convergence of the WR method and to best exploit the parallel architecture we develop special strategies. The performances of the resulting code, NSWR4, are illustrated on some examples.
Physiology-based affect recognition for computer-assisted intervention of children with Autism Spectrum Disorder
Authors: Changchun Liu, Karla Conn, Nilanjan Sarkar, Wendy Stone
Venue: International Journal of Human-Computer Studies (2008)

Generally, an experienced therapist continuously monitors the affective cues of the children with Autism Spectrum Disorders (ASD) and adjusts the course of the intervention accordingly. In this work, we address the problem of how to make the computer-based ASD intervention tools affect-sensitive by designing therapist-like affective models of the children with ASD based on their physiological responses. Two computer-based cognitive tasks are designed to elicit the affective states of liking, anxiety, and engagement that are considered important in autism intervention. A large set of physiological indices are investigated that may correlate with the above affective states of children with ASD. In order to have reliable reference points to link the physiological data to the affective states, the subjective reports of the affective states from a therapist, a parent, and the child himself/herself were collected and analyzed. A support vector machines (SVM)-based affective model yields reliable prediction with approximately 82.9% success when using the therapist's reports. This is the first time, to our knowledge, that the affective states of children with ASD have been experimentally detected via physiology-based affect recognition technique.
The effects from technology-mediated interaction and openness in virtual team performance measures
Authors: M. Workman
Venue: Behaviour & Information Technology (2007)

As globalisation continues concurrent with mergers and acquisitions, transnational organisations are increasingly turning to the use of virtual teams in which members collaborate through technology-mediated interaction. Although collocated teams and virtual teams share many common characteristics including performance measures, the nature of the environments differ along several dimensions. In particular, members of virtual teams cooperate on global projects while resident in their home geographies and cultures and using various technologies to facilitate. From that context, this field study investigated virtual team performance using organisational culture as a framework.
Resource Placement in Cube-Connected Cycles
Authors: Paria Moinzadeh, Hamid Sarbazi-Azad, Nasser Yazdani
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

In large systems, economical and efficiency concerns restrict the allocation of each resource to every node in the network. Therefore, it is desirable to distribute copies of resource in order to share them and achieve a certain performance measure. In this paper, we consider the problem of distributing resources in Cube-Connected Cycles. Both adjacency and distant placements are considered in this paper. In adjacency placements, dominating sets and perfect dominating sets are used. The proposed algorithms for distant placements use known placements for basic hypercube graphs. Therefore, in these placements we avoid the additional costs needed for deploying the network. We prove that the presented algorithms provide an optimum result for Cube-Connected Cycles.
New and Improved Models for All Stages in Full ECF Bleaching Sequences of Softwoods and Hardwoods
Authors: Sandeep Jain, Gérard Mortha, Christophe Calais
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

This study presents new and improved semi-empirical mathematical models for all the chlorine dioxide stages and extraction stages (including oxygen and/or peroxide reinforced) incorporated in a full Elemental Chlorine Free (ECF) bleaching sequence simulator developed in EFPG. The simulator predicts variations of Kappa number, pH, brightness, bleaching chemical consumption and COD at each step of multistage ECF bleaching sequences. The first purpose of this work was to improve kinetic and stoichiometric equations, involved in the chlorine dioxide stages (Do, D1, D2), for their predictability for different kinds of softwood and hardwood pulps. The second purpose was to model the extraction stages with or without oxygen and/or hydrogen peroxide reinforcement (E, EO, EOP, EP). The results predicted fit very closely to a wide range of laboratory and mill bleaching data and the predictability was extended to a greater variety of pulps (softwoods and hardwood pulps, kraft or other alkaline pulps).
Making e-Government systems workable: Exploring the evolution of frames
Authors: Bijan Azad, Samer Faraj
Venue: The Journal of Strategic Information Systems (2008)

As with other IT projects, implementing workable e-Government systems requires bringing together different stakeholders and bridging their perspectives during implementation. These perspectives often take the form of competing technology frames consisting of differentiated beliefs, interests, technology evaluation routines and artifact characteristics that need to be recognized and reconciled in order to make e-Government systems workable. Prior research, while recognizing the importance of frame evolution in making systems workable, has rarely described the underlying processes. This paper builds on a 10-year e-Government implementation to describe and analyze the processes of frame evolution-namely, frame differentiation, frame adaptation, and frame stabilization-that can help translate and reconcile competing frames into a truce frame. The examined properties of these specific processes are described and their dynamics are analyzed, thereby extending the e-Government implementation literature through a deeper understanding of frame evolution processes.
Peer-to-Peer AOI voice chatting for massively multiplayer online games
Authors: Jehn-Ruey Jiang, Hung-Shiang Chen
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

In recent years, massively multiplayer online games (MMOGs) have become more and more popular. Many techniques have been proposed to enhance the experience of using MMOGs, such as realistic graphics, vivid animations, and player communication tools, etc. However, in most MMOGs, communication between players is still based on text, which is unnatural and inconvenient. In this paper, we propose the concept of AOI voice chatting for MMOGs. The term AOI stands for the area of interest; a player in the MMOG only pays attention to his/her AOI. By AOI voice chatting, a player can easily chat by voice with other plays in the AOI. This improves the way players communicate with one another and provides a more realistic virtual environment. We also propose two peer-to-peer schemes, namely QuadCast and SectorCast, to achieve efficient AOI voice chatting for MMOGs. We perform simulation experiments to show that the proposed schemes have reasonable end-to-end delay and affordable bandwidth consumption.
A maximum entropy analysis of global monthly series of rainfall from merged satellite data
Authors: F. J. Tapiador
Venue: International Journal of Remote Sensing (2007)

This Letter presents the results of analysing a global, satellite-based monthly precipitation database on a 2.5° latitude-longitude grid for the 22-year period from 1979 to 2001 using a direct maximum entropy spectral analysis method. The NOAA Climate Prediction Center (CPC) Merged Analysis of Precipitation (CMAP) database is used to calculate the rainfall cycles for ∼10 000 time series covering the whole Earth. It is shown that several cycles other than the annual or seasonal cycles affect the rainfall distribution of many areas, in particular western Europe.
Face bubble: photo browsing by faces
Authors: Jun Xiao, Tong Zhang
Venue: Proceedings of the working conference on Advanced visual interfaces (2008)

Face recognition technology presents an opportunity in computer automation to help people better organize their personal photo collections. However, the robustness of the technology needs to improve and how users interact with face clusters needs to go beyond the traditional file folder metaphor. We designed a visualization called face bubble that supports both fast one-glance view and filtering and exploration of photo collections based on face clustering results. Our clustering algorithm provides a better accuracy rate than previous work and our circular space filling visual design offers an alternative UI based on the traditional weighted list view. Other visualization techniques such as a fisheye view are also integrated into the interface for fast image browsing. Finally, fine tuning of the design based on user feedback improved the aesthetics of the visualization.