ppxscal/embedding_network huggingface dataset:
Negotiation of Usage Control Policies - Simply the Best?
Authors: Alexander Pretschner, Thomas Walter
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The term “negotiation” suggests that multi-step bidirectional communication takes place. In this position paper, we play the devil’s advocate and argue that (automated) policy negotiation essentially is one of the following, at least in the area of usage control. It can come down to a three-phase protocol that consists of a client request, a set of offers by the server, and the client’s choice of an offer or to abort. Policy negotiation can also consist of a client request together with acceptable conditions plus the server’s choice of one condition or to abort. In other words, negotiation of policies is a mere choice among alternatives; there is no negotiation in the intuitive sense of the word. — The goal of this position paper is to stimulate the discussion on what(automated) “policy negotiation” really is or can be.
On the value of information in coordination games
Authors: S. Irani
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We discuss settings where several "agents" combine efforts to solve problems. This is a well-known setting in distributed artificial intelligence. Our work addresses theoretical questions in this model which are motivated by the work of X. Deng and C.H. Papadimitriou (1992). We consider optimization problems, in particular load balancing and virtual circuit routing, in which the input is divided among the agents. An underlying directed graph, whose nodes are the agents, defines the constraints on the information each agent may have about the portion of the input held by other agents. The questions we discuss are: Given a bound on the maximum out-degree in this graph, which is the best graph? What is the quality of the solution obtained as a function of the maximum out-degree?.
Federation: repurposing scalar cores for out-of-order instruction issue
Authors: David Tarjan, Michael Boyer, Kevin Skadron
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Future SoCs will contain multiple cores. For workloads with significant parallelism, prior work has shown the benefit of many small, multi-threaded, scalar cores. For workloads that require better single-thread performance, a dedicated, larger core can help but comes at a large opportunity cost in the number of scalar cores that could be provisioned instead. This paper proposes a way to repurpose a pair of scalar cores into a 2-way out-of-order issue core with minimal area overhead. "Federating" scalar cores in this way nevertheless achieves comparable performance to a dedicated out-of-order core and dissipates less power as well.
Spectral fractal dimension
Authors: József Berke
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

There were great expectations in the 1980s in connection with the practical applications of mathematical processes which were built mainly upon fractal dimension mathematical basis. Results were achieved in the first times in several fields: examination of material structure, simulation of chaotic phenomena (earthquake, tornado), modelling real processes with the help of information technology equipment, the definition of length of rivers or riverbanks. Significant results were achieved in practical applications later in the fields of information technology, certain image processing areas, data compression, and computer classification. In the present publication the so far well known algorithms calculating fractal dimension in a simple way will be introduced as well as the new mathematical concept named by the author 'spectral fractal dimension', the algorithm derived from this concept and the possibilities of their practical usage.
A Hierarchical Game for Uplink CDMA Transmissions with Random Active Users
Authors: Yezekael Hayel, Víctor M. Ramos R., Bruno Tuffin
Venue: Proceedings of the Seventh International Conference on Networking (2008)

In this paper we focus on the control of wireless transmissions in a CDMA cell with users generating random traffic. The quality of service perceived by a user is a function of the average packet delay including the coding process and the retransmission phase. The packet retransmission probability depends on the quality level of the channel which is a function of the signal to interference noise ratio. We determine the equilibrium situation in terms of the number of users in a cell. Considering this equilibrium we are able to optimize the revenue of the base station as a function of the access price and transmission power.
A Fast Exact Pattern Matching Algorithm for Biological Sequences
Authors: Yong Huang, Lingdi Ping, Xuezeng Pan, Guoyong Cai
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Pattern matching is a powerful tool for querying sequence patterns in the biological sequence databases. The remarkable increase in the number of DNA and proteins sequences has also stimulated the study of many pattern matching algorithms. To further raise the performance of the pattern matching algorithm, a fast exact algorithm (called BRFS) is presented. It bases on the method of FS algorithm and absorbs the idea of BR algorithm during the pattern matching, thus reaches the best shift distance and improves the performance. The best, worst and average cases in time complexities of the new algorithm are also discussed. The experimental results show that the new algorithm is faster than other compared algorithms for small alphabets and long patterns, so the proposed algorithm is quite applicable for pattern matching in biological sequences.
High-performance computing with desktop workstations
Authors: Eric J. Kelmelis, John R. Humphrey, James P. Durbano, Fernando E. Ortiz
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

