ppxscal/embedding_network huggingface dataset:
Fiber Orientation Estimation from 3D Image Data: Practical Algorithms, Visualization, and Interpretation
Authors: Katharina Robb, Oliver Wirjadi, Katja Schladitz
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

Fibrous materials such as fiber-reinforced composites are finding increasing application in the automotive, aerospace, and other industries. Fiber arrangements and defects at microscopic scales have direct impact on their stability. Two-dimensional images obtained by either non-destructive or destructive imaging cannot reveal the full fiber orientation information. Therefore, three-dimensional images obtained by micro computed tomography (ìCT) are used. Since segmentation of these image datasets is often difficult due to low contrast, we propose a linear filtering scheme to extract local fiber orientations. Efficient implementations of these filters have been proposed, resulting in practical algorithms with acceptable runtimes in the scale of minutes to at most a few hours for common tomographic image sizes. We show how to condense the local orientation information into visual representations. In contrast to existing 3D orientation estimation methods, our method results in densely sampled orientation maps. The proposed method is applied to images of two different fiber materials and compared to orientation estimates based on measures obtained from integral geometry. We show conformance of the proposed orientation estimation methods with these known methods.
Numerical and experimental studies for the anisotropic etching of silicon with the AFM oxide lines as masks
Authors: Jen Fin Lin, Pal Jen Wei, Chih Kuang Tai, Jung Ching Chung
Venue: Microelectronic Engineering (2008)

A time-dependent numerical scheme is developed to predict the anisotropic etching of silicon formed between two adjacent silicon oxide lines. These oxide lines were prepared by the AFM (atomic force microscope) oxidations under different conditions. The present method developed on the basis of the finite difference method is used to solve the one-dimensional problem considering both the etchant diffusion and the movement of the etched boundary at the bottom surface of a groove. This numerical method is effective to predict the etching rate and etching depth of a groove under the conditions of different etching parameters. Experiments were also carried out in order to check the numerical model. Good agreements can be obtained between the experimental and predicted results. The etching rate of the silicon wafer is lowered by increasing the etching time, and significantly raised by elevating the etching temperature. Apart from the etching parameters, the difference between the aspect ratios exhibited in the fabricated gratings under the conditions of stirring and without stirring is quite significant.
Semantic Computing and Quality Software
Authors: Phillip C. -Y. Sheu
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

The field Semantic Computing applies technolo- gies in natural language processing, data and knowledge engineering, software engineering, computer systems and networks, signal processing and pattern recogni- tion, and any combination of the above to extract, access, transform and synthesize the semantics as well as the contents of multimedia, texts, services and structured data.
Approaching Speed-of-light Distortionless Communication for On-chip Interconnect
Authors: Haikun Zhu, Rui Shi, Chung-Kuan Cheng
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

We extend the surfliner on-chip distortionless transmission line scheme and provide more details for the implementation issues. Surfliner seeks to approach distortionless transmission by intentionally adding shunt resistors between the signal line and the ground. In theory if we distributively make the shunt conductance G=RC/L, there is no distortion at the receiver end and the signal propagates at the speed of light. We show the feasibility and advantages of this shunt resistor scheme by a real design case of single-ended microstrip line in 0.10mum technology. The simulation results indicate we can achieve near perfect signaling of 10 Gbps data over a 10 mm serial link, yet no pre-emphasis/equalization or other special techniques are needed. Guidelines for determining the optimal value and spacing of the shunt resistors are also provided.
Next steps for security assertion markup language (saml)
Authors: Samir Saklikar, Subir Saha
Venue: Proceedings of the 2007 ACM workshop on Secure web services (2007)

The Security Assertion Markup Language (SAML) has established itself as one of the most advanced and popular standards in the Identity Federation and Assertion management space. SAML 2.0 has proved to be an almost complete specification, without requiring any frequent updates to handle various existing Federation scenarios. This paper attempts to analyze and propose incremental enhancements to the SAML core specification, without breaking any of the existing functionality. The goal is to identify such generic extensions, which in turn can enable various other functional usages, inline with SAML.s design goals of Federation Enablement and Asserted Information exchange. The utility of the proposed extensions is proved, by showing how they enable various higher level concepts in SAML, which in turn can enable a richer suite of Federation and Assertion-based interactions. These extensions include Dependent Assertions, Action Assertions, Assertion Queries and Requests, with the final consolidation into a proposed extended SAML framework. This extended SAML framework is used to build a prototype implementation of a Mobile-Device based Web Services framework, for enabling Mobile-Messaging based Service invocations, within a Federation of the Mobile Service Provider and multiple Mobile Application Providers.
A personalised learning environment architecture for e-Learning
Authors: Toshie Ninomiya, Haruhiko Taira, Toshio Okamoto
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

