ppxscal/embedding_network huggingface dataset:
User centred design in public sector systems
Authors: Tom Stewart, Brian Sheckel, Jonathan Earthy, Catriona Campbell
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

The ISO standard on Human Centred Design (ISO 13407) was developed to ensure design processes have a high likelihood of developing usable systmes. Panel to review human-centred design in the UK public sector and in other countries.
On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
Authors: Thomas F. Coleman, Andrew R. Conn
Venue:  (1982)

In this paper we propose a new local quasi-Newton method to solve the equality constrained non-linear programming problem. The pivotal feature of the algorithm is that a projection of the Hessian of the Lagrangian is approximated by a sequence of symmetric positive definitive matrices. The matrix approximation is updated at every iteration by a projected version of the DFP or BFGS formula. We establish that the method is locally convergent and the sequence of x-values converges to the solution at a 2-step Q-superlinear rate.
High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks
Authors: J. C. R. Bennett, D. C. Stephens, Hui Zhang
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

The fluid generalized processor sharing (GPS) algorithm has desirable properties for integrated services networks and many packet fair queueing (PFQ) algorithms have been proposed to approximate GPS. However, there have been few high speed implementations of PFQ algorithms that can support large number of sessions with diverse rate requirements and at the same time maintain all the important properties of GPS. The implementation cost of a PFQ algorithm is determined by two components: (1) computation of the system virtual time function and (2) maintaining the relative ordering of the packets via their timestamps in a priority queue mechanism. While most of the recently proposed PFQ algorithms reduce the complexity of computing the system virtual time function, the complexity of maintaining the priority queue, and therefore the overall complexity of implementing PFQ, is still a function of the number of active sessions. In addition, while reducing the algorithmic or asymptotic complexity has been the focus of most analysis, to run at high speed, it is also important to reduce the complexity of basic operations. In this paper, we develop techniques to reduce both types of complexities. In particular, we present a novel grouping architecture for implementing PFQ with an algorithmic complexity that is a function of the number of distinct rates supported, but independent of the number of sessions in the system.
Experimental Analysis of the Cognitive Processes of Program Maintainers during Software Maintenance
Authors: Kazuhiko Iio, Tsuneo Furuyama, Yoshio Arai
Venue: Proceedings of the International Conference on Software Maintenance (1997)

The proposed method for determining how "maintainers" develop an understanding of programs that need to be changed is designed to reflect actual maintenance work and to be objective. Use of this method to investigate the strategies used by experts and novices to develop such an understanding showed that: (1) both novices and experts tend to study the same modules; (2) experts study other modules related to the target module much more than novices do; and (3) experts look at many more modules during a given time period than novices do. Analysis of the changes in a maintainer's strategy showed that both novices and experts start by browsing the whole program to develop an understanding of its function and structure. They then shift their attention to the target module to develop a detailed understanding of it. In the final stage, both experts and novices again browse the overall program to check their understanding.
Multiresolutional homogenization technique in transient heat transfer for unidirectional composites
Authors: M. Kamiński
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The paper is devoted to theoretical and computational studies on application of the wavelet-based homogenization approach in the Finite Element Method modeling of transient heat transfer in unidirectionally heterogeneous media. Multiresolutional homogenization scheme is proposed for 1D heat transfer problem of periodic heterogeneous medium with heat conductivity coefficient and volumetric heat capacity defined by some elementary wavelet functions and compared with other methods - spatial averaging and asymptotic homogenization approach. Symbolic computational comparative studies for various homogenization methods are performed and extended on the parameter sensitivity studies related to the interface location and the contrast between heat conductivity coefficients of composite components. The results of symbolic homogenization are used in the Finite Element analysis of the original and homogenized two-component composite. Theoretical and computational analysis shows that effective parameters obtained from wavelet-based homogenization method are significantly different from those obtained using classical techniques; multiresolutional approach introduces significantly greater restrictions on original functions defining material properties of the analyzed heterogeneous medium.
Query Optimization to Meet Performance Targets for Wide Area Applications
Authors: Vladimir Zadorozhny, Louiqa Raschid
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Recent technology advances have enabled mediated query processing with Internet accessible WebSources. A characteristic of WebSources is that their access costs exhibittransient behavior. These costs depend on the network and server workloads, which are often affected by the time of day, day, etc. Given transient behavior, an appropriate performance target (PT) for a noisy environment will correspond to "at least X percentage of queries will have a latency of less than T units of time". In this paper, we propose an optimizer strategy that is sensitive to the objective of meeting such performance targets (PT). For each query plan, a PT sensitive optimizer uses both the expected value of the cost distribution of the plan, as well as the expected delay of the plan. We validate our strategy using a simulation based study of the optimizer's behavior. We also experimentally validate the optimizer using traces of access costs for real WebSources.
All-to-all personalized communication on multistage interconnection networks
Authors: Annalisa Massini
Venue: Discrete Applied Mathematics (2003)

