ppxscal/embedding_network huggingface dataset:
Self-encoded spread spectrum synchronization and cooperative diversity
Authors: Lim Nguyen
Venue:  (2008)

This dissertation research concerns a novel self-encoded spread spectrum. It provides a feasible practical implementation for random spreading codes. The traditional transmit and receive PN code generators are not needed. Instead, the spreading codes are extracted from the user's information bits itself. Comparing to conventional CDMA, SESS completely abandons the use of pseudo-random spreading codes. The code variability doesn't depend on the spreading length like pseudo-random codes. But because the self-encoded spreading sequence is random and time varying, data recovery requires that the despreading sequence be identical with the spreading sequence at the start of the transmission. Synchronization is one of the key techniques in SESS which seeks to recover the initial spreading sequence at the receiver without any prior knowledge. It includes two phases: initial acquisition and tracking. We consider initial acquisition as a global optimization problem and employ genetic search algorithm for converging to the global optimization efficiently. In the tracking phase, we use Markov chain analysis to examine the mean tracking time. We can verify them by simulation results as sequence length N=8. By comparing the analytical and simulation results, we can conclude that the Genetic model and Markov chain analysis can describe the process of the synchronization of SESS system reliably. We extended such synchronization model of SESS to longer sequence length as N=64 and achieved the shortest synchronization time by setting an optimum threshold. Optimal parameters are also considered to improve the synchronization time. We also consider incorporating SESS with cooperative diversity technique to achieve spatial diversity gain with the number of relays. We observe the system's stability in highly correlated rayleigh channels as well as in severe fading channels. Meanwhile, we also consider channel coding for time diversity gain (together with the soft decision Viterbi detection in receiver). Notice that we achieve both time diversity and special diversity while maintaining the same average power as the maximum ratio combiner.
Co-evolutionary automatically defined functions in genetic programming
Authors: Anthony Lukas, Franz Oppacher
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

We show how the addition of co-evolution to genetic programming (GP) overcomes the current limitations of GP as well as GP augmented with automatically defined functions (GP+ADF) with a method called co-evolutionary automatically defined functions (GP+CADF). We demonstrate that GP+CADF requires a lower computational effort to solve the parity, sum of bits, image recognition, lawn coverage and the bumblebee problems. To further improve GP+CADF, we discover that using elitism lowers the computational effort required. We also discover ways to improve the initial population and initial best individuals used for evaluation.
A new Approach for Solving Satisfiability Problems with Qualitative Preferences
Authors: Emanuele Di Rosa, Enrico Giunchiglia, Marco Maratea
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previous papers, it has been shown that qualitative preferences on literals allow for capturing qualitative/quantitative preferences on literals/formulas; and that an optimal model for a satisfiability problems with qualitative preferences on literals can be computed via a simple modification of the Davis-Logemann-Loveland procedure (DLL): Given a SAT formula, an optimal solution is computed by simply imposing that DLL branches according to the partial order on the preferences. Unfortunately, it is well known that introducing an ordering on the branching heuristic of DLL may cause an exponential degradation in its performances. The experimental analysis reported in these papers hightlights that such degradation can indeed show up in the presence of a significant number of preferences. In this paper we propose an alternative solution which does not require any modification of the DLL heuristic: Once a solution is computed, a constraint is added to the input formula imposing that the new solution (if any) has to be better than the last computed. We implemented this idea, and the resulting system can lead to significant improvements wrt the original proposal when dealing with MIN-ONE/MAX-SAT problems corresponding to qualitative preferences on structured instances.
Fast algorithms for multivariate interpolation and evaluation at special points
Authors: Joanna Kapusta, Ryszard Smarzewski
Venue: Journal of Complexity (2009)

