ppxscal/embedding_network huggingface dataset:
Finite element mesh generation for planar and shell type structures (abstract)
Authors: James C. Cavendish, James A. Wixom
Venue: ACM SIGNUM Newsletter (1975)

In many cases, the overriding difficulty associated with finite element analyses of complex structures is the generation of error-free finite element meshes. In view of this situation, a number of mesh generation schemes for planar (e.g., [1], [2]) and shell (e.g., [3], [4]) structures have recently been proposed (see [5] for an extensive bibliography). At one extreme are the fully automatic methods in which the computer is used to determine regions of high and low element densities and then create a finite element mesh accordingly. At the other extreme are methods which require the analyst to completely define the element mesh, while the mesh generating algorithm itself performs only minor clerical tasks such as checking for consistency and error detection. While the fully automatic methods tend to be somewhat inflexible and frequently time consuming to implement, the simplest schemes fail to relieve the user of enough of the tedium accompanying manual decomposition of the structure. We feel that the two semi-automatic mesh generation approaches described in this paper offer a good compromise between the two extremes in mesh generation:(i) A semi-automatic mesh generation algorithm capable of generating meshes of triangular elements for the decomposition of any multiply connected, polygonal, planar region. Once the user has described the boundary of the region and supplied any necessary element density input information, the algorithm automatically positions nodes within the region and assembles triangular elements from these nodes.(ii) An interactive method which permits finite element modeling of three-dimenslonal shell structures on a graphic console. The salient features of this approach involve mathematical surfacing techniques which allow a shell to be represented as a mathematically deformed rectangular domain.
Towards commercial mobile ad hoc network applications: a radio dispatch system
Authors: Elgan Huang, Wenjun Hu, Jon Crowcroft, Ian Wassell
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

We propose a novel and plausibly realistic application scenario for mobile ad hoc networks in the form of a radio dispatch system. We evaluate the system from both financial and technical perspectives to gain a complete picture of its feasibility. Using a realistic mobility and propagation model drawn from real world data we investigate the effects of node density, connection times and traffic congestion on the network coverage. We discuss design considerations in the light of the results. These findings are not limited to this particular scenario but are applicable to any mobile ad hoc system operating in similar conditions.
Constructing a system for finger-position determination and tablature generation for playing melodies on guitars
Authors: Masanobu Miura, Isao Hirota, Nobuhiko Hama, Masazo Yanagida
Venue: Systems and Computers in Japan (2004)

This paper describes the determination of optimal finger position for guitar performance for melodies. In general, when performing a given melody with a guitar, several finger positions are possible, and when beginners are playing, often it is difficult to determine a fingering position. In this paper, the authors propose a method to determine finger positions that minimize the burden on performance and remove a burden on novice guitar players, and then describe &ldquo;S2T,&rdquo; a system which outputs these results as tablature. The authors then confirm based on the results of a performance evaluation of S2T that it requires less burden than commercially available systems. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(6): 10&ndash;19, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10609
Alternative employment arrangements contribute to organizational citizenship and innovative work, or not: information technology professional's psychological contract will tell
Authors: Sandra K. Newton, Stephen C. Wingreen, J. Ellis Blanton
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

Management of information technology (IT) human capital is more dynamic and diverse today as organizations use a variety and mixture of employment arrangements to gain IT core competency, cost, and productivity improvements, yet it is not well known how the employment arrangements affect the IT professional. Applying the psychological contract framework and social information processing theory in the investigation into the IT professional's psychological contract and the affects of their employment arrangement will bring improved understanding of their subsequent attitudes and behaviors. This study will obtain cross-sectional data from IT professionals, which is especially relevant as alternative employment strategies continue to be the trend. Goals toward organizational effectiveness can be implemented through the use of varied employment arrangements; however, ensuring the goals succeed requires new understanding of how the varied employment arrangements affect the psychological contracts of IT professionals. The anticipated findings will provide human resource managers the knowledge necessary to implement strategies toward improved psychological contracts to facilitate continued organizational citizenship and innovative work. This study extends current research on alternative employment arrangements by considering the important factors, such as psychological contracts, organizational citizenship behavior and innovative work behavior in the context of IT professionals.
Pedestrian evacuation simulation
Authors: Angel Castro
Venue: Journal of Computing Sciences in Colleges (2005)

