ppxscal/embedding_network huggingface dataset:
Stochastic Properties Of p-Spacings Of Generalized Order Statistics
Authors: Taizhong Hu, Weiwei Zhuang
Venue: Probability in the Engineering and Informational Sciences (2005)

The concept of generalized order statistics was introduced as a unified approach to a variety of models of ordered random variables. The purpose of this article is to investigate the conditions on the parameters that enable one to establish several stochastic comparisons of general p-spacings for a subclass of generalized order statistics in the likelihood ratio and the hazard rate orders. Preservation properties of the logconvexity and logconcavity of p-spacings are also given.
AuthenLink: a user-centred authentification system for a secure mobile com
Authors: Christina Braz
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

We envision an environment where humans communicate directly with computers without additional authentication inputs like passwords, passphrases, PINs (Personal Identification Numbers), biometrics, or other existent authentication systems; and where humans network (intercommunicate) continually with wireless devices. In this paper, we propose a new RFID-based wireless authentication system, not yet implemented, called "AuthenLink" designed for mobile devices, coupled with a new approach to distinguishing characteristics to authenticate people (authentication factor): something you CONVEY. The utmost purpose of this paper is to provide an ease, user-centred and acceptable security authentication system especially against fraud, counterfeit, and theft for the wireless domain (cellular phones and personal digital assistants PDAs). Our authentication system achieves its goal through a microprocessor chip (ChipTag) computer implanted under human skin. This Chip Tag is able to authenticate user's access to systems, connect them wirelessly, through the Radio Frequency Identification (RFID) technology [5], and also enable mobile users to perform mobile transactions.
Integrating Software Engineering Process in an Undergraduate Curriculum
Authors: Mark J. Sebern, Thomas B. Hilburn
Venue: Proceedings of the 18th Conference on Software Engineering Education & Training (2005)

This tutorial is intended to assist faculty members and administrators who are designing or modifying undergraduate software engineering curricula, and who wish to learn about alternative approaches to incorporating software engineering process. Curricular recommendations developed by the Joint Task Force on Computing Curricula, formed by the IEEE Computer Society and the Association for Computing Machinery, provide a context for this discussion. The applicability of the Personal Software Process (PSP) and the Team Software Process (TSP), developed by the Software Engineering Institute, is also considered. Experienced software engineering educators may benefit from the presentations, hands-on exercises, and group discussions, but the tutorial is designed primarily for educators with less experience in software engineering curriculum development.
Predicting task execution time on handheld devices using the keystroke-level model
Authors: Lu Luo, Bonnie E. John
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The Keystroke-Level Model (KLM) has been shown to predict skilled use of desktop systems, but has not been validated on a handheld device that uses a stylus instead of a keyboard. This paper investigates the accuracy of KLM predictions for user interface tasks running on a Palm OS based handheld device. The models were produced using a recently developed tool for KLM construction, CogTool, and were compared to data obtained from a user study of 10 participants. Our results have shown that the KLM can accurately predict task execution time on handheld user interfaces with less than 8% prediction error.
Web Globalization Effort Growing
Authors: Benjamin Alfonsi
Venue: IEEE Distributed Systems Online (2005)

As more US companies seek to increase international revenue, the need to create a fully globalized Internet continues to grow, fueling significant work in the area.
Actively Deployable Mobile Services for Adaptive Web Access
Authors: Siu Nam Chuang, Alvin T. S. Chan, Jiannong Cao, Ronnie Cheung
Venue: IEEE Internet Computing (2004)

The proliferation of mobile devices in wireless environments has put special requirements on the ability to access the Web seamlessly. To addresses the impact of varying contextual characteristics on mobile access, the authors developed the WebPADS framework, which can actively deploy new mobile services to provide an optimal set of functionality. WebPads also can dynamically reconfigure and migrate its services to adapt to the vigorous changes in the wireless environment.
Classifying scheduling policies with respect to higher moments of conditional response time
Authors: Adam Wierman, Mor Harchol-Balter
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order to understand the predictability of response times under a range of scheduling policies, we study the conditional variance in response times seen by jobs of different sizes. We define a metric and a criterion that distinguish between contrasting functional behaviors of conditional variance, and we then classify large groups of scheduling policies.In addition to studying the conditional variance of response times, we also derive metrics appropriate for comparing higher conditional moments of response time across job sizes. We illustrate that common statistics such as raw and central moments are not appropriate when comparing higher conditional moments of response time. Instead, we find that cumulant moments should be used.
Duplicate detection in click streams
Authors: Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

