ppxscal/embedding_network huggingface dataset:
Weather prediction using fuzzy sets and inference methodology
Authors: Hassan B. Diab, Jean J. Saade
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

This paper presents the use of fuzzy inference methodologies in the prediction of the weather, as a viable alternative to the classical complex, costly and time-consuming weather prediction techniques. Basic weather elements which affect weather characteristics and which underlie the factors used in advanced weather prediction methods are fuzzified. They are then used in fuzzy weather prediction models based on fuzzy inferences. These models are simulated and the crisp results obtained using different existing and recently developed defuzzification strategies are compared with the actual weather data. Further, conclusive comments are provided regarding the effectiveness of the introduced models and the avenues which need to be explored in order to make them increasingly efficient.
Shape Estimation Using Polarization and Shading from Two Views
Authors: Gary A. Atkinson, Edwin R. Hancock
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

This paper presents a novel method for 3D surface reconstruction that uses polarization and shading information from two views. The method relies on polarization data acquired using a standard digital camera and a linear polarizer. Fresnel theory is used to process the raw images and to obtain initial estimates of surface normals, assuming that the reflection type is diffuse. Based on this idea, the paper presents two novel contributions to the problem of surface reconstruction. The first is a technique to enhance the surface normal estimates by incorporating shading information into the method. This is done using robust statistics to estimate how the measured pixel brightnesses depend on the surface orientation. This gives an estimate of the object material reflectance function, which is used to refine the estimates of the surface normals. The second contribution is to use the refined estimates to establish correspondence between two views of an object. To do this, a set of patches are extracted from each view and are aligned by minimizing an energy functional based on the surface normal estimates and local topographic properties. The optimum alignment parameters for different patch pairs are then used to establish stereo correspondence. This process results in an unambiguous field of surface normals, which can be integrated to recover the surface depth. Our technique is most suited to smooth, non-metallic surfaces. It complements existing stereo algorithms since it does not require salient surface features to obtain correspondences. An extensive set of experiments, yielding reconstructed objects and reflectance functions, are presented and compared to ground truth.
Relation-based computations in a monadic BSP model
Authors: N. Botta, C. Ionescu
Venue: Parallel Computing (2007)

We propose a Haskell monadic model of bulk synchronous parallel programs and apply it to the analysis of relation-based computations. Relation-based computations are simple but general patterns found in scientific computing applications. They are easy to implement sequentially, but difficult to parallelize. We use the model to give high-level specifications of distributed relation-based algorithms and outline how to obtain testable parallel implementations from these specifications via equational reasoning. We sketch the architecture of a C++ library of components for distributed relation-based computations. We argue that the model can be used to provide a concise and consistent library documentation.
Forecasting time series using principal component analysis with respect to instrumental variables
Authors: P. -A. Cornillon, W. Imam, E. Matzner-Løber
Venue: Computational Statistics Data Analysis (2008)

Two new forecasting methods of time series are introduced. They are both based on a factorial analysis method called spline principal component analysis with respect to instrumental variables (spline PCAIV). The first method is a straightforward application of spline PCAIV while the second one is an adaptation of spline PCAIV. In the modified version, the used criteria according to the unknown value that need to be predicted are differentiated. Those two forecasting methods are shown to be well adapted to time series.
Optical Interconnect Opportunities for Future Server Memory Systems
Authors: Y. Katayama, A. Okazaki
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

This paper deals with alternative server memory architecture options in multicore CPU generations using optically-attached memory systems. Thanks to its large bandwidth-distance product, optical interconnect technology enables CPUs and local memory to be placed meters away from each other without sacrificing bandwidth. This topologically-local but physically-remote main memory attahed via an ultra-high-bandwidth parallel optical interconnect can lead to flexible memory architecture options using low-cost commodity memory technologies.
On Path-length and Routing-tag Algorithm for Hybrid Irregular Multi-stage Interconnection Networks
Authors: Nitin, Vivek Kumar Sehgal, Nakul Sharma, Kunal Krishna, Abhishek Bhatia
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In this paper, we proposed two different path-length algorithms and routing-tag algorithm for fault-tolerant hybrid irregular multi-stage interconnection networks (MINs) called as Hybrid Zeta Networks-2 (HZTN) [1,2,3]. In HZTN, 50% of requests are accepted at minimum path-length of 2 in contrast with the regular Augmented Shuffle-Exchange Network (ASEN) [4], Extra-stage Cube Network (ESC) [5], Augmented Baseline Network (ABN) [6], and Benes Network (BN) [7]. They all are having constant path length on all the routes, which makes delay encountered to the same delay along all the paths, thus increasing average latency. Furthermore, the fault-tolerance and reparability of HZTN is evaluated. In addition to this adaptive fault-tolerant routing algorithm for the same have been proposed. This adaptive fault-tolerant routing is provided by exploiting the inherent redundancy of the irregular topology, which does not lead to blocking of request.
Rough fuzzy approximations on two universes of discourse
Authors: Tong-Jun Li, Wen-Xiu Zhang
Venue: Information Sciences: an International Journal (2008)