With the recent 9--11 catastrophe many questions arose about the WTC's building evacuation procedures. Later it was revealed that elevator malfunctions and poorly planned alternate exit routes had contributed to high number of losses of life on that day. The Stationhouse fire in Warwick, RI, in 2003, also provoked the rise of interest in evacuation studies after video footage confirmed that the lack of safety exits and poor placement and marking of the existing ones had cost the lives of dozens of Rhode-Islanders. These and other incidents, like the Chicago Nightclub Fire, have made corporations such as the Ryan Center and T. F. Green Airport decide to research pedestrian evacuation in hazardous and non-hazardous scenarios in the hope of developing safer and more effective evacuation routes for existing building, and safer buildings in the future.
DEAS 2005: workshop on the design and evolution of autonomic application software
Authors: David Garlan, John Mylopoulos, Marin Litoiu, Dennis B. Smith, Hausi A. Müller, Kenny Wong
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Understanding software engineering issues for autonomic computing systems is critical for the software and information technology sectors, which are continually challenged to reduce the complexity of their systems. To be autonomic, a system must know itself as well as its boundaries and its environment, configure and reconfigure itself, continually optimize itself, recover or heal from malfunction, protect itself, and function in a heterogeneous world-while keeping its complexity hidden from the user. The goal of this workshop is to bring together researchers and practitioners, who investigate concepts, methodologies, techniques, technologies, and tools to design and evolve autonomic software.
Improving the accuracy of cell-based positioning for wireless networks
Authors: Rong-Hong Jan, Hung-Chi Chu, Yi-Fang Lee
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2004)

One fundamental issue for location-based services and applications is solving the location-sensing problem, i.e., determining where a given node is physically located in a network. In a previous paper, we have presented a location-sensing method, called the cell-based positioning method, and its positioning accuracy for the wireless networks with a hexagonal structure and mesh structure. Unfortunately, in real situations, a wireless network may not have a hexagonal or mesh structure. Thus, in this paper we consider networks with irregular structures and present an algorithm to determine the positioning accuracy of the cell-based method in such networks. In addition, we use the simulated annealing (SA) method to determine the locations and transmission ranges of base stations in order to achieve the best possible positioning accuracy. Simulation results show that the accuracy can be improved up to 30% by the SA method. The results are useful for deploying a wireless network for location-based applications.
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints
Authors: T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno, M. Yagiura
Venue: Transportation Science (2005)

We propose local search algorithms for the vehicle routing problem with soft time-window constraints. The time-window constraint for each customer is treated as a penalty function, which is very general in the sense that it can be nonconvex and discontinuous as long as it is piecewise linear. In our algorithm, we use local search to assign customers to vehicles and to find orders of customers for vehicles to visit. Our algorithm employs an advanced neighborhood, called the cyclic-exchange neighborhood, in addition to standard neighborhoods for the vehicle routing problem. After fixing the order of customers for a vehicle to visit, we must determine the optimal start times of processing at customers so that the total penalty is minimized. We show that this problem can be efficiently solved by using dynamic programming, which is then incorporated in our algorithm. We report computational results for various benchmark instances of the vehicle routing problem. The generality of time-window constraints allows us to handle a wide variety of scheduling problems. As an example, we mention in this paper an application to a production scheduling problem with inventory cost, and report computational results for real-world instances.
Impedance Control of Flexible Robot Arms with Parametric Uncertainties
Authors: Zhao-Hui Jiang
Venue: Journal of Intelligent and Robotic Systems (2005)

This paper presents an adaptive impedance control strategy for flexible manipulators by using an end-effector trajectory control approach. The impedance control objective is converted into tracking a trajectory generated by a designed ideal impedance model. A manifold is designed to prescribe desirable performance of the system. An adaptive control scheme is derived in such that the motion of the system will converge and remain to the ideal manifold for the case of parametric uncertainties. Stability of the control system is analyzed. Simulations are carried out to demonstrate the effectiveness of the proposed control method.
Specification of Discrete Event Models for Fire Spreading
Authors: Alexandre Muzy, Eric Innocenti, Antoine Aiello, Jean-François Santucci, Gabriel Wainer
Venue: Simulation (2005)

The fire-spreading phenomenon is highly complex, and existing mathematical models of fire are so complex themselves that any possibility of analytical solution is precluded. Instead, there has been some success when studying fire spread by means of simulation. However, precise and reliable mathematical models are still under development. They require extensive computing resources, being adequate to run in batch mode but making it difficult to meet real-time deadlines. As fire scientists need to learn about the problem domain through experimentation, simulation software needs to be easily modified. The authors used different discrete event modeling techniques to deal with these problems. They have qualitatively compared the Discrete Event System Specification (DEVS) and Cell-DEVS simulation results against controlled laboratory experiments, which allowed them to validate both simulation models of fire spread. They were able to show how these techniques can improve the definition of fire models.
Is It Time for Clockless Chips?
Authors: David Geer
Venue: Computer (2005)

