ppxscal/embedding_network huggingface dataset:
Process Ownership Challenges in IT-Enabled Transformation of Interorganizational Business Processes
Authors: Michael Holm Larsen, Ralf Klischewski
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

The paper investigates the challenges of process ownership in business processes crossing organizational boundaries. A literature review explores the research traditions of business process reengineering, inter-organizational systems (IOS), workflow management, and system development with regard to process ownership and the changing role from intra-organizational issues to inter-organizational issues. The result is a list of relevant process owner tasks, classified by different issues in which a shift of focus is suggested.A case study of a governmental process portal serves the purpose of exemplifying the novel process ownership challenges in an inter-organizational context. Analyzing the case form the process ownership perspective reveals that the proposed shift of focus is indeed applicable and how neglecting these new challenges are a barrier for successful transformation.With the categorization and shift of focus suggested in this paper, future research may investigate in more detail the dilemmas of distributed versus centralized ownership and bring out different models of inter-organizational process ownership to support handling the related issues in an integrated way.
Design of Routing-Constrained Low Power Scan Chains
Authors: Y. Bonhomme, P. Girard, L. Guiller, C. Landrault, S. Pravossoudovitch, A. Virazel
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Scan-based architectures, though widely used in modern designs, are expensive in power consumption. Recently, we proposed a technique based on clustering and reordering of scan cells that allows to design low power scan chains [1]. The main feature of this technique is that power consumption during scan testing is minimized while constraints on scan routing are satisfied. In this paper, we propose a new version of this technique. The clustering process has been modified to allow a better distribution of scan cells in each cluster and hence lead tomore important power reductions. Results are provided at the end of the paper to highlight this point and show that scan design constraints (length of scan connections, congestion problems) are still satisfied.
Remarks on the upper bound theorem
Authors: Isabella Novik
Venue: Journal of Combinatorial Theory Series A (2003)

Two new relatives of the Upper Bound Theorem are established. The first is a variant of the Strong Upper Bound Theorem for even-dimensional simplicial spheres. The second is an Upper Bound Theorem for odd-dimensional simplicial manifolds admitting a free involution.
A multi-level distance learning-based course for high-school computer science leading-teachers
Authors: Noa Ragonis, Bruria Haberman
Venue: ACM SIGCSE Bulletin (2003)

In this poster we present a flexible model for a multi-level distance learning-based teacher training. The model was implemented to introduce curricular and pedagogical aspects of teaching logic programming (LP) to high-school computer science in-service leading-teachers.
Finding Buying Guides with a Web Carnivore
Authors: Reiner Kraft, Raymie Stata
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

Research on buying behavior indicates that buying guides perform an important role in the overall buying process. However, while the Web contains many buying guides, finding those guides is difficult to impossible for the average consumer. Web search engines typically index many buying guides on many topics, but simple queries do not often return these results. Given this, we built a Web carnivore that finds buying guides on behalf of consumers. Web carnivores leverage the crawling, scrubbing, indexing and ranking activities of Web searchengines (the "herbivores") to provide more specific services. Ours finds buying guides by issuing machine-generated queries to Google and filtering the results.This paper describes our system and quantitatively compares it to a basic search engine. Our system almost always returns more buying guides, often twice as many. Our user study also suggests that we return better buying guides. Finding buying guides is an instance of the more general problem of "genre search;" this paper points out novel aspects of our system that are applicable to a variety of genre-search problems.
The 'adequate' design of ethnographic outputs for practice: some explorations of the characteristics of design resources
Authors: Tim Diggins, Peter Tolmie
Venue: Personal and Ubiquitous Computing (2003)

