ppxscal/embedding_network huggingface dataset:
High Quality Test Vectors for Bridging Faults in the Presence of IC's Parameters Variations
Authors: Michele Favalli, Marcello Dalpasso
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

The growing dispersion of parameters in CMOS ICs poses relevant uncertainties on gate output conductances and logic thresholds that affect bridging fault (BF) detection. To analyze the quality of fault simulation and test generation tools using nominal IC parameters, we studied BF detection as a function of the standard deviation of parameters: results show that a single test vector cannot ensure acceptable escape probabilities. Conversely, the minimal number of test vectors providing null escape probability is upper-bounded with respect to variations of parameters, as verified by Monte Carlo electrical-level simulations. We propose a method to derive such minimal test sets for low frequency testing. A fault simulator and a test generator have been developed supporting the search of minimal test sets targeting a null escape probability.
Scalable Live Streaming Service Based on Interoverlay Optimization
Authors: Xiaofei Liao, Hai Jin, Yunhao Liu, Lionel M. Ni
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

In order to provide scalable live-streaming services, we propose an Inter-Overlay Optimization scheme, IOO. Instead of selecting better paths in the same overlay, IOO constructs efficient paths using peers in different overlays, so as to (i) improve global resource utilization of P2P streaming networks; (ii) assign resources based on their locality and delay; (iii) guarantee streaming service quality by using the nearest peers, even when such peers might belong to different overlays; and (iv) balance the load among the group (streaming overlay) members. We compare the performance of IOO with existing approaches through trace driven simulations. Results show that IOO outperforms previous schemes in terms of resource utilization and the QoS of streaming services. IOO scheme has been implemented in an Internet based live streaming system, called AnySee. AnySee was successfully released in the summer of 2004 in CERNET of China. Over 60,000 users enjoy massive entertainment programs, including TV programs, movies, and academic conferences videos.
Electroless fabrication of cobalt alloys nanowires within alumina template
Authors: Nazila Dadvand, Georges J. Kipouros
Venue: Journal of Nanomaterials (2007)

A new method of nanowire fabrication based on electroless deposition process is described. The method is novel compared to the current electroless procedure used in making nanowires as it involves growing nanowires from the bottom up. The length of the nanowires was controlled at will simply by adjusting the deposition time. The nanowires were fabricated within the nanopores of an alumina template. It was accomplished by coating one side of the template by a thin layer of palladium in order to activate the electroless deposition within the nanopores from bottom up. However, prior to electroless deposition process, the template was pretreated with a suitable wetting agent in order to facilitate the penetration of the plating solution through the pores. As well, the electroless deposition process combined with oblique metal evaporation process within a prestructured silicon wafer was used in order to fabricate long nanowires along one side of the grooves within the wafer.
Security techniques using SCF data
Authors: Charles E. Youman
Venue: ACM SIGSAC Review (1982)

The Statistical Collection File (SCF) contains data which can be used to detect unauthorized computer use. This paper gives examples of which record types to capture and how to extract and report this information using DEAR, GSEP and microfiche.
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice
Authors: Srinath Sridhar, Kedar Dhamdhere, Guy Blelloch, Eran Halperin, R. Ravi, Russell Schwartz
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2007)

We consider the problem of reconstructing near-perfect phylogenetic trees using binary character states (referred to as BNPP). A perfect phylogeny assumes that every character mutates at most once in the evolutionary tree, yielding an algorithm for binary character states that is computationally efficient but not robust to imperfections in real data. A near-perfect phylogeny relaxes the perfect phylogeny assumption by allowing at most a constant number of additional mutations. We develop two algorithms for constructing optimal near-perfect phylogenies and provide empirical evidence of their performance. The first simple algorithm is fixed parameter tractable when the number of additional mutations and the number of characters that share four gametes with some other character are constants. The second, more involved algorithm for the problem is fixed parameter tractable when only the number of additional mutations is fixed. We have implemented both algorithms and shown them to be extremely efficient in practice on biologically significant data sets. This work proves the BNPP problem fixed parameter tractable and provides the first practical phylogenetic tree reconstruction algorithms that find guaranteed optimal solutions while being easily implemented and computationally feasible for data sets of biologically meaningful size and complexity.
Analysis of Enumeration Strategy Use in the ACT-R Cognitive Architecture
Authors: Bia Kim, Jaesik Lee
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Cognitive architectures as unified cognitive theories can produce an integrated explanation of human mind and behaviors. The purpose of this study was to suggest a developmental direction in ACT-R based on the effect of enumeration strategy use on visual stimuli counting task. For this purpose, counting time of stimuli set size in various enumeration conditions was measured. The results showed that the knowledge of set size affected on enumeration strategy which in turn reduced counting time for relatively larger set size of 7 to 9 items. In addition, this tendency was repeatedly observed in the experimental conditions where amount of counting practice was varied. Based on the results of the experiments, a new ACT-R algorithm on visual stimuli enumeration was proposed.
Privacy and community connectedness: designing intelligent environments for our cities
Authors: Craig Chatfield, René Hexel
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

