ppxscal/embedding_network huggingface dataset:
A selective, just-in-time aspect weaver
Authors: Yoshiki Sato, Shigeru Chiba, Michiaki Tatsubori
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

Dynamic AOP (Aspect-Oriented Programming) is receiving growing interests in both the academia and the industry. Since it allows weaving aspects with a program at runtime, it is useful for rapid prototyping and adaptive software. However, the previous implementations of dynamic AOP systems suffered from serious performance penalties. This paper presents our new efficient dynamic AOP system in Java for addressing the underlying problem. This system called Wool is a hybrid of two approaches. When a new aspect is woven in, the programmers can select to reload into the JVM a modified class file in which hooks for executing advice are statically embedded, or they can insert hooks as breakpoints in the JVM. Since the two approaches have different performance characteristics, the programmers can select the best one for each join point. Our experimental result shows, under a certain circumstance, Wool runs dynamic AOP application about 26% faster than a traditional static code translation approach.
On the Role of Query Refinement in Searching for Information: The Librarian Agent Query Refinement Process
Authors: Nenad Stojanovic
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

In this paper we present an approach for the query refinement called Librarian Agent Query Refinement Process, which simulates the role a human librarian plays in the searching for information resources in a library. The process consists of two phases: Problem Discovery, in which the potential problems (ambiguities) of the initial query are discovered and estimated and Query Refinement, which analyses these ambiguities in order to provide suitable modification of that query that increases the precision and recall of the searching process. The Agent performs comprehensive analyses of a query, based on the structure of the used vocabulary in an information portal and the content of its information repository. Moreover, the information about the previous users' behaviour and the activities of the current user are usedfor making the query refinement process more efficient (i.e. usage-driven and personalized). From the user's point of view, the main advantage of such an approach is that it enables a user to satisfy his information need in a more intuitive and efficient way.
The Intangibility of E-Services: Effects on Artificiality, Perceived Risk, and Adoption
Authors: Mauricio S. Featherman, John D. Wells
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

This research focuses on perceptions and reactions to the intangible nature of newly digitized transaction processing systems. For many consumers, the intangibility of information system-based processes generates beliefs that they are fake, non-genuine, artificial and therefore inherently risky to use. This perceived artificiality phenomenon was shown to increase risk concerns, which in-turn inhibited system adoption. Investigating reactions to an e-service replacement of a paper process enabled testing of this proposed conceptual causal chain. Results suggest that the inherent intangibility of e-services creates concerns measured in raised perceived artificiality and perceived risk. Interestingly, mental rather than physical intangibility increased artificiality concerns. Perceived artificiality directly increased risk concerns and indirectly affected system evaluation and adoption, which were primarily affected by system perceived risk. This exploratory research suggests a research model that provides a first step towards understanding the effect of information systems' inherent intangibility on system evaluation and adoption, and may be utilized when testing risk-reducingsystem enhancements.
Comparing Lectures: Effects of the Technological Context of the Studio
Authors: Yvonne Fritze, Yngve Troye Nordkvelle
Venue: Education and Information Technologies (2003)

This presentation compares how lectures are being performed in different technological contexts: that of the studio, for taping of videotapes, or in front of a camera for the purpose of videoconferencing, or, for a live presentation. The different contexts will be described according to the communication theory of the German sociologist Niklas Luhmann, and contrasted with findings from contemporary research on lecturing and teacher&ndash;student interaction. The comparison between the videotaped lecture and the live lecture reveals important differences as to style of communication. The taped lectures are more stringent and content-oriented, while the live-lectures are time-consuming and more focused on establishing dialogues with students. Videoconference-lecturing contains features that place it between the live- and videotaped lecture. This paper concludes that videoconferencing is problematic with serious problems to handle for students and teachers alike.
The South African online consumer
Authors: Kevin Johnston
Venue: Business strategies for information technology management (2003)

This chapter attempts to develop a profile of online consumers in South Africa. Firstly, a profile of the South African online consumer is developed based on various research sources. The chapter then focuses on what the web consumers in South Africa want, and the challenges facing web developers and organizations developing web sites in South Africa.
On robots swarm dispersion, task scheduling in distributed systems, and web-based short period style analysis
Authors: Joseph S. Mitchell
Venue:  (2002)

