ppxscal/embedding_network huggingface dataset:
Architecture for 3G and 802.16 Wireless Networks Integration with QoS Support
Authors: Daehyon Kim, Aura Ganz
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

To meet the growing demand for broadband wireless connectivity, integrating 3G and IEEE 802.16 networks is a clear and viable solution. To the best of the authors' knowledge, this is the first solution proposed for the integration of 3G and 802.16 wireless networks. We present a novel network and mobile client architecture that provides seamless roaming and mobility while maintaining connectivity across these heterogeneous wireless networks and provides quality of service (QoS) support. To provide QoS support to the application in the integrated network environment, the proposed architecture incorporates the procedures for activating a QoS session, the translation between network-specific QoS classifications, and network and session layer QoS support. We provide simulation results that show the viability and performance of the proposed QoS architecture.
Lexical affinities and language applications
Authors: Egidio Terra
Venue:  (2005)

Understanding interactions among words is fundamental for natural language applications. However, many statistical NLP methods still ignore this important characteristic of language. For example, information retrieval models still assume word independence. This work focuses on the creation of lexical affinity models and their applications to natural language problems. The thesis develops two approaches for computing lexical affinity. In the first, the co-occurrence frequency is the calculated by point estimation. The second uses parametric models for co-occurrence distances. For the point estimation approach, we study several alternative methods for computing the degree of affinity by making use of point estimates for co-occurrence frequency. We propose two new point estimators for co-occurrence and evaluate the measures and the estimation procedures with synonym questions. In our evaluation, synonyms are checked directly by their co-occurrence and also by comparing them indirectly, using other lexical units as supporting evidence. For the parametric approach, we address the creation of lexical affinity models by using two parametric models for distance co-occurrence: an independence model and an affinity model. The independence model is based on the geometric distribution; the affinity model is based on the gamma distribution. Both fit the data by maximizing likelihood. Two measures of affinity are derived from these parametric models and applied to the synonym questions, resulting in the best absolute performance on these questions by a method not trained to the task. We also explore the use of lexical affinity in information retrieval tasks. A new method to score missing terms by using lexical affinities is proposed. In particular, we adapt two probabilistic scoring functions for information retrieval to allow all query terms to be scored. One is a document retrieval method and the other is a passage retrieval method. Our new method, using replacement terms; shows significant improvement over the original methods.
Development of Semi-Automatic Segmentation Methods for Measuring Tibial Cartilage Volume
Authors: James Cheong, David Suter, Flavia Cicuttini
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Osteoarthritis is a chronic and crippling disease affecting an increasing number of people each year. With no known cure, it is expected to reach epidemic proportions in the coming years. Currently, there is strong interest in developing a fully automated cartilage area/volume measurement method in the medical field to assist both pharmaceutical companies and medical professions in researching the disease. This paper describes the development of two different semi-automatic methods for segmenting and measuring human knee cartilage volume from magnetic resonance imaging (MRI) scans. Two different approaches were adopted, a data driven segmentation technique using directional Canny filters and a model based segmentation method using an improved Active Shape Model (ASM) scheme. The cartilage volume obtained using each method was benchmarked against the current "gold standard" (cartilage volume from manual segmentation).
Inferable Centers, Centering Transitions, and the Notion of Coherence
Authors: Laurel Fais
Venue: Computational Linguistics (2004)

A centering analysis of the corpus of Japanese e-mail that is examined in this article relies heavily on the inclusion of inferable centers. However, utilizing this type of center results in a high level of indeterminacy in labeling transitions and thus in characterizing the coherence of the corpus. The difficulty lies in the requirement of identity of discourse entities in the definitions of transition states. Lexical cohesion is proposed as a well-defined notion to replace the intuitions captured by the use of inferable centers. Two new transitions, based on lexical relatedness instead of identity, supplement the standard definitions and more adequately characterize coherence in this corpus. Implications and extensions of the proposal are discussed.
Concept Assignment as a Debugging Technique for Code Generators
Authors: Jeremy Singer
Venue: Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (2005)

