ppxscal/embedding_network huggingface dataset:
Efficient Java exception handling in just-in-time compilation
Authors: SeungIl Lee, Byung-Sun Yang, Soo-Mook Moon
Venue: Software&mdash;Practice Experience (2004)

Java uses exceptions to provide elegant error handling capabilities during program execution. However, the presence of exception handlers complicates the job of the just-in-time &lpar;JIT&rpar; compiler, while exceptions are rarely used in most programs. This paper describes two techniques for reducing such complications. First, we delay the translation of an exception handler until the exception really occurs. This on-demand translation of exception handlers allows more optimizations when translating the main flow, without being hindered by constraints caused by the exception flows. Secondly, for those exceptions that are actually thrown during program execution we insert exception-type check code and a direct branch to the translated exception handlers. This exception handler prediction is motivated by an observation that frequently thrown exceptions are likely to be handled by the same exception handlers, so this will eliminate the exception processing overhead of the Java virtual machine. Our experiments indicate that the code quality of the main flow is no longer affected by the presence of exception handlers. Also, frequently thrown exceptions can be efficiently handled by the exception handler prediction. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Digital Chips for an On-Line Casino
Authors: J. Castella-Roca, G. Navarro, J. A. Ortega-Ruiz, J. Garcia
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Unlike in traditional environments, e-gambling players must make a beforehand payment to start a game. Most online casinos currently solve this problem using prepayment systems where the on-line casino has absolute control over all the transactions among the players. However, this solution poses a great number of problems because of the necessary trust relation between players and the on-line casino managers. To reduce this strong trust relationship with the on-line casino, we propose in this paper the use of a reliable digital chips system, which provides auditing facilities, and can be trusted by external parties. Digital chips, just like physical ones, will be used for players instead of legal course money. A set of cryptographic protocols will protect the different actions that players can perform using these digital chips.
Programmers Are People, too
Authors: Ken Arnold
Venue: Queue (2005)

I would like to start out this article with an odd, yet surprisingly uncontroversial assertion, which is this: programmers are human. I wish to use this as a premise to explore how to improve the programmer&rsquo;s lot. So, please, no matter your opinion on the subject, grant me this assumption for the sake of argument.
Grid-Based Simulation of Industrial Thin-Film Production
Authors: V. V. Krzhizhanovskaya, P. M.A. Sloot, Yu. E. Gorbachev
Venue: Simulation (2005)

In this article, the authors introduce a Grid-based virtual reactor, a High Level Architecture (HLA)- supported problem-solving environment that allows for detailed numerical study of industrial thin-film production in plasma-enhanced chemical vapor deposition (PECVD) reactors. They briefly describe the physics and chemistry underpinning the deposition process, the numerical approach to simulate these processes on advanced computer architectures, and the associated software environment supporting computational experiments. The authors built an efficient problem-solving environment for scientists studying PECVD processes and end users working in the chemical industry and validated the resulting virtual reactor against real experiments.
Autonomous collaborative web agents
Authors: David Byer, Colin Depradine
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

With the amount of information on the Internet growing at a rapid rate, users are finding it increasingly difficult to locate relevant data in a timely and effortless fashion. All too often, search engines provide large amounts of information that do not meet the user's needs. As a result, important data can be missed as the user tries to narrow the search and hence reduce the number of successful hits. This paper describes the Personal Internet Interface (PII) system, which simplifies the process by using a preemptive approach to searching. The system consists of a set of cooperative agents that monitor the user's Internet browsing behaviour. This monitoring provides the search attributes that will enable PII to seek out the relevant information on its own.
Hardening Web browsers against man-in-the-middle and eavesdropping attacks
Authors: Haidong Xia, José Carlos Brustoloni
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

Existing Web browsers handle security errors in a manner that often confuses users. In particular, when a user visits a secure site whose certificate the browser cannot verify, the browser typically allows the user to view and install the certificate and connect to the site despite the verification failure. However, few users understand the risk of man-in-the-middle attacks and the principles behind certificate-based authentication. We propose context-sensitive certificate verification (CSCV), whereby the browser interrogates the user about the context in which a certificate verification error occurs. Considering the context, the browser then guides the user in handling and possibly overcoming the security error. We also propose specific password warnings (SPW) when users are about to send passwords in a form vulnerable to eavesdropping. We performed user studies to evaluate CSCV and SPW. Our results suggest that CSCV and SPW can greatly improve Web browsing security and are easy to use even without training. Moreover, CSCV had greater impact than did staged security training.
Planar Vanishing Points Based Camera Calibration
Authors: Ying Liu, Yuanxin Wu, Meiping Wu, Xiaoping Hu
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

