ppxscal/embedding_network huggingface dataset:
A Trust-Based Context-Aware Access Control Model for Web-Services
Authors: Rafae Bhatti, Elisa Bertino, Arif Ghafoor
Venue: Distributed and Parallel Databases (2005)

A key challenge in Web services security is the design of effective access control schemes that can adequately meet the unique security challenges posed by the Web services paradigm. Despite the recent advances in Web based access control approaches applicable to Web services, there remain issues that impede the development of effective access control models for Web services environment. Amongst them are the lack of context-aware models for access control, and reliance on identity or capability-based access control schemes. Additionally, the unique service access control features required in Web services technology are not captured in existing schemes. In this paper, we motivate the design of an access control scheme that addresses these issues, and propose an extended, trust-enhanced version of our XML-based Role Based Access Control (X-RBAC) framework that incorporates trust and context into access control. We outline the configuration mechanism needed to apply our model to the Web services environment, and provide a service access control specification. The paper presents an example service access policy composed using our framework, and also describes the implementation architecture for the system.
Hydroelectric reservoir optimization in a pool market
Authors: G. Pritchard, A. B. Philpott, P. J. Neame
Venue: Mathematical Programming: Series A and B (2005)

For a price-taking generator operating a hydro-electric reservoir in a pool electricity market, the optimal stack to offer in each trading period over a planning horizon can be computed using dynamic programming. However, the market trading period (usually 1 hour or less) may be much shorter than the inherent time scale of the reservoir (often many months). We devise a dynamic programming model for such situations in which each stage represents many trading periods. In this model, the decision made at the beginning of each stage consists of a target mean and variance of the water release in the coming stage. This decomposes the problem into inter-stage and intra-stage subproblems.
Computer aided evolutionary design for software engineering
Authors: Charles Rich, Richard C. Waters
Venue: Issue 76 (April 1981) (1981)

The purpose of this project is to explore the fundamental principles underlying the design and construction of large software systems, and to construct a prototype computer aided design tool to support this activity.
Data warehouse solutions for CRM
Authors: Oana Muntean
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

A company's most important asset is information. A corporation's ability to compete, adapt and grow in a business climate of rapid change is dependent in large measure on how well the company uses information to make decisions - decisions that also impact partner and customer relationships. Employees throughout organizations need access to information on customers, vendors and suppliers, ultimately transforming data into critical business knowledge. The data warehouse provides a starting point and the data foundation for enabling CRM applications such as customer segmentation, targeted marketing, customer loyalty, profitability analysis, and other forms of combining customer touch points with external data to generate a valuable business asset.
Optimizing neural networks on SIMD parallel computers
Authors: Andrea Di Blas, Arun Jagota, Richard Hughey
Venue: Parallel Computing (2005)

Hopfield neural networks are often used to solve difficult combinatorial optimization problems. Multiple restarts versions find better solutions but are slow on serial computers. Here, we study two parallel implementations on SIMD computers of multiple restarts Hopfield networks for solving the maximum clique problem. The first one is a fine-grained implementation on the Kestrel Parallel Processor, a linear SIMD array designed and built the University of California, Santa Cruz. The second one is an implementation on the MasPar MP-2 according to the ''SIMD Phase Programming Model'', a new method to solve asynchronous, irregular problems on SIMD machines. We find that the neural networks map well to the parallel architectures and afford substantial speedups with respect to the serial program, without sacrificing solution quality.
Hierarchical star: a new two level interconnection network
Authors: Wei Shi, Pradip K. Srimani
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2005)

We propose a new two level interconnection network topology, hierarchical star networks, HSn, that uses the star graphs as building blocks. Two level networks have been previously proposed that use hypercube and its variants as building blocks; it has been shown that these two level networks are superior to the networks, that are used as bnilding blocks, in terms of various performance metrics including diameter, cost, fault tolerance, fault diameter etc. Our results show that the proposed family of hierarchical star networks perform very competitively in comparison to star graphs; in addition, the proposed network outperforms all of the two level hierarchical networks proposed earlier that uses hypercubes (or its variations) as building blocks. Thus, our results further reinforce the notion that the star graphs are strong competitors of hypercubes for large multiprocessor design. We also investigate various topological properties of the network including embedding, mapping of parallel algorithms, fault tolerance and broadcasting algorithms.
inAspect: interfacing Java and VSIPL applications: Research Articles
Authors: Torey Alford, Vijay P. Shah, Anthony Skjellum, Nicholas H. Younan, Clayborne D. Taylor
Venue: Concurrency and Computation: Practice Experience (2005)