Code generators are notoriously dif?cult to debug, yet their correctness is crucial. This paper demonstrates that concept assignment can be performed in an entirely syntaxdirected manner for code generators and other highly structured program modules. Anomalies in this concept assignment indicate the possible existence of bugs. These insights enable the formulation of a new debugging technique for code generators. This paper describes the procedure, a practical implementation, and results from the application of this debugging technique to an experimental code generator.
Automated test generation for engineering applications
Authors: Songtao Xia, Ben Di Vito, César Muñoz
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

In test generation based on model-checking, white-box test criteria are represented as trap conditions written in a temporal logic. A model checker is used to refute trap conditions with counter-examples. From a feasible counter-example test inputs are then generated. The major problems of applying this approach to engineering applications derive from the fact that engineering programs have an infinite state space and non-linear numerical computations. Our solution is to combine predicate abstraction (which reduces the state space) with a numerical decision procedure (which supports predicate abstraction by solving non-linear constraints) based on interval analysis. We have developed a prototype and applied it to MC/DC (Modified Condition/Decision Coverage) test case generation. We have used the prototype on a number of C modules taken from a conflict detection and avoidance system and from a Boeing 737 autopilot simulator. The modules range from tens of lines up to thousands of lines in size. Our experience shows that although in theory the inclusion of a decision procedure for non-linear arithmetic may lead to non-terminating behavior and false positives (as abstraction-based model checking already does), our prototype is able to automatically produce feasible counterexamples with only a few exceptions. Furthermore, the process runs with acceptable execution times, without requiring any other knowledge of the specification, and without tampering with the original C programs.
DICTATE: DIstributed CerTification Authority with probabilisTic frEshness for Ad Hoc Networks
Authors: Jun Luo, Jean-Pierre Hubaux, Patrick T. Eugster
Venue: IEEE Transactions on Dependable and Secure Computing (2005)

Securing ad hoc networks is notoriously challenging, notably due to the lack of an online infrastructure. In particular, key management is a problem that has been addressed by many researchers but with limited results. In this paper, we consider the case where an ad hoc network is under the responsibility of a mother certification authority (mCA). Since the nodes can frequently be collectively isolated from the mCA (e.g., for a remote mission) but still need the access to a certification authority, the mCA preassigns a special role to several nodes (called servers) that constitute a distributed certification authority (dCA) during the isolated period. We propose a solution, called DICTATE (DIstributed CerTification Authority with probabilisTic frEshness), to manage the dCA. This solution ensures that the dCA always processes a certificate update (or query) request in a finite amount of time and that an adversary cannot forge a certificate. Moreover, it guarantees that the dCA responds to a query request with the most recent version of the queried certificate in a certain probability; this probability can be made arbitrarily close to 1, but at the expense of higher overhead. Our contribution is twofold: 1) a set of certificate management protocols that allow trading protocol overhead for certificate freshness or the other way around, and 2) a combination of threshold and identity-based cryptosystems to guarantee the security, availability, and scalability of the certification function. We describe DICTATE in detail and, by security analysis and simulations, we show that it is robust against various attacks.
Matrix-based component dependence representation and its applications in software quality assurance
Authors: Bixin Li, Ying Zhou, Yancheng Wang, Junhui Mo
Venue: ACM SIGPLAN Notices (2005)

Component dependence analysis is a useful technique that has many applications in software engineering activities including software understanding, testing, debugging, maintenance, and evolution. In this paper, we propose a matrix-based representation to analyze dependences in component-based system (CBSs). By further investigating the application of matrix in analyzing dependences of component-based system, we find that it has many applications in software quality assurance. To make it possible, we first identify all types of dependences in a CBS, and then present a dependence-based representation called the component dependence graph (CDG) and the dependence matrix (DM) to explicitly represent these dependences in a CBS. Based on the CDG and DM, we build a mathematical basis for managing and analyzing dependences in a CBS. Finally, we discuss some important applications of the dependence analysis technique in component-based software quality assurance, such as understanding, testing, maintenance, and evolution etc.
Table Structure Analysis Based on Cell Classification and Cell Modification for XML Document Transformation
Authors: Yasuto ISHITANI, Kosei FUME, Kazuo SUMITA
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

