E-Textbooks Are Coming: Are We Ready?

Textbook options are expanding and the electronic text is poised to become prevalent in the college classroom. Cost pressures are driving this trend even as the academic value of e-textbooks has yet to be established. Limited research is available that examines the effectiveness of the e-textbook as a learning tool. This paper presents the results of a study that compares student performance in two sections of an online course, one using an e-textbook and the other using a paper-based text. No significant difference in student performance was found. However, until e-textbook format and features are standardized and business models generate sizable cost savings, e-textbook adoption is likely to evolve slowly

Computing for the Masses: Extending the Computer Science Curriculum with Information Technology Literacy

Enrollments in computer science programs continue to drop as demand for workers skilled in computing increases. Information technology scholars face the ironic challenge of attracting more students into computing disciplines in the age of ubiquitous computing. This paper chronicles a decision by a department of computer science and information systems to offer an information technology literacy course as a service to its institution. Educational and curricular justifications for the course progressed in parallel with recognition of the course\u27s strategic value to the department in the face of sharp declines in the number of students majoring in CS or IS. Following our approach, other departments in the computing disciplines can ride the coming wave of information technology literacy in higher education

Journey to the Center of the Core: Computers and the Internet in the Core Curriculum

Computers, digitalization and the Internet have transformed modern society. Commerce, education, communication and socialization will never be the same. Surprisingly, many universities do not require a computing course in the core curriculum. Critical information technology (IT) competencies are often taken for granted, to the detriment of students who lack computing and Internet skills. This paper describes an initiative undertaken by a computer science and information systems department to assess and remediate IT skills needed by all university students, regardless of major. The project is evolving along several dimensions: identification of discipline-independent IT competencies, assessment of IT skills among current and incoming students, and curriculum development

Influencia de la organización del tiempo sobre la creatividad en las agencias de publicidad

La creatividad es el principal atributo en la valoración de la calidad de los servicios ofrecidos por las agencias de publicidad. En este trabajo se realiza un análisis sobre cómo la creatividad se ve afectada por la organización del tiempo de trabajo y los horarios en la agencia de publicidad. Se estudian las consecuencias negativas que se derivan de estos aspectos, así como el tipo de medidas que se utilizan para paliar estos efectos negativos. Para llevar a cabo el trabajo se realizaron entrevistas personales a una muestra de directores creativos ejecutivos de las principales agencias de publicidad en España

Session Coalgebras: A Coalgebraic View on Regular and Context-Free Session Types

Compositional methods are central to the verification of software systems. For concurrent and communicating systems, compositional techniques based on behavioural type systems have received much attention. By abstracting communication protocols as types, these type systems can statically check that channels in a program interact following a certain protocol—whether messages are exchanged in the intended order. In this article, we put on our coalgebraic spectacles to investigate session types, a widely studied class of behavioural type systems. We provide a syntax-free description of session-based concurrency as states of coalgebras. As a result, we rediscover type equivalence, duality, and subtyping relations in terms of canonical coinductive presentations. In turn, this coinductive presentation enables us to derive a decidable type system with subtyping for the π-calculus, in which the states of a coalgebra will serve as channel protocols. Going full circle, we exhibit a coalgebra structure on an existing session type system, and show that the relations and type system resulting from our coalgebraic perspective coincide with existing ones. We further apply to session coalgebras the coalgebraic approach to regular languages via the so-called rational fixed point, inspired by the trinity of automata, regular languages, and regular expressions with session coalgebras, rational fixed point, and session types, respectively. We establish a suitable restriction on session coalgebras that determines a similar trinity, and reveals the mismatch between usual session types and our syntax-free coalgebraic approach. Furthermore, we extend our coalgebraic approach to account for context-free session types, by equipping session coalgebras with a stack

Session Coalgebras: A Coalgebraic View on Session Types and Communication Protocols

Compositional methods are central to the development and verification of software systems. They allow to break down large systems into smaller components, while enabling reasoning about the behaviour of the composed system. For concurrent and communicating systems, compositional techniques based on behavioural type systems have received much attention. By abstracting communication protocols as types, these type systems can statically check that programs interact with channels according to a certain protocol, whether the intended messages are exchanged in a certain order. In this paper, we put on our coalgebraic spectacles to investigate session types, a widely studied class of behavioural type systems. We provide a syntax-free description of session-based concurrency as states of coalgebras. As a result, we rediscover type equivalence, duality, and subtyping relations in terms of canonical coinductive presentations. In turn, this coinductive presentation makes it possible to elegantly derive a decidable type system with subtyping for $\pi$-calculus processes, in which the states of a coalgebra will serve as channel protocols. Going full circle, we exhibit a coalgebra structure on an existing session type system, and show that the relations and type system resulting from our coalgebraic perspective agree with the existing ones.Comment: 36 pages, submitte

Relación de los planificadores estratégicos y los creativos. Aplicación al caso español.

The aim of this paper is to analyze the relationship between the Department of Creativity and the Account Planning Department in Spain. The planners are responsible to develop a deep research of the consumer with the objective that this knowledge can serve the creative department to guide communication and effectively reach the consumer. There are reviews on the specific sets and relationships between the Account Department and Creativity, but we do not find any analysis which provides information on the positive or negative interaction of the planners and creative. Thus, to address this reality we have developed a double investigation. On the one hand, we have chosen a quantitative research through a questionnaire to account planners who work in Spain from which were obtained 62 responses and a qualitative study from four in-depth interviews with recognized creative

Session-based concurrency in Maude:Executable semantics and type checking

Session types are a well-established approach to communication correctness in message-passing processes. Widely studied from a process calculi perspective, here we pursue an unexplored strand and investigate the use of the Maude system for implementing session-typed process languages and reasoning about session-typed process specifications. We present four technical contributions. First, we develop and implement in Maude an executable specification of the operational semantics of a session-typed π-calculus by Vasconcelos. Second, we also develop an executable specification of its associated algorithmic type checking, and describe how both specifications can be integrated. Third, we show that our executable specification can be coupled with reachability and model checking tools in Maude to detect well-typed but deadlocked processes. Finally, we demonstrate the robustness of our approach by adapting it to a higher-order session π-calculus, in which exchanged values include names but also abstractions (functions from names to processes). All in all, our contributions define a promising new approach to the (semi)automated analysis of communication correctness in message-passing concurrency