ppxscal/embedding_network huggingface dataset:
Verifying mutual exclusion and liveness properties with split preconditions
Authors: Awadhesh Kumar Singh, Anup Kumar Bandyopadhyay
Venue: Journal of Computer Science and Technology (2004)

This work is focused on presenting a split precondition approach for the modeling and proving the correctness of distributed algorithms. Formal specification and precise analysis of Peterson's distributed mutual exclusion algorithm for two process has been considered. The proof of properties like, mutual exclusion, liveness, and lockout-freedom have also been presented.
Head First Java, 2nd Edition
Authors: Kathy Sierra, Bert Bates
Venue:  (2005)

Learning a complex new language is no easy task especially when it s an object-oriented computer programming language like Java. You might think the problem is your brain. It seems to have a mind of its own, a mind that doesn't always want to take in the dry, technical stuff you're forced to study. The fact is your brain craves novelty. It's constantly searching, scanning, waiting for something unusual to happen. After all, that's the way it was built to help you stay alive. It takes all the routine, ordinary, dull stuff and filters it to the background so it won't interfere with your brain's real work--recording things that matter. How does your brain know what matters? It's like the creators of the Head First approach say, suppose you're out for a hike and a tiger jumps in front of you, what happens in your brain? Neurons fire. Emotions crank up. Chemicals surge. That's how your brain knows. And that's how your brain will learn Java. Head First Java combines puzzles, strong visuals, mysteries, and soul-searching interviews with famous Java objects to engage you in many different ways. It's fast, it's fun, and it's effective. And, despite its playful appearance, Head First Java is serious stuff: a complete introduction to object-oriented programming and Java. You'll learn everything from the fundamentals to advanced topics, including threads, network sockets, and distributed programming with RMI. And the new. second edition focuses on Java 5.0, the latest version of the Java language and development platform. Because Java 5.0 is a major update to the platform, with deep, code-level changes, even more careful study and implementation is required. So learning the Head First way is more important than ever. If you've read a Head First book, you know what to expect--a visually rich format designed for the way your brain works. If you haven't, you're in for a treat. You'll see why people say it's unlike any other Java book you've ever read. By exploiting how your brain works, Head First Java compresses the time it takes to learn and retain--complex information. Its unique approach not only shows you what you need to know about Java syntax, it teaches you to think like a Java programmer. If you want to be bored, buy some other book. But if you want to understand Java, this book's for you.
On the use of rank-one updates in the solution of stiff systems of ordinary differential equations
Authors: A. C. Hindmarsh, G. D. Byrne
Venue: ACM SIGNUM Newsletter (1976)

The idea of rank-one updates for the inverse of the Newton iteration matrix is considered in the context of solving stiff systems of ordinary differential equations. A specific and simple problem (linear, with a constant, diagonal Jacobian) and a specific and simple method (backward Euler, with constant step) are studied. A Newton iteration matrix which is in error because of a change in step size is then considered. The various resulting Newton matrices (original and updated) and the spectral radii of the corresponding error reduction matrices are computed. Two formulations of the Newton process are considered. On the whole the results are rather discouraging. The observed reductions in spectral radii as a result of the use of updates were usually only slight, unless sufficiently large numbers of updates were performed.
TXTmob: text messaging for protest swarms
Authors: Tad Hirsch, John Henry
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper describes cell phone text messaging during the 2004 US Democratic and Republican National Conventions by protesters using TXTmob -- a text-message broadcast system developed by the authors. Drawing upon analysis of TXTmob messages, user interviews, self-reporting, and news media accounts, we describe the ways that activists used text messaging to share information and coordinate actions during decentralized protests. We argue that text messaging supports new forms of distributed participation in mass mobilizations.
Multimedia training course on C++
Authors: Evgenia Georgieva, Margarita Teodosieva, Tsvetozar Georgiev, Stoyanka Smrikarova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper describes a multimedia educational course about C++ programming. The main purpose of this product is to support and increase the quality of education of students from specialities "Pedagogic of Mathematics and Informatics Education" and "Industrial Engineering" in the course "Programming and computers" by the use of interactive and attractive working method. In the application are included resources for students' self testing and text information searching.
Color-aware power and rate adaptation in IP-based CDMA radio access networks: Research Articles
Authors: V. Friderikos, L. Wang, M. Iwamura, A. H. Aghvami
Venue: Wireless Communications Mobile Computing (2005)

