ppxscal/embedding_network huggingface dataset:
A genetic algorithms programming application in natural cheese products
Authors: Anant Oonsivilai, Ratchadaporn Oonsivilai
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

Application of genetic algorithms to attain the parameters of the processed cheese products is used in this paper. As in the recent years, model integrates cheese manufacturing has had considerable appeal. The economical evaluation of standaized milk for cheese making is established, thus an objective is given; to make the profit of the natural chesse. Genetic algorithms are highly eligible for investigation of multimodal space of discreteness, noisiness and complexity. Majority of Genetic Algorithms (GA) modifications to solve problematic optimization issues, find some mathematical support to the GA. Explotation of Genetic Algorithms modified optimization give advanced results as recognized.
Density Evolution Analysis of Robustness for LDPC Codes over the Gilbert-Elliott Channel
Authors: Manabu Kobayashi, Hideki Yagi, Toshiyasu Matsushima, Shigeichi Hirasawa
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we analyze the robustness for low-density parity-check (LDPC) codes over the Gilbert-Elliott (GE) channel. For this purpose we propose a density evolution method for the case where LDPC decoder uses the mismatched parameters for the GE channel. Using this method, we derive the region of tuples of true parameters and mismatched decoding parameters for the GE channel, where the decoding error probability approaches asymptotically to zero.
An anytime deduction algorithm for the probabilistic logic and entailment problems
Authors: B. Jaumard, A. D. Parreira
Venue: International Journal of Approximate Reasoning (2009)

We study two basic problems of probabilistic reasoning: the probabilistic logic and the probabilistic entailment problems. The first one can be defined as follows. Given a set of logical sentences and probabilities that these sentences are true, the aim is to determine whether these probabilities are consistent or not. Given a consistent set of logical sentences and probabilities, the probabilistic entailment problem consists in determining the range of the possible values of the probability associated with additional sentences while maintaining a consistent set of sentences and probabilities. This paper proposes a general approach based on an anytime deduction method that allows the follow-up of the reasoning when checking consistency for the probabilistic logic problem or when determining the probability intervals for the probabilistic entailment problem. Considering a series of subsets of sentences and probabilities, the approach proceeds by computing increasingly narrow probability intervals that either show a contradiction or that contain the tightest entailed probability interval. Computational experience have been conducted to compare the proposed anytime deduction method, called ad-psat with an exact one, psatcol, using column generation techniques, both with respect to the range of the probability intervals and the computing times.
Morphology and growth mechanism of aligned ZnO nanorods grown by catalyst-free MOCVD
Authors: M. Rosina, P. Ferret, P. -H. Jouneau, I. -C. Robin, F. Levy, G. Feuillet, M. Lafossas
Venue: Microelectronics Journal (2009)

We report on ZnO nanorods grown by catalyst-free metal-organic chemical vapour deposition (MOCVD) in a commercial Epigress reactor using diethylzinc and N"2O as precursors. Well-aligned ZnO nanorods with uniform diameter, length and density have been grown perpendicularly to the sapphire (0001) surface. Scanning electron microscopy (SEM) has been used to observe the morphology of the ZnO nanorods and X-ray diffraction and transmission electron microscopy (TEM) to investigate the crystalline structure of the nanorods. TEM observation as well as photoluminescence measurements confirm the very good crystalline quality of the nanorods. SEM observation on samples that have been prepared with various deposition times has been used in order to investigate the growth mechanism. Three types of ZnO morphologies have been identified: a thin two-dimensional ZnO layer formed at the sapphire surface, covered by three-dimensional hexagonal-shaped islands and hexagonal nanorods on top of them.
ASPVIZ: Declarative Visualisation and Animation Using Answer Set Programming
Authors: Owen Cliffe, Marina Vos, Martin Brain, Julian Padget
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Answer set programming provides a powerful platform for model-based reasoning problems. The answer sets are solutions, but for many non-trivial problems post-processing is often necessary for human readability. In this paper we describe a method and a tool for visualising answer sets in which we exploit answer set programming itself to define how visualisations are constructed. An exciting potential application of our method is to assist in the debugging of answer set programs that, as a consequence of their declarative nature, are not amenable to traditional approaches: visual rendering of answer sets offers a way to help programmers spot false and missing solutions.
Productivity evaluation of 56" pipe production unit
Authors: Soheil Mardani, Mohammad Alkatheer
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Simulation is not only used for future forecasting, it is also used to analyze the past. Ahwaz Pipe Mills is producing wide variety of diameter sizes (12" to 56") all capable of meeting a large diversity of customer requirements for Gas/Oil and water in past 30 years The basic process of pipe production is not complex. The steel sheets pass several press and welding machines to form a pipe. Due to the necessary buffers and inspection stages it becomes complex. One of the most important challenges at the plants are the downtimes of the equipment which requires the production system to be dynamic. According this uncertainty measuring the amount of time that the whole production line is idle is almost an impossible job. Applying simulation techniques at APM has been done with two main goals: Increase productivity and to use production resources more effectively & analyzing past production operations.
Learning to recognize valuable tags
Authors: Shilad Sen, Jesse Vig, John Riedl
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

