ppxscal/embedding_network huggingface dataset:
Artificial Intelligence in Designing Non Geometric Brace Systems
Authors: Hassanali Mosalman Yazdi, Nor Hafizah Ramli Sulong
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

In this paper, a new method for designing a particular brace system is proposed. This type of brace system,which is called Non Geometric Brace system are mostlyused in seismic area and it allows architects to have more opening in the panel. Non-straight diagonal member of this system introduces eccentricity and it is connected to the corner of the frame by a third member.In designing this system, designers often use trial and error method to locate theconnection point of the braced elements considering various parameters affecting the design such as opening and frame dimensions,cross section areas of brace elements and the location of brace element connection.Hence finding the best connection point with maximum stiffness and minimum weight of brace elements with conventional method is not trivial. In this paper, a multi-object genetic algorithm is proposed in determining the best selection for connection point.Equations of feasible area are determined, followed by utilization of some operators such as selection, mutation, crossover and elitist genetic algorithm. Based onthe plain aggregation approach fortransforming the objective vector in scalar, some modification are proposed considering the priority between the frame stiffness andstructure's weightin this transformation.
Semi-automatic Creation of a Dictionary of Nominal Compounds
Authors: Tomasz Stępień, Bartosz Podlejski
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

This paper presents a method of semi-automatic creation of a dictionary of nominal compounds. For each English expression, several possible Polish translations are generated and the number of occurrences on the Internet is checked for each of them separately. The most frequent form is supposed to be the right one, which is proved by analysis of ca. 500 phrases.
Democracy to Come: Active Forums as Indicator Suites for e-Participation and e-Governance
Authors: Debbie Rodan, Mark Balnaves
Venue: Proceedings of the 1st International Conference on Electronic Participation (2009)

There is in modern industrial societies a `civic deficit' Civic engagement in the traditional sense of community values and civic participation is declining (Putman 2000). What has not been examined is the ways in which various media including new media may provide real options for participatory cultures and participatory democracy now and in the future. Undoubtedly there are differences between participatory cultures that are considered a `genuine' contribution to representational democracy and those that are not. This paper, based on initial research into Internet activism, will examine GetUp! as a specific example of an active forum that the authors argue enable participatory citizenship through media participation. While there are very few examples of active forums that might be considered a `genuine' contribution to representational democracy there are clear signals that activism through active forums is maturing into a potent democratic force.
Routing-Based Global Network Communication Quality Representation for Event-driven Wireless Sensor Network
Authors: Zhenhua Wu, Jian Shu
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

Aimed at the features of event-driven wireless sensor network, a representation of the entire network communication quality named as “Routing-based global network Communication Quality Representation (RCQR)” is introduced and evaluated. In our simulation and test-bed experiments, there is subtle difference between LQG constructed by RCQR and the packet reception rate of the entire network. Moreover, the difference is not sensitive to changes in the network scale and testing last time. Experiments using two kind of routing algorithm show that RCQR is feasible to different routing.
Efficient haplotype inference with answer set programming
Authors: Ferhan Türe, Esra Erdem
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. Although we have access to genotype data (genetic makeup of an individual), determining haplotypes (genetic makeup of the parents) experimentally is a costly and time consuming procedure due to technological limitations. With these biological motivations, we study a computational problem, called Haplotype Inference with Pure Parsimony (HIPP), that asks for the minimal number of haplotypes that form a given set of genotypes. We introduce a novel approach to solving HIPP, using Answer Set Programming (ASP). According to our experiments with a large number of problem instances (some automatically generated and some real), our ASP-based approach solves the most number of problems compared to other approaches based on, e.g., integer linear programming, branch and bound algorithms, SAT-based algorithms, or pseudo-boolean optimization methods.
Automatic Particle Detection and Counting by One-Class SVM from Microscope Image
Authors: Hinata Kuba, Kazuhiro Hotta, Haruhisa Takahashi
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

