ppxscal/embedding_network huggingface dataset:
Research on Software Problems Based on Ecological Angle
Authors: H. C. An
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Software doesn’t only face software crisis, but also faces software ecological crisis. What is software ecological crisis? First software ecology or the ecology of software must be understood. What about software ecology, i.e. the ecology of software? Many researchers have contributed their share to it. However, its theoretical researches are segmental and not systematic. But its practice is very hot. For example, Microsoft has begun and is beginning to build their software ecological system (ecosystem). In China, many companies are also taking actions such as Kingdee. This thesis will sum up research progress and practice about software ecology and give some suggestions to promote social concern about software ecology and the development of software ecology to respond to software ecological crisis.
A Synthetic, Trend-Based Benchmark for XPath
Authors: Curtis Dyreson, Hao Jin
Venue: Database Systems for Advanced Applications: DASFAA 2009 International Workshops: BenchmarX, MCIS, WDPP, PPDA, MBC, PhD, Brisbane, Australia, April 20 - 23, 2009 (2009)

Interest in querying XML is increasing as it becomes an important medium for data representation and exchange. A core component in most XML query languages is XPath. This paper describes a benchmark for comparing the performance of XPath query evaluation engines. The benchmark consists of an XML document generator which generates synthetic XML documents using a variety of benchmark-specific control factors. The benchmark also has a set of queries to compare XPath evaluation for each control factor. This paper reports on the performance of several, popular XPath query engines using the benchmark and draws some general inferences from the performance.
Semantic composition with (robust) minimal recursion semantics
Authors: Ann Copestake
Venue: Proceedings of the Workshop on Deep Linguistic Processing (2007)

We discuss semantic composition in Minimal Recursion Semantics (MRS) and Robust Minimal Recursion Semantics (RMRS). We demonstrate that a previously defined formal algebra applies to grammar engineering across a much greater range of frameworks than was originally envisaged. We show how this algebra can be adapted to composition in grammar frameworks where a lexicon is not assumed, and how this underlies a practical implementation of semantic construction for the RASP system.
Rough Approximation Based on Weak q-RIFs
Authors: Anna Gomolińska
Venue: Transactions on Rough Sets X (2009)

In this article we consider approximation spaces where instead of rough inclusion functions, the so-called weak quasi-rough inclusion functions (weak q-RIFs) are used to measure the degree of inclusion of a set in a set. Theoretical properties of rough approximation operators based on such inclusion measures are discussed.
Improving SCL model for sentiment-transfer learning
Authors: Songbo Tan, Xueqi Cheng
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

In recent years, Structural Correspondence Learning (SCL) is becoming one of the most promising techniques for sentiment-transfer learning. However, SCL model treats each feature as well as each instance by an equivalent-weight strategy. To address the two issues effectively, we proposed a weighted SCL model (W-SCL), which weights the features as well as the instances. More specifically, W-SCL assigns a smaller weight to high-frequency domain-specific (HFDS) features and assigns a larger weight to instances with the same label as the involved pivot feature. The experimental results indicate that proposed W-SCL model could overcome the adverse influence of HFDS features, and leverage knowledge from labels of instances and pivot features.
Modelling autonomic and dynamic trust decision-making mechanism for large-scale open environments
Authors: Xiaoyong Li, Xiaolin Gui
Venue: International Journal of Computer Applications in Technology (2009)

With the widespread applications of large-scale open environments, such as grid computing, ubiquitous computing, P2P computing, ad hoc networks, etc., the technology of dynamic trust management has become a significant requirement from a network economics' point of view and trust evaluating mechanism has become a determining factor for any given service's success. But the dynamic nature of trust creates the biggest challenge in measuring trust value and predicting trust-ship. In this paper, firstly, the concepts, problems and research approaches of dynamic trust relationship are summarised and presented. Then, focusing on challenges in current studies, combining human cognitive psychology, an autonomic and dynamic trust decision-making mechanism is proposed, in which direct trust computing method based on attenuation function and feedback trust converging mechanism based on direct trust tree (DTT) are set up. Meanwhile, the proposed model uses two new operators to determine the classification weights of trust decision factors automatically, which makes proposed mechanism exhibit a more robust adaptability. Simulation's results show that compared to the existing trust decision-making mechanisms, the new mechanism has remarkable enhancements in the trust decision's accuracy and has a better robustness in the dynamic adaptation capability.
A method of relational fuzzy clustering based on producing feature vectors using FastMap
Authors: Roelof Kars Brouwer
Venue: Information Sciences: an International Journal (2009)

