ppxscal/embedding_network huggingface dataset:
Evaluating the behaviour of information systems developers: the relevance and utility of paradigms
Authors: Zahid Hussain, W. Andrew Taylor
Venue: Behaviour & Information Technology (2007)

The primary objective of this research was to investigate the behaviour of information systems (IS) developers during the IS development (ISD) process using the four-paradigm framework of Hirschheim et al. (1995), who introduced this approach to uncover the relationships between developers' assumptions and concomitant behaviours. The central issue is whether this four-paradigm framework can be operationalised to categorise the behaviours of IS developers. Using case studies of three UK National Health Service organisations in the North of England, we focus on the behavioural rather than the cognitive (assumptions) aspect of the four-paradigm approach. We employ a multi-method research design based on document analysis, structured interviews and participant observation in both formal and informal project settings. Our findings suggest that the four-paradigm approach is capable of classifying developer behaviour. We identify the existence of multiple paradigms in the ISD process and explore the effects of a dominant paradigm on developers' behaviours.
Real-Time Property Verification in Organic Computing Systems
Authors: Steffen Stein, Arne Hamann, Rolf Ernst
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Integrating new functionality into complex embedded hard real-time systems requires considerable engineering effort. Emerging formal analysis methodologies and tools from real-time research assist system engineers solving this integration problem. For future organic computer systems, however, it is desirable to integrate these approaches into running systems, enabling them to autonomously perform e.g. online acceptance tests and self-optimization in case of system or environmental changes. This results in high system robustness and extensibility without explicit engineering effort. In this paper, we present an approach adapting formal compositional analysis techniques to realize self-awareness and self-adaptation in embedded systems with respect to real-time properties such as latency constraints, buffer sizes, etc. We introduce a framework for distributed online performance analysis running on embedded real-time systems. Based on this framework we implement an acceptance test for the integration of new functionality into an existing embedded real-time system. Furthermore, we present an online optimization algorithm based on the same framework. In a case study, we demonstrate the applicability of the approach and show that online optimization can increase the acceptance rate with reasonable computational effort.
An efficient delegation protocol with delegation traceability in the X.509 proxy certificate environment for computational grids
Authors: Younho Lee, Heeyoul Kim, Yongsu Park, Hyunsoo Yoon
Venue: Information Sciences: an International Journal (2008)

The X.509 proxy certificate is widely used to delegate an entity's right to another entity in the computational grid environment. However, this proxy certificate has two drawbacks: the potential security threat caused by non-traceability of a delegation chain and the inefficiency caused by an interactive communication between the right grantor and the right grantee on the delegation protocol. To address these problems, a new delegation protocol is presented. The proposed protocol employs an ID-based key generation technique to support delegation traceability and non-interactive delegation. Since access-right delegation occurs frequently in the computational grid environment, the proposed protocol can enhance security by providing delegation traceability and can enhance efficiency by reducing the inter-domain communication cost.
Cooperative caching in mobile ad hoc networks based on data utility
Authors: Narottam Chand, R. C. Joshi, Manoj Misra
Venue: Mobile Information Systems (2007)

Cooperative caching, which allows sharing and coordination of cached data among clients, is a potential technique to improve the data access performance and availability in mobile ad hoc networks. However, variable data sizes, frequent data updates, limited client resources, insufficient wireless bandwidth and client's mobility make cache management a challenge. In this paper, we propose a utility based cache replacement policy, least utility value (LUV), to improve the data availability and reduce the local cache miss ratio. LUV considers several factors that affect cache performance, namely access probability, distance between the requester and data source/cache, coherency and data size. A cooperative cache management strategy, Zone Cooperative (ZC), is developed that employs LUV as replacement policy. In ZC one-hop neighbors of a client form a cooperation zone since the cost for communication with them is low both in terms of energy consumption and message exchange. Simulation experiments have been conducted to evaluate the performance of LUV based ZC caching strategy. The simulation results show that, LUV replacement policy substantially outperforms the LRU policy.
Secure mobile P2P videoconferencing protocol
Authors: José Vicente Aguirre, Rafael Álvarez, Antonio Zamora
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

In this paper, we present and analyze a lightweight peer-to-peer (P2P) protocol to provide multiparty videoconference services on small platforms like mobile phones or PDAs. These services provide interesting characteristics for many emerging applications that require a common audio and video channel between different users which are far apart but with an internet connection. The proposed protocol is distributed and does not require specialized servers or specific network infrastructure for its operation.
Toward an epistemology of Wikipedia
Authors: Don Fallis
Venue: Journal of the American Society for Information Science and Technology (2008)