With IP technology being in the epicenter of future wireless networks, IP-centric resource management is currently receiving an increasing research attention. In this paper, a power and rate adaptation semantic is proposed that integrates quality of service (QoS) information from the IP layer of the differentiated services (DiffServ) architecture together with lower layer criteria in order to optimize packet transmission over the wireless interface. An optimization problem is formulated based on the output of a time sliding window three color marker (TSWtcm) of the ingress DiffServ node in the radio access network (RAN), where color aware power and rate control are performed. The critical impetus of the proposed approach besides minimization of the transmitted power is mainly twofold. Firstly, to achieve the required per-class aggregate data rate, while prioritizing and ensuring QoS of in-profile packets and secondly, to increase aggregate power gains by penalizing out-of-profile packets. The seminal aspect of the proposed scheme is that tangible power gains can be achieved by differentiating transmission of conformant and non-conformant packets while at the same time the power gains within each AF classes can be utilized to enhance the performance of in-profile traffic. To buttress the case, both theoretical and simulation results are meticulously presented that depict architectural and performance related aspects of the proposed scheme. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Foundations of semantic web databases
Authors: Claudio Gutierrez, Carlos Hurtado, Alberto O. Mendelzon
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

The Semantic Web is based on the idea of adding more machine-readable semantics to web information via annotations written in a language called the Resource Description Framework (RDF). RDF resembles a subset of binary first-order logic including the ability to refer to anonymous objects. Its extended version, RDFS, supports reification, typing and inheritance. These features introduce new challenges into the formal study of sets of RDF/RDFS statements and languages for querying them. Although several such query languages have been proposed, there has been little work on foundational aspects. We investigate these, including computational aspects of testing entailment and redundancy. We propose a query language with well-defined semantics and study the complexity of query processing, query containment, and simplification of answers.
IT is not for everyone in China
Authors: Jing Quan, Qing Hu, Xinan Wang
Venue: Communications of the ACM (2005)

A 2004 report by consulting firm Gartner Dataquest forecasts that the worldwide market for IT services will top $762.3 billion in 2008, up from $608.1 billion in 2004. The Asia-Pacific region's compound annual growth rate of 9.7% (projected 2003--2008) leads the world. IT services revenue in the region will thus top $43.9 billion in 2008, as China surpasses South Korea to become one of the three largest IT services markets in the region, along with Japan and Australia.The growth of China's enterprise software market in 2003--2004 reflected this broader trend. Sales of enterprise resource planning (ERP) software, according to a 2004 China Computer World (CCW) research survey, totaled 1.19 billion yuan ($144 million U.S.) in the first half of 2004, up 29% over the same period a year earlier. Human resources software posted sales growth of 80.4% for the first half of 2004 over the same period a year earlier. On the other hand, customer relationship management software sales barely crossed the 200-million-yuan mark, up 2.2% over the same period a year earlier. Nonetheless, the CCW survey anticipated a customer relationship software boom in five years when Chinese companies have had enough time to digest their operational-level IT investments and move on to more sophisticated management software. Despite the mixed outcomes in terms of ERP implementation and use in China [4], the CCW survey found that 47% of Chinese enterprises had installed ERP modules, with an annual growth rate of 5% for new installations.
Description of Quantum Dynamics of Open Systems Based on Collision-Like Models
Authors: Märio Ziman Peter Štelmachovič
Venue: Open Systems Information Dynamics (2005)

Master equations in the Lindblad form describe evolution of open quantum systems that are completely positive and simultaneously have a semigroup property. We analyze the possibility to derive this type of master equations from an intrinsically discrete dynamics that is modelled as a sequence of collisions between a given quantum system (a qubit) with particles that form the environment. In order to illustrate our approach we analyze in detail how the process of an exponential decay and the process of decoherence can be derived from a collision-like model in which particular collisions are described by SWAP and controlled-NOT interactions, respectively.
On the variance of average distance of subsets in the Hamming space
Authors: Fang-Wei Fu, San Ling, Chaoping Xing
Venue: Discrete Applied Mathematics (2005)

Let V be a finite set with q distinct elements. For a subset C of Vn, denote var(C) the variance of the average Hamming distance of C. Let T (n, M; q) and R (n, M; q) denote the minimum and maximum variance of the average Hamming distance of subsets of Vn with cardinality M, respectively. In this paper, we study T(n, M; q) and R(n, M; q) for general q. Using methods from coding theory, we derive upper and lower bounds on var(C), which generalize and unify the bounds for the case q = 2. These bounds enable us to determine the exact value for T(n, M; q) and R(n, M; q) in several cases.
Processor Aware Anticipatory Prefetching in Loops
Authors: Spiros Kalogeropulos, Mahadevan Rajagopalan, Vikram Rao, Yonghong Song, Partha Tirumalai
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

