ppxscal/embedding_network huggingface dataset:
The relationship between manager's leadership style and employee job satisfaction in selected beijing computer software companies
Authors: Judith E. Beauford
Venue:  (2008)

The purpose of this study is to examine the relationship between manager's leadership style and employee job satisfaction in Beijing computer software companies. Specifically, this research identified how the authoritarian, benevolent, or moral leadership style measured by Paternalistic Leadership Scale (PLS) relates to employees' satisfaction with work, pay, opportunities for promotion, supervision, coworkers, and the job in general as measured by Job Descriptive Index (JDI) and demographic characteristics including gender, age, educational background, and work experience. Survey packages containing the PLS, the JDI, and a demographic questionnaire were distributed to 200 managers and employees who had worked at least 6 months in 10 selected Beijing computer software companies. Of these surveys, 107 survey packages (53.50%) were returned and 103 were valid including 19 managers and 84 employees. Descriptive and inferential statistical techniques, including means, frequencies, percentages, Cronbach alpha coefficients, Chi-Square Goodness of Fit test, Simple and Canonical Correlation, Pearson Chi-Square Test of Independence were used for analysis by using SPSS. The .05 level of statistical significance was set for all the statistical computation. The results indicated that moral leadership was perceived as the dominant leadership style in the 10 Beijing computer software companies, and benevolent leadership was perceived as the least significant one. The finding of this study revealed that the level of employees' job satisfaction in Beijing computer software companies was high on the six factors of Job Descriptive Index (JDI). Specifically, the employees were very satisfied with their current jobs on work, pay, supervision, coworker, and job in general. The only factor of job satisfaction at medium level was satisfaction with opportunities for promotion. The perceptions of moral and benevolent leadership showed strongest correlation with satisfaction with opportunities for promotion in both Pearson and canonical correlations. Perception of authoritarian leadership was negatively correlated with satisfaction with both supervision and coworker in both Pearson and canonical correlations. Perception of moral leadership correlated with the most satisfaction factors.
Energy-Efficient Multi-path Routing in Wireless Sensor Networks
Authors: Philipp Hurni, Torsten Braun
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

The paper investigates the usefulness of multi-path routing to achieve lifetime improvements by load balancing and exploiting cross-layer information in wireless sensor networks. Performance gains in the order of 10-15 % could be achieved by altering path update rules of existing on-demand routing schemes. Problems encountered with concurrent traffic along interfering paths have been identified as a direct consequence of special MAC protocol properties.
The Intensional Lambda Calculus
Authors: Sergei Artemov, Eduardo Bonelli
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion ¿ A is replaced by [[s]]A whose intended reading is "s is a proof of A". A term calculus for this formulation yields a typed lambda calculus ¿ I that internalises intensional information on how a term is computed. In the same way that the Logic of Proofs internalises its own derivations, ¿ I internalises its own computations. Confluence and strong normalisation of ¿ I is proved. This system serves as the basis for the study of type theories that internalise intensional aspects of computation.
Peer-to-Peer Market Places: Technical Issues and Revenue Models
Authors: Giancarlo Ruffo
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

Recently, Steve Jobs, in his public "Thoughts on Music", pointed out the Digital Rights Management (DRM) systems that Apple has been imposed to adopt for protecting its music against piracy. This brings to a paradox: DRM-protected digital music is prevented from being played by devices of different producers. Conversely, DRM-free content, that uses "open" formats (e.g., MP3 for music and MPEG4 for movies), can be downloaded, distributed, copied and played on different devices. This is an implicit disincentive to legally buy copy-protected digital content, because DRM-free files are interoperable: in fact, 97% of the music filling iPods is unprotected and of obscure origins. Jobs' conclusions are quite astonishing: abolishing DRMs entirely and selling music encoded in open licensable formats. However, there is no obvious reason for believing that piracy would decrease even if the Steve Jobs' dream for a "DRM-free" world will finally occur. This implies that future legal market models have to consider serious, scalable, efficient, secure and reliable alternatives to DRM-based on-line (centralized) stores. The Peer-to-Peer paradigm provides a quite mature framework for this applicative domain, making digital content sharing applications a valid solution even for small vendors and emerging artists. In fact, small-medium parties of a market place could hardly afford production and maintenance costs that can be very high if distribution is provided by means of a resilient client-server architecture (e.g., iTunes, Yahoo!, Microsoft Media Shop). But, despite to their big potentials, Peer-to-Peer systems have became infamous through the file sharing applications that make easy for the users to access copy-protected files for free; in fact, it is very difficult to trace the peers' activity, and identification of abuses cannot be fairly performed because of the absence of a central authority. Moreover, a business model is hard to find: it is questionable if other actors than the owner of an object should be involved in a transaction as a provider. The p2p distribution framework leads to technical advantages, but its economical benefits are not clear: the receiver of the bought object can become the distributor later on, but why should he/she provide properly the content if the owner wants to be reimbursed? The tutorial will cover other important services that a market place must include: reputation management, implementation of different preliminary transactions (e.g., bartering, bidding an offer, auctioning), and accounting in decentralized domain. Finally, social networking and self organized communities can be exploited in order to enforce epidemic phenomena and word of mouth marketing. No need to be said, the proper interoperability of incentive strategies, reputation and trust management, accounting solutions, and efficient networking (e.g., search and peer's cooperation) techniques is critical.
A Real-World Attack Breaking A5/1 within Hours
Authors: Timo Gendrullis, Martin Novotný, Andy Rupp
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