The first stage of organizing objects is to partition them into groups or clusters. The clustering is generally done on individual object data representing the entities such as feature vectors or on object relational data incorporated in a proximity matrix. This paper describes another method for finding a fuzzy membership matrix that provides cluster membership values for all the objects based strictly on the proximity matrix. This is generally referred to as relational data clustering. The fuzzy membership matrix is found by first finding a set of vectors that approximately have the same inter-vector Euclidian distances as the proximities that are provided. These vectors can be of very low dimension such as 5 or less. Fuzzy c-means (FCM) is then applied to these vectors to obtain a fuzzy membership matrix. In addition two-dimensional vectors are also created to provide a visual representation of the proximity matrix. This allows comparison of the result of automatic clustering to visual clustering. The method proposed here is compared to other relational clustering methods including NERFCM, Rouben's method and Windhams A-P method. Various clustering quality indices are also calculated for doing the comparison using various proximity matrices as input. Simulations show the method to be very effective and no more computationally expensive than other relational data clustering methods. The membership matrices that are produced by the proposed method are less crisp than those produced by NERFCM and more representative of the proximity matrix that is used as input to the clustering process.
Trust Model of Users' Behavior in Trustworthy Internet
Authors: Li Wen, Ping Lingdi, Lu Kuijun, Chen Xiaoping
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

As traditional network security cannot meet the security requirements, the international research shows that network security is on the way to Trustworthy Internet and that the trustworthy issue becomes a hot topic in the future Internet. Trust evaluation of users’ behavior is an important part of Trustworthy Internet and a rational trust model plays a key role in the evaluation. This paper concludes many principles of the trust model by analyzing existing trust models and proposes a novel trust model including both the direct and indirect trust. In our model, the direct trust is more trustwor-thy and is weighted more with the more and more interactions and the indirect evaluation becomes less and less important. The subjective factor is considered to make the direct trust obey the principle of “rise-lowly, decline-quickly”. Furthermore, recommenders’ credibility is taken into account in the indirect trust evaluation, which can avoid the denigration and make indirect trust more objective. We also consider the process of referral of the credibility to gain more information to evaluate the indirect trust effectively. Credibility evaluation is the basis of the filtering of low credibility and the improvement of trust evaluation. Finally, several experiments are shown to illustrate the properties of the model.
PLSI: The True Fisher Kernel and beyond
Authors: Jean-Cédric Chappelier, Emmanuel Eckard
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I (2009)

The Probabilistic Latent Semantic Indexing model, introduced by T. Hofmann (1999), has engendered applications in numerous fields, notably document classification and information retrieval. In this context, the Fisher kernel was found to be an appropriate document similarity measure. However, the kernels published so far contain unjustified features, some of which hinder their performances. Furthermore, PLSI is not generative for unknown documents, a shortcoming usually remedied by "folding them in" the PLSI parameter space.This paper contributes on both points by (1) introducing a new, rigorous development of the Fisher kernel for PLSI, addressing the role of the Fisher Information Matrix, and uncovering its relation to the kernels proposed so far; and (2) proposing a novel and theoretically sound document similarity, which avoids the problem of "folding in" unknown documents. For both aspects, experimental results are provided on several information retrieval evaluation sets.
Text type structure and logical document structure
Authors: Hagen Langer, Harald Lüngen, Petra Saskia Bayerl
Venue: Proceedings of the 2004 ACL Workshop on Discourse Annotation (2004)

Most research on automated categorization of documents has concentrated on the assignment of one or many categories to a whole text. However, new applications, e.g. in the area of the Semantic Web, require a richer and more fine-grained annotation of documents, such as detailed thematic information about the parts of a document. Hence we investigate the automatic categorization of text segments of scientific articles with XML markup into 16 topic types from a text type structure schema. A corpus of 47 linguistic articles was provided with XML markup on different annotation layers representing text type structure, logical document structure, and grammatical categories. Six different feature extraction strategies were applied to this corpus and combined in various parametrizations in different classifiers. The aim was to explore the contribution of each type of information, in particular the logical structure features, to the classification accuracy. The results suggest that some of the topic types of our hierarchy are successfully learnable, while the features from the logical structure layer had no particular impact on the results.
Lifetime learning as a factor in life history evolution
Authors: John A. Bullinaria
Venue: Artificial Life (2009)