In rough set theory, the lower and upper approximation operators can be constructed via a variety of approaches. Various fuzzy generalizations of rough approximation operators have been made over the years. This paper presents a framework for the study of rough fuzzy sets on two universes of discourse. By means of a binary relation between two universes of discourse, a covering and three relations are induced to a single universe of discourse. Based on the induced notions, four pairs of rough fuzzy approximation operators are proposed. These models guarantee that the approximating sets and the approximated sets are on the same universes of discourse. Furthermore, the relationship between the new approximation operators and the existing rough fuzzy approximation operators on two universes of discourse are scrutinized, and some interesting properties are investigated. Finally, the connections of these approximation operators are made, and conditions under which some of these approximation operators are equivalent are obtained.
Optimal DiffServ AC Design using Non-Linear Programming
Authors: Ricardo Nabhen, Edgard Jamhour, Manoel Penna, Mauro Fonseca, Guy Pujolle
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Most DiffServ admission control (AC) algorithms rely on tuning parameters to help in the decision making. Tuning these parameters is a difficult task, especially when one considers the problem of assuring QoS guarantees to individual flows. This paper proposes a method for helping the design of DiffServ AC algorithms based on non-linear programming optimization. It enables to find the values for the AC parameters that permits to satisfy the QoS guarantees for individual VoIP flows, while minimizing a cost function that represents the performance goals of the service provider. This approach is used to compare the performance of some commonly used DiffServ AC techniques and also to design a novel AC algorithm based on queue estimates.
An Efficient ID-Based Partially Blind Signature Scheme
Authors: Xiaoming Hu, Shangteng Huang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

A partially blind signature allows a signer to explicitly embed a pre-agreed common information into a blind signature without the loss of blindness property. It is an important technology in e-commerce. In ID-based public key setting, a user's public key can be derived directly from his identity without access to public key certificate. It can simplify the key management process in traditional certificate based cryptosystem. To our knowledge, many partially blind signature schemes have been proposed till now. However, no ID-based partially blind signature scheme has been proposed. Recently, Chow et al. first proposed an ID-based partially blind signature scheme based on bilinear pairings, but it isn't very efficient. In this paper, we improve C how et al's scheme and present a new ID-based partially blind signature scheme. We also analyze the security and efficiency of the proposed scheme. We show that our scheme is more efficient and needs less computation cost than Chow et al.'s scheme and is provably secure under the random oracle model.
A new sequential decoding algorithm based on branch metric
Authors: Tuğrul Çavdar, Ali Gangal
Venue: Wireless Personal Communications: An International Journal (2007)

A new sequential decoding algorithm with an adjustable threshold and a new method of moving through the decoding tree is proposed. Instead of the path metric of the conventional sequential decoding algorithms, the proposed algorithm uses a branch metric based on maximum-likelihood criterion. Two new parameters, the jumping-back distance and going-back distance, are also introduced. The performance of the algorithm for long constraint length convolutional codes is compared to those of the other sequential decoding algorithms and the Viterbi algorithm. The results show that the proposed algorithm is a good candidate for decoding of convolutional codes due to its fast decoding capability and good bit error rate (BER) performance.
Segmenting Photo Streams in Events Based on Optical Metadata
Authors: Bo Gong, Ramesh Jain
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Traditional methods for event segmentation of photo streams use time and/or content-based information. In this paper, we present event segmentation from a novel perspective. We propose to segment photo streams in events based on the scene brightness of photos by assuming that big scene brightness change implies an event transition of interest. The scene brightness is derived from camera parameters that are automatically set when photos are taken and recorded with each photo as metadata in standard forms like EXIF data. This information is available from metadata and is very inexpensive computationally resulting in fast segmentation. Hierarchical agglomerative clustering method is applied to build the event hierarchy of the photo stream based on the scene brightness difference. The proposed approach has been tested on several photo streams and very promising results have been obtained.
An analysis of software quality management at AWE plc.
Authors: Michael Elliott, Ray Dawson, Janet Edwards
Venue: Software Quality Control (2007)