The performance of modeling and simulation tools is inherently tied to the platform on which they are implemented. In most cases, this platform is a microprocessor, either in a desktop PC, PC cluster, or supercomputer. Microprocessors are used because of their familiarity to developers, not necessarily their performance on the problems of interest. We have developed the underlying techniques and technologies to produce supercomputer performance from a standard desktop workstation for a variety of applications. This is accomplished through the combined use of graphics processing units (GPUs), field-programmable gate arrays (FPGAs), Cell processors, and standard microprocessors. Each of these platforms has unique strengths and weaknesses but can be used in concert to rival the computational power of a high-performance computer (HPC). In this paper, we discuss the relative advantages and disadvantages of each platform and how they can be combined in order to achieve high performance on a variety of applications.
A New Approach to Analysis of Interval Availability
Authors: Ezzat Kirmani, Cynthia S. Hood
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

This paper gives a novel and useful representation of interval availability over a time period [0,T] for a 2-state continuous time Markov chain (2-CTMC) model. The representation is in terms of an order statistic of a binomially distributed random rank in a random sample of Poisson size from a distribution uniform on the interval [0,1]. This representation is then used to obtain the variance of interval availability for the 2-CTMC model. It is proposed to judge the fluctuations in interval availability by considering the derived coefficient of variation. Both the order statistic representation and the variance of interval availability constitute new contributions to the availability literature.
Scan-Chain Reordering for Minimizing Scan-Shift Power Based on Non-Specified Test Cubes
Authors: Yu-Ze Wu, Mango C. -T. Chao
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

This paper proposes a scan-cell reordering scheme, named ROBPR, to reduce the signal transitions during test mode while preserving the don’t-care bits in the test patterns for a later optimization. Combined with a pattern-filling technique, the proposed scheme utilizes both response correlation and pattern correlation to simultaneously minimize scan-out and scan-in transitions. A series of experiments demonstrate the effectiveness and superiority of the proposed scheme on reducing total scan-shift transitions. The trade-off between our power-driven scan-cell reordering and a routing-driven scan-cell reordering is discussed based on experiments as well.
A Dynamic Relationship Framework For Innovation: Implications For The Brazilian Aerospace Strategy Operations
Authors: Cristiane Gattaz Bueno, João Amato Neto, Mauro Catharino, Katuchi Techima, Renato C. Sampaio
Venue: Journal of Integrated Design Process Science (2006)

The present paper aims at identifying some critical factors related to current relationship structure frameworks that better organizes the strategy operations of the Brazilian aerospace industry to be the best qualifying candidate for innovation operation with a high level of efficiency and effectiveness. The objective of this study, based on the case study research methodology, is to analyze the inter-organizational relationship structure framework of the Brazilian Aerospace Agency (BAA) strategy operation case. As a result, the improvement of the innovation relationship governance structure and its transaction costs reduction are the main implications when applying the identified critical factors.
Normally-black TN panel dark state compensation with retarders
Authors: Oleg S. Tishutin
Venue: Proceedings of the 2008 workshop on Immersive projection technologies/Emerging display technologiges (2008)

Twisted nematic liquid crystal cell operating in parallel polarizers mode is studied. Without compensation, such a cell has low contrast because of light leakage in dark (no voltage) state. Compensation layer, consisting of two superimposed retarder films, is offered to decrease light leakage in dark state and improve the contrast ratio. Simulation and measured data are used to prove the concept. Optimal compensation film parameters are computed.
A globally and superlinearly convergent modified SQP-filter method
Authors: Ke Su
Venue: Journal of Global Optimization (2008)

In this paper, we presented a modified SQP-filter method based on the modified quadratic subproblem proposed by Zhou (J. Global Optim. 11, 193---2005, 1997). In contrast with the SQP methods, each iteration this algorithm only needs to solve one quadratic programming subproblems and it is always feasible. Moreover, it has no demand on the initial point. With the filter technique, the algorithm shows good numerical results. Under some conditions, the globally and superlinearly convergent properties are given.
Modeling hexagonal constellations with Eisenstein-Jacobi graphs
Authors: C. Martínez, E. Stafford, R. Beivide, E. M. Gabidulin
Venue: Problems of Information Transmission (2008)

A set of signal points is called a hexagonal constellation if it is possible to define a metric so that each point has exactly six neighbors at distance 1 from it. As sets of signal points, quotient rings of the ring of Eisenstein-Jacobi integers are considered. For each quotient ring, the corresponding graph is defined. In turn, the distance between two points of a quotient ring is defined as the corresponding graph distance. Under certain restrictions, a quotient ring is a hexagonal constellation with respect to this metric. For the considered hexagonal constellations, some classes of perfect codes are known. Using graphs leads to a new way of constructing these codes based on solving a standard graph-theoretic problem of finding a perfect dominating set. Also, a relation between the proposed metric and the well-known Lee metric is considered.
Analysis of Biological Networks (Wiley Series in Bioinformatics)
Authors: Bjrn H. Junker, Falk Schreiber
Venue:  (2008)