In the first section of the dissertation we examine some problems arising in swarm robotics. Swarm robotics is one of the most exciting paradigms in the fields of robotics and artificial intelligence. The goal is to perform relatively complex tasks by employing a large number of small, very simple, autonomous, and inexpensive robots. In this work, we explore the process of dispersing a swarm of robots from an initially densely packed configuration. Several dispersing protocols are proposed and tested in a simulation environment. In the second section of the dissertation we study a problem arising in distributed computing. With the modern advancement of networking and decentralization of computing resources, it has become plausible to perform computationally intensive jobs using a network of distributed machines. We study a &ldquo;work stealing&rdquo; algorithm, called the Enhanced Cilk Scheduler, for task scheduling in distributed systems. We perform simulation experiments comparing our algorithm to an algorithm based on a centrally managed greedy scheduler. Our analysis shows that the Enhanced Cilk Scheduler is a viable distributed system scheduler. In the third section of the dissertation we develop a web-based financial advising tool. We give a web-based style analysis tool together with its core solver, which requires a fast implementation of a constrained quadratic programming algorithm. Style analysis is a very useful technique used in the investment process. It provides insight into the composition of the portfolio with respect to asset classes based solely on returns. The solver is used in the process of finding a custom-tailored investment portfolio, in analyzing the style of a portfolio composed of an unknown set of securities, and in other financial applications. The optimizer, written in the Java programming language, uses a gradient method that is simple yet fast in finding an approximate solution to the problem, up to a specified precision.
Distributed Knowledge by Explanation Networks
Authors: Yvonne Wærn, Robert Ramberg
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

A knowledge based system may be considered as knowledge, distributed between one or several experts and the system users. Explanations in such a system provide for a more intensive interaction between the system and the user. We construct an explanation network by defining relationships between various knowledge fragments. Knowledge fragments on varying levels are formulated using the Qualitative Process Theory. The relationships are defined by links, compatible with Rhetorical Structure Theory. Different knowledge elements are combined into an explanation path by using Toulmin's argumentation theory. The feasibility of this approach is investigated. We show the following: By representing relations in a concepthierarchy as well as representing the relationships between elements in a rule of a knowledge base, both problem solving inferences and explanations can be generated. At the moment, the derivation of explanations cannot be performed automatically, but ready-made explanations may be stored and presented in a useful way. The explanation network idea has great knowledge acquisition power. An empirical study with users showed that different paths within the explanation net are useful for users with different prior knowledge. To conclude, the idea of distributing knowledge by support from an explanation network is fruitful and feasible.
Adoption of enterprise resource planning software by organizations in India: a managerial framework
Authors: Monideepa Tarafdar, Rahul K. Roy
Venue: Managing globally with information technology (2003)

Enterprise Resource Planning (ERP) systems are designed to integrate various functions and processes, and are used by organizations as the first-level transaction processing systems in their information architecture. Although many studies have been conducted and reported on ERP implementation cases in the developed countries, there is not much literature on the experiences of companies in Asia and other parts of the developing world. These organizations confront issues that are significantly different from those faced by companies in the developed world, because of differences in the sophistication of IT use, and cultural and social contexts. This chapter describes a three-stage model for analyzing the deployment of ERP in developing countries, based on an empirical study of ERP implementation exercises in Indian organizations. Each stage describes a specific aspect of the implementation process. The specific characteristics of each stage and their implications for managers have also been discussed.
Network Effects and Software Development -- Implications for Security
Authors: Jari Råman
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

This survey of literature in software economics tries to find explanations for the vulnerabilities left in commercial software products and the lack of security considerations in software and information systems (IS) that are developed from components. An examination of the information economic environment where market-driven software development occurs, which is characterized by network effects and lock-in, suggests that the schedule and the budget constraints on secure software and IS development are outcomes of rational economic behaviour. The consequences for security of first-to-market competition (e.g. shortening development-cycle, release-oriented development, beta testing) and customer lock-in (e.g. into an insecure product) are considered from an economic point of view.
An efficient modification of the primal-dual two paths simplex algorithm
Authors: K. Dosios, K. Paparrizos, N. Samaras, A. Sifaleras
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Linear programming deals with the problem of minimizing or maximizing a linear function in the presence of linear constraints. The popularity of linear programming can be attributed to many factors such as the ability to model large problems, and the ability to solve large problems in a reasonable amount of time. Lots of real world problems can be formulated as linear programs. The explosion in computational power of hardware has made it possible to solve large-scale linear problems in personal computers.
RE containing glasses as effective magneto-optical materials for 200-400 nm range
Authors: A. Potseluyko, I. Edelman, A. Malakhovskii, Y. Yeshurun, T. Zarubina, A. Zamkov, A. Zaitsev
Venue: Microelectronic Engineering (2003)

