ppxscal/embedding_network huggingface dataset:
Workplace innovation: bridging knowledge and practice
Authors: Rosemary Exton, Peter Totterdill
Venue: AI Society (2008)

The article draws on a decade of work in the UK by the UK Work Organisation Network (UKWON), and recommends a systematic approach. Taking cases in the National Health Service, the focus is on employee involvement, partnership and the development of social capital. High and low road approaches are compared, in an evaluation of the Improving Working Lives programme.
A SOCIOLOGICAL PERSPECTIVE ON THE REORDERING PROBLEM IN MULTIPATH ROUTING
Authors: Maysam Yabandeh, Amir Nayyeri, Nasser Yazdani, Caro Lucas
Venue: Cybernetics and Systems (2007)

The term multipath routing means using multiple paths concurrently to transport data over network. The main problem of this routing scheme is the difference among the delays of selected paths, which causes reordering of a single flow's packets. In this paper, this problem is analyzed through a sociological perspective. We show that reordering problem is not inherently related to multipath routing, rather caused by the dominant capitalist view of the problem. then, the problem is addressed through a Marxism perspective. We theoretically prove that by this perspective, there exists a routing scheme that minimizes latency and also the requirement of buffering at receiver.
Comparison of input-queue and output-queue cell switch architectures
Authors: G. Baklavas, M. Roumeliotis
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

The paper discusses the different approaches in the architecture and design of cell-switches. The main ideas explored are the Input Queue (IQ) and the Output Queue (OQ) cell switches. Both architectures are described and compared under different sets of assumptions in terms of arrival distribution and packet classification. Results show that the efficiency of these architectures is generally comparable and depends on the assumptions made.
Computing research methods multi-perspective digital library: a call for participation
Authors: Anne G. Applin, Hilary J. Holz
Venue: ACM SIGCSE Bulletin (2008)

For the past three years, SIGCSE has sponsored a design research project on teaching Computing Research Methods (CRM) [4]. The initial phase of the work included an ITiCSE working group that gathered a great deal of literature on and about: computing research; CRM; and teaching CRM [3]. During the literature review, we discovered a number of similar current and prior efforts, some of which had even met with limited success within their discourse community. However, because the CRM literature is divided across publishers, indices, and discourse communities, none of the earlier efforts established the common ground necessary for meaningful dialog on curricular issues (see section 1.1. of [1]) To establish that common ground, we decided to foster a scholar-produced digital resource to facilitate integrating teaching / learning research methods across the computing curriculum [1]. Scholar-produced digital resources are digital libraries that are produced by scholarly communities of practice, rather than by external stakeholders such as commercial publishers or libraries. These digital libraries are rich interactive web locales that ". . . include aggregations of resources that support research, such as field-based topic gateways and bibliographies; products of original research such as novel multimedia publications and handbook type web publications, communication forums such as preprint archives and pure e-journals; and research tools such as non-proprietary software available via the web." [2] We started work on the CRM Multi-Perspective Digital Library (CRM-MPDL) in early 2007. A second ITiCSE working group [1] focused on the faculty perspectives in CRM-MPDL. A SIGCSE special projects grant funded student research assistants for CRM-MPDL. As a consequence, students have become a very active and vocal constituency in the project, and they have made significant progress on a set of student design and content elements for CRM-MPDL. To date, we have developed an international participatory design community [4]; conducted and published an extensive literature review and glossary [3]; developed some initial curricular materials [4]; and constructed a prototype design for the faculty perspective in a multiperspective digital resource to integrate teaching research methods across the computing curriculum [1]. One of the goals of the project has been to build a tool that is useful to faculty, students, industry, administrators, and anyone else who is interested in teaching or learning about CRM. A prototype of CRM-MPDL is ready to be tested, interacted with, and critiqued. The goal of this poster is to solicit participation from the ITiCSE conference attendees. An international audience is necessary for us to get the most comprehensive feedback for the tool. We have a growing set of content materials and a growing set of design materials. A laptop will be available at the poster for attendees to experience CRM-MPDL on site.
Generalizations to the constructions of t-norms: Rotation(-annihilation) construction
Authors: Zhi-Hong Yi, Feng Qin, Wei-Cai Li
Venue: Fuzzy Sets and Systems (2008)