Vendors are revisiting an old concept--the clockless chip--as they look for new processorapproaches to work with the growing number of cellular phones, PDAs, and other high performance, battery-powered devices.
Composite event queries for reactivity on the web
Authors: James Bailey, François Bry, Paula-Lavinia Pätrânjan
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Reactivity on the Web is an emerging issue. The capability to automatically react to events (such as updates to Web resources) is essential for both Web services and Semantic Web systems. Such systems need to have the capability to detect and react to complex, real life situations. This presentation gives flavours of the high-level language XChange, for programming reactive behaviour on the Web.
BlossomTree: Evaluating XPaths in FLWOR Expressions
Authors: Ning Zhang, Shishir K. Agrawal, M. Tamer Ozsu
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Efficient evaluation of path expressions has been studied extensively. However, evaluating more complex FLWOR expressions that contain multiple path expressions has not been well studied. In this paper, we propose a novel pattern matching approach, called BlossomTree, to evaluate a FLWOR expression that contains correlated path expressions. BlossomTree is a formalism to capture the semantics of the path expressions and their correlations. We propose a general algebraic framework (abstract data types and logical operators) to evaluate BlossomTreepattern matching that facilitates efficient evaluation and experimentation. We design efficient data structures and algorithms to implement the abstract data types and logical operators. Our experimental studies demonstrate that the BlossomTreeapproach can generate highly efficient query plans in different environments.
CONSISTENCY VERSUS MNEMONICS IN TEXT EDITOR COMMAND SETS
Authors: Adrienne Y. Lee, Peter W. Foltz, Peter G. Poison
Venue: ACM SIGCHI Bulletin (1991)

This experiment studies the acquisition and retention of text editor command sets. Previous research has focused on consistent, mnemonic sets versus inconsistent, non-mnemonic sets (Lee Polson, 1988; Walker Olson, 1988). Although results from these studies indicate that consistent, mnemonic sets are better than inconsistent, non-mnemonic sets, it is unclear whether consistency or mnemonics was the basis for better subject performance. This study sought to separate this confound. In order to do this, an condition in addition to those used in the Walker and Olson study was used in which the commands were consistent but non-mnemonic.
A Comparative Study of Game Theoretic and Evolutionary Models of Bargaining for Software Agents
Authors: Shaheen S. Fatima, Michael Wooldridge, Nicholas R. Jennings
Venue: Artificial Intelligence Review (2005)

Most of the existing work in the study of bargaining behavior uses techniques from game theory. Game theoretic models for bargaining assume that players are perfectly rational and that this rationality is common knowledge. However, the perfect rationality assumption does not hold for real-life bargaining scenarios with humans as players, since results from experimental economics show that humans find their way to the best strategy through trial and error, and not typically by means of rational deliberation. Such players are said to be boundedly rational. In playing a game against an opponent with bounded rationality, the most effective strategy of a player is not the equilibrium strategy but the one that is the best reply to the opponent's strategy. The evolutionary model provides a means for studying the bargaining behaviour of boundedly rational players. This paper provides a comprehensive comparison of the game theoretic and evolutionary approaches to bargaining by examining their assumptions, goals, and limitations. We then study the implications of these differences from the perspective of the software agent developer.
Review of "Return on Software by Steve Tockey"; Addison Wesley, 2005
Authors: Mordechai Ben-Menachem
Venue: ACM SIGSOFT Software Engineering Notes (2005)

This book examines the issues concerning our investments in software systems and software-rich, embedded systems. As far as I can tell, every aspect of this difficult subject seems to have been covered. It is, I believe, the first time that such a book has appeared. Prof. Boehm's book is not only quite old by now; it examined economic aspects of systems from a totally different viewpoint and with different aims. A book on the economics of software has been needed for quite a long time. All analysts look at the economic aspects of what they propose to do -- if they don't they are certainly not professional; they are wasteful amateurs. However, it is unfortunately rare for this to be done well as very few technical analysts have the basic economic training to do so.
Network-Centric Buffer Cache Organization
Authors: Gang Peng, Srikant Sharma, Tzi-cker Chiueh
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