Magneto-optical Faraday rotation (FR), optical absorption and magnetization of oxide glasses with high concentration of rare earth (RE) ions (up to 25 mol.% of R2O3, R: Pr3+, Dy3+ Eu2-) are investigated. These glasses had a good transparence and high value of Verdet constant simultaneously. They can be considered as materials of high magneto-optical quality in the wavelength range 200-400 nm.
A P2P Groupware System with Decentralized Topology for Supporting Synchronous Collaborations
Authors: Jianhua Ma, Makoto Shizuka, Jeneung Lee, Runhe Huang
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Network based groupware systems are for supportingcollaborations among a group of people who are engagedin a common task or goal using computers connected by avariety of networks including the Internet. A synchronousgroupware system supports group members' collaborativeactivities at the same time. Due to the almost all of currentsynchronous collaborative systems have beenimplemented either using a centralized topology or ahybrid topology, the research presented in this paper hasbeen devoted to investigation, design and implementationof a peer-to-peer (P2P) groupware system, called DSC,using a decentralized topology. As it does not use anyserver at all, peers in a group need to coordinatelymanage their group by themselves, and each peer has tofully handle the correct message passing by itself. TheDSC system is implemented using the JXTA technologyand platform that enable peers to find each other, formgroups and exchange messages across firewalls and NATs.It currently offers three shared objects of web browser, fileviewer and drawing pad as well as a text chat tool. Thesynchronous controls of a shared space, the objects,telepointer and so on are also provided. Its evaluationswith a practical test environment are given in detail.
Evaluating stakeholders' views of delivered IS effectiveness: perceptions versus perceptions and expectations
Authors: Carla Wilkin, Rodney Carr, Bill Hewett
Venue: Technologies & methodologies for evaluating information technology in business (2003)

This chapter contributes to the understanding of evaluation of IS effectiveness. With quality as the focus for such evaluation, this study investigates the use of perceptions versus perceptions and expectations in a measure of effectiveness of delivered information systems. The results suggest there really is not any neat solution to the debate, but that when overt measurement of expectations was concurrent with the measurement of perceptions, a more revealing appraisal of delivered IS quality was provided than when perceptions alone were measured. Moreover, there is real merit in further studies to explore this issue. Given business investment in IT, the need for such work in reflected in the proliferation of research, particularly in relation to the use of the marketing instrument, SERVQUAL, in the field of IT.
On restricted min-wise independence of permutations
Authors: Jiří Matoušek, Miloš Stojaković
Venue: Random Structures Algorithms (2003)

A family of permutations F ⊆ Sn, with a probability distribution on it is called k-restricted rain-wise independent if we have Pr[min π(X) = π(x)] = 1|X| for every subset X ⊆ [n] with |X| ≤ k, every x ∈ X, and π ∈ F chosen at random. We present a simple proof of a result of Norin: every such family has size at least (n-1 k-1/2) . Some features of our method might be of independent interest. The best available upper bound for the size of such family is 1 + σj=2k(J - 1) (n j). We show that this bound is tight if the goal is to imitate not the uniform distribution on Sn, but a distribution given by assigning suitable priorities to the elements of [n] (the stationary distribution of the Tsetlin library, or self-organizing lists). This is analogous to a result of Karloff and Mansour for k-wise independent random variables. We also investigate the cases where the min-wise independence condition is required only for sets X of size exactly k (where we have only an ω(log log n + k) lower bound), or for sets of size k and k - 1 (where we already obtain a lower bound of n - k + 2).
Exploiting Value Locality in Physical Register Files
Authors: Saisanthosh Balakrishnan, Gurindar S. Sohi
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

The physical register file is an important component of adynamically-scheduled processor. Increasing the amount of parallelismplaces increasing demands on the physical register file,calling for alternative file organization and management strategies.This paper considers the use of value locality to optimize theoperation of physical register files.We present empirical data showing that: (i) the value producedby an instruction is often the same as a value produced by anotherrecently executed instruction, resulting in multiple physical registerscontaining the same value, and (ii) the values 0 and 1 accountfor a considerable fraction of the values written to and read fromphysical registers. The paper then presents three schemes to exploitthe above observations.The first scheme extends a previously-proposed scheme to useonly a single physical register for each unique value. The secondscheme is a special case for the values 0 and 1. By restricting optimizationto these values, the second scheme eliminates many of thedrawbacks of the first scheme. The third scheme further improveson the second, resulting in an optimization that reduces physicalregister requirements with simple micro-architectural extensions.A performance evaluation of the three schemes is also presented.
The role of motherhood in the pop art of system programming
Authors: Peter G. Neumann
Venue: Proceedings of the second symposium on Operating systems principles (1969)

