ppxscal/embedding_network huggingface dataset:
Minmax Tree Cover in the Euclidean Space
Authors: Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

Let G&thinsp;=&thinsp;(V,E) be an edge-weighted graph, and let w(H) denote the sum of the weights of the edges in a subgraph H of G. Given a positive integer k, the balanced tree partitioning problem requires to cover all vertices in V by a set $\mathcal{T}$ of k trees of the graph so that the ratio &alpha; of $\max_{T\in \mathcal{T}}w(T)$ to w(T *)/k is minimized, where T * denotes a minimum spanning tree of G. The problem has been used as a core analysis in designing approximation algorithms for several types of graph partitioning problems over metric spaces, and the performance guarantees depend on the ratio &alpha; of the corresponding balanced tree partitioning problems. It is known that the best possible value of &alpha; is 2 for the general metric space. In this paper, we study the problem in the d-dimensional Euclidean space ℝ d , and break the bound 2 on &alpha;, showing that $\alpha <2\sqrt{3}-3/2 \fallingdotseq 1.964$ for d&thinsp;&ge;&thinsp;3 and $\alpha <(13 + \sqrt{109})/12 \fallingdotseq 1.953$ for d&thinsp;=&thinsp;2. These new results enable us to directly improve the performance guarantees of several existing approximation algorithms for graph partitioning problems if the metric space is an Euclidean space.
Rater Credibility Assessment in Web Services Interactions
Authors: Zaki Malik, Athman Bouguettaya
Venue: World Wide Web (2009)

We investigate the problem of establishing trust in service-oriented environments. The focus is on providing an infrastructure for evaluating the credibility of raters in a reputation-based framework that would enable trust-based Web services interactions. The techniques we develop aid a service consumer in assigning an appropriate weight to the testimonies of different raters regarding a prospective service provider. The experimental analysis show that the proposed techniques successfully dilute the effects of malicious ratings, thereby facilitating accurate and fair assessment of the providers' reputations.
The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis
Authors: Heribert Vollmer
Venue: Theory of Computing Systems (2008)

We study the complexity of the following algorithmic problem: Given a Boolean function f and a finite set of Boolean functions B, decide if there is a circuit with basis B that computes&#x00a0;f. We show that if both f and all functions in B are given by their truth-table, the problem is in quasipolynomial-size AC0, and thus cannot be hard for AC0(2) or any superclass like NC1, L, or&#x00a0;NL. This answers an open question by Bergman and Slutzki (SIAM J.&#x00a0;Comput., 2000). Furthermore we show that, if the input functions are not given by their truth-table but in a succinct way, i.e., by circuits (over any complete basis), the above problem becomes complete for the class coNP.
Experimental analysis on Sarsa(&lambda;) and Q(&lambda;) with different eligibility traces strategies
Authors: Jinsong Leng, Colin Fyfe, Lakhmi C. Jain
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2009)

Temporal difference learning and eligibility traces are two mechanisms for solving reinforcement learning problems. The temporal difference technique bootstraps the state value or state-action value at every step as with dynamic programming, and learns by sampling episodes from experience as in the Monte Carlo approach. Eligibility traces is a mechanism that offers a means for recording the degree of which state is eligible for undergoing learning process. This paper aims to investigate the underlying mechanism of eligibility traces strategies using on-policy and off-policy learning algorithms. In doing so, the performance metrics can be obtained by defining the learning problem in a simulation environment, in conjunction with different learning algorithms. However, measuring learning performance and analysing sensibility are very expensive because such performance metrics can only be obtained by running an experiment with different parameter values. This paper proposes a comparative study for analysing the mechanism of eligibility traces. The objective of this paper is to compare and investigate the influences on performance caused by those different approaches.
Implementing Decisional Trust: A FIRST APPROACH FOR SMART RELIABLE SYSTEMS
Authors: Cesar Sanin, Edward Szczerbicki
Venue: Cybernetics and Systems (2009)

In this article, we introduce the necessary elements that must be integrated in order to achieve a decisional technology that is trustworthy. Thus, we refer to such technology as decisional trust. For us, decisional trust can be achieved through the use of elements such as the decisional DNA, reflexive ontologies, and security models; and therefore, we present in this article a framework that was used for the implementation of a decisional trust system.
Optimisation of garment design using fuzzy logic and sensory evaluation techniques
Authors: Y. Chen, X. Zeng, M. Happiette, P. Bruniaux, R. Ng, W. Yu
Venue: Engineering Applications of Artificial Intelligence (2009)