An artificial life approach is taken to explore the effect that lifetime learning can have on the evolution of certain life history traits, in particular the periods of protection that parents offer their young, and the age at first reproduction of those young. The study begins by simulating the evolution of simple artificial neural network systems that must learn quickly to perform well on simple classification tasks, and determining if and when extended periods of parental protection emerge. It is concluded that longer periods of parental protection of children do offer clear learning advantages and better adult performance, but only if procreation is not allowed during the protection period. In this case, a compromise protection period evolves that balances the improved learning performance against reduced procreation period. The crucial properties of the neural learning processes are then abstracted out to explore the possibility of studying the effect of learning more generally and with better computational efficiency. Throughout, the implications of these simulations for more realistic scenarios are discussed.
Incremental aggregation of RFID data
Authors: Roberto De Virgilio, Pierpaolo Sugamiele, Riccardo Torlone
Venue: Proceedings of the 2009 International Database Engineering & Applications Symposium (2009)

Radio Frequency Identification (RFID) technology plays a key role in supply chains and a challenging problem is the effective and efficient management of the enormous volume of data generated by such systems. In this paper, we propose a new framework for storing and querying a large amount of RFID data. The approach is based on a compression technique that allows a significant saving of space according to a suitable notion of aggregates over RFID data and a logical representation of these aggregates. We also propose an indexing technique for aggregates of RFID data that guarantees the efficient execution of an important class of queries. We finally present the architecture of a tool implementing our approach and demonstrate, with a number of experimental results made with this tool, the feasibility and effectiveness of the underlying techniques.
Affective Computer-Generated Stimulus Exposure: Psychophysiological Support for Increased Elicitation of Negative Emotions in High and Low Fear Subjects
Authors: Christopher G. Courtney, Michael E. Dawson, Anne M. Schell, Thomas D. Parsons
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

The present study examined physiological measures of affect when viewing images from the International Affective Picture System (IAPS), computer-generated still images, and computer-generated videos of feared and non-feared stimuli. Twenty low fear (LF) and twelve high fear (HF) individuals viewed static and moving images of spiders and snakes. In both LF and HF subjects, computer-generated video images elicited more intense affective responses than the IAPS images and the computer-generated stills. Computer-generated still images were as effective in eliciting fear responses as the IAPS. These results suggest that computer-generated images can be as or more effective as the IAPS in eliciting fear. Regardless of modality, HF subjects showed stronger physiological responses to their specifically feared stimulus (snake or spider) than to a non-feared stimulus.
Evaluation of glyph-based multivariate scalar volume visualization techniques
Authors: David Feng, Yueh Lee, Lester Kwock, Russell M. Taylor,  II
Venue: Proceedings of the 6th Symposium on Applied Perception in Graphics and Visualization (2009)

We present a user study quantifying the effectiveness of Scaled Data-Driven Spheres (SDDS), a multivariate three-dimensional data set visualization technique. The user study compares SDDS, which uses separate sets of colored sphere glyphs to depict variable values, to superquadric glyphs, an alternative technique that maps all variable values to a single glyph. User study participants performed tasks designed to measure their ability to estimate values of particular variables and identify relationships among variables. Results from the study show that users were significantly more accurate and faster for both tasks under the SDDS condition.
Adaptive color image watermarking based on a modified improved pixel-wise masking technique
Authors: Hazem A. Al-Otum, Allam O. Al-Taba'a
Venue: Computers and Electrical Engineering (2009)

In this paper, a family of modified wavelet-based watermarking techniques is proposed. This family of techniques is based on the improved pixel-wise (PW) watermarking scheme. The basic proposed algorithm considerably improves the PSNR of the watermarked image (in the range of 2.20-7.28dB), and is based on selecting specific locations in the three detailed sub-bands of the first level of the DWT decomposition of the image. The selective nature of the modified PW method (denoted as selective PW: SPW) allows the scheme to be adaptive in terms of the imperceptibility and the watermark size. Also, the PW and SPW methods were extended to be implemented with color images: (1) grayscale-wise PW method (G-PW) that embeds the watermark in the Y component of the YCbCr model. (2) Multi spectral-PW method (MS-PW) that embeds the watermark in the R, G, and B layers independently. (3) Multi spectral-SPW method (MS-SPW) that gains high PSNR value compared with MS-SPW, and (4) multi spectral-maximum PW method (MS-MPW) which is proposed to improve the PSNR value as well as the level of watermarking security, when compared with MS-PW method.
An empirical analysis of search in GSAT
Authors: Ian P. Gent, Toby Walsh
Venue: Journal of Artificial Intelligence Research (1993)

