ppxscal/embedding_network huggingface dataset:
Fabrication of high aspect ratio nano gratings using SR lithography
Authors: Fumiki Kato, Shinya Fujinawa, Yigui Li, Susumu Sugiyama
Venue: Microsystem Technologies (2006)

In this paper, the fabrication technique for high-aspect-ratio diffractive optical element (DOE) is introduced. The 500&#x00a0;nm-width and 1,000&#x00a0;nm-width line-and-space pattern has been successfully fabricated. It was fabricated by synchrotron radiation (SR) lithography for the application of nano gratings, and poly-methylmethacrylate (PMMA) was used as X-ray resist. The nanoscale grating with the aspect ratio of 4.4 and 2.2 was achieved. So far, there are a number of reported techniques for fabrication of DOEs yet the height of those gratings is not sufficient. Therefore, we have attempted to investigate the fabrication of high-aspect-ratio nano gratings by a high-resolution X-ray lithography using SR source at Ritsumeikan University, Japan. Nevertheless, the evaluation of various factors influencing the high-aspect-ratio structure fabricated by our recommended technique is discussed. So far the fabricating process, such as, proximity gap of exposure, the exposure dosage, and the development time have been optimized to fabricate the gratings.
A new perspective on the classical microcode compaction problem
Authors: Steven R. Vegdahl
Venue: ACM SIGMICRO Newsletter (1983)

Some comments are made concerning the generality and complexity of the classical microcode compaction problem. A trivial example is given that no classical compaction algorithm would compact optimally, because the computation of data precedence relations is dependent on the order of the source code. It is further argued that the classical compaction problem can be solved optimally in polynomial time, where the degree of the polynomial is dependent only on the micromachine architecture. We conclude that the most difficult portion of the microcode compaction problem is that of initially ordering the source code.
Neural mechanism for stochastic behaviour during a competitive game
Authors: Alireza Soltani, Daeyeol Lee, Xiao-Jing Wang
Venue: Neural Networks (2006)

Previous studies have shown that non-human primates can generate highly stochastic choice behaviour, especially when this is required during a competitive interaction with another agent. To understand the neural mechanism of such dynamic choice behaviour, we propose a biologically plausible model of decision making endowed with synaptic plasticity that follows a reward-dependent stochastic Hebbian learning rule. This model constitutes a biophysical implementation of reinforcement learning, and it reproduces salient features of behavioural data from an experiment with monkeys playing a matching pennies game. Due to interaction with an opponent and learning dynamics, the model generates quasi-random behaviour robustly in spite of intrinsic biases. Furthermore, non-random choice behaviour can also emerge when the model plays against a noninteractive opponent, as observed in the monkey experiment. Finally, when combined with a meta-learning algorithm, our model accounts for the slow drift in the animal's strategy based on a process of reward maximization.
Economy of scale effects for large wafer fabs
Authors: Oliver Rose
Venue: Proceedings of the 38th conference on Winter simulation (2006)

In this paper, we present the results of a simulation study for semiconductor wafer fabrication facilities (wafer fabs) where we multiplied the number of tools per tool group and the number of operators. We were interested in the effects on the product cycle times when we keep the fab utilization constant while increasing the size of the tool groups by constant factors, i.e., forming so-called giga fabs. It turns out, that the drop in cycle time is considerable.
Smarty Php Template Programming And Applications
Authors: Hasin Hayder, J. P. Maia, L. Gheorge
Venue:  (2006)

Smarty is a templating engine for PHP. Designers who are used to working with HTML files can work with Smarty templates, which are HTML files with simple tags while programmers work with the underlying PHP code. The Smarty engine brings the code and templates together. The result of all this is that designers can concentrate on designing, programmers can concentrate on programming, and they don't need to get in each others way so much. Even if you are developing a site on your own, Smarty is a powerful way to make your code clearer to you and others, as well as easier to debug and modify later.
Oracle JDeveloper 10g for Forms PL/SQL Developers: A Guide to Web Development with Oracle ADF, 1 edition
Authors: Peter Koletzke, Duncan Mills
Venue:  (2006)

