ppxscal/embedding_network huggingface dataset:
Discovery of Useful Patterns from Tree-Structured Documents with Label-Projected Database
Authors: Juryon Paik, Junghyun Nam, Hee Yong Youn, Ung Mo Kim
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

Due to its highly flexible tree structure, XML data is used to capture most kinds of data and provides a substrate in which almost any other data structure may be presented. With the continuous growth of XML tree data in electronic environments, the discovery of useful knowledge from them has been a main research area in the information retrieval community. The mostly used approach to this task is to extract frequently occurring subtree patterns from a set of trees. However, because the number of frequent subtrees grows exponentially with the size of trees, a more practical and scalable alternative is required, which is the discovery of maximal frequent subtrees. The maximal frequent subtrees hold all the useful information, though, the number of them is much smaller than that of frequent subtrees. Handling the maximal frequent subtrees is an interesting challenge, and represents the core of this paper. As far as we know, this is one of the first studies to directly discover maximal frequent subtrees without any candidate sets generations as well as eliminating the process of useless subtree pruning. To this end, we define and use a new type of projected database to represent XML tree data efficiently. It significantly improves the entire process of mining maximal frequent subtree patterns. We study the performance and the scalability of the proposed approach through experiments based on synthetic datasets.
Study on the Performance of Regional Economic Structure System by System Dynamics Model
Authors: Yi-xin Zhang
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

The economic structure is an extremely complex system, the complicated characteristics of economic structure system are not merely embodied in the external function of the system, and what’s more, its resource lies in the intrinsic mechanism. The operating mechanism of regional economic structure system reflects the forming process of the system, which should be the important key for the system possessing its properties. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Boosting Descriptive ILP for Predictive Learning in Bioinformatics
Authors: Ning Jiang, Simon Colton
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

Boosting is an established propositional learning method to promote the predictive accuracy of weak learning algorithms, and has achieved much empirical success. However, there have been relatively few efforts to apply boosting to Inductive Logic Programming (ILP) approaches. We investigate the use of boosting descriptive ILP systems, by proposing a novel algorithm for generating classification rules which searches using a hybrid language bias/production rule approach, and a new method for converting first-order classification rules to binary classifiers, which increases the predictive accuracy of the boosted classifiers. We demonstrate that our boosted approach is competitive with normal ILP systems in experiments with bioinformatics datasets.
A State-Based Systemic View of Behavior for Safe Medical Computer Applications
Authors: Luca Pazzi, Marco Pradelli
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

The paper addresses safety issues involved in making ad hoc interconnections among medical devices in order to assemble more complex medical systems. The main problem is that the systemic view may be easily concealed by nowadays behavioral modeling tools. Missing such a systemic view does not allow to have a precise view of what is being modeled: we propose instead to adopt novel methodological guidelines in developing assembled medical systems, basically by showing how a a clear and unambiguous semantics may be given for any state of the system being modeled, from specification to test phases. Such a state semantics may then be checked against safety axioms by simply visiting the state diagram without the need of resorting to model checking techniques.
Demand-based wireless network design by test point reduction
Authors: Natthapol Pongthaipat
Venue:  (2007)

The problem of locating the minimum number of Base Stations (BSs) to provide sufficient signal coverage and data rate capacity is often formulated in manner that results in a mixed-integer NP-Hard (Non-deterministic Polynomial-time Hard) problem. Solving a large size NP-Hard problem is time-prohibitive because the search space always increases exponentially, in this case as a function of the number of BSs. This research presents a method to generate a set of Test Points (TPs) for BS locations, which always includes optimal solution(s). A sweep and merge algorithm then reduces the number of TPs, while maintaining the optimal solution. The coverage solution is computed by applying the minimum branching algorithm, which is similar to the branch and bound search. Data Rate demand is assigned to BSs in such a way to maximize the total network capacity. An algorithm based on Tabu Search to place additional BSs is developed to place additional BSs, in cases when the coverage solution can not meet the capacity requirement. Results show that the design algorithm efficiently searches the space and converges to the optimal solution in a computationally efficient manner. Using the demand nodes to represent traffic, network design with the TP reduction algorithm supports both voice and data users. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
Authors: Paul E. Dunne, Martin Caminada
Venue: Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008)

