ppxscal/embedding_network huggingface dataset:
Interorganisational trust in B2B commerce
Authors: Yu 'Andy' Wu, Yuzhu Li
Venue: International Journal of Networking and Virtual Organisations (2009)

Research studying trust in Business-to-Business (B2B) relationships is only burgeoning compared to its B2C counterpart. Updating the Saunders et al. (2004) review with a sample that includes more recent studies, we find an increase in studies on trust in B2B and Interorganisational Systems (IOSs). We group some commonalities we find into three types of trust: relationship, technology and third-party and fit them in a general framework. We also identify four patterns with which researchers operationalise and test B2B trust and evaluate the empirical support for each. We conclude by discussing some gaps we observed during our review of literature.
A semiotic analysis of unified modeling language graphical notations
Authors: Keng Siau, Yuhong Tian
Venue: Requirements Engineering (2009)

Unified modeling language (UML) is the standard modeling language for object-oriented system development. Despite its status as a standard, UML has a fuzzy formal specification and a weak theoretical foundation. Semiotics, the study of signs, provides a good theoretical foundation for UML research because graphical notations (or visual signs) of UML are subjected to the principles of signs. In our research, we use semiotics to study the effectiveness of graphical notations in UML. We hypothesized that the use of iconic signs as UML graphical notations leads to representation that is more accurately interpreted and that arouses fewer connotations than the use of symbolic signs. An open-ended survey was used to test these hypotheses. The results support our propositions that iconic UML graphical notations are more accurately interpreted by subjects and that the number of connotations is lower for iconic UML graphical notations than for symbolic UML graphical notations. The results have both theoretical and practical significance. This study illustrates the usefulness of using semiotics as a theoretical underpinning in analyzing, evaluating, and comparing graphical notations for modeling constructs. The results of this research also suggest ways and means of enhancing the graphical notations of UML modeling constructs.
A security approach for off-chip memory in embedded microprocessor systems
Authors: Romain Vaslin, Guy Gogniat, Jean-Philippe Diguet, Eduardo Wanderley, Russell Tessier, Wayne Burleson
Venue: Microprocessors Microsystems (2009)

This paper describes a complete off-chip memory security solution for embedded systems. Our security core is based on a one-time pad (OTP) encryption circuit and a CRC-based integrity checking module. These modules safeguard external memory used by embedded processors against a series of well-known attacks, including replay attacks, spoofing attacks and relocation attacks. Our implementation limits on-chip memory space overhead to less than 33% versus memory used by a standard microprocessor and reduces memory latency achieved by previous approaches by at least half. The performance loss for software execution with our solution is only 10% compared with a non-protected implementation. An FPGA prototype of our security core has been completed to validate our findings.
Chemieraum: tangible chemistry in exhibition space
Authors: Thomas Gläser, Jens Franke, Götz Wintergerst, Ron Jagodzinski
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

This paper describes a new interactive exhibit that should motivate young people to easily explore the field of chemistry with the help of a tabletop interface. This interface is controlled by a new input device equipped with a haptic and visual feedback.
Efficient simulation for tail probabilities of Gaussian random fields
Authors: Robert J. Adler, Jose Blanchet, Jingchen Liu
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We are interested in computing tail probabilities for the maxima of Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number of distinct point and fields with finite Karhunen-Lo&egrave;ve expansions. For the first case we propose an importance sampling estimator which yields asymptotically zero relative error. Moreover, it yields a procedure for sampling the field conditional on it having an excursion above a high level with a complexity that is uniformly bounded as the level increases. In the second case we propose an estimator which is asymptotically optimal. These results serve as a first step analysis of rare-event simulation for Gaussian random fields.
A Gauss-Newton method for solving bound-constrained underdetermined nonlinear systems
Authors: Maria Macconi, Benedetta Morini, Margherita Porcelli
Venue: Optimization Methods Software (2009)

