ppxscal/embedding_network huggingface dataset:
Learning long-range vision for autonomous off-road driving
Authors: Raia Hadsell, Pierre Sermanet, Jan Ben, Ayse Erkan, Marco Scoffier, Koray Kavukcuoglu, Urs Muller, Yann LeCun
Venue: Journal of Field Robotics (2009)

Most vision-based approaches to mobile robotics suffer from the limitations imposed by stereo obstacle detection, which is short range and prone to failure. We present a self-supervised learning process for long-range vision that is able to accurately classify complex terrain at distances up to the horizon, thus allowing superior strategic planning. The success of the learning process is due to the self-supervised training data that are generated on every frame: robust, visually consistent labels from a stereo module; normalized wide-context input windows; and a discriminative and concise feature representation. A deep hierarchical network is trained to extract informative and meaningful features from an input image, and the features are used to train a real-time classifier to predict traversability. The trained classifier sees obstacles and paths from 5 to more than 100 m, far beyond the maximum stereo range of 12 m, and adapts very quickly to new environments. The process was developed and tested on the LAGR (Learning Applied to Ground Robots) mobile robot. Results from a ground truth data set, as well as field test results, are given. &copy; 2009 Wiley Periodicals, Inc.
A Discrete Model for a Network Having Broken Packages
Authors: Dana Simian, Vladislav Georgiev, Corina Simian
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

Broken packages are packages with not enough information regarding the destination address and they have a negative impact on a computer network. Broken packages stay in the router too much time and overload it. This is a real problem which appears in the computer network of Sofia University. We know only the time when a broken package arrives in the router. The problem is to find the computer which send broken packages. The aim of this article is to propose a model for defining the data transmission stability and correctness in a computer network. Our theoretical model is temporal dependent and captures the transmission properties of a computer network.
Towards using architectural knowledge
Authors: Paris Avgeriou, Patricia Lago, Philippe Kruchten
Venue: ACM SIGSOFT Software Engineering Notes (2009)

The third workshop on Sharing and Reusing Architectural Knowledge (SHARK) was held jointly with ICSE 2008 in Leipzig, Germany. It featured two keynote talks, thirteen research position statements and three working groups that discussed on focused topics. This report presents the themes of the workshop, summarizes the results of the discussions held, and suggests some topics for future research.
Knowledge discovery query language (KDQL)
Authors: Zakaria Suliman Zubi
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

KDD is a rapidly expanding field with promise for great applicability. Knowledge discovery became the new database technology for the incoming years. The need for automated discovery tools caused an explosion in the number and type of tools available commercially and in the public domain. These requirements encouraged us to propose a new KDD model so called ODBC_KDD(2) described in [39]. "One of the ODBC_KDD(2) model requirements is the implementation of a query language that could handle DM rules"[40]. This query language called Knowledge Discovery Query Language (KDQL). KDQL is a companion of two major tasks in KDD such as DM and Data Visualization. These requirements motivates us to think for the possibility of joining the two tasks of KDD commonly known as Data Mining (DM) and Data Visualization (DV) together in one single KDD process. Integrating DM and DV requires a new database concept. This database concept is called "i-extended database". I-extended database will be retrieved by the use of KDQL. This I-extended database described in details in [42]. KDQL RULES operations were also theoretically proposed in this paper and some examples were given as well. KDQL RULES are used only to find out the association rules in i-extended database we have. The development and results of this paper would contribute to the data mining and visualization fields in several ways. The formulation of a set of heuristics for algorithms selection will help to clarify the matching between a specific problem and the set of best-suited algorithms or techniques (i.e. association rules) for solving it. These guidelines are expected to be useful and applicable to real DM projects.
A Flexible Privacy-Enhanced Location-Based Services System Framework and Practice
Authors: Yan Sun, Thomas F. La Porta, Parviz Kermani
Venue: IEEE Transactions on Mobile Computing (2009)