An introduction to biological networks and methods for their analysis Analysis of Biological Networks is the first book of its kind to provide readers with a comprehensive introduction to the structural analysis of biological networks at the interface of biology and computer science. The book begins with a brief overview of biological networks and graph theory/graph algorithms and goes on to explore: global network properties, network centralities, network motifs, network clustering, Petri nets, signal transduction and gene regulation networks, protein interaction networks, metabolic networks, phylogenetic networks, ecological networks, and correlation networks. Analysis of Biological Networks is a self-contained introduction to this important research topic, assumes no expert knowledge in computer science or biology, and is accessible to professionals and students alike. Each chapter concludes with a summary of main points and with exercises for readers to test their understanding of the material presented. Additionally, an FTP site with links to author-provided data for the book is available for deeper study. This book is suitable as a resource for researchers in computer science, biology, bioinformatics, advanced biochemistry, and the life sciences, and also serves as an ideal reference text for graduate-level courses in bioinformatics and biological research.
DNA Microarray Classification with Compact Single Hidden-Layer FeedForward Neural Networks
Authors: Hieu Trung Huynh, Jung-Ja Kim, Yonggwan Won
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Microarrays have been useful in the diagnosis and treatment due to their abilities to survey a large number of genes quickly and to study samples with small amount. With the development of microarray technology, the prospects for effective and reliable disease diagnosis and management can be significantly improved if the classification performance on microarray data is improved. This paper presents an application of the compact single hidden layer feedforward neural networks (C-SLFNs) trained by an improved extreme learning machine (ELM) algorithm to classify microarray data for cancer diagnosis. Experimental results show that the classification accuracy is higher than those achieved by the SLFNs trained by the original ELM and back-propagation (BP) algorithms, and other popular methods for microarray classification such as Support Vector Machine (SVM) and Fisher Discriminant Analysis (FDA). Moreover, the trained C-SLFNs have a smaller number of hidden units than the SLFNs trained by the original ELM and BP, which results in quick response to new input patterns.
Induced electroencephalogram oscillations during source memory: Familiarity is reflected in the gamma band, recollection in the theta band
Authors: Thomas Gruber, Dimitris Tsivilis, Claire-Marie Giabbiconi, Matthias M. Müller
Venue: Journal of Cognitive Neuroscience (2008)

Modulations of oscillatory electroencephalogram (EEG) activity in the induced gamma and theta frequency ranges (induced gamma and theta band responses; iGBRs: >30 Hz; iTBRs: ∼6 Hz) have been associated with retrieval of information from long-term memory. However, the specific functional role of these two forms of oscillatory activity remains unclear. The present study examines theta-and gamma-oscillations within a dual-process framework, which defines “familiarity” and “recollection” as the two component processes of recognition memory. During encoding, participants were instructed to make “bigger/smaller than a shoebox” or “living/nonliving” decisions for different object pictures. During retrieval “old/new” recognition was followed (for items judged old) by a source discrimination task regarding the decision made for each item at encoding. iGBRs (35--80 Hz; 210--330 msec) were higher for correctly identified “old” relative to “new” objects. Importantly, they did not distinguish between successful and unsuccessful source judgments. In contrast, iTBRs (4--7.5 Hz; 600--1200 msec) were sensitive to source discrimination. We propose that iGBRs mirror early associative processes linked to familiarity-related retrieval processes, whereas iTBRs reflect later onsetting, episodic, recollection-related mechanisms.
Action-Based Multifield Video Visualization
Authors: Ralf P. Botchen, Sven Bachthaler, Fabian Schick, Min Chen, Greg Mori, Daniel Weiskopf, Thomas Ertl
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

One challenge in video processing is to detect actions and events, known or unknown, in video streams dynamically. This paper proposes a visualization solution, where a video stream is depicted as a series of snapshots at a relatively sparse interval, and detected actions are highlighted with continuous abstract illustrations. The combined imagery and illustrative visualization conveys multi-field information in a manner similar to electrocardiograms (ECG) and seismographs. We thus name this type of video visualization as VideoPerpetuoGram (VPG). In this paper, we describe a system that handles the aw and processed information of the video stream in a multi-field visualization pipeline. As examples, we consider the needs for highlighting several types of processed information, including detected actions in video streams, and estimated relationship between recognized objects. We examine the effective means for depicting multi-field information in VPG, and support our choice of visual mappings through a survey. Our GPU implementation facilitates the VPG-specific viewing specification through a sheared object space, as well as volume bricking and combinational rendering of volume data and glyphs.
Spectral geometry for simultaneously clustering and ranking query search results
Authors: Ying Liu, Wenyuan Li, Yongjing Lin, Liping Jing
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

