ppxscal/embedding_network huggingface dataset:
Multimodality-based Model in the Class of Foreign Language
Authors: Cecilia Silva
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 applies Kress' theory of multimodality in social semiotic to facilitate vocabulary acquisition and text building in classroom. It designs a classroom activity wherein Japanese University students of Spanish as a foreign language built a hypertext aiming to do research about several topics and enlarge vocabulary. Additionally, based on the classroom activity, it established the Multimodality-based Model in the classroom of Spanish as a foreign language and briefly investigate and analyze the responding of students. Finally, the paper summarizes the merit and limit of this activity and concludes that the approach of multimodality can make students become aware of available resources for conveying meanings. This paper relates multimodality to hypertext, which can well combine their advantages, i.e. the hypertext can link many kinds of media and is more suitable for conveying meanings and feelings.
Continuous and Discrete Halanay Delayed Inequalities and Their Applications in Stability of Neural Networks
Authors: Jinhua Huang, Jiqing Liu
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

In this paper, a slight generalization of the celebrated continuous Halanay inequality is developed, a discrete analogue of the continuous Halanay inequality is proved. Using continuous and discrete Halanay time-delayed inequalities, we derived some sufficient conditions for the global exponential (asymptotic) stability of equilibrium point of neural networks.
A framework for software security in uml with assurance
Authors: Thuong Nguyen Doan
Venue:  (2008)

