ppxscal/embedding_network huggingface dataset:
A Practice Example of Object-Oriented Programming Education Using WebCT
Authors: Shigeru Sasaki, Hiroyoshi Watanabe, Kumiko Takai, Masayuki Arai, Shigeo Takei
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

This paper describes an introductory object-oriented programming course using WebCT. The course is designed as a self-learning course in which each student can learn at his/her own pace and students are expected to adopt the appropriate attitude and be able to learn by themselves through the course. We apply story-based structure in the teaching material contents in order to construct virtually-situated learning and make contents familiar to students.
Influences of gate operation errors in the quantum counting algorithm
Authors: Qing Ai, Yan-Song Li, Gui-Lu Long
Venue: Journal of Computer Science and Technology (2006)

In this article, the error analysis in the quantum counting algorithm is investigated. It has been found that the random error plays as important a role as the systematic error does in the phase inversion operations. Both systematic and random errors are important in the Hadamard transformation. This is quite different from the Grover algorithm and the Shor algorithm.
Top-down design methodology of a multi-bit continuous-time delta---sigma modulator
Authors: A. Mariano, D. Dallet, Y. Deval, J. -B. Bégueret
Venue: Analog Integrated Circuits and Signal Processing (2009)

Transistor-level simulation of complex systems involving analog and digital parts is a time-consuming task. The growing interaction of analog and digital devices calls for the use of top-down design methodologies, resulting in behavioral modeling at different levels of abstraction. In this article, an advanced design methodology using a combination of behavioral models and transistor-level models is presented. This methodology is very interesting for complex mixed-signal IC design, improving the design flexibility and reducing the simulation time. To validate the proposed methodology, a continuous-time delta---sigma modulator based on a high-speed low-resolution quantizer is modeled, taking into account their nonidealities such as excess loop delay, clock jitter and feedback DAC element mismatch. The main features of the multi-bit quantizer are 3-bit resolution with 4 GHz sampling rate and FOM of about 7 pJ/conv. This modulator samples signals at high-IF, performing directly the analog-to-digital conversion in the modern RF front-end receivers.
Explaining media choice: theoretical discussion and an empirical experiment
Authors: Fumihiko Satofuka, Ismo Kantola, Yasuhiko Kono
Venue: AI Society (2009)

The paper is based on a review of research on media selection and related topics on the one hand and on an explorative pilot survey on the other. In summarising the review, the authors propose that the factors explaining media choice be grouped into five categories: (1) the properties of the media itself affect its choice, (2) properties of the user affect media choice, (3) the communication situation plays an important role, (4) macro factors explain media choice, and (5) media choice can be explained as the outcome of a dynamic multiparty negotiation process. The pilot survey compares Japanese and Finnish students&#x2019; preference of media in various communication situations. The survey results encourage reserving, local macro factors or culture, a certain amount of explanatory force in explaining media choice.
Expertise and Intuition: A Tale of Three Theories
Authors: Fernand Gobet, Philippe Chassy
Venue: Minds and Machines (2009)

Several authors have hailed intuition as one of the defining features of expertise. In particular, while disagreeing on almost anything that touches on human cognition and artificial intelligence, Hubert Dreyfus and Herbert Simon agreed on this point. However, the highly influential theories of intuition they proposed differed in major ways, especially with respect to the role given to search and as to whether intuition is holistic or analytic. Both theories suffer from empirical weaknesses. In this paper, we show how, with some additions, a recent theory of expert memory (the template theory) offers a coherent and wide-ranging explanation of intuition in expert behaviour. It is shown that the theory accounts for the key features of intuition: it explains the rapid onset of intuition and its perceptual nature, provides mechanisms for learning, incorporates processes showing how perception is linked to action and emotion, and how experts capture the entirety of a situation. In doing so, the new theory addresses the issues problematic for Dreyfus's and Simon's theories. Implications for research and practice are discussed.
A new probabilistic fuzzy model: Fuzzification--Maximization (FM) approach
Authors: Sungjun Hong, Heesung Lee, Euntai Kim
Venue: International Journal of Approximate Reasoning (2009)