The ease allowance is an important criterion in garment design. It is often taken into account in the process of construction of garment patterns. However, the existing pattern generation methods cannot provide a suitable estimation of ease allowance, which is strongly related to wearer's body shapes and movements and used fabrics. They can only produce 2D patterns for fixed standard values of ease allowance. In this paper, we present a new method for optimizing the estimation of ease allowance of a garment using fuzzy logic and sensory evaluation. Based on the optimized values of ease allowance generated from fuzzy models related to different key body positions and different wearer's movements, we obtain an aggregated ease allowance using the OWA operator. This aggregated result can further improve the wearer's fitting perception of a garment and adjust the compromise between the style of garments and the fitting comfort sensation of wearers. The related weights of the OWA operator are determined according to designer's linguistic criteria on comfort and garment style. The effectiveness of our method has been validated in the design of trousers of jean type. It can be also applied for designing other types of garment.
An Algorithm for Sophisticated Code Matching in Logic Programs
Authors: Wim Vanhoof, François Degrave
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

In this work in progress, we develop a program analysis capable of efficiently detecting duplicated functionality within a logic program or a set of logic programs. Our main motivation is to provide an analysis that allows to automatically spot those locations in a program where a transformation could be applied that removes the duplication from the source code.
Interaction criticism and aesthetics
Authors: Jeffrey Bardzell
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

As HCI becomes more self-consciously implicated in cul-ture, theories from cultural studies, in particular aesthetics and critical theory, are increasingly working their way into the field. However, the use of aesthetics and critical theory in HCI remains both marginal and uneven in quality. This paper explores the state of the art of aesthetics and critical theory in the field, before going on to explore the role of these cultural theories in the analysis and deployment of the twin anchors of interaction: the user and the artifact. In concludes with a proposed mapping of aesthetics and criti-cal theory into interaction design, both as a practice and as a discipline.
Make new friends, but keep the old: recommending people on social networking sites
Authors: Jilin Chen, Werner Geyer, Casey Dugan, Michael Muller, Ido Guy
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

This paper studies people recommendations designed to help users find known, offline contacts and discover new friends on social networking sites. We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3,000 users. We found all algorithms effective in expanding users' friend lists. Algorithms based on social network information were able to produce better-received recommendations and find more known contacts for users, while algorithms using similarity of user-created content were stronger in discovering new friends. We also collected qualitative feedback from our survey users and draw several meaningful design implications.
Fuzzy description logics under Gödel semantics
Authors: Fernando Bobillo, Miguel Delgado, Juan Gómez-Romero, Umberto Straccia
Venue: International Journal of Approximate Reasoning (2009)

Classical ontologies are not suitable to represent vague pieces of information, which has lead to the birth of Fuzzy Description Logics as an appropriate formalism to represent this type of knowledge. Different families of fuzzy operators lead to Fuzzy Description Logics with different properties. This paper studies Fuzzy Description Logics under a semantics given by the Godel family of fuzzy operators. We investigate some logical properties and show the decidability of a fuzzy extension of the logic SROIQ, theoretical basis of the language OWL 1.1, by providing a reasoning preserving procedure to obtain a crisp representation for it. Additionally, we show how to represent some types of concept and role modifiers.
Application of the nelder-mead optimization in ray-tracing in the determination of satellite location
Authors: Siti Sarah Nik Zulkifli, Mardina Abdullah, Azami Zaharim, Mahamod Ismail
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

The Earth's ionosphere plays a crucial role in Global Positioning System (GPS) accuracy because this layer can lead to errors in positioning exceeding 100m. The ionosphere contains free electrons which have the effect of slowing down GPS code measurements relative to the velocity that they would travel in a vacuum or free space. The problem occurs in the determining the GPS signal path from a particular satellite location to the receiver on Earth (or vice versa) as the signals are not constant and depends on the randomness of the propagation medium. The purpose of this paper is to show the application of the Nelder-Mead optimization algorithm in Ray-Tracing in the determination of satellite location. The initial elevation and azimuth are automatically adjusted to find the path and to get the final position of the ray that arrives exactly at the receiver location. This is then compared with the real position of the satellite. Results show that Nelder-Mead optimization algorithm can be used for satellite or receiver location finding and home-in the signals exactly to the satellite location.
One very particular example of a congruence-simple semiring
Authors: Václav Flaška
Venue: European Journal of Combinatorics (2009)

The existence of a congruence-simple semiring S with non-constant multiplication such that 2s=3t for all s,t∈S and S+S=S is proved and hence the most enigmatic class of congruence-simple semirings is not empty.
Personalizing CS1 with robots
Authors: Jay Summet, Deepak Kumar, Keith O'Hara, Daniel Walker, Lijun Ni, Doug Blank, Tucker Balch
Venue: ACM SIGCSE Bulletin (2009)