In this paper we present a real-world hardware-assisted attack on the well-known A5/1 stream cipher which is (still) used to secure GSM communication in most countries all over the world. During the last ten years A5/1 has been intensively analyzed [1,2,3,4,5,6,7]. However, most of the proposed attacks are just of theoretical interest since they lack from practicability -- due to strong preconditions, high computational demands and/or huge storage requirements -- or have never been fully implemented.In contrast to these attacks, our attack which is based on the work by Keller and Seitz [8] is running on an existing special-purpose hardware device, called COPACOBANA [9]. With the knowledge of only 64 bits of keystream the machine is able to reveal the corresponding internal 64-bit state of the cipher in about 6 hours on average. We provide a detailed description of our attack architecture as well as implementation results.
Explicit Reflection in Prolog-Tutor
Authors: Josephine Tchetagni, Roger Nkambou, Jacqueline Bourdeau
Venue: International Journal of Artificial Intelligence in Education (2007)

This paper describes a reflection-based approach for open learner modeling (OLM). Tutoring dialogues are used by learners to explicitly reveal their own knowledge state to themselves. Dewey's theory of reflective thinking is used to create tutorial strategies which govern these dialogues. Drake's specification of critical thinking, associated to a defined set of skills, is used to define tutoring tactics implementing these strategies. The main contribution of this approach to OLM is that it provides a set of principled and reusable tutorial strategies and tactics to promote reflection, as they are based on domain independent theories. Furthermore, an evaluation of such a principled approach to OLM is straightforward in certain cases, as it refers to theories which already provide evaluation criteria. The approach is integrated in Prolog-Tutor, an existing intelligent tutoring system for Logic Programming. This paper presents a qualitative study of the resulting system, based on think-aloud protocols. A result analysis reveals that explicitly fostering reflection supports reflection based OLM and provides landmarks to explain its manifestations. However, the results also suggest that this openness may be less helpful when used by learners who have already honed a high level of proficiency in logic programming.
Self-Reconfigurable Mixed-Signal Integrated Circuits Architecture Comprising a Field Programmable Analog Array and a General Purpose Genetic Algorithm IP Core
Authors: Didier Keymeulen, Adrian Stoica, Ricardo Zebulum, Srinivas Katkoori, Pradeep Fernando, Hariharan Sankaran, Mohammad Mojarradi, Taher Daud
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

Development of analog electronics solutions for space avionics is expensive and time-consuming. Lack of flexible analog devices, counterparts to digital Field Programmable Gate Arrays (FPGA), prevents analog designers from the benefits of rapid prototyping. This forces them to expensive and lengthy custom design, fabrication, and qualification of application specific integrated circuits (ASIC). This paper describes a recent FPAA design, the Self-Reconfigurable Analog Array (SRAA) that was developed at JPL. It has a large variety of analog building block components in the cells of the array and allows to operate over a wide range of temperature using a built in general purpose genetic algorithm (GA) engine as an intellectual property (IP) core.
Minimization of the Redundant Coverage for Dense Wireless Sensor Networks
Authors: Dingxing Zhang, Ming Xu, Shulin Wang, Boyun Zhang
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Density control is a promising method to conserve system energy and prolonging lifetime of wireless sensor networks. In this paper, we address the issue of maintaining sensing coverage of surveillance target in large density wireless sensor networks and present an efficient technique for the selection of active sensor nodes. First, the At Most k-Coverage Problem (AM k-Coverage) is defined and modeled as a nonlinear integer programming. Second, Genetic Algorithm which is a quasi-parallel method to construct set cover is designed to solve the multi-objective nonlinear integer programming. And later by using Genetic Algorithm, a central algorithm is designed to organize a sensor network into coverage sets. Finally, Experimental results show that the proposed algorithm can construct the coverage sets reliably and reduce the number of active sensor nodes which is helpful to reduce system energy consumption and prolong the network lifespan.
Twenty-five years of Mokum: For 25 years of data and knowledge engineering: Correctness by design in relation to MDE1The acronym MDA is a trademark of the OMG; MDE is the alternative.1 and correct protocols in cyberspace
Authors: Reind P. van de Riet
Venue: Data Knowledge Engineering (2008)