In this paper, the constructions of triangular norms are investigated. Specially, based on weak negations which are not necessarily involutive, the rotation and the rotation-annihilation constructions are extended. By means of these methods, we can get new families of left-continuous t-norms compatible with weak negations given. However, not all weak negations are suitable for those generalized constructions. To highlight it, some counterexamples are given.
Bloom's taxonomy for CS assessment
Authors: Errol Thompson, Andrew Luxton-Reilly, Jacqueline L. Whalley, Minjie Hu, Phil Robbins
Venue: Proceedings of the tenth conference on Australasian computing education - Volume 78 (2008)

Bloom's Taxonomy is difficult to apply consistently to assessment tasks in introductory programming courses. The Bloom taxonomy is a valuable tool that could enable analysis and discussion of programming assessment if it could be interpreted consistently. We discuss each of the Bloom classification categories and provide a consistent interpretation with concrete exemplars that will allow computer science educators to utilise Bloom's Taxonomy for programming assessment. Using Bloom's Taxonomy to help design examinations could greatly improve the quality of assessment in introductory programming courses.
Modeling and Quantifying the Impact of P2P File Sharing Traffic on Traditional Internet Traffic
Authors: YaNing Liu, HongBo Wang, Yu Lin, ShiDuan Cheng
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Peer-to-Peer P2P applications consume most of Internet bandwidth and cause access network congestion. They severely deteriorate the performance of the traditional Internet applications. Previous researches have studied the mechanisms to improve the aggregate throughput of P2P traffic, but there doesn’t exist any research to predict and quantify its impact. In this work, we develop a performance modeling system of P2P file sharing traffic and traditional Internet traffic (WEB traffic) to quantify the impact of P2P file sharing traffic on WEB traffic in the congested access network. We answer the following questions from a user’s point of view: How many P2P concurrent connections and what proportion between P2P traffic and WEB traffic will guarantee certain WEB performance. The simulation results demonstrate that our model is accurate and efficient.
Management of Ambient Media Preferences in Distributed Environments for Service Personalization
Authors: M. Anwar Hossain, Pradeep K. Atrey, Abdulmotaleb El Saddik
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

Due to the increasing need for service personalization in pervasive environments, the management of user’s contextual media preferences becomes an important issue. In this paper, we present a framework for managing ambient preferences,which is a continuously updated set of attributes reflecting user’s need and expectations for different media services in different contexts. These attributes are dynamically collected and updated based on the interactions of the users in distributed environments. The proposed framework provides mechanisms to store and share these preferences in order to provide personalized services to the user according to the different contextual situations. We demonstratethe development of the framework, its implementation and usage in distributed environment settings.
Evaluation of a graduate level data mining course with industry participants
Authors: Peter Christen
Venue: Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70 (2007)

Data mining courses are increasingly being taught at many universities at both undergraduate and graduate levels. This paper reports on a new graduate level data mining course run for the first time in 2007 at a major Australian university. The course had almost 20% enrolments of industry based participants from both private and public sector organisations. This paper discusses the student population and presents the course structure and assessment. An empirical evaluation of student responses, conducted at the end of the course, is then provided, with an emphasis on differences in responses from graduate students and external participants. To the best of the author's knowledge, this is the first such detailed empirical evaluation of a data mining course.
C++ Dynamic Cast in Autonomous Space Systems
Authors: Damian Dechev, Rabi Mahapatra, Bjarne Stroustrup, David Wagner
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

The dynamic cast operation allows flexibility in the design and use of data management facilities in object-oriented programs. Dynamic cast has an important role in the implementation of the Data Management Services (DMS) of the Mission Data System Project (MDS), the Jet Propulsion Laboratory's experimental work for providing a state-based and goal-oriented unified architecture for testing and development of mission software. DMS is responsible for the storage and transport of control and scientific data in a remote autonomous spacecraft. Like similar operators in other languages, the C++ dynamic cast operator does not provide the timing guarantees needed for hard real-time embedded systems. In a recent study, Gibbs and Stroustrup (G&S) devised a dynamic cast implementation strategy that guarantees fast constant-time performance. This paper presents the definition and application of a co-simulation framework to formally verify and evaluate the G&S fast dynamic casting scheme and its applicability in the Mission Data System DMS application. We describe the systematic process of model-based simulation and analysis that has lead to performance improvement of the G&S algorithm's heuristics by about a factor of 2.
Super twisting algorithm-based step-by-step sliding mode observers for nonlinear systems with unknown inputs
Authors: T. Floquet, J. P. Barbot
Venue: International Journal of Systems Science (2007)

