ppxscal/embedding_network huggingface dataset:
A recommender system using GA K-means clustering in an online shopping market
Authors: Kyoung-jae Kim, Hyunchul Ahn
Venue: Expert Systems with Applications: An International Journal (2008)

The Internet is emerging as a new marketing channel, so understanding the characteristics of online customers' needs and expectations is considered a prerequisite for activating the consumer-oriented electronic commerce market. In this study, we propose a novel clustering algorithm based on genetic algorithms (GAs) to effectively segment the online shopping market. In general, GAs are believed to be effective on NP-complete global optimization problems, and they can provide good near-optimal solutions in reasonable time. Thus, we believe that a clustering technique with GA can provide a way of finding the relevant clusters more effectively. The research in this paper applied K-means clustering whose initial seeds are optimized by GA, which is called GA K-means, to a real-world online shopping market segmentation case. In this study, we compared the results of GA K-means to those of a simple K-means algorithm and self-organizing maps (SOM). The results showed that GA K-means clustering may improve segmentation performance in comparison to other typical clustering algorithms. In addition, our study validated the usefulness of the proposed model as a preprocessing tool for recommendation systems.
Recognition, Understanding and Aestheticization of Freehand Drawing Flowcharts
Authors: W. Szwoch
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper a concept of FCA, a system for recognizing, understanding and aestheticization of freehand drawing flow charts is described. The system is based on a proposed by the author FlowGram graph grammar describing flow charts drawing. An open format FlowChartML for flow charts description is also proposed. The aestheticization criterion is formulated that allows for automatic beautification of flow charts. First experiments with the FCA system are also described.
A Resource Search Model Based on Semantically Enabled P2P Grid
Authors: Jun Ye, Zhishu Li, Qing Li
Venue: Proceedings of the Future Generation Communication and Networking - Volume 02 (2007)

This paper presents a four layered resource search model that has a good feature in expansibility, autonomy, modularity and loose coupling. In terms of this model a bootstrap based on distributed hashing table (DHT) is added into P2P Grid and a Peer Service is implemented in every node. The semantic- based resource management architecture and RPC protocols are discussed. A scalable vertical search engine prototype is realized with data extraction functionality. This model could be used in P2P Grid systems and heterogeneous P2P systems as a reference for resource searching, sharing and collaboration.
Special Tutorial: Introduction to LSI Microprocessor Developments
Authors: A. O. Williman
Venue: Computer (1976)

In its constant endeavor to increase the number of functions per semiconductor device, the semiconductor industry has focused continual effort on developing new semiconductor processes and photolithographic technologies and on compressing smaller geometries onto increasingly larger silicon chip areas. The result is that the number of functions (components per chip) is approximately doubling every year while the cost per function is decreasing. A byproduct of these improvements is increased system reliability. By increasing chip complexity above a few hundred gates, generally referred to as large-scale integration, the capability of economically producing new devices and systems for new applications is being realized.
Electroless plating of copper on AZ31 magnesium alloy substrates
Authors: Hui Zhao, Zhanghong Huang, Jianzhong Cui
Venue: Microelectronic Engineering (2008)

Chemical surface preparation for copper film on magnesium alloy by both electroless plating and organic coatings was studied. Organic coating was made by immersing the samples into an organosilicon heat-resisting varnish. A subsequent metallization process verified the applicability of this method. In this method, the organic coating acted as an interlayer between the substrate and copper film. When the reaction started, copper deposited directly onto the interlayer surface. X-ray diffraction and SEM analysis were used to understand the composition and morphology of the interlayer and copper film. The copper film has a rather perfect crystalline structure. And the result of the cross-cut test indicates the adhesion between the substrate is good enough. The potentiodynamic polarization curves for corrosion studies of coated magnesium alloys were performed in a corrosive environment of 3.5wt% NaCl at neutral pH 7. The result reveals that compared with the substrate, the corrosion resistance of the coated AZ31 magnesium alloys increases distinctly. Moreover, the copper film has perfectly antibacterial and decorative properties. The method proposed in this work is environmentally friendly: non-toxic chemicals are used. In addition, this provides a new concept for plating the metals, which are considered difficult to plate due to high reactivity.
The compiler as a static analysis tool
Authors: Robert B. K. Dewar
Venue: Proceedings of the 2007 ACM international conference on SIGAda annual international conference (2007)