Numerous papers and conference talks have recently been devoted to the affirmation or reaffirmation of various common-sense principles of computer program design and implementation, particularly with respect to operating systems and to large subsystems such as language translators. These principles are nevertheless little observed in practice, often to the detriment of the resulting systems. This paper attempts to summarize the most significant principles, to evaluate their applicability in the real world of large multi-access systems, and to assess how they can be used more effectively.
Reduction of torque undulation and extension of the Park's transformation applied to non-sinusoidal saturated synchronous motors
Authors: G. Sturtzer, D. Flieller, J.-P. Louis
Venue: Mathematics and Computers in Simulation (2003)

This paper present the principle of an extended field oriented control. This control strategy follows from an extension of the Park's transformation, suitable for non-sine synchronous motors with salient poles. In particular, we highlight that the structure of the classical field oriented control is kept in the case of non-sine motors provided minor modifications. The presented method allows to regulate constant values in steady state while applying nonsine currents to the motor. The shape of these non-sine currents is predetermined so as to minimise the steady state torque undulation.
Information mining in remote sensing imagery
Authors: Ram M. Narayanan
Venue:  (2003)

The volume of remotely sensed imagery continues to grow at an enormous rate due to the advances in sensor technology, and our capability for collecting and storing images has greatly outpaced our ability to analyze and retrieve information from the images. This motivates us to develop image information mining techniques, which is very much an interdisciplinary endeavor drawing upon expertise in image processing, databases, information retrieval, machine learning, and software design. This dissertation proposes and implements an extensive remote sensing image information mining (ReSIM) system prototype for mining useful information implicitly stored in remote sensing imagery. The system consists of three modules: image processing subsystem, database subsystem, and visualization and graphical user interface (GUI) subsystem. Land cover and land use (LCLU) information corresponding to spectral characteristics is identified by supervised classification based on support vector machines (SVM) with automatic model selection, while textural features that characterize spatial information are extracted using Gabor wavelet coefficients. Within LCLU categories, textural features are clustered using an optimized k-means clustering approach to acquire search efficient space. The clusters are stored in an object-oriented database (OODB) with associated images indexed in an image database (IDB). A k-nearest neighbor search is performed using a query-by-example (QBE) approach. Furthermore, an automatic parametric contour tracing algorithm and an O(n) time piecewise linear polygonal approximation (PLPA) algorithm are developed for shape information mining of interesting objects within the image. A fuzzy object-oriented database based on the fuzzy object-oriented data (FOOD) model is developed to handle the fuzziness and uncertainty. Three specific applications are presented: integrated land cover and texture pattern mining, shape information mining for change detection of lakes, and fuzzy normalized difference vegetation index (NDVI) pattern mining. The study results show the effectiveness of the proposed system prototype and the potentials for other applications in remote sensing.
Energy and rate based MAC protocol for wireless sensor networks
Authors: Rajgopal Kannan, Ram Kalidindi, S. S. Iyengar, Vijay Kumar
Venue: ACM SIGMOD Record (2003)

Sensor networks are typically unattended because of their deployment in hazardous, hostile or remote environments. This makes the problem of conserving energy at individual sensor nodes challenging. S-MAC and PAMAS are two MAC protocols which periodically put nodes (selected at random) to sleep in order to achieve energy savings. Unlike these protocols, we propose an approach in which node duty cycles (i.e sleep and wake schedules) are based on their criticality. A distributed algorithm is used to find sets of winners and losers, who are then assigned appropriate slots in our TDMA based MAC protocol. We introduce the concept of of energy-criticality of a sensor node as a function of energies and traffic rates. Our protocol makes more critical nodes sleep longer, thereby balancing the energy consumption. Simulation results show that the performance of the protocol with increase in traffic load is better than existing protocols with increase in traffic load is better than existing protocols, thereby illustrating the energy balancing nature of the approach.
Multiple model control of a Buck dc/dc converter
Authors: D. Alejo, P. Maussion, J. Faucher
Venue: Mathematics and Computers in Simulation (2003)

This paper describes a new method for algorithms commutation between two linear laws, for the voltage control of a dc/dc converter with variable loads. A multiple model control (MMC) is the generated, based upon the fusion of only two traditional IP controllers outputs. This strategy improves the performances of the step input responses and robustness.