ppxscal/embedding_network huggingface dataset:
Reliability study of hermetic wafer level MEMS packaging with through-wafer interconnect
Authors: Sung-Hoon Choa
Venue: Microsystem Technologies (2009)

In this paper, we developed a hermetic wafer level packaging for MEMS devices. Au&#x2013;Sn eutectic bonding technology in a relatively low temperature is used to achieve hermetic sealing, and the vertical through-hole via filled with electroplated copper for the electrical connection is also used. The MEMS package has the size of 1&#x00a0;mm&#x00a0;&#x00d7;&#x00a0;1&#x00a0;mm&#x00a0;&#x00d7;&#x00a0;700&#x00a0;&#x03bc;m, and a square loop Au&#x2013;Sn metallization of 70&#x00a0;&#x03bc;m in width for hermetic sealing. The robustness of the package is confirmed by several tests such as shear strength test, reliability tests, and hermeticity test. The reliability issues of Au&#x2013;Sn bonding technology, and copper through-wafer interconnection are discussed, and design considerations to improve the reliability are also presented. By applying O2 plasma ashing and fabrication process optimization, we can achieve the void-free structure within the bonding interface. The mechanical effects of copper through-vias are also investigated numerically and experimentally. Several factors which could induce via hole cracking failure are investigated such as thermal expansion mismatch, via etch profile, copper diffusion phenomenon, and cleaning process. Alternative electroplating process is suggested for preventing Cu diffusion and increasing the adhesion performance of the electroplating process. 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
Unifying Density-Based Clustering and Outlier Detection
Authors: Yunxin Tao, Dechang Pi
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Density-based clustering and density-based outlier detection have been extensively studied in the data mining. However, Existing works address density-based clustering or density-based outlier detection solely. But for many scenarios, it is more meaningful to unify density-based clustering and outlier detection when both the clustering and outlier detection results are needed simultaneously. In this paper, a novel algorithm named DBCOD that unifies density-based clustering and outlier detection is proposed. In order to discover density-based clusters and assign to each outlier a degree of being an outlier, a novel concept called neighborhood-based local density factor (NLDF) is employed. The experimental results on different shape, large-scale, and high-dimensional databases demonstrate the effectiveness and efficiency of our method.
Improved approximation bounds for edge dominating set in dense graphs
Authors: Jean Cardinal, Stefan Langerman, Eythan Levy
Venue: Theoretical Computer Science (2009)

We analyze the simple greedy algorithm that iteratively removes the endpoints of a maximum-degree edge in a graph, where the degree of an edge is the sum of the degrees of its endpoints. This algorithm provides a 2-approximation to the minimum edge dominating set and minimum maximal matching problems. We refine its analysis and give an expression of the approximation ratio that is strictly less than 2 in the cases where the input graph has n vertices and at least @e(n2) edges, for @e>1/2. This ratio is shown to be asymptotically tight for @e>1/2.
The Effect of Corners on the Complexity of&#x00a0;Approximate Range Searching
Authors: Sunil Arya, Theocharis Malamatos, David M. Mount
Venue: Discrete Computational Geometry (2009)

Given an n-element point set in &#x211d;d , the range searching problem involves preprocessing these points so that the total weight, or for our purposes the semigroup sum, of the points lying within a given query range &#x03b7; can be determined quickly. In &#x03b5;-approximate range searching we assume that &#x03b7; is bounded, and the sum is required to include all the points that lie within &#x03b7; and may additionally include any of the points lying within distance &#x03b5;&#x22c5;diam(&#x03b7;) of &#x03b7;&#x2019;s boundary. In this paper we contrast the complexity of approximate range searching based on properties of the semigroup and range space. A semigroup (S,+) is idempotent if x+x=x for all x&#x2208;S, and it is integral if for all k&#x2265;2, the k-fold sum x+&#x22c5;&#x22c5;&#x22c5;+x is not equal to x. Recent research has shown that the computational complexity of approximate spherical range searching is significantly lower for idempotent semigroups than it is for integral semigroups in terms of the dependencies on &#x03b5;. In this paper we&#x00a0;consider whether these results can be generalized to other sorts of ranges. We show that, as with integrality, allowing sharp corners on ranges has an adverse effect on the complexity of the problem. In particular, we establish lower bounds on the worst-case complexity of approximate range searching in the semigroup arithmetic model for ranges consisting of d-dimensional unit hypercubes under rigid motions. We show that for arbitrary (including idempotent) semigroups and linear space, the query time is at least $\varOmega(1/{\varepsilon }^{d-2\sqrt{d}})$. In the case of integral semigroups we prove a tighter lower bound of &#x03a9;(1/&#x03b5; d&#x2212;2). These lower bounds nearly match existing upper bounds for arbitrary semigroups. In contrast, we show that the improvements offered by idempotence do apply to smooth convex ranges. We say that a range is smooth if at every boundary point there is an incident Euclidean sphere that lies entirely within the range whose radius is proportional to the range&#x2019;s diameter. We show that for smooth ranges and idempotent semigroups, &#x03b5;-approximate range queries can be answered in O(log&#x2009;n+(1/&#x03b5;)(d&#x2212;1)/2log&#x2009;(1/&#x03b5;)) time using O(n/&#x03b5;) space. We show that this is nearly tight by presenting a lower bound of &#x03a9;(log&#x2009;n+(1/&#x03b5;)(d&#x2212;1)/2). This bound is in the decision-tree model and holds irrespective of space.
Ability to forecast unsteady aerodynamic forces of flapping airfoils by artificial neural network
Authors: Dilek Funda Kurtulus
Venue: Neural Computing and Applications (2009)