Semi-stable semantics offer a further extension based formalism by which the concept of "collection of justified arguments" in abstract argumentation frameworks may be described. In contrast to the better known stable semantics, one advantage of semi-stability is that any finite argumentation framework always has at least one semi-stable extension. Although there has been some development of the formal logical theory of semi-stable semantics so that several computational properties of these extensions have been identified, with the exception of some algorithmic studies, more detailed investigation of computational complexity issues has been neglected. Our purpose in this article is to present a number of results on the complexity of some natural decision questions for semi-stable semantics.
On the Evolutionary-Fuzzy Control of WIP in Manufacturing Systems
Authors: Nikos C. Tsourveloudis
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

The effectiveness of optimized fuzzy controllers in the production scheduling has been demonstrated in the past through the extensive use of Evolutionary Algorithms (EA) for the Work-In-Process (WIP) reduction. The EA strategy tunes a set of distributed fuzzy control modules whose objective is to control the production rate in a way that satisfies the demand for final products, while reducing WIP within the production system. The EA identifies optimal design solutions in a given search space. How robust and generic is the controller that comes out of this process? This paper faces this question by testing the evolutionary tuned fuzzy controllers in demand conditions other than the ones used for their optimization. The evolutionary-fuzzy controllers are also compared to heuristically designed ones. Extensive simulations of production lines and networks show that the evolutionary-fuzzy strategy achieved a substantial reduction of WIP compared to the heuristic approach in all test cases.
Aging does not affect brain patterns of repetition effects associated with perceptual priming of novel objects
Authors: Anja Soldan, Yunglin Gazes, H. John Hilton, Yaakov Stern
Venue: Journal of Cognitive Neuroscience (2008)

This study examined how aging affects the spatial patterns of repetition effects associated with perceptual priming of unfamiliar visual objects. Healthy young (n = 14) and elderly adults (n = 13) viewed four repetitions of structurally possible and impossible figures while being scanned with blood oxygenation level-dependent functional magnetic resonance imaging. Although explicit recognition memory for the figures was reduced in the elder subjects, repetition priming did not differ across the two age groups. Using multivariate linear modeling, we found that the spatial networks of regions that demonstrated repetition-related increases and decreases in activity were identical in both age groups, although there was a trend for smaller magnitude repetition effects in these networks in the elder adults for objects that had been repeated thrice. Furthermore, repetition-related reductions in activity in the left inferior frontal cortex for possible objects correlated with repetition-related facilitation in reaction time across both young and elder subjects. Repetition-related increases of an initially negative response were observed for both object types in both age groups in parts of the default network, suggesting that less attention was required for processing repeated stimuli. These findings extend prior studies using verbal and semantic picture priming tasks and support the view that perceptual repetition priming remains intact in later adulthood because the same spatial networks of regions continue to show repetition-related neural plasticity across the adult life span.
The Engineering Workstation And the Engineering Support System?Present Status, Future Directions
Authors: Donald Knight
Venue: IEEE Micro (1985)

Workstations will be integrated with office automation tools to form comprehensive engineering support systems. This special report examines how we can successfully implement such systems.
A New Combined Fractal Scale Descriptor for Gait Sequence
Authors: Li Cui, Hua Li
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

In this paper, we present a new combined fractal scale descriptor based on wavelet moments in gait recognition. This method is likely useful to general 2d objects pattern recognition. By introducing the Mallat algorithm of wavelet, it reduces the computational complexity compared with wavelet moments. Moreover, fractal scale has advantage on the self-similarity description of signals. And because it is based on wavelet moments, it is still translation, scale and rotation invariant, and have strongly anti-noise and occlusion handling performance. For completely decomposed signals, we get the new descriptor by combining the global and local fractal scale in each level. Experiments on a middle size database of gait sequences show that the new combined fractal scale method has simple computation and is an effective descriptor for 2-d objects.
Beyond Conformance: The Role of Accessibility Evaluation Methods
Authors: Giorgio Brajnik
Venue: Proceedings of the 2008 international workshops on Web Information Systems Engineering (2008)

The topic I want to address is the role that accessibility evaluation methods can play in helping the transition from accessibility viewed as standard conformance, to a user-centered accessibility. As we will see, this change sets additional requirements on how evaluations of websites should be carried out.This paper first discusses different problems that occur while dealing with accessibility. We will see that different people have radically different views of accessibility and how it should be assessed.The first requirement is a clear definition of what accessibility is and how it should be assessed. The accessibility model discussed in Section 2.1 has precisely this role.Several existing evaluation methods are then reviewed and discussed, a simple taxonomy is presented, and differences that occur when evaluating accessibility rather than usability are pinpointed.
A comparative anatomy of mobile enterprise applications: Towards a framework of software reuse
Authors: Patrick D. Brans, Rahul C. Basole
Venue: Information-Knowledge-Systems Management (2008)