We describe an extensive study of search in GSAT, an approximation procedure for propositional satisfiability. GSAT performs greedy hill-climbing on the number of satisfied clauses in a truth assignment. Our experiments provide a more complete picture of GSAT's search than previous accounts. We describe in detail the two phases of search: rapid hill-climbing followed by a long plateau search. We demonstrate that when applied to randomly generated 3-SAT problems, there is a very simple scaling with problem size for both the mean number of satisfied clauses and the mean branching rate. Our results allow us to make detailed numerical conjectures about the length of the hill-climbing phase, the average gradient of this phase, and to conjecture that both the average score and average branching rate decay exponentially during plateau search. We end by showing how these results can be used to direct future theoretical analysis. This work provides a case study of how computer experiments can be used to improve understanding of the theoretical properties of algorithms.
Supporting map-based wayfinding with tactile cues
Authors: Martin Pielot, Niels Henze, Susanne Boll
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Paper maps are a proven means for navigating in unfamiliar environments, however, they do not prevent people from getting lost or taking unwanted detours. A well-known issue is interpreting the map's geocentric content, which is known to become prone to errors when the map is not aligned to the environment. In this paper we report our investigation of providing a cue about the destination's location from an egocentric perspective in order to improve the interpretation of the map. We used a vibrotactile belt to continuously indicate a destination's direction relative to the user's orientation. In an outdoor field study we compared the performance of map-based navigation with and without the added tactile cue. We found evidence that people take shorter routes, consult the map less often, and were less often disoriented with the tactile cue. Furthermore, females found the tactile cue more useful and used it more often.
This Just In! Your Life in the Newspaper
Authors: Bruno Antunes, Tiago Guerreiro, Daniel Gonçalves
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

It is not uncommon for computer users to work on several things at once. However, to the computer, all documents, emails and applications are considered equal, regardless of why they were created or used. Little support is provided when trying to recall important information about a particular project or subject at a later time. What is more, there is no effective way to help users review their past activities to identify when a particular subject was of importance, what were their concerns at a given moment in the past, or simply review their activities during a period of time at a glance. In this paper we describe PersonalNews, a system in which users are presented with a personal newspaper, in which the news articles describe the subjects they were concerned with in a given period of time. Those articles are automatically generated from the users' documents, grouped according to their subject and analyzed for relevant passages describing them. We show that PersonalNews is able to recognize the subjects and projects the users were involved in, and even help them recall some they had forgotten about. Also, it can be used effectively to help retrieve documents on particular subjects.
CDs Have Fingerprints Too
Authors: Ghaith Hammouri, Aykutlu Dana, Berk Sunar
Venue: Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems (2009)

We introduce a new technique for extracting unique fingerprints from identical CDs. The proposed technique takes advantage of manufacturing variability found in the length of the CD lands and pits. Although the variability measured is on the order of 20 nm, the technique does not require the use of microscopes or any advanced equipment. Instead, we show that the electrical signal produced by the photodetector inside the CD reader is sufficient to measure the desired variability. We investigate the new technique by analyzing data collected from 100 identical CDs and show how to extract a unique fingerprint for each CD. Furthermore, we introduce a technique for utilizing fuzzy extractors over the Lee metric without much change to the standard code offset construction. Finally, we identify specific parameters and a code construction to realize the proposed fuzzy extractor and convert the derived fingerprints into 128-bit cryptographic keys.
Using Mobile Agents and Intelligent Data Analysis Techniques for Climate Environment Modeling and Weather Analysis and Prediction
Authors: Mogos Radu Ioan, Socoll Paula Liliana
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

The present paper deliberates an important aspect of the data analysis and predictions based on them in the climate environments. The main aspect is how data can arrive in a more efficient way to the central station and how to minimize the transport load in the network. The proposed architecture includes two data collecting ways from different sources. Through a dynamic environment modelling program called Stella, it is created a mobile agent architecture based on a dynamic model of a real environment for Apuseni Mountains area. A set of equations is realized to describe the proposed model. The communication model used, the coordination type between agents and the agents training process are discuss. This article presents also aspects of the intelligent analysis data techniques and phases that are used in order to evaluate data. The obtained results are combined afterwards with the risk factors, which affects the environment through the climatically and meteorological events.
High-isolation multiway power dividing-combining network implemented by broadside-coupling SIW directional couplers
Authors: Chao Wang, Wenquan Che, Peter Russer
Venue: International Journal of RF and Microwave Computer-Aided Engineering (2009)

One kind of novel microwave planar power dividing-combining network based on substrate-integrated waveguide (SIW) directional couplers is proposed and investigated. The design strategies of the broadside-coupling SIW directional coupler are introduced, the series connection of several directional couplers with different coupling ratio then result in a multiway power dividing-combining network. One three-way power dividing-combining network is designed and fabricated to demonstrate the validity of the proposed work, high isolation among the ports is observed. &copy; 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009.