ppxscal/embedding_network huggingface dataset:
Discriminating Structure and Random Texture Images with Binary Fourier Spectrum for Invariant Texture Retrieval
Authors: Jiuwen Zhang, Xiaojun Li, Yide Ma
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Because of the diversity of the textures, pre-classification before the retrieval seems very necessary and important. We divided texture images into two categories: structure and random, based on binary Fourier spectrum and Shannon entropy as a pre-classification stage. Gabor wavelets is especially useful for texture analysis because of the tunable property of its scale and orientation, but it is sensitive to the directional change of a query image. Scale-invariance Gabor representation is used here after the adjustment step which can reduce the rotation variance of the query image to achieve rotation-invariance, scale-invariance and translation-invariance task in the first class. For the images in the latter class we use a combined rotation and scale invariant Gabor representation. The features we used are much less than conventional Gabor wavelets and therefore it is less time-consuming not only in feature extraction but also in similarity measurement. Simulation results using Brodatz database clearly show that our proposed rotation-invariant, scale-invariant and translation-invariant methods give rise to high retrieval performances.
The EUCLIDES Enhancing the Use of Cooperative Learning to Increase DEvelopment of Science Studies Project --- An On-Line Learning Portal Utilizing Problem-Based Learning
Authors: Fabrizio Boldini, Maria Rita Bracchini, Philippos Pouyioutas, Emilios Solomou, Christina Ioannou
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

This paper presents the EUCLIDES (Enhancing theUse ofCooperativeLearning toIncreaseDEvelopment of Science studies) project (134246-LLP-1-2007-1-IT-1-COMENIUS-CMP), which aims at introducing and pilot testing an innovative teaching and training methodology, based on the Constructivist approach and on Problem-Based Learning (PBL), through the use of ICT instruments. This methodology has been developed for the study of science subjects and, is currently being used in some European schools of secondary education, involving teachers and students. A Moodle platform has been developed to enforce the application and use of the methodology. Through this platform, teachers can monitor the progress of the work of the students and intervene when necessary as facilitators to provide further co-ordination, pose questions and suggest problem-based approaches. The use of the platform secures that the teacher remains distant from the students allowing students to work by themselves and find solutions to the problems posed.
Implementation of MedVI Agent a Medical Vocabulary Interpreter for Medical Agents
Authors: Beesung Kam, Il Kon Kim, Hune Cho, Yun Sik Kwak
Venue: Multi-Agent Systems for Society: 8th Pacific Rim International Workshop on Multi-Agents, PRIMA 2005, Kuala Lumpur, Malaysia, September 26-28, 2005, Revised Selected Papers (2009)

Problems of having different vocabularies pointed at the same terminology for health care parties are today's issue. Communication problem of this kind in health information system around the globe are still without answers. By fast growing Intelligent Agent technology in the medical field, this issue becomes large enough to halt the progress. Agents for valid communication need to have same understanding over the terminology. Misunderstanding about meaning of a specific terminology by human is as same as misunderstandings of intelligent agents about meaning of a term-which concludes a fault communication-with the difference that agents are connected to each other and can exchange though at no time. The problem is where an agent can report for a valid knowledge base and correct meaning of a term. This paper is addressing this issue by presenting a Medical Vocabulary Interpreter as an Agent (We assume it to be a well known software, waiting to answer questions about original meaning of a terminology and ready to reply-first in first out service) to share a vast amount of complex information pointing to the same root.
Biomind ArrayGenius and GeneGenius: web services offering microarray and SNP data analysis via novel machine learning methods
Authors: Ben Goertzel, Cassio Pennachin, Lucio Coelho, Leonardo Shikida, Murilo Queiroz
Venue: Proceedings of the 19th national conference on Innovative applications of artificial intelligence - Volume 2 (2007)

Analysis of postgenomic biological data (such as microarray and SNP data) is a subtle art and science, and the statistical methods most commonly utilized sometimes prove inadequate. Machine learning techniques can provide superior understanding in many cases, but are rarely used due to their relative complexity and obscurity. A challenge, then, is to make machine learning approaches to data analysis available to the average biologist in a user-friendly way. This challenge is addressed by the Biomind ArrayGenius product, an easy-to-use Web-based system providing microarray analysis based on genetic prognunming, kernel methods, and incorporation of knowledge from biological ontologies; and GeneGenius, its sister product for SNP data. This paper focuses on the obstacles faced and lessons learned in the course of creating, deploying, maintaining and selling ArrayGenius and GeneGenius - many of which are generic to any effort involving the creation of complex AI-based products addressing complex domain problems.
Improved Approximation Results on the Shortest Common Supersequence Problem
Authors: Zvi Gotthilf, Moshe Lewenstein
Venue: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (2009)

