ppxscal/embedding_network huggingface dataset:
Combining a Multiattribute Value Function with an Optimization Model: An Application to Dynamic Resource Allocation for Infrastructure Maintenance
Authors: Pekka Mild, Ahti Salo
Venue: Decision Analysis (2009)

A key decision in infrastructure management is the allocation of resources to maintenance activities that consist of periodic rehabilitation actions and routine day-to-day operations. These activities improve the quality of different assets and operations. They also differ in terms of their objectives, costs, and life-cycle characteristics; yet they all impact the same infrastructure system and compete for resources from the same budget. To support the allocation of resources to these activities, we present a generic resource allocation model that we developed for the Finnish Road Administration (Finnra) by building and interlinking (i) a preference model, which yields the aggregate value of maintenance activities by applying multiattribute value functions to the quality distributions of assets; (ii) a life-cycle model, which captures the deterioration-improvement dynamics associated with the maintenance activities; and (iii) an optimization model, which generates funding recommendations for maximizing the aggregate long-term value of maintenance investments. The optimization results were explored in facilitated workshops where “on-the-fly” computations gave senior managers insights into how the recommendations depended on preferences and budget levels. The case study was awarded for an outstanding achievement in Finnra's research program, and it was also recognized as a Finalist for the Decision Analysis Society Practice Award in 2007.
Structural correspondence learning for parse disambiguation
Authors: Barbara Plank
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop (2009)

The paper presents an application of Structural Correspondence Learning (SCL) (Blitzer et al., 2006) for domain adaptation of a stochastic attribute-value grammar (SAVG). So far, SCL has been applied successfully in NLP for Part-of-Speech tagging and Sentiment Analysis (Blitzer et al., 2006; Blitzer et al., 2007). An attempt was made in the CoNLL 2007 shared task to apply SCL to non-projective dependency parsing (Shimizu and Nakagawa, 2007), however, without any clear conclusions. We report on our exploration of applying SCL to adapt a syntactic disambiguation model and show promising initial results on Wikipedia domains.
Enabling Grid Interoperability by Extending HPC-driven Job Management with an Open Standard Information Model
Authors: Shahbaz Memon, Morris Riedel, Shiraz Memon, Achim Streit, Felix Wolf
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Many e-science applications take already advantage of numerous e-science infrastructures that evolved differently over the last couple of years. Along with this evolution, we observe still slow adoption of the Open Grid Services Architecture (OGSA) concept and thus interoperability between these infrastructures is still not seamlessly provided today. We argue that this is due to the absence of a realistically implementable reference model in Grids. In this contribution, we present our approach as one element of this reference model that focuses on the missing link between two emerging standards in the field of job management and information models in order to facilitate common open standards-based Grid interoperability.
Fast and Accurate Bessel Function Computation
Authors: John Harrison
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

The Bessel functions are considered relatively difficult to compute. Although they have a simple power series expansion that is everywhere convergent, they exhibit approximately periodic behavior which makes the direct use of the power series impractically slow and numerically unstable. We describe an alternative method based on systematic expansion around the zeros, refining existing techniques based on Hankel expansions, which mostly avoids the use of multiprecision arithmetic while yielding accurate results.
Evaluating the Social Dimension in Online Learning Communities
Authors: Francesca Pozzi
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