Asbestos-related illnesses become a nationwide problem in Japan. Now human inspectors check whether asbestos is contained in building material or not. To judge whether the specimen contains asbestos or not, 3,000 particles must be counted from microscope images. This is a major labor-intensive bottleneck. In this paper, we propose an automatic particle counting method for automatic judgement system whether the specimen is hazardous or not. However, the size, shape and color of particles are not constant. Therefore, it is difficult to model the particle class. On the other hand, the non-particle class is not varied much. In addition, the area of non-particles is wider than that of particles. Thus, we use One-Class Support Vector Machine (OCSVM). OCSVM identifies "outlier" from input samples. Namely, we model the non-particle class to detect the particle class as outlier. In experiments, the proposed method gives higher accuracy and smaller number of false positives than a preliminary method of our project.
Arguing from Experience to Classifying Noisy Data
Authors: Maya Wardeh, Frans Coenen, Trevor Bench-Capon
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

A process, based on argumentation theory, is described for classifying very noisy data. More specifically a process founded on a concept called "arguing from experience" is described where by several software agents "argue" about the classification of a new example given individual "case bases" containing previously classified examples. Two "arguing from experience" protocols are described: PADUA which has been applied to binary classification problems and PISA which has been applied to multi-class problems. Evaluation of both PADUA and PISA indicates that they operate with equal effectiveness to other classification systems in the absence of noise. However, the systems out-perform comparable systems given very noisy data. Keywords: Classification, Argumentation, Noisy data.
Efficient Processing of XML Twig Queries with All Predicates
Authors: Xiaoshuang Xu, Yucai Feng, Feng Wang
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Some researches have proposed part solutions to process XML twig queries with AND,OR, or NOT predicates. However, very Little work has handled a twig query with three predicates comprehensively. In this paper, we propose a novel path-partitioned encoding scheme, and present a powerful XPattern extended from tree pattern with logic predicates. We also develop a holistic twig join algorithm, called MPTwig, which is designed for efficient matching an XML twig pattern with compound and nested predicates. We show that MPTwig based on path-partitioned encoding scheme guarantee the I/O and CPU optimality. Finally, experimental results on a representative data set indicate that the proposed algorithm performs significantly.
Randomization Methods for Assessing the Significance of Data Mining Results
Authors: Heikki Mannila
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

Data mining research has developed many algorithms for various analysis tasks on large and complex datasets. However, assessing the significance of data mining results has received less attention. Analytical methods are rarely available, and hence one has to use computationally intensive methods. Randomization approaches based on null models provide, at least in principle, a general approach that can be used to obtain empirical p-values for various types of data mining approaches. I review some of the recent work in this area, outlining some of the open questions and problems.
Uniform Sampling for Directed P2P Networks
Authors: Cyrus Hall, Antonio Carzaniga
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms. Such uniform sampling is supported by several techniques. However, current techniques suffer from sample bias and limited applicability. In this paper, we present a sampling algorithm that achieves a desired uniformity while making essentially no assumptions about the underlying P2P network. This algorithm, called doubly stochastic converge (DSC), iteratively adjusts the probabilities of crossing each link in the network during a random walk, such that the resulting transition matrix is doubly stochastic. DSC is fully decentralized and is designed to work on both directed and undirected topologies, making it suitable for virtually any P2P network. Our simulations show that DSC converges quickly on a wide variety of topologies, and that the random walks needed for sampling are short for most topologies. In simulation studies with FreePastry, we show that DSC is resilient to high levels of churn, while incurring a minimal sample bias.
An Experimental Analysis of the Relationship between Biometric Template Update and the Doddington's Zoo: A Case Study in Face Verification
Authors: Ajita Rattani, Gian Luca Marcialis, Fabio Roli
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

The problem of biometric template representativeness has recently attracted much attention with the introduction of several template update methods. Automatic template update methods adapt themselves to the intra-class variations of the input data. However, it is possible to hypothesize that the effect of template updating may not be the same for all the clients due to different characteristics of clients present in the biometric database. The goal of this paper is to investigate this hypothesis by explicitly partitioning clients into different groups of the "Doddington's zoo" as a function of their "intrinsic" characteristics, and studying the effect of state of art template "self update" procedure on these different groups. Experimental evaluation on Equinox database with a case study on face verification system based on EBGM algorithm shows the strong evidence of non-uniform update effects on different clients classes and suggest to modify the update procedures according to the client's characteristics.
The use of mobile contact list applications and a context-oriented framework to support their design
Authors: Andreas Komninos, Dimitrios Liarokapis
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Contact lists are one of the most frequently used applications on mobile devices. They are used not only as contact detail repositories, but also as temporary information storage for unrelated items, such as PINs or passwords. Users are reluctant to delete or remove contacts from their repositories. As such, these become increasingly large, sometimes measuring several hundred entries. In this paper we present our findings from early investigations into the use of mobile Contact Lists. We also propose a context oriented design framework to aid the speed and efficacy of the information seeking and retrieval process during the use of the Contact List application.
Making Archetypal Analysis Practical
Authors: Christian Bauckhage, Christian Thurau
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

