ppxscal/embedding_network huggingface dataset:
ID-based password authentication scheme using smart cards and fingerprints
Authors: Hyun-Sung Kim, Sung-Woon Lee, Kee-Young Yoo
Venue: ACM SIGOPS Operating Systems Review (2003)

This paper proposes two ID-based password authentication schemes, which does not require a dictionary of passwords or verification tables, with smart card and fingerprint. In these schemes, users can change their passwords freely. For a network without synchronization clocks, the proposed nonce-based authentication scheme can withstand message replay attacks. The proposed two schemes require a system to authenticate each user by each user's knowledge, possession, and biometrics, and this feature makes our schemes more reliable.
Cell histograms versus color histograms for image representation and retrieval
Authors: Renato O. Stehling, Mario A. Nascimento, Alexandre X. Falcão
Venue: Knowledge and Information Systems (2003)

This paper presents a new approach for content-based image retrieval, which is based on the well-known and widely used color histograms. Previous approaches have used a single global color histogram (GCH) for the whole image, or local color histograms (LCHs) for cells within a grid of fixed size. Our approach is also based on a grid of cells, but unlike the latter it uses a cell histogram for each of the colors actually present in the images, representing how that color is distributed among the image cells - hence the name Cell/Color Histograms. Our experiments have shown that the actual number of colors present in images is often low. Thus we are able to achieve performance comparable to using LCHs within a grid, but with a much smaller space overhead. Furthermore, the proposed approach is very flexible in the sense that the user has alternative ways to calibrate the trade-off between space overhead and retrieval effectiveness. In fact, we have been able to outperform GCHs (typically a compact representation) in terms of effectiveness requiring less storage space.
A new synthesis technique for multilevel combinational circuits
Authors: L. Diaz-Olavarrieta, S. G. Zaky
Venue: Proceedings of the conference on European design automation (1990)

A conceptually simple method for multilevel synthesis of combinational functions is proposed. The method can take advantage of the availability of different gate types, including XOR, with the synthesis decisions being easily correlated to the topology of the circuit obtained. A function is synthesized using a cascade of mapping stages, which transform the function into one that is trivial to implement, called the goal function. The goal function---usually simple---is selected at the outset, then used to guide the definition of the transformations to be implemented by the mapping stages. The resulting circuits are well suited for CMOS implementations and are shown to be easily and/or robustly testable for stuck-open faults. Finally, from a sample of small functions, preliminary results indicate that the resulting circuits are of comparable size to those obtained by conventional minimization techniques. Further work is needed to compare these results to those of existing multilevel synthesis algorithms.
Interconnect width selection for deep submicron designs using the table lookup method
Authors: Mandeep Bamal, Evelyn Grossar, Michele Stucchi, Karen Maex
Venue: Proceedings of the 2004 international workshop on System level interconnect prediction (2004)

Interconnect width sizing is critical in deep submicron designs to reduce the overall delay. In this paper we present an algorithm for optimal interconnect width selection from a predetermined and precharacterized wire width metric. This algorithm uses a 4-dimensional lookup table approach based on "O'Brien, Savarino" π model for the interconnect load. This methodology can easily be integrated into the existing design tools since this methodology lies in the middle of the postplacement and prerouting step of the physical design flow. We will explore a trade-off between delay and power dissipation for different widths and a comparison will also be made with the ITRS design rules.
Constructive Upper Bounds for the Tur&aacute;n Number
Authors: Ulrich Matthias
Venue: Combinatorics, Probability and Computing (1997)

The Tur&aacute;n Number T(n, k, r) is the smallest possible number of edges in a k-graph of order n such that every set of r vertices contains an edge. The limit***** Insert equation here *****exists, but there is no pair (k, r) with r>k&ge;3 for which this function could be determined as yet. We give a constructive proof of the upper bound***** Insert equation here *****for every k and r with r&ge;k&ge;2. In the case k=6, r=11 we improve this result, refuting thereby a conjecture of Tur&aacute;n.
Queueing analysis of relational operators for continuous data streams
Authors: Qingchun Jiang, Sharma Chakravarthy
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Currently, stream data processing is an active area of research, which includes everything from algorithms and architectures for stream processing to modelling, and analysis of various components of a stream processing system. In this paper, we present an analysis of relational operators used for stream processing using queueing theory and study behaviors of streaming data in a query processing system. Our approach enables us to compute the fundamental performance metrics of relational operators ---select, project, and join over data streams. Furthermore, this approach establishes a way to find the probability distribution functions of both the number of tuples and the waiting time of tuples in the system. Finally, we designed and implemented a number of experiments to validate the accuracy and effectiveness of our analysis.
Delay-constrained three-dimensional graphics streaming over lossy networks
Authors: Ghassan Al-Regib
Venue:  (2003)