An easy and high accurate camera calibration technique using the planar vanishing points is proposed in the paper. According to the geometrical properties of the vanishing points and the square planar model, two constraints between vanishing points and the focal lengths can be found, from which a closed-form solution to focal lengths can be computed. At last, a nonlinear optimization technique is used to refine the parameters. Both computer simulation and real data are used to test the proposed technique.
InteGrade object-oriented Grid middleware leveraging the idle computing power of desktop machines: Research Articles
Authors: Andrei Goldchleger, Fabio Kon, Alfredo Goldman, Marcelo Finger, Germano Capistrano Bezerra
Venue: Concurrency and Computation: Practice Experience (2004)

Grid computing technology improves the computing experiences at organizations by effectively integrating distributed computing resources. However, just a small fraction of currently available Grid infrastructures focuses on reutilization of existing commodity computing resources. This paper introduces InteGrade, a novel object-oriented middleware Grid infrastructure that focuses on leveraging the idle computing power of shared desktop machines. Its features include support for a wide range of parallel applications and mechanisms to assure that the owners of shared resources do not perceive any loss in the quality of service. A prototype implementation is under construction and the current version is available for download. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Learning on opponent's preferences to make effective multi-issue negotiation trade-offs
Authors: Robert M. Coehoorn, Nicholas R. Jennings
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Software agents that autonomously act and interact to achieve their design objectives are increasingly being developed for a range of e-commerce applications. In this context, automated negotiation is a central concern since it is the de facto means of establishing contracts for goods or services between the agents. Now, in many cases these contracts consist of multiple issues (e.g. price, time of delivery, quantity, quality) which makes the negotiation more complex than when dealing with just price. In particular, effective and efficient multi-issue negotiation requires an agent to have some indication of its opponent's preferences over these issues. However, in competitive domains, such as e-commerce, an agent will not reveal this information and so the best that can be achieved is to learn some approximation of it through the negotiation exchanges. To this end, we explore and evaluate the use of kernel density estimation for this purpose. Specifically, we couch our work in the context of making negotiation trade-offs and show how our approach can make the negotiation outcome more efficient for both participants.
Reasoning About Competitive Reactions: Evidence from Executives
Authors: David B. Montgomery, Marian Chapman Moore, Joel E. Urbany
Venue: Marketing Science (2005)

Much of the empirical research on competitive reactions describes how or why rivals react to a firm's past actions, but stops short of examining whether managers attempt topredict such reactions, which we call strategic competitive reasoning. In three exploratory studies, we find evidence of managers' thinking about competitors' past and future behavior, but little incidence of strategic competitive reasoning. Competitive intelligence experts and other experienced managers' assessment of the results suggests that the relatively low incidence of strategic competitor reasoning is due to perceptions of low returns from anticipating competitor reactions more than to the high cost of doing so. Both the difficulty of obtaining competitive information and the uncertainty associated with predicting competitor behavior contribute to these perceptions. The paper suggests both a need for research on competitive behavior and an opportunity to influence and improve managerial judgment and decision making.
Autocorrelation and fourier analysis for detecting periodic cell potentials in a simulated inhibitory neural network
Authors: Robert R. Rohrkemper
Venue: Journal of Computing Sciences in Colleges (2004)

The field of Computational Neuroscience is best described as a mathematical approach to the study of neural systems, reducing them to a set of computational tasks. Computer models are an important part of this analysis for their insight into the phenomenon. In order to begin a meaningful study, one has to find a pattern that exists throughout the brain. Experimental studies have shown that isolated neurons can be naturally periodic - repeating almost "clock-like". However, due to inter-neuron interactions, signals from cells in networks are neither perfectly periodic nor completely random. The goal of my analysis was to characterize periodic behavior of inhibitory neurons. 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
High Performance Storage System Scalability: Architecture, Implementation and Experience
Authors: Richard W. Watson
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