A system architecture for a personalised learning environment in e-Learning is described. First, we present an overview of our learning management system, WebClass RAPSODY, developed for use by the entire student body in a university. Then, a new function including a unit for learning mode to monitor and analyse learners' learning status and a unit for contents to search and analyse the content status is explained. In the unit for learning mode, access files are made at each login from which data indicating the learner's status are generated. In the unit for contents, an agent searches and corrects educational elements of LOM from various LMS, and data indicating the content's status are generated in the LOM database. After learning a given content, this system indicates the next suitable content, using both data of learner's status and content status using a genetic algorithm (GA). This function is capable of supporting learners to sustain e-Learning with good understanding of contents and a high degree of motivation to learn.
Test automation for kernel code and disk arrays with virtual devices
Authors: Lin-Zan Cai, Rong-Shiung Wu, Wen-Ting Huang, Farn Wang
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

In this work, we discuss testing automation issues for kernel code on a high-capacity network-attached storage (NAS) in early development phases when the hardware may not be ready. We propose to construct a high-fidelity versatile emulator for hard disks for the fast configuration of virtual disk arrays. To test kernel libraries, we not only have to figure out the proper values for the kernel procedure parameters, but also have to overcome the rigid resource limitations in kernel space. We propose techniques to profile kernel procedure parameters, drive the kernel procedures from the user space, and construct the testing interface between kernel SUTs (software-under-test) and user space test plans. We have experimented to test the multiple devices driver library used in the NAS server by Quanta Computer Inc. Our techniques support rapid NAS configurations and have been proven useful in locating a proven bug in the Linux kernel
Simplified Shadow Volumes using Silhouette Level-of-Detail
Authors: James Strauss, Amitava Datta
Venue: ICCSA (2007)

This paper presents an optimisation of the existing shadow volume algorithm using a polygonal mesh refinement data structure known as the merge tree. The merge tree is combined with a custom visibility function to generate a mesh refinement known as a silhouette level-of-detail (SLOD). The SLOD retains all original mesh detail in the region of the silhouette and coarsely approximates the mesh elsewhere. Using a SLOD accelerates the creation of shadow volumes in two ways. Firstly, a SLOD contains fewer edges than the original mesh, reducing the time required to find correct silhouette edges. Secondly, a shadow volume produced from a SLOD contains less geometry than a shadow volume produced from the original mesh, hence it may be rendered more quickly.
An Indexing Method for Graphical Documents
Authors: S. Tabbone, D. Zuwala
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper, a method to browse symbols into graphi- cal documents is presented. More precisely, we propose a combined filtering and indexing mechanism that retrieves in an efficient way the most similar symbols to a given input query. For a database of 200000 symbols the retrieval time has been divided by a factor of 4, 5 compared to a linear search.
Iterated Algorithms for the Minimum Energy Broadcast Tree Problem in Wireless Ad Hoc Networks
Authors: Manki Min
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

In this paper, we present an iterated algorithm framework that can be implemented with heuristics in the literature for the minimum energy broadcasting problem in wireless ad hoc networks. We investigate three iterated algorithm implementations, IBIP, IOMEGa, ISOR, that are based on BIP, OMEGa, SOR. The algorithms run iterations to find better solutions of the problem and in each iteration, fixing the source node's transmission power, the algorithm finds the intermediate solutions. And after all the iterations, the algorithm will give the output of the best solution so far. By fixing the source node's transmission power we can get the effect of diverse solution search without hurting the original algorithm's theoretical performance bound. The experimental results confirm that the iterated algorithms significantly improve the solution quality with the help of diverse search.
A Bayesian propensity score adjustment for latent variable modeling and MCMC algorithm
Authors: Takahiro Hoshino
Venue: Computational Statistics Data Analysis (2008)