The objective of this thesis is to deliver high-quality 3-D graphics to the clients with minimum end-to-end delay. This research proposes an end-to-end 3-D streaming system that is scalable with respect to network behavior. Current multimedia streaming techniques are limited to voice, image or video sequences. 3-D models have different content properties and therefore new streaming techniques need to be developed that are specially tailored for 3-D models. Similarly, current 3-D streaming systems are limited to progressive compression and data partitioning and these techniques are not scalable with respect to channel behavior. The proposed end-to-end transmission system combines (i) 3-D model properties, (ii) application-layer functionalities such as forward error correction (FEC) codes and multiple description codes (MDC), and (iii) network-layer functionalities such as re-transmission in order to minimize the expected the distortion in the decoded model or to minimize the end-to-end delay. The proposed research achieves error-resiliency by using unequal error protection. Some parts of the transmitted bitstream are more important than other parts and hence more error-protection bits are assigned to these important segments of the bitstream. Preliminary results show a graceful degradation in the decoded 3-D model quality, as the packet loss rate increases, compared to treating all parts of the bitstream equally. We further propose a bit-allocation algorithm that distributes the bit budget between geometry precision, tessellation density, and error protection bits. Finally, we propose a novel transport protocol especially designed for 3-D models. We call this protocol the 3-D models transport protocol (3TP). In 3TP, we intelligently utilize the transport control protocol (TCP) and the user datagram protocol (UDP) to transmit different parts of the bitstream in order to meet certain distortion constraint while minimizing the end-to-end delay.
Framework development and asset management for software reuse
Authors: Wei-Tek Tsai
Venue:  (2003)

This thesis developed a Unmanned Aerial Vehicles (UAV) system simulation framework for UAV system wide simulation. Following issues are examined: UAV system modeling, simulation strategies, simulation framework development. Desired simulation framework properties include: simulate of single vehicle, simulate of multiple vehicles, simulate the vehicle mix, support execution time reconfiguration and randomization etc. A simulation framework is developed to demonstrate how different simulation strategies can be supported using the same framework, and a real simulation application is developed using the framework to demonstrate both design and execution time extensions. As an example, using the framework a collection detection algorithm was successfully evaluated. The second part of the thesis focuses on asset management system for software reuse. Asset management system (AMS) refers to the process and infrastructure to support the development, usage and maintenance of reusable software assets. Establishing an asset repository and providing effective development support for engineers to reuse assets in the repository are the two major activities involved. This thesis examined other issues such as asset content model, asset integration, reuse strategy, repository structure, and management issues, and also developed the following services/criteria for effective AMS: up-to-date content, dynamic content integration, change impact analysis, asset usage and difference analysis, personalized service, and quality assurance. This thesis also proposed a design for an Internet-based AMS that is capable of supporting a large number of assets with continuous update and accessible to a large number of engineers. This design was implemented to facilitate software reuse in a medical device company. (Abstract shortened by UMI.)
Modeling Complex Systems by A Set of Interacting Finite-State Models
Authors: Sukhamay Kundu
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

We present here a new way of modeling a complexsystem by a number of finite-state components whichwork together by transferring control among them in afashion similar to the usual function-calls, includingrecursive calls. This gives us a simpler modeling techniquethan statecharts, which are often too complex forgeneral users. The new technique also helps to keep thenumber of states small as in statecharts. We define thesemantics of an interacting family of finite-state modelsin terms of their behavior-trees. As an elegant applicationof finite-state modeling, we present a maximallyefficient controller design for a tree-structured set oftasks in a reactive system by taking advantage of thecommon computations among the tasks.
Maximum-Sized Matroids with No Minors Isomorphic to U2,5, F7, F&minus;7 or P7
Authors: Stefan T. Mecay
Venue: Combinatorics, Probability and Computing (2001)

Let &Mscr; be the class of simple matroids which do not contain the 5-point line U2,5, the Fano plane F7, the non-Fano plane F&minus;7, or the matroid P7 as minors. Let h(n) be the maximum number of points in a rank-n matroid in &Mscr;. We show that h(2) = 4, h(3) = 7, and h(n) = (n+12) for n &ge; 4, and we also find all the maximum-sized matroids for each rank.
An Extended Policy Language for Role Resolution in Project-Oriented Workflow
Authors: Xiaoguang Zhang, Jian Cao, Shensheng Zhang
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