In this paper we present explicit formulae for the multivariate Lagrange-Newton transformation T:K^n^"^1^x^n^"^2^x^...^x^n^"^d->K^n^"^1^x^n^"^2^x^...^x^n^"^d and its inverse T^-^1 with respect to points x"i","j=@l"ix"i","j"-"1+@d"i (i=1,2,...,d,j=1,2,...,n"i-1), where @l"i
Artificial Intelligence and Unmanned Aerial Vehicles
Authors: Patrick Doherty
Venue: Proceeding of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium (2006)

The emerging area of intelligent unmanned aerial vehicle (UAV) research has shown rapid development in recent years and offers a great number of research challenges within the artificial intelligence and knowledge representation disciplines. In my talk I will present some of the research currently being pursued and results achieved in our group at Linköping University, Sweden. The talk will focus on artificial intelligence techniques used in our UAV systems and the support for these techniques provided by the software architecture developed for our UAV platform, a Yamaha RMAX helicopter. Additional focus will be placed on some of the planning and execution monitoring functionality developed for our applications in the areas of photogrammetry and emergency services assistance. The talk will include video demonstrations of both single and multi-platform missions and a possible live demonstration of a micro-UAV, the LINKMAV, developed in our group.
Application and Evaluation of a Medical Knowledge System in Sonography (SONOCONSULT)
Authors: Frank Puppe, Martin Atzmueller, Georg Buscher, Matthias Huettig, Hardi Luehrs, Hans-Peter Buscher
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

This paper presents the knowledge-system SONOCONSULT --an intelligent system in the medical domain. We evaluated the accuracy, acceptance and impact of SONOCONSULT, which has been used in clinical routine since 2002. The system was well accepted and had a significant clinical impact. In contrast to our original expectations, the diagnostic conclusions, although inferred with high accuracy, were less important especially for experienced physicians.
Personalized retrieval of sports video based on multi-modal analysis and user preference acquisition
Authors: Yi-Fan Zhang, Changsheng Xu, Xiaoyu Zhang, Hanqing Lu
Venue: Multimedia Tools and Applications (2009)

In this paper, we present a novel framework on personalized retrieval of sports video, which includes two research tasks: semantic annotation and user preference acquisition. For semantic annotation, web-casting texts which are corresponding to sports videos are firstly captured from the webpages using data region segmentation and labeling. Incorporating the text, we detect events in the sports video and generate video event clips. These video clips are annotated by the semantics extracted from web-casting texts and indexed in a sports video database. Based on the annotation, these video clips can be retrieved from different semantic attributes according to the user preference. For user preference acquisition, we utilize click-through data as a feedback from the user. Relevance feedback is applied on text annotation and visual features to infer the intention and interested points of the user. A user preference model is learned to re-rank the initial results. Experiments are conducted on broadcast soccer and basketball videos and show an encouraging performance of the proposed method.
Analyses and Improvement of Case-Based Decision Model of Product Conceptual Design
Authors: Qing Wang, Yong Zhao, Congjun Rao
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

The present article describes a case-based decision model at the background of product conceptual design. The notion of the bounded rationality in the process of estimating similarity is used for proposing an improved similarity algorithm based on a distance threshold. The general algorithm and the improved algorithm are used to analyze the similarity between new target and finished products for conceptual design of circular gear reducers. An example validates the improved algorithm can effectively exclude useless cases.
Learning method based on collaborative assessment performed by the students: an application to computer science
Authors: Higinio Mora Mora, María Teresa Signes Pont, Rafael Camps Jordá, Juan Manuel García Chamizo
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

This paper describes a novel method of assessment, which is being tested in the subject "Basic Computer Science". This subject is given in the fist year of the Computer Science and Engineering course, at the University of Alicante. This method consists in including the students in the assessment process of their own work, through crossed reviews where the students identify possible improvements in their classmate's work that can be performed in the successive deliveries of the same work.
The TERMINAE Method and Platform for Ontology Engineering from Texts
Authors: Nathalie Aussenac-Gilles, Sylvie Despres, Sylvie Szulman
Venue: Proceeding of the 2008 conference on Ontology Learning and Population: Bridging the Gap between Text and Knowledge (2008)

Designed about ten years ago, the TERMINAE method and workbench for ontology engineering from texts have been going on evolving since then. Our investigations integrate the experience gained through its use in industrial and academic projects, the progress of natural language processing as well as the evolution of the ontology engineering. Several new methodological guidelines, such as the reuse of core ontologies, have been added to the method and implemented in the workbench. It has also been modified in order to be compliant to some recent standards such as the OWL knowledge representation. The paper recalls the terminology engineering principles underlying TERMINAE and comments its originality. Then it presents the kind of conceptual model that is built with this method, and its knowledge representation. The method and the support provided by the workbench are detailed and illustrated with a case-study in law. With regard to the state of the art, TERMINAE is one of the most supervised methods in the trend of ontology learning. This option raises epistemological issues about how language and knowledge can be articulated and the distance that separate formal ontologies from learned conceptual models.
E-TLSS: a powerful e-learning tool for structural synthesis of TL circuits
Authors: Elena Doicaru, Claudius Dan
Venue: Proceedings of the 2nd conference on European computing conference (2008)

This paper introduces a software support tool for an advanced electronics laboratory session on circuit synthesis. The application provides the students with a handy tool for structural synthesis of translinear circuits. For a given arbitrary function the program yields a set of realizations, with BJT or MOSFET, which are automatically compared by SPICE simulation, considering the criteria: stability, bandwidth and magnitude of circuit - induced errors. The software tool was developed in C++ code using Visual C++ 2005 programming environment and is specifically designed for students' use, providing a friendly, intuitive interface.
Towards safe and flexible object adaptation
Authors: Tetsuo Kamina, Tetsuo Tamai
Venue: International Workshop on Context-Oriented Programming (2009)

In this paper, a programming language NextEJ is proposed. NextEJ is based on Epsilon model, which realizes object adaptation to contexts. The novelty of Epsilon model is its ability to make objects be able to freely enter or leave contexts dynamically and belong to multiple contexts at a time. However, such kind of flexibility also easily brings type-unsafety. NextEJ tackles this problem by introducing a new feature called context activation scope. Inside a context activation scope, it is assured that an object is always bound with the role activated so that no method-not-understood errors occur at run-time. Furthermore, context activation scope can be nested so that multiple contexts can be activated at a time. A role instance has a pre-defined field thisContext which refers to its enclosing context instance. In the case of multiple context activations, the reference of thisContext is interpreted as a composite context whose behavior is determined by the order of activations.
Database Design in Plain English: A Simplified Guide for Anyone To Understand Database Concepts Using a Step-By-Step Approach
Authors: Joe Herzog
Venue:  (2007)

With 'Database Design in Plain English', you will learn what a database is, why it is useful for you in your day-to-day activities, and how to create a basic database. With the knowledge from 'Database Design in Plain English', you will have the tools to move on to more complex, software-specific books and software, armed with a clear understanding of the terminology you will encounter. Real-world concepts will replace abstract terminology - baseball instead of computer bits - to bring the data relationships into simple, easy to understand terms. In addition, each chapter has several exercises (and solutions) to help you test yourself and make sure you're 'getting it.' Sound good? Then this is the book for you! As you read and learn, you will actually design your own database! This is the book you've been waiting for. Get started today! 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
Analysis of Kim-Jeon-Yoo Password Authentication Schemes
Authors: Jiqiang Liu, Sheng Zhong
Venue: Cryptologia (2009)

Password authentication is a type of authentication protocol for communications over an insecure network. Recently, Kim, Jeon, and Yoo gave an improvement of Yang-Shieh password authentication schemes to resist an existing forgery attack. However, in this paper, we construct a new forgery attack and show that Kim-Jeon-Yoo schemes are not secure under our attack.
Distributed Visual Processing for a Home Visual Sensor Network
Authors: Kwangsu Kim, Gerard G. Medioni
Venue: Proceedings of the 2008 IEEE Workshop on Applications of Computer Vision (2008)

We address issues dealing with distributed visual processing for a personal service robot in the Intelligent Home environment. We propose an efficient and reliable framework to organize and coordinate the vision sensor nodes: fixed cameras mounted on walls, and camera(s) on the mobile robot. We also propose key visual functionalities necessary for the robot to perform its activities. They include people detection and identification, action recognition, gesture recognition, and self-localization. We propose solutions to the different vision tasks, and present our implementation within this framework, validated with experimental results.
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
Authors: Scott Hauck, Andre DeHon
Venue: Systems On Silicon (2007)

The main characteristic of Reconfigurable Computing is the presence of hardware that can be reconfigured to implement specific functionality more suitable for specially tailored hardware than on a simple uniprocessor. Reconfigurable computing systems join microprocessors and programmable hardware in order to take advantage of the combined strengths of hardware and software and have been used in applications ranging from embedded systems to high performance computing. Many of the fundamental theories have been identified and used by the Hardware/Software Co-Design research field. Although the same background ideas are shared in both areas, they have different goals and use different approaches.This book is intended as an introduction to the entire range of issues important to reconfigurable computing, using FPGAs as the context, or "computing vehicles" to implement this powerful technology. It will take a reader with a background in the basics of digital design and software programming and provide them with the knowledge needed to be an effective designer or researcher in this rapidly evolving field. . Treatment of FPGAs as computing vehicles rather than glue-logic or ASIC substitutes. Views of FPGA programming beyond Verilog/VHDL. Broad set of case studies demonstrating how to use FPGAs in novel and efficient ways
RichVSM: enRiched vector space models for folksonomies
Authors: Rabeeh Abbasi, Steffen Staab
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

People share millions of resources (photos, bookmarks, videos, etc.) in Folksonomies (like Flickr, Delicious, Youtube, etc.). To access and share resources, they add keywords called tags to the resources. As the tags are freely chosen keywords, it might not be possible for users to tag their resources with all the relevant tags. As a result, many resources lack sufficient number of relevant tags. The lack of relevant tags results into sparseness of data, and this sparseness of data makes many relevant resources unsearchable against user queries. In this paper, we explore two dimensions of semantic relationships between tags, based on the context and the distribution of tags. We exploit semantic relationships between tags to reduce sparseness in Folksonomies and propose different enriched vector space models. We also propose a vector space model Best of Breed which utilizes appropriate enrichment method based on the type of the query. We evaluate the proposed methods on a large dataset of 27 million resources, 92 thousand tags and 94 million tag assignments. Experimental results show that the enriched vector space models help in improving search, especially for the rare queries which have few relevant resources in the sparse data.
Simulation of attached growth biological wastewater treatment process in the mobile bed biofilm reactor
Authors: Diana Robescu, Aurelia Calin, Dan Robescu, Bogdan Nasaramba
Venue: Proceedings of the 10th WSEAS international conference on Mathematics and computers in biology and chemistry (2009)

The biological wastewater treatment process is one of the most efficient processes to remove organic compounds from wastewater. More than 80% of the existing wastewater treatment plants the activated sludge process in which suspended bacteria oxidize the carbonaceous and nitrogen compounds, so that effluents in accordance with the imposed standards are obtained. The biological process was improved during the last few years. One of these new processes is obtained by the addition of specially designed mobile elements into the aeration tank that provide the carriers for the biological growth. This paper presents some simulation results of this process for various scenarios, using different loading conditions and percentage of the total volume of the tank occupied by the carrier media. Theoretical results are compared with experimental ones. Another set of simulations was performed for a combined biofilm-activated sludge process in order to evaluate the operation performances and to see if the proposed technology provides good result.
Enforcing Security Policies on Programs
Authors: Hakima Ould-Slimane, Mohamed Mejri, Kamel Adi
Venue: Proceeding of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06 (2006)

In this paper, we present a formal technique for enforcing security policies on programs. Our technique takes an untrusted program and a security policy as input and produces a new safe program with respect to the considered policy. The proposed technique is based on the use of automata and a special composition operator called injection over automata. Injection consists in embedding the automaton representing the safety property into the automaton representing the untrusted program, so that we get a new automaton. This latter can merely be converted into a safe program which always satisfies the safety property. Consequently, our enforcement method is based on rewriting, since it takes an untrusted program and transforms it, so it produces another equivalent program satisfying the safety property. Finally, we prove that our technique is both sound and complete, i.e.: all the possible executions of the new generated program are possible executions of the original one and any possible execution of the original program respecting the security policy is a possible execution of the new generated one.
Request-driven swarming scheme for P2P data streaming
Authors: Jialing Xu, Victor O. K. Li
Venue: Computer Communications (2009)

Data streaming by swarming over peer-to-peer (P2P) overlay networks has attracted much attention in recent years and initially the swarming solution is based on data-driven schemes. This paper presents a new request-driven swarming scheme. The scheme offers several advantages: high efficiency in data delivery, low control overhead, and flexibility in streaming control. Some key issues on the design of the relevant scheduling and forwarding mechanisms are discussed. In addition, we present a scheduling model for this scheme and propose some heuristics. Our evaluation of these heuristics reveals that there is a tradeoff among performance metrics such as delivery reliability, loading on the underlay network, and on the streaming overlay network. Comparing our proposed request-driven scheme with an existing data-driven scheme using computer simulation, we find that our request-driven scheme incurs much lower control overhead while providing comparable or better efficiency in data delivery.
Why Applying Agent Technology to Autonomic Computing?
Authors: Walid Chainbi
Venue: Proceeding of the 2005 conference on Self-Organization and Autonomic Informatics (I) (2005)

Recently, an interest has been witnessed in computing community to autonomic computing. Inspired by the functioning of the human nervous systems, autonomic computing is to design and build computing systems that posses inherent self-managing capabilities. While autonomic computing is a quite new revolutionary move to the discipline of computing and so far a holistic solution has not yet appeared, we argue in this paper that agent technology is already available for being integrated into the framework of autonomic computing. Starting with the high degree of match between agent systems and autonomic systems, an in-depth analysis is presented to denote that agent architectural concepts are crucially important.
Control network programs and their execution
Authors: Kostadin Kratchanov, Emilia Golemanova, Tzanko Golemanov
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

Control Network Programming (CNP) as a new programming paradigm has been presented elsewhere, and the CNP approach has been illustrated through solving representative typical applications, many of which belong to the AI area. This report aims at more fully specifying the interpretation of a CN program, and how the inherently nondeterministic CN program will be computed.