ppxscal/embedding_network huggingface dataset:
Prototype of the Evaluation Framework for Functional Requirements of RE-tools
Authors: Raimundas Matulevicius
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

For a complex activity like requirement engineering (RE), a powerful tool support is clearly useful. However, the mainstream of RE practice relies on office tools rather than targeted RE-tools (e.g. DOORS, CaliberRM, and RequisitePro). One of the reasons for not using RE-tools remains the difficulty to assess them before acquiring to organisation. The general COTS (commercial off-the-shelf) selection approaches are criticised for labour-intensive activities to define the evaluation criteria. Only few approaches are followed with some limited software tool support. Nor the approaches neither the tools are targeted towards the RE-tool domain; therefore, their applications are time consuming and domain knowledge demanding. Furthermore, the existing REtool frameworks list only RE-tool requirements which in most cases are development-oriented, and not supported by the application for the RE-tool evaluation. Frameworks¿ terminology is not defined and could mislead if several users are applying them.
Understanding and developing role-based administrative models
Authors: Jason Crampton
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

Access control data structures generally need to evolve over time in order to reflect changes to security policy and personnel. An administrative model defines the rules that control the state changes to an access control model and the data structures that model defines. We present a powerful framework for describing role-based administrative models. It is based on the concept of administrative domains and criteria that control state changes in order to preserve certain features of those domains. We define a number of different sets of criteria, each of which control the effect of state changes on the set of administrative domains and thereby lead to different role-based administrative models. Using this framework we are able to identify some unexpected connections between the ARBAC97 and RHA administrative models and to compare their respective properties. In doing so we are able to suggest some improvements to both models.
Review of "Statistical Distributions in Scientific Work, by G. P. Patil, S. Kotz and J. K. Ord"
Venue: ACM SIGSIM Simulation Digest (1976)

This is a collection of papers presented at a NATO advanced Study Institute, "The International Conference on Characterizations and Statistical Distributions with Applications." The ASI was held at the University of Calgary, Canada 29 July - 10 August 1974 under the direction of Dr. Patil. It was sponsored by the International Statistical Institute, Pennsylvania State University, University of Calgary and the Indian Statistical Institute with the support of NATO, the National Research Council of Canada and the U.S. Army Research Office. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Pattern Classification with Incremental Class Learning and Hidden Markov Models
Authors: Filip Lukaszewski, Konrad Nagorko
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Incremental Class Learning - Hidden Markov Models (ICL-HMM) system combines two different approaches adopted in pattern recognition area to form a new, robust solution. Our system is composed of two parts - ICL feature extractor and HMM sequence recognizer. The former, ICL, is an artificial neural network capable of incrementally learning to recognize features of patterns from a narrow window sliding over them. HMMs simulate systems that transfer from one hidden state to another. In every state the system generates some observations. In our system we train one HMM for every class of patterns by presenting to it the sequences of observations generated by ICL for patterns belonging to its class. In the testing phase, every HMM checks how well it models the sequence of observations generated for an unknown pattern. We present promising results of applying ICL-HMM system to printed Latin character recognition task.
Performance Evaluation of Dynamic Network Reconfiguration Using Detour-UD Routing
Authors: Tsutomu Yoshinaga, Yasuhiko Nishimura
Venue: Proceedings of the Innovative Architecture on Future Generation High-Performance Processors and Systems (2005)

Fault-tolerance is an emerging issue for massively parallel computers. This paper describes the performance impact of dynamic network reconfiguration protocols using a fault-tolerant, adaptive deadlock-recovery routing algorithm, Detour-UD, for k-ary n-cubes. We propose a scheme to specify unroutable packets by managing drain-flags in routing tables. We also propose two selective drainage protocols. One protocol drains the unroutable packets specified by the drain-flags after the reconfiguration process. The other protocol drains deadlocked packets to reduce the network load during the reconfiguration process. Our simulation results show that the first protocol helps reduce the number of drainage packets, and the second one keeps the network through-put during the reconfiguration process.
Sales order processing: a simulation model
Authors: Haluk Bekiroglu
Venue: ACM SIGSIM Simulation Digest (1977)

GPSS simulation of the customer order processing through the warehouse containing packaged items at a large chemical plant in St. Louis, Missouri, is described. Objective is to determine the service rate on a certain type of order and by varying the number of warehouse personnel at key positions to obtain comparison service rates for management review.
Improving Transition Delay Fault Coverage Using Hybrid Scan-Based Technique
Authors: Nisar Ahmed, Mohammad Tehranipoor
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