Wikipedia (the &ldquo;free online encyclopedia that anyone can edit&rdquo;) is having a huge impact on how a great many people gather information about the world. So, it is important for epistemologists and information scientists to ask whether people are likely to acquire knowledge as a result of having access to this information source. In other words, is Wikipedia having good epistemic consequences? After surveying the various concerns that have been raised about the reliability of Wikipedia, this article argues that the epistemic consequences of people using Wikipedia as a source of information are likely to be quite good. According to several empirical studies, the reliability of Wikipedia compares favorably to the reliability of traditional encyclopedias. Furthermore, the reliability of Wikipedia compares even more favorably to the reliability of those information sources that people would be likely to use if Wikipedia did not exist (viz., Web sites that are as freely and easily accessible as Wikipedia). In addition, Wikipedia has a number of other epistemic virtues (e.g., power, speed, and fecundity) that arguably outweigh any deficiency in terms of reliability. Even so, epistemologists and information scientists should certainly be trying to identify changes (or alternatives) to Wikipedia that will bring about even better epistemic consequences. This article suggests that to improve Wikipedia, we need to clarify what our epistemic values are and to better understand why Wikipedia works as well as it does. Somebody who reads Wikipedia is &ldquo;rather in the position of a visitor to a public restroom,&rdquo; says Mr. McHenry, Britannica's former editor. &ldquo;It may be obviously dirty, so that he knows to exercise great care, or it may seem fairly clean, so that he may be lulled into a false sense of security. What he certainly does not know is who has used the facilities before him.&rdquo; One wonders whether people like Mr. McHenry would prefer there to be no public lavatories at all. The Economist (Vol. 379, April 22, 2006, pp. 14&ndash;15) &copy; 2008 Wiley Periodicals, Inc.
Analysis of HCV Envelope Proteins Interacting with Human Proteins
Authors: Chirag Nepal, Kyungsook Han
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Despite much progress in clinical and basic research on hepatitis C virus (HCV), interactions between HCV proteins and human proteins is not fully understood. HCV envelope proteins have many cellular targets in human proteins and affect several biological functions. From the analysis of known interactions between HCV E2 envelope proteins and human proteins, we identified a binding motif A-x(3,5)-A-x(0,2)-V-V-x[DKR]-[DS]-[AV]-[ENS]-[DEGN] in all interacting human proteins. This binding motif is essential to the interactions with HCV envelope proteins. We also found several sequence patterns in HCV E2 proteins. The binding motif and sequence patterns found in our study would be helpful in better understanding of interaction mechanisms and in design of new drugs to combat the disease.
Global/local issues in electroacoustic music for the cinema of the real: A case study
Authors: Alessandro Cipriani, Giulio Latini
Venue: Organised Sound (2008)

The authors describe various experiences regarding the use of sonic materials from local musical cultures and soundscapes in the field of electroacoustic music as applied to the creative documentary. The introduction concentrates on the general characteristics of the process of ‘globalisation’ now underway and on the various different interpretations of it that have been developed over the last fifteen years. A number of methodological and ethical questions are then asked in relation to the debate regarding the global/local dichotomy in the context of electroacoustic and audiovisual elaboration, especially when phonic material originating from the most varied geographic-cultural areas is artistically restructured and reconfigured. In the third part of the article the accent is placed on the personal experiences of the authors regarding the production of pieces of electroacoustic music and documentaries realised in Morocco, China and Lapland. In the last section the article concentrates on a possible diachronic perspective (i.e. studying a phenomenon in its passage through time) by means of which one can come to a relationship with soundscape sounds, and some sonic and visual examples from works realised in Catania and London are supplied.
Robust uniformly ultimate boundedness control for uncertain switched linear systems
Authors: Liguo Zhang, Ying Lu, Yangzhou Chen, Nikos E. Mastorakis
Venue: Computers Mathematics with Applications (2008)