Many websites use tags as a mechanism for improving item metadata through collective user effort. Users of tagging systems often apply far more tags to an item than a system can display. These tags can range in quality from tags that capture a key facet of an item, to those that are subjective, irrelevant, or misleading. In this paper we explore tag selection algorithms that choose the tags that sites display. Based on 225,000 ratings and survey responses, we conduct offline analyses of 21 tag selection algorithms. We select the three best performing algorithms from our offline analysis, and deploy them live on the MovieLens website to 5,695 users for three months. Based on our results, we offer tagging system designers advice about tag selection algorithms.
An analytical method for derivation of the Steiner Ratio of 3D euclidean Steiner trees
Authors: R. P. Mondaini
Venue: Journal of Global Optimization (2009)

We stress the convenience of some analytical methods which have been introduced recently [Mondaini, R. P.: In: Nonconvex Optimization and its Applications series, pp. 373---390. Kluwer Acad. (2003); Mondaini, R. P.: In: BIOMAT 2005, International Symposium on Mathematical and Computational Biology, pp. 327---342. World Scientific Co Ltd (2006)] for calculating the Steiner Ratio of finite sets of points in $${\mathbb{R}}^3$$ . These methods are good enough at reproducing the results obtained by reduction of the search space of numerical algorithms and can be easily extended to any number of dimensions.
A Fast Hybrid Decision Algorithm for H.264/AVC Intra Prediction Based on Entropy Theory
Authors: Guifen Tian, Tianruo Zhang, Takeshi Ikenaga, Satoshi Goto
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

Rate Distortion Optimization based spatial intra coding is a new feature of H.264/AVC standard. It efficiently improves the video coding performance by brutally utilizing variable block sizes and multiple prediction modes. Thus, extremely high computation complexity is required. This paper proposes a hybrid decision algorithm which can reduce unimportant block sizes and prediction modes. Entropy feature of each MB is extracted to decide the optimal block size. Then Prewitt operators based edge direction extraction module is designed to select only promising prediction modes. In addition, above two decision modules can function together to form a fast hybrid decision algorithm for intra prediction. Sufficient experiments prove that this hybrid algorithm is able to achieve 63% time reduction with PSNR loss limited to 0.07dB, bit rate increase at most 2.02%. It is expected to be utilized as a favorable accelerator for a real-time H.264 encoder for HDTV.
A Macroblock-Level Rate Control Algorithm for H.264/AVC Video Coding with Context-Adaptive MAD Prediction Model
Authors: Shuijiong Wu, Yiqing Huang, Takeshi Ikenaga
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Rate control (RC) is crucial for video codec to control bit-stream such that the coding efficiency is maximized without violating the constraints imposed by the bandwidth, buffer size and the constant end-to-end delay. To solve MAD dilemma caused by data-dependency between RC and rate-distortion optimization (RDO), a Macroblock (MB) level rate control algorithm with context-adaptive mean absolute difference (MAD) prediction model is proposed in this paper. 2D sliding window combined with temporal ordering is used for model update, and the reference MAD is computed by considering spatial information relativity. Simulations based on JM software show that the proposed model achieves higher peak-signal-noise-ratio (PSNR) and more accurate rate match than the original JVT-G012 algorithm. A gain up to 0.63dB is observed on luminance PSNR, and 0.58dB on PSNR includes both luminance and chrominance components. Average gains are 0.35dB and 0.29dB, respectively. Meanwhile, the average rate mismatch is reduced by 88%.
Trust modelling for online transactions: a phishing scenario
Authors: Ponnurangam Kumaraguru, Alessandro Acquisti, Lorrie Faith Cranor
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

Trust is an important component of online transactions. The increasing amount and sophistication of spam, phishing, and other semantic attacks increase users' uncertainty about the consequences of their actions and their distrust towards other online parties. In this paper, we highlight some key characteristics of a model that we are developing to represent and compare the online trust decision processes of "expert" and "non-expert" computer users. We also report on preliminary data we are gathering to validate, refine, and apply our model. This research is part of a broader project that aims at developing tools and training modules to help online users make good trust decisions.
Data mining of maps and their automatic region-time-theme classification
Authors: Judith Gelernter
Venue: SIGSPATIAL Special (2009)