This paper investigates the casual interactions that support and nourish a community and seeks to provide a solution to the increasing detachment of modern society as community spaces become less and less engaging. We suggest the use of a ubiquitous computing (ubicomp) infrastructure to promote and support community connectedness via the hosting of virtual community environments and by providing local information and interaction possibilities. This infrastructure addresses our need as society to communicate more effectively and create loose bonds with familiar strangers within our community. We explore this idea with a use scenario and user study of users interacting with the services in a developed intelligent environment.
An efficient algorithm to solve connectivity problem on trapezoid graphs
Authors: Prabir K. Ghosh, Madhumangal Pal
Venue: Journal of Applied Mathematics and Computing (2007)

The connectivity problem is a fundamental problem in graph theory. The best known algorithm to solve the connectivity problem on general graphs with n vertices and m edges takes O(K(G)mn1.5) time, where K(G) is the vertex connectivity of G. In this paper, an efficient algorithm is designed to solve vertex connectivity problem, which takes O(n2) time and O(n) space for a trapezoid graph.
BioPatentMiner: an information retrieval system for biomedical patents
Authors: Sougata Mukherjea, Bhuvan Bamba
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Before undertaking new biomedical research, identifying concepts that have already been patented is essential. Traditional keyword based search on patent databases may not be sufficient to retrieve all the relevant information, especially for the biomedical domain. More sophisticated retrieval techniques are required. This paper presents BioPatentMiner, a system that facilitates information retrieval from biomedical patents. It integrates information from the patents with knowledge from biomedical ontologies to create a Semantic Web. Besides keyword search and queries linking the properties specified by one or more RDF triples, the system can discover Semantic Associations between the resources. The system also determines the importance of the resources to rank the results of a search and prevent information overload while determining the Semantic Associations.
Indexing Methods for Similarity Searching
Authors: Hanan Samet
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

An overview is given of the various techniques and issues involved in providing indexing support for similarity searching. Similarity searching is a crucial part of retrieval in multimedia databases used for applications such as pattern recognition, image databases, and content-based retrieval.
Major Players Battle over Layers: Layer-2 and Layer-3 Vendors Tussle over Metro Links
Authors: Greg Goth
Venue: IEEE Internet Computing (2007)

Buried amid industry hoopla about end-user gadgets and macroeconomic issues such as upcoming wireless spectrum auctions, an arcane but increasingly vexing niche of the Internet's architecture has become the subject of considerable debate. At stake is carrier Ethernet traffic traversing the globe.
Fast exact Toffoli network synthesis of reversible logic
Authors: Robert Wille, Daniel Große
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

The research in the field of reversible logic is motivated by its application in low-power design, optical computing and quantum computing. Hence synthesis of reversible logic has become a very important research area in the last years. In this paper exact algorithms for the synthesis of generalized Toffoli networks are considered. We present an improvement of an existing synthesis approach that is based on Boolean Satisfiability. Furthermore, the principle limits of the original and the improved approach are shown. Then, we propose a new method using problem specific knowledge during the synthesis process to overcome these limits. Experimental results demonstrate improvements of the overall synthesis time up to four orders of magnitude.
Dimensionality Reduction of Multimodal Labeled Data by Local Fisher Discriminant Analysis
Authors: Masashi Sugiyama
Venue: The Journal of Machine Learning Research (2007)