Software security is becoming increasingly invasive in all aspects of a software application but the inclusion of security in software development has often been an afterthought and delayed to latter stages of the software development life cycle instead of performed from the beginning of the design phase. That practice may result in serious and costly aftermaths. Unified Modeling Language (UML) is a well-known language for specifying, visualizing, constructing and documenting software artifacts but lacks the facilities to directly integrate security features into the UML diagrams and a mechanism of analysis and verification of secure designs at the design phase. To support the security integration at the design phase and overcome the shortfalls of UML in terms of security assurance, this dissertation provides a practical approach with a formal underpinning to incorporate and maintain security features during an application's requirement and design phases of the software process via UML. Specifically, this dissertation includes a three-component framework consisting of: (i). UML Extended with Security Capabilities - This aspect of our work integrates the security requirements and design into the software process by augmenting UML requirements definition (use case diagram) and design (class and sequence diagrams) with visual and non-visual security extensions and constraints for RBAC, MAC, and lifetimes. The intent is to provide the means for stakeholders to define, verify, analyze, evolve, etc., the security requirements as an application is created and modified in UML; (ii). Persistent and Dynamic State Capturing and Maintenance - UML plus security extensions as realized within a formal functional model provides the means to define and maintain a design state. Our approach tracks the content of design for an application (security and non-security) and all actions taken by stakeholders as part of the process. Our work provides the specification of design actions as (meta-)functions on the current state and a design element to generate a new state (as a state function); and (iii). Security Assurance via Constraint Checking - This final component of our work involves the ability to offer a degree of security conformity assurance via the checking of security constraints as an application's design are created and changed over time. To accomplish this, we define the concept of a security conforming design state and two modes of checking: design-time (instantly check whenever the designer draws a new design element or edits an existing design element in the UML design) and post-design (execute the checks across all design elements at once after the designer has reached a milestone or version in an application's UML design). Therefore, our approach specifies a new direction of semi-automatic tracking, checking, and maintaining the security conformity status of a UML design that improves the integrity of the software application in terms of security concerns.
Time-predictable computer architecture
Authors: Martin Schoeberl
Venue: EURASIP Journal on Embedded Systems (2009)

Today's general-purpose processors are optimized for maximum throughput. Real-time systems need a processor with both a reasonable and a known worst-case execution time (WCET). Features such as pipelines with instruction dependencies, caches, branch prediction, and out-of-order execution complicate WCET analysis and lead to very conservative estimates. In this paper, we evaluate the issues of current architectures with respect to WCET analysis. Then, we propose solutions for a time-predictable computer architecture. The proposed architecture is evaluated with implementation of some features in a Java processor. The resulting processor is a good target for WCET analysis and still performs well in the average case.
Note: Extremal functions of forbidden double permutation matrices
Authors: Jesse T. Geneson
Venue: Journal of Combinatorial Theory Series A (2009)

We say a 0-1 matrix A avoids a matrix P if no submatrix of A can be transformed into P by changing some ones to zeroes. We call P an m-tuple permutation matrix if P can be obtained by replacing each column of a permutation matrix with m copies of that column. In this paper, we investigate nxn matrices that avoid P and the maximum number ex(n,P) of ones that they can have. We prove a linear bound on ex(n,P) for any 2-tuple permutation matrix P, resolving a conjecture of Keszegh [B. Keszegh, On linear forbidden matrices, J. Combin. Theory Ser. A 116 (1) (2009) 232-241]. Using this result, we obtain a linear bound on ex(n,P) for any m-tuple permutation matrix P. Additionally, we demonstrate the existence of infinitely many minimal non-linear patterns, resolving another conjecture of Keszegh from the same paper.
Bifurcation analysis of a dynamic duopoly model with heterogeneous costs and behavioural rules
Authors: Natascia Angelini, Roberto Dieci, Franco Nardini
Venue: Mathematics and Computers in Simulation (2009)

We develop a nonlinear dynamic Cournot duopoly model in discrete time, where two bounded rational quantity-setting firms, both endowed with naive expectations, are heterogeneous as to their cost functions and output strategies. One of the two competing firms adopts best-reply behaviour, whereas the other adjusts its production according to the gradient of its profit. Although excessive reaction of the latter firm generally results in destabilization of the 'Cournot-Nash' equilibrium and brings about complex dynamic scenarios, this occurs via qualitatively different bifurcation routes, depending on the ratio between firms' marginal costs. The paper also provides a preliminary exploration of the long-run sustainability of the heterogeneous duopoly competition, by investigating numerically the impact of fixed costs on firms' survival, along different output trajectories.
Stackelberg game-theoretic model for optimizing advertising, pricing and inventory policies in vendor managed inventory (VMI) production supply chains
Authors: Yugang Yu, George Q. Huang, Liang Liang
Venue: Computers and Industrial Engineering (2009)

This paper discusses how a manufacturer and its retailers interact with each other in order to optimize their individual net profits by adjusting product marketing (advertising and pricing) and inventory policies in an information-asymmetric VMI (vendor managed inventory) supply chain. The manufacturer produces and supplies a single product at the same wholesale price to multiple retailers who then sell the product in dispersed and independent markets at retail prices. The demand rate in each market is an increasing and concave function of the advertising investments of both local retailers and the manufacturer, but a decreasing and convex function of the retail prices. The manufacturer determines its wholesale price, its advertising investment, replenishment cycles for the raw materials and finished product, and backorder quantity to maximize its profit. Retailers in turn consider the replenishment policies and the manufacturer's promotion policies and determine the optimal retail prices and advertisement investments to maximize their profits. This problem is modeled as a Stackelberg game where the manufacturer is the leader and retailers are followers. An algorithm has been proposed to search the Stackelberg equilibrium. A numerical study has been conducted to demonstrate how the algorithm works and to understand the influences of decision variables and/or parameters. Several research questions are examined, including under what circumstances the retailers and manufacturer should increase their advertising expenditures and/or reduce the retail prices and what actions should be taken if the prices of raw materials or their holding costs increase.
Inferring Hidden Network Properties from Network Measurements
Authors: Wei Wei
Venue:  (2007)

The Internet has grown into a tremendously large and complex system with hundreds of millions of end hosts. Because of its size, complexity and heterogeneity, understanding the Internet has proved to be very difficult. Network measurements provide valuable insight and quantitative information on network performance, management, and pathology diagnosis. This work aims to infer hidden network properties from the complex Internet by addressing the following open questions based on network measurements: (1) Can we identify the existence of a dominant congested link (i.e., a significant source of performance degradation) on an end-to-end path using only end-to-end packet delay and loss observations? (2) Can we classify an end user's access network (Ethernet, wireless LAN, cable modem, ADSL, dialup) using only measurements at a server? (3) Can we infer the extent of wireless LAN usage and identify wireless LAN traffic based on passive measurements at the edge of a large network? The key to answering the above questions is network modeling. In this book, we demonstrate how to use various network modeling techniques to solve the above challenging problems. This book is for both researchers and practitioners in the field, and graduate students who are interested in computer networks. 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
Costs and benefits of reputation management systems
Authors: Roberto G. Cascella
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

The specific objective of a reputation management system is to facilitate nodes to decide whom to trust before providing resources and the expected quality of service. In self-organized systems, the use of reputation-based mechanisms has a cost in terms of messages required to disseminate feedbacks and to synchronize reputation values. In this paper we discuss the implementation of a reputation management system and consider two approaches to collect and disseminate data: proactive and reactive schemes. We analyze the cost of these approaches in terms of extra signaling and evaluate the benefit of using reputation management systems, measured as the number of avoided transactions with malicious nodes. 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
Cyber Assist Project for Ambient Intelligence
Authors: Hideyuki Nakashima
Venue: Proceeding of the 2007 conference on Advances in Ambient Intelligence (2007)

Information processing technologies should be able to support people in every aspect of their everyday life, with information processing units embedded in the environment which communicate with portable or wearable personal devices. The keywords are “here, now and me” rather than “wherever, whenever, whoever”. We want to add one more element to the vision, the concept of situatedness. Ubiquitous computing and ambient intelligence put stress on having sensors in the environment to sense the context of the user. However, I define situation not as something to be sensed or computed, but something to be used as it is. We should not design a system that acts on the sense-represent-compute-act cycle. Rather, we should design a system that can set up the context appropriately. Cyber Assist project was conducted under the above philosophy. In this chapter, we overview the project under the light of ambient intelligence.
Dynamic cost-efficient replication in data clouds
Authors: Nicolas Bonvin, Thanasis G. Papaioannou, Karl Aberer
Venue: Proceedings of the 1st workshop on Automated control for datacenters and clouds (2009)

Hardware failures in current data centers are common partly due to the higher data scales supported. Data replication is the common approach for improving availability. However, mostly static replication approaches have been proposed, i.e. the number of replicas and their locations are fixed. Moreover, the geographical diversity of data locations has not explicitly been considered. In this paper, we propose a cost-efficient replication scheme across data centers that dynamically adapts the number of replicas employed per partition to the query load, while maintaining availability guarantees in case of failures. Our approach employs a virtual economy that is experimentally proved in a simulated environment to achieve load balancing among data servers at the minimum cost.
The Physics and Psychophysics of Music: An Introduction, 4th edition
Authors: Juan G. Roederer
Venue:  (2008)

This introductory text deals with the physical systems and biological processes that intervene in what we broadly call "music." It analyzes what physical properties of sound patterns are associated with what psychological sensations of music, and describes how these sound patterns are actually produced in musical instruments, how they propagate through the environment, and how they are detected by the ear and interpreted in the brain. Without using complicated mathematics, the author weaves a close mesh between the disciplines of acoustics, psychophysics, and neurobiology, offering an integral picture of not only the science of music, but also the "music of science", that is, the beauty and excitement of scientific research, reasoning and understanding. This text should be accessible to undergraduate-level students, whether from science, arts or engineering schools, but it should also be useful to professional musicians, physics educators, acoustical engineers and neuroscientists. The fourth edition incorporates recent research on tone generation in musical instruments and latest findings in brain science, including substantially updated coverage of psychophysics and brain function relevant to music perception, new results from tomographic imaging, and new understanding of the neural processes responsible for human consciousness and the emotional response of the brain to music.
Regular Apeirotopes of Dimension and Rank 4
Authors: Peter McMullen
Venue: Discrete Computational Geometry (2009)

In previous papers, all the four-dimensional (finite) regular polytopes have been classified, as well as the regular apeirotopes of full rank (that is, of rank&#x00a0;5). Of the two problems in $\mathbb{E}^{4}$thus left open (namely, regular apeirotopes of ranks 3 and 4), this paper describes the regular apeirotopes of rank 4. The methods employed here are somewhat different from those in earlier work; while knowledge of the possible dimension vectors (dim&#x2009;R 0,&#x2026;,dim&#x2009;R 3) of the mirrors R 0,&#x2026;,R 3 of the generating reflexions of the symmetry groups plays a r&#x00f4;le, the crystallographic restriction leads to a considerable emphasis being placed on the vertex-figures.
The Glitch in On-line Advertising: A Study of Click Fraud in Pay-Per-Click Advertising Programs
Authors: Vishal Midha
Venue: International Journal of Electronic Commerce (2008)

Click fraud is a growing concern for pay-per-click (PPC) advertising programs. An ethical behavior model is proposed that includes evaluation, consequences for others, subjective norms, and perceived behavioral control. The model, which integrates elements from the theory of reasoned action, the theory of planned behavior, and deterrence theory, was tested using data collected from 155 subjects who were familiar with PPC programs. The results can be used by PPC service providers and law-makers in developing strategies to curb this problem.
Finite Fields and Applications
Authors: Gary L. Mullen, Carl Mummert
Venue: Student Mathematical Library (2007)

This book provides a brief and accessible introduction to the theory of finite fields and to some of their many fascinating and practical applications. The first chapter is devoted to the theory of finite fields. After covering their construction and elementary properties, the authors discuss the trace and norm functions, bases for finite fields, and properties of polynomials over finite fields. Each of the remaining chapters details applications. Chapter 2 deals with combinatorial topics such as the construction of sets of orthogonal latin squares, affine and projective planes, block designs, and Hadamard matrices. Chapters 3 and 4 provide a number of constructions and basic properties of error-correcting codes and cryptographic systems using finite fields. Each chapter includes a set of exercises of varying levels of difficulty which help to further explain and motivate the material. Appendix A provides a brief review of the basic number theory and abstract algebra used in the text, as well as exercises related to this material. Appendix B provides hints and partial solutions for many of the exercises in each chapter. A list of 64 references to further reading and to additional topics related to the book's material is also included. Intended for advanced undergraduate students, it is suitable both for classroom use and for individual study. This book is co-published with Mathematics Advanced Study Semesters.
Design, implementation, and performance analysis of DiscoSec Service pack for securing WLANs
Authors: Ivan Martinovic, Paul Pichota, Matthias Wilhelm, Frank A. Zdarsky, Jens B. Schmitt
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

To improve the already tarnished reputation of WLAN security, the new IEEE 802.11i security standard provides means for an enhanced user authentication and strong data confidentiality. However, the standard focuses on securing higher-layer data, i.e., protecting IEEE 802.11 data frames. Management frames used for connection administration are left unprotected and a wide spectrum of known attacks is still applicable and even extended against the IEEE 802.11i/IEEE 802.1X protocol execution. This work describes DiscoSec, a service pack for “patching” WLANs against the most prominent vulnerabilities resulting in resource-depletion and impersonation attacks. DiscoSec provides DoS-resilient key exchange, an efficient frame authentication, and a performance-oriented implementation. By means of extensive real-world measurements the performance of DiscoSec is evaluated showing that even on very resource-limited devices the throughput is decreased by only 22% compared to the throughput without any authentication, and by 6%on more powerful hardware. To demonstrate its effectiveness, DiscoSec is available as an open-source WLAN device driver.
Numerical solution of complex modified Korteweg-de Vries equation by mesh-free collocation method
Authors: Marjan Uddin, Sirajul Haq, Siraj-ul-Islam
Venue: Computers Mathematics with Applications (2009)

A mesh-free method based on radial basis functions (RBFs) is proposed for the solution of complex modified Korteweg-de Vries (CMKdV) equation. The mesh-free algorithm is based on scattered data interpolation along with approximating functions known as radial basis functions (RBFs). A set of scattered nodes provided by initial data is used for solution of the problem. Computational experiments examine the accuracy of the method in terms of error norms L"2, L"~ and the three invariants I"1, I"2 and I"3. The results obtained by the method are in good agreement with exact solutions and the earlier work.
Teacher Development through “Active Classroom” --A Learning Platform to Support School Development and Education Reform
Authors: Bick Har Lam, Alison See Wai Yeung
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)

The “Active-Classroom” project aims to establish a platform for professional exchange among teachers on skills and strategies that helps to achieve an active classroom for student learning, by the use of WebQuest. In this paper, the researchers will report how the Active Classroom has come into shape with its first attempt on questioning skill, during Dec 2004 to May 2005. There are three primary schools participating in studying this skill component. The project demonstrates the functions of the questioning WebQuest: (a) focuses learners on a tangible and easy navigated resource; (b) opens up possibility of getting feedback from distant audience via an embedded e-mail form. Positive influence on teacher professional networking and student learning is perceived. It implicates that online learning on instructional strategies should be promoted as it is a substantial support to education reform.
The Model of Collaborative Learning GRID to Activate Interactivity for Knowledge Building
Authors: Toshio Okamoto, Mizue Kayama
Venue: Proceeding of the 2005 conference on Towards the Learning Grid: Advances in Human Learning Services (2005)

The purpose of this study is to support the learning activity in the Internet learning space. In this paper, we examine the GRID technology as the knowledge management for supporting collaborative learning (CL). RAPSODYEX (RAPSODY-EX) is a distributed learning support environment organized as a learning infrastructure. RAPSODY-EX can effectively carry out to support CL activities in asynchronous/synchronous learning mode. The mixed distributed learning environment is utilized as a new learning ecology, where individual learning, CL and videoconference are performed on the multimedia communication network. In this mixed distributed learning environment, people can arrange, modify and integrate educational information for the purpose of investigating, decision making, planning, problem solving, building knowledge and so on. Various information in the educational context is referred and reused as knowledge which oneself and others can practically utilize. We aim at constructing the growing digital portfolio database for CL-knowledge management in Internet environment. In addition, we explore the GRID technology of activating human-interactivity for knowledge mining/discovering.