This paper presents a hybrid scan-based transition delay fault test. The proposed technique controls a small subset of scan cells by launch-off-shift method and the rest by launch-off-capture method. An efficient ATPG-based controllability measurement approach is proposed to select the scan cells to be controlled by launch-off-shift or launch-off-capture. In this technique, local scan enable signals are generated on-chip using two local scan enable generator cells. The cells can be inserted anywhere in a scan chain and the area overhead is negligible. The launch and capture information of scan enable signals are transferred into the scan chain during scan-in process. Our technique improves the fault coverage and reduces the pattern count and the scan enable design effort. The proposed hybrid technique is practice-oriented and implemented using current commercial ATPG tools.
IAM-OnDB - an On-Line English Sentence Database Acquired from Handwritten Text on a Whiteboard
Authors: Marcus Liwicki, Horst Bunke
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper we present IAM-OnDB - a new large online handwritten sentences database. It is publicly available and consists of text acquired via an electronic interface from a whiteboard. The database contains about 86 K word instances from an 11 K dictionary written by more than 200 writers. We also describe a recognizer for unconstrained English text that was trained and tested using this database. This recognizer is based on Hidden Markov Models (HMMs). In our experiments we show that by using larger training sets we can significantly increase the word recognition rate. This recognizer may serve as a benchmark reference for future research.
Problem Solving Environment Based on Grid Services: NAREGI-PSE
Authors: Hiroyuki Kanazawa, Motohiro Yamada, Yutaka Miyahara, Yoshikazu Hayase, Shigeo Kawata, Hitohide Usami
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

In this paper, we describe a problem solving environment (PSE) for Grid computing called NAREGI-PSE in the NAREGI (National Research Grid Initiative) project, conducted by MEXT (Ministry of Education, Culture, Sports, Science and Technology) of Japan. NAREGI-PSE is researched and developed to support the scientists.. works for scientific computer simulations on distributed Grid computers. NAREGIPSE tells users which computers are available and appropriate for their specific application simulation programs by using the hardware and software information specified, when the users access and use distributed high-performance computers for scientific simulations. The simulation programs are plugged and pooled in the NAREGI-PSE application pool in order to enhance their re-usability and to share the knowledge (applications and their information) for real-time collaborations in research communities on VOs (virtual organizations).
PorKI: Making User PKI Safe on Machines of Heterogeneous Trustworthiness
Authors: Sara Sinclair, Sean W. Smith
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

As evidenced by the proliferation of phishing attacks and keystroke loggers, we know that human beings are not wellequipped to make trust decisions about when to use their passwords or other personal credentials. Public key cryptography can reduce this risk of attack, because authentication using PKI is designed to not give away sensitive data. However, using private keys on standard platforms exposes the user to "keyjacking"; mobile users wishing to use keypairs on an unfamiliar and potentially untrusted workstation face even more obstacles. In this paper we present the design and prototype of PorKI, a software application for mobile devices that offers an alternative solution to the portable key problem. Through the use of temporary keypairs, proxy certificates, and wireless protocols, PorKI enables a user to employ her PKI credentials on any Bluetoothenabled workstation, including those not part of her organization's network, and even those that might be malicious. Moreover, by crafting XACML policy statements that limit the key usage to the workstation's trustworthiness level, and inserting these statements into extensions of the proxy certificates, PorKI provides the user or the relying party with the ability to limit the amount of trust that can be put in the temporary keypair used on that workstation, and thus the scope of a potential compromise.
Sigma-Delta Noise Shaping for Digital-to-Frequency and Digital-to-RF-Amplitude Conversion
Authors: Robert Bogdan Staszewski, Sameh Rezeq, Chih-Ming Hung, Patrick Cruise, John Wallberg
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

In this paper, we describe a new architecture of high-speed multibit Ó. noise shaping for digital-to-frequency conversion (DFC) and digital-to-RF-amplitude conversion (DRAC). The DFC and DRAC are instrumental in performing phase modulation (PM) and amplitude modulation (AM) of an RF polar transmitter. Since current biasing and continuous-time analog filtering of a conventional transmit modulator are avoided in this all-digital architecture, it is amenable to large-scale integration in an SoC realized in a digital deep-submicron CMOS process. The approach is demonstrated in the first single-chip fully-compliant GSM/EDGE transceiver realized in 90-nm CMOS.
Full Nuclear Cones and a Relation Between Strong Optimization and Pareto Efficiency
Authors: G. Isac, Vasile Postolică
Venue: Journal of Global Optimization (2005)