The social dimension is nowadays recognized as one of the main factors influencing the learning process [1, 2]. In this paper we consider the social dimension developed by a group of students during an online course. To do this, we analyze their interactions during three different collaborative learning activities, i.e. a Jigsaw, a Role Play and a Discussion. By looking at the data showing the level and nature of the social dimension developed within each activity, it is possible to compare the activities themselves, and to reflect on their capacity to foster the social dimension in light of facilitating the overall learning process.
Facts do not cease to exist because they are ignored: relativised uniform equivalence with answer-set projection
Authors: Johannes Oetsch, Hans Tompits, Stefan Woltran
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Recent research in answer-set programming (ASP) focuses on different notions of equivalence between programs which are relevant for program optimisation and modular programming. Prominent among these notions is uniform equivalence, which checks whether two programs have the same semantics when joined with an arbitrary set of facts. In this paper, we study a family of more fine-grained versions of uniform equivalence, where the alphabet of the added facts as well as the projection of answer sets is taken into account. The latter feature, in particular, allows the removal of auxiliary atoms in computation, which is important for practical programming aspects. We introduce novel semantic characterisations for the equivalence problems under consideration and analyse the computational complexity for checking these problems. We furthermore provide efficient reductions to quantified propositional logic, yielding a rapid-prototyping system for equivalence checking.
The Application Research of Concretes Biotechnics Slope
Authors: Yi-hong Zhou, Ling Song, Wen-nian Xu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Aiming at solving the difficulty in ecological treatment of high-steep slope, the paper introduces an ecological recoverytechnique-the concretes biotechnics slope (CBS), which is a comprehensive slope protection method combining shallow protection with greening. Firstly, the technological process and main materials of CBS are introduced. A series of physical , chemical, mechanical, and greening performance indexes of CBS are shownto reveal the application prospect of CBS. These indexes came from many construction projects.Finally, the paper analyzes the problem encountered in engineering practice,and puts forward some improved suggestions to promote the extension of CBS in bigger range.
Force Feedback Magnitude Effects on User's Performance during Target Acquisition: A Pilot Study
Authors: Lode Vanacken, Joan Boeck, Karin Coninx
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Only a few guidelines exist for defining the force properties in a haptic interface; as a consequence, they are mostly determined in an ad-hoc manner. We investigate how the user's performance changes during target acquisition when increasing force amplitudes are applied. Using a simple multidirectional point-select task, forces with variable amplitudes are applied to the user while traversing from one target to the other. We find that the user's performance suddenly degrades significantly, rather than decreasing progressively. This finding may be important for defining guidelines which forces may and may not be applied to a user in order to allow the haptic feedback to improve, rather than deteriorate the user's performance.
A Study on Scalable Object Replication Method for the Distributed Cooperative Storage System
Authors: Hirokazu Yoshinaga, Takeshi Tsuchiya, Hiroaki Sawano, Keiichi Koyanagi
Venue: Proceedings of the 2009 Fourth International Conference on Digital Telecommunications (2009)

Recently, a Peer-to-Peer (P2P) technology is applied for various systems because it enables to construct a system with high scalability and robustness.We have proposed a distributed cooperative storage system that can construct huge storage space by providing it on a P2P network.The storage system is based on an overlay network construction, and its hash space is created in an application layer.Each peer manages the certain range of the hash space, and an object is stored to suitable peers by using a hash value from the object.In the general P2P network, objects are replicated over many peers to achieve high availability.Some replicated methods have been proposed: objects are randomly assigned, assigned on a route path, or assigned to peers that the number of them is fixed by a network neighborhood depending on a distributed hash table.However, they are not so suitable since the scale of the network is not considered in these methods.Therefore, we propose distributed interval trees for setting the number suitably, and the availability is described with simulation.
Generalized nogoods in CSPs
Authors: George Katsirelos, Fahiem Bacchus
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

Although nogood learning in CSPs and clause learning in SAT are formally equivalent, nogood learning has not been as successful a technique in CSP solvers as clause learning has been for SAT solvers. We show that part of the reason for this discrepancy is that nogoods in CSPs (as standardly defined) are too restrictive. In this paper we demonstrate that these restrictions can be lifted so that a CSP solver can learn more general and powerful nogoods. Nogoods generalized in this manner yield a provably more powerful CSP solver. We also demonstrate how generalized nogoods facilitate learning useful nogoods from global constraints. Finally, we demonstrate empirically that generalized nogoods can yield significant improvements in performance.
Multisite Commerce: Proven Principles for Overcoming the Business, Organizational, and Technical Challenges, 1st edition
Authors: Lev Mirlas
Venue:  (2009)

Plan, Manage, and Architect Multiple Web Sites for Maximum Efficiency and Business Value For many companies, one Web site is no longer enough. Business strategy requires multiple Web sites, each with carefully targeted audiences and marketing approaches. However, managing multiple sites introduces costs and management headaches that conventional Web architectures and methodologies cant handle. In Multisite Commerce, Lev Mirlasthe architect who pioneered the concept of a shared multisite platform with IBM WebSphere Commerceintroduces best practices and methodologies for implementing and managing multiple e-commerce sites efficiently and cost-effectively. Mirlas begins by reviewing why multisite commerce is necessary and yet so challenging to execute. Next, he addresses multisite commerce from three perspectives: business, implementation, and technical. Youll learn how to plan and implement a shared platform and use it to create and operate new sites that will remarkably lower incremental cost. This books start-to-finish methodology provides a common language that everyone involved in multiple sites from executives to project managers and technical architects to site administratorscan share. Coverage includes Identifying scenarios in which multiple sites are necessary Systematically reducing the cost and complexity of establishing multiple e-commerce sites Organizing the business to effectively administer multiple sites Constructing a shared platform that makes it possible to build and deploy new sites faster than ever before Giving sites their own personalities even though they are being built on shared infrastructure Identifying the traps and landmines your project might encounter and maximizing the chances of success Managing project scope, organizational politics, and shifting executive priorities Choosing the best technical architecture pattern for your multisite scenario
Popular Matchings: Structure and Algorithms
Authors: Eric Mcdermid, Robert W. Irving
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

