ppxscal/embedding_network huggingface dataset:
Development and evaluation of symbolic model checker based on approximation for real-time systems
Authors: Satoshi Yamane, Kazuhiro Nakamura
Venue: Systems and Computers in Japan (2004)

In this paper, the authors describe symbolic model checking for real-time systems based on approximation. It is important to determine how to reduce the increase in verification cost due to timed-state processing during symbolic model checking of a real-time system. Verification techniques that use a set of approximate states instead of exact timed states in a reachability analysis of a real-time system have been proposed to increase the effect in reducing the verification cost. Therefore, the authors propose a symbolic model checking technique for real-time systems that uses a set of approximate states. The verification algorithm calculates the set of approximate states by performing fixpoint calculations based on an approximation corresponding to a computation tree logic (CTL) formula. The authors implemented the proposed algorithm and compared it with existing real-time symbolic model checkers. They obtained results showing that the proposed technique is effective for verifying a large-scale system that includes many clock variables. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(10): 83&ndash;101, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10565
A Computer Vision System for Monitoring Medication Intake
Authors: David Batz, Michael Batz, Niels da Vitoria Lobo, Mubarak Shah
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

We propose a computer vision system to assist a human user in the monitoring of their medication habits. This task must be accomplished without the knowledge of any pill locations, as they are too small to track with a static camera, and are usually occluded. At the core of this process is a mixture of low-level, high-level, and heuristic techniques such as skin segmentation, face detection, template matching, and a novel approach to hand localization and occlusion handling. We discuss the approach taken towards this goal, along with the results of our testing phase.
Complex 3D Shape Recovery Using a Dual-Space Approach
Authors: Chen Liang, Kwan-Yee K. Wong
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

This paper presents a novel method for reconstructing complex 3D objects with unknown topology using silhouettes extracted from image sequences. This method exploits the duality principle governing surface points and their corresponding tangent planes, and enables a direct estimation of points on the contour generators. A major problem in other related works concerns with the search for a tangent basis at singularities in the dual tangent space. This problem is addressed here by utilizing the epipolar parameterization for identifying a well-defined basis at each point, and thus avoids any form of search. For the degenerate cases where epipolar parameterization breaks up, a faston-the-fly validation is performed for each computed surface point, which consequently leads to a significant improvement in robustness. As the resulting contour generator points are not suitable for direct triangulation, a topologically correct surface extracting method based on slicing plane is presented. Both experiments on synthetic and real world data show that the proposed method has comparable robustness as those existing volumetric methods regarding surface of complex topology, whilst producing more accurate estimation of surface points.
An Experimental Investigation of the Impact of Information on Competitive Decision Making
Authors: Charles Abramson, Imran S. Currim, Rakesh Sarin
Venue: Management Science (2005)

Managers often employ market response models as decision aids and historical information of competitors' market outcomes to aid their competitive decisions in oligopolistic settings. However, little is known about how access to a decision aid or the availability of competitors' market outcomes impact a firm's competitive decisions (e.g., prices) or market outcomes resulting from those decisions (e.g., profits), or how managers make these decisions across such informational conditions. Hence, the objective of this paper is twofold. First, we investigate whether access to a decision aid and historical information of competitors' outcomes yields more- or less-competitive decisions and outcomes. Second, we determine which learning constructs, such as choice reinforcement and beliefs about projected profits, best explain competitive actions across various information conditions. We find that relative to the availability of competitive information, access to a decision aid has a larger effect on lowering prices and profits. We also find that in two-firm markets, price competition is even more intense than in five-firm markets. Similarly, the availability of market share information leads to more aggressive pricing even when profits are held constant. Finally, we outline the implications of our findings in making managerial resource allocations to market research endeavors.
Generic Design Space Exploration for Reconfigurable Architectures
Authors: Lilian Bossuet, Guy Gogniat, Jean-Luc Philippe
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

We propose in this paper an original design space exploration method for reconfigurable architectures adapted to fine and coarse grain resources. The exploration flow deals with communication hierarchical distribution and processing resources use rate for the architecture under exploration. With this information, designer can explore the architectural design space to define a power-efficient architecture. Exploration results for image computing and cryptography applications are provided to demonstrate the efficiency of the method.
Coverage testing of Java programs and components
Authors: A. M. R. Vincenzi, J. C. Maldonado, W. E. Wong, M. E. Delamaro
Venue: Science of Computer Programming (2005)