The ability of artificial neural networks (ANN) to model the unsteady aerodynamic force coefficients of flapping motion kinematics has been studied. A neural networks model was developed based on multi-layer perception (MLP) networks and the Levenberg&#x2013;Marquardt optimization algorithm. The flapping kinematics data were divided into two groups for the training and the prediction test of the ANN model. The training phase led to a very satisfactory calibration of the ANN model. The attempt to predict aerodynamic forces both the lift coefficient and drag coefficient showed that the ANN model is able to simulate the unsteady flapping motion kinematics and its corresponding aerodynamic forces. The shape of the simulated force coefficients was found to be similar to that of the numerical results. These encouraging results make it possible to consider interesting and new prospects for the modelling of flapping motion systems, which are highly non-linear systems.
Face Verification base-on Hausdorff-Shape Context
Authors: Rerkchai Fooprateepsiri, Werasak Kurutach
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

This paper proposes a highly robust method for face recognition and authentication. Techniques introduced in this work are composed of two stages. Firstly, the feature of face is to be detected by the principle of Trace Transform. Then, in the second stage, the Hausdorff distance and Shape Context are employed to measure and determine of similarity between models and test images. From the experimental result of 6,325 images, the average of accuracy rate is higher than 84%.
Dynamic photorefraction system: An offline application for the dynamic analysis of ocular focus and pupil size from photorefraction images
Authors: Rajaraman Suryakumar, Derek Kwok, Sheldon Fernandez, William R. Bobier
Venue: Computers in Biology and Medicine (2009)

Eccentric photorefraction is an optical technique used to assess static and/or dynamic changes in ocular focus (accommodation), ocular alignment (vergence) and pupil size. In this paper, we have developed and tested an offline application namely the dynamic photorefraction system (DPRS) which allows an accurate analysis of accommodation and pupil size from eccentric photorefraction images. The application uses the Microsoft componentized technology known as the Component Object Model (COM), includes distinct libraries for importing photorefraction videos and provides an accurate analysis and output of pupil size and accommodation. In addition, the system can interface with any custom built photorefractor allowing a widespread application in vision science experiments involving simultaneous measures of ocular focus and pupil size.
Scorm based e-learning: a case study of computer-aided drafting course at a vocational high school in Taiwan
Authors: Che-Chern Lin, Jia-Hseng Pan
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this paper, we propose a case study to compare the learning difference on a Computer added Drafting (CAD) course between traditional learning and e-learning. Seventy-four students of grade 11 attended the experiment. They were from a mechanical engineering department at a vocational high school in Taiwan. These students were divided into two groups: the control group and the treatment group. The control group was provided with traditional learning in a regular classroom. The treatment group utilized an e-learning platform to conduct learning activities. The learning materials for the e-learning were designed in Shareable Contents Object Reference Model (SCORM) standard. We introduce the structure of SCORM and the computer packages used in this study. We also describe the experimental environments for this study. The experimental results show that the learning performance between the traditional learning and the e-learning on CAD course is not different.
RAP: an associative processor for data base management
Authors: E. A. Ozkarahan, S. A. Schuster, K. C. Smith
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Recent concepts in data base management systems (DBMS) necessitate making the logical view and the physical representation of data distinct from each other. Currently, this requirement has to be realized in the environment of conventional Von Neumann architecture. This creates the need for several levels of indirection for mapping one structure into the other. Also, efficient search mechanisms are needed to handle large data bases within concurrent processing and on-line response limits. The implementation of these requirements results in software complexities and inefficiencies in the following way. Pointer mechanisms for mapping structures and providing fast access paths have to be implemented by software and data. These pointers are extra data requiring extensive overhead in storage, access time, and maintenance.
CSCW from Coordination to Collaboration
Authors: Nabil Elmarzouqi, Eric Garcia, Jean-Christophe Lapayre
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