We have developed a CS1 curriculum that uses a robotics context to teach introductory programming [1]. Core to our approach is that each student has their own personal robot. Our robot and software have been specifically developed to support the needs of a CS1 curriculum. We frame traditional problems (robot control) in terms that are personal, relevant, and fun. Initial trial classes have shown that our approach is successful and adaptable.
Reduction of Noise in Image Data Using Spatial Constraints-based Centroid Neural Network
Authors: Dong-Chul Park
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

A noise deduction method for image data by using Centroid Neural Network (CNN) is proposed in this paper. The spatial constraints are applied to Neural Network(CNN) algorithm to reduce noise in image data. The proposed algorithm incorporates a novel approach of using the weights of attributes to evaluate the roles of the latter. Experiments and results on a set of synthetic data show that the proposed algorithm provides superior performance over other algorithms such as FuzzyC-Means(FCM)and Fuzzy C-Means with spatial constraints(FCM-S)
Designing Project-Based Courses with a Focus on Group Formation and Assessment
Authors: Debbie Richards
Venue: ACM Transactions on Computing Education (TOCE) (2009)

The value and the pitfalls of project and group work are well recognized. The principles and elements which apply to projects in general, apply to project-based courses. Thoughtful and detailed planning, understanding of the stakeholders and their needs, a good design, appropriate testing, monitoring and quality control and continual management can maximize the benefits and minimize the negatives. In this article we draw together the literature to consider key design choices of project-based courses considering: type, length, size, management, participants, and content with a particular focus on the composition of groups and the issues surrounding assessment.
Structure Design and Simulation Analysis of the Double Meshing Gear Motor
Authors: Ruihua Li, Shimin Wei, Qizheng Liao, Zhensong Ni
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

As the development of robot technology and automation etc., the motor has been required for more torque and less volume. This paper presents a type of low speed and high torque motor ——a double meshing motor with new structure and new principle integrating the reduction gear which can be applied in robot joint and meets the need of space endurance and space fitness of robot. Compared with conventional motors, the noticeable features of this motor are short drive chain, high respond speed, stability at low speed, big output torque. For the reason of using two rotors, the eccentric force and operation vibration induced by the eccentric motion of rotors can be balanced and decreased efficiently. Additionally, the operation principle and mechanism characteristics of this new motor are introduced, and a solid model is designed. As for the control method, it is simple and same as the switched reluctance motor. The magnetic circuit model of this motor is established, and this model is applied to analysis the features of motor as well as the finite element analysis is also figured out. The coenergy principle is used to calculate the starting torque of the motor. For verifying the calculation, the results of finite element analysis is adopted to compare with the results calculated by magnetic coenergy method. Based on these results of calculation and finite element analysis simulation, the double meshing motor has higher torque and lower speed compare with the conventional motor has the same volume; it is evident that the double meshing gear motor has application prospect and practical value.
NETQOS Policy Management Architecture for Flexible QoS Provisioning in Future Internet
Authors: P. A. Aranda Gutierrez, I. Miloucheva, D. Wagner, Ch. Niephaus, A. Flizikowski, N. Van Wambeke, F. Armando, Ch. Chassot, S. Pietro Romano
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

This paper is focussed on the NETQOS architecture for automated QoS policy provisioning, which can be used in Future Internet scenarios by the different actors (i.e. network operators, service providers, and users) for flexible QoS configuration over combinations of mobile, fixed, sensor and broadcast networks. The NETQOS policy management architecture opens the possibility to specify QoS policies on a "business" level using ontology descriptions and policy management interfaces, which are specific to the actors. The business level policy specifications are translated by the NETQOS system into intermediate and operational QoS policies for automated QoS configuration at the managed heterogeneous network and transport entities. NETQOS allows QoS policy specification and dependency analysis considering Service Level Agreements (SLAs) between the actors, as well as automated policy provisioning and adaptation. The interaction of the NETQOS components is based on a common policy repository. The particular focus of the paper is aimed to discuss ontology and actor oriented QoS policy specification and configuration for heterogeneous networks, as well as NETQOS QoS policy management interfaces at business level and automated translation of business QoS policies to intermediate and operational policy level.
Event-Clock Visibly Pushdown Automata
Authors: Nguyen Tang, Mizuhito Ogawa
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