Although software testing is a crucial activity in the software development process, only recently have more sound and consistent testing tools become available for testing Java programs and their components. These tools support mostly functional and control-flow based structural criteria. In this paper we explore control-flow and data-flow based coverage criteria to support the testing of Java programs and/or components. We also describe a testing tool, named JaBUTi, which can be used by both the component developer and the component user to test Java-based components and/or systems. To achieve this goal, the tool works at the bytecode level such that no source code is required during the testing activity. We illustrate these ideas and concepts with an example extracted from the literature.
Java Puzzlers: Traps, Pitfalls, and Corner Cases
Authors: Joshua Bloch, Neal Gafter
Venue:  (2005)

"Every programming language has its quirks. This lively book reveals oddities of the Java programming language through entertaining and thought-provoking programming puzzles."--Guy Steele, Sun Fellow and coauthor of The Java™ Language Specification"I laughed, I cried, I threw up (my hands in admiration)."--Tim Peierls, president, Prior Artisans LLC, and member of the JSR 166 Expert GroupHow well do you really know Java? Are you a code sleuth? Have you ever spent days chasing a bug caused by a trap or pitfall in Java or its libraries? Do you like brainteasers? Then this is the book for you!In the tradition of Effective Java™, Bloch and Gafter dive deep into the subtleties of the Java programming language and its core libraries. Illustrated with visually stunning optical illusions, Java™ Puzzlers features 95 diabolical puzzles that educate and entertain. Anyone with a working knowledge of Java will understand the puzzles, but even the most seasoned veteran will find them challenging.Most of the puzzles take the form of a short program whose behavior isn't what it seems. Can you figure out what it does? Puzzles are grouped loosely according to the features they use, and detailed solutions follow each puzzle. The solutions go well beyond a simple explanation of the program's behavior--they show you how to avoid the underlying traps and pitfalls for good. A handy catalog of traps and pitfalls at the back of the book provides a concise taxonomy for future reference.Solve these puzzles and you'll never again fall prey to the counterintuitive or obscure behaviors that can fool even the most experienced programmers.
The emergence of e-government services in East Africa: tracking adoption patterns and associated factors
Authors: Janet Kaaya
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

A study was conducted to determine the pattern of e-government adoption from 1998 to 2003 using the three East African countries of Kenya, Tanzania and Uganda, and 98 websites of their government agencies as case studies. The study also identified the factors that have influenced the observed patterns of adoption. The adoption patterns were determined using the number of websites (which corresponds to the number of government agencies, since each agency had only one official website) created each year and cumulative numbers over a five-year period. The adoption patterns were found to exhibit various degrees of "S" and normal distribution (bell) shapes as described in diffusion of innovation theory. There were a few early adopters in each country, including the embassies representing those countries abroad, and across the region as a whole, and the numbers of adopters increased over the years. However, the patterns of adoption were more gradual for Tanzania and Uganda than those of Kenya, whose rate of adoption was slow, with a sharp increase occurring in 2003, and associated with the establishment of a new government. Although early adopters were mostly embassies, their subsequent adoption patterns showed very low rates (only 3 compared to 16 for government ministry websites per year) in five years. Possible reasons for this trend include resource constraints, lack of pressure from governments, and lack of demand from potential users. This study is important in that it can help both researchers and policy makers to predict the extent and pattern of adoption so that they can assess points that require policy interventions to enhance effective adoption and implementation of e-government services.
Finding interesting pass patterns from soccer game records
Authors: Shoji Hirano, Shusaku Tsumoto
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

This paper presents a novel method for finding interesting pass patterns from soccer game records. Taking two features of the pass sequence "temporal irregularity and requirements for multiscale observation" into account, we have developed a comparison method of the sequences based on multiscale matching. The method can be used with hierarchical clustering, that brings us a new style of data mining in sports data. Experimental results on 64 game records of FIFA world cup 2002 demonstrated that the method could discover some interesting pass patterns that may be associated with successful goals.
Efficient security for IPv6 multihoming
Authors: Marcelo Bagnulo, Alberto García-Martínez, Arturo Azcorra
Venue: ACM SIGCOMM Computer Communication Review (2005)

