ppxscal/embedding_network huggingface dataset:
A novel overlay process for imprint lithography using load release and alignment error pre-compensation method
Authors: Jinyou Shao, Yucheng Ding, Yiping Tang, Hongzhong Liu, Bingheng Lu, Dongyin Cui
Venue: Microelectronic Engineering (2008)

As a low-cost and high-efficiency alternative to conventional photolithography, imprint lithography has been paid serious attention for it can realize the pattern transfer easily and repeatedly. Even so, there is still a long way to go before this technique can be used to manufacture ICs since the layer-to-layer alignment is a main obstacle. In this paper, the pattern distortion and position shift induced by loading force and friction force are investigated and an optimized process is proposed to realize high precision overlay, in which an optimal loading force and a load release and an alignment error pre-compensation (LRAEPC) method are adopted. The optimal loading force is acquired by comparing the variety trends of the residual layer and position shift with the loading force. Using the optimal loading force, transferred patterns with proper resist thickness and the minimal distortion are achieved. In LRAEPC method, load release is used to correct the pattern distortion and to alleviate the position shift. To avoid subsequent position adjustment in the fluid after load release, the pre-compensation alignment is performed before the mold is in contact with the wafer. This process does not locate correct alignment position and there is an alignment compensation value determined by the statistical data of alignment position shift after load release. Using this pre-compensation alignment method, the correct alignment can be obtained after load release.
Quasi-random graphs with given degree sequences
Authors: Fan Chung, Ron Graham
Venue: Random Structures Algorithms (2008)

It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of necessity possess them all. These properties, termed quasirandom, have been described for a variety of structures such as graphs, hypergraphs, tournaments, Boolean functions, and subsets of Zn, and most recently, sparse graphs. In this article, we extend these ideas to the more complex case of graphs which have a given degree sequence. &copy; 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008
Automatic liver segmentation from abdominal CT scans
Authors: Paola Campadelli, Elena Casiraghi, Gabriele Lombardi
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Abdominal CT images have been widely studied in the recent years as they are becoming an invaluable mean for abdominal organ investigation. In the field of medical image processing, some of the current interests are the automatic diagnosis of liver pathologies and its 3D volume rendering. The first and fundamental step in all these studies is the automatic liver segmentation, that is still an open problem. In this paper we describe two automatic methods to segment the liver from abdominal CT data. They have been evaluated on the data of 40 patients, by comparing the automatically detected liver volumes to the liver boundaries manually traced by three experts. The best performing method achieves a symmetric volume difference of 95%, which is comparable to the inter and intra-personal variability of the manual segmentation produced by experts.
Unsupervised Newspaper Segmentation Using Language Context
Authors: R. Furmaniak
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

There has been increased interest in digitization of news- paper archives. A major problem that must be solved is that of high accuracy decomposition of the page into its logical structure. In this paper I present an approach that uses a language similarity measure based on OCR results to train geometric layout rules tailored to an arbitrary title. Exper- iments have shown this approach to be very effective.
Ribbon Schur operators
Authors: Thomas Lam
Venue: European Journal of Combinatorics (2008)

A new combinatorial approach to the ribbon tableaux generating functions and q-Littlewood-Richardson coefficients of Lascoux et al. [A. Lascoux, B. Leclerc, J.-Y. Thibon, Ribbon tableaux, Hall-Littlewood symmetric functions, quantum affine algebras, and unipotent varieties, J. Math. Phys. 38 (3) (1997) 1041-1068] is suggested. We define operators which add ribbons to partitions and following Fomin and Greene [S. Fomin, C. Greene, Noncommutative Schur functions and their applications, Discrete Math. 193 (1998) 179-200] study non-commutative symmetric functions in these operators. This allows us to give combinatorial interpretations for some (skew) q-Littlewood-Richardson coefficients whose non-negativity appears not to be known. Our set-up also leads to a new proof of the action of the Heisenberg algebra on the Fock space of U"q(sl@^"n) due to Kashiwara et al. [M. Kashiwara, T. Miwa, E. Stern, Decomposition of q-deformed Fock spaces, Selecta Math. 1 (1996) 787-805].
Human Interaction Web Model
Authors: Muhammad Alamzaib Shafi, Athar Mohsin Zaidi, Abdur Rehman
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

