ppxscal/embedding_network huggingface dataset:
A heap de/compression module for wireless Java
Authors: Mayumi Kato, Chia-Tien Dan Lo
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

Cellular phones used to provide voice-only services, offline computing, games, schedulers, notes, and calculators, etc. Current generation of multi-functioned handsets including cellular phones and PDAs support high speed multimedia data transfers, MP3 music and video, and give the user direct access to multi-information services such as share process, news, sports results and M-commerce by Wireless Java. Many of these applications require a large volume of data and thus higher non-volatile memory capacity. One solution is to integrate Multi-chip package (MCP) & First Cycle Random Access Memory (FCRAM), or Flexible Flash Memories into the small handsets. The increasing memory capacity, however, causes higher cost and difficulty due to a limit of memory size in the small handsets. Alternative solution is to reduce memory space required for executing applications. Runtime memory compression technique is one candidate for achieving the goal. We propose a Java computation mechanism with a de / compression module that reduces Java heap memory demand. We also introduce the use of a shared Java virtual machine (VM) for wireless Java. The runtime heap compression mechanism could achieve 48.54% of compression ratio. The heap memory, then, could be saved 51.46% and the garbage collection (GC) time could be eliminated. This memory saving leads low power consumption with the multi-memory bank organization. The space efficiency of the proposed computation mechanism is 1.23 to 2.13. The speed up in Java heap memory management part varies among benchmarks and is up to 5.20. The modified LRU page replacement policy and the shared VM make the use of de / compression technique further less affect the entire performance. The proposed computation mechanism with Java heap de / compression module makes the wireless Java web applications faster and will offer good user experience and low power consumption.
Implicit data structures for logic and stochastic systems analysis
Authors: Gianfranco Ciardo, Andrew S. Miner
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

Both logic and stochastic analysis have strong theoretical underpinnings, but they have been traditionally relegated to separate areas of computer science, the former focusing on logic and discrete algorithms, the latter on exact or approximate numerical methods. In the last few years, though, there has been a convergence of research in these two areas, due to the realization that data structures used in one area can benefit the other and that, by merging the goals of the two areas, a more integrated approach to system analysis can be derived. In this paper, we describe some of the beneficial interactions between the two, and some of the research challenges ahead.
DOT: New Deterministic Defect-Oriented ATPG Tool
Authors: Jaan Raik, Raimund Ubar, Joachim Sudbrock, Wieslaw Kuzmicz, Witold Pleskacz
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

A method is proposed for combinational deterministic test pattern generation using a uniform functional fault model for combinational circuits. This includes an approach, which allows to find the types of faults that may occur in a real circuit and to determine their probabilities. Additionally, a defect-oriented deterministic test generation tool was developed (DOT), and the experimental data obtained by the tool for ISCASý85 benchmarks are presented. It was shown that 100% stuck-at fault tests covered only about80-90% physical defects. The main feature of the new tool is its ability to reach 100% defect efficiency for the given set of defects by proving the redundancy of not detected defects. An interesting conclusion of the experiments is also that up to 25 % of the defects cannot be covered by any voltage test approaches.
Indexing genomic sequence libraries
Authors: Kevin C. O'Kane, Matthew J. Lockner
Venue: Information Processing and Management: an International Journal (2005)

This paper describes an extensible, open-source (GPL) data repository and retrieval system that supports fast, efficient, keyword based retrieval of genomic sequences from multiple libraries with retrieved sequences post-processed by FASTA, Smith-Waterman and other analysis software. This application is implemented for Linux and is written in Mumps, C, and C++ with supporting components that include the Berkeley Data Base, the Perl Compatible Regular Expression Library, GLADE, and tools such as FASTA, Smith-Waterman, and modules from EMBOSS. The package described here can quickly index data sets of up to 256 terabytes using a B-tree based multi-dimensional data model. An example is presented that indexes the text of the full NCBI Genbank library.
Trajectory tracking control of robot arm by using computational models of spinal cord and cerebellum
Authors: Takayuki Nakayama, Hidenori Kimura
Venue: Systems and Computers in Japan (2004)