The High Performance Storage System (HPSS) provides scalable hierarchical storage management (HSM), archive, and file system services. Its design, implementation and current dominant use are focused on HSM and archive services. It is also a general-purpose, global, shared, parallel file system, potentially useful in other application domains. When HPSS design and implementation began over a decade ago, scientific computing power and storage capabilities at a site, such as a DOE national laboratory, was measured in a few 10s of gigaops, data archived in HSMs in a few 10s of terabytes at most, data throughput rates to an HSM in a few megabytes/s, and daily throughput with the HSM in a few gigabytes/day. At that time, the DOE national laboratories and IBM HPSS design team recognized that we were headed for a data storage explosion driven by computing power rising to teraops/petaops requiring data stored in HSMs to rise to petabytes and beyond, data transfer rates with the HSM to rise to gigabytes/s and higher, and daily throughput with a HSM in 10s of terabytes/day. This paper discusses HPSS architectural, implementation and deployment experiences that contributed to its success in meeting the above orders of magnitude scaling targets. We also discuss areas that need additional attention as we continue significant scaling into the future.
Enter the Protectionist Dragon? China's software and standards policies stir debate and reflection
Authors: Greg Goth, Benjamin Alfonsi
Venue: IEEE Software (2005)

Enter the Protectionist Dragon? China's software and standards policies stir debate and reflection Greg Goth To encourage the domestic software industry's development, Chinese policy makers have written a series of regulations in the past five years. These give Chinese software developers tax incentives and mandate that government buyers give preference to domestic software. These regulations also encourage the development of open source software over proprietary software. These policies have precipitated concern and criticism from China's trading partners. At the heart of the debate lie two perceptions of how to achieve market equilibrium. The rules of the game are changing fast, and the entrenched bureaucratic way of running the Chinese economy is butting against the imperatives of the global marketplace.The Software Drain: Outdated Software Costs Companies Millions Benjamin Alfonsi While it might sound like an IT urban legend, the "software drain" is a very real phenomenon according to a recent report by the Business Performance Management Forum. The report is based on a survey of 226 US-based IT professionals and C-level executives (CEOs, CFOs, CIOs, CTOs) conducted in the third quarter of 2004. Respondents ranged from small and mid-market businesses to global corporations; about a quarter were companies with revenues of US$500 million or more.Among the findings, seventy percent of the respondents reported having redundant or outmoded software applications, and 73 percent said they have no mechanism in place to combat the problem. Of these, 44 percent estimate that such applications consume more than a tenth of their company's IT budget.
Computational geometric representation of x-ray diffraction (XRD) data
Authors: Yunpeng Li
Venue: Journal of Computing Sciences in Colleges (2005)

Analysis and classification of geologic data, such as classification of soil samples by mineral content, is an important area in modern geoscience research. Recent results from the field of computational geometry, namely the development of efficient high dimensional data structures, provide promising tools for this analysis. This project explores how 1300-dimensional data from x-ray diffraction patterns of soil samples could be parameterized and stored as points in high-dimensional space. Goals are threefold: to test the accuracy of the analysis based on samples of known composition, to explore ways of lowering the dimensionality to increase efficiency, and to provide a prototype that could be applied to numerous other problems in scientific classification.
Social networks for creative collaboration
Authors: Tracy Cohen, Ben Clemens
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

The Authors are colleagues within the User Experience Discipline at Avenue A | Razorfish, a services consulting firm that designs user centered applications and solutions for business and consumer brands.The User Experience discipline employs approximately 50 interface designers, information architects and experience designers across the United States. A social networking application has been developed in-house to promote creative collaboration within the organization. The organizational problem we were solving for was a need to create greater visibility in to the work of each information designer as well as the opportunity to support smarter collaboration and drive innovation within the organization.
A Learning-Based Tracking for Diving Motions
Authors: Yuan Xiong, Yi Zhang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

A learning-based tracking algorithm for diving motions is presented in this paper. In this algorithm, a complex diving motion is considered as the combination of several simple sub-motions. The contour of the athlete in each sub-motion is represented by B-spline snake, which can be fitted to the real body contour by a recursive curve-fitting algorithm. By learning from the videos in a training set, the initial contour templates for each sub-motion are set up and each possible frame where a new sub-motion begins is found out, which make possible the continuity of the whole motion tracking. Experiments demonstrate that the proposed algorithm is robust and efficient in diving motions tracking.
Multiple strategies detection in ontology mapping
Authors: Jie Tang, Yong Liang, Zi Li
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Ontology mapping is the task of finding semantic relationships between entities (i.e. concept, attribute and relation) of two ontologies. In the existing literatures, many (semi-)automatic approaches have found considerable interest by combining several mapping strategies (namely multi-strategy mapping). However, experiments show that multi-strategy based mapping does not always outperform its single-strategy counterpart. We here mainly consider the following questions: For a new, unseen mapping task, should one use a multi-strategy or a single-strategy? And if the task is suitable for multi-strategy, then which strategies should be selected in the combined scenario? This paper proposes an approach of multiple strategies detection for ontology mapping. The results obtained so far show that multi-strategy detection improves both on precision and recall significantly.
Access cost for asynchronous Byzantine quorum systems
Authors: Rida A. Bazzi
Venue: Distributed Computing (2001)