We consider the problem of finding duplicates in data streams. Duplicate detection in data streams is utilized in various applications including fraud detection. We develop a solution based on Bloom Filters [9], and discuss the space and time requirements for running the proposed algorithm in both the contexts of sliding, and landmark stream windows. We run a comprehensive set of experiments, using both real and synthetic click streams, to evaluate the performance of the proposed solution. The results demonstrate that the proposed solution yields extremely low error rates.
Third workshop on software quality
Authors: Bernard Wong, June Verner, Sunita Chulani, Barry Boehm
Venue: Proceedings of the 27th international conference on Software engineering (2005)

To develop software on time and within budget is not good enough if the software produced is full of defects. As the software market matures, users want to be assured of quality. They no longer accept claims made by the IT department at face value, but expect concrete demonstrations of quality. Software stakeholders are also demanding higher quality software than ever before. In recent years, much software engineering research has focussed on standards, methodologies and techniques for improving software quality, measuring software quality and software quality assurance. Most of this research is focused on an internal view of quality whereas few measures of the customer view of quality exist. The Third Workshop on Software Quality aims to bring together academic, industrial and commercial communities interested in software quality topics to discuss the different technologies being defined and used in the software quality area.
Area Minimization of Exclusive-OR Intensive Circuits in FPGAs
Authors: Seok-Bum Ko
Venue: Journal of Electronic Testing: Theory and Applications (2004)

This paper presents Exclusive-OR (XOR)-based decomposition methods to implement XOR-intensive circuits efficiently in field programmable gate arrays (FPGAs). The first proposed method is an extension of the Shannon's expansion theorem. Such extension enables us to force decomposing the original circuits into the smaller sub-circuits. The second proposed method is based on the Exclusive-or-Sum-Of-Products (ESOP) expression that transforms AND/OR Boolean functions to AND/XOR functions. The XOR relation enables us to find more efficient grouping for the XOR-intensive circuits. The Microelectronics Center of North Carolina (MCNC) benchmark circuits are used to demonstrate the effectiveness of the proposed techniques. The proposed ESOP expression method is superior to the other common techniques in achieving realization efficiency. The proposed ESOP expression method needs 8.08 extra CLBs on average to implement the parity functions of the MCNC benchmark circuits while the typical method needs 14.31 extra CLBs on average. In other words, when using the proposed ESOP expression method, the number of CLBs is reduced by 34% compared to the typical method.
Performance sensitivity of SPEC CPU2000 over operating frequency
Authors: JunSeong Kim, Jongsu Yi
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

This paper presents and analyzes the performance sensitivity of SPEC CPU2000 benchmark over cpu clock speed. By measuring the performance of SPEC CPU2000 benchmark on a system with Intel Pentium4 processors running at various frequencies, we investigate how the performance of SPEC CPU2000 reacts against the changes in operating frequency. We saw overall SPEC CPU2000 performance increase monotonically and linearly as the core frequency increases. However, several individual components of SPEC CPU2000 program show abnormal scaling behavior.
On link layer denial of service in data wireless LANs: Research Articles
Authors: Guolong Lin, Guevara Noubir
Venue: Wireless Communications Mobile Computing (2005)

In this paper, we investigate the resiliency to jamming of data protocols, such as IP, over WLAN. We show that, on existing WLAN, an adversary can successfully jam data packets at a very low energy cost. Such attacks allow a set of adversary nodes disseminated over an area to prevent communication, partition an ad hoc network or force packets to be routed over adversary chosen paths. The ratio of the jamming pulses duration to the transmission duration can be as low as 10-4. We investigate and analyze the performance of combining a cryptographic interleaver with various coding schemes to improve the robustness of wireless LANs for IP packets transmission [1]. A concatenated code that is simple to decode and can maintain a low frame error rate (FER) under a jamming effort ratio of 15&percnt;. We argue that LDPC codes will be very suitable to prevent this type of jamming. We investigate the theoretical limits by analyzing the performance derived from upper bounds on binary error-control codes. We also propose an efficient anti-jamming technique for IEEE802.11b based on Reed&ndash;Solomon codes. Copyright &copy; 2004 John Wiley & Sons, Ltd.
An algorithm to play the game of mastermind
Authors: T. Mahadeva Rao
Venue: Issue 82 (October 1982) (1982)

The game of Mastermind (INVICTA) is played by two persons. It is quite popular and claimed to be quite complex. Recently, we were interested in computerizing this game. This paper summarized the method we discovered and implemented. Our method uses a simple list data structure to represent the knowledge gained. The algorithm was programmed in Pascal on a Burrough B-6800 machine. Some experimental results are presented at the end of the paper.
Graphs, branchwidth, and tangles! Oh my!
Authors: Illya V. Hicks
Venue: Networks (2005)