In parallel/distributed computing systems, the all-to-all personalized communication (or complete exchange) is required in numerous applications of parallel processing. In this paper, we consider this problem for logN stage Multistage Interconnection Networks (MINs). It is proved that the set of admissible permutations for a MIN can be partitioned in Latin Squares. Since routing permutations belonging to a Latin Square provides the all-to-all personalized communication, a method to realize the complete exchange with time complexity O(N), that is optimal, can be derived. This method, compared with other ones in literature, does not necessitate of neither pre-computation nor memory allocation to record the Latin Square, because an explicit construction of it is not required; furthermore it is applicable to any logN stage multistage networks since it is independent of the topology.
Co-Evolution in Negotiation Games
Authors: Yukikazu Murakami, Hiroshi Sato, Akira Namatame
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

In this paper, we focus on the mechanism of co-evolution in the negotiation situations.We formulate negotiation situations as hawk-dove games.It is an interesting question toanswer how the society gropes its way towards equilibrium in an imperfect world whenself-interested agents learn each other in order to improve the rules of interaction.It isknown the mixed strategy will result in equilibrium in hawk-dove games, and both hawksand doves coexist.In this paper, we consider evolutionary dynamics with local matchingand investigate the role of the mutual learning.We show that all agents gradually learn to behave as doves, which result in social efficiency.
Peculiarity Oriented Multidatabase Mining
Authors: Ning Zhong, Yiyu (Y. Y. ) Yao
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

Peculiarity rules are a new class of rules which can be discovered by searching relevance among a relatively small number of peculiar data. Peculiarity oriented mining in multiple data sources is different from, and complementary to, existing approaches for discovering new, surprising, and interesting patterns hidden in data. A theoretical framework for peculiarity oriented mining is presented. Within the proposed framework, we give a formal interpretation and comparison of three classes of rules, namely, association rules, exception rules, and peculiarity rules, as well as describe how to mine interesting peculiarity rules in multiple databases.
A rectangular finite element for plane elasticity with in-plane rotation
Authors: A. I. Mousa, S. M. Tayeh
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

In the present paper the strain based approach is applied to development of a new rectangular finite element for the general plane elasticity. This rectangular finite element has three degrees of freedom (Two general external degrees of freedom and the in-plane rotation) at each of the four corner nodes. This element is based on linear variations of all the three components of strain. The new element is referred to as SBREIRThis element is used to obtain solutions to two dimensional elasticity problems where the contribution of the shear stress on deformation can be significant. The performance of the element is investigated by applying it to two well-known plane elasticity problems, a cantilever beam loaded at the free end and a simply supported beam loaded by a point load at the midpoint. Convergence curves are plotted for vertical deflection at the points of application of load as well as for bending stress at points at the upper tension fibre and shearing stress at internal points in each problem.It is found that the solutions obtained using this element are satisfactory for results of deflection, bending stress and the shearing stress even when only a small number of elements is used in the finite element solution.
Integrating Petri Nets With Design Methods for Concurrent and Real-Time Systems
Authors: Robert G. Pettit,  IV, Hassan Gomaa
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

This paper describes on-going efforts to integrate Petri nets with software design methods for concurrent and real-time systems. Specifically, this paper presents an approach for integrating colored Petri nets with the Ada-based Design Approach for Real-Time Systems (ADARTS) and its sister method, CODARTS (Concurrent Design Approach for Real-Time Systems). The introduction describes why we are interested in the integration of Petri nets with design methods for concurrent and real-time systems. Following the introduction are brief overviews of the ADARTS and CODARTS methods and the Petri net model used in this paper. Finally, the approach to modeling ADARTS and CODARTS artifacts with Petri nets is described and conclusions are presented that describe the results of this study, some unsolved problems, and future research directions.
Copyright Enforcement or Censorship: New Uses for the DMCA?
Authors: Michael Lesk
Venue: IEEE Security and Privacy (2003)