In this paper, we discuss the origin, design, performance, and directions of the inAspect high-performance signal- and image-processing package for Java. The Vector Signal and Image Processing Library (VSIPL) community provides a standardized application programmer interface (API) for high-performance signal and image processing plus linear algebra with a C emphasis and object-based design framework. Java programmers need high-performance and&sol;or portable APIs for this broad base of functionality as well. inAspect addresses PDAs, embedded Java boards, workstations, and servers, with emphasis on embedded systems at present. Efforts include supporting integer precisions and utilizing coordinate rotation digital computer (CORDIC) algorithms&mdash;both aimed at added relevance for limited-performance environments, such as present-day PDAs. Copyright &copy; 2005 John Wiley & Sons, Ltd.
The helly property on subfamilies of limited size
Authors: Mitre C. Dourado, Fábio Protti, Jayme L. Szwarcfiter
Venue: Information Processing Letters (2005)

In this work we consider the problem of determining whether a hypergraph has the p-Helly property, when the considered subfamilies are limited by a size k. That is, whether every partial hypergraph with at most k edges is p-Helly. Further, we study the related problem applied to the cliques of a graph. In all cases, depending on the values of p and k, either we show that the problem can be solved in polynomial time, or we describe a NP-hardness proof.
End-to-End Availability Policies and Noninterference
Authors: Lantian Zheng, Andrew C. Myers
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

This paper introduces the use of static information flow analysis for the specification and enforcement of end-to-end availability policies in programs. We generalize the decentralized label model, which is about confidentiality and integrity, to also include security policies for availability. These policies characterize acceptable risks by representing them as principals. We show that in this setting, a suitable extension of noninterference corresponds to a strong,end-to-end availability guarantee. This approach provides a natural way to specify availability policies and enables existing static dependency analysis techniques to be adapted for availability. The paper presents a simple language in which fine-grained information security policies can be specified as type annotations. These annotations can include requirements for all three major security properties: confidentiality, integrity, and availability. The type system for the language provably guarantees that any well-typed program has the desired noninterference properties, ensuring confidentiality, integrity, and availability.
Package level interconnect options
Authors: J. Balachandran, S. Brebels, G. Carchon, T. Webers, W. De Raedt, B. Nauwelaers, E. Beyne
Venue: Proceedings of the 2005 international workshop on System level interconnect prediction (2005)

Scaling enhances intrinsic transistor performance and degrades interconnects. As the technology steps into nanometer era, global interconnects are becoming bottleneck for overall chip performance. In this paper, we show package level interconnects are an effective alternative for on-chip global wiring. These interconnects behave as LC transmission lines and can be exploited for their near speed of light transmission and low attenuation characteristics. We compare performance - bandwidth, bandwidth density, latency and power consumption - of the package level transmission lines with conventional on-chip global interconnects for different ITRS technology nodes. Based on these results, we show package level interconnects are well suited for power demanding low latency applications and we analyze different interconnect options like memory buses, long inter tile interconnects, clock and power distribution.
Activity Recognition and Abnormality Detection with the Switching Hidden Semi-Markov Model
Authors: Thi V. Duong, Hung H. Bui, Dinh Q. Phung, Svetha Venkatesh
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper addresses the problem of learning and recognizing human activities of daily living (ADL), which is an important research issue in building a pervasive and smart environment. In dealing with ADL, we argue that it is beneficial to exploit both the inherent hierarchical organization of the activities and their typical duration. To this end, we introduce the Switching Hidden Semi-Markov Model (S-HSMM), a two-layered extension of the hidden semi-Markov model (HSMM) for the modeling task. Activities are modeled in the S-HSMM in two ways: the bottom layer represents atomic activities and their duration using HSMMs; the top layer represents a sequence of high-level activities where each high-level activity is made of a sequence of atomic activities. We consider two methods for modeling duration: the classic explicit duration model using multinomial distribution, and the novel use of the discrete Coxian distribution. In addition, we propose an effective scheme to detect abnormality without the need for training on abnormal data. Experimental results show that the S-HSMMperforms better than existing models including the flat HSMM and the hierarchical hidden Markov model in both classification and abnormality detection tasks, alleviating the need for presegmented training data. Furthermore,our discrete Coxian duration model yields better computation time and generalization error than the classic explicit duration model.
Graphical implementation of Huffman and arithmetic coders
Authors: James Keeler
Venue: Journal of Computing Sciences in Colleges (2004)