Working in a group consists of setting up an environment that allows the different participants to work together. The collaboration has now become then a discipline that fascinates the distributed environments as well as the Human/Machine interactions. The big challenge of the CSCW environments is to be able to give the necessary mechanisms in order to carry out effective collaborative work i.e. to put the actors together in a virtual room which simulates a real situation of groupware meeting. We would like to present a model of architecture that places the actors in a situation of virtual grouping centered on the awareness and that spreads on a Continuum of collaboration representing a continuity of the group work augmented by the functional spaces of the clover model. We have applied this model of architecture to the European project of tele-neurology (TeNeCi) which offers a platform of telecommuting enriched by several functionalities presented to the neurologists to assure a telediagnosis in the group.
Community of inquiry as a theoretical framework to foster "epistemic engagement" and "cognitive presence" in online education
Authors: Peter Shea, Temi Bidjerano
Venue: Computers Education (2009)

In this paper, several recent theoretical conceptions of technology-mediated education are examined and a study of 2159 online learners is presented. The study validates an instrument designed to measure teaching, social, and cognitive presence indicative of a community of learners within the community of inquiry (CoI) framework [Garrison, D. R., Anderson, T., & Archer, W. (2000). Critical inquiry in a text-based environment: Computer conferencing in higher education. The Internet and Higher Education, 2, 1-19; Garrison, D. R., Anderson, T., & Archer, W. (2001). Critical thinking, cognitive presence, and computer conferencing in distance education. American Journal of Distance Education, 15(1), 7-23]. Results indicate that the survey items cohere into interpretable factors that represent the intended constructs. Further it was determined through structural equation modeling that 70% of the variance in the online students' levels of cognitive presence, a multivariate measure of learning, can be modeled based on their reports of their instructors' skills in fostering teaching presence and their own abilities to establish a sense of social presence. Additional analysis identifies more details of the relationship between learner understandings of teaching and social presence and its impact on their cognitive presence. Implications for online teaching, policy, and faculty development are discussed.
Design and optimization of a digital microfluidic biochip for protein crystallization
Authors: Tao Xu, Krishnendu Chakrabarty, Vamsee K. Pamula
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Proteins crystallization is a commonly used technique for protein analysis and subsequent drug design. It predicts the three-dimensional arrangement of the constituent amino acids, which in turn indicates the specific biological function of a protein. Protein crystallization experiments are typically carried out manually on multi-well plates in the laboratory. These experiments are slow, expensive, and error-prone. We present the design of a multi-well plate microfluidic biochip for protein crystallization; this biochip can transfer protein samples, prepare candidate solutions, and carry out crystallization automatically. To reduce the manufacturing cost of such devices, we present an efficient algorithm to generate a pin-assignment plan for the proposed design. The resulting biochip enables control of a large number of on-chip electrodes using only a small number of pins. Based on the pin-constrained chip design, we present an efficient shuttle-passenger-like droplet manipulation method to achieve high-throughput and defect-tolerant well loading.
Open Collaboration within Corporations Using Software Forges
Authors: Dirk Riehle, John Ellenberger, Tamir Menahem, Boris Mikhailovski, Yuri Natchetoi, Barak Naveh, Thomas Odenwald
Venue: IEEE Software (2009)

A software forge is a tool platform for collaborative software development, similar to integrated CASE environments. Unlike CASE tools, however, software forges have been designed for the software development practices of the open source community. The authors discuss their experiences using a software forge to bring open source best practices into corporations. They present the design principles and benefits of a firm-internal software forge and include a case study of how one project at SAP benefitted significantly from being on the forge.
Sales Forecasting through Fuzzy Neural Networks
Authors: Yihang Liu, Lieli Liu
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

In business strategy, sales forecasting is increasingly getting more and more attention. Numerous academic studies addressing this problem have generally employed statistical methods, such as regression or autoregressive and moving average (ARMA). However, sales forecasting is rather complicated because of numerous internal and external factors comes from the surrounding environment. Artificial neural networks (ANN) have been introduced into the sales forecasting method as their expected performance in the field of control. Even though, because of particular industry features, such as, promotion, advertisement, style and life span, all these determinants will influence the performance of ANN, so this study applies the Fuzzy neural networks (FNN) which is constructed of computational intelligence that come with significant learning abilities and inherent transparency. The real-world problem results not only show that FNN with weight elimination have lower training error, but also the outperformed performance of this proposed method compared with traditional statistical method and single ANN in accuracy.
System for efficient program portability
Authors: George N. Baird, L. Arnold Johnson
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The acquisition of major Automatic Data Processing Equipment (ADPE) systems in the Department of the Navy is accomplished by either single source acquisition or competitive selection. In the case of the single source acquisition, only one vendor is considered as having the system capable of satisfying the needs of the procuring organization. The criteria which must be satisfied for a single source acquisition include the need for unique hardware, excessive conversion/reprogramming cost and/or time, etc. The competitive selection, on the other hand, is open to any vendor who feels he can provide a system meeting the requirements specified in the solicitation document associated with that procurement.
Computational Models of the Human Body for Medical Image Analysis
Authors: Nicholas Ayache
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

