ppxscal/embedding_network huggingface dataset:
Multimodal Design for Enactive Toys
Authors: Amalia Götzen, Laca Mion, Federico Avanzini, Stefania Serafin
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

In this paper we will investigate how non---visual senses can be used in toys to enhance and enrich the play experience of all children, while favoring accessibility and inclusion of visually-impaired children. Previous research has shown that --- especially for young children developing sensory-motor skills --- exploration and play are two tightly linked activities: everything is new and needs to be "investigated" and playful behaviors emerge from active exploration. We will propose a new approach in designing and creating objects that elicit this type of behavior and encourage exploration by providing real---time dynamic, haptic, tactile, auditory, and even olfactory feedback depending on children's gestures, movements, and emitted sounds. We believe that this design paradigm is highly innovative with respect to previous research and existing products --- whose interaction is very often based on static feedback. Interactive and dynamic feedback is intrinsically more engaging and allows a variety of quality learning patterns.
Co-ordinated supply chain management and optimal control problems
Authors: Heung-Wing Joseph Lee, Chi-Kin Chan, Ping-Kei Bartholomew Leung
Venue:  (2007)

This thesis is divided into two parts: Co-ordinated Supply Chain Model and Optimal Control Problems. The first part of the thesis examines co-ordinated supply chain model. The second part of the thesis consists of four projects examining the applications of optimal control theory and the software MISER3. Part I. Motivated by a recently developed co-ordination model, the synchronized cycles model, further investigations are carried out to explore the characteristics of the model and some bounds are developed on certain decision variables in order to enhance the synchronized cycles algorithm. Modification to the synchronized cycles model by including vehicle scheduling is considered. By the &ldquo;synchronization&rdquo; characteristic, the synchronized cycles model out-performs the independent policy both in shipment and delivery scheduling and total system cost. While many of the past researches emphasized on the co-ordination that minimizes the total system cost in the supply chain system, this research investigates how the demand heterogeneity would affect the performance of the synchronized cycles model. Numerical experiments are carried out to identify conditions of the demand heterogeneity that work well for the synchronized cycles model. Part II. Four applied optimal control problems are addressed and novel optimal control techniques are developed and applied to solve the computational difficulties encountered in these problems. The optimal control software package, MISER3, is used. Numerical examples are provided to demonstrate the effectiveness of the methods and the results obtained are significant and promising. The four applications include: (1) Modeling of a supply chain system with Omstein Uhlenbeck demand process (2) The isoperimetric pillar construction problem (3) Modeling of the design of a flexible rotating beam (4) Nonlinear model of quarter-car suspension problem.
Interaction Analysis Supporting Participants' Self-regulation in a Generic CSCL System
Authors: Jacques Lonchamp
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

Interaction analysis can provide information directly to learners and teachers in order to assess and self-regulate their ongoing activity. Omega+ is a generic CSCL system that uses explicit models as parameters for flexibly supporting different kinds of collaborative applications. This paper describes Omega+ model-based generic approach for supporting participants' self-regulation through interaction analysis. Some quantitative and qualitative results obtained with the proposed approach are discussed.
UCD/SW: A Distributed System to Promote Cooperative Learning Using Semantic Web and Ubiquitous Computing
Authors: Oscar Martinez, Antonio Peñalver, Juan Manuel Hernansaez, Jose Juan Lopez, Enrique Lazcorreta, Alejandro Bia
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

In this short paper, we present a Ubiquitous ContentDistribution with Semantic Web Interfaces (UCD/SW). The UCD/SW has been designed as a distributed system to promote cooperative learning using semantic web and ubiquitous computing. This short paper argues how UCD/SW has been designed with research technologies dealing with cooperative design, distributed systems, ubiquitous computing and semantic web. Intermediate results of the system development are presented through the paper.
On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
Authors: Claude Carlet
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

The r-th order nonlinearity of a Boolean function $f:F_2^n\to F_2$ is its minimum Hamming distance to all functions of algebraic degrees at most r, where r is a positive integer. The r-th order nonlinearity of an S-box $F:F_2^n\to F_2^m$ is the minimum r-th order nonlinearity of its component functions v·F, $v\in F_2^m\setminus \{0\}$. The role of this cryptographic criterion against attacks on stream and block ciphers has been illustrated by several papers. Its study is also interesting for coding theory and is related to the covering radius of Reed-Muller codes (i.e. the maximum multiplicity of errors that have to be corrected when maximum likelihood decoding is used on a binary symmetric channel). We give a survey of what is known on this parameter, including the bounds involving the algebraic immunity of the function, the bounds involving the higher order nonlinearities of its derivatives, and the resulting bounds on the higher order nonlinearities of the multiplicative inverse functions (used in the S-boxes of the AES). We show an improvement, when we consider an S-box instead of a Boolean function, of the bounds on the higher order nonlinearity expressed by means of the algebraic immunity. We study a generalization (for S-boxes) of the notion and we give new results on it.
Transfer Learning for Bayesian Networks
Authors: Roger Luis, L. Enrique Sucar, Eduardo F. Morales
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