One of the most important developments in the last decade is the availability of Internet access and World Wide Web to the public. The amount of data traffic over the Internet has been increasing daily as new web sites are introduced and more people join the cyberspace. To reduce the traffic and increase the throughput, effective data compression schemes are needed.
An Adaptive Scalable Multiuser-OFDM System for Multimedia Transmission Over Fading Channels
Authors: Ahmed Muthana M. Nadhim, Jianhua He, Jiangtao Xi, Zongkai Yang
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In this paper, an adaptive scalable multiuser -OFDM system was proposed for multimedia transmission over fading channels. The proposed adaptive algorithm can adapt according to the channel status information of each user's channel status. This algorithm is dynamically changes according to the user's channel changes; this can keep fixed QoS at the physical layer. Another predefined QoS for different sessions and services to be provided for different users. This QoS can be guaranteed by multimedia scalability. Scalability can adapt to the service requirements, in terms of transmission data rate and bandwidth. As a result, a robust multimedia transmission scheme is achieved by providing fix QoS for the end users in multiuser environment, by fixing QoS in the physical layer by the bit and power adaptation technique and also in service layer by scalability techniques. Furthermore, space diversity technique are used to decrease the effect of frequency selective multipath effects in broadband wireless channels.
Abductive logics in a belief revision framework
Authors: Bernard Walliser, Denis Zwirn, Hervé Zwirn
Venue: Journal of Logic, Language and Information (2004)

Abduction was first introduced in the epistemological context of scientific discovery. It was more recently analyzed in artificial intelligence, especially with respect to diagnosis analysis or ordinary reasoning. These two fields share a common view of abduction as a general process of hypotheses formation. More precisely, abduction is conceived as a kind of reverse explanation where a hypothesis H can be abduced from events E if H is a "good explanation" of E. The paper surveys four known schemes for abduction that can be used in both fields. Its first contribution is a taxonomy of these schemes according to a common semantic framework based on belief revision. Its second contribution is to produce, for each non-trivial scheme, a representation theorem linking its semantic framework to a set of postulates. Its third contribution is to present semantic and axiomatic arguments in favor of one of these schemes, "ordered abduction," which has never been vindicated in the literature.
A comonadic account of behavioural covarieties of coalgebras
Authors: Robert Goldblatt
Venue: Mathematical Structures in Computer Science (2005)

A class $K$ of coalgebras for an endofunctor $T\,{:}\,\Set\to\Set$ is a behavioural covariety if it is closed under disjoint unions and images of bisimulation relations (hence closed under images and domains of coalgebraic morphisms, including subcoalgebras). $K$ may be thought of as the class of all coalgebras that satisfy some computationally significant property. In any logical system suitable for specifying properties of state-transition systems in the Hennessy&ndash;Milner style, each formula will define a class of models that is a behavioural covariety.Assuming that the forgetful functor on $T$-coalgebras has a right adjoint, providing for the construction of cofree coalgebras, and letting $\G^T$ be the comonad arising from this adjunction, we show that behavioural covarieties $K$ are (isomorphic to) the Eilenberg&ndash;Moore categories of coalgebras for certain comonads $\G^K$ naturally associated with $\G^T$. These are called pure subcomonads of $\G^T$, and a categorical characterisation of them is given that involves a pullback condition on the naturality squares of a transformation from $\G^K$ to $\G^T$. We show that there is a bijective correspondence between behavioural covarieties of $T$-coalgebras and isomorphism classes of pure subcomonads of $\G^T$.
IPSec Implementation on Xilinx Virtex-II Pro FPGA and Its Application
Authors: Jing Lu, John Lockwood
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