The goal of this research is to organize maps mined from journal articles into categories for hierarchical browsing within region, time and theme facets. A 150-map training set collected manually was used to develop classifiers. Metadata pertinent to the maps were harvested and then run separately though knowledge sources and our classifiers for region, time and theme. Evaluation of the system based on a 54-map test set of unseen maps showed 69%--93% classification accuracy when compared with two human classifications for the same maps. Data mining and semantic analysis methods used here could support systems that index other types of article components such as diagrams or charts by region, time and theme.
A Fast and Log-Euclidean Polyaffine Framework for Locally Linear Registration
Authors: Vincent Arsigny, Olivier Commowick, Nicholas Ayache, Xavier Pennec
Venue: Journal of Mathematical Imaging and Vision (2009)

In this article, we focus on the parameterization of non-rigid geometrical deformations with a small number of flexible degrees of freedom. In previous work, we proposed a general framework called polyaffine to parameterize deformations with a finite number of rigid or affine components, while guaranteeing the invertibility of global deformations. However, this framework lacks some important properties: the inverse of a polyaffine transformation is not polyaffine in general, and the polyaffine fusion of affine components is not invariant with respect to a change of coordinate system. We present here a novel general framework, called Log-Euclidean polyaffine, which overcomes these defects.We also detail a simple algorithm, the Fast Polyaffine Transform, which allows to compute very efficiently Log-Euclidean polyaffine transformations and their inverses on regular grids. The results presented here on real 3D locally affine registration suggest that our novel framework provides a general and efficient way of fusing local rigid or affine deformations into a global invertible transformation without introducing artifacts, independently of the way local deformations are first estimated.
Making the most of VLSI in microcomputers
Authors: Jerry L. Corbin
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

An introduction to the innovative SCAT design philosophy for VLSI microcomputers of Texas Instruments (TI) is presented. The recently announced 8-bit TMS7000 Microcomputer family is used as an example of a SCAT design. TMS7000 benefits resulting from SCAT include a very dense bar for lower chip costs and microcomputer prices; a unique microprogrammability feature that will allow a user to modify the instruction set for the few applications that require it; and the architectural flexibility that will allow TI to bring many new microcomputer devices to the marketplace quickly and easily. 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
Geodesic Matting: A Framework for Fast Interactive Image and Video Segmentation and Matting
Authors: Xue Bai, Guillermo Sapiro
Venue: International Journal of Computer Vision (2009)

An interactive framework for soft segmentation and matting of natural images and videos is presented in this paper. The proposed technique is based on the optimal, linear time, computation of weighted geodesic distances to user-provided scribbles, from which the whole data is automatically segmented. The weights are based on spatial and/or temporal gradients, considering the statistics of the pixels scribbled by the user, without explicit optical flow or any advanced and often computationally expensive feature detectors. These could be naturally added to the proposed framework as well if desired, in the form of weights in the geodesic distances. An automatic localized refinement step follows this fast segmentation in order to further improve the results and accurately compute the corresponding matte function. Additional constraints into the distance definition permit to efficiently handle occlusions such as people or objects crossing each other in a video sequence. The presentation of the framework is complemented with numerous and diverse examples, including extraction of moving foreground from dynamic background in video, natural and 3D medical images, and comparisons with the recent literature.
Memory Efficient Anonymous Graph Exploration
Authors: Leszek Gąsieniec, Tomasz Radzik
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

Efficient exploration of unknown or unmapped environments has become one of the fundamental problem domains in algorithm design. Its applications range from robot navigation in hazardous environments to rigorous searching, indexing and analysing digital data available on the Internet. A large number of exploration algorithms has been proposed under various assumptions about the capability of mobile (exploring) entities and various characteristics of the environment which are to be explored. This paper considers the graph model, where the environment is represented by a graph of connections in which discrete moves are permitted only along its edges. Designing efficient exploration algorithms in this model has been extensively studied under a diverse set of assumptions, e.g., directed vs undirected graphs, anonymous nodes vs nodes with distinct identities, deterministic vs probabilistic solutions, single vs multiple agent exploration, as well as in the context of different complexity measures including the time complexity, the memory consumption, and the use of other computational resources such as tokens and messages. In this work the emphasis is on memory efficient exploration of anonymous graphs. We discuss in more detail three approaches: random walk, Propp machine and basic walk, reviewing major relevant results, presenting recent developments, and commenting on directions for further research.
The role of computer science minors in undergraduate and graduate curriculums
Authors: Gerald N. Pitts, Barry L. Bateman
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