Over the past few decades, fuzzy logic systems have been used for nonlinear modeling and approximation in many fields ranging from engineering to science. In this paper, a new fuzzy model is developed from the probabilistic and statistical point of view. The proposed model decomposes the input-output characteristics into noise-free part and probabilistic noise part and identifies them simultaneously. The noise-free model recovers the nominal input-output characteristics of the target system and the noise model gives approximation to the probabilistic nature of the added noise. To identify the two submodels simultaneously, we propose the Fuzzification-Maximization (FM). Finally, some simulations are conducted and the effectiveness of the proposed method is demonstrated through the comparison with the previous methods.
Deep learning from temporal coherence in video
Authors: Hossein Mobahi, Ronan Collobert, Jason Weston
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

This work proposes a learning method for deep architectures that takes advantage of sequential data, in particular from the temporal coherence that naturally exists in unlabeled video recordings. That is, two successive frames are likely to contain the same object or objects. This coherence is used as a supervisory signal over the unlabeled data, and is used to improve the performance on a supervised task of interest. We demonstrate the effectiveness of this method on some pose invariant object and face recognition tasks.
A cooperative approach for topology control in Wireless Sensor Networks: Experimental and simulation analysis
Authors: Paolo Costa, Matteo Cesana, Stefano Brambilla, Luca Casartelli, Luca Pizziniaco
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

The choice of the transmission power levels adopted in Wireless Sensor Networks (WSNs) is critical to determine the performance of the network itself in terms of energy efficiency, connectivity and spatial reuse, since it has direct impact on the physical network topology. In this paper, a cooperative, lightweight and fully distributed approach is introduced to adaptively tune the transmission power of sensors in order to match local connectivity constraints. To accurately evaluate the topology control solution, a small-scale testbed based on MicaZ sensor nodes is deployed in indoor and outdoor scenarios. Practical measures on local connectivity, multi-hop connectivity, convergence time and emitted power are used to compare the proposed approach against previously proposed ones. Moreover, a simulation analysis complements the experimental one in large-scale WSN scenarios, where a testbed implementation becomes unfeasible.
Orchestrating Talk for Meaning Making in a Science Learning Community Mediated by CSCL
Authors: Jennifer Yeo
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

This project looks into the design of a science learning environment that focuses on supporting interactions for meaning making among students mediated by computer supported learning environment. The problem it addresses stems from the lack of interaction in traditional science classrooms and students not acquiring the skills and practices of the science community. From the socio-cultural perspectives, interaction plays an important role in students' in meaning making. However, students may find the process of inquiry learning an uphill task and requires scaffolding. Using the conceptualization of meaning making presented in this paper, a framework for analyzing the interaction in meaning making is proposed. This paper presents my initial ideas in the conceptualization of the project and the analysis framework.
Of Mechanism Design Multiagent Planning
Authors: Roman van der Krogt, Mathijs de Weerdt, Yingqian Zhang
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Multiagent planning methods are concerned with planning by and for a group of agents. If the agents are self-interested, they may be tempted to lie in order to obtain an outcome that is more rewarding for them. We therefore study the multiagent planning problem from a mechanism design perspective, showing how to incentivise agents to be truthful. We prove that the well-known truthful VCG mechanism is not always truthful in the context of optimal planning, and present a modification to fix this. Finally, we present some (domain-dependent) poly-time planning algorithms using this fix that maintain truthfulness in spite of their non-optimality.
An Interface for Assisting the Design and Production of Pop-Up Card
Authors: Sosuke Okamura, Takeo Igarashi
Venue: Proceedings of the 10th International Symposium on Smart Graphics (2009)

This paper describes an interface for assisting the design and production of pop-Up cards by using a computer. A pop-up card is a piece of a folded paper from which a three-dimensional structure pops up when it is opened and can be folded flatly again. People enjoy its interesting mechanism in pop-up books and greeting cards. However, it is difficult for non-professional people to design pop-up cards because of various geometric constraints to fold flatwise. We therefore propose an interface to help people to design and make pop-up cards easily. We deal with pop-up cards that fully opens at 180-degrees in this paper.We implement a prototype that allows the user to design a pop-up card by setting new parts on the fold lines and editing their position and shape afterwards. At the same time, the system examines whether the parts protrude from the card or whether the parts collide with each other when the card is closed. The result is continuously shown to the user as a feedback. This enables the user to concentrate on the design activity.We created a couple of pop-up cards using our system and performed an informal preliminary user study to demonstrate the usability of our system.
Assessing factors influencing vegetation coverage calculation with remote sensing imagery
Authors: Zhujun Gu, Zhiyuan Zeng, Xuezheng Shi, Lin Li, Dongsheng Yu, Wei Zheng, Zhenlong Zhang, Zifu Hu
Venue: International Journal of Remote Sensing (2009)