In today's customer-centric marketplace, live customer support has quickly become an essential tool that personalizes the Internet shopping experience and ensures customers a positive outcome. This paper proposes a new working model for provision of live online support services called the Human Interaction Web Model (HIWM). The model is designed in such a way to ensure global deployment by the websites and at the same time encourage users to avail live support services while they are online. HIWM design proposes to make live support functionality independent of the website by incorporating it within future version of the browsers and using it through proposed HIWM protocols. These proposed protocols will directly communicate with the website support infrastructure i.e. Call Center. User interface for the proposed model is incorporated in the standard browser navigation tool bar which will be used for every website on which the user avails live support services.
Special Feature: The Flex Software Design System: Designers Need Languages, too
Authors: S. A. Sutton
Venue: Computer (1981)

An experimental design language gives evidence that software design may benefit from the same formal techniques programmers are using.
Standards, Agility, and Engineering
Authors: François Coallier
Venue: Computer (2007)

Engineering involves choosing the right tool, which implies an understanding of both the tools and the problem. Such behavior is agile.
High Attendance Indicates Interest in Computer Communications
Authors: W. Myers
Venue: Computer (1978)

This year COMPCON Fall was devoted for the first time almost wholly to a single theme, computer communications and networks. The attendance of 450 at three preconference tutorials and 935 at the three-day conference itself demonstrated the strong interest communications is arousing. The field is growing rapidly-one participant reported that his department had expanded from 20 to 120 in the past year-but the shortage of experienced personnel seems to be inhibiting the growth that some companies would like to see. 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
Initial Report on a Lisp Programmer's Apprentice
Authors: C. Rich
Venue: IEEE Transactions on Software Engineering (1978)

This paper reports on the initial design and partial implementation of an interactive programming environment to be used by expert programmers. The system is based on three forms of program description: 1) definition of structured data objects, their parts, properties, and relations between them, 2) input-output specification of the behavior of program segments, and 3) a hierarchical representation of the internal structure of programs (plans). The plan representation is of major theoretical interest because it includes not only data flow and control flow relationships between subsegments of a program, but also goal-subgoal, prerequisite, and other logical dependencies between the specifications of the subsegments. Plans are utilized both for describing particular programs and in the compilation of a knowledge base of more abstract knowledge about programming, such as the concept of a loop and various specializations, such as enumeration loops and search loops. We also describe a deductive system which can verify the correctness of plans involving side effects on complex data with structure sharing.
Efficient Web Services Message Exchange by SOAP Bundling Framework
Authors: Toshiro Takase, Keishi Tajima
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

Web services use an interoperable and loosely coupled data exchange architecture. Web services processing can cause significant runtime overhead, especially when the number of fine-grained transac- tions becomes large. Although some best-practice guidelines recommend coarse-grained messages to improve the performance of Web services, coarse- grained services may interfere with the componentiza- tion of the services. Service granularity should be designed for reusability and modularity. In this paper, we propose a SOAP message bundling framework. This framework enables bundling multiple messages into one message. With this framework, application developers do not have to consider the service granularity. Instead, the framework bundles some fine- grained messages into a single coarse-grained message. To support this framework, we provide for service providers (1) a WSDL conversion tool and (2) a skeleton wrapper generator. These tools let service providers receive bundled messages without modifying existing service implementations. We also provide (3) a stub wrapper generator that allows service requesters to use bundled services easily. The existing message exchanges are not influenced by this framework. We evaluated the performance gain in experiments using the Google SOAP API. The results showed that our approach improves the performance of Web services.
Design, synthesis and evaluation of heterogeneous FPGA with mixed LUTs and macro-gates
Authors: Yu Hu, Satyaki Das, Steve Trimberger, Lei He
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Small gates, such as AND2, XOR2 and MUX2, have been mixed with lookup tables (LUTs) inside the programmable logic block (PLB) to reduce area and power and increase performance in FPGAs. However, it is unclear whether incorporating macro-gates with wide inputs inside PLBs is beneficial. In this paper, we first propose a methodology to extract a small set of logic functions that are able to implement a large portion of functions for given FPGA applications. Assuming that the extracted logic functions are implemented by macro-gates in PLBs, we then develop a complete synthesis flow for such heterogeneous PLBs with mixed LUTs and macro-gates. The flow includes a cut-based delay and area optimized technology mapping, a mixed binary integer and linear programming based area recovery algorithm to balance the resource utilization of macro-gates and LUTs for area-efficient packing, and a SAT-based packing. We finally evaluate the proposed heterogeneous FPGA using the newly developed flow and show that mixing LUT and macro-gates, both with 6 inputs, improves performance by 16.5% and reduces logic area by 30% compared to using merely 6-input LUTs.
A Modified Model for Private Data Security Facing E-commerce
Authors: Chunyong Yin, Jianshi Li, Ruxia Sun
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In order to improve personal data security in the elec- tronic commerce, and to avoid information exposing of per- sonal privacy, personal data was used as the encrypted principle, applying homomorphism and random perturba- tion to strengthen personal data security. This paper an- alyze the usage of personal data in electronic commerce firstly, Then discuss the P3P to realize security of personal data. This mechanism cannot guarantee that Web sites do act according to their policies once they have obtained user's personal data. In light of this, a new algorithm was used to acquire improved security. The proposed algorithm uses homomorphism as principle to preserve privacy. This method can make the important data to be appeared with secret content in the web service, and prevent personal data from being misused. The simulation results proved that the modified method can protect personal privacy effectively, and can carry on data mining to provide the characteristic service for the customer, and modified method has shorter response time.
Pattern Recognition on Metal Surface
Authors: Weixing Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