A detailed question set is required to test and measure the true extent that a software quality management system is adopted and implemented across a large company like Atomic Weapons Establishment (AWE) plc. The analysis of the gathered data reveals specific topics of weakness that can also reflect the cultural acceptance or resistance that management groups have towards the adoption of quality systems. Having identified detailed problems and barriers, effective strategies and programmes can be deployed to improve the level of implementation and, therefore, the effectiveness of a software quality management system. This paper presents the question set used and the subsequent results obtained from the implementation assessment for 55 software systems at AWE plc. The data is collated into management groups and the associated cultures discussed. The topics of weakness are highlighted together with the very specific actions that are least undertaken. A range of improvement actions is also presented.
A GA-based UWB pulse waveform design method
Authors: Min Wang, Shuyuan Yang, Shunjun Wu
Venue: Digital Signal Processing (2008)

The design of ultra-wideband (UWB) pulse waveform requires not only preserving the orthogonality at the correlation receiver but also meeting the power spectral mask of the Federal Communications Commission (FCC) for indoor UWB systems. In this paper a flexible UWB pulse waveform design method is proposed based on an approximation with B-spline basis. Subsequently by representing the pulse waveform design as a constrained optimization problem and using genetic algorithm (GA) to solve it, we can get the waveforms whose spectrums not only can comply with the FCC spectrum mask without additional frequency shifting or band-pass filters, but also be applicable for high-rate multidimensional modulation and (carrier-free) orthogonal frequency-division multiple access. Moreover, for the radio transceiver system can be established by rectangle wave generator and amplifier circuits, B-spline based waveform generator is of easy implementation. Experimental results show that the proposed method can also make full use of the available bandwidth to a great extent, which is superior to other available approaches.
Designing in virtual reality (DesIRe): a gesture-based interface
Authors: Manolya Kavakli, Meredith Taylor, Anatoly Trapeznikov
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

In this paper, our purpose is to focus on detection of dynamic gestures and find the thresholds to detect gestures for a gesture-based system, DesIRe (DESigning In virtual REality). DesIRe treats virtual reality as a platform of virtual clay and allows realtime dynamic interaction with an object to perform a number of design operations. We developed an interface using a stereoscopic display environment and combining elements of gesture recognition and motion capture. The system architecture of DesIRe include following components: Vizard Virtual Reality Toolkit, an immersive projection system (VISOR), an optical tracking system (specifically the PPT system and the in-house gesture recognition software), and Data Input System (a data glove). In DesIRe, the user has control of a hand-shaped cursor which is guided by a single infrared LED and linked to the data glove finger states and orientation in order to provide an immediate, visual feedback. In this paper, we present an approach to represent the finger states using binary digits in gesture detection and demonstrate the thresholds. We found that thresholds are glove specific.
An Algorithm for a Fast Hadamard Matrix Transform of Order Twelve
Authors: W. K. Pratt
Venue: IEEE Transactions on Computers (1969)

a matrix factorization is presented for a Hadamard matrix of order twelve that permits a Hadamard transform of this order to be computed with substantially fewer operations than by simple matrix multiplication. The matrix factorization is extended to Hadamard matrices of order 2nX 12 where n is an integer.
Complex Disjunctive Decomposition of Incompletely Specified Boolean Functions
Authors: S. L. Hight
Venue: IEEE Transactions on Computers (1973)

In this paper the Ashenhurst-Curtis theory of complex disjunctive decompositions is extended to the realm of incompletely specified Boolean functions. A compatibility relation on the column vectors of the decomposition chart is introduced, which is applied to identify all possible simple disjunctive decompositions for each input partition. The assignments of the DON'T CARE (f) conditions that are required to realize these simple decompositions are described by a vector listing the constraints on these f's by new Boolean variables caled constrained DON'T CAREs. A compatibility relation is introduced on these vectors, caled constrained Boolean vectors, which is applied to form complete decompositions. A Complete decomposition is one for which al possible simple decompositions have been combined into a complex decomposition. Throughout the procedure, the freedom of choice implied by the f's is maintained as far as is alllowed by the choices that have been made to achieve the decompositions.
Forbidding Complete Hypergraphs as Traces
Authors: Dhruv Mubayi, Yi Zhao
Venue: Graphs and Combinatorics (2007)

Let 2 &#x2264;q &#x2264;min{p, t&#x00a0;&#x2212;&#x00a0;1} be fixed and n &#x2192; &#x221e;. Suppose that $$\mathcal{F}$$ is a p-uniform hypergraph on n vertices that contains no complete q-uniform hypergraph on t vertices as a trace. We determine the asymptotic maximum size of $${\mathcal{F}}$$ in many cases. For example, when q&#x00a0;=&#x00a0;2 and p&#x2208;{t, t&#x00a0;+&#x00a0;1}, the maximum is $$( \frac{n}{t-1})^{t-1} + o(n^{t-1})$$, and when p&#x00a0;=&#x00a0;t&#x00a0;=&#x00a0;3, it is $$\lfloor \frac{(n-1)^2}{4}\rfloor$$ for all n&#x2265; 3. Our proofs use the Kruskal-Katona theorem, an extension of the sunflower lemma due to F&#x00fc;redi, and recent results on hypergraph Tur&#x00e1;n numbers.
Algorithms in Numerical Geometry System
Authors: J. C. Ferguson
Venue: IEEE Transactions on Computers (1977)