In this paper we present some new and pertinent connections between the Strong Optimization and the Approximate Pareto type Efficiency, in particular, with the usual Vector Optimization, at first in the Ordered Vector Spaces by the natural Convex Cones and, afterwards, in the Ordered Hausdorff Locally Convex Spaces. The main result is obtained considering the notion of full nuclear cone. Our results, is related to an appropriate scalarization method
On-line methods for database optimization
Authors: Lipyeow Lim
Venue:  (2004)

Databases and information retrieval systems storing data from the World Wide Web require new optimization strategies to deal with the different types of data (textual, semi-structured and relational), the massiveness of the data, and the dynamic nature of the data. This dissertation investigates on-line methods for the optimization of databases storing web data. On-line methods avoid access to the underlying data, avoid the rebuilding of data structures from scratch, and adapt to changes in the data and query workload characteristics. On-line techniques are therefore especially suited to web data. In this dissertation, we present on-line techniques for two general problems: how to update inverted indexes and how to estimate the selectivity or result size of queries in database systems. For the index update problem, we present the landmark-diff method for updating the inverted index in response to changes in previously indexed documents. The landmark-diff method allows indexes to be updated incrementally without a complete rebuild. For selectivity estimation, we propose three on-line techniques that address the selectivity estimation problem in three different context. In the context of relational databases, we present SASH, a Self-Adapting Set of Histograms, that uses probabilistic graphical models to address the following issues in an on-line manner: which sets of attributes to build histograms on, how to build these histograms without looking at data, and how much memory should be allocated to these histograms. For XML native databases, we present XPathLearner, an on-line workload-aware method for estimating the result size of given XPath queries. XPathLearner learns the path statistics from query feedback (past query answers) in an on-line manner, and adapts itself to changes in the data and the query workload characteristics. In a more general context, we present CXHist, an on-line classification based histogram for estimating the selectivity of a broad class of queries. CXHist models queries instead of data and stores the mapping between queries and their selectivity using a naive Bayesian classifier. We show that CXHist is very accurate in estimating the selectivity of exact match and substring predicates on leaf values reachable by a given XPath in XML databases.
Device Logic and Program Structures in Mixed Reality Simulation Environment
Authors: Bjorn Eisen, Marc Jansen, Ulrich Hoppe
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

In the "Smart Planets" environment described in this paper, smart objects are used to set up astronomical configurations in a hands-on fashion. The physical configuration is then mapped onto a dynamic simulation environment. Details and the logic of the underlying mapping are explained and analysed.
Analyses of Bounces on Power Distribution Networks Using an Unconditionally Stable Finite-Difference Time-Domain Method
Authors: Bing-Zhong Wang, Zhong-Jun Yu, Wei Shao, Ping-Ping Ding
Venue: IEEE Transactions on Mobile Computing (2006)

An unconditionally stable finite-difference time-domain (US-FDTD) method is utilized for analyzing the bounces on structures of power distribution networks (PDNs), which is a critical issue in the electromagnetic compatibility analysis of mobile devices. The US-FDTD method does not utilize the explicit leapfrog time scheme of conventional FDTD method and can solve problems with fine structures well, such as via, thin material and so on. By using this full-wave method, electromagnetic fields between power/ground plane pairs are analyzed and discontinuities of through-hole vias are taken into account in the modeling of PDNs.
BIOGLYPH: biometric identification in pervasive environments
Authors: Denis V. Popel, Elena I. Popel
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Despite the wide appreciation of biometric principles in security applications, biometric solutions are far from being affordable and available "on demand" anytime and anywhere. Many security biometric solutions require dedicated devices for data acquisition delaying their deployment and limiting the scope. This paper introduces a system developed to identify and authenticate individuals based on their signatures and/or handwriting. The issues of pervasive services are addressed (i) by integrating unique data acquisition and processing techniques which are capable of communicating with a variety of off-theshelf devices such as pressure sensitive pens, mice, and touch pads, and (ii) by using the self-learning database solutions for achieving accurate results. Aiming to show the architecture of a pervasive biometric system, this paper does not go into technical details of methods and structures.
Extended forecast of CPU and network load on computational Grid
Authors: S. Akioka, Y. Muraoka
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