An iterative method for solving bound-constrained underdetermined nonlinear systems is presented. The procedure consists of a Gauss--Newton method embedded into a trust-region strategy. Global and fast local convergence results are established. A specific implementation of the method is given along with its application to nonlinear systems of equalities and inequalities.
Optimizing user views for workflows
Authors: Olivier Biton, Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given user input on what modules in the workflow specification are relevant to the user, a user view is a concise representation that clusters together modules to create a small number of composite modules (or clusters) such that (1) each composite module in a user view contains at most one relevant (atomic) module, thus assuming the "meaning" of that module; and (2) no control or data dependencies (either direct or indirect) are introduced (soundness) or removed (completeness) between relevant modules. The goal is to find a user view with a smallest number of composite modules. We show that for workflow specifications that are general graphs, regardless of the number of distinct modules in the input workflow and the structure of interaction between them, there always exists a user view of size at most (2k--1 -- k)2 + k, where k is the number of relevant modules. Moreover, a good user view with at most (2k--1 -- k)2 + k clusters can be computed in polynomial time in the size of the graph. We also show that this upper bound is tight. Thus in general graphs, the number of composite modules can be exponentially large in k even in an optimum user view for the specification. We also give a characterization of a good user view in terms of structural properties of each cluster in the user view. However, for series-parallel workflow graphs, we show that there is always a user-view with at most 2k -- 3 composite modules; further, there exist series-parallel graphs where every user view requires at least 2k -- 3 composite modules. Such graphs capture the structure of many scientific and other workflows that we have encountered in practice. For this class of graphs, we give a simple, linear time algorithm for constructing an optimum user view for a given specification.
Awareness, training and trust in interaction with adaptive spam filters
Authors: Henriette S.M. Cramer, Vanessa Evers, Maarten W. van Someren, Bob J. Wielinga
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Even though adaptive (trainable) spam filters are a common example of systems that make (semi-)autonomous decisions on behalf of the user, trust in these filters has been underexplored. This paper reports a study of usage of spam filters in the daily workplace and user behaviour in training these filters (N=43). User observation, interview and survey techniques were applied to investigate attitudes towards two types of filters: a user-adaptive (trainable) and a rule-based filter. While many of our participants invested extensive effort in training their filters, training did not influence filter trust. Instead, the findings indicate that users' filter awareness and understanding seriously impacts attitudes and behaviour. Specific examples of difficulties related to awareness of filter activity and adaptivity are described showing concerns relevant to all adaptive and (semi-)autonomous systems that rely on explicit user feedback.
Progress on AI, Robotics, and Automation in Space: A Report from i-SAIRAS 08
Authors: Richard Doyle, Erick Dupuis, Mitsushige Oda, Jean-Claude Piedbeouf, Gianfranco Visentin
Venue: IEEE Intelligent Systems (2009)

The International Symposium on Artificial Intelligence, Robotics, and Automation in Space (i-SAIRAS) is a unique forum in which several national space agencies convene and report on the development and infusion of technologies in these broad technical areas for space applications. The ninth meeting in this series took place in February 2008 at Universal City, Los Angeles. This article summarizes notable results and trends from the symposium program and discussions.
A Platform Supporting the Implementation of Collaborative Learning through Participatory Simulations
Authors: Gustavo Zurita, Nelson Baloian, Felipe Baytelman, Antonio Farias, Pedro Antunes
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

Student motivation is a key aspect in achieving successful collaborative learning. In the past, some techniques which help to engage the students in a motivating learning activity have been proposed. Among them, Participatory Simulation is one of the newest. In Participatory Simulations, social interaction and motivational effects are the main facilitators. In this work, we present an easy-to-use framework that facilitates the development of mobile computing applications implementing this technique. The use of this framework leads to the development of lightweight peer-to-peer applications for handheld computers with interfaces fully based on pen interaction, and designed to work with handhelds over an ad-hoc wireless network. This paper also shows the development of an application oriented toward the last-year business school undergraduate students for support in learning the concepts of reputation and trust based on the customer's experience and knowledge generated by a company's performance during a good or bad experience.
Skills possessed and skills useful for MIS practitioners: a research report
Authors: Robert M. Henry
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The major report setting forth major curricular recommendations for graduate professional programs in information systems appeared in 1972. The context of the report was an information systems environment and developmental process distinguishing between two analyst activities: information analysis and design analysis. Figure 1 seeks to draw the ACM distinction. And that distinction is carried forth into skill sets identified as desirable for graduates. Six clusters or groupings of skills are offered (people, models, systems, computers, organizations, and society) and thirteen courses are proposed to impart those skills. The thirteen courses are set forth as a two-year graduate core curriculum for both information and design analysts.
Differential evolution for solving multi-mode resource-constrained project scheduling problems
Authors: N. Damak, B. Jarboui, P. Siarry, T. Loukil
Venue: Computers and Operations Research (2009)