In several domains it is common to have data from different, but closely related problems. For instance, in manufacturing many products follow the same industrial process but with different conditions; or in industrial diagnosis, where there is equipment with similar specifications. In these cases, it is common to have plenty of data for some scenarios but very little for other. In order to learn accurate models for rare cases, it is desirable to use data and knowledge from similar cases; a technique known as "transfer learning". In this paper, we propose a transfer learning method for Bayesian networks, that considers both, structure and parameter learning. For structure learning, we use conditional independence tests, by combining measures from the target domain with those obtained from one or more auxiliary domains, using a weighted sum of the conditional independence measures. For parameter learning, we compared two techniques for probability aggregation that combine probabilities estimated from the target domain with those obtained from the auxiliary data. To validate our approach, we used three Bayesian networks models that are commonly used for evaluating learning techniques, and generated variants of each model by changing the structure as well as the parameters. We then learned one of the variants with a small data set and combined it with information from the other variants. The experimental results show a significant improvement in terms of structure and parameters when we transfer knowledge from similar problems.
Student Models that Invite the Learner In: The SMILI:() Open Learner Modelling Framework
Authors: Susan Bull, Judy Kay
Venue: International Journal of Artificial Intelligence in Education (2007)

In recent years, the learner models of some adaptive learning environments have been opened to the learners they represent. However, as yet there is no standard way of describing and analysing these 'open learner models'. This is, in part, due to the variety of issues that can be important or relevant in any particular learner model. The lack of a framework to discuss open learner models poses several difficulties: there is no systematic way to analyse and describe the open learner models of any one system; there is no systematic way to compare the features of open learner models in different systems; and the designers of each new adaptive learning system must repeatedly tread the same path of studying the many diverse uses and approaches of open learner modelling so that they might determine how to make use of open learner modelling in their system. We believe this is a serious barrier to the effective use of open learner models. This paper presents such a framework, and gives examples of its use to describe and compare adaptive educational systems.
Fragile Watermarking Schemes for Tamperproof Web Pages
Authors: Xiangyang Liu, Hongtao Lu
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

In this paper, to improve the security, sensitivity and efficiency, we propose two novel fragile watermarking schemes for tamperproof web pages, in which a message authentication method and a sparse coding method are used to generate the watermarks for a web page, respectively. The former ensures high security and good sensitivity of the watermarking scheme. The latter attaches more importance to satisfy all the requirements of security, sensitivity and efficiency well. The generated watermarks are then embedded into the web page through the upper and lower cases of letters in HTML tags. The properties of the schemes are illustrated with several experiments, and the results show that the proposed schemes can be good practical tools for the tamperproof of web pages.
Reasoning on Spatial Relations between Entity Classes
Authors: Stephan Mäs
Venue: Proceedings of the 5th international conference on Geographic Information Science (2008)

The facilitation of interoperability requires a clear distinction if a relation refers to classes of individuals or to specific instances, in particular when it comes to the logical properties of the involved relations. Class relations are defined whenever the semantics of entire classes are described, independently of single instances. Typical examples are spatial semantic integrity constraints or ontologies of entity classes. The paper continues research on spatial class relations by deepening the analysis of the reasoning properties of class relations. The work is based on a set of 17 abstract class relations defined in [11]. The paper provides a complete composition table for the 17 abstract class relations and redefines the concept of conceptual neighbourhood for class relations. This approach can be used to find conflicts and redundancies in sets of semantic integrity constraints or other applications of spatial class relations.
Outliers Detection in Selected Fuzzy Regression Models
Authors: Barbara Gładysz, Dorota Kuchta
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

The paper proposes three fuzzy regression models - concerning temperature and electricity load - based on real data. In the first two models the monthly temperature in a period of four years in a Polish city is analyzed. We assume the temperature to be fuzzy and its dependence on time and on the temperature in the previous month is determined. In the construction of the fuzzy regression models the least square methods was used. In the third model we analyze the dependence of the daily electricity load (assumed to be a fuzzy number) on the (crisp) temperature. Outliers, i.e. non-typical instances in the observations are identified, using a modification of an identification method known from the literature. The proposed method turns out to identify the outliers consistently with the real meaning of the experimental data.
Measuring Energy-Time Efficiency of Protocol Performance in Mobile Ad Hoc Networks
Authors: Ida Pu, Yuji Shen, Jinguk Kim
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