While more and more enterprises are making use of mobile technology to enable field workers, in many cases a mobile solution is built from the ground up for use by a single company. This is costly, both in terms of development and support resources. By achieving higher reuse of software components these costs can come down. This paper develops a methodology for identifying re-usable components; and using this methodology several re-usable components are listed. As a by-product of this research we develop a taxonomy of mobile applications. We suggest the new term field office applications to describe applications used by mobile workers.
Brief paper: Distributed nonlinear control algorithms for network consensus
Authors: Qing Hui, Wassim M. Haddad
Venue: Automatica (Journal of IFAC) (2008)

In this paper, we develop a thermodynamic framework for addressing consensus problems for nonlinear multiagent dynamical systems with fixed and switching topologies. Specifically, we present distributed nonlinear static and dynamic controller architectures for multiagent coordination. The proposed controller architectures are predicated on system thermodynamic notions resulting in controller architectures involving the exchange of information between agents that guarantee that the closed-loop dynamical network is consistent with basic thermodynamic principles.
Effectiveness Study of Lexically Mapping Two Thesauri
Authors: M. Taboada, R. Lalín, D. Martínez, S. Tellado
Venue: Current Topics in Artificial Intelligence: 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007. Selected Papers (2007)

Mapping thesauri is the task of identifying correspondences between entities in different thesauri. Discovering these matches is intrinsically problematic to automate. Earlier research has proposed solutions based on using lexical matching techniques and then, manually revising the resulting lexical mappings with the help of graphical user interfaces. Nevertheless, these solutions cannot guarantee the validity, accuracy and quality of the vocabulary mappings, as human capacity is limited. In this paper, we propose a method to automatically evaluate the quality of the results of a lexical technique. Our method combines structural constraints and annotations with part-of-speech tags to identifying error patterns from the results of lexical matches, differentiating between those leading to fall in precision and those producing decrease in recall.
An Enhanced Sensor Scheduling Protocol for Wireless Sensor Networks
Authors: Cheng Fu, Bang Wang, Hock Beng Lim
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

An important design challenge in wireless sensor network application development is to provide appropriate middleware service protocols to control the energy consumption according to specific application scenarios. In common application scenarios such as in surveillance systems, it is usually necessary to extend the system monitoring area as large as possible to cover the maximal area. The two issues of power conservation and maximizing the coverage area have to be considered together with both the sensors' communication connectivity and their power management strategy. In this work, we proposed an enhanced sensor scheduling protocol to address the application scenario of typical surveillance systems. Our protocol takes into consideration of both power conservation and coverage ratio to search for the balance between the different requirements. We proposed both centralized and de-centralized versions of sensor scheduling protocol, and compared the performance of different protocols using several metrics. The results provide evidence of the advantages of the proposed protocol compared with existing sensor scheduling protocols.
Auctions with Arbitrary Deals
Authors: Tamás Máhr, Mathijs Weerdt
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

To come to a deal, a bargaining process can sometimes take a long time. An auction may be a faster, but existing auction models cannot cope with situations where money is not an issue, or where it is difficult to express the utility of all participants in a monetary domain.We propose a modified Vickrey auction based only on preferences over the possible bids. This approach also allows for situations where a bid is not just a price or some fixed set of attributes, but can be any possible offer. We prove that in this flexible, generalized setting, the Vickrey mechanism is still incentive compatible and results in a Pareto-efficient solution.
A Fast Fuzzy Neural Modelling Method for Nonlinear Dynamic Systems
Authors: Barbara Pizzileo, Kang Li, George W. Irwin
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

The identification of nonlinear dynamic systems using fuzzy neural networks is studied. A fast recursive algorithm (FRA) is proposed to select both the fuzzy regressor terms and associated parameters. In comparison with the popular orthogonal least squares (OLS) method, FRA can achieve the fuzzy neural modelling with high accuracy and less computational effort.
Information Theoretic Evaluation of Side-Channel Resistant Logic Styles
Authors: François Macé, François-Xavier Standaert, Jean-Jacques Quisquater
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