Influencing factor analysis is required for assessing the performance of vegetation fractional coverage (VFC) models with remote sensing imagery. This paper analyses influences of the radiometric correction level (RL), vegetation index (VI) and polynomial exponential power (EP) choice on VI-VFC relationship models. A SPOT 5 HRG image of Nanjing, China was chosen, and three RLs (digital number, top of atmosphere reflectance and post atmospheric correction reflectance) were used to derive six VIs, such as normalized difference vegetation index (NDVI) and ratio vegetation index (RVI). Fifty-four models describing the VI-VFC relationship were established, and the influences of the RL, VI and EP choice on the VI-VFC models were analysed based on a statistical analysis of determination coefficients (R 2) of these models. The results showed that model robustness was jointly influenced by the three factors, so these three factors should be synthetically taken into account in VI-VFC modelling. It is recommended to establish different models between the VFC and various VIs derived from different RLs, and then to select the better ones.
Breaking Two k-Resilient Traitor Tracing Schemes with Sublinear Ciphertext Size
Authors: Moonshik Lee, Daegun Ma, Minjae Seo
Venue: Proceedings of the 7th International Conference on Applied Cryptography and Network Security (2009)

In 2004, Matsushita and Imai proposed a k-resilient public-key traitor tracing scheme which has sublinear ciphertext size 4k + 2 + (n/2k) with efficient black-box tracing against self-defensive pirates, where n, k are the total number of subscribers and the maximum number of colluders. After that, in 2006, they presented a hierarchical key assignment method to reduce the ciphertext size into 4k + 5 + log(n/2k) by combining a complete binary tree with the former scheme.In this paper, we show that the proposed schemes are vulnerable to our attack which makes pirate keys able to avoid the black-box tracing. Their schemes are based on multiple polynomials and our attack use a combination between different polynomials. The latter scheme can be broken by other attacks which use secret values of the key generation polynomial or use partial keys.
HIPaG: An energy-efficient in-network join for distributed condition tables in sensor networks
Authors: Joo Hyuk Jeon, Ki Yong Lee, Jae Soo Yoo, Myoung Ho Kim
Venue: Journal of Systems and Software (2009)

In sensor networks, the event-detection process can be considered as a join of two relations, i.e., a sensor table and a condition table, where a condition table is a set of tuples each of which contains condition information about a certain event. When join operations are used for event-detection, it is desirable, if possible, to perform 'in-network' joins in order to reduce the communication cost. In this paper, we propose an in-network join algorithm, called HIPaG. In HIPaG, a condition table is partitioned into several fragments. Those fragments are stored either in paths from the base station to sensor nodes, or in groups of nodes each of which are within the broadcast range among each other. By distributing a condition table in this way, a distributed join of a sensor table and a condition table can be effectively performed in the network. The experimental results show that our proposed HIPaG works much better than the existing method.
Study on the GA-Based Decoding Algorithm for Convolutional Turbo Codes
Authors: Xingcheng Liu, Shishuang Zhang, Zerong Deng
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

A new decoding algorithm for convolutional Turbo codes that is called the Soft-Output Genetic Algorithm (SOGA) is proposed. With good individuals' diversity, wide searching region and global optimizing ability, the SOGA performs better than the Soft-Output MA in terms of BER (Bit Error Rate) with the similar complexity. Simulation results show that when 1/3 code rate, 16-state convolutional Turbo codes are decoded, at BER=10¿ 5, the SOGA achieves about 0.2dB gains over the SOMA algorithm and nearly performs the same as the SOVA when BER<10¿ 4. Besides, the SOGA only deals with M states in the total 2v states, so it can save 2v-M registers compared with the SOVA when 1 bit is decoded.
Dynamic hybrid terrain representation based on convexity limits identification
Authors: Montserrat Boo, Margarita Amor
Venue: International Journal of Geographical Information Science (2009)

Hybrid digital terrain models combine terrain data with different topologies and resolutions. Cartographic digital terrain models are typically composed of regular grid data that can be locally refined by adding a Triangulated Irregular Network (TIN) that represents morphologically complex terrain parts. Direct rendering of both datasets to visualize the digital terrain model generates discontinuities, as the meshes are disconnected. The utilization of complete/partial precomputed tessellation solutions solves the problem of quality, but limits the applicability of the representation to models with a fixed relative position between datasets. In this paper, we present a new scheme for hybrid terrain representation that permits the dynamic generation of the adaptive tessellation required to join the grid and TIN models. Our proposal permits the dynamic modification of the relative position between datasets. This increases the representation capabilities for those applications where this property is interesting as, for example, urban and landscape planning applications. The algorithm we propose is based on the identification of convex areas on the TIN and the efficient generation of triangles to join the models based on this convex structure. As a result, high quality models without discontinuities are obtained, increasing the flexibility of previous solutions based on fixed precomputations.
Applications of Mathematics in Engineering and Economics33: 33rd International Conference, 1st edition
Authors: Michail D. Todorov
Venue: Aip Conference Proceedings (2007)