This paper introduces two new metrics for assessment of mobile ad hoc network performance in terms of energy-time efficiency. The combined effect of both energy and time consumption is considered and represented in mathematical terms. The measures have demonstrated a number of advantages over the conventional ones in which the energy and time were often considered separately. The proposed new metrics are simple, generic and flexible. As an application, we have compared the energy-time efficiency of Blocking Expanding Ring Search (BERS) and Expanding Ring Search (ERS), two similar Time to Live (TTL)-based expanding ring search algorithms using our new metrics. The results show that the new metrics can be applied efficiently in assessment of different protocols.
Locating Oneself on a Map in Relation to Person Qualities and Map Characteristics
Authors: Lynn S. Liben, Lauren J. Myers, Kim A. Kastens
Venue: Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space (2008)

Adults were taken to various positions on a college campus and asked to mark their locations on a round or square map drawn from either directly overhead or from an oblique angle. In session 1, participants were also given paper and pencil spatial tests to assess their skills in mental rotation (2D figure rotation), spatial visualization (paper folding), and spatial perception (water level). In session 2, participants completed computer-based navigation and mapping tasks. Performance varied widely among participants. Regression analyses showed that spatial skills predicted performance on both campus and computer mapping tasks, but the specific spatial skills that predicted success differed. Across map types, some differences in strategies and speed were observed. Findings show the value of research with both real and simulated environments, and with maps having varying cartographic properties.
Measuring the 4: 11 Effect: The Power Failure and the Internet
Authors: Dennis McGrath
Venue: IEEE Security and Privacy (2003)

For years, we've speculated about the Internet's potential threat to the power grid, but considerably less to a vulnerable power infrastructure's threat to the Internet. Common sense tells us that all of our infrastructures (including transportation, banking, telecommunication, water supply, and so on) depend on each other and particularly on the power grid but we don't understand this symbiotic relationship very well. Understanding begins with measurement and quantification, so we must measure the power failure's effect on the Internet.
Extending Fagin's Algorithm for More Users Based on Multidimensional B-Tree
Authors: Matúš Ondreićka, Jaroslav Pokorný
Venue: Proceedings of the 12th East European conference on Advances in Databases and Information Systems (2008)

We discuss the issue of searching the best K objects in more attributes for more users. Every user prefers objects in different ways. User preferences are modelled locally with a fuzzy function and globally with an aggregation function. Also, we discuss the issue of searching the best K objects without accessing all objects. We deal with the use of local preferences when computing Fagin's algorithms. We created a new model of lists for Fagin's algorithms based on B + -trees. Furthermore, we use a multidimensional B-tree (MDB-tree)for searching the best K objects. We developed an MD-algorithm, which can effectively find the best K objects in a MDB-tree in accordance with user's preferences and without accessing all the objects. We show that MD-algorithm achieves better results in the number of accessed objects than Fagin's algorithms.
Multipath Routing Scheme for Wireless Multihop Network
Authors: Binod Vaidya, Dong-You Choi, Jongan Park, Seungjo Han
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

Due to the increasing popularity and availability of portable wireless devices, which constitute of wireless mobile ad hoc network and sensor network, demand efficient routing protocols. On-demand routing protocols adapt well with dynamic topologies of the wireless ad hoc networks, due to their lower control overhead and quick response to route break. In this paper, we discuss on the design approaches for a typical multipath routing algorithm in mobile ad hoc network (MANET). And we propose a multipath routing for MANET. The proposed scheme is basically intended for highly dynamic ad hoc networks in which communication faults occur on a frequent basis. We conduct simulation for such a scheme, which shows that performance of the proposed scheme is better in term of various performance metrics.
Improvement on Pretty-Simple Password Authenticated Key-Exchange Protocol for Wireless Networks
Authors: Ting-Yi Chang, Chou-Chen Yang, Chia-Meng Chen
Venue: Informatica (2004)

This paper presents an improved method inspired by the recently proposed Pretty-Simple PAKE (Password Authenticated Key-Exchange) protocol, which is already a well-known, robust and simple password authenticated key exchange scheme. In our even more efficient scheme, only the password needs to be negotiated in advance, and the computations have also been simplified. Our scheme is based on the elliptic curve discrete logarithm problem and can gain the benefit from the key block size, speed and security. Since our new scheme is both efficient and fast with a low cost for device storage, it is especially suitable for the wireless network environment.
Past, Present, and Future Trends in Software Patterns
Authors: Frank Buschmann, Kevlin Henney, Douglas C. Schmidt
Venue: IEEE Software (2007)

