ppxscal/embedding_network huggingface dataset:
Corona charging damage on thermal Si/SiO2structures with nm-thick Oxides revealed by electron spin resonance
Authors: A. Stesmans, V. V. Afanas'ev
Venue: Microelectronic Engineering (2004)

The impact of room temperature corona charging biasing on thermal (100) and (111)Si/SiO2 entities with nm-thin (<5.7 nm) SiO2 layers in terms of their point defect signature has been probed by electron spin resonance (ESR). Both structures fully passivated in H2 as well as exhaustively H-depleted ones were investigated. The ESR study reveals that the versatile non-contacting corona biasing method frequently applied in the electrical analysis of Si/SiO2-based structures is not a non-invasive tool, as usually assumed. In the absence of carrier impact damage, at least five types of ESR-active defects are generated (activated) in fully passivated entities, while ESR-active defects are partially inactivated in H-lean Si/SiO2 entities, indicating the devastating nature and threatening inference of intrinsic device properties. The impact is ascribed to the interaction of atomic hydrogen released during the corona process with the Si/SiO2 system.
Counter-example generation in symbolic abstract model-checking
Authors: Gordon Pace, Nicolas Halbwachs, Pascal Raymond
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2004)

The boundaries of model-checking have been extended through the use of abstraction. These techniques are conservative, in the following sense: when the verification succeeds, the verified property is guaranteed to hold; but when it fails, it may result either from the non satisfaction of the property, or from a too rough abstraction. In case of failure, it is, in general, undecidable whether an abstract trace corresponding to a counter-example has any concrete counterparts. For debugging purposes, one usually desires to go further than giving a &#x201c;yes/no&#x201d; answer (actually, a &#x201c;yes/don&#x2019;t know&#x201d; answer!), and look for such concrete counter-examples. We propose a solution in which we apply standard test-pattern generation technology to search for concrete instances of abstract traces.
IPSI-PF: A Business Process Matchmaking Engine
Authors: Andreas Wombacher, Bendick Mahleko, Erich Neuhold
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Success of web services mainly depends on the availability of tools facilitating usage of technology within the addressed B2B integration problems. One severe problem in loosely coupled systems is service discovery including a sufficient matchmaking definition. The concept for service discovery in web service architecture is UDDI providing limited querying functionality and not being capable to deal with the multiple dimensions of a service, like for example semantic, workflow, or Quality of Service aspects. The IPSI Process Finder (IPSI-PF) provides a matchmaking definition and an engine focusing on process aspects. In particular, the matchmaking engine realizes service discovery by extending the capabilities of UDDI to ease the integration with additional UDDI extensions addressing other service description dimensions.
Automatic performance evaluation of web search engines
Authors: Fazli Can, Rabia Nuray, Ayisigi B. Sevdik
Venue: Information Processing and Management: an International Journal (2004)

Measuring the information retrieval effectiveness of World Wide Web search engines is costly because of human relevance judgments involved. However, both for business enterprises and people it is important to know the most effective Web search engines, since such search engines help their users find higher number of relevant Web pages with less effort. Furthermore, this information can be used for several practical purposes. In this study we introduce automatic Web search engine evaluation method as an efficient and effective assessment tool of such systems. The experiments based on eight Web search engines, 25 queries, and binary user relevance judgments show that our method provides results consistent with human-based evaluations. It is shown that the observed consistencies are statistically significant. This indicates that the new method can be successfully used in the evaluation of Web search engines.
Discovering High-Order Periodic Patterns
Authors: Jiong Yang, Wei Wang, Philips S. Yu
Venue: Knowledge and Information Systems (2004)

Discovery of periodic patterns in time series data has become an active research area with many applications. These patterns can be hierarchical in nature, where a higher-level pattern may consist of repetitions of lower-level patterns. Unfortunately, the presence of noise may prevent these higher-level patterns from being recognized in the sense that two portions (of a data sequence) that support the same (high-level) pattern may have different layouts of occurrences of basic symbols. There may not exist any common representation in terms of raw symbol combinations; and hence such (high-level) pattern may not be expressed by any previous model (defined on raw symbols or symbol combinations) and would not be properly recognized by any existing method. In this paper, we propose a novel model, namely meta-pattern, to capture these high-level patterns. As a more flexible model, the number of potential meta-patterns could be very large. A substantial difficulty lies in how to identify the proper pattern candidates. However, the well-known Apriori property is not able to provide sufficient pruning power. A new property, namely component location property, is identified and used to conduct the candidate generation so that an efficient computation-based mining algorithm can be developed. Last, but not least, we apply our algorithm to some real and synthetic sequences and some interesting patterns are discovered.
Constructive sculpting of heterogeneous volumetric objects using trivariate B-splines
Authors: B. Schmitt, A. Pasko, C. Schlick
Venue: The Visual Computer: International Journal of Computer Graphics (2004)