This paper presents uniformly ultimate boundedness (UUB) control design for switched linear systems with parametric uncertainties. Only the possible bound of the uncertainty is needed. Under arbitrary switching laws, a continuous state feedback control scheme is proposed in order to guarantee uniformly ultimate boundedness of every system response within an arbitrary small neighborhood of the zero state. The design techniques are based on common Lyapunov functions and Lyapunov minimax approach.
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
Authors: Olivier Beaumont, Larry Carter, Jeanne Ferrante, Arnaud Legrand, Loris Marchal, Yves Robert
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we consider the problem of fairly and efficiently scheduling Bags of Tasks applications on a distributed network of processors organized as a tree. The goal of scheduling is to maximize throughput of each application while ensuring a fair sharing of resources between applications. We particularly investigate decentralized schedulers that use only local information at each participating resource and we assess their performance via simulation, and compare to an optimal centralized solution obtained via linear programming.
GP^2S: Generic Privacy-Preservation Solutions for Approximate Aggregation of Sensor Data (concise contribution)
Authors: Wensheng Zhang, Chuang Wang, Taiming Feng
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Protecting privacy in sensor networks poses new challenges because of the potential incompatibilities between new privacy-preserving mechanisms and mechanisms already implemented in sensor networks (such as in-network data aggregation). To address this problem, we propose in this paper a set of new privacy-preservation data aggregation schemes. Different from past research, our solutions have the following features: supporting data aggregation for a variety of queries; providing privacy protection for both individual data and aggregate data; being resilient to any number of node collusion; being highly efficient.
iPSL: An Environment for IP-Based PSL Specification
Authors: Naiyong Jin, Juan Zhou, Taoyong Ni
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

In PSL, behavioral properties of an IP core and its environment are directed by different directives. Improperly directed properties will severely impact the validity of refinement verification, specification assurance, and the evolution of specification hierarchy. In this paper, we introduce a tool iPSL which supports users to apply IP-based design methodology to PSL specifications. iPSL incorporates three methods for principled construction of PSL specifications. 1) We propose rules which restrict operand types of temporal operators so that we can check whether properties are correctly directed in expressing their roles. 2) We propose semantics for composing IP-based PSL specification. With the semantics, we can pick out properties which need further abstractions after composition. 3) We also provide a semantics for the inherit operator so that we can evolve a system specification from those of existing IP cores.
Computer animation in creative design
Authors: Grazyna Slusarczyk
Venue: Machine Graphics Vision International Journal (2007)

The paper proposes a new approach to graphic design with the use of computer animation. The class of designs considered are periodic patterns. First, the characterization of rosettes, borders and periodic planar designs is given. Then, a generative system which produces a great variety of periodic designs is equipped with animation. As in-between animation frames ensure the continuity and fluidity of pattern movement, a dynamic continuous design space is obtained. The changes in pattern symmetry groups which result from the use of animation are described. The role of animation in supporting perception of the emergent shapes in the generated patterns is also mentioned. The paper is illustrated by periodic designs produced by the DARTAN animated generative system.
Elucidating strategic network dynamics through computational modeling
Authors: Zhiang (John) Lin, James A. Kitts, Haibin Yang, J. Richard Harrison
Venue: Computational Mathematical Organization Theory (2008)

In this study we describe a comprehensive computational model of network dynamics (COM-NeD) and demonstrate how it may help us better understand and theorize the dynamics of strategic networks. Specifically, we model a population of firms characterized by idiosyncratic resource needs and productive capacities, while having to respond to the demands of external events by establishing ties and receiving needed resources from other firms. Through COM-NeD we investigate a set of established theoretical perspectives that represent distinct strategies for seeking and establishing interfirm ties. Rigorous computational experiments demonstrate the expected behavior of such a system under a broad range of assumptions. The results shed light on the complexity of strategic network dynamics, demonstrating novel interactions of firms' internal resource capacity, relational search approaches, and external resource growth.
A Robust Formulation for Support Vector Regression
Venue: Proceedings of the 2007 International Conference on Computational Intelligence and Security Workshops (2007)

This paper investigates a new support vector regression model in which the observed data are corrupted with noise. We present a second-order cone programming formulation for designing robust regression which can handle uncertainty in data. Empirical results are included to show that the robust model is superior to the standard model. 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
Summarizing developer work history using time series segmentation: challenge report
Authors: Harvey Siy, Parvathi Chundi, Mahadevan Subramaniam
Venue: Proceedings of the 2008 international working conference on Mining software repositories (2008)