a loading, it is usual that the material surface patterns are recognized first by using image technique. Normally, the surface patterns consist of a number of parametric graphic elements such as circle, ellipse, square and rectangle. To successfully applying automatic image processing techniques for the problem of automatic pattern detection and description, the hardest task is the automatic detection of patterns robustly in images. A so- called valley-edge detection algorithm ("valley" or ("ridge") means here finding locally dark (or bright) line-like features) is one-pass line detection algorithm (without thresholding step). The developed pattern detection algorithm is the robust for ridge edge detection and line tracing. The algorithm has been tested, and the results indicate that this approach is useful in this kind of domains of images. Index Terms Metal work piece, Pattern recognition, Edge detection, Ridge detection, line detection
Visual Analysis of the Air Pollution Problem in Hong Kong
Authors: Huamin Qu, Wing-Yi Chan Anbang Xu, Kai-Lun Chung Kai-Hon Lau Ping Guo
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

We present a comprehensive system for weather data visualization. Weather data are multivariate and contain vector fields formed by wind speed and direction. Several well-established visualization techniques such as parallel coordinates and polar systems are integrated into our system. We also develop various novel methods, including circular pixel bar charts embedded into polar systems, enhanced parallel coordinates with S-shape axis, and weighted complete graphs. Our system was used to analyze the air pollution problem in Hong Kong and some interesting patterns have been found.
Workshop Report: Future Directions in Computer Architecture
Authors: M. J. Gonzalez
Venue: Computer (1978)

Designers must strive for a top-down, application-driven approach to digital system design. And new methods are needed for analytically exploring design tradeoffs in the context of changing technology and the multitude of highly concurrent systems technology will make possible. These were among the principal themes to arise from the Workshop on Future Directions in Computer Architecture, held November 16-17, 1977, at the University of Texas at Austin. Sponsored by the Special Interest Group on Computer Architecture of the ACM, the Technical Committee on Computer Architecture of the IEEE Computer Society, and The University of Texas at Austin with the support of the National Science Foundation, the meeting was aimed at identifying nearterm trends in computer architecture research and development. Following opening addresses by Zilog President Frederico Faggin and ACM President Herb Grosch, the workshop divided into seven sequential sessions (Table 1).
Equivalence of the Oscillation of Two Coupled Difference Systems
Authors: X. Y. Zeng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In this paper, we establish the equivalence of the oscillation of the following two coupled differential systems \Delta \left[ {x_i \left( n \right) - x_i \left( {n - \tau _i } \right)} \right] + p_i \left( n \right)f_i \left( {x_1 \left( {n - \tau _{i1} } \right), \cdot\cdot\cdot ,x_m \left( {n - \tau _{im} } \right)} \right) = 0 and \Delta ^2 y_i \left( {n - 1} \right) + \frac{{p_i (n)}} {{\tau _i }}f_i (y_1 (n), \cdot\cdot\cdot ,y_m (n)) = 0 where p_i (n): \mathbb{Z}^ + \to \mathbb{R}^ + , \tau _i \in \mathbb{Z}^ + ,\tau _{ij} \in \mathbb{Z} for i,j = 1, \cdot \cdot \cdot, m, f_i (u_1, \cdot \cdot \cdot, u_m) is nondecreasing in u_i for i = 1, \cdot \cdot \cdot, m and satisfies the following conditions{ f_i (u_1, \cdot \cdot \cdot, u_m) \ge 0 if u_i \ge 0 for i = 1, \cdot \cdot \cdot, m, f_i (u_1, \cdot \cdot \cdot, u_m) \le 0 if u_i \le 0 for i = 1, \cdot \cdot \cdot, m.
Rounding and Truncation in Radix (-2) Systems
Authors: S. Zohar
Venue: IEEE Transactions on Computers (1976)

Examination of rounding and truncation errors in radix (-2) systems establishes the following facts: 1) truncation error is 33 percent lower than in the positive radix case. 2) There is no 1-bit rounding algorithm. 3) The error bound of the standard (1-bit) positive radix rounding algorithm can be approached asymptotically by using more than one of the discarded bits. For N bits, this error bound is multiplied by 1 + (3. 2N-l)-1.
A Multi-Objective Genetic Algorithm for Discovering Non-Dominated Motifs in DNA Sequences
Authors: Mehmet KAYA
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

