ppxscal/embedding_network huggingface dataset:
Justified common knowledge
Authors: Sergei Artemov
Venue: Theoretical Computer Science (2006)

In this paper we introduce the justified knowledge operator J with the intended meaning of J ϕ as 'there is a justification for ϕ.' Though justified knowledge appears here in a case study of common knowledge systems, a similar approach is applicable in more general situations. First we consider evidence-based common knowledge systems obtained by augmenting a multi-agent logic of knowledge with a system of evidence assertions t:ϕ, reflecting the notion 't is an evidence for ϕ,' such that evidence is respected by all agents. Justified common knowledge is obtained by collapsing all evidence terms into one modality J. We show that in standard situations, when the base epistemic systems are T, S4, and S5, the resulting justified common knowledge systems are normal modal logics, which places them within the scope of well-developed machinery applicable to modal logic: Kripke-style epistemic models, normalized proofs, automated proof search, etc. In the aforementioned situations, the intended semantics of justified knowledge is supported by a realization theorem stating that for any valid fact about justified knowledge, one could recover its constructive meaning by realizing all occurrences of justified knowledge modalities Jϕ by appropriate evidence terms t:ϕ.
A Framework for Querying Pedigree Data
Authors: B. Elliott, S. F. Akgul, Z. M. Ozsoyoglu, E. Manilich
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

Genealogy information is becoming increasingly abundant in light of modern genetics and the study of diseases and risk factors. As the volume of this structured pedigree data expands, there is a pressing need for better ways to manage, store, and efficiently query this data. Building on recent advances in semistructured data management and proven relational database technology, we propose a general-purpose Pedigree Query Language (PQL) and evaluation framework for elegantly expressing and efficiently evaluating queries on this data. In this paper, we describe how the problem of modeling and querying pedigree data differs from XML, present an overview of PQL, and present efficient evaluation for key parts of the language. Experimental results using real data show significant (>850%) performance improvement for complex queries over naïve evaluation.
Service Oriented Design Method and Practice For Constructing Citizen-Centric Public Services
Authors: Hong Cai, Kezhao Wang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

The trend of e-government and public services development is moving toward citizen-centric. Compared with government agency centric approach, this brings about a lot of new challenges. The challenges could be met by taking into consideration both business perspectives and IT perspectives innovations. In this paper, we propose a service oriented design method for constructing citizen-centric public services. We also give a real case study on an egovernment project in China in which the ideas were practiced.
Active-RFID System Accuracy and Its Implications for Clinical Applications
Authors: Duncan Clarke, Adrian Park
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Radio Frequency Identification (RFZD) is a technology for automatically tracking the location of persons and objects tagged with a small radio transceiver. Its use in retail and security applications has received widespread at- tention in the popular press. RFZD 's application in hospital business processes is increasing rapidly, and a number of safety-critical clinical applications have been prototyped. In order to detennine RFZD's fitness for use in safety-critical as well as more mundane perioperative processes, the Operating Room of the Future project at the University of Maryland Medical Center evaluated six active-RFZD systems. The evaluation consisted of hands-on testing of a variety of COTS systems employing the leading active-RFID technologies-802.11 RF proprietary, RF, ultra-wideband, infrared and ultrasound. In this paper we report the results of those tests and discuss their implications for the application of active-RFID technology to clinical applications.
A Taxonomy Learning Method and Its Application to Characterize a Scientific Web Community
Authors: Paola Velardi, Alessandro Cucchiarelli, Michael Petit
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

The need to extract and manage domain-specific taxonomies has become increasingly relevant in recent years. A taxonomy is a form of business intelligence used to integrate information, reduce semantic heterogeneity, describe emergent communities and interest groups, and facilitate communication between information systems. We present a semiautomated strategy to extract domain-specific taxonomies from Web documents and its application to model a Network of Excellence in the emerging research field of enterprise interoperability.
A pattern language for pattern language structure
Authors: Tiffany Winn, Paul Calder
Venue: Proceedings of the 2002 conference on Pattern languages of programs - Volume 13 (2003)

This paper aims to help the writers of pattern languages build better pattern languages. It focuses not on the esthetics of pattern languages, but on their structure: how patterns work together to build a system. The paper assumes that a pattern language is a designed system and, therefore, theory about system design and evolution underlies the language. In particular, the process of symmetry breaking has long been recognized as a means of analysing the processes by which natural systems form and evolve, and is used as a basis for this language. The pattern language identifies six patterns: Clustering of Related Forces, Piecemeal Growth, Local Symmetries, Cross Linkages, Local Repair, and The Void. Multidisciplinary examples are included with each pattern to verify that the fundamental theory is, in fact, fundamental.
A peer-to-peer approach to cellular communications
Authors: George C. Polyzos
Venue: Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems (2006)