Archetypal analysis represents the members of a set of multivariate data as a convex combination of extremal points of the data. It allows for dimensionality reduction and clustering and is particularly useful whenever the data are superpositions of basic entities. However, since its computation costs grow quadratically with the number of data points, the original algorithm hardly applies to modern pattern recognition or data mining settings. In this paper, we introduce ways of notably accelerating archetypal analysis. Our experiments are the first successful application of the technique to large scale data analysis problems.
Challenges for Great Libraries in the Age of the Digital Native
Authors: Dame Lynne J. Brindley
Venue: Information Services and Use (2009)

Lynne Brindley has played a key role in digital library developments since the early 1980s, and since 2000 as Chief Executive of the British Library. During that time the role of academic and national libraries has changed significantly, with ever-increasing expectations of researchers requiring libraries to re-focus their priorities. This speech will discuss what the emergence of Digital Natives means for great libraries, now and in the future. Amongst areas libraries will need to tackle is an increased focus on e-science and e-research, utilizing web 2.0 and 3.0 and digital preservation. The digital age offers huge opportunities, but the decline of information literacy skills risks robbing a generation of the ability to fully utilize these. Lynne assesses the changing role of special collections and the continuing relevance of inspiring physical space. Libraries and information services must step up to the plate to provide services which meet the needs of the new generation of researchers, and which add value beyond the search engine. From her Miles Conrad Award Lecture, NFAIS 2009 Annual Conference, February 23, 2009, Philadelphia, PA, USA.
Another Efficient Provably Secure Designated Verifier Signature Scheme in the Standard Security Model
Authors: Jianhong Zhang, Qin Geng
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Cryptographic hash function plays a central role in application of cryptology and is an essential building block of a digital signature scheme. So far, in almost all of the practical digital signature schemes, hash functions which are dependent on underlying cyclic groups are necessary, and it could be required to construct a dedicated hash function for each digital signature. As a special cryptographical tool, designated verifier signature scheme (DVS) is a signature scheme which provides authentication of a message without providing a non-repudiation property of traditional signature. Thus, designated verifier signature scheme plays an important role in copyright protection. However, most of existing schemes include hash functions as a random generator to realize security proof, thus it results in the security of most existing schemes is only proven in the random oracle model. However, security in random oracle model doesn't imply the security in the real world. In this paper, we proposed an efficient Designated verifier signature scheme without hash function and show that the security of the scheme is tightly related to Weak inverse of Computational Diffie-Hellman assumption. The prominent advantage of the scheme is that the pairing operation and hash function are not involved in signing phase, the size of signature is 480bits. Thus the scheme is very efficient.
Evaluating the post-stroke patients progress using an Augmented Reality Rehabilitation system
Authors: Atif Alamri, Jongeun Cha, Mohamad Eid, Abdulmotaleb El Saddik
Venue: Proceedings of the 2009 IEEE International Workshop on Medical Measurements and Applications (2009)

A stroke has been considered one of the leading causes of death in the world. Survivors suffer from major or minor disabilities in their motor functions so that they are unable to carry on their daily activities, therefore, they go through a rehabilitation process to recover their motor abilities up to a certain point. Recently, the fields of virtual reality and haptic have been investigated for use in rehabilitation. In this paper, we propose a novel approach based on Augmented Reality (AR) technology with two main goals as driving forces: First, the system enhances the patient involvement in the rehabilitation exercise, and second, the system measures the patient performance without the direct supervision of a therapist. We called this system AR-REHAB, for Augmented Reality REHABilitation. In addition, the system is empowered with an intelligent decision support engine to assess the patients' progress to help therapists fine-tune the exercises based on the patient's progress.
Intelligent Video Surveillance for Detecting Snow and Ice Coverage on Electrical Insulators of Power Transmission Lines
Authors: Irene Y. Gu, Unai Sistiaga, Sonja M. Berlijn, Anders Fahlström
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