In studies of robots, intended for collaborative operation with humans, there have been intensive efforts to develop and apply a muscle-driving system with mechanically soft properties, to reduce the danger to humans. Such a muscle-driving system has the advantage that the danger to humans in collaborative operation can be reduced, but has the disadvantage that accurate control is difficult due to the soft properties. The soft and accurate motion of the limbs in biological systems is realized by skillful control of the muscles by the control system composed of the spinal cord and the cerebellum. Consequently, inspired by the motion control mechanism in biological systems, this paper tries to develop a control system that provides accurate trajectory tracking control of the robot, by using a muscle-driving actuator with soft mechanical properties. The proposed control system consists of the computational models of the stretch reflex system in the spinal cord, which compensates the external load torque exerted on the joint, and the cerebellum, which compensates the inertial torque with learning the internal model of the limb dynamics. Using the indirect Lyapunov method, it is shown theoretically that the posture of the robot asymptotically approaches the desired trajectory when driven by the proposed control system. A computer simulation is performed in order to demonstrate the effectiveness of the control system, and it is verified that the behavior converges satisfactorily to the desired target. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(11): 1&ndash;13, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10646
Mobility aware server selection for mobile streaming multimedia content distribution networks
Authors: Muhammad Mukarram Bin Tariq, Ravi Jain, Toshiro Kawahara
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

We propose a Content Delivery Network (CDN) with servers arranged hierarchically in multiple tiers. Lower-tier servers are topologically closer to the clients, and hence can deliver better QoS in terms of end-to-end delay and jitter. On the other hand, higher-tier servers have a larger coverage area and hence their clients incur fewer server handoffs. We present a server selection scheme that reduces the number of server handoffs while meeting differentiated QoS requirement for each client. The scheme dynamically estimates the client's residence time and uses a simple algorithm to assign clients to the appropriate tier. The scheme also caters for traditional server selection criteria, such as the expected QoS from the servers, bandwidth consumption, and the server load. We show through simulations that the scheme can achieve up to 15% reduction in handoffs, at the cost of minimal increases in delay and jitter while ensuring that clients of different QoS classes experience different delays.
Fast estimation of probabilities of soft deadline misses in layered software performance models
Authors: Tao Zheng, Murray Woodside
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

Quality of service requirements are normally given in terms of soft deadlines, such as "90% of responses should complete within one second". To estimate the probability of meeting the target delay, one must estimate the distribution of response time, or at least its tail. Exact analytic methods based on state-space analysis suffer from state explosion, and simulation, which is also feasible, is very time consuming. Rapid approximate estimation would be valuable, especially for those cases which do not demand great precision, and which require the exploration of many alternative models.This work adapts layered queueing analysis, which is highly scalable and provides variance estimates as well as mean values, to estimate soft deadline success rates. It evaluates the use of an approximate Gamma distribution fitted to the mean and variance, and its application to examples of software systems. The evaluation finds that, for a definable set of situations, the tail probabilities over 90% are estimated well within a margin of 1% accuracy, which is useful for practical purposes.
Why quality?: ISO 9126 software quality metrics (Functionality) support by UML suite
Authors: Shahid Nazir Bhatti
Venue: ACM SIGSOFT Software Engineering Notes (2005)

The widespread use of information services will only be accepted by users if their quality is of acceptable level. It is therefore of high interest to be able to estimate, or even measure the quality of a system under construction. UML is now a de-factor standard for modelling systems to be build. This paper indicates how UML diagrams are related to software quality metrics as described in ISO/IEC 9126 and similar quality standards. The paper discusses relevant quality metrics, analyses sources of errors and relates them to the UML diagrams used in software engineering.The paper discusses the sub-attributes of the attribute 'Functionality' in more detail and relates the to the relevant UML diagrams.
Sparse Flat Neighborhood Networks (SFNNs): Scalable Guaranteed Pairwise Bandwidth & Unit Latency
Authors: Timothy I. Mattox, Henry G. Dietz, William R. Dieter
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 14 - Volume 15 (2005)

Network performance for a particular application is determined by the latency and bisection bandwidth that are achieved for the set of specific communication patterns used by that application. The number of nodes with which each node might potentially communicate grows linearly as nodes are added, thus, network cost for large systems either becomes a large fraction of machine cost or performance suffers. However, performance-critical communication patterns commonly occurring in real parallel programs rarely require that each node directly communicate with every other node. The number of node pairs actually communicating generally grows far slower than the expected O(N^2 ). Thus, a carefully designed network for a massively parallel system can use relatively narrow switches while still providing single-switch latency and guaranteed pairwise bandwidth for performance-critical communications. This paper introduces Sparse Flat Neighborhood Networks (SFNNs), a variant of Flat Neighborhood Networks (FNNs) which are engineered from first principles to efficiently meet these detailed pairwise communication performance criteria.
Fast and reliable collision detection using graphics processors
Authors: Naga K. Govindaraju, Ming C. Lin, Dinesh Manocha
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