A new method of table structure analysis based on cell classifi- cation and cell modification is proposed in this paper as the basis of an OCR which can convert a variety of printed tables into XML documents in accordance with a specified XML schema. The outline of this method is described as follows. Firstly, cell features de- fined by ruled lines, which correspond to data fields, are extracted from the input image of a table. After that, each cell is classified to identify the irregular table whose ruled lines are not gridded and is modified to form regular cell arrangement. Next, the hierarchical table structure consisting of a regular row structure of cells is extracted from the modified regular table and is described using a DOM tree. In this case, logical objects within a cell are extracted and are converted into a sub-tree in the DOM tree. Finally, this DOM tree is transformed into a target XML document by an XML parser with information extraction process. Experimental results show the method is effective in transforming various printed tables to various XML documents.
Information Foraging with a Proximity-Based Browsing Tool
Authors: C. Hoare, H. Sorensen
Venue: Artificial Intelligence Review (2005)

This paper describes a user friendly, powerful information foraging tool. Document sets are presented through combinations of traditional ranked lists and 2-dimensional proximity-based visualisations, created by uniting graph-theoretic clustering and force-directed layout techniques, where article positions are determined by inter-document similarities. By using Gestalt principles and information encoding, the simple layout improves search efficiency by leveraging human cognitive strengths that have generally been under-utilised in commercial GUI development. In this paper, design and realisation of the layout technique are described in the context of an article browsing framework. Results of an indicative comparative laboratory study, which evaluates the client application --- and in particular Graph-Theoretic Force-Directed (GTFD) visualisations against traditional search engine interfaces --- are then presented. This study demonstrates the advantage of graphical presentations when browsing an article collection. Finally, potential improvements identified during the study are discussed, as are future directions for this approach to collection browsing
On the Variable Capacity Property of CC/DS-CDMA Systems
Authors: Li-Peng Wang, Yang Yang, Hsiao-Hwa Chen, Yong-Hua Song
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

Complete complementary code based direct sequence code division multiple access (CC/DS-CDMA) system has been proposed recently as a potential candidate for beyond the third generation (B3G) mobile communications. This paper addresses the issue on variable capacity property (VCP) of a CC/DS-CDMA system with multiple time slots, pertaining to the multi-rate channel assignment schemes of a CC/DS-CDMA system. In particular, three traffic classes and two dynamic code flock assignment schemes, namely random assignment (RA) and compact assignment (CA), are considered in our study. Simulation results of blocking probability, mean and variance of system capacity, and throughput under different schemes are derived and compared. It is concluded that the VCP of CC/DS-CDMA systems is sensitively affected by different code flock assignment schemes. In general, CA can offer lower blocking probability and more stable system capacity; whereas RA can offer larger mean system capacity and higher throughput when offered traffic is heavy.
Coherence Maintenances to realize an efficient parallel processing for a Cache Memory with Synchronization on a Chip-Multiprocessor
Authors: Akira Yamawaki, Masahiko Iwane
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

A chip-multiprocessor is one of the promising architectures that can overcome the ILP limitation, high power consumption and high heating that current processors face. On a shared memory multiprocessor, a performance improvement relies on an efficient communication and synchronization method via shared variables. The TSVM cache combines communication and synchronization with the coherence maintenance on a chip-multiprocessor. That is, the communication and synchronization via shared variables are realized by one coherence transaction through a high- speed on chip inter-connection. The TSVM cache provides several instructions that each instruction has the individual coherence maintenance scheme. The combinations of these instructions can realize the producer-consumers synchronization, mutual exclusion and barrier synchronization with communication easily and systematically. This paper describes how those instructions construct three primitives and shows effect of these primitives using a clock cycle accurate simulator written in VHDL. The result shows that the TSVM cache can improve a performance of 9.8 times compared with a traditional cache memory, and improve a performance of 2 times compared with a conventional cache memory with synchronization mechanism.
A Transparent and Evolvable Licensing Object Service
Authors: Karim El Guemhioui, Aymeric Nys
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

If we put aside any controversy that could surround the issue of licensing a piece of software, we are faced with actual technical problems to solve in order to regulate the use of protected software in a non-intrusive way. A licensing service allows software producers to control the access and use of their products, and enables the customers to pay only for the software functionalities they use. In this paper we present a CORBA licensing service that is transparent to the end-users and that can easily evolve to adapt to changing licensing policies. Design and implementation issues are discussed. Experimental results are provided.
A Criticality Analysis of Clustering in Superscalar Processors
Authors: Pierre Salverda, Craig Zilles
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