A pass-through server such as an NFS server backed by an iSCSI[1] storage server only passes data between the storage server and NFS clients. Ideally it should require at most one data copying operation on sending or receiving, as in normal IP routers. In practice, pass-through servers actually incur multiple data copying operations because they are implemented using a layered architecture where each layer has its own internal data representation. This paper describes the design, implementation and evaluation of a novel network-centric buffer caching scheme called NCache that minimizes data copying overhead in pass-through servers without requiring significant changes to their existing implementation. By organizing the data being passed or cached in a network friendly format, NCache is able to eliminate all unnecessary data copying. The key innovation in NCache is that it exploits the fact that pass-through servers do not interpret data, by replacing physical copying with logical copying in a way transparent to existing software. This transparency enables NCache to be easily portable to many operating systems. We have successfully built a Linux-based NCache prototype that can be applied to in-kernel NFS and static Web servers. Empirical performance measurements collected from this prototype show that by reducing the CPU load associated with data copying, NCache is able to provide up to 92% improvement in throughput for NFS server and up to 47% for Web server.
Review of "Complexity of Sequential and Parallel Numerical Algorithms by J. F. Traub"
Authors: Ellis Horowitz
Venue: ACM SIGNUM Newsletter (1974)

The following table of contents perhaps best describes this book which includes texts of invited papers given at a Symposium at Carnegie-Mellon on May 16-18, 1973.
Robust feature extraction method based on run-length compensation for degraded character recognition
Authors: Minoru Mori, Minako Sawaki, Norihiro Hagita, Hiroshi Murase, Naoki Mukawa
Venue: Systems and Computers in Japan (2004)

Conventional features are robust for recognizing either deformed or degraded characters. Most conventional character recognition methods address either one or the other. This paper proposes a feature extraction method that is robust for both of them. Run-length compensation is introduced for approximately extracting directional run-lengths of strokes from degraded handwritten characters. This technique is applied to the conventional feature vector based on directional run-lengths. Experiments for handwritten characters with additive or subtractive noise show that the proposed feature is superior to conventional ones over a wide range of the degree of noise. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(9): 1&ndash;9, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10643
Generalized Green's Functions and the Effective Domain of Influence
Authors: Donald Estep, Michael Holst, Mats Larson
Venue: SIAM Journal on Scientific Computing (2005)

One well-known approach to a posteriori analysis of finite element solutions of elliptic problems estimates the error in a quantity of interest in terms of residuals and a generalized Green's function. The generalized Green's function solves the adjoint problem with data related to a quantity of interest and measures the effects of stability, including any decay of influence characteristic of elliptic problems. We show that consideration of the generalized Green's function can be used to improve the efficiency of the solution process when the goal is to compute multiple quantities of interest and/or to compute quantities of interest that involve globally supported information such as average values and norms. In the latter case, we introduce a solution decomposition in which we solve a set of problems involving localized information and then recover the desired information by combining the local solutions. By treating each computation of a quantity of interest independently, the maximum number of elements required to achieve the desired accuracy can be decreased significantly.
Designing Scalable FPGA-Based Reduction Circuits Using Pipelined Floating-Point Cores
Authors: Ling Zhuo, Gerald R. Morris, Viktor K. Prasanna
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

The use of pipelined floating-point arithmetic cores to create high-performance FPGA-based computational kernels has introduced a new class of problems that do not exist when using single-cycle arithmetic cores. In particular, the data hazards associated with pipelined floating-point reduction circuits can limit the scalability or severely reduce the performance of an otherwise high-performance computational kernel. The inability to efficiently execute the reduction in hardware coupled with memory bandwidth issues may even negate the performance gains derived from hardware acceleration of the kernel. In this paper we introduce a method for developing scalable floating-point reduction circuits that run in optimal time while requiring only ¿(lg (n)) space and a single pipelined floating-point unit. Using a Xilinx Virtex-II Pro as the target device, we implement reference instances of our reduction method and present the FPGA design statistics supporting our scalability claims.
Fast interval-valued statistical interconnect modeling and reduction
Authors: James D. Ma, Rob A. Rutenbar
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

Correlated interval representations of range uncertainty offer an attractive solution for approximating computations on statistical quantities. The key idea is to use finite intervals to approximate the essential mass of a pdf as it moves through numerical operators; the resulting compact interval-valued solution can be easily interpreted as a statistical distribution and efficiently sampled. This paper describes improved interval-valued algorithms for AWE/PRIMA model order reduction for tree-structured interconnect with correlated $RLC$ parameter variations. By moving to a faster interval-valued linear solver based on path-tracing ideas, and making more optimal trade-offs between interval- and scalar-valued computations, we can extract delay statistics roughly 10X faster than a classical Monte Carlo simulation loop, with accuracy to within 5%.