To achieve effective load balancing and a robust Grid environment, extended load forecast for computational resources is increasingly required. Thus, this paper proposes a method of predicting network and CPU load variance within a wide range, from several minutes to over a week. This is the widest range of prediction of the existing algorithms in the load of computational resources for the Grid environment. The distinctiveness of our algorithm is in using seasonal load variation for both load variance and one-step-ahead prediction. We apply seasonal fluctuation in CPU load to network load variation especially for network load variance prediction. Furthermore, the Markov model-based meta-predictor is used for one-step-ahead prediction, which is sensitive to late trends. The results of the experiments demonstrate that our algorithm gives a good curve for expected 8-day-long load variance, and makes accurate one-step-ahead predictions. The mean error rate for one-step-ahead predictions is 9.4% in the case of network load, and 6.2% in the case of CPU load. Moreover, the least mean error rate for wider range forecasts is 5.5% for network load variation, and 3.6% for CPU load variation.
Enabling View-Dependent Stereoscopic Projection in Real Environments
Authors: Oliver Bimber, Gordon Wetzstein, Andreas Emmerling, Christian Nitschke
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

We show how view-dependent image-based and geometric warping, radiometric compensation, and multi-focal projection enable a view-dependent stereoscopic visualization on ordinary (geometrically complex, colored and textured) surfaces within everyday environments. Special display configurations for immersive or semi-immersive AR/VR applications that require permanent and artificial projection canvases might become unnecessary. We demonstrate several ad-hoc visualization examples in a real architectural and museum application context.
Mass Customization Model in Cluster Supply Chain Based on 2P&2BP
Authors: Jizi Li, Chunling Liu
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

With the development of economic globalization, China is becoming one of the most important world manufacture center. Act as an industrial platform, Industrial cluster plays a crucial role and is gradually evolving into a kind of industrial environment in China manufacturing sectors. This paper, from the supply chain perspective, coins a new term 'cluster supply chain' that refer to industrial cluster and tries to explore its systematic structure. And we found, In the process of production, implementation of mass customization in cluster supply chain is more effective and more efficient and easier than in a single supply chain due to its unique driving model ( 2P&2BP: Pull/push/burst power/bottleneck press) rather than conventional pull\push model, under which circumstances, SMEs (small and medium-sized enterprises) in industrial cluster would have chances to extensively participate cooperate with core companies in the form of supply chain, thus changing overriding views that implementation of supply chain management is a patent for big companies.
Dynamic Routing in Large-Scale Service Systems with Heterogeneous Servers
Authors: Mor Armony
Venue: Queueing Systems: Theory and Applications (2005)

Motivated by modern call centers, we consider large-scale service systems with multiple server pools and a single customer class. For such systems, we propose a simple routing rule which asymptotically minimizes the steady-state queue length and virtual waiting time. The proposed routing scheme is FSF which assigns customers to the Fastest Servers First. The asymptotic regime considered is the Halfin-Whitt many-server heavy-traffic regime, which we refer to as the Quality and Efficiency Driven (QED) regime; it achieves high levels of both service quality and system efficiency by carefully balancing between the two. Additionally, expressions are provided for system limiting performance measures based on diffusion approximations. Our analysis shows that in the QED regime this heterogeneous server system outperforms its homogeneous server counterpart.
Evaluating Liveness by Face Images and the Structure Tensor
Authors: K. Kollreider, H. Fronthaler, J. Bigun
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

A technique evaluating liveness in short face image sequences is presented. The intended purpose of the proposed system is to assist in a biometric authentication framework, by adding liveness awareness in a non-intrusive manner. Analysing the trajectories of single parts of a live face reveal valuable information to discriminate it against a spoofed one. The proposed system uses a lightweight novel optical flow, which is especially applicable in face motion estimation based on the structure tensor and a few frames. It uses a model-based local Gabor decomposition and SVM experts for face part detection. An alternative approach for face part detection using optical flow pattern matching is introduced as well. Experimental results on the proposed system are presented.
A Topology-Independent Link Activation Scheduling Framework in Multihop CDMA Packet Radio Networks
Authors: Yi-Sheng Su, Szu-Lin Su, Jung-Shian Li
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In this paper, we study topology-independent link activation transmission scheduling protocols for multihop code-division multiple-access (CDMA) packet radio networks. We focus on quality-of-service (QoS) provisioning for each communication link in mobile environments. An interferencemodel forwirelessmultihop packet radio networks, which ismore practical than that adopted in earlier literature, is considered. Under this interference model, an approach to guaranteeing conflict-free transmission slots in each frame for each communication link is proposed. We then present a topology-independent link activation scheduling framework based on the theory of group divisible (GD) designs. The proposed framework guarantees conflict-free transmission slots in each frame for each communication link by mathematical properties of GD designs. With the proposed framework, we study and evaluate one series of GD design construction. We then propose topology-independent link activation scheduling algorithms based on the results derived. The proposed schemes are designed for different objectives: maximizing the minimum system throughput and minimizing the schedule frame length. Analysis results show that the proposed algorithms outperform previously known schemes.