[1] defines a SQL-like language to specifyorganizational policies (or constraints) in workflowsystems. Three types of policies are studied includingqualification, requirements and substitution policies.However, they can't handle complex role resolution, suchas Separation Of Roles and Binding of Roles, and severalexception situations, such as Role Delegation and RoleUnavailable. Furthermore, from the perspective ofproject-oriented workflow, a project and its sub-projectscan be under the charge of teams (or virtual teams). Theteams should satisfy the role resolution of the projectsmanaged by the team. To support the above requirements,based on team-enabled organization model, (1) we extendthe policy language defined in [1] to support roleresolution in project-oriented workflow, (2) provide itsmodeling and enforcement mechanism, and (3) proposethe rules to guarantee the correctness and optimization ofpolicy repository.
Wireless network performance analysis for adaptive bandwidth resource allocations
Authors: Abdel-Latif Ibrahim Semeia
Venue:  (2003)

With the rapid development in mobile communications and the emergence of various multimedia applications, it becomes more important that wireless networks satisfy appropriate quality-of-service (QoS) requirements. Call admission control (CAC) is an essential network management tool in wireless communications networks. It is used to provide improved network utilization and to guarantee QoS. The fundamental problem is how to allocate network resources to different users within QoS constraints. Adaptive bandwidth call admission control can be used to improve network utilization and maintain the QoS requirements. In this dissertation we propose adaptive bandwidth call admission control with dynamic recourse allocation schemes which can be implemented in wireless multimedia network. The proposed schemes differentiate the QoS requirements of each call and prioritize handoff call requests over new call requests. Buffering call requests (handoff or new call) using a multi-queue mechanism has been also proposed to reduce blocking and dropping probabilities when the system is fully utilized (all channel are occupied). The performance analyses of the proposed schemes shows significant enhancements in comparison with the well known handoff prioritization scheme (guard channel scheme). The adaptation problem is also formulated as a three-dimension Markov chains under general adaptability conditions with different service times. The steady state transition probability, the new call blocking probability and the handoff dropping probability formulas are presented.
Probabilistic User Behavior Models
Authors: Eren Manavoglu, Dmitry Pavlov, C. Lee Giles
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We present a mixture model based approach for learningindividualized behavior models for the Web users. Weinvestigate the use of maximum entropy and Markov mixturemodels for generating probabilistic behavior models.We first build a global behavior model for the entire populationand then personalize this global model for the existingusers by assigning each user individual componentweights for the mixture model. We then use these individualweights to group the users into behavior model clusters.We show that the clusters generated in this manner areinterpretable and able to represent dominant behavior patterns.We conduct offline experiments on around two monthsworth of data from CiteSeer, an online digital library forcomputer science research papers currently storing morethan 470,000 documents. We show that both maximum entropyand Markov based personal user behavior modelsare strong predictive models. We also show that maximumentropy based mixture model outperforms Markov mixturemodels in recognizing complex user behavior patterns.
Equistable series-parallel graphs
Authors: Ephraim Korach, Uri N. Peled
Venue: Discrete Applied Mathematics (2003)

A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We characterize those series-parallel graphs that are equistable, generalizing results of Mahadev et al. about equistable outer-planar graphs.
Secure evaluation of xml queries
Authors: Divesh Srivastava
Venue:  (2003)

The rapid emergence of XML as a standard for data exchange over the Web has led to considerable interest in the problem of securing XML documents. This thesis focuses on the simple, but useful, multi-level access control model, where a security level can be either specified at an XML element, or inherited from its parent. Query evaluation engines need to ensure that user queries use and return only XML data the user is allowed to access. Secure query evaluation is possible by rewriting the query to use a recursive function that computes an element's security level. These added access control checks can considerably increase query evaluation time. Based on security information in the DTD, efficient algorithms that determine when the recursive check can be eliminated or simplified to a local check on the element's attributes are devised. This thesis experimentally evaluates the performance benefits of these techniques using a variety of XML data and queries. To efficiently provide secure access to XML data, a family of index structures is developed, which it is referred to as security indices, obtained by enhancing R-tree indices with security levels for XML elements. The straightforward index that annotates each XML element with its (explicitly specified an inherited) security level has a very high update cost for modifying the security level of an XML element. An improved index makes explicit use of the multi-level access control model to reduce the cost of update an element's security level. Efficient algorithms for update are developed. The thesis shows experimentally that this reduced update cost can be achieved without increasing query access cost. Finally, a prototype LockX is developed, which implements the idea of secure optimization for specifying access control policies and securely querying XML documents. LockX demonstrates access control specification, enforcement, and explanation features.
Classifying approaches to semantic heterogeneity in multidatabase systems
Authors: Jianchun Zhang
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2 (1992)