In this paper we consider the resource-constrained project scheduling problem with multiple execution modes for each activity and minimization of the makespan. To solve this problem, we propose a differential evolution (DE) algorithm. We focus on the performance of this algorithm to solve the problem within small time per activity. Finally, we present the results of our thorough computational study. Results obtained on six classes of test problems and comparison with other algorithms from the literature show that our algorithm gives better solutions.
Distributed multi-layered workload synthesis for testing stream processing systems
Authors: Eric Bouillet, Parijat Dube, David George, Zhen Liu, Dimitrios Pendarakis, Li Zhang
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Testing and benchmarking of stream processing systems requires workload representative of real world scenarios with myriad of users, interacting through different applications over different modalities with different underlying protocols. The workload should have realistic volumetric and contextual statistics at different levels: user level, application level, packet level etc. Further realistic workload is inherently distributed in nature. We present a scalable framework for synthesis of distributed workload based on identifying different layers of workload corresponding to different time-scales. The architecture is extensible and modular, promotes reuse of libraries at different layers and offers the flexibility to add additional plug-ins at different layers without sacrificing the efficiency.
Several Families of Sequences with Low Correlation and Large Linear Span
Authors: Fanxin Zeng, Zhenyu Zhang
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In DS-CDMA systems and DS-UWB radios, low correlation of spreading sequences can greatly help to minimize multiple access interference (MAI) and large linear span of spreading sequences can reduce their predictability. In this letter, new sequence sets with low correlation and large linear span are proposed. Based on the construction Tr1m[Trmn(αbt + γiαdt)]r for generating p-ary sequences of period pn-1, where n = 2m, d = upm ± v, b = u ± v, γi ε GF(pn), and p is an arbitrary prime number, several methods to choose the parameter d are provided. The obtained sequences with family size pn are of four-valued, five-valued, six-valued or seven-valued correlation and the maximum nontrivial correlation value is (u + v-1)pm-1. The simulation by a computer shows that the linear span of the new sequences is larger than that of the sequences with Niho-type and Welch-type decimations, and similar to that of [10].
Analysis and study of an automobile rear seat by FEM
Authors: P. J. Garcia Nieto, J. A. Vilan Vilan, J. J. Del Coz Diaz, J. M. Matias
Venue: International Journal of Computer Mathematics (2009)

The aim of this work is to carry out the design of an automobile rear seat and the simulation by finite element method (FEM) on its performance using different standard tests. The design is intended for the rear seats of a four-seat vehicle: two front seats and two rear seats. The rear seat set comprises the right and the left seats. Each of these seats is individual and independent so that it can house only a person and is structurally independent of the other one. Two main parts of this work are: (1) design; and (2) analysis by FEM. We carry out the design of the rear seat of a generic automobile, using the CAD Catia V4 software [P. Carman and P. Tigwell, CATIA Reference Guide, OnWord Press, New York, 1998; F. Karam and C.D. Kleismit, Using CATIA, OnWord Press, New York, 2003]. The seat is composed of two very different parts: (a) framework which is the internal structure of the seat, supporting the weight of the occupants and the seat itself, in order to allow the different positions and to assure the durability and correct operation throughout the vehicle's useful life, and (b) foam rubber whose function is to distribute the load, to provide comfort and to give the most aesthetic possible finish to the seat. During the design we have kept in mind criteria such as resistance, safety, durability, aesthetic and lightness; this last property is necessary to achieve fuel economy and a lower inertia in the event of a collision. The standard rules demand that the automobile seats are able to overcome a series of tests, implying the security in the event of a road accident. In this study the tests were carried out by finite element simulations. The software used was Pam-Crash, a well-known non-linear explicit solver of finite elements. From the computer simulation of these tests, stresses and displacement data are obtained for the seat's framework in order to check the correct execution of the demands of the standard rules, carrying out, if necessary, changes in the design within the allowed limits. In this way the use of this tool makes possible to carry out an optimisation of the geometry, materials, etc. of the product before the construction of the prototype, minimising costs and manufacturers' development time.
Application-based TCP hijacking
Authors: Oliver Zheng, Jason Poon, Konstantin Beznosov
Venue: Proceedings of the Second European Workshop on System Security (2009)