Clustered machines partition hardware resources to circumvent the cycle time penalties incurred by large, monolithic structures. This partitioning introduces a long inter-cluster forwarding latency and the potential for load imbalance, both of which degrade IPC and thus counter the cycle time benefits of clustering. We show that program dataflow can be mapped to clustered machines so as to achieve an IPC rivaling that of an equivalent monolithic machine. That is, the IPC penalties observed by extant schemes are largely an artifact of instruction steering and scheduling policies. Using critical path analysis, we investigate and uncover the main causes for this performance loss. By way of code samples, we illustrate those causes and propose three policies for mitigating them. First, we introduce a new metric, likelihood of criticality, and show how it can halve the performance lost to contention-induced stalls. Second, we develop a stall-over-steer policy that addresses performance lost to inter-cluster forwarding delay. Finally, we show that a proactive load-balancing policy is necessary to improve the distribution of ready instructions among the clusters. Together, these three policies yield performance on 2-, 4- and 8-cluster implementations of an 8-wide machine that is within 2, 4, and 6%, respectively, of the monolithic equivalent.
Parametrical Regulation of Market Economy Mechanisms
Authors: A. Ashimov, Yu. Borovskiy, As. Ashimov
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

The development of economic processes, within the frameworks of legislatively (normatively) established "game rules" adjusting attitudes (mechanisms of interaction) between the agents (enterprises, resources suppliers, and consumers), is appreciably defined by values of such economic parameters, as various tax rates, government spending , credit rates, norm of reservation, exchange rate, etc. The specified parameters frequently vary depending on an economic conjuncture and ways of an estimation their effective values are often unknown.
The effect of a university information security survey on instruction methods in information security
Authors: Frank H. Katz
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

This paper reports on the need for Information Security Awareness educational programs to supplement teaching in Information Security. The need for such a program is demonstrated by findings resulting from a survey of university faculty and staff at Armstrong Atlantic State University conducted from February through April 2005 regarding the information security behaviors of such employees.
Intelligent Aggregation of Purchase Orders in e-Procurement
Authors: Guijun Wang, Stephen Miller
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

A large enterprise generates millions of Purchase Orders (PO) each year buying various types of goods and services. Each PO has a cost associated with it. This cost comprises multiple elements including the price of the good or service, the shipping and handling of the purchase, and the overhead in initiating, generating, tracking, and managing the PO. To reduce the cost of doing business, it is imperative to reduce the total cost of POs in enterprise e-Procurement in an automated fashion. One way to reduce enterprise procurement cost is to aggregate demands so that the total cost of a bunch of POs will be reduced by a better price, a lowered shipping and handling fee, and a reduced overhead. The cost of goods and services often depend on several factors including volume, timing, and other business objectives. This paper describes an Intelligent Aggregation approach for automatically aggregating demands to reduce procurement cost in enterprise e-Procurement. Our aggregation approach for e-Procurement consists of an information model for representing products (goods or services) and representing purchase orders for such products, a corporate agreement system, a negotiation engine, and a rule-based aggregation engine. The information model is based on an extension of the classic Entity-Relationship model. The extension enables association of rules and constraints with and among attributes. These rules and constraints must be satisfied during PO aggregation and thus ensure the aggregate PO to be consistent with original individual POs. A rule-based aggregation engine examines POs as they arrive and interact with other decision aids to determine whether aggregation of a particular bunch of POs makes any business sense. Aggregation can happen in two business scenarios, one for POs constrained by existing corporate agreements and another for POs to be refined by online negotiations. The aggregation engine interacts with a corporate agreement system to obtain supplier policies in the first scenario. For the second scenario, it interacts with the negotiation engine to obtain supplier¿s policies during iterations of the negotiation process. Relevant policies are those that define product pricing, shipping and handing, and post-sale services as well as warranties and returns. Examples are given to demonstrate how automated intelligent aggregation of purchases is performed and how it reduces cost in enterprise e- Procurement.