A multidatabase system (MDBS) is a collection of preexisting database systems that are autonomous and possibly heterogeneous. The MDBS has developed because of a need to manage and retrieve data from multiple databases within a single application. In this paper, a classification of multidatabases, their corresponding architectures, and their methods for dealing with heterogeneity are proposed. Through the detailed examples, we argue that the methodologies used multidatabase systems to solve schema conflicts and determine semantic equivalences among different objects should be application-dependent.
Terminology-driven mining of biomedical literature
Authors: Goran Nenadić, Irena Spasić, Sophia Ananiadou
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

In this paper we present an overview of an integrated framework for terminology-driven mining from biomedical literature. The framework integrates the following components: automatic term recognition, term variation handling, acronym acquisition, automatic discovery of term similarities and term clustering. The term variant recognition is incorporated into terminology recognition process by taking into account orthographical, morphological, syntactic, lexico-semantic and pragmatic term variations. In particular, we address acronyms as a common way of introducing term variants in biomedical papers. Term clustering is based on the automatic discovery of term similarities. We use a hybrid similarity measure, where terms are compared by using both internal and external evidence. The measure combines lexical, syntactical and contextual similarity. Experiments on terminology recognition and structuring performed on a corpus of biomedical abstracts are presented.
Compiling lazy functional programs for the Java Virtual Machine
Authors: David Wakeling
Venue: Journal of Functional Programming (1999)

In this paper, we show how lazy functional programs can be compiled for the Java Virtual Machine using a mapping between a version of the &lang;v, G&rang;-machine and the Java Virtual Machine. This mapping is elegant &ndash; the description is entirely straightforward &ndash; and efficient &ndash; using it, both code size and execution speed are of the same order of magnitude as those obtained with a traditional functional language bytecode interpreter. In future, our work could serve as the basis of an interface between Haskell and Java.
Analysis of Prioritized Scheduling of Assured Forwarding in DiffServ Architectures
Authors: Nzinga D. Kiameso, Hossam Hassanein, Hussein T. Mouftah
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Assured Service has been proposed within theDifferentiated Services (DiffServ) model to providerelative service differentiation by attempting toallocate bandwidth to different users in a controlledway during periods of network congestion. In thispaper, we analyze the Assured Service scheme bymeans of a priority queueing system with state-dependentservice scheduling based on thresholds.We consider the case of two classes of priority, carryout a mathematical analysis and numerically obtainthe average delay endured by packets in each priorityclass and the loss probability for each class. Toquantify the gain obtained under our threshold-basedpriority scheme over static priority based schemes,we also study the Priority Scheduling and WeightedFair Queuing models, and compared our results withthe ones obtained using these two models.
Support of Java API for the jHISC system
Authors: Gary K. W. Hau, Anthony Fong, Mok Pak Lun
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

This paper presents the evolution and improvement of the Java API (Application Programming Interface) for Java which used in jHISC Runtime Environment. The jHISC Running Environment is an object-based, single addressing execution environment, specially designed for running object-oriented programming languages such as Java. The jHISC core is a HISC-architecture processor created for executing Java programs. The jHISC API is designed for object-oriented systems to support object model inside jHISC. The jHISC API includes elemental objects such as jhisc.Object, jhisc.Integer and few redesigned objects such as jhisc.util. Vector, jhisc.util. Hashtable. The jHISC API is developed in order to take advantage of using jHISC core and provides a hardware support delegate function in the system.
A soft computing approach for task contracting in multi-agent manufacturing control
Authors: Guido Maione, David Naso
Venue: Computers in Industry (2003)

This paper describes a new task-contracting schema for multi-agent manufacturing control based on soft computing. It aims to apply fuzzy techniques to implement a real-time multi-criteria task-contracting mechanism for part flow control in manufacturing floor. For comparison purposes, the paper also considers other recently proposed evolutionary strategies to adapt and optimize agents' decision parameters to the changing conditions of the manufacturing floor. All the considered approaches are compared on a detailed simulation model of a hypothetical manufacturing system that was recently proposed in literature as benchmark for multi-agent control systems.