One of the problems for electrical power delivery through power lines in northern countries is when snow or ice accumulates on electrical insulators. This could lead to snow or ice-induced outages and voltage collapse, causing huge economic loss. This paper proposes a novel real-time intelligent surveillance and image analysis system for detecting and estimating the snow and ice coverage on electric insulators using images captured from an outdoor 420 kV power transmission line. In addition, the swing angle of insulators is estimated, as large swing angles due to wind cause short circuits. Hybrid techniques by combining histogram, edges, boundaries and cross-correlations are employed for handling a broad range of scenarios caused by changing weather and lighting conditions. Experiments have been conducted on the captured images over several month periods. Results have shown that the proposed system has provided valuable estimation results. For image pixels related to snows on the insulator, the current system has yielded an average detection rate of 93% for good quality images, and 67.6% for images containing large amount of poor quality ones, and the corresponding average false alarm ranges from 9% to 18.1%. Further improvement may be achieved by using video-based analysis and improved camera settings.
Talking bodies: Sensitivity to desynchronization of conversations
Authors: Rachel McDonnell, Cathy Ennis, Simon Dobbyn, Carol O'Sullivan
Venue: ACM Transactions on Applied Perception (TAP) (2009)

In this article, we investigate human sensitivity to the coordination and timing of conversational body language for virtual characters. First, we captured the full body motions (excluding faces and hands) of three actors conversing about a range of topics, in either a polite (i.e., one person talking at a time) or debate/argument style. Stimuli were then created by applying the motion-captured conversations from the actors to virtual characters. In a 2AFC experiment, participants viewed paired sequences of synchronized and desynchronized conversations and were asked to guess which was the real one. Detection performance was above chance for both conversation styles but more so for the polite conversations, where desynchronization was more noticeable.
Deciding Query Entailment in Fuzzy Description Logic Knowledge Bases
Authors: Jingwei Cheng, Z. M. Ma, Fu Zhang, Xing Wang
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

Existing fuzzy description logic (DL) reasoners either are not capable of answering conjunctive queries, or only apply to DLs with less expressivity. In this paper, we present an algorithm for answering expressive fuzzy conjunctive queries, which allows the occurrence of both lower bound and the upper bound of thresholds in a query atom, over the relative expressive DL, namely fuzzy $\mathcal{ALCN}$. Our algorithm is specially tailored for deciding conjunctive query entailment of negative role atoms in the form of R(x,y) ≤ n or R(x,y) < n which, to the best of our knowledge, has not been touched on in other literatures.
Context-aware ambient media infrastructure
Authors: Ichiro Satoh
Venue: Proceedings of the 13th International MindTrek Conference: Everyday Life in the Ubiquitous Era (2009)

This paper presents a context-aware infrastructure for building and managing mobile agent-based ambient media, where mobile agents are autonomous programs that can travel from computer to computer under their own control as virtual counterpart objects for people or physical entities. These are digital representations of people or physical entities and can define and provide ambient media for advertising or user-assistant services for users. The infrastructure spatially binds the positions of people or objects with the locations of their virtual counterparts and, when they move or are carried in the physical world, it automatically deploys their agents at computers near to their current positions to provide ambient media. To demonstrate the utility and effectiveness of the system, we constructed and operated two context-aware ambient media systems as case studies in our development of agent-based ambient computing in wide public spaces.
Fast surrogates of U-statistics
Authors: N. Lin, R. Xi
Venue: Computational Statistics Data Analysis (2010)

U-statistics have long been known as a class of nonparametric estimators with good theoretical properties such as unbiasedness and asymptotic normality. However, their applications in modern statistical analysis are limited due to the high computational complexity, especially when massive data sets are becoming more and more common nowadays. In this paper, using the ''divide-and-conquer'' technique, we developed two surrogates of the U-statistics, aggregated U-statistics and average aggregated U-statistics, both of which are shown asymptotically equivalent to U-statistics and computationally much more efficient. When dividing the raw data set into K subsets, the two proposed estimators reduce the computational complexity from O(N^m) to O(K(N/K)^m), which results in significant time reduction as long as K=o(N) and m>=2. The merit of the two proposed statistics is demonstrated by both simulation studies and real data examples.