Medical image analysis brings about a collection of powerful new tools designed to better assist the clinical diagnosis and to model, simulate, and guide more efficiently the patient's therapy. A new discipline has emerged in computer science, closely related to others like computer vision, computer graphics, artificial intelligence and robotics.In this talk, I describe the increasing role of computational models of anatomy and physiology to guide the interpretation of complex series of medical images, and illustrate my presentation with applications to cardiac and brain diseases. I conclude with some promising trends, including the analysis of in vivo confocal microscopic images.N. Ayache, O. Clatz, H. Delingette, G. Malandain, X. Pennec, and M. Sermesant. Asclepios: a Research Project at INRIA for the Analysis and Simulation of Biomedical Images. In Proceedings of the Colloquium in Memory of Gilles Kahn, LNCS, 2007. Springer. Note: In press (20 pages).This reference and others are available at http://www-sop.inria.fr/asclepios/.
Resonance on the web: web dynamics and revisitation patterns
Authors: Eytan Adar, Jaime Teevan, Susan T. Dumais
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

The Web is a dynamic, ever-changing collection of information accessed in a dynamic way. This paper explores the relationship between Web page content change (obtained from an hourly crawl of over 40K pages) and people's revisitation to those pages (collected via a large scale log analysis of 2.3M users). We identify the relationship, or resonance, between revisitation behavior and the amount and type of changes on those pages. By coupling our large scale log analysis with a complementary user study we explore the intent behind the revisitation behavior we observed. Using the notion of resonance to identify the likely content of interest, we describe a number of ways interaction with changing and revisited information can be better supported. We illustrate how understanding the association between change and revisitation might improve browser, crawler, and search engine design, and present a specific example of how knowledge of both can enable relevant content to be highlighted.
Geometric matching for clip-art drawing retrieval
Authors: Pedro Sousa, Manuel J. Fonseca
Venue: Journal of Visual Communication and Image Representation (2009)

Currently, there are large collections of clip-art vector drawings from which users can select the desired figures to insert in their documents. However, to locate a particular drawing among thousands is not easy. Although there are some solutions for drawing retrieval, almost all of them are designed to retrieve simple and not complex drawings as for instance clip-arts. In our prior work we proposed an approach to index and retrieve complex vector drawings by content, using topological and geometric information automatically extracted from figures. In this paper, we present a new algorithm to improve the geometric matching of two drawings, which takes into account the drawing as a whole and each of the shapes in it. We developed a web search engine for clip-art drawings, where we included this new technique. Experimental evaluation reveals that this new geometric matching algorithm conducts to better retrieval results than the prior matching solution.
Use of computer in relation to critical guidance factors
Authors: Russell N. Cassel
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The single most critical of all guidance factors must of necessity deal directly with manpower national resources, and this always means getting the right man in the right job. Indeed, the productivity of a nation's manpower derives alone from such a consideration. Much more important than productivity is the morale of people, but which derives directly from their own personal efficiency in productivity, and which under the principles of humanistic psychology leads to their own self-actualization. Then too, the most cherished possession of men everywhere remains human freedom, and the only real freedom that man ever knows is the degree to which he becomes self actualized, or the degree to which he makes use of his own full potential for productivity.
London Algorithmics and Stringology 2006
Authors: J Daykin, M Mohamed, K Steinhoefel
Venue:  (2007)

The annual London Algorithmic Workshop and London Stringology Day provide a forum for the presentation and discussion of ongoing research and current problems in the field of general algorithmics and string algorithms in particular. The present volume summarizes the main results and developments presented at these events in 2006. The contributions are dedicated to aspects of string matching and alignment algorithms, complexity analysis of graph theoretic problems and efficient data structures for string analysis.
On one approach to the solution of the problem of guaranteeing estimation for Volterra equations
Authors: A. B. Bashkov
Venue: Automation and Remote Control (2009)

The problem of minimax filtration for systems described by discrete Volterra equations is considered. It is suggested that a simpler estimation algorithm instead of an optimal one be used. With the aid of the theory of duality, the quality estimate of such an approximation is obtained.