Temporal segmentation partitions time series data with the intent of producing more homogeneous segments. It is a technique used to preprocess data so that subsequent time series analysis on individual segments can detect trends that may not be evident when performing time series analysis on the entire dataset. This technique allows data miners to partition a large dataset without making any assumption of periodicity or any other a priori knowledge of the dataset's features. We investigate the insights that can be gained from the application of time series segmentation to software version repositories. Software version repositories from large projects contain on the order of hundreds of thousands of timestamped entries or more. It is a continuing challenge to aggregate such data so that noise is reduced and important characteristics are brought out. In this paper, we present a way to summarize developer work history in terms of the files they have modified over time by segmenting the CVS change data of individual Eclipse developers. We show that the files they modify tends to change significantly over time though most of them tend to work within the same directories.
The algorithmic aspects of the regularity lemma
Authors: N. Alon
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The regularity lemma of Szemeredi (1978) is a result that asserts that every graph can be partitioned in a certain regular way. This result has numerous applications, but its known proof is not algorithmic. The authors first demonstrate the computational difficulty of finding a regular partition; they show that deciding if a given partition of an input graph satisfies the properties guaranteed by the lemma is co-NP-complete. However, they also prove that despite this difficulty the lemma can be made constructive; they show how to obtain, for any input graph, a partition with the properties guaranteed by the lemma, efficiently. The desired partition, for an n-vertex graph, can be found in time O(M(n)), where M(n)=O(n/sup 2.376/) is the time needed to multiply two n by n matrices with 0,1-entries over the integers. The algorithm can be parallelized and implemented in NC/sup 1/.
A bayesian logistic regression model for active relevance feedback
Authors: Zuobing Xu, Ram Akella
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Relevance feedback, which traditionally uses the terms in the relevant documents to enrich the user's initial query, is an effective method for improving retrieval performance. The traditional relevance feedback algorithms lead to overfitting because of the limited amount of training data and large term space. This paper introduces an online Bayesian logistic regression algorithm to incorporate relevance feedback information. The new approach addresses the overfitting problem by projecting the original feature space onto a more compact set which retains the necessary information. The new set of features consist of the original retrieval score, the distance to the relevant documents and the distance to non-relevant documents. To reduce the human evaluation effort in ascertaining relevance, we introduce a new active learning algorithm based on variance reduction to actively select documents for user evaluation. The new active learning algorithm aims to select feedback documents to reduce the model variance. The variance reduction approach leads to capturing relevance, diversity and uncertainty of the unlabeled documents in a principled manner. These are the critical factors of active learning indicated in previous literature. Experiments with several TREC datasets demonstrate the effectiveness of the proposed approach.
Bridging the Object-Relational Divide
Authors: Craig Russell
Venue: Queue (2008)

Modern applications are built using two very different technologies: object-oriented programming for business logic; and relational databases for data storage. Object-oriented programming is a key technology for implementing complex systems, providing benefits of reusability, robustness, and maintainability. Relational databases are repositories for persistent data. ORM (object-relational mapping) is a bridge between the two that allows applications to access relational data in an object-oriented way.
Navigation modes in virtual environments: walking vs. joystick
Authors: Peng Peng, Bernhard E. Riecke, Betsy Williams, Timothy P. McNamara, Bobby Bodenheimer
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

There is considerable evidence that people have difficulty maintaining orientation in virtual environments. This difficulty is usually attributed to poor idiothetic cues, such as the absence of proprioception and other sources of information provided by self locomotion. The lack of proprioceptive cues presents a strong argument against the use of a joystick interface, and the importance of full physical movement for navigation tasks has also recently been confirmed by Ruddle and Lessels [2006], who showed that subjects performing a navigational task were superior when they were allowed to walk freely rather than when they could only physically rotate themselves or only move virtually. Our study seeks to confirm the results of Ruddle and Lessels.
Multiuser adaptive transmission technique for time-varying frequency-selective fading channels
Authors: D. Rhee, H. G. Hwang, Y. J. Sang, K. S. Kim
Venue: Signal Processing (2008)

This paper proposes an efficient multiuser adaptive modulation and coding (AMC) scheme that considers inevitable feedback delay by employing short-term and long-term channel state information (CSI) in time-varying frequency-selective fading channels. By taking the statistic of the true signal-to-noise ratio (SNR) at a given predicted SNR value into account, the required transmit power to meet the target packet-error-rate (PER) can be obtained and used for user selection, power allocation, and modulation and coding set (MCS) selection. In addition, a simple and useful approximation method of obtaining the required transmit power is proposed. The performance of the proposed scheme is shown to be much better than that of conventional schemes without considering the feedback delay or the prediction error. The proposed scheme can also reduce the feedback resource while maintaining the system throughput by allocating different feedback resources to different users according to their prediction error variances.