Branch decomposition-based algorithms have been used in practical settings to solve some NP-hard problems like the travelling salesman problem &lpar;TSP&rpar; and general minor containment. The notions of branch decompositions and branchwidth were introduced by Robertson and Seymour to assist in proving the Graph Minors Theorem. Given a connected graph G and a branch decomposition of G of width k where k is at least 3, a practical branch decomposition-based algorithm to test whether a graph has branchwidth at most k - 1 is given. The algorithm either constructs a branch decomposition of G of width at most k - 1 or constructs a tangle basis of order k, which offers a lower bound on the branchwidth of G. The algorithm is utilized repeatedly in a practical setting to find an optimal branch decomposition of a connected graph, whose branchwidth is at least 2, given an input branch decomposition of the graph from a heuristic. This is the first algorithm for the optimal branch decomposition problem for general graphs that has been shown to be practical. Computational results are provided to illustrate the effectiveness of finding optimal branch decompositions. A tangle basis is related to a tangle, a notion also introduced by Robertson and Seymour; however, a tangle basis is more constructive in nature. Furthermore, it is shown that a tangle basis of order k is coextensive to a tangle of order k. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 45&lpar;2&rpar;, 55&ndash;60 2005
Composition of software artifacts modelled using colored Petri nets
Authors: Leandro Dias da Silva, Angelo Perkusich
Venue: Science of Computer Programming (2005)

In this work we introduce a new formal model for software components supporting behavioral interpretability based on temporal logic, Petri nets, model checking, and an assume-guarantee strategy to specify and reason about the composition of concurrent component systems. The formal specification and verification strategies, methods, and techniques presented in this work contribute to the development of more dependable component-based software systems, in a modular way. An approach based on two complementary formalisms, Hierarchical Colored Petri Nets (HCPN) and temporal logic, is introduced. HCPN are used to visualize the structure and model the behavior of software architectures and components, and temporal logic is used to specify the required properties of software architectures and component interfaces.
NURBS-Based 3D Graphical Modeling and Visualization of Geological Structures
Authors: Denghua Zhong, Mingchao Li, Gang Wang, Huang Wei
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

3D computer modeling and visualization of geological structures is currently a topical research area. Most of common methods to be able to reconstruct 3D geological models require enough raw data and storage space. But in fact the known data sets are discrete and sparse. This paper presents a novel approach to modeling geological structures in 3D with all data from investigations and interpretations. NURBS technique is improved to build the VisualGeo system as 3D geological modeling environment. Following the object-oriented and classified modeling method, all kinds of geological structures could be simulated and the whole 3D geological model was set up systematically by graphical operations and texture mapping. Finally an example was given to display the constructed models and some visualizations of geologic analysis. The successful application and popularization in practice of the system indicate that it will have much applied importance.
Homotopy-preserving medial axis simplification
Authors: Avneesh Sud, Mark Foskey, Dinesh Manocha
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

We present a novel algorithm to compute a simplified medial axis of a polyhedron. Our simplification algorithm tends to remove unstable features of Blum's medial axis. Moreover, our algorithm preserves the topological structure of the original medial axis and ensures that the simplified medial axis has the same homotopy type as Blum's medial axis. We use the separation angle formed by connecting a point on the medial axis to closest points on the boundary as a measure of the stability of the medial axis at the point. The medial axis is decomposed into its parts that are the sheets, seams and junctions. We present a stability measure of each part of the medial axis based on separation angles and examine the relation between the stability measures of adjacent parts. Our simplification algorithm uses iterative pruning of the parts based on efficient local tests. We have applied the algorithm to compute a simplified medial axis of complex models with tens of thousands of triangles and complex topologies.
MaTCH: Mapping Data-Parallel Tasks on a Heterogeneous Computing Platform Using the Cross-Entropy Heuristic
Authors: Soumya Sanyal, Sajal K. Das
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

We develop in this paper a new heuristic for mapping a set of heterogeneous interacting tasks of a parallel application onto a heterogeneous computing platform. The problem is well known in literature to be an NP-Hard problem. However, we propose a completely new approach based on the Cross-Entropy (CE) method. This is a new and extremely robust rare event simulation (RES) technique which may be employed to solve difficult combinatorial optimization problems (COPs). We tailor the CE method to the requirements of the problem at hand, develop a mathematical framework, and present our algorithm, MaTCH. This globally iterative randomized procedure is then compared to a previously developed genetic algorithm (GA). Through some simple experiments we prove the power of MaTCH and we get remarkable improvements in the quality of mapping. The results indicate that, when compared to the GA, MaTCH improves upon the application execution time by over a factor of 38 on a 50 node system graph. We further attest our results by performing an ANOVA test on a sample data set to prove the significance of our results.
Restoration and Recognition in a Loop
Authors: Mithun Das Gupta, Shyamsundar Rajaram, Nemanja Petrovic, Thomas S. Huang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