Reducing the dimensionality of data without losing intrinsic information is an important preprocessing step in high-dimensional data analysis. Fisher discriminant analysis (FDA) is a traditional technique for supervised dimensionality reduction, but it tends to give undesired results if samples in a class are multimodal. An unsupervised dimensionality reduction method called locality-preserving projection (LPP) can work well with multimodal data due to its locality preserving property. However, since LPP does not take the label information into account, it is not necessarily useful in supervised learning scenarios. In this paper, we propose a new linear supervised dimensionality reduction method called local Fisher discriminant analysis (LFDA), which effectively combines the ideas of FDA and LPP. LFDA has an analytic form of the embedding transformation and the solution can be easily computed just by solving a generalized eigenvalue problem. We demonstrate the practical usefulness and high scalability of the LFDA method in data visualization and classification tasks through extensive simulation studies. We also show that LFDA can be extended to non-linear dimensionality reduction scenarios by applying the kernel trick.
An Abstract Owner Resource Management Model Based on Auction Mechanism
Authors: Yanbing LIU, Yi JIAN, Hong TANG
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Grid resource management system is regarded as an important component of grid computing. In this paper, a novel abstract owner (AO) resource management model is designed and investigated. Firstly the general architecture model and AO execution mechanism are analyzed, and then a competitive auction mechanism utilized in market -driven economics proverbially is introduced into the ordinary AO resource management model to adapt the dynamic and scattered resource characteristics. Furthermore, a resource management prototype system developing client broker and multi-auctioneer is designed and implemented as a solution for resource complexity and scheduling bottleneck. On one hand, the advanced AO resource management model can manage grid resources more effectively and improve the resource discovery and selection performance significantly. On the other hand, the dishonest auctioneer' fraud action as well as user's partnership fraud action can be prevented from in AO resource management model depending on multi-auctioneer. Finally, some related algorithms for the new auction framework are proposed correspondingly to realize the architecture model.
A Distributed Parallel Computing Environment for Bioinformatics Problems
Authors: Guoshi Xu, Fakai Lu, Huashan Yu, Zhuoqun Xu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Certain bioinformatics research, such as sequence alignment, alternative splicing, protein function/structure prediction, gene identify, bio-chip data analysis, and so on, requires massive computing power, which is hardly available in a single computing node. In order to facilitate bioinformatics research, we have designed and implemented a distributed and parallel computing environment with grid technology, in which, biologists can solve bioinformatics problems using distributed computing resources in parallel and reduce execution time. In this environment, the computing power and program information of computing nodes are described with XML documents. A web service named Local Resource Management Service is deployed on each computing node so that the distributed resources can be accessed in a uniform manner. With an API suite, biologists can use distributed computing resources in parallel easily in their applications. Further more, users can monitor the status of distributed resources dynamically on the portal. A real use case of alternative splicing is also presented, through which we have analyzed the usability, efficiency, and stability of the environment.
MOS capacitors obtained by wet oxidation of n-type 4H-SiC pre-implanted with nitrogen
Authors: A. Poggi, F. Moscatelli, Y. Hijikata, S. Solmi, R. Nipoti
Venue: Microelectronic Engineering (2007)

The manufacture process and the electrical characterization of MOS devices fabricated by wet oxidation of N^+ implanted n-type 4H-SiC are here presented. Different implantation fluence and energy values were used with the aims to study the effect of the N concentration both at the SiO"2/SiC interface and within the SiO"2 film. High doses, able to amorphise a surface SiC layer to take advantage of the faster oxidation rate of amorphous with respect to crystalline SiC, were also evaluated. The electrical quality of the SiO"2/SiC system was characterized by capacitance-voltage measurements of MOS capacitors. The analyses of the collected data show that only the implanted N which is located at the oxide-SiC interfaces is effective to reduce the interface states density. On the contrary, the interface states density remains high (the same of an un-implanted reference sample) when the implanted N is completely embedded in the region consumed by the oxidation. Furthermore, none generation of fixed positive charges in the oxide was found as a consequence of the different N concentrations enclosed in the oxide films. These results were independent of the amorphisation of the implanted layer by the N^+ ions. Our results demonstrate that by using a suitable N ion implantation and an appropriate wet oxidation treatment, it is possible to obtain a reduced thermal budget process able to decrease the interface state density near the conduction band edge. The proposed approach should be interesting for the development of the MOSFET technology on SiC.
What Affects Decoding Complexity of Distributed Video Codec Based on Turbo Code
Authors: Fang Sheng, Liang Yong-Quan, Li Shen-Yuan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The distributed video coding (DVC) is a new coming video compression technology that utilizes a different computing complexity mode from the traditional video codec. As a new paradigm there are some fundamental and hard questions in DVC that are not sufficiently addressed, for example the complexity balance between DVC encoder and decoder. This will be an important factor for some promising real time applications. In this context, this paper studies the factors which affect the decoding complexities of turbo code based DVC, especially focuses on quantization, side information and turbo code bit rates. Analyzing and simulation results show that precise side information will decrease the turbo decoding complexity, large reductions in computations can be traded against relatively small increases in bit rate, and uniform quantizer possesses the advantage than the non-uniform quantizer in computation load at a expense of a little decrease in rate distortion performance.
EP-based PID control design for chaotic synchronization with application in secure communication
Authors: Hsin-Chieh Chen, Jen-Fuh Chang, Jun-Juh Yan, Teh-Lu Liao
Venue: Expert Systems with Applications: An International Journal (2008)