In this paper, we propose an IPSec implementation on Xilinx Virtex-II Pro FPGA1. We move the key management and negotiation into software function calls that run on the PowerPC processor core. On the data path, reconfigurable hardware logic implements time-critical functions for AES encryption and HMAC authentication. In our approach, the fast hardware processing is quasi-independent of the software processing. In traditional hardware systems, it is often the case that fast hardware modules wait for slow softwares to feed input data and retrieve output data. This causes the hardware component to stay in idle and suffer low utilization. Our contribution in this paper is to separate the IPSec data path from the control path, where the hardware has a full control of data processing and invokes the control software only when necessary. We illustrate the use of the IPSec implementation on a reconfigurable network device to secure the control and configuration channel.
Evaluation of Manipulative Familiarization and Fatigue Based on Contact State Transition
Authors: Masahiro Kondo, Jun Ueda, Yoshio Matsumoto, Tsukasa Ogasawara
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this research, we propose a method for a quantitative evaluation of the variation and the similarity of manipulation among the subjects. The evaluation is performed by observing the contact state transition on the palm surface and by using continuous DP matching. Using this method, the individual variation and the level of familiarization of manipulative skills can be evaluated. The evaluation experiment is conducted using a system that can detect the contact state on the palm surface by attaching a tactile sensor sheet on the manipulated object. This experiment included three kinds of manipulative tasks using a cylindrical object. The experiment result shows the subjectýs level of familiarization and fatigue over time.
A Call Admission Control Algorithm for Long-Lived and Short-Lived Streaming Media
Authors: Yi-jung Lo, Zsehong Tsai
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Call admission control (CAC) is one important QoS mechanism for maintaining performance of streaming media services. In this paper, we propose a novel CAC algorithm, which handles long-lived and short-lived streams differently to satisfy their different QoS requirements. Under such mechanism, we show that not only one can guarantee the quality of each stream, but also improve the system utilization.
Asynchronous and anticipatory filter-stream based parallel algorithm for frequent itemset mining
Authors: Adriano Veloso, Wagner Meira,  Jr., Renato Ferreira, Dorgival Guedes Neto, Srinivasan Parthasarathy
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

In this paper we propose a novel parallel algorithm for frequent itemset mining. The algorithm is based on the filter-stream programming model, in which the frequent itemset mining process is represented as a data flow controlled by a series of producer and consumer components (called filters), and the data flow (communication) between such filters is made via streams. When production rate matches consumption rate, and communication overhead between producer and consumer filters is minimized, a high degree of asynchrony is achieved. Following this strategy, our algorithm employs an asynchronous candidate generation, and minimizes communication between filters by transferring only the necessary aggregated information. Another nice feature of our algorithm is a look forward approach which accelerates frequent itemset determination. Extensive evaluation shows the parallel performance and scalability of our algorithm.
Using critical points in contours for segmentation of touching characters
Authors: Ventzislav Alexandrov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

In this paper is presented a new method for segmentation of touching characters using critical points in their contours. The touching regions are determined based on distribution of the critical points along the contours. Critical points which are candidates for touching places are selected based on geometrical and structural information. Segmentation is completed by cutting the touching character objects at places defined by candidate critical points. Verification and correction of the selected candidates for cutting is performed by the recognition of the separated objects. Actually, this method represents a coupled segmentation-recognition process. The proposed here technique is tested on machine-printed characters but many of its ideas may be used for segmentation of handwritten characters too.
Image retrieval using color component analysis
Authors: Young Kwan Choi, Chul Choi, Chang Chun Park
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

This paper intends to propose a way of utilizing color components for image retrieval. Like CLCM, GLCM (Color, Gray Level Co-occurrence Matrix)[11] and Invariant Moment [14] [15] use 2D distribution chart, which use basic statistical techniques in order to interpret 2D data. In order to interpret the spatial relationship and weight of data, this study has used Principal Component Analysis [1][7] that is used in multivariate statistics. In order to increase accuracy of data, it has proposed a way to project color components on 3D space, to rotate it and then, to extract features of data from all angles.
Archipelago: A Network Security Analysis Tool
Authors: Tuva Stang, Fahimeh Pourbayat, Mark Burgess, Geoffrey Canright, Kenth Engø, Åsmund Weltzien
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

Archipelago is system analysis and visualization tool which implements several methods of automated resource and security analysis for human-computer networks; this includes physical networks, social networks, knowledge networks and networks of clues in a forensic analysis. Access control, intrusions and social engineering can be discussed in the framework of graphical and information theoretical relationships. Groups of users and shared objects, such as files or conversations, provide communications channels for the spread of both authorized and un-authorized information. We present a Java based analysis tool that evaluates numerical criteria for the security of such systems and implements algorithms for finding the vulnerable points.
Stereopsis Method for Visually Impaired to Identify Obstacles Based on Distance
Authors: G. Balakrishnan, G. Sainarayanan, R. Nagarajan, Sazali Yaacob
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Identification of obstacles in the real time environment is idempotent for human blind to navigate freely without collision. This paper describes a methodology that is required to support the blind to discriminate obstacles based on their distance. The hardware part consists of a sunglass fitted with two mini cameras, laptop computer and stereo earphones. The two cameras capture the visual information infront of blind user. The captured images are then processed using the proposed methodology. The methodology includes image processing module, which isolate objects from the two camera images, and stereo vision module calculates distance through disparity. In the proposed algorithm disparity is obtained with less computation compared to conventional area based stereo correspondence method. Experimentations were conducted in indoor environment, and the results obtained are supportable.