This article highlights the interest of step-by-step higher order sliding mode observers for Multi-Input Multi-Output (MIMO) nonlinear systems with unknown inputs. A structural matching condition, commenting on the possibility to design such observers and to reconstruct the unknown inputs, is derived. A finite time sliding mode observer, based on the hierarchical use of the super twisting algorithm, is developed. Then, it is shown that this observer is of interest in the field of hybrid systems and systems with observability singularities. Lastly, it is shown through an example how to relax the usual matching condition by the means of this type of finite time sliding mode observer.
Evaluation of Peer-to-Peer Overlays for First Response
Authors: Dirk Bradler, Jussi Kangasharju, Max Mühlhäuser
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Efficient communication architectures are vital for handling larger scale first response scenarios, and existing mechanisms have several shortcomings due to the heterogeneity of first response groups. In this paper, we consider using peer-to-peer-based communication architectures for first response scenarios. We evaluated different network overlays in environments found in first response -like scenarios. A first response P2P system needs to address both, reliability in high churn situations in network infrastructure mode as well as reasonable usability in wireless ad-hoc networks. Our evaluation shows that a superpeer architecture based on peer capabilities has superior performance when compared with purely unstructured or DHT-based overlays.
SHAPE FROM POSITIONAL-CONTRAST: Characterising Sketches with Qualitative Line Arrangements
Authors: Gottfried; Bjrn
Venue:  (2007)

Graphical queries for the purpose of searching for pictorial information are of growing interest in areas where pictures provide valuable information, including, for instance, design, architecture, and engineering. Sketching graphical queries is a natural way of revealing the visual appearence of objects one has in mind. Bjrn Goffried develops computationally effective concepts for dealing with shape, in particular imprecise and incomplete sketched shapes. He exemplarily applies his method using graphical queries to search for historical objects. Specifying objects graphically, he shows that the new method is in fact capable of dealing with imprecise sketches.
Effects of Parameter Improvement Mechanisms for Intelligent E-Learning Systems
Authors: Xin Zhang, Changchun Gao, Wenwen Zheng
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In the recent years, a hot research topic in the literature is designing useful learning diagnosis systems. In order to set up effective parameters that are frequently used in the learning platforms, we advance three types of learning parameter improvement mechanisms in this article. The proposed learning parameter improvement mechanisms have three useful points: the first is that it can calculate the students’ effective online learning time; the second is that the portion of a message in discussion section which is strongly related to the learning topics can be extracted; the third is plagiarism in students’ homework can be detected easily. Then we feed the derived numeric parameters into a Support Vector Machine (SVM) classifier to predict each learner’s performance so as to verify whether they reflect the student’s studying behaviors. The results from experiments show that the prediction rate for the SVM classifier can be increased up to 35.7% in average after the inputs to the classifier are ‘‘purified’’ by the learning parameter improvement mechanisms. This great achievement reveals that the proposed algorithms indeed produce the effective learning parameters for commonly used e-learning platforms in the literature.
Algebraic algorithms and coding theory
Authors: Madhu Sudan
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

The associated talk surveys some recent developments in algorithmic coding theory that answer some fundamental questions with algebraic techniques.
A DSL approach for object memory management of small devices
Authors: Kevin Marquet, Gilles Grimaud
Venue: Proceedings of the 4th workshop on Programming languages and operating systems (2007)

Small devices have a specific hardware configuration. In particular, they usually include several types of memories (typically ROM, internal and external RAM, ROM, Flash memory) different in quantities and properties. We propose an object memory management where the placement of an object in a given generation is based on different properties. This approach is supported by a domain specific language allowing to write powerful and flexible placement policies. These placement policies completely describe the placement, in the different memories, of the objects handled by the virtual machine.
Directional Invariance of Co-occurrence Matrices within the Liver
Authors: Carl Philips, Daniel Li, Daniela Raicu, Jacob Furst
Venue: Proceedings of the 2008 International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (2008)

Co-occurrence matrices are one of three texture algorithms commonly used on Computed Tomography (CT) images. In this paper we analyze the directional invariance of Co-occurrence matrices for the purpose of reducing their runtime by reducing the number of directions analyzed without negatively affecting the quality of the texture data extracted.
Products of ordinary differential operators by evaluation and interpolation
Authors: Alin Bostan, Frédéric Chyzak, Nicolas Le Roux
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

It is known that multiplication of linear differential operators over ground fields of characteristic zero can be reduced to a constant number of matrix products. We give a new algorithm by evaluation and interpolation which is faster than the previously-known one by a constant factor, and prove that in characteristic zero, multiplication of differential operators and of matrices are computationally equivalent problems. In positive characteristic, we show that differential operators can be multiplied in nearly optimal time. Theoretical results are validated by intensive experiments.
Effective clustering and boundary detection algorithm based on Delaunay triangulation
Authors: Dongquan Liu, Gleb V. Nosovskiy, Olga Sourina
Venue: Pattern Recognition Letters (2008)