The problem of finding the Shortest Common Supersequence (SCS) of an arbitrary number of input strings is a well-studied problem. Given a set L of k strings, s 1, s 2, ..., s k , over an alphabet Σ, we say that their SCS is the shortest string that contains each of the input strings as a subsequence. The problem is known to be NP-hard [8] even over binary alphabet [12]. In this paper we focus on approximating two NP-hard variants of the SCS problem. For the first variant, where all input strings are of length 2, we present a $2 - \frac {2}{1 + \log{n}\log{\log{n}}}$ approximation algorithm, where |Σ| = n. This result immediately improves the $2 - \frac {4}{n+1}$ approximation algorithm presented in [17]. Moreover, we present a $\frac{7}{6}$ ($\approx 1.166\bar{6}$) approximation algorithm for the restricted variant (but still NP-hard) where all input strings are of length 2 and every character in Σ has at most 3 occurrences in L.
Formalization and community investment in wikipedia's regulating texts: the role of essays
Authors: Jonathan T. Morgan, Katie Derthick, Toni Ferro, Elly Searle, Mark Zachry, Travis Kriplean
Venue: Proceedings of the 27th ACM international conference on Design of communication (2009)

This poster presents ongoing research on how discursive and editing behaviors are regulated on Wikipedia by means of documented rules and practices. Our analysis focuses on three types of collaboratively-created policy document (policies, guidelines and essays), that have been formalized to different degrees and represent different degrees of community investment. We employ a content analysis methodology to explore how these regulating texts differ according to a) the aspects of editor behavior, content standards and community principles that they address, and b) how they are used by Wikipedians engaged in 'talk' page discussions to inform, persuade and coordinate with one another.
Code combination for blind channel estimation in general MIMO-STBC systems
Authors: Javier Vía, Ignacio Santamaría, Jesús Pérez
Venue: EURASIP Journal on Advances in Signal Processing (2009)

The problem of blind channel estimation under space-time block coded (STBC) transmissions is addressed. Firstly, a blind channel estimation criterion that generalizes previous works is proposed. The technique is solely based on second-order statistics (SOS) and if the channel is identifiable, the estimate is obtained as the main eigenvector of a generalized eigenvalue problem (GEV). Secondly, a new transmission technique is proposed to solve the indeterminacies associated to the blind channel estimation problem. The technique is based on the combination of different STBCs, and it can be reduced to a nonredundant precoding consisting in the rotation or permutation of the transmit antennas. Unlike other previous approaches, the proposed technique does not imply a penalty in the transmission rate or capacity of the STBC system, while it is able to avoid the ambiguities in many practical cases, which is illustrated by means of some simulation examples.
On Hardness of Pricing Items for Single-Minded Bidders
Authors: Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

We consider the following item pricing problem which has received much attention recently. A seller has an infinite numbers of copies of n items. There are m buyers, each with a budget and an intention to buy a fixed subset of items. Given prices on the items, each buyer buys his subset of items, at the given prices, provided the total price of the subset is at most his budget. The objective of the seller is to determine the prices such that her total profit is maximized.In this paper, we focus on the case where the buyers are interested in subsets of size at most two. This special case is known to be APX-hard (Guruswami et al [1]). The best known approximation algorithm, by Balcan and Blum, gives a 4-approximation [2]. We show that there is indeed a gap of 4 for the combinatorial upper bound used in their analysis. We further show that a natural linear programming relaxation of this problem has an integrality gap of 4, even in this special case. Then we prove that the problem is NP-hard to approximate within a factor of 2 assuming the Unique Games Conjecture; and it is unconditionally NP-hard to approximate within a factor 17/16. Finally, we extend the APX-hardness of the problem to the special case in which the graph formed by items as vertices and buyers as edges is bipartite.We hope that our techniques will be helpful for obtaining stronger hardness of approximation bounds for this problem.
Enzyme Relational Network Reveals Target Enzymes within Metabolic Submodules
Authors: Chalothorn Liamwirat, Supapon Cheevadthanarak, Asawin Meechai, Sakarindr Bhumiratana
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