The use of the Mokum system for correctly designing Information Systems (in the old days called Data Base Systems) and how these designs can automatically be translated into implementations, is one theme of this paper. Theoretical considerations will not be avoided. Similarities and differences with tools from the field of Model Driven Architecture, such as UML, will be demonstrated. How to deal with Mokum in a situation with many sites, as in real Cyberspace is demonstrated as a second theme. Special attention is given to a protocol: MAP, which guarantees that a certain access constraint is being maintained. The constraint being that for an object in one site to obtain access to an attribute of an object in another, a third site must give permission. The technique is based on a new notion: the Triple, to be used in a Knowledge based Engineering environment.
Incentives in effort games
Authors: Yoram Bachrach, Jeffrey S. Rosenschein
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

We consider Effort Games, a game theoretic model of cooperation in open environments, which is a variant of the principal--agent problem from economic theory. In our multiagent domain, a common project depends on various tasks; achieving certain subsets of the tasks completes the project successfully, while others do not. The probability of achieving a task is higher when the agent in charge of it exerts effort, at a certain cost for that agent. A central authority, called the principal, attempts to incentivize agents to exert effort, but can only reward agents based on the success of the entire project. We model this domain as a normal form game, where the payoffs for each strategy profile are defined based on the different probabilities of achieving each task and on the boolean function that defines which task subsets complete the project and which do not. We view this boolean function as a simple coalitional game, and call this game the underlying coalitional game. We show that finding the minimal reward that induces an agent to exert effort is at least as hard computationally as finding the Banzhaf power index in the underlying coalitional game, so this problem is #P-hard in general. We also show that in a certain restricted domain, where the underlying coalitional game is a unanimity weighted voting game with certain properties, it is possible to solve all of the above problems in polynomial time.
Using Temporal Context-Specific Independence Information in the Exploratory Analysis of Disease Processes
Authors: Stefan Visscher, Peter Lucas, Ildikó Flesch, Karin Schurink
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

Disease processes in patients are temporal in nature and involve uncertainty. It is necessary to gain insight into these processes when aiming at improving the diagnosis, treatment and prognosis of disease in patients. One way to achieve these aims is by explicitly modelling disease processes; several researchers have advocated the use of dynamic Bayesian networks for this purpose because of the versatility and expressiveness of this time-oriented probabilistic formalism. In the research described in this paper, we investigate the role of context-specific independence information in modelling the evolution of disease. The hypothesis tested was that within similar populations of patients differences in the learnt structure of a dynamic Bayesian network may result, depending on whether or not patients have a particular disease. This is an example of temporal context-specific independence information. We have tested and confirmed this hypothesis using a constraint-based Bayesian network structure learning algorithm which supports incorporating background knowledge into the learning process. Clinical data of mechanically-ventilated ICU patients, some of whom developed ventilator-associated pneumonia, were used for that purpose.
On Validity of Program Transformations in the Java Memory Model
Authors: Jaroslav Ševčík, David Aspinall
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

We analyse the validity of several common program transformations in multi-threaded Java, as defined by the Memory Model section of the Java Language Specification. The main design goal of the Java Memory Model (JMM) was to allow as many optimisations as possible. However, we find that commonly used optimisations, such as common subexpression elimination, can introduce new behaviours and so are invalid for Java. In this paper, we describe several kinds of transformations and explain the problems with a number of counterexamples. More positively, we also examine some valid transformations, and prove their validity. Our study contributes to the understanding of the JMM, and has the practical impact of revealing some cases where the Sun Hotspot JVM does not comply with the Java Memory Model.
Bayesian Model of Recognition on a Finite Set of Events
Authors: Vladimir Berikov, Gennady Lbov
Venue: Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications (2008)