Section 512 of the Digital Millennium Copyright Act (DMCA) has a provision that protects ISPs from liability for transmitting copyright violations as long as they have and follow a process for removing infringements when notified of them. The author examines a case in which the Church of Scientology forced Google to remove references to certain Web pages at a site in Norway on the basis of a claimed copyright violation.
Multi-view memory to support OS locking for transaction systems
Authors: P. Bodorik, D. N. Jutla
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

The focus of this paper is to investigate the use of the multi-view memory (MVM) model and its supporting architecture in providing efficient locking services for transaction processing systems. The model provides for enforcement of access control protocols through FSM specification on units of data that can vary in size from one region of memory to another. Threads executing transactions do not explicitly request locks on data items-they simply access the data items while locking is performed automatically and in many instances without software intervention. This is facilitated by hardware assistance in that the FSM definitions and lock unit state information is stored in caches. Only when a thread is suspended are the state changes communicated to the software lock manager. Delays for lock acquisitions through the MVM model architecture are determined and compared to delays due to lock acquisition by a conventional lock manager.
An analysis of database rules
Authors: J. Debenham
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

Maintaining the integrity of the knowledge represented within database rules is a complex business. In order to analyse the maintenance of integrity, a uniform framework for the representation of both data and database rules is introduced. A conceptual model is constructed using this uniform framework. The maintenance of the integrity of this conceptual model is analysed. In particular a generalised form of normalisation enables both the data and the database rules to be engineered so that they are maintainable in a technical sense. Database integrity is also protected by a comprehensive range of constraints including knowledge constraints.
Epic and ARM -- user''s guide --
Authors: H. R. Walters
Venue:  (1997)

We give a brief introduction to Epic and to ARM (they are discussed in more detail elsewhere). We show how to use the Epic compiler and how to execute ARM code. Then we describe ARM''s API (application programmer''s interface) which allows ARM to be used as a plug-in library. We describe how to access external functions from ARM and how to add external data types.
Formal Treatment of a Family of Fixed-Point Problems on Graphs by CafeOBJ
Authors: Tetsuo Tamai
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

A family of well known problems on graphs including the shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We specify this problem and its solution algorithm in a highly abstract manner, fully exploiting the parameterized module construct of CafeOBJ, an algebraic specification language. The objective of our research is to explore effectiveness of formal methods applying them not just to safety critical specific programs but also to general problems covering wide range of applications.
Rapid prototyping for wireless designs: the five-ones approach
Authors: Markus Rupp, Andreas Burg, Eric Beck
Venue: Signal Processing (2003)

In a highly innovative market, wireless systems nowadays undergo very short production cycles. Due to these tough timing constraints, the time-consuming process of prototyping is often neglected, jeopardizing the entire product becoming successful. Heavy application of automatic tools can allow for rapid prototyping overcoming this unfortunate situation and de-risking the product challenge. However, the application of automatic tools alone does not speed up the prototyping process sufficiently. By reflecting on current design processes, several paradigms for faster prototyping are concluded, named the Five-Ones Approach: One team, One environment, One code, One documentation and One code revision tool. Based on such a Five-Ones Approach, a consistent prototyping environment to implement a prototyping design from first idea to final implementation is presented in this paper. In particular, the design of a prototype for a MIMO system with four transmit and four receive antennas, based on the current UMTS FDD downlink standard is reported.
A Conversation with Mario Mazzola
Venue: Queue (2003)

To peek into the future of networking, you don’t need a crystal ball. You just need a bit of time with Mario Mazzola, chief development officer at Cisco. Mazzola lives on the bleeding edge of networking technology, so his present is very likely to be our future. He agreed to sit down with Queue to share some of his visions of the future and the implications he anticipates for software developers working with such rapidly evolving technologies as wireless networking, network security, and network scalability.
Performance Evaluation of Main Memory Database Systems
Authors: Dina Bitton, Carolyn Turbyfill
Venue:  (1986)

In this paper we present the results of a comprehensive benchmark of the relational Main Memory Database System (MMDBS), that is the foundation of the interactive office system. Office-By-Example (OBE). Based on this case study, we identify issues that must be considered in the design and implementation of MMDBS''s. We determine relevant performance metrics and describe techniques for benchmarking MMDBS''s.
On Agent-Mediated Electronic Commerce
Authors: Minghua He, Nicholas R. Jennings, Ho-Fung Leung
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