The most efficient way to learn J2EE programming techniques Two Oracle experts demonstrate techniques for working within J2EE and JDeveloper for the thousands of developers currently using Oracle Forms and the PL/SQL language. Oracle is shifting their focus towards Java technologies, so you will need to know how to use the Java-based J2EE and JDeveloper. The book includes explanations of the Application Development Framework (ADF). Throughout, high-level and low-level Forms concepts are related to Java concepts so that you can become comfortable with the new terminology. Covers the new components required when developing and deploying a J2EE application Special mentions in the text describe how JDeveloper techniques translate to PL/SQL or Oracle Forms Covers JDeveloper 10.1.3 and ADF Faces All code and examples will be available online Table of contentsForewordAcknowledgmentsIntroductionPart I: Technology OverviewsChapter 1: J2EE BasicsChapter 2: Web CommunicationsChapter 3: JDeveloper and ADF as RAD ToolsChapter 4: Required Web Languages and Java Language BasicsChapter 5: JavaServer Faces BasicsChapter 6: Business Services in ADFChapter 7: The ADF Model LayerChapter 8: ADF Model Advanced BindingsPart II: Developing the ApplicationChapter 9: Your First JSFChapter 10: Application Design Principles and Sample Application OverviewChapter 11: Home Page and MenusChapter 12: Search PageChapter 13: Edit PageChapter 14: Adding SecurityPart III: Additional TechniquesChapter 15: Sample Application EnhancementsChapter 16: Oracle JHeadstartINDEX
JavaScript and Ajax for the Web, Sixth Edition (Visual QuickStart Guide)
Authors: Tom Negrino, Dori Smith
Venue:  (2006)

Need to learn JavaScript fast? This best-selling reference's visual format and step-by-step, task-based instructions will have you up and running with JavaScript in no time. In this completely updated edition of our best-selling guide to JavaScript, leading Web and computing experts Tom Negrino and Dori Smith use crystal-clear instructions and friendly prose to introduce you to all of today's JavaScript essentials. Along the way, you'll find extensive coverage of Ajax and XML techniques, current browsers (Opera, Safari, Firefox), and more. Visual QuickStart Guide--the quick and easy way to learn! Easy visual approach uses pictures to guide you through JavaScript and show you what to do. Concise steps and explanations get you up and running in no time. Page for page, the best content and value around. Companion Web site at www.javascriptworld.com offers sample scripts, updates, and more!
Multi-View Stereo Reconstruction and Scene Flow Estimation with a Global Image-Based Matching Score
Authors: Jean-Philippe Pons, Renaud Keriven, Olivier Faugeras
Venue: International Journal of Computer Vision (2007)

We present a new variational method for multi-view stereovision and non-rigid three-dimensional motion estimation from multiple video sequences. Our method minimizes the prediction error of the shape and motion estimates. Both problems then translate into a generic image registration task. The latter is entrusted to a global measure of image similarity, chosen depending on imaging conditions and scene properties. Rather than integrating a matching measure computed independently at each surface point, our approach computes a global image-based matching score between the input images and the predicted images. The matching process fully handles projective distortion and partial occlusions. Neighborhood as well as global intensity information can be exploited to improve the robustness to appearance changes due to non-Lambertian materials and illumination changes, without any approximation of shape, motion or visibility. Moreover, our approach results in a simpler, more flexible, and more efficient implementation than in existing methods. The computation time on large datasets does not exceed thirty minutes on a standard workstation. Finally, our method is compliant with a hardware implementation with graphics processor units. Our stereovision algorithm yields very good results on a variety of datasets including specularities and translucency. We have successfully tested our motion estimation algorithm on a very challenging multi-view video sequence of a non-rigid scene.
A partition method for the solution of a coupled liquid-structure interaction problem
Authors: Edoardo Bucchignani, Fulvio Stella, Fabio Paglia
Venue: Applied Numerical Mathematics (2004)

A numerical code is presented to study the motion of an incompressible inviscid flow in a deformable tank. It is based on a method belonging to the partition treatment class, as the fluid and structural fields are solved by coupling two distinct models. The fluid field is modeled by the Laplace equation and numerically solved by a Finite Volume technique. The computational grid is updated at each time step to take into account the movements of the free surface and the deformations of the vertical walls. An unsteady finite element formulation is used for modeling the tank on a grid discretized by triangular elements and linear shape functions. Results are presented for two different cases: a flow induced by a perturbation on the free surface in a tank motionless; a flow in a tank forced to oscillate periodically in the horizontal direction.
Rapid and brief communication: Active learning for image retrieval with Co-SVM
Authors: Jian Cheng, Kongqiao Wang
Venue: Pattern Recognition (2007)

In relevance feedback algorithms, selective sampling is often used to reduce the cost of labeling and explore the unlabeled data. In this paper, we proposed an active learning algorithm, Co-SVM, to improve the performance of selective sampling in image retrieval. In Co-SVM algorithm, color and texture are naturally considered as sufficient and uncorrelated views of an image. SVM classifiers are learned in color and texture feature subspaces, respectively. Then the two classifiers are used to classify the unlabeled data. These unlabeled samples which are differently classified by the two classifiers are chose to label. The experimental results show that the proposed algorithm is beneficial to image retrieval.
Reduce shadow size in aspect ratio invariant visual secret sharing schemes using a square block-wise operation
Authors: Ching-Nung Yang, Tse-Shih Chen
Venue: Pattern Recognition (2006)