An instance of the popular matching problem (POP-M) consists of a set of applicants and a set of posts. Each applicant has a preference list that strictly ranks a subset of the posts. A matching M of applicants to posts is popular if there is no other matching M¿ such that more applicants prefer M¿ to M than prefer M to M¿. This paper provides a characterization of the set of popular matchings for an arbitrary POP-M instance in terms of a structure called the switching graph, a directed graph computable in linear time from the preference lists. We show that the switching graph can be exploited to yield efficient algorithms for a range of associated problems, including the counting and enumeration of the set of popular matchings and computing popular matchings that satisfy various additional optimality criteria. Our algorithms for computing such optimal popular matchings improve those described in a recent paper by Kavitha and Nasre [5].
Fuzzy defaultable bonds
Authors: Elettra Agliardi, Rossella Agliardi
Venue: Fuzzy Sets and Systems (2009)

This paper develops a structural model for defaultable bonds in a fuzzy environment. The numerical results calculated from the closed-form solution show that the fuzziness of the stochastic underlying asset and of bankruptcy costs have material impact on the term structure of credit spreads and the duration of defaultable bonds.
MADFS: The Mobile Agent-Based Distributed Network File System
Authors: Jun Lu, Bin Du, Yi Zhu, DaiWei Li
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

The conventional distributed file system is designed for LAN environment. They always play poor performance in WAN. In this paper we present a novel distributed file system: The Mobile Agent-based Distributed File System (MADFS). The objective of MADFS is to reduce the overhead of network transfer and cache management inherent to the distribution of a distributed files system in WAN. The MADFS organizes hosts into a hierarchical structure, and uses mobile agents as the underlying facility for transmission, communication and synchronization. We also present a novel cache coherency mechanism for MADFS: Hierarchical and Convergent Cache Coherency Mechanism (HCCM). HCCM can effectively reduce the overhead of cache coherency management in distributed file system. In this paper, we also build an analysis model for HCMM and compare the performance to single-layer mode. The comparing results show that HCMM has better performance in WAN. In conclusion, MADFS can achieve better performance and availability than conventional distributed file system in WAN.
Illuminating trouble tickets with sublanguage theory
Authors: Svetlana Symonenko, Steven Rowe, Elizabeth D. Liddy
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

A study was conducted to explore the potential of Natural Language Processing (NLP)-based knowledge discovery approaches for the task of representing and exploiting the vital information contained in field service (trouble) tickets for a large utility provider. Analysis of a subset of tickets, guided by sublanguage theory, identified linguistic patterns, which were translated into rule-based algorithms for automatic identification of tickets' discourse structure. The subsequent data mining experiments showed promising results, suggesting that sublanguage is an effective framework for the task of discovering the historical and predictive value of trouble ticket data.
Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry
Authors: Karthekeyan Chandrasekaran, Amit Deshpande, Santosh Vempala
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

Efficient sampling, integration and optimization algorithms for logconcave functions [BV04, KV06, LV06a] rely on the good isoperimetry of these functions. We extend this to show that ¿ 1/(n ¿ 1)-concave functions have good isoperimetry, and moreover, using a characterization of functions based on their values along every line, we prove that this is the largest class of functions with good isoperimetry in the spectrum from concave to quasi-concave. We give an efficient sampling algorithm based on a random walk for ¿ 1/(n ¿ 1)-concave probability densities satisfying a smoothness criterion, which includes heavy-tailed densities such as the Cauchy density. In addition, the mixing time of this random walk for Cauchy density matches the corresponding best known bounds for logconcave densities.
Production Monitoring System of Coning, Drawing and Twisting Workshop Based on LAN
Authors: Yonggang Li, Jingfeng Shao, Haiming Li, Jie Xu
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