In this note, we propose a security mechanism for protecting IPv6 networks from possible abuses caused by the malicious usage of a multihoming protocol. In the presented approach, each multihomed node is assigned multiple prefixes from its upstream providers, and it creates the interface identifier part of its addresses by incorporating a cryptographic one-way hash of the available prefix set. The result is that the addresses of each multihomed node form an unalterable set of intrinsically bound IPv6 addresses. This allows any node that is communicating with the multihomed node to securely verify that all the alternative addresses proposed through the multihoming protocol are associated to the address used for establishing the communication. The verification process is extremely efficient because it only involves hash operations.
Registration Uncertainty for Robot Self-localization in 3D
Authors: Pifu Zhang, Jason Gu, Evangelos E. Milios
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Stereo camera is a very important sensor for mobile robot localization and mapping. Its consecutive images can be used to estimate the location of the robot with respect to its environment. This estimate will be fused with location estimates from other sensors for a globally optimal location estimate. In the data fusion context, it is important to compute the uncertainty of the stereo-based localization. In this paper, we propose an approach to obtain the uncertainty of localization when a correspondence-based method is used to estimate the robot pose. The computational complexity of this approach is O(n), where n is the number of corresponding image points. Experimental results shows that this approach is promising.
COTS Clusters vs. the Earth Simulator: An Application Study Using IMPACT-3D
Authors: Daniel Chavarria-Miranda, Guohua Jin, John Mellor-Crummey
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

In 2002, Japan announced the Earth Simulator-a supercomputer based on low-volume vector processors and a custom network-and reported that computational scientists had used it to achieve 14.9 TFLOPS with the IMPACT-3D code, which is written in High Performance Fortran (HPF). Of particular interest was that they had achieved this level of performance using a high-level parallel programming model. There has been considerable concern in the U.S. about the appropriateness of its hardware and software investments in supercomputing technology. To help assess the U.S. strategy of building systems from commodity-off-the-shelf (COTS) components, we explored using a combination of HPF and scalar compiler technology to tailor IMPACT-3D to microprocessor-based supercomputers and evaluated its performance and scalability on the AlphaServer-based Lemieux cluster at the Pittsburgh Supercomputer Center (PSC). On the Earth Simulator, IMPACT-3D achieved 45% of peak performance on 4096 processors; on 1024 processors of PSC's Lemieux, we achieved 17.29% of peak performance.
Linux Debugging and Performance Tuning: Tips and Techniques
Authors: Steve Best
Venue:  (2005)

Learn Linux debugging and optimization-at kernel and application levels-hands-on!This is the definitive guide to Linux software debugging and performance optimization at both the kernel and application levels. Using extensive Linux code examples, Steve Best systematically introduces open source tools and best-practice techniques for delivering bug-free, well-tuned code.Drawing on his exceptional experience optimizing Linux systems for IBM, Best covers issues ranging from memory management and I/O to system processes and kernel bug messages. You'll walk through real debugging sessions, discovering the strategies experts use to debug even the most complex application- and kernel-related problems. You'll master sophisticated profiling techniques for identifying and resolving bottlenecks more quickly and learn how to capture the right data in the event of trouble. Coverage includes Bottleneck identification Code coverage Debuggers: gdb, kgdb, and KDB Memory management /proc kernel data analysis System process monitoring Network performance Oops bug messages Syslog and event logging Execution traces Profiling kernel behavior Cache misses User-Mode Linux Dynamic probes Crash dump analysis And more... Linux® Debugging and Performance Tuning will be indispensable for every developer who needs to supercharge the Linux kernel and applications, and for every administrator and support specialist who must resolve Linux reliability or performance issues.© Copyright Pearson Education. All rights reserved.
Multiroute planning for aircraft using genetic algorithms
Authors: Masaharu Tanaka, Masanobu Mizoguchi, Toshiaki Tange, Isao Takami, Shinji Suzuki
Venue: Systems and Computers in Japan (2004)

This paper proposes a scheme for generating multiple flight routes using genetic algorithms (GAs). In obtaining multiple routes or multiroutes by GAs simultaneously, there is a problem of collisions or near-misses occurring due to interference between the routes (closeness or intersecting of the routes) when similar routes are generated. The proposed scheme realizes a scheme for searching multiple flight routes without interference by incorporating a method for correcting their fitness on the basis of the neighborhood density for maintaining the variety and the degree of interference or the interference degree for obtaining routes that do not come close to or intersect one another. In addition, this paper proposes a priority candidate preserving strategy that preserves superior multiple individuals for each generation in order to improve the search performance. Computer simulation results confirm that the scheme proposed generates multiple flight routes without interference, indicating its efficacy. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(2): 39&ndash;48, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10428
Overview of results of the MUC-6 evaluation
Authors: Beth M. Sundheim
Venue: Proceedings of the 6th conference on Message understanding (1995)