For the past two decades, software patterns have significantly influenced how developers design and implement computing systems, well above and beyond the most popular research in the software field. This article discusses the past, present, and future trends of software patterns to help software developers and managers understand where the field has come from, where it's headed, and how learning more about patterns can benefit projects. This article is part of a special issue on software patterns.
Text Entry System Based on a Minimal Scan Matrix for Severely Physically Handicapped People
Authors: Julio Miró, Pablo A. Bernabeu
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Improving augmentative communication systems is necessary for severely physically handicapped people because of the low rate of text entry that doesn't even permit them to communicate simultaneously with other people. This paper presents a reduced virtual keyboard based on scanning with only one switch. The scan matrix consists of only two cells, so ambiguity is present due to the assignment of 26 characters to both keys. In order to disambiguate, users enter each letter in two stages. An estimation of the text entry rate for an expert user is 10.1 words per minute using a scan rate of 0.5 seconds, although this value should be adapted for each individual, leading to different rates.
Performance Model for Parallel Mathematical Libraries Based on Historical Knowledgebase
Authors: I. Salawdeh, E. César, A. Morajko, T. Margalef, E. Luque
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Scientific and mathematical parallel libraries offer a high level of abstraction to programmers. However, it is still difficult to select the proper parameters and algorithms to maximize the application performance. This work proposes a performance model for dynamically adjusting applications written with the PETSc library. This model is based on historical performance information and data mining techniques. Finally, we demonstrate the validity of the proposed model through real experimentations.
Modelling and Monitoring Social Expectations in Multi-agent Systems
Authors: Stephen Cranefield
Venue: Coordination, Organizations, Institutions, and Norms in Agent Systems II: AAMAS 2006 and ECAI 2006 International Workshops, COIN 2006 Hakodate, Japan, May 9, 2006 Riva del Garda, Italy, August 28, 2006. Revised Selected Papers (2007)

This paper reports on issues confronted and solutions developed while implementing the author's previously proposed hyMITL± logic for expressing social expectations as conditional rules. A high level overview of hyMITL± is presented, along with a discussion of new features and implementation issues. In particular, the importance of using human-oriented descriptions of time points is argued, along with the need to explicitly take time zones into consideration when defining rules, and a syntax for date/time expressions based on ISO standard 8601 is proposed. A new, more detailed, model for tracking the state of social expectations is also presented, based on the utility of enabling clients of a monitoring service to be notified of multiple instances of the violation or fulfilment of an expectation.
A New Efficient Algorithm for Computing the Longest Common Subsequence
Authors: M. Sohel Rahman, Costas S. Iliopoulos
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

In this paper, we present a new and efficient algorithm for solving the LCS problem for two strings. Our algorithm runs in $O(\mathcal R\log\log n + n)$ time, where $\mathcal R$ is the total number of ordered pairs of positions at which the two strings match.
Aperture-Angle and Hausdorff-Approximation of&#x00a0;Convex Figures
Authors: Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson
Venue: Discrete Computational Geometry (2008)

The aperture angle &#x03b1;(x,Q) of a point x &#x2209; Q in the plane with respect to a convex polygon&#x00a0;Q is the angle of the smallest cone with apex&#x00a0;x that contains&#x00a0;Q. The aperture angle approximation error of a compact convex set&#x00a0;C in the plane with respect to an inscribed convex polygon Q&#x2282;C is the minimum aperture angle of any x&#x2208;C&#x2216;Q with respect to&#x00a0;Q. We show that for any compact convex set C in the plane and any k>2, there is an inscribed convex k-gon Q&#x2282;C with aperture angle approximation error $(1-\frac{2}{k+1})\pi$. This bound is optimal, and settles a conjecture by Fekete from the early&#x00a0;1990s. The same proof technique can be used to prove a conjecture by Brass: If a polygon P admits no approximation by a sub-k-gon (the convex hull of k vertices of&#x00a0;P) with Hausdorff distance&#x00a0;&#x03c3;, but all subpolygons of&#x00a0;P (the convex hull of some vertices of&#x00a0;P) admit such an approximation, then P is a (k+1)-gon. This implies the following result: For any k>2 and any convex polygon P of perimeter at most&#x00a0;1 there is a sub-k-gon Q of P such that the Hausdorff-distance of P and Q is at most&#x00a0; $\frac{1}{k+1}\sin\frac{\pi}{k+1}$.