This paper presents a novel motif discovery algorithm based on multi-objective genetic algorithms to extract non-dominated motifs in DNA sequences. The main advantage of our approach is that a large number of tradeoff (non-dominated) motifs can be obtained by a single run with respect to conflicting objectives: similarity, motif length and support maximization. In this paper, the method extracts nondominated motifs taking into account two-objective at a time while one of the objectives is set to a prespecified value. So, user is given to the authority of incorporating to motif discovery process. Our approach can be applied to any data set with a sequential character. Furthermore, it allows any choice of similarity measures for finding motifs. By analyzing the discovered non-dominated motifs, the decision maker can understand the tradeoff between the objectives. We compare the approach with the three well-known motif discovery methods, AlignACE, MEME and Weeder. Experimental results on real data set extracted from TRANSFAC database demonstrate that the proposed method exhibits good performance over the other methods in terms of runtime and accuracy of prediction.
Failure Analysis of Open Source J2EE Application Servers
Authors: Junguo Li, Gang Huang, Jian Zou, Hong Mei
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Open source J2EE Application Servers (J2EE ASs) have already attracted industrial attentions in recent years, but the reliability is still an obstacle to their wide acceptance. The detail of software failures in J2EE AS was seldom discussed in the past, although such information is valuable to evaluate and improve its reliability. In this paper, we present a measurement- based failure classification and analysis. Presented results indicate open source J2EE AS's reliability needs improvement. Some notable results include: (1) the implementation of a widely used fault-tolerant mechanism, clustering, needs improvement; (2) only 15% of reported failures are removed within a week, and about 10% still open by the time we finish the study; (3) different J2EE ASs have different unreliable services so reliability improvement activities should be specific to both AS and applications.
A Novel Vehicular Mobility Model for Wireless Networks
Authors: Pedro Vieira, Manuel Vieira, Maria Paula Queluz, António Rodrigues
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper a novel realistic vehicular mobility model is introduced. It captures the moving-in-groups, conscious traveling, and introduces the concept of smart traveling while following drivers' social behavior extracted from inquiries and experimental traffic measurements. Under the model, a routing algorithm is considered. The routing algorithm minimizes the distance to a target on a step by step form, in every street crossing. This is done under a hierarchic street level structure that optimizes travel speed and quality. The mobility model was simulated and validated in a real mobility scenario using, as case study, the city of Lisbon. The correlation values (between simulated data and theoretical distributions), arrival to destination success rate and directional statistics produced satisfactory results. The model concept is perfectly generic and applicable to other locations, provided that the corresponding street database and vehicular traffic information are available. The model outputs several parameters, including sinuosity indicator and traffic load. The sinuosity indicator is a powerful parameter on the characterization of urban radio environments when mobility is used in wireless networks simulation. Vehicular traffic load analysis is also presented. It can be used in further work over wireless traffic modeling, on a street segment basis or on a AU (Analysis Unit) perspective.
Tasks Allocation for Real-Time Applications in Heterogeneous Sensor Networks for Energy Minimization
Authors: Jinghua Zhu, Jianzhong Li, Hong Gao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Tasks allocation plays an important role in resource-limited sensor networks. However, existing methods separate energy saving and QoS (Quality-of- Service)-guarantee into two issues, consequently, the scheduling length could be very long which violating user's deadline requirement or might waste lots of energy. This paper discusses the problem of allocating a set of real-time tasks with dependencies onto a heterogeneous sensor network. In order to find an optimal allocation that minimize the overall energy consumption while meeting user's deadline, we exploit the divide-and-conquer technique, first group tasks into tasks partitions and then optimally solve the scheduling problem in branches with several sequential tasks by modeling the branches as a Markov Decision Process. Sensors failure can be handled by rescheduling part of the tasks graph. Experiments results show our proposed method significantly improve the performance of sensor network in terms of energy saving and QoS-guarantee compared with two other heuristic algorithms.