In the paper, we consider the Bayesian model of recognition on a finite set of events. The model is not oriented on the most "unfavorable" distribution and on the asymptotic case. We consider the questions of the model applicability in problems of decision tree construction and rare events recognition.
Multiscale Discontinuous Galerkin Methods for Modeling Flow and Transport in Porous Media
Authors: Shuyu Sun, Jürgen Geiser
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Multiscale discontinuous Galerkin (DG) methods are established to solve flow and transport problems in porous media. The underlying idea is to construct local DG basis functions at the coarse scale that capture the local properties of the differential operator at the fine scale, and then to solve the DG formulation using the newly constructed local basis functions instead of conventional polynomial functions on the coarse scale elements. Numerical examples are provided for demonstrating their effectiveness.
Evolutionary dynamics for designing multi-period auctions
Authors: Tomas Klos, Gerrit Jan van Ahee
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

Mechanism design (MD) has recently become a very popular approach in the design of distributed systems of autonomous agents. A key assumption required for the application of MD is that agents behave rationally in the mechanism or game, since this provides the predictability of agent behavior required for optimal design of the mechanism. In many cases, however, we are confronted with the intractability both of establishing rational equilibrium behavior, as well as of designing optimal mechanisms even if rational agent behavior can be assumed. In this paper, we study both sides of the problem simultaneously by designing and analyzing a 'meta-game' involving both the designer of the mechanism (game, multi-agent system) and the agents interacting in the system. We use coupled replicator dynamics to investigate equilibrium out-comes in this game. In addition, we present an algorithm for determining the expected payoffs required for our analysis, thus sidestepping the need for extensive simulations as in previous work. Our results show the validity of the algorithm, some interesting conclusions about multi-period auction design, and the general feasibility of our approach.
Realistic models for scheduling tasks on network nodes
Authors: Raymond Klefstad
Venue:  (2008)

Parallel distributed computing has been widely studied and utilized to enable grids (or clusters) to meet the increasing demand of computation, especially in the field of scientific computation and modeling. The goal of distributed computing platforms is to provide the necessary infrastructure so that applications and their users can aggregate resources dynamically and shorten the processing time of the applications. With the rapid development of the Internet, the current distributed computing platforms are becoming more complicated. A typical type of modern distributed computing platforms is grid. Because the modern distributed computing platforms may contain numerous computational network nodes, one important challenge is how to schedule the load of tasks to these network nodes efficiently [1]. In addition, the environments of current computational platforms are becoming more complicated due to the availability of high performance network nodes and interconnects. Therefore, more advanced scheduling algorithms should be utilized to handle these problems. It is therefore necessary to create a new generation of schedulers that provides more comprehensive support for addressing the modern distributed computing platform requirements, so that the network nodes can be utilized effectively By analyzing and identifying the limitations of applying conventional scheduler technologies for distributed parallel applications, this dissertation presents a new design and its associated algorithms for enhancing conventional schedulers to provide better performance with considering more realistic factors. This dissertation also presents both mathematical and empirical analysis of three different proposed models. This dissertation provides three contributions to the field of task scheduling in distributed computing. First, current published algorithms are analyzed and weakness are exposed when real-world factors are considered, such as startup-costs, arbitrary processor times. Second, it contributes to the design of the scheduling algorithms by considering more realistic factors, which extend the usages of schedulers. Finally, it presents empirical and analytical results to demonstrate the effectiveness and the advantage of the proposed algorithms. The work in this dissertation has a broader impact beyond the algorithms in which they were developed, as it provides deeper understanding of scheduling tasks in the more realistic models, which will allow us to design more efficient algorithms.
Usable Rules for Context-Sensitive Rewrite Systems
Authors: Raúl Gutiérrez, Salvador Lucas, Xavier Urbain
Venue: Proceedings of the 19th international conference on Rewriting Techniques and Applications (2008)

Recently, the dependency pairs (DP) approach has been generalized to context-sensitive rewriting (CSR). Although the context-sensitive dependency pairs (CS-DP) approach provides a very good basis for proving termination of CSR, the current developments basically correspond to a ten-years-old DP approach. Thus, the task of adapting all recently introduced dependency pairs techniques to get a more powerful approach becomes an important issue. In this direction, usable rules are one of the most interesting and powerful notions. Actually usable rule have been investigated in connection with proofs of innermost termination of CSR. However, the existing results apply to a quite restricted class of systems. In this paper, we introduce a notion of usable rules that can be used in proofs of termination of CSR with arbitrary systems. Our benchmarks show that the performance of the CS-DP approach is much better when such usable rules are considered in proofs of termination of CSR.