Location based services(LBS) are becoming increasingly important to the success and attractiveness of next generation wireless systems. However, a natural tension arises between the need for user privacy and the flexible use of location information. In this paper we present a framework to support privacy enhanced location based services. We classify the services according to several basic criteria and we propose a hierarchical key distribution method to support these services. The key idea behind the system is to hierarchically encrypt location information under different keys, and distribute the appropriate keys only to group members with the necessary permission. Four methods are proposed to deliver hierarchical location information while maintaining privacy. We propose a key tree rebalancing algorithm to maintain the re-keying performance of the group key management. Furthermore, we present a practical LBS system implementation. Hierarchical location information coding offers flexible location information access which enables a rich set of location based services. Our load tests show such a system is highly practical with good efficiency and scalability.
Real-time deterministic chaos control by means of selected evolutionary techniques
Authors: Ivan Zelinka
Venue: Engineering Applications of Artificial Intelligence (2009)

This contribution introduces continuation of an investigation on deterministic spatiotemporal chaos real-time control by means of selected evolutionary techniques. Real-time-like behavior is specially defined and simulated with the spatiotemporal chaos model based on mutually nonlinearly joined n equations, so-called coupled map lattices (CML). Four evolutionary algorithms are used for chaos control here: differential evolution, self-organizing migrating algorithm, genetic algorithm and simulated annealing in a total of 12 versions. For modeling of real-time spatiotemporal chaos behavior, the so-called CML were used based on logistic equation to generate chaos. The main aim of this investigation was to show that evolutionary algorithms, under certain conditions, are capable of real-time control of deterministic chaos, when the cost function is properly defined as well as parameters of selected evolutionary algorithm. Investigation consists of four different case studies with increasing simulation complexity. For all algorithms, each simulation was repeated 100 times to show and check robustness of used methods. All data were processed and used in order to get summarizing results and graphs.
SmartPlayer: user-centric video fast-forwarding
Authors: Kai-Yin Cheng, Sheng-Jie Luo, Bing-Yu Chen, Hao-Hua Chu
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

In this paper we propose a new video interaction model called adaptive fast-forwarding to help people quickly browse videos with predefined semantic rules. This model is designed around the metaphor of scenic car driving, in which the driver slows down near areas of interest and speeds through unexciting areas. Results from a preliminary user study of our video player suggest the following: (1) the player should adaptively adjust the current playback speed based on the complexity of the present scene and predefined semantic events; (2) the player should learn user preferences about predefined event types as well as a suitable playback speed; (3) the player should fast-forward the video continuously with a playback rate acceptable to the user to avoid missing any undefined events or areas of interest. Furthermore, our user study results suggest that for certain types of video, our SmartPlayer yields better user experiences in browsing and fast-forwarding videos than existing video players' interaction models.
The Elements of General Equilibrium Theory
Authors: Herbert E. Scarf
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

The lecture will be an introduction to the model of economic equilibrium. The basic concepts: preferences, initial endowments and market clearing prices will discussed - in general and by means of examples. I will indicate how fixed point theorems are used to demonstrate the existence of equilibrium prices and sketch an algorithm for Brouwers theorem. If time permits, there will be some remarks on equilibrium models with production. 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
PAMS --- A New Collaborative Framework for Agent-Based Simulation of Complex Systems
Authors: Trong Khanh Nguyen, Nicolas Marilleau, Tuong Vinh Ho
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

Major researches in the domain of complex systems are interdisciplinary, collaborative and geographically distributed. The purpose of our work is to explore a new collaborative approach that facilitates scientist's interactions during the modelling and simulating process. The originality of the presented approach is to consider models and simulators as a board of the collaboration: a shared object manipulated by a group of scientists. Agent-based simulations are powerful tools for studying complex systems. In this context, we develop a collaborative platform dedicated to agent-based simulation (PAMS). This new environment integrates common collaborative tools (e.g. videoconferencing, instant messaging, whiteboard) and specific tools to share and manipulate models, simulators, experiments and results... The current version of PAMS is based technologies coming from distributed systems. Today PAMS has been designed to support major agent based simulation frameworks. This paper aims to give an overview of the PAMS environment by defining the collaborating approach, the framework architecture and an example of its utilization.
A framework ensuring privacy in a distributed environment
Authors: Dhiah el Diehn I. Abou-Tair
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