We introduce the class of event-clock visibly pushdown automata (ECVPAs) as an extension of event-clock automata. The class of ECVPAs, on one hand, can model simple real-time pushdown systems and, on the other hand, is determinizable and closed under Boolean operations. We also show that for a timed visibly pushdown automaton A and an ECVPA B, the inclusion problem L(A)&thinsp;&sube;&thinsp;L(B) is decidable.
Solving Undersampled Problem of LDA Using Gram-Schmidt Orthogonalization Procedure in Difference Space
Authors: Yunhui He
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In this paper, we propose an efficient and effective method to solve undersampled problem of linear discriminant analysis (LDA) by performing orthogonalization procedure only once in the difference space. Since in the proposed method, the optimal discriminant vectors are immediately obtained by performing orthogonalization procedure once on difference vectors, the efficiency is improved greatly compared with the existing methods. In terms of performance of classification, the proposed method is equivalent to existing LDA methods since these methods search optimal discriminative vectors of LDA in range space of total scatter matrix St and null space of within-class scatter matrix Sw. However, in terms of real-time performance, the proposed method is superior to the existing methods. The effectiveness of the proposed method is verified in the experiments on three standard face databases.
Reconfigurable multicomputer networks for very fast real-time applications
Authors: Carl Davis, Svetlana P. Kartashev, Steven I. Kartashev
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

This paper introduces concurrent reconfiguration techniques that perform fast reconfiguration of a multicomputer network into the following network structures: K-rooted trees, stars, and rings with selectable periods. These structures prove to be very efficient for high-speed, real-time applications. The techniques introduced are based on shift register theory and are performed by special shift registers residing in each network node and called shift registers with variable bias. The technique discussed in this paper are implemented in the system with dynamic architecture that is now under construction by Dynamic Computer Architecture, Inc. The time of the network reconfiguration equals that of one clock period, since to perform reconfiguration into a new network structure, each network node should execute only two logical operations---one-bit shift and mod 2 addition.
Generating Requirements Analysis Models from Textual Requirements
Authors: João Santos, Ana Moreira, João Araújo, Vasco Amaral, Mauricio Alférez, Uirá Kulesza
Venue: Proceedings of the 2008 First International Workshop on Managing Requirements Knowledge (2008)

Use case modeling is a commonly used technique to describe functional requirements in Requirements Engineering. Typically, use cases are captured from textual requirements documents describing the functionalities the system should meet. Requirements elicitation, analysis and modeling is a time consuming and error-prone activity, which it is not usually supported by automated tools. This paper tackles this problem by taking free-form textual requirements and offering a semi-automatic process for generation of domain models, such as use cases. Our goal is twofold: (i) reduce the time spent to produce requirements artifacts; and (ii) enable future application of model-driven engineering techniques to maintain traceability information and consistency between textual and requirements visual models artifacts.
Firmware quality assurance
Authors: Helmut K. Berg, Prakash Rao, Bruce D. Shriver
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

The paper reviews problems, solutions, and trends in the area of firmware quality assurance. Firmware quality assurance is considered to be the certification of the fact that a firmware system meets its requirements with respect to functional correctness as well as performance, operational, and implementational properties. The emphasis of the paper is on formal correctness proofs, firmware testing, and the automatic synthesis of microcode and associated hardware structures. Firmware specifications, high-level microprogramming languages, and automated support tools are discussed as they relate to these areas. The impact of advances and trends in very large-scale integration (VLSI) on the techniques and tools for firmware quality assurance is reviewed. The observation is made that valuable results have been obtained in the areas of firmware correctness proofs and firmware testing. However, further improvements are needed to cope with the complexity of VLSI. An alternative that may overcome the limitations of these two approaches is automated synthesis of firmware and hardware and design for testability.
Fairness-based scheduling algorithm for TDD mode IEEE 802.16 broadband wireless access systems
Authors: Sheng-Tzong Cheng, Bafu Chen
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

IEEE 802.16 standards specify four types of services, while how to design an efficient scheduling algorithm remains an open issue. Manufacturers can implement their own scheduling algorithms depending on their specific requirements. There are a lot of scheduling algorithms proposed in the literature. Several scheduling algorithms propose hierarchical structures with strict priority or one-level scheduling mechanism. They are based conceptually on the round-robin approaches. However, they don't consider an important factor: fairness. In this paper we propose a fairness strategy algorithm for IEEE 802.16 broadband wireless access networks. The proposed algorithm applies a fairness strategy to utilize the system bandwidth, to achieve the QoS requirements of high priority service flows, and to reduce starvations of low priority service flows. The simulation studies show that the proposed scheduling algorithm provides a flexible way to utilize the system bandwidth.