The latest in a series of natural language processing system evaluations was concluded in October 1995 and was the topic of the Sixth Message Understanding Conference (MUC-6) in November. Participants were invited to enter their systems in as many as four different task-oriented evaluations. The Named Entity and Coreference tasks entailed Standard Generalized Markup Language (SGML) annotation of texts and were being conducted for the first time. The other two tasks, Template Element and Scenario Template, were information extraction tasks that followed on from the MUC evaluations conducted in previous years. The evolution and design of the MUC-6 evaluation are discussed in the paper by Grishman and Sundheim in this volume. All except the Scenario Template task are defined independently of any particular domain.
Choosing Measurement Poses for Robot Calibration with the Local Convergence Method and Tabu Search
Authors: David Daney, Yves Papegay, Blaise Madeline
Venue: International Journal of Robotics Research (2005)

The robustness of robot calibration with respect to sensor noise is sensitive to the manipulator poses used to collect measurement data. In this paper we propose an algorithm based on a constrained optimization method, which allows us to choose a set of measurement configurations. It works by selecting iteratively one pose after another inside the workspace. After a few steps, a set of configurations is obtained, which maximizes an index of observability associated with the identification Jacobian. This algorithm has been shown, in a former work, to be sensitive to local minima. This is why we propose here meta-heuristic methods to decrease this sensibility of our algorithm. Finally, a validation through the simulation of a calibration experience shows that using selected configurations significantly improve the kinematic parameter identification by dividing by 10-15 the noise associated with the results. Also, we present an application to the calibration of a parallel robot with a vision-based measurement device.
Query-Free News Search
Authors: Monika Henzinger, Bay-Wei Chang, Brian Milch, Sergey Brin
Venue: World Wide Web (2005)

Many daily activities present information in the form of a stream of text, and often people can benefit from additional information on the topic discussed. TV broadcast news can be treated as one such stream of text; in this paper we discuss finding news articles on the web that are relevant to news currently being broadcast. We evaluated a variety of algorithms for this problem, looking at the impact of inverse document frequency, stemming, compounds, history, and query length on the relevance and coverage of news articles returned in real time during a broadcast. We also evaluated several postprocessing techniques for improving the precision, including reranking using additional terms, reranking by document similarity, and filtering on document similarity. For the best algorithm, 84--91% of the articles found were relevant, with at least 64% of the articles being on the exact topic of the broadcast. In addition, a relevant article was found for at least 70% of the topics.
Improving goodput in IEEE 802.11 wireless LANs by using variable size and variable rate (VSVR) schemes: Research Articles
Authors: Song Ci, Hamid Sharif
Venue: Wireless Communications Mobile Computing (2005)

In IEEE 802.11 wireless LANs, channel quality, network load, as well as the protocol itself are time-varying, limiting the goodput performance improvement in wireless LANs. Therefore, it becomes critical to dynamically adjust parameters of MAC and PHY layers according to variations of channel quality. In this paper, we propose variable frame size and variable data rate schemes for goodput enhancement. We first propose two optimal frame size predictors: a goodput regulator to maintain the committed goodput for non-greedy applications and an optimal frame size predictor for maximizing the goodput for greedy applications. Then, we propose a data rate drafting scheme and develop a variable size and variable rate (VSVR) scheme for further goodput improvement. Our extensive simulation results show that the proposed VSVR algorithm can double the channel goodput of current implementations. Moreover, the proposed scheme can be easily integrated with the current implementations of the wireless LAN MAC protocol. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Alternators on uniform rings of odd size
Authors: Shing-Tsaan Huang, Ying-Sung Huang, Su-Shen Hung
Venue: Distributed Computing (2003)

An alternator is a network of concurrent processes, which satisfies the following conditions. (1) If one process executes the critical step, no neighbor of the process executes the critical step in the same computing step. (2) Along any infinite computing steps, each process executes the critical step infinitely often. (3) An alternator is self-stabilizing to the above conditions. An alternator is said to be 1-fair if condition (2) is changed as: A process can execute the critical step twice only if all other processes execute the critical step at least once. In this paper, we proposed an alternator for rings of odd size. The design has the snap property in the sense that it satisfies condition (1) even when transient faults occur. The alternator allows each process execute the critical step once every three steps when it stabilizes. The design is optimal 1-fair in the sense that no other 1-fair design can have better performance. Based on the above design, we fine-tune the alternator to achieve maximal performance. That is, our final alternator is a maximal alternator: a process is allowed to execute the critical step when both its two neighbors do not execute the critical step.