This paper surveys and analyzes the state of the art of agent-mediated electronic commerce (e-commerce), concentrating particularly on the business-to-consumer (B2C) and business-to-business (B2B) aspects. From the consumer buying behavior perspective, agents are being used in the following activities: need identification, product brokering, buyer coalition formation, merchant brokering, and negotiation. The roles of agents in B2B e-commerce are discussed through the business-to-business transaction model that identifies agents as being employed in partnership formation, brokering, and negotiation. Having identified the roles for agents in B2C and B2B e-commerce, some of the key underpinning technologies of this vision are highlighted. Finally, we conclude by discussing the future directions and potential impediments to the wide-scale adoption of agent-mediated e-commerce.
A Survey of Hand Posture and Gesture Recognition Techniques and Technology
Authors: Joseph J. LaViola,  Jr.
Venue:  (1999)

This paper surveys the use of hand postures and gestures as a mechanism for interaction with computers, describing both the various techniques for performing accurate recognition and the technological aspects inherent to posture- and gesture-based interaction. First, the technological requirements and limitations for using hand postures and gestures are described by discussing both glove-based and vision-based recognition systems along with advantages and disadvantages of each. Second, the various types of techniques used in recognizing hand postures and gestures are compared and contrasted. Third, the applications that have used hand posture and gesture interfaces are examined. The survey concludes with a summary and a discussion of future research directions.
Study on Essential Characteristics of RITS
Authors: Jia Limin, Jiang Qiuhua
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

Many Challenges have been faced by the traditional china railway transportation including macro-aspects and micro-aspects such as high-speed, high density, complex social requirements and so on. With the help of fully utilization and/or deploitation of the informationtechnologies, railway intelligent transportation system is proposed as a new generation of the railway transportation system. In this paper, the essential characteristics of RITS are discussed which include: openness of architecture/structure, distributability of system structure and intelligent attributes and/or behavior of system. It can be concluded that integration system paradigm methodology will play a critical role in the course of RITS research.
21 Dog Years: Doing Time @ Amazon.com
Authors: Mike Daisey
Venue:  (2002)

:Boy meets dot-com, boy falls for dot-com, boy flees dot-com in horror. So goes one of the most perversely hilarious love stories you will ever read, one that blends tech culture, hero worship, cat litter, Albanian economics, venture capitalism, and free bagels into a surreal cocktail of delusion. In 1998, when Amazon.com went to temp agencies to recruit people, they gave them a simple directive: send us your freaks. Mike Daisey  slacker, onetime aesthetics major, dilettante  seemed perfect for the job. His ascension from lowly temp to customer service representative to business development hustler over the course of twenty-one dog years is the stuff of both dreams and nightmares. With lunatic precision, Daisey describes the lightless cube farms in which book orders were scrawled on Post-its while technicians struggled to bring computers back online; the fourteen-hour days fueled by caffeine, fanaticism, and illicit day-trading from office desks made from doors; his strange compulsion to send free books to Norwegians; and the fevered insistence of BizDev higher-ups that the perfect business partner was Pets.com  the now-extinct company that spent all its assets on a sock puppet. In these pages, you'll meet Warren, the cowboy of customer service, capable of verbally hog-tying even the most abusive customer; Amazon employee #5, a reclusive computer gamer worth a cool $300 million, who spends at least six hours a day locked in his office killing goblins; and Jean-Michele, Mike's girlfriend and sparring partner, who tries to keep him grounded, even as dot-com mania seduces them both. At strategic intervals, the narrative is punctuated by hysterically honest letters to CEO Jeff Bezos  missives that seem ripped from the collective unconscious of dot-com disciples the world over. 21 Dog Years is an epic story of greed, self-deception, and heartbreak, a wickedly funny anthem to an era of bounteous stock options and boundless insanity. 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
Variable Selection Heuristics and Optimum Decision Trees -- An Experimental Study
Authors: Masahiro Miyakawa, Nobuyuki Otsu, Ivo G. Rosenberg
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

Given a decision table it is often the case to find among its trees one tree with the minimum, or at least small, number of the nodes of the tree. It is known that a DP based algorithm works to obtain an optimal tree requiring O(3L) computation (comparisons). On the other hand a top-down method based on a variable selection method (VSM) choosing a variable at each node according to some simple heuristic can be devised to obtain near optimum trees requiring less computation. In this paper we briefly review 3 such heuristics TA, TH and TD motivated by the three different standpoints (among them one based on discriminant analysis is new and their behaviors.All the heuristics require at most O (L 22 L) operations with O (L2L storage, where L is the number of variables of the input table.