This paper deals with modeling heterogeneous volumetric objects as point sets with attributes using trivariate B-splines. In contrast to homogeneous volumes with uniform distribution of material and other properties, a heterogeneous volumetric object has a number of variable attributes assigned at each point. An attribute is a mathematical model of an object property of an arbitrary nature (material, photometric, physical, statistical, etc.). In our approach, the function representation (FRep) is used as the basic model for both object geometry and attributes represented independently using real-valued scalar functions of point coordinates. While FRep directly defines object geometry, for an attribute it specifies a space partition used to define the attribute function. We propose a volume sculpting scheme with multiresolution capability based on trivariate B-spline functions to define both object geometry and its attributes. A new trivariate B-spline primitive is proposed that can be used as a leaf in an FRep constructive tree. An interactive volume modeler based on trivariate B-splines and other simple primitives is described, with a real-time repolygonization of the surface during modeling. We illustrate that the space partition obtained in the modeling process can be applied to define attributes for the objects with an arbitrary geometry model such as BRep or homogeneous volume models.
Feedback EDF Scheduling Exploiting Dynamic Voltage Scaling
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Dynamic voltage scaling (DVS) is a promising methodfor embedded systems to exploit multiple voltage and frequencylevels and to prolong battery life. However, pureDVS techniques do not perform well for systems with dynamicworkloads where the job execution times vary significantly.In this paper, we present a novel approach combiningfeedback control with DVS schemes targeting hardreal-time systems with dynamic workloads. Our method reliesstrictly on operating system support by integrating aDVS scheduler and a feedback controller within the EDFscheduling algorithm. Each task is divided into two portions.Within the first portion, the objective is to exploitfrequency scaling for the average execution time. We reserveenough time for the second portion to meet the deadlinerequirements up to the worst-case execution time followinga last-chance approach. Feedback techniques makethe system capable to select the right frequency and voltagesettings for the first potion, as well as guaranteeing hardreal-time requirements for the overall task. Simulation experimentsdemonstrate the ability of our algorithm to saveup to 29% more energy than previous work for task sets withdifferent dynamic workload characteristics.
RSA-OAEP Is Secure under the RSA Assumption
Authors: Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, Jacques Stern
Venue: Journal of Cryptology (2004)

Recently Victor Shoup noted that there is a gap in the widely believed security result of OAEP against adaptive chosen-ciphertext attacks. Moreover, he showed that, presumably, OAEP cannot be proven secure from the one-wayness of the underlying trapdoor permutation. This paper establishes another result on the security of OAEP. It proves that OAEP offers semantic security against adaptive chosen-ciphertext attacks, in the random oracle model, under the partial-domain one-wayness of the underlying permutation. Therefore, this uses a formally stronger assumption. Nevertheless, since partial-domain one-wayness of the RSA function is equivalent to its (full-domain) onewayness, it follows that the security of RSA-OAEP can actually be proven under the sole RSA assumption, although the reduction is not tight.
An Ontology for Linkups between Norms
Authors: Raffaella Brighi
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper is aimed at investigating the forms of expression specific to the linkups between norms and showing structures with which to formalize the essential properties of such linkups, working from the linguistic formulations the provisions are set in. A formal expression of these concepts, defining a set of ontological categories specific to the legal domain, will enable us to supplement legal texts with information that software agents can process and exchange. In this process, important aspects of application are brought to light that help us find improved ways of using and understanding legal texts.
ILP Models for the Synthesis of Asynchronous Control Circuits
Authors: Josep Carmona, Jordi Cortadella
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

A new technique for the logic synthesis of asynchronous circuits is presented. It is based on the structural theory of Petri nets and integer linear programming. The techniqueis capable of checking implementability conditions, such as,complete state coding, and deriving a gate netlist to implement the specified behavior. This technique can synthesize specifications with few thousands of transitions in the Petrinet, providing a speed-up of several orders of magnitudewith regard to other existing techniques.
An evolutionary constraint satisfaction solution for over the cell channel routing
Authors: Ahmet Unveren, Adnan Acan
Venue: Integration, the VLSI Journal (2004)