In this paper we present a novel learning based method for restoring and recognizing images of digits that have been blurred using an unknown kernel. The novelty of our work is an iterative loop that alternates between recognition and restoration stages. In the restoration stage we model the image as an undirected graphical model over the image patches with the compatibility functions represented as non-parametric kernel densities. Compatibility functions are initially learned using uniform random samples from the training data. We solve the inference problem by an extended version of the non-parametric belief propagation algorithm in which we introduce the notion of partial messages. We close the loop by using the confidence scores of the recognition to non-uniformly sample from the training set in order to retrain the compatibility functions. We show experimental results on synthetic and license plate images.
Carrier Frequency Recovery Technique in OFDM Systems
Authors: Bo Ai, Jian-Hua Ge, Dian-Fu Zhang, Jun Liu, Yong Wang, Zhen Lu
Venue: Wireless Personal Communications: An International Journal (2005)

Orthogonal frequency division multiplexing (OFDM) systems are highly sensitive to carrier frequency errors. In this paper, a new method utilizing pilots to do frequency synchronization in frequency domain is proposed with large estimation range. It needs no such prerequisite assumption that a perfect symbol timing synchronization [IEEE Transactions on Communications 42 (1994) 2908; 45 (1997) 1613] has been done before performing integer carrier frequency synchronization. Also, a new adjusting model for fine carrier frequency is proposed. Simulation and performance analysis show that our overall frequency estimator has high accuracy. The corresponding FPGA circuit through test in high definition TV (HDTV) prototype in Team of Expert Engineering Group (TEEG) in China proves its availability and feasibility.
A Novel Framework for Radio Resource Management in IEEE 802.11 Wireless LANs
Authors: Mark Davis, Tristan Raimondi
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

In this paper we address the need to characterize and quantify resource usage in IEEE 802.11 WLANs in order to support radio resource management. We present a compact and intuitive framework for performance characterization and resource utilization that is based upon the concept of MAC bandwidth components. These MAC bandwidth components are directly related to the transmission rate and serve to quantify the resource requirements associated with accessing the wireless medium. We also introduce a graphical technique for presenting these MAC bandwidth components that illustrates how WLAN stations interact in contending for access to the wireless medium. We demonstrate the usefulness of this framework for radio resource management using a number of computer simulations based upon the emerging IEEE 802.11e QoS standard.
Micro-scale metallization of high aspect-ratio Cu and Au lines on flexible polyimide substrate by electroplating using SU-8 photoresist mask
Authors: S. H. Cho, S. H. Kim, J. G. Lee, N. -E. Lee
Venue: Microelectronic Engineering (2005)

In order to fabricate flexible microelectronic devices, fabrication of metallization lines and metal electrodes on the flexible substrate is essential. Cu lines are often used as interconnect lines in electronic devices and Au as microelectrodes in organic transistors and bioelectronics devices due to its good electrochemical stability and biocompatibility. For minimizing the size of device, the realization of metallization lines and microelectrodes with the scale of a few micrometers on the flexible substrate is very important. In this work, micro-scale metallization lines of Cu and Au were fabricated on the flexible polyimide (PI) substrate by electroplating using the patterned mask of a negative-tone SU-8 photoresist. Surface of PI substrate was treated by O"2 inductively coupled plasma for improvement of the adhesion strength between Cr layer and PI and in situ sputter-deposition of 100-nm thick Cu seed layers on the sputter-deposited 50-nm thick Cr adhesion layer was followed. Electroplating of high aspect-ratio Cu and Au lines using a sulfuric acid and a noncyanide solution with the patterned SU-8 mask, respectively, removal of SU-8, and selective wet etch of Cr adhesion and Cu seed layers were carried out. Micro-scale Au electrode lines were successfully fabricated on the PI substrate. Micro-scale gap-filled Cu lines with spin-coated polyimide on the PI substrate with the thickness of 6-12 @mm and the aspect ratio of 1-3 were successfully fabricated.
Support Weight Enumerators and Coset Weight Distributions of Isodual Codes
Authors: Olgica Milenkovic
Venue: Designs, Codes and Cryptography (2005)

In this paper various methods for computing the support weight enumerators of binary, linear, even, isodual codes are described. It is shown that there exist relationships between support weight enumerators and coset weight distributions of a code that can be used to compute partial information about one set of these code invariants from the other. The support weight enumerators and complete coset weight distributions of several even, isodual codes of length up to 22 are computed as well. It is observed that there exist inequivalent codes with the same support weight enumerators, inequivalent codes with the same complete coset weight distribution and inequivalent codes with the same support eight enumerators and complete coset weight distribution.