We present a fast and reliable collision detection algorithm using graphics processors. We use visibility computations to prune non-overlapping pairs of triangles. We overcome the accuracy problems due to limited viewport resolution using Minkowski sums of primitives and a pixel-size sphere.
Random planar graphs
Authors: Colin McDiarmid, Angelika Steger, Dominic J. A. Welsh
Venue: Journal of Combinatorial Theory Series B (2005)

We study various properties of the random planar graph Rn, drawn uniformly at random from the class Pn of all simple planar graphs on n labelled vertices. In particular, we show that the probability that Rn is connected is bounded away from 0 and from 1. We also show for example that each positive integer k, with high probability Rn has linearly many vertices of a given degree, in each embedding Rn has linearly many faces of a given size, and Rn has exponentially many automorphisms.
Investigating the usage of the Chinese wall security policy model for data mining
Authors: M. Loock, Jan H. P. Eloff
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

Access control requirements for the protection of information/data objects in an information system environment are well defined and successfully implemented by means of access control policies and models. Whenever these objects are used in a data-mining environment, a change in the access control requirements becomes necessary. During a data-mining activity the data miner may expose unexpected results or trends. It is important for all companies involved in data-mining activities to be aware of these potential access control problems.Brewer and Nash (1989) first defined the Chinese Wall Security Policy model (CWSP model). It provides access control for the commercial environment based on conflict of interest classes. Shortly after the introduction of this model, Lin (1989) reported an error in it and presented a modified version called the Aggressive Chinese Wall Security Policy model (ACWSP model). This model introduced the concept of an overlap between conflict of interest classes. It became evident that these two models had the potential to be used in a data-mining environment.
An approach to the measurement of software evolution
Authors: Allen P. Nikora, John C. Munson
Venue: Journal of Software Maintenance: Research and Practice (2005)

Our current work involves developing methods of measuring changes to evolving software systems. We study a system's change characteristics over a large number of builds using the distinct sources of variation in the software metrics used to measure the system.We have been collaborating with a flight software technology development effort at the Jet Propulsion Laboratory (JPL) and have progressed in resolving the limitations of our earlier work in two distinct steps. First, we have developed a repeatable and consistent fault enumeration methodology, allowing them to be precisely and accurately measured. Second, we have developed a practical framework for automating fault measurement, which we applied to the JPL software system during its development. Every change to the system was measured and every identified fault was tracked to a specific code module.Our analysis indicates that measures of the evolving system's structure are strongly related to the number of faults inserted during its development, and that some types of change are more likely to result in the insertion of faults than others. The fault enumeration methodology ensures that the resulting fault model has greater predictive validity; it also provides a higher quality model than other popular definitions of a fault.
Isophote Properties as Features for Object Detection
Authors: Jeroen Lichtenauer, Emile Hendriks, Marcel Reinders
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Usually, object detection is performed directly on (normalized) gray values or gray primitives like gradients or Haar-like features. In that case the learning of relationships between gray primitives, that describe the structure of the object, is the complete responsibility of theclassifier. We propose to apply more knowledge about the image structure in the preprocessing step, by computing local isophote directions and curvatures, in order to supply the classifier with much more informative image structure features. However, a periodic feature space, like orientation, is unsuited for common classification methods. Therefore, we split orientation into two more suitable components. Experiments show that the isophote features result in better detection performance than intensities, gradients or Haar-like features.
Measuring class cohesion based on dependence analysis
Authors: Zhen-Qiang Chen, Bao-Wen Xu, Yu-Ming Zhou
Venue: Journal of Computer Science and Technology (2004)

Classes are the basic modules in object-oriented (OO) software, which consist of attributes and methods. Thus, in OO environment, the cohesion is mainly about the tightness of the attributes and methods of classes. This paper discusses the relationships between attributes and attributes, attributes and methods, methods and methods of a class based on dependence analysis. Then the paper presents methods to compute these dependencies. Based on these, the paper proposes a method to measure the class cohesion, which satisfies the properties that a good measurement should have. The approach overcomes the limitations of previous class cohesion measures, which consider only one or two of the three relationships in a class.
Distributed block independent set algorithms and parallel multilevel ILU preconditioners
Authors: Chi Shen, Jun Zhang, Kai Wang
Venue: Journal of Parallel and Distributed Computing (2005)