A novel evolutionary assignment-ordering approach for combinatorial optimization using constraint satisfaction problem (CSP) modeling is presented. In the assignment of values to variables, the order of assignment is determined by an ordering function combined with problem-specific features. No a priori information is available on the assignment-ordering function and it is completely determined by evolutionary optimization to produce the best assignment results. Indeed, experimental evaluations show that the proposed method outperforms very well-known approaches for the solution of NP-hard combinatorial optimization problems from VLSI layout design, namely, channel routing and multi-layer over the cell channel routing.
The effects of feedback on targeting with multiple moving targets
Authors: David Mould, Carl Gutwin
Venue: Proceedings of Graphics Interface 2004 (2004)

A number of task settings involve selection of objects from dynamic visual environments with multiple moving targets. Target selection is difficult in these settings because objects move, because there are a number of distracter objects for any targeting action, and because objects can occlude the target. Target feedback has been suggested as a way to assist targeting in visual environments. We carried out an experiment to test the effects of visual target feedback. We found that targeting does become more difficult as the number and speed of objects increases, and that feedback can improve error rates. When feedback was provided on all objects in the space, performance improved significantly over no feedback. Target-only feedback, however, was not significantly better than no feedback. This is a valuable result because all-object feedback is in most cases the only implementation option - since it is usually not possible to pre-determine the user's target among the set of objects.
Free Software for a World in Motion
Authors: Anna Rosling Ronnlund, Ola Rosling
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

This paper focus the need for new educational software environments for exploration of global statistics. We present some concrete examples of highly interactive, non-linear, visual displays for explortive understanding of socioeconomic trends in the contemporary world.
Incremental and Decremental Least Squares Support Vector Machine and Its Application to Drug Design
Authors: Hyunsoo Kim, Haesun Park
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

The least squares support vector machine (LS-SVM) has shown to exhibit excellent classification performance in many applications. In this paper, we propose an incremental and decremental LS-SVM based on updating and downdating the QR decomposition. It can efficiently compute the updated solution when data points are appended or removed. The experiment results illustrated that the proposed incremental algorithm efficiently produces the same solutions as those obtained by LS-SVM which recomputes the solution all over even for small changes in the data. For drug design, the results of each biochemistry laboratory test on a new compound can be iteratively included in the training set. This procedure can further improve precision in order to select the next best predicted organic compound. Instead of retraining entire data points, it is much efficient to update solution by incremental LS-SVM.
BASS: Approximate Search on Large String Databases
Authors: Jiong Yang, Wei Wang, Philip Yu
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

In this paper, we study the problem on how to build an index structurefor large string databases to efficiently support various types ofstring matching without the necessity of mapping the substrings toa numerical space (e.g., string B-tree and MRS-index) nor the restrictionof in-memory practice (e.g., suffix tree and suffix array).Towards this goal, we propose a new indexing scheme, BASS-tree,to efficiently support general approximate substring match (in termsof certain symbol substitutions and misalignments) in sublinear timeon a large string database. The key idea behind the design is that allpositions in each string are grouped recursively into a fully balancedtree according to the similarities of the subsequent segments startingat those positions. Each node is labeled with a regular expressionthat describes the commonality of the substrings indexed through thesubtree. Any search can then be properly directed to the portionin the database with a high potential of matching quickly. With theBASS-tree in place, wild card(s) in the query pattern can also behandled in a seamless way. In addition, search of a long pattern canbe decomposed into a series of searches of short segments followedby a process to join the results. It has been demonstrated in ourexperiments that the potential performance improvement brought byBASS-tree is in an order of magnitude over alternative methods.
Expressing and optimizing sequence queries in database systems
Authors: Reza Sadri, Carlo Zaniolo, Amir Zarkesh, Jafar Adibi
Venue: ACM Transactions on Database Systems (TODS) (2004)

The need to search for complex and recurring patterns in database sequences is shared by many applications. In this paper, we investigate the design and optimization of a query language capable of expressing and supporting efficiently the search for complex sequential patterns in database systems. Thus, we first introduce SQL-TS, an extension of SQL to express these patterns, and then we study how to optimize the queries for this language. We take the optimal text search algorithm of Knuth, Morris and Pratt, and generalize it to handle complex queries on sequences. Our algorithm exploits the interdependencies between the elements of a pattern to minimize repeated passes over the same data. Experimental results on typical sequence queries, such as double bottom queries, confirm that substantial speedups are achieved by our new optimization techniques.
Significant facet retrieval for real-time 3D sound rendering in complex virtual environments
Authors: Chris Joslin, Nadia Magnenat-Thalmann
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