In this paper, the evolutionary programming (EP)-based proportional-integral-derivative (PID) control design is presented for synchronization of chaotic systems with application in secure communication. A PID controller is developed via the EP algorithm. By using the EP algorithm, optimal control gains in PID controlled chaotic systems are derived such that a performance index of integrated absolute error (IAE) is as minimal as possible. Moreover, as an application, the proposed EP-based PID control scheme is then applied to a chaotic secure communication system. To verify the system performance, basic electronic components containing OPA, resistor and capacitor elements are used to implement the proposed PID-based chaotic secure communication system. Finally, both simulation results and the circuit experiments demonstrate the proposed PID scheme's success in the communication application.
A methodology to redesign heterogeneous product portfolios as homogeneous product families
Authors: Sa'Ed M. Salhieh
Venue: Computer-Aided Design (2007)

This paper presents a methodology to redesign heterogeneous product portfolios as homogeneous product families. A heterogeneous portfolio is one that has no common components, or shares a minimum number of components. The methodology proposed to homogenize the portfolio begins by analyzing the current product offerings to determine customer needs and functions. Then, a granulation process is initiated to remove redundancies, and identify physical function carriers to deliver the required functions. Next, function carriers are grouped on the basis of their functional commonalities into groups for parallel development. The applicability and the use of the methodology are illustrated through the redesign of an existing heterogeneous 'office furniture' product portfolio.
B72-4 System/360 Job Control Language
Authors: S. Campbell
Venue: IEEE Transactions on Computers (1972)

Since IBM's introduction of the System/360 and its operating system OS/360, probably no other aspect of that vast collection of programs and publications the IBM OS Bibliography alone runs to 100 pages has caused more heated discussions or been as poorly understood by its users as the job control language JCL. It is the one feature of the operating system that all users must employ: it is the gateway to the goodies of OS. JCL is not a programming language in the usual sense; it is not translated into machine instructions. Nor is it a command language, wherein each statement causes a specific action to take place. JCL is a job description language; it is a language used by the programmer to describe to the machine's operating system the work he has for it to do. To the System/360 operating system, a job is completely described by specifying a sequence of programs to be executed and, for each program, a list of external data sets required. Because there are so many possible combinations of programs and data, programs with all the various constraints applicable to them, data sets that can reside on any of a number of different devices, and often in different ways on the same device, because of all these possibilities and because JCL avoids making assumptions about what the programmer intends, the job descriptions expressed in JCL often require considerable detail. 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 Improved Key Agreement Protocol Based on Key Association Set for Dynamic Peer Group
Authors: Chuyuan Wei, Ying Hao, Cheng Lv, Liping Qian
Venue: Proceedings of the 2007 International Conference on Computational Intelligence and Security (2007)

Secure group communication is a research hotspot. The Tree-based Group Diffie-Hellman Protocol is a fairly good key management scheme for dynamic peer group communications. Through analyzing TGDH protocol, the authors have found out that a deficiency exists with its communication mode. A lot of redundant messages are used to complete group re-keying so that more communication bandwidth will be consumed in TGDH. This paper aims to solve the deficiency and improve TGDH through designing a preparatory algorithm of finding a Key Association Set. A new re-keying protocol is also designed by using the algorithm. Theoretical analysis shows that our protocol effectively decreases the communication and storage overload of TGDH, with the communication bandwidth descending from O (nlogn) to O (n) and the key storage descending from O (n) to O (logn). The simulation result also shows the improved protocol has a better communication performance.
Interactive question answering: Is Cross-Language harder than monolingual searching?
Authors: Fernando López-Ostenero, Víctor Peinado, Julio Gonzalo, Felisa Verdejo
Venue: Information Processing and Management: an International Journal (2008)

Is Cross-Language answer finding harder than Monolingual answer finding for users? In this paper we provide initial quantitative and qualitative evidence to answer this question. In our study, which involves 16 users searching questions under four different system conditions, we find that interactive cross-language answer finding is not substantially harder (in terms of accuracy) than its monolingual counterpart, using general purpose Machine Translation systems and standard Information Retrieval machinery, although it takes more time. We have also seen that users need more context to provide accurate answers (full documents) than what is usually considered by systems (paragraphs or passages). Finally, we also discuss the limitations of standard evaluation methodologies for interactive Information Retrieval experiments in the case of cross-language question answering.