In the age of Internet and loosely coupled applications, privacy has become a matter of concern. Individuals lose track of their personal data and have no control over databases and information systems containing their personal data. In the field of distributed systems, resarchers focus mainly on how to integrate a variety of systems in a way so that persons benefit from other systems' functionalities and data sources. In general, the integration is done on the business logic layer. As a consequence special properties of data, like privacy properties, are neglected. In fact, it is a big challenge for distributed applications to adapt privacy regulations, to ensure conformity to privacy regulations, and to execute the adaptation process in a transparent and comprehensible form. Unlike most existing work, this paper provides a solution to the problem of adapting privacy regulations in a distributed environment. The framework presented in this study is a novel enterprise architecture that assures privacy according to diverse data privacy regulations and illustrates the adapting process in a transparent and comprehensible form. Moreover, it maintains and enhances additional data privacy properties wherever they apply.
Cross-layer ant based algorithm routing for MANETs
Authors: Jheng-Da Jhong, Chi-Yuang Chang, Han-Chieh Chao
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

How to select route is very important in the Mobile Ad-Hoc Networks. ARAMA [1] can reduce the flooding for route discovery, collecting path information to select the best path and also can have multi-paths for backup and balance. However, it will link break and packet loss when the mobility nodes moving out of the transmission range. In this paper based on receives the signal strength measurements to forecast if the mobile node will moving out of the transmission scope in the next time, and change to the next node before the link interrupting. It collects the MAC layer residual bandwidth, link delay and battery remaining energy information, than utilizes cross-layer to change pheromone value depends on the weight value of QoS parameters, to achieve the reduced packet loss and the selects optimal path.
Communication skills in the CS curriculum
Authors: E. Giangrande,  Jr.
Venue: Journal of Computing Sciences in Colleges (2009)

Over the years it has been pointed out that an important skill for computer science majors is the ability to communicate effectively [1, 3, 9]. Unfortunately, for a variety of reasons, computer science students often never acquire these skills [4]. This paper (a) considers some of the reasons why students do not acquire these skills, (b) reviews some approaches that have been proposed to remedy this situation, (c) presents an argument for defining what these skills are in a more comprehensive manner, and (d) describes how these communication skills can be integrated into a computer science curriculum.
ICam: Maximizes Viewers' Attention on Intended Objects
Authors: Rajarshi Pal, Pabitra Mitra, Jayanta Mukhopadhyay
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Continuous inventions of modern cameras are making the act of good photography easier. This paper proposes a methodology that makes a camera even smarter by converting the objects of interest to the photographer more salient. This results in maximization of viewers' attention on intended objects. The captured photo can be taken as a media of communicating photographer's mind to the potential viewers- in that sense; the proposed methodology reduces the communication gap between them.
Component-based face detection in colour images
Authors: Jamal Ahmad Dargham, Ali Chekima
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

Face detection is an important process in many applications such as face recognition, person identification and tracking, and access control. The technique used for face detection depends on how a face is modelled. In this paper, a face is defined as a skin region and a lips region that meet certain geometrical criteria. Thus, the face detection system has three main components: a skin detection module, a lips detection module, and a face verification module. The Multi-layer perceptron (MLP) neural networks was used for the skin and lips detection modules. In order to test the face detection system, two databases were created. The images in the first database, called In-house, were taken under controlled environment while those in the second database, called WWW, were collected from the World Wide Web and as such have no restriction on lighting, head pose or background. The system achieved a correct detection rate of 87 and 80 percent on the In-house and WWW databases respectively.
New Classification Algorithms for Developing Online Program Recommendation Systems
Authors: Thomas Meller, Eric Wang, Fuhua Lin, Chunsheng Yang
Venue: Proceedings of the 2009 International Conference on Mobile, Hybrid, and On-line Learning (2009)

This paper presents two novel nearest-neighbor-like classification algorithms for program recommendation in a Web-based system, which provides a program planning service to academic advisors and students of post-secondary institutions. To evaluate the accuracy of classification for program recommendations generated by our algorithm, a statistical study was conducted through comparing our algorithm against two well-known classification algorithms, the Naïve Bayes algorithm and the J48 algorithm, for making recommendations to students based on their academic history. The study shows that our proposed nearest-neighbor-like algorithms outperform the two well-known classification algorithms in terms of student classification success rate when there is uncertainty present in the data.
Embedding secret messages based on chaotic map and Huffman coding
Authors: Kuo-Nan Chen, Chin-Feng Lee, Chin-Chen Chang
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