An aspect ratio invariant visual secret sharing (ARIVSS) scheme is a perfectly secure method for sharing secret images. Due to the nature of the VSS encryption, each secret pixel is expanded to m sub-pixels in each of the generated shares. The advantage of ARIVSS is that the aspect ratio of the recovered secret image is fixed and thus there is no loss of information when the shape of the secret image is our information. For example, a secret image of a circle is compromised to an ellipse if m does not have a square value. Two ARIVSS schemes based on processing one and four pixel blocks, respectively, were previously proposed. In this paper, we have generalized the square block-wise approach to further reduce pixel expansion.
Integer programming: enumeration - complete and implicit
Authors: C. A. Haverly
Venue: Issue 12 (June 1972) (1972)

Integer problems are ones in which the variables are required to have integer answers. All of the variables may be required to be integer or only some of the variables. This latter is called mixed integer programming. Some problems only require that the integer variables take on the value of 0 or 1 while other problems allow a range of integer values such as 0, 1, 2, 3, or 4. 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
Windows XP Personal Trainer
Venue:  (2004)

The most widely used operating system in the world, XP is certainly the most reliable and best-looking version of Windows. But it comes with a baffling multitude of features and functionality that you'll struggle to understand--despite all of the hours you've logged with Windows 2000, Windows Me, 98 or 95. And if you're a beginner, where do you start? Windows XP Personal Trainer enables beginners and experts alike to become black belts, quickly and easily. This fully illustrated book takes a modular approach to learning, allowing you to start with the fundamentals and work your way to advance topics through dozens of task-oriented lessons--at your own pace. The companion CD tutorial guides you through each lesson interactively. With plenty of detailed diagrams, Windows XP Personal Trainer includes sections on: Working with Windows Using the programs included with Windows XP (such as Media Player) Organizing files and folders Modifying the taskbar and desktop Customizing Windows XP Optimizing and maintaining the operating system Exploring the Internet Networking with Windows XP If you already have experience with Windows XP, you can dive right into those topics (and only those topics) that you need or want to learn. Unlike many consumer software tutorials that dumb down the material or present it in a confusing fashion, Windows XP Personal Trainer is written in a non-technical and engaging style that you will find fun, easy, and most of all, clear and informative. You can become proficient without wading through tons of jargon and technical information. Part of our new Personal Trainer Series, this book is based on content from CustomGuide ( http://www.customguide.com">), a leading provider of computer training materials. Founded by instructors who grew dissatisfied with the industry's dry course materials, CustomGuide offers courseware (for instructors and students), quick references, to software bulletins and e-learning courses that are fun, flexible, and easy to use. 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
Both motivational and training factors affect response conflict choice performance in rats
Authors: Josephine E. Haddon, Simon Killcross
Venue: Neural Networks (2006)

Rats were trained on two biconditional discrimination tasks, in two different contexts, and were rewarded with two different outcomes. At test, they received presentations of audiovisual compounds of these training stimuli, in extinction. These compounds were formed in such way that the individual elements had dictated either the same (congruent trials) or different (incongruent trials) responses during training, and each stimulus element had previously been rewarded with a different outcome. Previous research has shown that rats use the contextual cues to disambiguate the conflicting response information provided by incongruent stimulus compounds. Experiment 1 demonstrated that this contextual control was goal-directed in the sense that it depended on the current value of the outcome and Experiment 2 demonstrated that both the training history of the biconditional stimuli and motivational influences influenced the contextual control of responding on incongruent trials. These results are discussed in relation to current models of choice behaviour.
Development of robust design optimization using incomplete data
Authors: Seong Beom Lee, Chanseok Park
Venue: Computers and Industrial Engineering (2006)

In robust design, the main goal is to select the levels of the controllable factors to obtain the optimal operating conditions. To this end, Taguchi recommends that statistical experimental design methods be employed. To adopt his approach, we need to observe a number of replicated observations at each design point. A commonly used assumption behind the data collection procedure is that all the data are fully observed.However, in many industrial experiments, interval-censored observations are frequently available in addition to the fully observed observations. For example, the products are often inspected by a "go or no-go" inspection system which typically provides interval-censored data. Even though fully observed observations are preferred, only partially observed or interval-censored observations are available in practice owing to inherent limitations or time/cost considerations. When a data set consists of both partially and fully observed observations, it is commonly referred to as "incomplete" in the statistics, literature.In this paper, we calculate the optimal operating conditions for the process based on a dual response approach using incomplete data. For robust design optimization problems, the dual response approach is a commonly used technique but the novel approach in this study is that we estimate the process mean and variance with incomplete data using the EM algorithm. Thus, it is possible to find the optimal operating conditions using all of the information available. The applicability of the proposed method is illustrated for a case study incorporating incomplete data. The performance of the proposed method is compared with the ordinary method through Monte Carlo simulations and this substantiates the proposed method.
A novel pattern recognition algorithm to classify membrane protein unfolding pathways with high-throughput single-molecule force spectroscopy
Authors: Annalisa Marsico, Dirk Labudde, Tanuj Sapra, Daniel J. Muller, Michael Schroeder
Venue: Bioinformatics (2007)