Identification of enzyme targets for metabolic engineering requires a global view of the functional relationship among enzymes within metabolic network. In this paper, we propose a method to construct an enzyme relational network based on the significant effect of the rate change of one reaction on the rate of another reaction. We illustrate the method by using a kinetic model to formulate the enzyme relational network of the sucrose-to-starch conversion process. The network obtained shows two separate submodules, one of which possesses the enzymes located in cytosol; the other, in amyloplast. The network reveals that ADP-glucose pyrophosphorylase and inorganic pyrophosphatase are potential target enzymes for metabolic engineering to improve starch yield.
Integrating the Normal Field of a Surface in the Presence of Discontinuities
Authors: Jean-Denis Durou, Jean-François Aujol, Frédéric Courteille
Venue: Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition (2009)

We show how to integrate the normal field of a surface in the presence of discontinuities by three different ways. We obtain very satisfactory 3D-reconstructions, from the point of view of the accuracy of the reconstructions. As an important consequence, no prior segmentation of the scene into parts without discontinuity is required anymore. Finally, we test the three proposed methods of integration in the framework of photometric stereo, a technique which aims at computing the normal field of a scene surface from several images of this scene lighted under different directions.
Algorithms for Scheduling Distributed Tasks of Ordered Communication on a Realistic Model of Heterogeneous Grids
Authors: Cho-Chin Lin, Chih-Hsuan Hsu
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Grid computing provides a platform for users to access the worldwide distributed resources. To meet the timing and quality requirements imposed bythe tasks running on the grid, the resources required by the tasks needs to be carefully scheduled. In the last decade, a lot of scheduling algorithms have been proposed to squeeze the computing power from a grid. However, many of them do not consider the message-sending order imposed by the programming syntax or do not employ the information provided by the scheduled subtasks. In this paper, two scheduling algorithms COB and DDR which take the useful information into consideration are proposed. The COB schedules tasks according to the communication restriction imposed by the programming syntax. The DDR schedules tasks by incrementally computing the rank values of the subtasks based on the information provided by the scheduled subtasks. In this paper, the usefulness and effectiveness are demonstrated by comparing our algorithms with the well known scheduling algorithms HEFT and CPOP.
Human motion recognition using support vector machines
Authors: Dongwei Cao, Osama T. Masoud, Daniel Boley, Nikolaos Papanikolopoulos
Venue: Computer Vision and Image Understanding (2009)

We propose a motion recognition strategy that represents each videoclip by a set of filtered images, each of which corresponds to a frame. Using a filtered-image classifier based on support vector machines, we classify a videoclip by applying majority voting over the predicted labels of its filtered images and, for online classification, we identify the most likely type of action at any moment by applying majority voting over the predicted labels of the filtered images within a sliding window. We also define a classification confidence and the associated threshold in both cases, which enable us to identify the existence of an unknown type of motion and, together with the proposed recognition strategy, make it possible to build a real-time motion recognition system that cannot only make classifications in real-time, but also learn new types of motions and recognize them in the future. The proposed strategy is demonstrated on real datasets.
Planning graph as a (dynamic) CSP: exploiting EBL, DDB and other CSP search techniques in Graphplan
Authors: Subbarao Kambhampati
Venue: Journal of Artificial Intelligence Research (2000)

This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search techniques to the Graphplan algorithm. It then describes how explanation based learning, dependency directed backtracking, dynamic variable ordering, forward checking, sticky values and random-restart search strategies can be adapted to Graphplan. Empirical results are provided to demonstrate that these augmentations improve Graphplan's performance significantly (up to 1000x speedups) on several benchmark problems. Special attention is paid to the explanation-based learning and dependency directed backtracking techniques as they are empirically found to be most useful in improving the performance of Graphplan.
Design and Implementation of High Availability Distributed System Based on Multi-level Heartbeat Protocol
Authors: Fei-fei Li, Xiang-zhan Yu, Gang Wu
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Heartbeat mechanism is widely used in designing high availability distributed system. In this paper, we design a multi-level heartbeat protocol, which consists of two kinds of heartbeat protocols: multipoint heartbeat protocol and bidirectional heartbeat protocol. Multi-level heartbeat protocol is very convenient for the nodes to join and leave the heartbeat protocol and can also avoid the single point of failure which will cause fatal fault to the system. We then implement a high availability distributed system based on multi-level heartbeat protocol and at the same time adopt fish effect and task redistribute mechanism to avoid the single point of failure. All of these can acquire high availability.
Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems
Venue: ACM International Conference Proceeding Series (2009)