Three papers [3],[9],[11] have described a numerical geometry system jointly implemented by IBM and Teledyne-Ryan Aeronautical in San Diego. They devoted attention specifically to the overall program structure and system capabilities. The present paper discusses this system from a point of view at the mathematical and algorithmic levels.
A New Gene Selection Method Based on PCA for Molecular Classification
Authors: Kirack Sohn, Soo Hong Lim
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Microarray expression experiments generating thousands of gene expression measurements simultaneously provide information for tissue and cell samples, which are useful for disease diagnosis. These experiments primarily either monitor each gene multiple times under different conditions or alternatively evaluate each gene in a single environment but in different types of tissues. In general, microarray data are huge and difficult to analyze. In order to extract information from gene expression measurements, various methods have been employed to analyze this data such as SVM, clustering methods, self-organizing maps, and weighted correlation method. Support vector machines have been shown to perform very well in many areas of biological data analysis, in particular microarray expression data analysis. We present a new gene selection method for microarray data analysis. This method removes noisy data using principal component analysis, and selects genes with high contribution to constitute principal components. Selected genes have discriminative power to distinguish classes. When we used the presented method with SVM, we were able to analyze microarray data more correctly than previously known methods for molecular classification.
Computer Graphics and the Business Executive- The New Management Team
Authors: A. Vinberg
Venue: IEEE Computer Graphics and Applications (1981)

Computer graphics has become a true management tool. This nontechnical discussion introduces its capabilities and benefits to potential users.
Streaming consistency: a model for efficient MPSoC design
Authors: J. W. van den Brand, NXP Research
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Multiprocessor systems-on-chip (MPSoC) with distributed shared memory and caches are flexible when it comes to inter-processor communication but require an efficient memory consistency and cache coherency solution. In this paper we present a novel consistency model, streaming consistency, for the streaming domain in which tasks communicate through circular buffers. The model allows more reordering than release consistency and, among other optimizations, enables an efficient software cache coherency solution and posted writes. We also present a software cache coherency implementation and discuss a software circular buffer administration that does not need an atomic read-modify-write instruction. A small experiment demonstrates the potential performance increase of posted writes in MPSoCs with high communication latencies.
An algorithm for idle-state detection in motor-imagery-based brain-computer interface
Authors: Dan Zhang, Yijun Wang, Xiaorong Gao, Bo Hong, Shangkai Gao
Venue: Computational Intelligence and Neuroscience (2007)

For a robust brain-computer interface (BCI) system based on motor imagery (MI), it should be able to tell when the subject is not concentrating on MI tasks (the "idle state") so that real MI tasks could be extracted accurately. Moreover, because of the diversity of idle state, detecting idle state without training samples is as important as classifying MI tasks. In this paper, we propose an algorithm for solving this problem. A three-class classifier was constructed by combining two two-class classifiers, one specified for idle-state detection and the other for these two MI tasks. Common spatial subspace decomposition (CSSD) was used to extract the features of event-related desynchronization (ERD) in two motor imagery tasks. Then Fisher discriminant analysis (FDA) was employed in the design of two two-class classifiers for completion of detecting each task, respectively. The algorithm successfully provided a way to solve the problem of "idle-state detection without training samples." The algorithm was applied to the dataset IVc from BCI competition III. A final result with mean square error of 0.30 was obtained on the testing set. This is the winning algorithm in BCI competition III. In addition, the algorithm was also validated by applying to the EEG data of an MI experiment including "idle" task.
E-Beam Hard Disk Drive Using Gated Carbon Nano Tube Source and Phase Change Media
Authors: William S. Oakley
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

A novel high speed, high capacity electron-beam recording technique using nano technology in a Hard Disk Drive form factor is described. The e- beam source is a carbon nanotube (CNT) emitter and can be gated at rates up to several gigahertz. The planned recording media is Phase Change with sub-nanosecond response times, and data read-out by Secondary Electron Emission is anticipated. The key parameters for generating the recording beam are described and a preliminary design is discussed in which the CNT based Read/Write head replaces the magnetic head in a standard Hard Disk Drive (HDD). The technique sidesteps limits associated with HDD technology and potentially provides far higher recording densities and higher data rates than possible with conventional magnetic-recording. The NS3 NanoTech Disk (NTD) approach may provide a path forward for HDD's to the low nanometer mark scale.