The community of `appliance design' rests generally upon a successful use of multidisciplinary user-centred design and often draws on an ethnographic component. Much has been made of the need for a multidisciplinary team and of the difficulties of making good use of ethnographic outputs in such a team. Discussions often centre upon the precise placement of the boundary between ethnography and design and the possibilities of hybridisation of these disciplines. Another way of looking at the issues of multidisciplinary teams is to look at the nature of the representational devices used to encapsulate and aid the communication of the ethnographic work in coherent and useful ways. Taking lessons from existing design practice, we look at how such representational devices actually work and propose some possible features important in the realisation of future best practice.
Maximizing rewards for real-time applications with energy constraints
Authors: Cosmin Rusu, Rami Melhem, Daniel Mossé
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2003)

New technologies have brought about a proliferation of embedded systems, which vary from control systems to sensor networks to personal digital assistants. Many of the portable embedded devices run several applications, which typically have three constraints that need to be addressed: energy, deadline, and reward. However, many of these portable devices do not have powerful enough CPUs and batteries to run all applications within their deadlines. An optimal scheme would allow the device to run the most applications, each using the most amount of CPU cycles possible, without depleting the energy source while still meeting all deadlines. In this paper we propose a solution to this problem; to our knowledge, this is the first solution that combines the three constraints mentioned above. We devise two algorithms, an optimal algorithm for homogeneous applications (with respect to power consumption) and a heuristic iterative algorithm that can also accommodate heterogeneous applications (i.e., those with different power consumption functions). We show by simulation that our iterative algorithm is fast and within 1&percnt; of the optimal.
Bayesian approach to sensor-based context awareness
Authors: Panu Korpipää, Miika Koskinen, Johannes Peltola, Satu-Marja Mäkelä, Tapio Seppänen
Venue: Personal and Ubiquitous Computing (2003)

AbstractThe usability of a mobile device and services can be enhanced by context awareness. The aim of this experiment was to expand the set of generally recognizable constituents of context concerning personal mobile device usage. Naive Bayesian networks were applied to classify the contexts of a mobile device user in her normal daily activities. The distinguishing feature of this experiment in comparison to earlier context recognition research is the use of a naive Bayes framework, and an extensive set of audio features derived partly from the algorithms of the upcoming MPEG-7 standard. The classification was based mainly on audio features measured in a home scenario. The classification results indicate that with a resolution of one second in segments of 5&ndash;30 seconds, situations can be extracted fairly well, but most of the contexts are likely to be valid only in a restricted scenario. Naive Bayes framework is feasible for context recognition. In real world conditions, the recognition accuracy using leave-one-out cross validation was 87% of true positives and 95% of true negatives, averaged over nine eight-minute scenarios containing 17 segments of different lengths and nine different contexts. Respectively, the reference accuracies measured by testing with training data were 88% and 95%, suggesting that the model was capable of covering the variability introduced in the data on purpose. Reference recognition accuracy in controlled conditions was 96% and 100%, respectively. However, from the applicability viewpoint, generalization remains a problem, as from a wider perspective almost any feature may refer to many possible real world situations.
Defining configuring
Authors: David C. Brown
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

This paper is intended to serve as part of the context in which the other papers in this special issue should be read. Its main goal is to revisit the basic definition of the configuration task, on which many people depend, to show some of its flaws, and to point out how it shapes thinking about the problem. We are concerned about characterizing the reasoning processes used to produce a configuration.
Scaling of parasitics and delay times in the backend-of-line
Authors: G. Schindler, W. Steinhögl, G. Steinlesberger, M. Traving, M. Engelhardt
Venue: Microelectronic Engineering (2003)

The role of interconnects in determining the delay times of future generation integrated circuits has been studied. Two scenarios were investigated; one using ITRS values for dielectric permeability and conductor resistivity, and an alternative taking into account size effects on the resistivity and using more conservative values for k. To develop a concise model of the delays, the contributions of the individual parasitic elements and their evolution for future generations were investigated for the different scenarios. The calculations of the delays show a dramatic increase for small feature sizes. The predictions of the two models differ significantly especially for long wires, with the conservative model showing much longer delay times. These results make the introduction of a hierarchical metallization seem even more important.
Who is afraid of spiders?: two perceptive computer games for children
Authors: Johanna Höysniemi, Perttu Hämäläinen
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

In this paper, we present two game tasks (flying game and spider game) in QuiQui's Giant Bounce, a computer game based on computer vision and hearing technology. The game consists of several game tasks with different themes of movement. The tasks presented here have been designed and tested with children [2] and experts in the fields of children's physical, social and cognitive development.
On Maximum Current Estimation in CMOS Digital Circuits
Authors: Dainius Ciuplys, Per Larsson-Edefors
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

We show the importance of accounting for supply currentson the quiet power terminal when analyzing impactof peak currents on power distribution network. Thequiet power terminal is defined for any signal transitionin the CMOS inverter as the contact point oppositeto the (dis)charging terminal. We investigate the currentdynamics on these supposedly quiet contact points,and describe their dependencies on output load and inputtransition times. We furthermore propose triangularmodel representations for the quiet terminal currentand its slope; the latter necessary to enable L·dI/dt prediction.
Satisfiability-Based Algorithms for Boolean Optimization
Authors: Vasco M. Manquinho, João P. Marques-Silva
Venue: Annals of Mathematics and Artificial Intelligence (2004)

This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Computer Science and Engineering. In Artificial Intelligence, BCP can be used for computing minimum-size prime implicants of Boolean functions, of interest in Automated Reasoning and Non-Monotonic Reasoning. Moreover, Binate Covering is an essential modeling tool in Electronic Design Automation. The objectives of the paper are to briefly review branch-and-bound algorithms for BCP, to describe how to apply backtrack search pruning techniques from the Boolean Satisfiability (SAT) domain to BCP, and to illustrate how to strengthen those pruning techniques by exploiting the actual formulation of BCP. Experimental results, obtained on representative instances indicate that the proposed techniques provide significant performance gains for a large number of problem instances.
Attribute based compiler implemented using visitor pattern
Authors: Norman Neff
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

In our compiler course for undergraduate students, we use a class of attribute grammars to specify type information, target code, and other properties calculated for the source program. In the design of the compiler, a modification of the visitor design pattern allows us to transparently compute the attributes. Within our framework, implementation is straightforward; the emphasis of the course shifts to theory and specification. In several offerings of the course, students have implemented parts of a highly modular compiler for a small, statically typed object oriented language.
Fault-based test generation for cause-effect graphs
Authors: Kuo-Chung Tai, Amit Paradkar, Hsun-Kang Su, Mladen A. Vouk
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

The notion of cause-effect graphs (CEGs) has been used for the specification and test generation of a software system. In this paper, we present a fault-based approach to test generation for CEGs, called BOR (boolean operator) testing, which is based on the detection of boolean operator faults. We show how to generate a minimum BOR test set for a CEG and how to evaluate an existing test set for a CEG in order to determine whether additional tests are necessary for BOR testing. We have applied BOR testing to a CEG that specifies a real-time boiler control and monitoring system. The results of our empirical studies indicate that CEG-based BOR testing is very practical and effective.
Attack of the killer virus!
Authors: Dennis Fowler
Venue: netWorker (2003)

Though more than 600 million people worldwide use the Internet, it takes only one virus writer to make just about all of us miserable. Like a single stray neutron in a critical mass of plutonium, a lone virus can trigger a chain reaction that spews thousands of copies from desktop to desktop. Last summer's aptly named SoBig virus was an all-too-real example of this danger. "At [SoBig.F's] peak, one out of 17 e-mails that we were processing was a copy of the&hellip;virus," says Josh White of U.S.-based e-mail security group MessageLabs. "Certainly we haven't seen numbers like this before." At that time AOL scanned 40.5 million e-mails and found SoBig.F in half of them. In fact, SoBig accounted for 98 percent of all viruses then circulating---all this from a single virus-writing miscreant. How can we possibly hope to stop the inevitable legions of similarly determined troublemakers? Better get used to it: There are no easy solutions to the virus problem.
Successful Practices in Customer Relationship Management
Authors: Rainer Alt, Thomas Puschmann
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Many companies have initiated projects to improve on customer orientation and plan the implementation of customer relationship management (CRM) systems. Among the desired benefits are increased customer satisfaction and retention by providing personalized products and value added services. Although the potentials of CRM are obvious only a few successful CRM implementations are known in practice. This article describes the results of a cross-industry benchmarking project in which 120 companies participated. The results show that there is no unique' CRM project and that successful implementations are rarely technical projects. From the research six critical success factors for CRM projects emerged: stepwise evolution, straightforward implementation and long-term project, organizational redesign, integrated system architecture of standard components, change management, and top management support. The six successful practice companies show examples of how these critical success factors are applied.
Directed diffusion: an application-specific and data-centric communication paradigm for wireless sensor networks
Authors: Deborah Estrin, Ramesh Govindan, John Heidemann
Venue:  (2002)

Advances in radio, sensor, and VLSI technology will enable small and inexpensive sensor nodes capable of wireless communication and significant computation. Large-scale networks of such sensors may require novel data dissemination paradigms which are scalable, robust, and energy-efficient. In this dissertation, we design and evaluate directed diffusion, one such paradigm for distributed sensing applications in wireless sensor networks. Directed diffusion incorporates attribute-based naming, reinforcement-based adaptation, data-centric routing, and application-specific processing inside the network (e.g., data aggregation). By using attributes with external meaning at the lowest levels of communication, diffusion avoids multiple levels of name binding common to other approaches. Attribute-based naming in turn enables in-network processing with filters, supporting data aggregation, nested queries, and similar techniques that are critical to reducing network traffic and conserving energy. Given that, in wireless sensor networks, the communication cost is several orders of magnitude higher than the computation cost, directed diffusion can achieve significant energy savings with in-network data aggregation. We evaluate the energy efficiency of directed diffusion analytically and experimentally. We also propose two instantiations of directed diffusion with different aggregation schemes: opportunistic aggregation and greedy aggregation. In the former approach, data is opportunistically aggregated at intermediate nodes on a low-latency tree. Our evaluation indicates that the opportunistic approach can achieve significant energy savings and can outperform idealized traditional schemes even with relatively unoptimized path selection. In the greedy approach, a greedy incremental tree is constructed to improve path sharing for more energy savings. Our result suggests that although greedy aggregation and opportunistic aggregation are roughly equivalent in low-density and medium-density networks, greedy aggregation can achieve significant energy savings in high-density networks without adversely impacting latency or robustness.
The instrumentation of multics
Authors: Jerome H. Saltzer, John W. Gintell
Venue: Proceedings of the second symposium on Operating systems principles (1969)

This paper reports an array of measuring tools devised to aid in the implementation of a prototype computer utility. These tools include special hardware clocks and data channels, general purpose programmed probing and recording tools, and specialized measurement facilities. Some particular measurements of interest in a system which combines demand paging with multi-programming are described in detail. Where appropriate, insight into effectiveness (or lack thereof) of individual tools is provided.
Real live cases in training management of information resources during the transition to market economy
Authors: Dimitar Christozov
Venue: Current issues in IT education (2003)

In this chapter, the use of real live cases, based on students' experience, in training for the Information Resources Management (IRM) course is discussed. IRM is a core-required course of a MIS MBA program. This approach is compared with one that explores cases drawn from textbooks. The objective of comparison is student's learning outcome. Two groups of students, trained under the two paradigms, were selected, and their performances, after graduation, were compared. The students play key roles in their companies. Assessment shows that in given circumstances (transition from centrally planning to market-oriented economy, small enterprises, and underdeveloped information infrastructure), the use or real live cases offered by the students allows training to be kept relevant to the business practices.
Active rules and active databases: concepts and applications
Authors: Juan M. Ale, Mauricio Minuto Espil
Venue: Effective databases for text & document management (2003)

This chapter surveys the topic of active rules and active databases. We analyze the state of the art of active databases and active rules, their properties and applications. In particular, we describe the case of triggers following the SQL-1999 Standard Committee point of view. Then, we consider the case of dynamic constraints for which we use a temporal logic formalism. Finally, we discuss the applicability, limitations and partial solutions found when attempting to ensure the satisfaction of dynamic constraints.
Mixing and chemical reacting flow simulations inside square cavities
Authors: A. L. de Bortoli
Venue: Applied Numerical Mathematics (2003)

The aim of this work is the numerical solution of laminar flows inside a square cavity caused by temperature increase due to a chemical reaction. The model approximates the overall, single step, binary, irreversible reaction between two species, resulting in a third, which is taken to be a process of first order with respect to each of the reactants, where the specific reaction rate is controlled by temperature-dependent Arrhenius kinetics. The simulations are performed using the finite differences explicit Runge-Kutta three-stage scheme for second order time and space approximations. Consistent results, for reactant and product concentration fields, as well as for temperature of reaction, are obtained, showing that the model is able to follow nonlinear behavior of the mixing and reaction progress, for Schmidt and Prandtl numbers of order 1, Zel'dovich 5, Damköhler 300 and heat release parameter ranging from 300 to 1000, which are values for high temperature gaseous hydrocarbon chemistry. Besides, it is worth pointing out that these results build on earlier ones, which were obtained from thin-layer model approximations.
Heterogeneous design idioms for software architecture
Authors: Mary Shaw
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

Software designers use a variety of structural patterns to specify system architectures. These patterns, or idioms, are currently used informally and imprecisely. Nevertheless, they provide a useful, broadly shared vocabulary. In practice, a given design often relies on several patterns. This paper reviews some common architectural idioms, shows several ways in which they are used heterogeneously, and discusses the benefits of making these idioms and their combinations more explicit and precise.
Supporting mobility and negotiation in agent-based e-commerce
Authors: Ryszard Kowalczyk, Leila Alem
Venue: Managing e-commerce and mobile computing technologies (2003)

This chapter presents recent advances in agent-based e-commerce, addressing the issues of mobility and negotiation. It reports on selected research efforts, focusing on developing intelligent agents for automating the e-commerce negotiation and coalition formation processes and mobile agents for supporting deployment of intelligent e-commerce agents and enabling mobile e-commerce applications. Issues such as trade-off between decision-making in negotiation and mobility capabilities of the agents are also discussed in this paper.