In this paper, a new spatial clustering algorithm TRICLUST based on Delaunay triangulation is proposed. This algorithm treats clustering task by analyzing statistical features of data. For each data point, its values of statistical features are extracted from its neighborhood which effectively models the data proximity. By applying specifically built criteria function, TRICLUST is able to effectively handle data set with clusters of complex shapes and non-uniform densities, and with large amount of noises. One additional advantage of TRICLUST is the boundary detection function which is valuable for many real world applications such as geo-spatial data processing, point-based computer graphics, etc.
The Road More Travelled: Web Traffic and Price Competition in Internet Retailing
Authors: Joseph P. Bailey, Samer Faraj, Yuliang Yao
Venue: Electronic Markets (2007)

The Internet is perceived to increase market efficiency, and thus reduce price dispersion. Yet the empirical evidence to support this proposition is mixed. Internet retailers of homogeneous products may choose to actively differentiate their stores and offerings in order to avoid competing just on price. We explore how differentiation among these retailers affects pricing and web traffic. We present empirical results from two homogeneous goods markets, software and personal digital assistants, using price data for a basket of goods from Internet retailer websites. Based on data collected from 90 different retailers and 1,847 product prices, we find that high traffic is associated with lower market prices. However, Internet retailers can mitigate the tendency to compete on price by relying on external linkages from other websites. Furthermore, Internet retailers may use economies of scale and participation with shopbots in conjunction with charging lower prices. Surprisingly, Internet retailer use of economies of scope is associated with higher prices. This indicates that firms may be in a position to avoid price competition by selling a wider product variety.
A fixed-parameter algorithm for the directed feedback vertex set problem
Authors: Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan, Igor Razgon
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

The (parameterized) feedback vertex set problem on directed graphs, which we refer to as the dfvs problem, is defined as follows: given a directed graph G and a parameter k, either construct a feedback vertex set of at most k vertices in G or report that no such set exists. Whether or not the dfvs problem is fixed-parameter tractable has been a well-known open problem in parameterized computation and complexity, i.e., whether the problem can be solved in time f(k)nO(1) for some function f. In this paper we develop new algorithmic techniques that result in an algorithm with running time 4k k! nO(1) for the dfvs problem, thus showing that this problem is fixed-parameter tractable.
Intuition-supporting visualization of user's performance based on explicit negative higher-order relevance
Authors: Heikki Keskustalo, Kalervo Järvelin, Ari Pirkola, Jaana Kekäläinen
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Modeling the beyond-topical aspects of relevance are currently gaining popularity in IR evaluation. For example, the discounted cumulated gain (DCG) measure implicitly models some aspects of higher-order relevance via diminishing the value of relevant documents seen later during retrieval (e.g., due to information cumulated, redundancy, and effort). In this paper, we focus on the concept of negative higher-order relevance (NHOR) made explicit via negative gain values in IR evaluation. We extend the computation of DCG to allow negative gain values, perform an experiment in a laboratory setting, and demonstrate the characteristics of NHOR in evaluation. The approach leads to intuitively reasonable performance curves emphasizing, from the user's point of view, the progression of retrieval towards success or failure. We discuss normalization issues when both positive and negative gain values are allowed and conclude by discussing the usage of NHOR to characterize test collections.
LaasNetExp: a generic polymorphic platform for network emulation and experiments
Authors: Philippe Owezarski, Pascal Berthou, Yann Labit, David Gauchard
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

Network experiments are essential for assessing and validating new networking technologies, architectures and protocols. These assessments have long been performed using network simulators. But it clearly appeared that the results got in simulations cannot be reproduced in real environment. Emulators can hardly integrate accurate models of all networking components, end host operating systems and applications what leads to unrealistic simulations very often. Therefore, some work has been issued for developing real experiment platform and network emulators. This paper addresses the motivations that raised the design and development of such an experimental platform at LAAS - laasnetexp - and describes its constituting features and components. It is in particular detailed how experimental conditions can be fully controlled for reproducible and easy to analyze experiments. Last, this paper describes how realistic conditions can be set-up in experiments by using the results of actual Internet and Internet traffic characterization, analysis and modeling. Such information helps to realistically configure emulators as well as define realistic traffic generators. The realism of such experiments is illustrated as a demonstration of the interest of laasnetexp for networking research.