The estimation of the differences among groups in observational studies is frequently inaccurate owing to a bias caused by differences in the distributions of covariates. In order to estimate the average treatment effects when the treatment variable is binary, Rosenbaum and Rubin [1983. The central role of the propensity score in observational studies for causal effects. Biometrika 70, 41-55] proposed an adjustment method for pre-treatment variables using propensity scores. Imbens [2000. The role of the propensity score in estimating dose-response functions. Biometrika 87, 706-710] extended the propensity score methodology for estimation of average treatment effects with multivalued treatments. However, these studies focused only on estimating the marginal mean structure. In many substantive sciences such as the biological and social sciences, a general estimation method is required to deal with more complex analyses other than regression, such as testing group differences on latent variables. For latent variable models, the EM algorithm or the traditional Monte Carlo methods are necessary. However, in propensity score adjustment, these methods cannot be used because the full distribution is not specified. In this paper, we propose a quasi-Bayesian estimation method for general parametric models that integrate out the distributions of covariates using propensity scores. Although the proposed Bayes estimates are shown to be consistent, they can be calculated by existing Markov chain Monte Carlo methods such as Gibbs sampler. The proposed method is useful to estimate parameters in latent variable models, while the previous methods were unable to provide valid estimates for complex models such as latent variable models. We also illustrated the procedure using the data obtained from the US National Longitudinal Survey of Children and Youth (NLSY1979-2002) for estimating the effect of maternal smoking during pregnancy on the development of the child's cognitive functioning.
Whistle for music: using melody transcription and approximate string matching for content-based query over a MIDI database
Authors: Hung-Che Shen, Chungnan Lee
Venue: Multimedia Tools and Applications (2007)

In this paper, we present a "Whistle for Music" system which enables users to retrieve MIDI format music by whistling a melodic fragment. Three essential components are query processing, MIDI preprocessing and an approximate search engine. For query processing, we have achieved a real-time and robust whistle-to-MIDI converter. For feature extraction, the proposed MIDI preprocessing can extract individual, local and global melodic descriptions from MIDI files. In order to match query with target, we extend an existing search engine into a fast approximate melodic matching engine. Based on the integration of those three components, the system can return a list of MIDI files that are ranked by how closely they match the whistling. The systematic evaluation for the query-by-whistling system is finally performed. The results show that careful measurement and objective comparisons can lead us to know the scaling trend about query and target. One encouraging aspect is that the performance can be predicted based on the evaluation methods.
Scan Diagnosis and Its Successful Industrial Applications
Authors: Wu Yang, Wu-Tung Cheng, Yu Huang, Martin Keim, Randy Klingenberg
Venue: Proceedings of the 16th Asian Test Symposium (2007)

As technologies move below 130nm, the IC industry has seen a significant change in defect type encountered. Feature-related defects are becoming more prevalent than particle-driven defects in nanometer designs. The process and design variances require checks for the design-for-manufacturing (DFM) issues in order to achieve a high yield. Scan diagnosis targeted for the nanometer designs can provide quick, accurate and reliable failure information from the production environment. The ranked, fault classified and physically linked scan diagnosis results can, in turn, provide the guides for DFM checks. High volume diagnosis provides data to yield management system for statistical analysis. This presentation briefly explains the technology behind the scene, discusses scan diagnosis applications and shows the results.
Microsystems Special Monograph: Bit-Sliced Microprocessor Architecture
Authors: N. A. Alexandridis
Venue: Computer (1978)

With the high speed of bipolar technologoy and the flexibility of user-microprogrammability, bit-sliced microprocessors are finding a place in critical applications.
Teradyne's J967 VLSI Test System: Getting VLSI to the Market on Time
Authors: Wayne Ponik
Venue: IEEE Design Test (1985)

The J967 is the newest of Teradyne's J900 series of VLSI test systems. It provides flxible timing and formating; fact accurateparametric tests; and automatic calibration to devices with fewer than 200 leads and bus speeds of up to 20 MHz. The 36 timinggenerators and 1024 timing sets reduce the need for multiple passes or multiple programs to test a device. The J967's intergratedsoftware includes the Berkeley 4.2BSD Unix operating system, T900 test language, automatic data loging, a test analysis program,and Testsim, a software simulation of the J967 for offline debuging. 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
Optimal Guaranteed Cost Control for a Class of Uncertain Systems with both State and Input Delays via Delta Operator Approach
Authors: Jiqing Qiu, Hongjiu Yang, Jinhui Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper, we investigate the optimal guaranteed cost control problem for a class of uncertain delta operator systems with both state and input delays. Based on Lyapunov- Krasovskii functional in delta domain, sufficient conditions for the existence of guaranteed cost controller of the class of delta operator systems are presented in terms of linear matrix inequalities (LMIs). The proposed method can unify some previous related continuous and discrete systems with uncertainties into the delta operator systems framework.
EWall: a visual analytics environment for collaborative sense-making
Authors: Paul E. Keel
Venue: Information Visualization (2007)