To improve work efficiency of the coning, drawing and twisting workshop, reduce labor cost of the textile enterprise, on-line monitoring and control of production yield and machine operating status become very important. According to the information construction requirements of the textile enterprise, firstly, we set up the structure frame diagram through LAN, adapt network distributed structure based C/S mode, and implement a production information monitoring system. Secondly, we illustrate the system’s software management functions, logical and physical structure of the database and data collection technology, optimize data collection technology and communication protocol. Thirdly, we elaborate some key technique difficulties, and put forward many solutions by applying with a lot of the related theories and technologies. As proved by practice, the main management functions of system raise the workshop’s work efficiency, reduce the enterprise’s labor cost, realize remote on-line monitoring of the clients, and achieve networking management of the production information.
Growth Condition and Degradation Dynamics of p-Chloroaniline Degrading Strain
Authors: Cheng Ding, Zhaoxia Li, Zhicheng Zhang, Qian Yu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Growth condition of p-chloroaniline (p-CA) degrading Bacillus licheniformis named strain ycsd02 which was isolated from rhizosphere soil in phragmites wetland and stored in our labrary was studied. The result showed that the optimal culture temperature, culture pH value anddissolved oxygen for satisfactory cells growth were about 37℃, pH7.2 and 4 mg•L-1 in LB liquid medium. Growth of strain ycsd02 cells was inhibited by p-CA at the concentration up to 200 mg•L-1. The biodegradation of p-CA by ycsd02 cells had a cuttylag phase at initial concentrations more than 40 mg•L-1 while no lag phase at concentrations less than 40 mg•L-1. Results could offer useful information for the application of strain ycsd02 in bioremediation.
Jazzyk: A Programming Language for Hybrid Agents with Heterogeneous Knowledge Representations
Authors: Peter Novák
Venue: Programming Multi-Agent Systems: 6th International Workshop, ProMAS 2008, Estoril, Portugal, May 13, 2008. Revised Invited and Selected Papers (2009)

Different knowledge representation tasks require different knowledge representation techniques. Agent designers should therefore be able to easily exploit benefits of various knowledge representation technologies in a single agent system.I describe here a modular agent programming language Jazzyk based on the programming framework of Behavioural State Machines (BSM). BSM framework, and thus also Jazzyk, draws a strict distinction between a knowledge representational and a behavioural level of an agent program. It supports a high degree of modularity w.r.t. employed KR technologies, and at the same time provides a clear and concise semantics.
Complexity boundaries for horn description logics
Authors: Markus Krötzsch, Sebastian Rudolph, Pascal Hitzler
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Horn description logics (Horn-DLs) have recently started to attract attention due to the fact that their (worst-case) data complexities are in general lower than their overall (i.e. combined) complexities, which makes them attractive for reasoning with large ABoxes. However, the natural question whether Horn-DLs also provide advantages for TBox reasoning has hardly been addressed so far. In this paper, we therefore provide a thorough and comprehensive analysis of the combined complexities of Horn-DLs. While the combined complexity for many Horn-DLs turns out to be the same as for their non-Horn counterparts, we identify subboolean DLs where Hornness simplifies reasoning.
Integrating high precision rules with statistical sequence classifiers for accuracy and speed
Authors: Wenhui Liao, Marc Light, Sriharsha Veeramachaneni
Venue: Proceedings of the Workshop on Software Engineering, Testing, and Quality Assurance for Natural Language Processing (2009)

Integrating rules and statistical systems is a challenge often faced by natural language processing system builders. A common subclass is integrating high precision rules with a Markov statistical sequence classifier. In this paper we suggest that using such rules to constrain the sequence classifier decoder results in superior accuracy and efficiency. In a case study of a named entity tagging system, we provide evidence that this method of combination does prove efficient than other methods. The accuracy was the same.
Characterization and Biological Treatment of O-Nitrobenzaldehyde Manufacturing Wastewater
Authors: Yu Fang-Bo, Guan Li-Bo, Zhou Shan, Li Shun-Peng
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

O-nitrobenzaldehyde (ONBA) manufacturing wastewater not only contains significant amount of oil-like substance, but also high salinity, total nitrogen (TN) content and concentration of dissolved organics resulting in high COD load. Oil-like substance could be removed from the wastewater by physical methods. However, dissolved COD compounds and TN could only be removed by biological or chemical treatments. Effluent from physical treatment stage was characterized. After characterization and nutrient balancing of the wastewater, an activated sludge unit was used in laboratory to investigate the effects of major process variables, such as sludge age (SRT) and hydraulic residence time (HRT), on performance of the system. The optimal 86% of COD and 40.9% of TN removal efficiencies were obtained at a SRT of 16 days and HRT of 12 hours. By using the experimental data, kinetic coefficients were determined and design equations were developed.