This paper shows that a programming language compiler can perform many kinds of tasks that are generally viewed as the domain of separate static analysis tools and, in the other direction, identifies certain kinds of analysis that are best left to separate tools.
The Redesign System: A Knowledge-Based Approach to VLSI CAD
Authors: Louis Steinberg, Tom Mitchell
Venue: IEEE Design Test (1985)

Artificial intelligence techniques offer one possible avenue toward new CAD tools to handle the complexities of VLSI. Redesignis a Prototype knowledge-based system that uses Al techniques to interactively aid in the functional redesign of digital circuits.Given a desired change in the function of a circuit, Redesign combines rule-based knowledge of design tactics with its abilityto analyse signal propagation through circuits, in order to help the user focus on an appropriate portion of the circuit toredesign, suggest local redesign alternatives, and determine side effects of possible redesigns. Using lessons learned fromwork on Redesign, we are working on systems to aid in designing and debugging VLSI.
Model and Algorithm of Car-Group-Collection-and-Delivery Schedule
Authors: Xinfeng Yang, Yinzhen Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Car-Group-Collection-and-Delivery schedule of through trains distributed to several loading or unloading places is related directly to the car economic efficiency. Moreover large amount of calculation should be processed which is very difficult when the number of the loading or unloading places is large by use of the traditional algorithm. Taking the uncertainty of car group collection and delivery operation times and freight operating times into account, a fuzzy linear regression prediction model and an uncertain mathematical model of Car-Group-Collection-and- Delivery schedule for through trains are formulated and a Partheno-Genetic Algorithm (PGA) is put forward to resolve the model, besides, analyzed by using an example. The simulation results show that the algorithm is very efficient and has practical application.
Methods of Memory Optimizations in Streaming Applications
Authors: Nissim Harel, Hasnain A. Mandviwala, Kath Knobe, Umakishore Ramachandran
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Streaming applications are often distributed, manage large quantities of data and, as a result, have large memory requirements. Therefore, efficient garbage collection (GC) is crucial for their performance. On the other hand, not all data items affect the application output due to differences in the processing rates of various application threads. In this paper we propose extending the definition of the garbage identification problem for streaming applications and include not only data items that are not "reachable" but also data items that have no effect on the final outcome of the application. We present four optimizations to an existing GC algorithm in Stampede, a parallel programming system to support interactive multimedia applications. We ask the question how far off these algorithms are from an ideal garbage collector, one in which the memory usage exactly equals the amount required for buffering only the relevant data items. This oracle, while unimplementable, serves as an empirical lower-bound for memory usage. We then propose optimizations that will help us get closer to this lowerbound. Using an elaborate measurement and post-mortem analysis infrastructure, we simulate the performance potential for these optimizations and implement the most promising ones. A color-based people tracking application is used for the performance evaluation. Our results show that these optimizations reduce the memory usage by up to 60%.
Multi-satellite MIMO communications at Ku-band and above: investigations on spatial multiplexing for capacity improvement and selection diversity for interference mitigation
Authors: Konstantinos P. Liolis, Athanasios D. Panagopoulos, Panayotis G. Cottis
Venue: EURASIP Journal on Wireless Communications and Networking (2007)

This paper investigates the applicability of multiple-input multiple-output (MIMO) technology to satellite communications at the Ku-band and above. After introducing the possible diversity sources to form a MIMO matrix channel in a satellite environment, particular emphasis is put on satellite diversity. Two specific different topics from the field of MIMO technology applications to satellite communications at these frequencies are further analyzed: (i) capacity improvement achieved by MIMO spatial multiplexing systems and (ii) interference mitigation achieved by MIMO diversity systems employing receive antenna selection. In the first case, a single-user capacity analysis of a satellite 2 × 2 MIMO spatial multiplexing system is presented and a useful analytical closed form expression is derived for the outage capacity achieved. In the second case, a satellite 2 × 2 MIMO diversity system with receive antenna selection is considered, adjacent satellite cochannel interference on its forward link is studied and an analytical model predicting the interference mitigation achieved is presented. In both cases, an appropriate physical MIMO channel model is assumed which takes into account the propagation phenomena related to the frequencies of interest, such as clear line-of-sight operation, high antenna directivity, the effect of rain fading, and the slant path lengths difference. Useful numerical results obtained through the analytical expressions derived are presented to compare the performance of multi-satellite MIMO systems to relevant single-input single-output (SISO) ones.
Test Generation for Single and Multiple Stuck-at Faults of a Combinational Circuit Designed by Covering Shared ROBDD with CLBs
Authors: A. Matrosova, E. Loukovnikova, S. Ostanin, A. Zinchuck, E. Nikolaeva
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