We present application-based TCP hijacking (ABTH), a new attack on TCP applications that exploits flaws due to the interplay between TCP and application protocols to inject data into an application session without either server or client applications noticing the spoofing attack. Following the injection of a TCP packet, ABTH resynchronizes the TCP stacks of both the server and the client. To evaluate the feasibility and effectiveness of ABTH, we developed a tool that allows impersonating users of Windows Live Messenger in the matter of few seconds. Due to its generic nature, ABTH can be mounted on a variety of modern protocols for TCP-based applications. Countermeasures to thwart and/or limit the effectiveness of ABTH could include strict Ethernet switching and cryptographic protection of messages. However, the former cannot be guaranteed by the application provider and the latter appears to be still prohibitively expensive for such large-scale applications with hundreds of millions of sporadic users as Windows Live Messenger.
Brief paper: Adaptive input shaping for manoeuvring flexible structures using an algebraic identification technique
Authors: E. Pereira, J. R. Trapero, I. M. Díaz, V. Feliu
Venue: Automatica (Journal of IFAC) (2009)

Input shaping is an efficient feedforward control technique which has motivated a great number of contributions in recent years. Such a technique generates command signals with which manoeuvre flexible structures without exciting their vibration modes. This paper presents a novel adaptive input shaper based on an algebraic non-asymptotic identification. The main characteristic of the algebraic identification in comparison with other identification methods is the short time needed to obtain the system parameters without defining initial conditions. Thus, the proposed adaptive control can update the input shaper during each manoeuvre when large uncertainties are present. Simulations illustrate the performance of the proposed method.
An application-centered design flow for self reconfigurable systems implementation
Authors: Fabio Cancare, Marco D. Santambrogio, Donatella Sciuto
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Up to now every proposed methodology for implementing dynamic self reconfigurable systems is architecture-centered. In most cases the system development process is time consuming and requires a very specific technical background. Aim of this work is to provide a fast brain to bit design flow whose goal is to simplify the dynamic reconfigurable system development process by shifting the designer focus from the architecture point of view to the application point of view: designers will not need to possess Dynamic Reconfigurability expertise but just to be skilled with the application domain.
Intelligent and Pervasive Multimedia Systems
Authors: William I. Grosky, Chengcui Zhang, Shu-Ching Chen
Venue: IEEE MultiMedia (2009)

Recent advances in pervasive computing and the proliferation of multimedia-capable devices have stimulated the development of intelligent and pervasive multimedia applications. This special issue provides excellent coverage of this area, including interactive multimedia education, quality control and personalization of multimedia services, peer-to-peer multimedia streaming, mobile TV, and VoIP systems.
On the Automated Interpretation and Indexing of American Football
Authors: Mihai Lazarescu, Svetha Venkatesh, Geoff West, Terry Caelli
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

This work combines natural language understanding and image processing with incremental learning to develop a system that can automatically interpret and index American Football. We have developed a model for representing spatio-temporal characteristics of multiple objects in dynamic scenes in this domain. Our representation combines expert knowledge, domain knowledge, spatial knowledge and temporal knowledge. We also present an incremental learning algorithm to improve the knowledge base as well as to keep previously developed concepts consistent with new data. The advantages of the incremental learning algorithm are that is that it does not split concepts and it generates a compact conceptual hierarchy which does not store instances.
Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3
Authors: Igor Razgon
Venue: Journal of Discrete Algorithms (2009)

In this paper we propose an O(1.0892^n) algorithm solving the Maximum Independent Set problem for graphs with maximum degree 3 improving the previously best upper bound of O(1.0977^n). A useful secondary effect of the proposed algorithm is that being applied to 2k kernel, it improves the upper bound on the parameterized complexity of the Vertex Cover problem for graphs with maximum degree 3 (VC-3). In particular, the new upper bound for the VC-3 problem is O(1.1864^k+n), improving the previously best upper bound of O(k^2*1.194^k+n). The presented results have a methodological interest because, to the best of our knowledge, this is the first time when a new parameterized upper bound is obtained through design and analysis of an exact exponential algorithm.
An efficient group key management scheme for mobile ad hoc networks
Authors: Bing Wu, Jie Wu, Yuhong Dong
Venue: International Journal of Security and Networks (2009)

Group key management is one of the basic building blocks in collaborative and group-oriented applications in Mobile AdHoc Networks (MANETs). Group key establishment involves creating and distributing a common secret for all group members. However, key management for a large and dynamic group is a difficult problem because of scalability and security. Modification of membership requires the group key to be refreshed to ensure backward and forward secrecy. In this paper, we propose a Simple and Efficient Group Key (SEGK) management scheme for MANETs. Group members compute the group key in a distributed manner.