Only recently, for the first time, private individuals are in a position to provide telecommunication services. This was brought on by the emergence of low-cost Wireless Local Area Network (WLAN) technologies. The density of WLANs in many urban areas is high and increasing. The access bandwidth that WLANs can offer to individual users is greater than what cellular offers-even if the backhaul is a simple DSL connection. In addition, certain new mobile phones support WLAN technology and protocols. Thus, the stage is set for an alternative public cellular network, one that relies on numerous WLAN access points owned and managed by private individuals.We view home WLANs as an underexploited resource. We believe that a controlled WLAN sharing scheme is interesting, viable, and urgently needed. Such a scheme would allow outsiders who are passing by home WLANs to access services on the network in a systematic way. Why would individuals share their WLANs when potential direct and indirect costs are involved? The basic idea is that they would do it in exchange of expected similar services in the future on other WLANs.We have defined, designed, and evaluated a system for sharing WLANs with others, called Peer-to-Peer Wireless Network Confederation (P2PWNC). The system is relying on the principle of indirect reciprocity. We show through simulations that our reciprocity algorithms encourage cooperation in a P2PWNC system (where we assume that all peers are independent and selfish and that software and hardware modules can be tampered with). In addition, a P2PWNC system: (1) is open to all and allows participants to use Uncertified Public Keys as their identities, (2) is fully distributed, relying on a decentralized subsystem for storing transaction history, (3) uses standard hardware and software we developed for some of the main relevant platforms (Linux-based WLAN access points and Windows Mobile-based cell phones.More information can be found at http://mm.aueb.gr/research/P2PWNC/.This is joint work with (my now graduated Ph.D. student) Elias Efstathiou, (my current Ph.D. student) Pantelis Frangoudis, and the whole P2PWNC team.
A Class of Traceability Codes with an Efficient Tracing Algorithm
Authors: Yizhou Ma, Chang-hui Choe, Moon Ho Lee
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Traitor tracing is one kind of piracy deterrent schemes that helps trace the source of leaks when sensitive or proprietary data is made available to a large set of parties. In such schemes, error correcting codes can be applied for their natural properties, known as traceability codes. In this paper, we present Reed-Solomon codes as a kind of traceability codes and use list decoding algorithm to efficiently trace the traitors. We place our emphasis upon the conditions under which list decoding algorithm can be applied successfully for Reed-Solomon codes and the maximum numbers of users and traceable traitors for particular codes.
Dynamic service adaptation: Experiences with Auto-adaptive and Reconfigurable Systems
Authors: Robert Hirschfeld_aff1n2, Katsuya Kawamura
Venue: Software&mdash;Practice Experience (2006)

Change can be observed in our environment and in the technology we build. While changes in the environment happen continuously and implicitly, our technology has to be kept in sync with the changing world around it. Although we can prepare for some of the changes for most of them we cannot. This is especially true for next-generation mobile communication systems that are expected to support the creation of a ubiquitous society where virtually everything is connected and made available within an organic information network. Resources will frequently join or leave the network, new types of media or new combinations of existing types will be used to interact and cooperate, and services will be tailored to preferences and needs of individual customers to better meet their needs. This paper outlines our research in the area of dynamic service adaptation to provide concepts and technologies allowing for such environments. Copyright &copy; 2006 John Wiley & Sons, Ltd.An earlier version of the paper was presented at DARES Workshop on Distributed Auto-adaptive and Reconfigurable Systems 2004 in Tokyo, Japan
Adaptive High-End Microprocessor for Power-Performance Efficiency
Authors: Pedro Trancoso
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

Microprocessor development costs are considerably high. To minimize these costs, manufacturers produce a single design that better satisfies, in average, a wide range of applications. Nevertheless, as applications have different characteristics and users have different demands, this single design is suboptimal in many situations. As a consequence there is a need to design microprocessors that are "flexible" and adapt to the different scenarios. This paper presents a simple multiple parameter selection algorithm to achieve high power-performance efficiency gains for each application. The proposed algorithm is tested using detailed simulation and a set of different applications from multimedia, scientific and database workloads. The experimental results show that when the selection algorithm is applied to a baseline configuration optimized for the corresponding workload, the efficiency gains are up to 30%. When the baseline used is optimized for a different workload then the gains may go up by an order of magnitude. The effectiveness of the simple selection algorithm with the proposed optimizations is impressive as the efficiency gains obtained represent 96% of the gains obtained with an ideal parameter selection algorithm.
Automatic Design and Optimization of Wind Turbine Blades
Authors: V. Diaz Casas, F. Lopez Pena, R. J. Duro
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

This paper is concerned with the description of an automatic design environment developed for the generation of optimal windmill blade profiles as well as the presentation of some results of its application. The objective is to provide a tool for the definition of wind turbine blades that are adapted to specific locations characterized by particular distributions of wind conditions. The design environment is modular and is structured into two main parts; a search module based on macroevolutionary algorithms, and an aerodynamic simulator based evaluation module developed specifically to make optimal use of computing resources while preserving accuracy. The search module works over the very high dimensional blade space to find the best individual through macroevolutionary techniques. The evaluation module is in charge of providing a fitness value for each blade through the computation of its efficiency by means of an optimized aerodynamic simulator that takes into account both the effects on wind on the blade and the effects of the other blades in the turbine. In order to produce a simulator that would lead to acceptably low computational costs, a combination of blade element theory and a panel method was used. In addition, to improve the accuracy of this approach, a processing stage that includes the application of neural networks and an integral boundary layer code was developed to correct the results obtained.
Accessory Stimulus Effects on Response Selection: Does Arousal Speed Decision Making?
Authors: Steven A. Hackley, Fernando Valle-inclán
Venue: Journal of Cognitive Neuroscience (1999)

When an intense but task-irrelevant "accessory" stimulus accompanies the imperative stimulus in choice reaction task, reaction times (RTs) are facilitated. In a similar previous study (Hackley & Valle-Incl&aacute;n,1998), we showed that this effect is not due to a reduction of the interval from onset of the lateralized readiness potential (LRP) until movement onset. In the present study, the RT task was modified to move a portion of the response selection stage into this time interval. The interval remained invariant, indicating that this late phase of the response selection process is not speeded by a accessory stimulation. However, we observed amplitude modulation of the LRP on no-go trials in a condition with three alternative responses. This finding suggests that an earlier phase of response selection is influenced by accessory stimulation. In addition, a novel dependent measure was introduced to event-related potential research-the latency of spontaneous, posttrial blinking.
Collaborative virtual environments: going beyond virtual reality
Authors: R. L. Gomes, G. J. Hoyos-Rivera, J.-P. Courtiat
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

With the growing demand for collaboration technologies, several CSCW (computer-supported cooperative work) systems have been developed. CVEs (collaborative virtual environments) represent an important category of CSCW systems that generally make use of 3D shared space to provide collaboration facilities. However in most CVEs collaboration is restricted to the virtual reality context. In this paper, it is proposed to extend CVEs through the integration of different collaboration tools in order to allow collaboration to take place in different contexts (e.g. Web browsing), in a parallel and coordinated way with the virtual scene.
Wavelets in the propagation of waves in materials with microstructure
Authors: C. Cattani
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

The analysis of evolution differential equations (parabolic-hyperbolic) might be considered within the framework of the (harmonic) wavelet theory. In fact, the multiresolution analysis of wavelets seems to be a suitable scheme for the investigation of phenomena, which appears at different scales of approximation. Very often, the approximate solution is expressed in terms of functions which are significant only at a given resolution, and, some time, also the exact solution (like e.g. the D'Alembert solution of the wave equation) shows two characteristic features of wavelets: the dilation (multiscale) and the translation properties. However, from physical point of view, the wavelets still have little interpretations, especially concerning the small details expressing small deviations nearby the steady solution, since there are only a few examples of physical propagation of wavelets. In particular, the wavelet solutions of the dispersive (Klein-Gordon) wave equation show that the multiresolution approach is a kind of approximation that at each (scale) step increases the "resolution" of the solution. Thus it seems interesting to investigate this multilevel process that, at each scale (level), adds some more details to the solution. As application, the wavelet solution of the Klein Gordon equations for materials with microstructure, is defined as follows: the dispersive wave solution of the propagation equation is interpreted as a superposition of "small" waves on a basic wave. So that the wave propagation will be investigated at each given resolution, by showing that the "minor" details of the solution, neglectable at the initial time, have a significant influence on the solution on a long (time) range. 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
Efficient Clustering of Uncertain Data
Authors: Wang Kay Ngai, Ben Kao, Chun Kit Chui, Reynold Cheng, Michael Chau, Kevin Y. Yip
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

We study the problem of clustering data objects whose locations are uncertain. A data object is represented by an uncertainty region over which a probability density function (pdf) is defined. One method to cluster uncertain objects of this sort is to apply the UK-means algorithm, which is based on the traditional K-means algorithm. In UK-means, an object is assigned to the cluster whose representative has the smallest expected distance to the object. For arbitrary pdf, calculating the expected distance between an object and a cluster representative requires expensive integration computation. We study various pruning methods to avoid such expensive expected distance calculation.
A Modified Genetic Fuzzy Neural Network with Application to Financial Distress Analysis
Authors: Rongjun Li, Zhibin Xiong
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Neural networks have been widely used to solve financial distress problems because of their excellent performances of treating non-linear data with self-learning capability. However, the shortcoming of NNs is also significant due to the "black box" syndrome. Moreover, in many situations NNs more or less suffer from the slow convergence and occasionally involve in a local optimal solution, which strongly limited their applications in practice. To overcome NN's drawbacks, this paper presents a hybrid system that merges the three evolution techniques, i.e. neural networks, fuzzy logic and genetic algorithms, into a comprehensive model, named as a modified Genetic Fuzzy Neural Network (GFNN). Furthermore, the new model has been applied to financial distress analysis based on the data collected from a set of Chinese listed corporations, and the results indicate that the performance of GFNN model is much better than the one of NN model.
TreeLogit Model for Customer Churn Prediction
Authors: Jiayin Qi, Yangming Zhang, Yingying Zhang, Shuang Shi
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

For the purpose of improving the predictive accuracy and interpretability of churn prediction model, TreeLogit model, which integrates the advantage of ADTree model and Logistic regression model, is proposed in this paper to predict customers' churn propensities. Compared with TreeNet\oR , a model which won the Gold Prize in the 2003 mobile customer churn prediction modeling contest (The Duke/NCR Teradata Churn Modeling Tournament), the overall predictive accuracy of TreeLogit model is not inferior. In fact, the predictive accuracy of TreeLogit is superior to the one of TreeNet\oRon two important observation points (i.e. the captured rates in 10% and 50% of the most likely churn groups respectively).
DHR-Trees: A Distributed Multidimensional Indexing Structure for P2P Systems
Authors: Xinfa Wei, Kaoru Sezaki
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

Supporting range query over Peer-to-Peer systems has attracted many research efforts in recent years. In this paper, we propose a new multidimensional indexing structure for P2P systems called Distributed Hilbert R-trees (DHRtrees). DHR-trees enables multidimensional range query to be executed similarly as in overlapping regions tree in P2P systems. Its distributed structure makes it fault-tolerant and scalable to dynamic network environment with a large number of peers as well. Our experiments shows that it performs well on multidimensional range query while the maintenance cost is reasonably low.
Time-varying and support preservative filter banks: design of optimal transition and boundary filters via SVD
Authors: A. Mertins
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

Methods for switching filter coefficients and filter bank structures and methods for processing finite length signals are studied. The problem of designing optimal boundary and transition filters is solved directly via singular value decomposition (SVD) while the optimality criterion is based on the subband statistics. The optimized filters provide a good match between the subband statistics in the transition regions (and at the boundaries) to the statistics in the steady state. The filter banks considered are maximally decimated M-channel linear and non-linear phase (biorthogonal and paraunitary) filter banks with real filter coefficients. 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
Detecting and Measuring Fine Roots in Minirhizotron Images Using Matched Filtering and Local Entropy Thresholding
Authors: Guang Zeng, Stanley T. Birchfield, Christina E. Wells
Venue: Machine Vision and Applications (2006)

An approach to automate the extraction and measurement of roots in minirhizotron images is presented. Two-dimensional matched filtering is followed by local entropy thresholding to produce binarized images from which roots are detected. After applying a root classifier to discriminate fine roots from unwanted background objects, a root labeling method is implemented to identify each root in the image. Once a root is detected, its length and diameter are measured using Dijkstra&#x2019;s algorithm for obtaining the central curve and the Kimura&#x2013;Kikuchi&#x2013;Yamasaki method for measuring the length of the digitized path. Experimental results from a collection of peach (Prunus persica) root images demonstrate the effectiveness of the approach.