All papers have been peer-reviewed. The main goal of this series of Conferences is to bring together experts and young talented scientists from Bulgaria and abroad to discuss modern trends, and to ensure exchange of views in various applications of mathematics in the fields of engineering, physics, economics, biology, etc. Keeping the main topics of the previous AMEE conferences, the 33rd issue was subject to the motto "Nonlinear phenomena - mathematical theory and environmental reality". The Organizing Committee encouraged students and postgraduates to take part in the sessions of the Conference. The invited speakers organized special sessions. An integral part of the Conference is the publishing and distribution the proceedings among mathematical and related societies who have an interest in the topics of applied mathematics. Topics discussed include: Mathematical modeling in engineering, physics, astrophysics, heat conductivity, hydrodynamics, queuing, numerical methods and simulations, computational techniques and algorithms, spectral methods, optimal control, and scientific computing.
The Polytope of Context-Free Grammar Constraints
Authors: Gilles Pesant, Claude-Guy Quimper, Louis-Martin Rousseau, Meinolf Sellmann
Venue: Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2009)

Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention in the last few years as it represents an effective and highly expressive modeling entity. Its application has been studied in the field of Constraint Programming, Mixed Integer Programming, and SAT to solve complex decision problems such as shift scheduling. In this theoretical study we demonstrate how the constraint can be linearized efficiently. In particular, we propose a lifted polytope which has only integer extreme points. Based on this result, for shift scheduling problems we prove the equivalence of Dantzig's original set covering model and a lately introduced grammar-based model.
Compressing spatio-temporal trajectories
Authors: Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle
Venue: Computational Geometry: Theory and Applications (2009)

A trajectory is a sequence of locations, each associated with a timestamp, describing the movement of a point. Trajectory data is becoming increasingly available and the size of recorded trajectories is getting larger. In this paper we study the problem of compressing planar trajectories such that the most common spatio-temporal queries can still be answered approximately after the compression has taken place. In the process, we develop an implementation of the Douglas-Peucker path-simplification algorithm which works efficiently even in the case where the polygonal path given as input is allowed to self-intersect. For a polygonal path of size n, the processing time is O(nlog^kn) for k=2 or k=3 depending on the type of simplification.
Mobility, digital libraries and a rural indian village
Authors: Matt Jones, Emma Thom, David Bainbridge, David Frohlich
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

Millions of people in developed countries routinely create and share digital content; but what about the billions of others in on the wrong side of what has been called the 'global digital divide'? This paper considers three mobile platforms to illustrate their potential in enabling rural Indian villagers to make and share digital stories. We describe our experiences in creating prototypes using mobile phones; high-end media-players; and, paper. Interaction designs are discussed along with findings from various trials within the village and elsewhere. Our approach has been to develop prototypes that can work together in an integrated fashion so that content can flow freely and in interesting ways through the village. While our work has particular relevance to those users in emerging world contexts, we see it also informing needs and practices in the developed world for user-generated content.
A new DOA estimation algorithm for wideband signals in the presence of unknown spatially correlated noise
Authors: P. Palanisamy, N. Kalyanasundaram, A. Raghunandan
Venue: Signal Processing (2009)

In this paper, a new high resolution direction-of-arrival (DOA) estimation technique is proposed for wideband signals in the presence of spatially correlated noise with unknown covariance matrix. The proposed technique is based on the (matrix) difference between the forward-backward averaged covariance matrix of the observations and the Hermitian of the backward covariance matrix of the observations. This differencing operation eliminates the noise covariance matrix from the difference matrix. The propagator method is then applied to the difference matrix to find the DOA. This proposed technique does not require any initial estimate of the DOAs and is effective for both correlated and partially correlated sources. In this paper, the proposed technique is applied to a uniform linear array and an L-shaped array for both one- and two-dimensional DOA estimation. Simulations results comparing the performance of the proposed method with that of the coherent propagator method are presented.