In this paper, an efficient and secure data hiding scheme is proposed. The cover medium is compressed by a revised Huffman coding. Based on the lossless Huffman coding, not only images but also text files can be used as the cover media. The secret information is embedded into the compressed code by using the revised Huffman coding. Before embedding, the secret information is rearranged by a logistic map with a private key for achieving the purpose of security. The experimental results show that our proposed scheme is secure because only the receiver who owns the private key can decrypt the secert information.
The Time Course of Attentional Guidance in Contextual Cueing
Authors: Andrea Schankin, Anna Schubö
Venue: Attention in Cognitive Systems: 5th International Workshop on Attention in Cognitive Systems, WAPCV 2008 Fira, Santorini, Greece, May 12, 2008 Revised Selected Papers (2009)

Contextual cueing experiments show that targets in heterogeneous displays are detected faster with time when displays are repeated, even when observers are not aware of the repetition. Most researchers agree that the learned context guides attention to the target location and thus speeds subsequent target processing. Because in previous experiments one target location was uniquely associated with exactly one configuration, the context was highly predictive. In two experiments, the predictive value of the context was investigated by varying the number of possible target locations. We could show that even when the context was less predictive, it was learned and used to guide visual-spatial attention. However, the time course of learning differed significantly: learning was faster when the number of target locations was reduced. These results suggest that not an association of context and target is learned but that rather the precision of the attention shift improves.
A Low Complexity Algorithm for Channel Estimation of MIMO OFDM System
Authors: Gaoping Hu, Dong Li
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

In this paper, we propose a low complexity algorithm for channel estimation of Multiple Input Multiple Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems in slow time-varying frequency selective environment. The proposed algorithm was an adaptive channel estimation technique based on an expectation maximization (EM) algorithm for space-time block coded (STBC) MIMO OFDM systems. Simulation results show that in slow fading environment there was no degradation in normalized mean square error (MSE) as we increased the number of users. Comparing the Recursive Least-Squares (RLS) algorithm, the proposed algorithm exploits the structure of Alamouti STBC codes to reduce computational complexity.
Low-Complexity Parallel Systolic Montgomery Multipliers over GF(2m) Using Toeplitz Matrix-Vector Representation
Authors: Chiou-Yng Lee
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, a generalized Montgomery multiplication algorithm in GF(2m) using the Toeplitz matrix-vector representation is presented. The hardware architectures derived from this algorithm provide low-complexity bit-parallel systolic multipliers with trinomials and pentanomials. The results reveal that our proposed multipliers reduce the space complexity of approximately 15% compared with an existing systolic Montgomery multiplier for trinomials. Moreover, the proposed architectures have the features of regularity, modularity, and local interconnection. Accordingly, they are well suited to VLSI implementation.
Social computing privacy concerns: antecedents and effects
Authors: Oded Nov, Sunil Wattal
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Social computing systems are increasingly a part of people's social environment. Inherent to such communities is the collection and sharing of personal information, which in turn may raise concerns about privacy. In this study, we extend prior research on internet privacy to address questions about antecedents of privacy concerns in social computing communities, as well as the impact of privacy concerns in such communities. The results indicate that users' trust in other community members, and the community's information sharing norms have a negative impact on community-specific privacy concerns. We also find that community-specific privacy concerns not only lead users to adopt more restrictive information sharing settings, but also reduce the amount of information they share with the community. In addition, we find that information sharing is impacted by network centrality and the tenure of the user in the community. Implications of the study for research and practice are discussed.
Wavelet method for computing energy band diagram of semiconductors
Authors: Majid Sodagar, Amin Eftekharian, Sina Khorasani
Venue: Proceedings of the 6th conference on Microelectronics, nanoelectronics, optoelectronics (2007)

A wavelet expansion is applied for solving Schrödinger equation in order to compute band structure of an electronic crystal. In this paper we have used this method for finding band structure of one dimensional arbitrary potential. As discussed here, this algorithm could be easily applied to two- or three-dimensional arbitrary potentials. This paper is emphasizing on revealing the mathematical aspects of using wavelet expansion in computing electronic band structure. In order to find the full power of wavelets one needs to use this method in 2 or 3 dimension structures.
Partitioning study of fuzzy cognitive map based on GA
Authors: He Yue, Lin Chun-Mei
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

The large knowledge base system partition problem is known to be NP-complete. In this paper, we first present a genetic algorithm for solving the partitioning problem of knowledge base based on fuzzy cognitive map. In the methodology, we utilize the feature of fuzzy cognitive map to construct partition rules and use GA to partition the knowledge base. Finally, an illustrative example is provided, and its results suggest that the method is capable of partitioning fuzzy cognitive map.