We propose to apply an information theoretic metric to the evaluation of side-channel resistant logic styles. Due to the long design and development time required for the physical evaluation of such hardware countermeasures, our analysis is based on simulations. Although they do not aim to replace the need of actual measurements, we show that simulations can be used as a meaningful first step in the validation chain of a cryptographic product. For illustration purposes, we apply our methodology to gate-level simulations of different logic styles and stress that it allows a significant improvement of the previously considered evaluation methods. In particular, our results allow putting forward the respective strengths and weaknesses of actual countermeasures and determining to which extent they can practically lead to secure implementations (with respect to a noise parameter), if adversaries were provided with simulation-based side-channel traces. Most importantly, the proposed methodology can be straightforwardly adapted to adversaries provided with any other kind of leakage traces (including physical ones).
Tabular Expressions and Total Functional Programming
Authors: Baltasar Trancón Y Widemann, David Lorge Parnas
Venue: Implementation and Application of Functional Languages: 19th International Workshop, IFL 2007, Freiburg, Germany, September 27-29, 2007. Revised Selected Papers (2008)

Tabular expressions are a multidimensional structured notation for complex mathematical definitions of relations or functions. They have been found useful for documenting imperative programs by stating the function or relation that describes the black-box behaviour of those programs. Tools are needed to increase the practicality of this approach to documentation. In order to create tools to check and evaluate tabular expressions, we have investigated functional programming as an implementation paradigm that reflects the semantics of these mathematical expressions faithfully. We explain why and how the restriction to total functions improves the semantic correspondence substantially, and describe the basic design and capabilities of our total functional programming tools for tabular expressions. We demonstrate the practical advantages of totality by giving examples for the especially easy and effective application of well-known code transformation techniques to total functional programs.
Can I find a partner? Undecidability of partner existence for open nets
Authors: Peter Massuthe, Alexander Serebrenik, Natalia Sidorova, Karsten Wolf
Venue: Information Processing Letters (2008)

We study open nets as Petri net models of web services, with a link to the practically relevant language WS-BPEL. For those nets, we investigate the problem of operability which we consider as fundamental as the successful notion of soundness for workflow nets, i.e., Petri net models of business processes and workflows. While we could give algorithmic solutions to the operability problem for subclasses of open nets in earlier work, this article shows that the problem is in general undecidable.
Improved attenuation correction via appropriate selection of respiratory-correlated PET data
Authors: Joël Daouk, Loïc Fin, Pascal Bailly, Marc-Etienne Meyer
Venue: Computer Methods and Programs in Biomedicine (2008)

Purpose: We propose a respiratory-correlated PET data processing method (called ''BH-CT-based'') based on breath-hold CT acquisition to reduce the smearing effect and improve the attenuation correction. The resulting images are compared with the ungated PET images acquired using a standard, free-breathing clinical protocol. Methods: The BH-CT-based method consisted of a list-mode acquisition with simultaneous respiratory signal recording. An additional breath-hold CT acquisition was also performed in order to define a tissue position from which PET events can be selected. A phantom study featured a 0.5-ml sphere (filled with 18F-fluorodeoxyglucose (^1^8F-FDG) solution) pushed onto a rubber balloon (filled with ^1^8F-FDG solution and iodinated contrast agent). The feasibility of the BH-CT-based method was also assessed in two patients. Results: In the phantom study, the contrast-to-noise ratios (CNRs) were -1.6 for the Ungated volume and 5.1 for the BH-CT-based volume. For patients, CNRs were higher for BH-CT-based volumes than those for Ungated volumes (17.3 vs. 6.3 and 7.3 vs. 3.8, for patients 1 and 2, respectively). Bias-variance measurements were performed and yielded bias reduction of 40% with BH-CT-based. Conclusion: The application of a BH-CT-based method decreases motion bias in PET images. This method resolves issues related to both PET-to-CT misregistration and erroneous attenuation correction and increases lesion detectability.
Condition Monitoring on Power Systems
Authors: Francisco Poza, Perfecto Mariño, Santiago Otero, Vicente Pastoriza
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

The Condition Monitoring of On-Load Tap Changers is very important because they have proved to be the elements with noticeable failures in a power transformer. This article describes the development of a portable virtual instrument for monitoring this kind of elements. The monitoring task is based in the measurement and analysis of the vibrations that a tap change produces. In contrast with other methods that can be used, this one has the advantage of being able to do continuous monitoring because the transformer can be operated on line.