Quorum systems have been used to implement many coordination problems in distributed systems. In this paper, we study the cost of accessing quorums in asynchronous systems. We formally define the asynchronous access cost of quorum systems and argue that the asynchronous access cost and not the size of a quorum is the right measure of message complexity of protocols using quorums in asynchronous systems. We show that previous quorum systems proposed in the literature have a very high asynchronous access cost. We propose a reformulation of the definition of Byzantine quorum systems that captures the requirement for nonblocking access to quorums in asynchronous systems. We present new Byzantine quorum systems with low asynchronous access cost whose other performance parameters match those of the best Byzantine quorum systems proposed in the literature. In particular, we present a construction for the disjoint failure pattern that outperforms previously proposed systems for that pattern.
Fragmented Patching: New VOD Technique That Supports Client Mobility
Authors: Katsuhiko Sato, Michiaki Katsumoto, Tetsuya Miki
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

This paper presents a new form of video on-demand called ýFragmented Patchingý, which enables clients to move around freely even while receiving video. Patching techniques, which greatly reduce the required network bandwidth through multicasting, have potential for on-demand video distribution. However, patch-flow techniques based on unicast data are unsuitable for providing services to mobile clients because of the intricate process required for relatively short unicast flows to individually follow a moving client. In fragmented patching, however, patch flows are sent via broadcasting. In addition, to avoid increasing traffic due to broadcasting, the patch flows are broken down into segments, each of which is aggregated to be shared with as many multiple clients as possible. We compared the two techniques by using mathematical models, which present the average usage of link bandwidth with the traffic intensity (Erlang), and numerical analysis revealed the aggregation effect by segmenting patch flows countervails the increase in traffic caused by broadcasting patch flows.
A Fast Color Correction Method Based on Image Analysis
Authors: Feng Li, Jian Song, Yongzhao Zhan
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

The colors in a digital image depend not only on the surface properties of the objects present in the scene depicted, but also on the lighting conditions and the characteristics of the capturing device. And the estimation of scene colorimetric from raw data is still an open issue, especially for digital images that have been acquired by digital image-capturing devices in unknown conditions. A color correction method is developed and tested in this paper. In order to increase the running speed of color correction, we introduce a simple statistical analysis to detect the color distorts. And an approach for recognizing the dominant color objects based on block-features and region-features is present for improving the accuracy and reliability. All functions are run in the decorrelated color space. The results of many experiments show that it can get a better performance than other existing methods.
Efficient rendering of multiblock curvilinear grids with complex boundaries: Research Articles
Authors: Jinho Lee, Lance C. Burton, Raghu Machiraju, Donna S. Reese
Venue: Computer Animation and Virtual Worlds (2005)

Domain decomposition is a popular technique for solving large computational problems that require data to be divided into smaller sub-domains. The exact manner of decomposition depends on the computational needs of the algorithm and often introduces irregular boundaries. Each subdomain forms a block of a larger grid and can be solved or rendered separately by different processing nodes. Rendering of each sub-domain can result in images which are then composited in a back-to-front or front-to-back manner. This scenario is useful when visualization is used concurrently with the simulation. However, the irregularity of boundaries may prohibit the correct image composition due to a visibility anomaly between the sub-domains. In this paper, we present an algorithm based on object-space partitioning to resolve this problem. To accelerate the partitioning process, two techniques are introduced. First, an image-space partition representation is employed for fast assignment of data points to correct partitions. Secondly, a k-d tree is used to subdivide the view-space adaptively according to the complexity of the surface. This view-space partition provides a trade-off between performance and accuracy of the rendered image. Large gains in performance can be achieved with only small losses of accuracy. Two examples of curvilinear grids of different complexity are used to demonstrate the effectiveness of this scheme. Copyright &copy; 2005 John Wiley & Sons, Ltd.