We introduce EWall, an experimental visual analytics environment for the support of remote-collaborative sense-making activities. EWall is designed to foster and support 'object focused thinking', where users represent and understand information as objects, construct and recognize contextual relationships among objects, as well as communicate through objects. EWall also offers a unified infrastructure for the implementation and testing of computational agents that consolidate user contributions and manage the flow of information among users through the creation and management of a 'virtual transactive memory'. EWall users operate their individual graphical interfaces to collect, abstract, organize and comprehend task-relevant information relative to their areas of expertise. A first type of computational agents infers possible relationships among information items through the analysis of the spatial and temporal organization and collaborative use of information. All information items and relationships converge in a shared database. A second type of computational agents evaluates the contents of the shared database and provides individual users with a customized selection of potentially relevant information. A learning mechanism allows the computational agents to adapt to particular users and circumstances. EWall is designed to enable individual users to navigate vast amounts of shared information effectively and help remotely dispersed team members combine their contributions, work independently without diverting from common objectives, and minimize the necessary amount of verbal communication.
A Survey of Switch-Level Algorithms
Authors: Randal Bryant
Venue: IEEE Design Test (1987)

The switch-level model provides a logical abstraction from the physical structure of a metal-oxide semiconductor(MOS) circuitto its digital behavior. At the switch level, a circuit is modeled as a network of transistor switches connecting a set ofcharge storage nodes. Node voltages are represented by discrete logic levels, and electrical behavior is modeled in a highlysimplified way. Switch-level algorithms have been applied to such tasks as logic and fault simulation, formal hardware verification,timing analysis, and automatic test program generation. They have been implemented on sequential and parallel computers aswell as by hardware simulation accelerators.
Do Gradations of Time Zone Separation Make a Difference in Performance? A First Laboratory Study
Authors: J. Alberto Espinosa, Ning Nan, Erran Carmel
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

We often hear that global software engineering teams are affected by time differences. While there is considerable research on the difficulties of distance, culture and other dimensions, there has been little research that isolated the impact of just time differences. The research question that guides us is whether there are gradual differences across time zones that impact team performance. In this study we conducted a laboratory experiment with 42 dyadic teams. The teams were randomly assigned into 4 time zone overlap conditions: full overlap, 2/3 overlap, 1/3 overlap and no overlap. Using a fictional map task, we found that participants' perceptions of process are unrelated to actual objective performance measures of speed and accuracy. Consistent with our expectations, we found that a small time separation has no effect on accuracy, but that more time separation has a significant effect on accuracy. Also consistent with our expectations, we found that a small amount of time separation has a significant effect on production speed. However, contrary to our expectations, we found that further increases in partial overlap have less significant effects on speed, and when there is no overlap speed actually increases, albeit not significantly - a "U-shaped" effect.
On-Set Realization of Fail-Safe Sequential Machines
Authors: M. Diaz
Venue: IEEE Transactions on Computers (1974)

Fail-safe sequential machines can be constructed in such a way that if a failure happens in the sequential part, the ulterior functioning must carry on outside the code chosen to represent the set of states. This paper presents a study of the failures in the input combinational circuit and of the feasibility conditions of sequential machines with states coded by a k-out-of-n code. The electronic circuit is realized in a classical way (on-set realization) and must obey two hypotheses, 1) no failure on clock line C, and 2) single fault (stuck at 0 or stuck at 1) on other connections than C.
Rock fracture tracing based on image processing and SVM
Authors: Weixing Wang, Haijun Liao, Ying Huang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Rock fracture tracing is very important in many rock-engineering applications. This paper presents a new methodology for rock fracture detection, description and classification based on image processing technique and support vector machine (SVM). The developed algorithm uses a number of rock surface images those were taken by sophisticated CCD cameras. The studied algorithm processes all the images. Then, the fractures are identified and categorized by SVM. The proposed algorithm has been tested, and the results show that the approach is promising.
A Generalized Record Organization
Authors: D. K. Hsiao
Venue: IEEE Transactions on Computers (1971)

A generalized record organization is proposed from which many flxed and variable length records of hierarchical and network formats can be derived. In developing the generalization, attempts are made to characterize the record organization. By identifying the characteristics of the record organization, it is possible to segregate, for storage, the global record structural information from the local and nonstructural information. Such a segregation can lead to more efficient use of storage, ease of reorganizing the records, and the possibility of multiple organizations for the same set of records. A scheme for specifying the generalized record organization is provided and illustrated.