As microprocessor speeds increase, a large fraction of the execution time is often lost to cache miss penalties. This loss can be particularly severe in processors such as the UltraSPARC-IIICu which have in-order execution and block on cache misses. Such processors rely greatly on the compiler to reduce stalls and achieve high performance. This paper describes a compiler technique for software prefetching that is aware of the specific prefetch behaviors of the target processor. The implementation targets loops containing control-flow and strided or irregular memory access patterns. A two phase locality analysis, capable of handling complex subscript expressions, is used for enhanced identification of prefetch candidates. Prefetch instructions are scheduled with careful consideration of the prefetch behaviors in the target system. Compared to a previous implementation, our technique produced performance improvements of 9% on the geometric mean, and up to 44% on individual tests, in Sunýs first UltraSPARC-IIICu based SPEC CPU2000 submission [5] and has been used in all later submissions to date.
ExchangeGuard: A Distributed Protocol for Electronic Fair-Exchange
Authors: Mudhakar Srivatsa, Li Xiong, Ling Liu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Electronic fair-exchange protocols have received significant attention from the research community in the recent past. In loose terms, the fair exchange problem is defined as atomically exchanging electronic items between two parties. All the known fair exchange protocols today utilize a centralized trusted third party server either actively or passively. In this paper, we propose a distributed protocol for exchange of electronic items using untrusted servers. We perform detailed security analysis and show that the protocol guarantees effectiveness and fairness with Byzantine failures of up to one third of the untrusted servers. We also give the probability of a fair exchange otherwise. Finally we discuss how to deploy the protocol to large online electronic communities and peer-to-peer systems and demonstrate its security guarantees, scalability and load balancing properties.
Data-Optimal Rectification for Fast and Accurate Stereovision
Authors: Martin Matousek, Radim Sara, Vaclav Hlavac
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In this paper we propose rectification procedure for binocular stereoscopic vision that minimizes the loss of local image neighbourhood discriminability in rectified images. The optimality of the rectification is thus influenced by image contents. Such rectification helps seek for precise dense correspondences.
Modeling Custom Digital Circuits for Test
Authors: Soumitra Bose
Venue: Journal of Electronic Testing: Theory and Applications (2004)

Models meant for logic verification and simulation are often used for Automatic Test Pattern Generation (ATPG). For custom digital circuits, these models contain many tristate devices that tend to lower coverage for stuck-faults. Additionally, these tristate devices contribute to increased ATPG runtimes, fewer generated test sequences, and an overall lower test quality. The circuit under test is partitioned into channel connected sub-networks (CCSN) that consist of transistors that are connected at their source or drain terminals, except when these terminals are power, ground or primary inputs. Unlike other published work, algorithms presented in this paper analyze each CCSN in the context of its environment, thereby capturing the logical relationships among its input signals. Other algorithms presented include identification and modeling of embedded latches, clock generators and memory circuits. An abstract array model for memory that reduces the size of the model and increases simulation speed is also presented. When one specific feature of the algorithm was disabled, experimental results showed higher ATPG runtimes of about 35%, and an average decrease in fault coverage of around 15--20%. For the largest data cache, the memory modeling algorithm decreased the number of primitives from 1.23 million to 139 thousand.
A quality framework for web site quality: user satisfaction and quality assurance
Authors: Brian Kelly, Richard Vidgen
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Web site developers need to use of standards and best practices to ensure that Web sites are functional, accessible and interoperable. However many Web sites fail to achieve such goals. This short paper describes how a Web site quality assessment method (E-Qual) might be used in conjunction with a quality assurance framework (QA Focus) to provide a rounded view of Web site quality that takes account of end user and developer perspectives.
Location Privacy in Mobile Systems: A Personalized Anonymization Model
Authors: Bugra Gedik, Ling Liu
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

This paper describes a personalized k-anonymity model for protecting location privacy against various privacy threats through location information sharing. Our model has two unique features. First, we provide a unified privacy personalization framework to support location k-anonymity for a wide range of users with context-sensitive personalized privacy requirements. This framework enables each mobile node to specify the minimum level of anonymity it desires as well as the maximum temporal and spatial resolutions it is willing to tolerate when requesting for k-anonymity preserving location-based services (LBSs). Second, we devise an efficient message perturbation engine which runs by the location protection broker on a trusted server and performs location anonymization on mobile usersý LBS request messages, such as identity removal and spatio-temporal cloaking of location information. We develop a suite of scalable and yet efficient spatio-temporal cloaking algorithms, called CliqueCloak algorithms, to provide high quality personalized location k-anonymity, aiming at avoiding or reducing known location privacy threats before forwarding requests to LBS provider(s). The effectiveness of our CliqueCloak algorithms is studied under various conditions using realistic location data synthetically generated using real road maps and traffic volume data.
Applications of Computers to Dance
Authors: Tom Calvert, Lars Wilke, Rhonda Ryman, Ilene Fox
Venue: IEEE Computer Graphics and Applications (2005)