Motivation: Misfolding of membrane proteins plays an important role in many human diseases such as retinitis pigmentosa, hereditary deafness and diabetes insipidus. Little is known about membrane proteins as there are only very few high-resolution structures. Single-molecule force spectroscopy is a novel technique, which measures the force necessary to pull a protein out of a membrane. Such force curves contain valuable information on the protein structure, conformation, and inter- and intra-molecular forces. High-throughput force spectroscopy experiments generate hundreds of force curves including spurious ones and good curves, which correspond to different unfolding pathways. Manual analysis of these data is a bottleneck and source of inconsistent and subjective annotation. Results: We propose a novel algorithm for the identification of spurious curves and curves representing different unfolding pathways. Our algorithm proceeds in three stages: first, we reduce noise in the curves by applying dimension reduction; second, we align the curves with dynamic programming and compute pairwise distances and third, we cluster the curves based on these distances. We apply our method to a hand-curated dataset of 135 force curves of bacteriorhodopsin mutant P50A. Our algorithm achieves a success rate of 81% distinguishing spurious from good curves and a success rate of 76% classifying unfolding pathways. As a result, we discuss five different unfolding pathways of bacteriorhodopsin including three main unfolding events and several minor ones. Finally, we link folding barriers to the degree of conservation of residues. Overall, the algorithm tackles the force spectroscopy bottleneck and leads to more consistent and reproducible results paving the way for high-throughput analysis of structural features of membrane proteins. Contact: annalisa.marsico@biotec.tu-dresden.de
A supervised approach for identifying discriminating genotype patterns and its application to breast cancer data
Authors: Nir Yosef, Zohar Yakhini, Anya Tsalenko, Vessela Kristensen, Anne-Lise Børresen-Dale, Eytan Ruppin, Roded Sharan
Venue: Bioinformatics (2007)

Motivation: Large-scale association studies, investigating the genetic determinants of a phenotype of interest, are producing increasing amounts of genomic variation data on human cohorts. A fundamental challenge in these studies is the detection of genotypic patterns that discriminate individuals exhibiting the phenotype under study from individuals that do not posses it. The difficulty stems from the large number of single nucleotide polymorphism (SNP) combinations that have to be tested. The discrimination problem becomes even more involved when additional high-throughput data, such as gene expression data, are available for the same cohort. Results: We have developed a graph theoretic approach for identifying discriminating patterns (DPs) for a given phenotype in a genotyped population. The method is based on representing the SNP data as a bipartite graph of individuals and their SNP states, and identifying fully connected subgraphs of this graph that relate individuals enriched for a given phenotypic group. The method can handle additional data types such as expression profiles of the genotyped population. It is reminiscent of biclustering approaches with the crucial difference that its search process is guided by the phenotype under consideration in a supervised manner. We tested our approach in simulations and on real data. In simulations, our method was able to retrieve planted patterns with high success rate. We then applied our approach to a dataset of 72 breast cancer patients with available gene expression profiles, genotyped over 695 SNPs. We detected several DPs that were highly significant with respect to various clinical phenotypes, and investigated the groups of patients and the groups of genes they defined. We found the patient groups to be highly enriched for other phenotypes and to display expression coherency among their profiles. The gene groups displayed functional coherency and involved genes with known role in cancer, providing additional support to their involvement. Availability: The program is available upon request. Contact: roded@post.tau.ac.il
Termination analysis of logic programs through combination of type-based norms
Authors: Maurice Bruynooghe, Michael Codish, John P. Gallagher, Samir Genaim, Wim Vanhoof
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2007)

This article makes two contributions to the work on semantics-based termination analysis for logic programs. The first involves a novel notion of type-based norm where for a given type, a corresponding norm is defined to count in a term the number of subterms of that type. This provides a collection of candidate norms, one for each type defined in the program. The second enables an analyzer to base termination proofs on the combination of several different norms. This is useful when different norms are better suited to justify the termination of different parts of the program. Application of the two contributions together consists in considering the combination of the type-based candidate norms for a given program. This results in a powerful and practical technique. Both contributions have been introduced into a working termination analyzer. Experimentation indicates that they yield state-of-the-art results in a fully automatic analysis tool, improving with respect to methods that do not use both types and combined norms.