Over 90 percent of all microprocessors are now used for real-time and embedded applications, and the behavior of many of these applications is constrained by the physical world. Higher-level programming languages and middleware are needed to robustly and productively design, implement, compose, integrate, validate, and enforce real-time constraints along with conventional functional requirements and reusable components. It is essential that the production of real-time embedded systems can take advantage of languages, tools, and methods that enable higher software productivity. The Java programming language has become an attractive choice because of its safety, productivity, its relatively low maintenance costs, and the availability of well trained developers. Although it features good software engineering characteristics, standard Java is unsuitable for developing real-time embedded systems, mainly due to under-specification of thread scheduling and the presence of garbage collection. These problems are addressed by the Real-Time Specification for Java (RTSJ). The intent of this specification is to enable the development of real-time applications by providing several additions, such as extending the Java memory model and stronger semantics in thread scheduling. Interest in real-time Java in both the research community and industry has recently increased significantly, because of its challenges and its potential impact on the development of embedded and real-time applications. The goal of the proposed workshop is to gather researchers working on real-time and embedded Java to identify the challenging problems that still need to be solved in order to assure the success of real-time Java as a technology, and to report results and experiences gained by researchers. This year the following two topics are of special interest: &bull; Open source solutions &bull; Multiprocessor and distributed real-time Java Open source software and hardware solutions have received growing attention in recent years; major vendors of Java technology have adopted the open source development model for some of their products. Open source development benefits from distributed peer review and transparency and enables easy verification of published results. Access to the source code also stimulates building upon prior work, as it allows to reuse tested and reviewed components. Nowadays, real-time systems demand more functionality than in previous years. Consequently the execution platforms are often multiprocessors or distributed systems. Although the Real- Time Specification for Java has addressed some multiprocessor issues, other issues are still outstanding. Furthermore, defining the appropriate RTSJ abstractions for distributed real-time programming is still an open topic.
My 27-year Quest to Overcome the State Explosion Problem
Authors: Edmund M. Clarke
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

Model Checking is an automatic verification technique for state-transition systems that are finite-state or that have finite-state abstractions. In the early 1980's in a series of joint papers with my graduate students E.A. Emerson and A.P. Sistla, we proposed that Model Checking could be used for verifying concurrent systems and gave algorithms for this purpose. At roughly the same time, Joseph Sifakis and his student J.P. Queille at the University of Grenoble independently developed a similar technique. Model Checking has been used successfully to reason about computer hardware and communication protocols and is beginning to be used for verifying computer software. Specifications are written in temporal logic, which is particularly valuable for expressing concurrency properties. An intelligent, exhaustive search is used to determine if the specification is true or not. If the specification is not true, the Model Checker will produce a counterexample execution trace that shows why the specification does not hold. This feature is extremely useful for finding obscure errors in complex systems. The main disadvantage of Model Checking is the state-explosion problem, which can occur if the system under verification has many processes or complex data structures. Although the state-explosion problem is inevitable in worst case, over the past 27 years considerable progress has been made on the problem for certain classes of state-transition systems that occur often in practice. In this talk, I will describe what Model Checking is, how it works, and the main techniques that have been developed for combating the state explosion problem. 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
Mining User Position Log for Construction of Personalized Activity Map
Authors: Hui Fang, Wen-Jing Hsu, Larry Rudolph
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

Consider a scenario in which a smart phone automatically saves the user's positional records for personalized location-based applications. The smart phone will infer patterns of user activities from the historical records and predict user's future movements. In this paper, we present algorithms for mining the evolving positional logs in order to identify places of significance to user and representative paths connecting these places, based on which a personalized activity map is constructed. In addition, the map is designed to contain information of speed and transition probabilities, which are used in predicting the user's future movements. Our experiments show that the user activity map well matches the actual traces and works effectively in predicting user's movements.
PRESAGE: A Programming Environment for the Simulation of Agent Societies
Authors: Brendan Neville, Jeremy Pitt
Venue: Programming Multi-Agent Systems: 6th International Workshop, ProMAS 2008, Estoril, Portugal, May 13, 2008. Revised Invited and Selected Papers (2009)

The paradigm of agent societies has proved particularly apposite for modelling multi-agent systems for networked applications, in particular when the network is open, dynamic and decentralised. In this paper, we describe a software environment which can be used for simulation and animation of these models, allowing a system designer to investigate the complex social behaviour of components, the evolution of network structures, and the adaptation of conventional rules. Effectively, the environment serves as a rapid prototyping tool for agent societies, where the focus of interest is long-term, global system behaviour as much as the verification of specific properties.