Of all the art forms, dance has probably been the slowest to adopt technology. In part, this reflects the reluctance of dancers and choreographers to let anything get between them and the live kinesthetic experience. But it also reflects the fact that useful tools have been slow to develop in a market with limited commercial opportunity.
The LRC machine translation system: Linguistics Research Center
Authors: Jonathan Slocum
Venue: Issue 79 (January 1982) (1982)

Source-language text is analyzed according to phrasestructure grammar rules augmented with procedures incorporating syntactic and semantic restrictions, surface and deep case analysis, and transformations; transformed to target-language structures and lexical items representing an equivalent utterance; then synthesized into target-language text.
Mining history of changes to web access patterns
Authors: Qiankun Zhao, Sourav S. Bhowmick
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Recently, a lot of work has been done in web usage mining [2]. Among them, mining of frequent Web Access Pattern (WAP) is the most well researched issue [1]. The idea is to transform web logs into sequences of events with user identifications and timestamps, and then extract association and sequential patterns from the events data with certain metrics. The frequent WAPs have been applied to a wide range of applications such as personalization, system improvement, site modification, business intelligence, and usage characterization [2]. However, most of the existing techniques focus only on mining frequent WAP from snapshot web usage data, while web usage data is dynamic in real life. While the frequent WAPs are useful in many applications, knowledge hidden behind the historical changes of web usage data, which reflects how WAPs change, is also critical to many applications such as adaptive web, web site maintenance, business intelligence, etc.In this paper, we propose a novel approach to discover hidden knowledge from historical changes to WAPs. Rather than focusing on the occurrence of the WAPs, we focus on the frequently changing web access patterns. We define a novel type of knowledge, Frequent Mutating WAP (FM-WAP), based on the historical changes of WAPs. The FM-WAP mining process consists of three phases. Firstly, web usage data is represented as a set of WAP trees and partitioned into a sequence of WAP groups ( subsets of the WAP trees) according to a user-defined calendar pattern, where each WAP group is represented as a WAP forest. Consequently, the log data is represented by a sequence of WAP forests called WAP history. Then, changes among the WAP history are detected and stored in the global forest. Finally, the FM-WAP is extracted by a traversal of the global forest. Extensive experiments show that our proposed approach can produce novel knowledge of web access patterns efficiently with good scalability.
Branch-and-bound task allocation with task clustering-based pruning
Authors: Yung-Cheng Ma, Tien-Fu Chen, Chung-Ping Chung
Venue: Journal of Parallel and Distributed Computing (2004)

We propose a task allocation algorithm that aims at finding an optimal task assignment for any parallel programs on a given machine configuration. The theme of the approach is to traverse a state-space tree that enumerates all possible task assignments. The efficiency of the task allocation algorithm comes from that we apply a pruning rule on each traversed state to check whether traversal of a given sub-tree is required by taking advantage of dominance relation and task clustering heuristics. The pruning rules try to eliminate partial assignments that violate the clustering of tasks, but still keeping some optimal assignments in the future search space. In contrast to previous state-space searching methods for task allocation, the proposed pruning rules significantly reduce the time and space required to obtain an optimal assignment and lead the traversal to a near optimal assignment in a small number of states. Experimental evaluation shows that the pruning rules make the state-space searching approach feasible for practical use.
Monotone Paths in Line Arrangements with a Small Number of Directions
Authors: Adrian Dumitrescu
Venue: Discrete Computational Geometry (2005)

We give subquadratic bounds on the maximum length of an x-monotone path in an arrangement of n lines with at most C log log n directions, where C is a suitable constant. For instance, the maximum length of an x-monotone path in an arrangement of n lines having at most ten slopes is O(n67/34). In particular, we get tight estimates for the case of lines having at most five directions, by showing that previous constructions&#x2014;&#x03a9;(n3/2) for arrangements with four slopes and &#x03a9;(n5/3) for arrangements with five slopes&#x2014;due to Sharir and Matousek, respectively, are (asymptotically) best possible.