A combinational circuit is derived with covering the proper Shared ROBDD by CLBs in the frame of FPGA technology. Single stuck-at faults at the CLBs poles and multiple faults constituted from such single stuck-at faults are considered. It is shown that the test pattern as for single stuck-at fault so for multiple fault there always exists. The test pattern for a multiple fault is the special test pattern for the special single stuck-at fault forming the multiple one. Test for all multiple faults is derived from any test for all single stuck-at faults. The length of the multiple faults test is linear function of the single faults test length. A multiple fault test is the one of high quality. In particular SEU and bridge faults may manifest themselves as multiple faults at the CLBs poles. Deriving test for all multiple faults was executed for the certain bench-marks. For them the length of the multiple faults test is about the twice length of the single faults test.
Weighted aggregation operators based on minimization
Authors: Radko Mesiar, Jana Špirková, Lucia Vavríková
Venue: Information Sciences: an International Journal (2008)

Minimization based aggregation operators A"g","D are discussed. Special attention is paid to weighting function g based cases related to some fixed dissimilarity function D. When D"2(x,y)=(x-y)^2, we recognize mixture operators and we recall some sufficient conditions for g ensuring the monotonicity of A"g","D. For D"1(x,y)=|x-y| and non-decreasing (non-increasing) g, A"g","D is shown to be the upper (lower) median whenever A"g","D is an aggregation operator.
On the Error Effects of Random Clock Shifts in Quantum-dot Cellular Automata Circuits
Authors: M. Ottavi, H. Hashempour, V. Vankamamidi, F. Karim, K. Walus, A. Ivanov
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

This paper analyzes the effect of random phase shifts in the underlying clock signals on the operation of several basic Quantum-dot Cellular Automata (QCA) building blocks. Such phase shifts can result from manufacturing variations or from uneven path lengths in the clocking network. While previous literature has proposed various clock distribution architectures and also provided analysis of manufacturing variations on QCA layouts, so far no literature is available on the characterization of effects resulting from the lack of phase synchronization in the QCA clocks. We perform numerical simulations of these basic building blocks using two different simulation engines available in the QCADesigner tool. We assume that the phase shifts are characterized by a Gaussian distribution with a mean value of i 2 , where i is the clock number. Our results indicate that the sensitivity of building blocks to phase shifts depends primarily on the layout of the building block, and that most building blocks were able to operate properly under random phase shifts characterized by= 5% of /2.
Analysis of Long Term File Reference Patterns for Application to File Migration Algorithms
Authors: A. J. Smith
Venue: IEEE Transactions on Software Engineering (1981)

In most large computer installations files are moved between on-line disk and mass storage (tape, integrated mass storage device) either automatically by the system and/or at the direction of the user. In this paper we present and analyze long term file reference data in order to develop a basis for the construction of algorithms for file migration. Specifically, we examine the use of the on-line user (primarily text editor) data sets at the Stanford Linear Accelerator Center (SLAC) computer installation through the analysis of 13 months of file reference data. We find that most files are used very few times. Of those that are used sufficiently frequently that their reference patterns may be examined, we find that: 1) about a third show declining rates of reference during their lifetime, 2) of the remainder, very few (about 5 percent) show correlated interreference intervals, and 3) interreference intervals (in days) appear to be more skewed than would occur with the Bernoulli process. Thus, about two-thirds of all suffi1ciently active files appear to be referenced as a renewal process with a skewed interreference distribution. A large number of other file reference statistics (file lifetimes, interference distributions, moments, means, number of uses/ file, file sizes, file rates of reference, etc.) are computed and presented. Throughout, statistical tests are described and explained. The results of our analysis of file reference patterns are applied in a companion paper to the development and comparative evaluation of file migration algorithms.
ANOVA extensions for mixed discrete and continuous data
Authors: A. R. de Leon, Y. Zhu
Venue: Computational Statistics Data Analysis (2008)

This paper is concerned with ANOVA-like tests in the context of mixed discrete and continuous data. The likelihood ratio approach is used to obtain a location test in the mixed data setting after specifying a general location model for the joint distribution of the mixed discrete and continuous variables. The approach allows the problem to be treated from a multivariate perspective to simultaneously test both the discrete and continuous parameters of the model, thus avoiding the problem of multiple significance testing. Moreover, associations among variables are accounted for, resulting in improved power performance of the test. Unlike existing distance-based alternatives which rely on asymptotic theory, the likelihood ratio test is exact. In addition, it can be viewed as an extension to the mixed data setting of the classical multivariate ANOVA. We compare its performance against those of currently available tests via Monte Carlo simulations. Two real-data examples are presented to illustrate the methodology.
Power Droop Testing
Authors: Ilia Polian, Alejandro Czutro, Sandip Kundu, Bernd Becker
Venue: IEEE Design Test (2007)