We present a class of parallel preconditioning strategies utilizing multilevel block incomplete LU (ILU) factorization techniques to solve large sparse linear systems. The preconditioners are constructed by exploiting the concept of block independent sets (BISs). Two algorithms for constructing BISs of a sparse matrix in a distributed environment are proposed. We compare a few implementations of the parallel multilevel ILU preconditioners with different BIS construction strategies and different Schur complement preconditioning strategies. We also use some diagonal thresholding and perturbation strategies for the BIS construction and for the last level Schur complement ILU factorization. Numerical experiments indicate that our domain-based parallel multilevel block ILU preconditioners are robust and efficient.
ARLP: an adaptive link layer protocol to improve TCP performance over wireless fading channels: Research Articles
Authors: Haitao Lin, Sajal K. Das
Venue: Wireless Communications Mobile Computing (2004)

Improving the performance of Internet services is essential for future generation wireless networks. However, the correlated fading channels are found to be very unfriendly to transmission control protocol (TCP) performance in such networks. The variation in fading rate brings further challenge to wireless networks when supporting Internet applications, most of which run TCP as the transport layer protocol. In this paper, we first analytically study the performance of different radio link protocol (RLP) retransmission schemes in supporting TCP. In particular, we investigate the key quality of service (QoS) parameters of RLP such as average delay, delay variance and recovery rate of lost frames. Our analytical and simulation results show that a single retransmission scheme does not yield the best performance for different fading rates. To address this problem, we propose an adaptive radio link protocol (ARLP) that dynamically estimates the channel fading rate and also adaptively chooses those retransmission schemes that best fit the estimated fading rate. The performance of ARLP is evaluated in terms of response time (the time ARLP takes to respond to fading rate change), throughput improvement and energy consumption. The results show that ARLP can improve the performance of a particular mobile host as well as the total throughput of wireless networks, at the cost of a little extra energy consumption at low frame error rate. On the other hand, at high frame error rate, ARLP saves energy because of fewer retransmissions. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Use of eye movements as feedforward training for a synthetic aircraft inspection task
Authors: Sajay Sadasivan, Joel S. Greenstein, Anand K. Gramopadhye, Andrew T. Duchowski
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Aircraft inspection is a vital element in assuring safety and reliability of the air transportation system. The human inspector performing visual inspection of an aircraft is the backbone of this process and training is an effective strategy for improving their inspection performance. Previous studies have shown offline feedback training to be effective in improving subsequent visual inspection performance. Because experienced inspectors are known to adopt a better inspection strategy than novices, providing visualization of experts' cognitive processes a priori can accelerate novices' adoption of the experts' strategy. Using eye tracking equipment, we record the point of regard of an expert inspector performing an inspection task in a virtual reality simulator. Analysis of their eye movements leads to a visualization of their scanpaths and allows us to display the inspector's visual search (hence cognitive) strategy. We show how providing this type of scanpath-based feedforward training of novices leads to improved accuracy performance in the simulator coupled with an observed speed-accuracy tradeoff. We contend that the tradeoff results from trained novices adopting a slower paced strategy through increased fixation durations, suggesting trained novices learn a more deliberate target search/discrimination strategy that requires more time to execute.
Back to the future part 4: the internet
Authors: Simon S. Lam
Venue: ACM SIGCOMM Computer Communication Review (2005)

I thank the SIGCOMM Awards committee for this great honor. I would like to share this honor with my former and current students, and colleagues, who collaborated and co-authored papers with me. Each one of them has contributed to make this award possible. To all my coauthors, I thank you.
Web service composition using a deductive XML rule language
Authors: Nick Bassiliades, Dimosthenis Anagnostopoulos, Ioannis Vlahavas
Venue: Distributed and Parallel Databases (2005)

This paper describes a knowledge-based Web Service composition system, called SWIM, which is based on the Service Domain model. Service Domains are communities of related Web Services that are mediated by a single Web Service, called the Mediator Service, which functions as a proxy for them. When a requestor sends a message to the Mediator Service one or more of the related Web Services are selected to dispatch the message and the results returned are aggregated to a single answer to the requestor. Mediator Services can be further composed to more complex Mediator Services that combine several selection and aggregation algorithms among many heterogeneous web services. The system utilizes the X-DEVICE deductive XML rule language for defining complex algorithms for selecting registered web services, combining the results, and synchronizing the workflow of information among the combined web services in a declarative way. In the paper, we demonstrate the flexibility and expressibility of our approach for composing Web Services using several e-business examples, covering most of the workflow patterns found in a comprehensive workflow management system (van der Aalst et al., Distributed and Parallel Databases, vol. 14, no, 1, pp. 5-15, 2003).