Sound rendering requires that many different aspects are considered simultaneously, especially when rendering a real-time virtual environment. In 3D sound rendering, much the same as for graphics, one of the major influencing factors is the number of reflective polygons in a scene and due to the increase in the ability of most common graphics cards this number can now be very high, especially when scene designers produce an optimum scene using other optimizing tools such as Polygon Cruncher or Rational Reducer. In addition, the use of programs such as Lightscape&trade; [20], which is used to produce realistic lighting, by using per vertex shading, increases the number of polygons in a scene by several factors. Therefore a strong, pre-processing method is proposed that dramatically reduces the number of polygons in the scene to a suitable level for real-time sound rendering. The method can also be combined with other methods (e.g. scene partitioning) for even lower CPU usage.
Note: small point sets that meet all generators of Q(2n,p), p>3 prime
Authors: Jan De Beule, Klaus Metsch
Venue: Journal of Combinatorial Theory Series A (2004)

It was shown recently that Q(6, q), q > 3, q a prime has no ovoids. We improve this result by showing that the smallest cardinality of a set of points of Q(6, q), q > 3 prime, meeting all generators of Q(6, q) is q3 + q. Up to isomorphism there is only one example of this size. At last, we generalize this result to Q(2n, q).
Effect of bismuth excess on the crystallization of Bi3.25La0.75Ti3O12thin films on Pt/Ti/SiO2/Si substrates
Authors: Kyoung-Tae Kim, Chang-Il Kim
Venue: Microelectronic Engineering (2004)

Bismuth lanthanum titanate (BLT) thin films with excess Bi contents were prepared onto a Pt/Ti/SiO2/Si substrate by a metalorganic decomposition technique (MOD). The effect of Bi excess on the microstructure and ferroelectric properties was investigated. When a 10% of Bi excess was added, the BLT thin films showed a polycrystalline structure. The remanent polarization and dielectric constant decreased with more than 10% of Bi excess. Bi deficiency or Bi excess over 10% in the BLT films resulted in poor fatigue properties. This was attributed to the structure defects and a presence of a secondary phase, which coexists with a layered perovskite phase. The BLT thin films with 10% of Bi excess have the remanent polarization (2Pr) value of 25.66 µC/cm2 and a coercive field of 84.75 kV/cm. The BLT thin films with 10% of Bi excess showed no fatigue even after 1 × 109 bipolar switching cycles.
Supporting active database learning and training through interactive multimedia
Authors: Claus Pahl, Ronan Barrett, Claire Kenny
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

The learning objectives of a database course include aspects from conceptual and theoretical knowledge to practical development and implementation skills. We present an interactive educational multimedia system based on the virtual apprenticeship model for the knowledge- and skills-oriented Web-based education of database course students. Combining knowledge learning and skills training in an integrated environment is a central aspect of our system. We show that tool-mediated independent learning and training in an authentic setting is an alternative to traditional classroom-based approaches.
Complex minimax programming under generalized convexity
Authors: S. K. Mishra, S. Y. Wang, K. K. Lai
Venue: Journal of Computational and Applied Mathematics (2004)

We establish the Kuhn-Tucker-type sufficient optimality conditions for complex minimax programming under generalized invex functions. Subsequently, we apply these optimality criteria to formulate two dual models. We also establish weak, strong and strict converse duality theorems.
Coin flipping by telephone a protocol for solving impossible problems
Authors: Manuel Blum
Venue: ACM SIGACT News (1983)

Alice and Bob want to flip a coin by telephone. (They have just divorced, live in different cities, want to decide who gets the car.) Bob would not like to tell Alice HEADS and hear Alice (at the other end of the line) say "Here goes . . . I'm flipping the coin. . . . You lost!"Coin-flipping in the SPECIAL way done here has a serious purpose. Indeed, it should prove an INDISPENSABLE TOOL of the protocol designer. Whenever a protocol requires one of two adversaries, say Alice, to pick a sequence of bits at random, and whenever it serves Alice's interests best NOT to pick her sequence of bits at random, then coin-flipping (Bob flipping coins to Alice) as defined here achieves the desired goal:1. It GUARANTEES to Bob that Alice will pick her sequence of bits at random. Her bit is 1 if Bob flips heads to her, O otherwise.2. It GUARANTEES to Alice that Bob will not know WHAT sequence of bits he flipped to her.Coin-flipping has already proved useful in solving a number of problems once thought impossible: mental poker, certified mail, and exchange of secrets. It will certainly prove a useful tool in solving other problems as well.
The women's game conference
Authors: Newton Lee
Venue: Computers in Entertainment (CIE) (2004)

The Women's Game Conference focuses on women in the computer and video game industry. The conference will focus on a variety of women's topics in the computer and video game industry including examining career paths for women in the industry and issues related to working in the industry as women as well as how women are portrayed in games and women and girls as consumers of games.The Women's Game Conference runs concurrently with the Austin Game Conference September 9-10, 2004 at the Austin Convention Center and is open to anyone interested in the game industry and game development. 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