Circuit activity is a function of input patterns. When circuit activity changes abruptly, it can cause a sudden drop or rise in power supply voltage. This change is known as power droop and is an instance of power supply noise. Although power droop can cause an IC to fail, such failures cannot currently be screened during testing because they are not covered by conventional fault models. This article presents a technique for screening such failures. The authors propose a heuristic method to generate test sequences that create worst-case power drop by accumulating the high- and low-frequency effects. The authors employ a dynamically constrained version of the classical D-algorithm, which generates new constraints on the fly, for test generation. The obtained patterns can be used for manufacturing testing as well as for early silicon validation. The authors have implemented a prototype ATPG to demonstrate the feasibility of this approach, and they generate test sequences for ISCAS circuits.
An evaluation of virtual lenses for object selection in augmented reality
Authors: Julian Looser, Mark Billinghurst, Raphaël Grasset, Andy Cockburn
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

This paper reports the results of an experiment to compare three different selection techniques in a tabletop tangible augmented reality interface. Object selection is an important task in all direct manipulation interfaces because it precedes most other manipulation and navigation actions. Previous work on tangible virtual lenses for visualisation has prompted the exploration of how selection techniques can be incorporated into these tools. In this paper a selection technique based on virtual lenses is compared with the traditional approaches of virtual hand and virtual pointer methods. The Lens technique is found to be faster, require less physical effort to use, and is preferred by participants over the other techniques. These results can be useful in guiding the development of future augmented reality interfaces.
Research and Application of Software-reuse
Authors: Yong Liu, Aiguang Yang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Reuse-based software technology is a process of designing software for the reuse purpose, which can great reduce the time and expenses of developing and can enhance the flexibility, maintainability and reliability of the software. Reuse-based software technology is software developing trend and a hot spot of this century. In this paper, the technology of software reuse is studied, and a software reuse idea of stock managing domain is put forward. At the same time, the process of build a software reuse model of stock managing domain is described.
Some approaches to pattern recognition problems
Authors: A. N. Golodnikov, P. S. Knopov, V. A. Pepelyaev
Venue: Cybernetics and Systems Analysis (2007)

A new approach to selecting the Gibbs distribution in models of objects to be recognized is proposed. This approach proposes to determine the lower and upper bounds for probabilities of the object under study. The distance between these bounds may be used as a measure of error in pattern recognition problems.
Apolda: A Practical Tool for Semantic Annotation
Authors: Christian Wartena, Rogier Brussee, Luit Gazendam, Willem-Olaf Huijsen
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In this paper we give an overview of methods to find representations of ontology defined concepts in texts. We distinguish two approaches: lexicon-based methods and approaches using lexicalized ontologies. We focus on the latter method and describe the problems and choices that have to be made if this approach is put to work. Finally we describe an open-source tool that implements the lexicalized ontology approach along with two examples of its applicability in a practical context.
Design Automation
Authors: H. M. Wall
Venue: Computer (1975)

The set of design tools and practices collectively known as "design automation" had its origin twenty years ago. The evolution of these practices as applied to the design of digital computers is nicely described by Preiss.1 Since its inception, this field has expanded to include not only computer design, but also such diverse items as office space planning, ship building, land use, textile design, and computer software/firmware. 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
An Algebraic Construction for q-ary Shift Register Sequences
Authors: F. Hemmati
Venue: IEEE Transactions on Computers (1978)

Using the Euclidean Algorithm for polynomials over GF(q), an algebraic technique for the generation of q-ary shift register sequences of arbitrary length l, 1 = l = qm, is obtained, where q is a power of a prime number, q = pn, and m is the number of shift register stages.
Linguistic Evaluation in the Classification in Portuguese Texts
Authors: Yuri Camargo, Laila Mello, Jorge L. S. Leao
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper evaluates the performance of Support Vector Machines, Naïve Bayes, and Neural networks as classifiers for the categorization of Portuguese texts. We present several experiments with two different corpora with different feature selection strategies. We consider the use of linguistic information in the definition of grammatical groups. A comparison of classifiers is presented and the error margins show excellent results when using a specific feature selection in association with the right classifier.