How best to present query search results is an important problem in search engines and information retrieval systems. When a single query retrieves many results, simply showing them as a long list will provide users with poor overview. Nowadays, ranking and clustering query search results have been two useful separate post-processing techniques to organize retrieved documents. In this paper, we proposed a spectral analysis method based on the content similarity networks to integrate the clustering and ranking techniques for improving literature search. The new approach organizes all these search results into categories intelligently and simultaneously rank the results in each category. A variety of theoretical and empirical studies have demonstrated that the presented method performs well in real applications, especially in biomedical literature retrieval. Moreover, any free text information can be analyzed with the new method, i.e., the proposed approach can be applied to various information systems, such as Web search engines and literature search service.
Got predictability?: experiences with fault-tolerant middleware
Authors: Tudor Dumitraş, Priya Narasimhan
Venue: Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion (2007)

Unpredictability in COTS-based systems often manifests as occasional instances of uncontrollably-high response times. A particular category of COTS systems, fault-tolerant (FT) middleware, is used in critical enterprise and embedded applications where predictability is of paramount importance. Our prior empirical study, which used a client-server microbenchmark, suggested that hard bounds for the maximum latency are hard to establish a priori, but that the unpredictability may be confined to less than 1% of the requests. In this paper, we present empirical data, from 7 different three-tier, FT-middleware applications, that shows strong evidence supporting this "magical 1%" hypothesis. We conducted a controlled experiment with 7 teams of students from a graduate-level course at Carnegie Mellon University. Each team, starting from a common three-tier architecture, independently implemented and evaluated an original application using middleware (either CORBA or EJB) and a custom-implemented fault-tolerance mechanism (relying on either state-machine or primary-backup replication) for the middle-tier server. This experiment shows that unpredictability may not be avoidable, even in the absence of faults, and that, in some cases, the random latency outliers are larger than the time needed to recover from a fault. The data also reveals a statistically-significant result that, across all 7 applications, unpredictability is confined to the highest 1% of the recorded end-to-end latencies and is not correlated with the request rate, the size of messages exchanged or the number of clients. This suggests that strict predictability is hard to achieve in FT-middleware systems and that developers of critical FT applications should focus on guaranteeing bounds for statistical measures, such as the 99th percentile of the latency.
Keeping hot chips cool: are IC thermal problems hot air?
Authors: Ruchir Puri, Devadas Varma, Darvin Edwards, Alan J Weger, Paul Franzon, Andrew Yang, Stephen Kosonocky
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Thermal issues are becoming more important but is the hype getting the better of the facts? Does this deserve more attention than for some niche designs and technologies such as 3D ICs.? Does the broader design community need to worry about it at 32nm and beyond or it will only impact a small segment of designs? In short, does the severity of power issues coupled with packaging complexity translate into a thermal crisis in future? This is an educational panel with a little bit of controversy that will address the thermal issue in IC design. When will this issue be emerging as a crucial concern if at all? What are the solutions to resolve this potential crisis?
Speech enhancement based on undecimated wavelet packet-perceptual filterbanks and MMSE--STSA estimation in various noise environments
Authors: Hacı Taşmaz, Ergun Erçelebi
Venue: Digital Signal Processing (2008)

In this paper, we proposed a new speech enhancement system, which integrates a perceptual filterbank and minimum mean square error-short time spectral amplitude (MMSE-STSA) estimation, modified according to speech presence uncertainty. The perceptual filterbank was designed by adjusting undecimated wavelet packet decomposition (UWPD) tree, according to critical bands of psycho-acoustic model of human auditory system. The MMSE-STSA estimation (modified according to speech presence uncertainty) was used for estimation of speech in undecimated wavelet packet domain. The perceptual filterbank provides a good auditory representation (sufficient frequency resolution), good perceptual quality of speech and low computational load. The MMSE-STSA estimator is based on a priori SNR estimation. A priori SNR estimation, which is a key parameter in MMSE-STSA estimator, was performed by using ''decision directed method.'' The ''decision directed method'' provides a trade off between noise reduction and signal distortion when correctly tuned. The experiments were conducted for various noise types. The results of proposed method were compared with those of other popular methods, Wiener estimation and MMSE-log spectral amplitude (MMSE-LSA) estimation in frequency domain. To test the performance of the proposed speech enhancement system, three objective quality measurement tests (SNR, segSNR and Itakura-Saito distance (ISd)) were conducted for various noise types and SNRs. Experimental results and objective quality measurement test results proved the performance of proposed speech enhancement system. The proposed speech enhancement system provided sufficient noise reduction and good intelligibility and perceptual quality, without causing considerable signal distortion and musical background noise.