It has been estimated that over 200,000 computer related jobs went begging in the United States in 1974 because of lack of qualified college graduates. Both Industry and Government are concerned about the lack of practical knowledge of college graduates. A national survey estimated that 95 percent of all undergraduate business majors had to be re-educated to the tune of $8,000 each on the average before they could be considered productive workers.
Direction-of-arrival estimation via twofold mode-projection
Authors: Xiaofeng Gong, Zhiwen Liu, Yougen Xu, Muhammad Ishtiaq Ahmad
Venue: Signal Processing (2009)

A new tensorial model is herein established for a special multi-invariant array of identically oriented ideal electromagnetic (EM) vector-sensors composed of small loops and/or short dipoles, under which a multilinear algebra based direction-of-arrival (DOA) estimation algorithm is proposed. The method provides DOA estimates (decoupled from polarization) by performing a twofold mode-projection which relies on the dual mode orthogonality of the newly defined 'tensor' signal-subspace and twofold mode noise-subspaces. The method can simultaneously exploit the polarization diversity and multi-invariance data structure of an EM vector-sensor array in a compact tensorial fashion, and is very competent for DOA estimation in a multipath environment. Simulation results are provided to illustrate the performance of the proposed method.
Memory Efficient VLSI Architecture for QCIF to VGA Resolution Conversion
Authors: Asmar A. Khan, Shahid Masud
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

This paper presents the design of an FPGA based real time video display size resolution conversion for QCIF to VGA. The architecture is based on a pre-computed memory mapping that facilitates reduction in memory size and latency. The scheme has been realized for real time resolution conversion of a QCIF video at 30 fps. The memory requirement has been reduced to 400 KB which is significantly lower than an earlier hardware based scheme [2] where memory used was nearly 5 MB. The results have been validated on Xilinx Spartan-2E FPGA running at 100MHz. The area of complete design is around 66K gates including input and output memory.
Foraging theory for autonomous vehicle speed choice
Authors: Theodore P. Pavlic, Kevin M. Passino
Venue: Engineering Applications of Artificial Intelligence (2009)

We consider the optimal control design of an abstract autonomous vehicle (AAV). The AAV searches an area for tasks that are detected with a probability that depends on vehicle speed, and each detected task can be processed or ignored. Both searching and processing are costly, but processing also returns rewards that quantify designer preferences. We generalize results from the analysis of animal foraging behavior to model the AAV. Then, using a performance metric common in behavioral ecology, we explicitly find the optimal speed and task processing choice policy for a version of the AAV problem. Finally, in simulation, we show how parameter estimation can be used to determine the optimal controller online when density of task types is unknown.
Educational process model
Authors: Hristo Tujarov, Svetlana Avramova, Stefan Kalchev, Milena Stefanova
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

This paper presented unified model of the educational process. It is based on 3 models examined from different point of view the educational processes and knowledge acquisition. The role and the place of each model are analyzed as well as their relationships.
Using preliminary Ada in a process control application
Authors: M. E. Gordon, W. B. Robinson
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

This section contains background information on the Ada language definition process, an introduction to features of Ada, and an overview of the Model Controller Operating System (MCOS), which was coded in Ada. More detailed information on Ada can be found in The Ada Language Reference Manual, The Ada Language Rationale, and Programming with Ada.
Synthesizing Switching Logic Using Constraint Solving
Authors: Ankur Taly, Sumit Gulwani, Ashish Tiwari
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

A new approach based on constraint solving techniques was recently proposed for verification of hybrid systems. This approach works by searching for inductive invariants of a given form. In this paper, we extend that work to automatic synthesis of safe hybrid systems. Starting with a multi-modal dynamical system and a safety property, we present a sound technique for synthesizing a switching logic for changing modes so as to preserve the safety property. By construction, the synthesized hybrid system is well-formed and is guaranteed safe. Our approach is based on synthesizing a controlled invariant that is sufficient to prove safety. The generation of the controlled invariant is cast as a constraint solving problem. When the system, the safety property, and the controlled invariant are all expressed only using polynomials, the generated constraint is an &exist;&thinsp;&forall; formula in the theory of reals, which we solve using SMT solvers. The generated controlled invariant is then used to arrive at the maximally liberal switching logic.
Loop-R: real-time video interface
Authors: Rui Pereira
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Loop-R is a real-time video performance tool, based in the exploration of low-tech, used technology and human engineering research. With this tool its author is giving a shout to industry, using existing and mistreated technology in innovative ways, combining concepts and interfaces: blending segregated interfaces (GUI and Physical) into one. After graspable interfaces and the "end" of WIMP interfaces, hardware and software blend themselves in a new genre providing free control of video-loops in an expressive hybrid tool.