ppxscal/embedding_network huggingface dataset:
Quasi-damascene metal gate/high-k CMOS using oxygenation through gate electrodes
Authors: Changhwan Choi, Takashi Ando, Eduard Cartier, Martin M. Frank, Ryosuke Iijima, Vijay Narayanan
Venue: Microelectronic Engineering (2009)

We present a novel metal gate/high-k complementary metal-oxide-semiconductor (CMOS) integration scheme with symmetric and low threshold voltage (V"t"h) for both n-channel (nMOSFET) and p-channel (pMOSFET) metal-oxide-semiconductor field-effect transistors. The workfunction of pMOSFET is modulated by oxygen in-diffusion ('oxygenation') through the titanium nitride metal gate without equivalent oxide thickness (EOT) degradation. A significant V"t"h improvement by 420mV and an aggressively scaled capacitance equivalent thickness under channel inversion (T"i"n"v) of 1.3nm is achieved for the pFET by using a replacement process in conjunction with optimized oxygenation process. Immunity of nMOSFET against oxygenation process is demonstrated.
Algorithms and classification in groups of piecewise-linear homeomorphisms
Authors: Kenneth S. Brown, Martin D. Kassabov
Venue:  (2008)

The first part (Chapters 2 through 5) studies decision problems in Thompson's groups F, T, V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's group F and suitable larger groups of piecewise-linear homeomorphisms of the unit interval. We describe a conjugacy invariant both from the piecewise-linear point of view and a combinatorial one using strand diagrams. We determine algorithms to compute roots and centralizers in these groups and to detect periodic points and their behavior by looking at the closed strand diagram associated to an element. We conclude with a complete cryptanalysis of an encryption protocol based on the decomposition problem. In the second part (Chapters 6 and 7), we describe the structure of subgroups of the group of all homeomorphisms of the unit circle, with the additional requirement that they contain no non-abelian free subgroup. It is shown that in this setting the rotation number map is a group homomorphism. We give a classification of such subgroups as subgroups of certain wreath products and we show that such subgroups can exist by building examples. Similar techniques are then used to compute centralizers in these groups and to provide the base to generalize the techniques of the first part and to solve the simultaneous conjugacy problem.
On the Ethical Quandaries of a Practicing Roboticist: A First-Hand Look
Authors: Ronald C. Arkin
Venue: Proceeding of the 2008 conference on Current Issues in Computing and Philosophy (2008)

Robotics has progressed substantially over the last 20 years, moving from simple proof-of-concept experimental research to developing market and military technologies that have significant ethical consequences. This paper provides the reflections of a roboticist on current research directions within the field and the social implications associated with its conduct.
The Logic of Learning
Authors: Luc Raedt
Venue: Proceedings of the 7th International Conference on Formal Concept Analysis (2009)

I use the term logical and relational learning (LRL) to refer to the subfield of machine learning and data mining that is concerned with learning in expressive logical or relational representations. It is the union of inductive logic programming, (statistical) relational learning and multi-relational data mining and constitutes a general class of techniques and methodology for learning from structured data (such as graphs, networks, relational databases) and background knowledge. During the course of its existence, logical and relational learning has changed dramatically. Whereas early work was mainly concerned with logical issues (and even program synthesis from examples), in the 90s its focus was on the discovery of new and interpretable knowledge from structured data, often in the form of rules or patterns. Since then the range of tasks to which logical and relational learning has been applied has significantly broadened and now covers almost all machine learning problems and settings. Today, there exist logical and relational learning methods for reinforcement learning, statistical learning, distance- and kernel-based learning in addition to traditional symbolic machine learning approaches. At the same time, logical and relational learning problems are appearing everywhere. Advances in intelligent systems are enabling the generation of high-level symbolic and structured data in a wide variety of domains, including the semantic web, robotics, vision, social networks, and the life sciences, which in turn raises new challenges and opportunities for logical and relational learning.In this talk, I will start by providing a gentle introduction to the field of logical and relational learning and then continue with an overview of the logical foundations for learning, which are concerned with various settings for learning (such as learning from entailment, from interpretations and from proofs), with the logical inference rules and generality relationships used, and the effects they have on the properties of the search-space. More details can be found inLuc De Raedt. Logical and Relational Learning. Springer. 2008.
Clustering over Evolving Data Streams Based on Online Recent-Biased Approximation
Authors: Wei Fan, Yusuke Koyanagi, Koichi Asakura, Toyohide Watanabe
Venue: Knowledge Acquisition: Approaches, Algorithms and Applications: Pacific Rim Knowledge Acquisition Workshop, PKAW 2008, Hanoi, Vietnam, December 15-16, 2008, Revised Selected Papers (2009)

A growing number of real world applications deal with multiple evolving data streams. In this paper, a framework for clustering over evolving data streams is proposed taking advantage of recent-biased approximation. In recent-biased approximation, more details are preserved for recent data and fewer coefficients are kept for the whole data stream, which improves the efficiency of clustering and space usability greatly. Our framework consists of two phases. One is an online phase which approximates data streams and maintains the summary statistics incrementally. The other is an offline clustering phase which is able to perform dynamic clustering over data streams on all possible time horizons. As shown in complexity analyses and also validated by our empirical studies, our framework performed efficiently in the data stream environment while producing clustering results of very high quality.
Agent Verification Design of Short Text Messaging System Using Formal Method
Authors: Ali Selamat, Siti Dianah Bujang, Md. Hafiz Selamat
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Today, in the evolution of hardware and software system in mobile-driven applications, failure is unacceptable to many entrepreneurs. The use of Short Message Service (SMS) for internet-based business is acknowledged to be one of the applications that have a potential to give unreliable results to the information systems. Once the workload is optimized, the network traffic becomes congested, which minimizes the performance of the system. Therefore, to develop a dependable SMS system, we need a reliable verification method. Besides the agent-based verification method, formal method verification on the design is also needed. This is to ensure that the system design is secured from the unseen errors and bugs in the early stage of development. In order to make this successful, this paper will discuss more on the verification design of short-text messaging system with the implementation of an agent-based system known as model checking. The aim of this paper is to provide a reliable and verifiable system designs, using Spin as the model checker.
The ISMS Business Environment Elaboration Using a UML Approach
Authors: Andrzej Białas
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

The paper deals with software development for supporting information security management, particularly the modeling of the business environment of the organization implementing Information Security Management System (ISMS). The ISMS, based on the PDCA (Plan-Do-Check-Act) model, was defined in the BS7799-2:2002 standard. The paper focuses on the identification of the ISMS business environment that provides appropriate positioning of the ISMS within the organization. The general model of the ISMS business environment based on the high-level risk analysis was presented. The UML approach allows to implement the ISMS within organizations in a more consistent and efficient way and to create supporting tools improving information security management.
Ontology-based Multi-agent Systems Support Human Disease Study and Control
Authors: Maja Hadzic, Elizabeth Chang
Venue: Proceeding of the 2005 conference on Self-Organization and Autonomic Informatics (I) (2005)

The medical milieu is an open environment characterized by a variety of distributed, heterogeneous and autonomous information resources. Coordination, cooperation and exchange of information is important to the medical community. Efficient storage and acquisition of medical knowledge requires structured and standardized organization of data. We design a new ontology, called Generic Human Disease Ontology (GHDO), for the representation of knowledge regarding human diseases. The concepts of the GHDO ontology are organized into the following four 'dimensions': Disease Types, Symptoms, Causes and Treatments. We align and merge existing ontologies against the four dimensions of GHDO. The designed ontology makes our query system suitable for different user categories. The process of problem decomposition into smaller sub-problems within a multi-agent system becomes much easier as well. We also design a multi-agent system framework over different information resources. The multi-agent system uses the common GHDO ontology for query formulation, information retrieval and information integration. This intelligent dynamic system provides opportunities to collect information from multiple information resources, to share data efficiently and to integrate and manage scientific results in a timely manner.
Keeping the pace in CS-1 through the use of CMS
Authors: Can Kültür
Venue: ACM SIGCSE Bulletin (2009)

In this poster, it is aimed to share the experience of using course management systems (CMS) in a CS-1 course. The aim was to focus on the individual needs of students while learning programming. Creating a social online environment for solving exercises and sharing solutions seemed to be effective to support instructors as well as students.
A perspective on service orchestration
Authors: Marco A. Barbosa, Luis S. Barbosa
Venue: Science of Computer Programming (2009)

Service-oriented computing is an emerging paradigm with increasing impact on the way modern software systems are designed and developed. Services are autonomous, loosely coupled and heterogeneous computational entities able to cooperate to achieve common goals. This paper introduces a model for service orchestration, which combines a exogenous coordination model, with services' interfaces annotated with behavioural patterns specified in a process algebra which is parametric on the interaction discipline. The coordination model is a variant of Reo for which a new semantic model is proposed.
An environment for user interface softbots
Authors: Robert St. Amant, Ajay Dudani
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

A user interface softbot is a software agent that controls an interactive system through the graphical user interface, relying on visual information from the system rather than an application programming interface or access to source code. Interface softbots have acted as autonomous agents in applications such as drawing and data recording, and the core vision processing algorithms have been incorporated into cognitive models for simple problem-solving tasks. Building interface softbots is still a time-consuming task, unfortunately, requiring experience with complex program components as well as the details of the visual interface. We have developed a prototype development environment that facilitates the development of interface softbots, streamlining the programming process and making it more accessible to new developers.
Asymptotic behaviour of the finite-time ruin probability in renewal risk models
Authors: Remigijus Leipus, Jonas Šiaulys
Venue: Applied Stochastic Models in Business and Industry (2009)

In this paper we study the tail behaviour of the probability of ruin within finite time t, as initial risk reserve x tends to infinity, for the renewal risk model with strongly subexponential claim sizes. The asymptotic formula holds uniformly for t&isin;[f(x), &infin;), where f(x) is an infinitely increasing function, and substantially extends the result of Tang (Stoch. Models 2004; 20:281&ndash;297) obtained for the class of claim distributions with consistently varying tails. Two examples illustrate the result. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Highly Accurate PDE-Based Morphology for General Structuring Elements
Authors: Michael Breuß, Joachim Weickert
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

Modelling the morphological processes of dilation and erosion with convex structuring elements with partial differential equations (PDEs) allows for digital scalability and subpixel accuracy. However, numerical schemes suffer from blur by dissipative artifacts. In our paper we present a family of so-called flux-corrected transport (FCT) schemes that addresses this problem for arbitrary convex structuring elements. The main characteristics of the FCT-schemes are: (i) They keep edges very sharp during the morphological evolution process, and (ii) they feature a high rotational invariance. Numerical experiments with diamonds and ellipses as structuring elements show that FCT-schemes are superior to standard schemes in the field of PDE-based morphology.
Brief paper: Adaptive divided difference filtering for simultaneous state and parameter estimation
Authors: Niranjan Subrahmanya, Yung C. Shin
Venue: Automatica (Journal of IFAC) (2009)

A novel adaptive version of the divided difference filter (DDF) applicable to non-linear systems with a linear output equation is presented in this work. In order to make the filter robust to modeling errors, upper bounds on the state covariance matrix are derived. The parameters of this upper bound are then estimated using a combination of offline tuning and online optimization with a linear matrix inequality (LMI) constraint, which ensures that the predicted output error covariance is larger than the observed output error covariance. The resulting sub-optimal, high-gain filter is applied to the problem of joint state and parameter estimation. Simulation results demonstrate the superior performance of the proposed filter as compared to the standard DDF.
Tight sets and m-ovoids of generalised quadrangles
Authors: John Bamberg, Maska Law, Tim Penttila
Venue: Combinatorica (2009)

The concept of a tight set of points of a generalised quadrangle was introduced by S. E. Payne in 1987, and that of an m-ovoid of a generalised quadrangle was introduced by J. A. Thas in 1989, and we unify these two concepts by defining intriguing sets of points. We prove that every intriguing set of points in a generalised quadrangle is an m-ovoid or a tight set, and we state an intersection result concerning these objects. In the classical generalised quadrangles, we construct new m-ovoids and tight sets. In particular, we construct m-ovoids of W(3,q), q odd, for all even m; we construct (q+1)/2-ovoids of W(3,q) for q odd; and we give a lower bound on m for m-ovoids of H(4,q 2).
An integrated approach to thermal management in high-level synthesis
Authors: Rajarshi Mukherjee, Seda Ogrenci Memik
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2006)

Thermal effects are becoming an important factor in the design of integrated circuits due to the adverse impact of temperature on performance, reliability, leakage, and chip packaging costs. Making all phases of the design flow aware of this physical phenomenon helps in reaching faster design closure. In this paper, we present an integrated approach to thermal management in architectural synthesis. Our synthesis flow combines temperature-aware scheduling and binding based on feedback from thermal simulation. We show that our flow is effective in preventing hotspot formation and creating an even thermal profile of the resources. Our integrated thermal management technique on average reduces the peak temperature of the resources by 7.34°C when compared to a thermal unaware flow without increasing the number of resources across our set of benchmarks.
Decision fusion for improved automatic license plate recognition
Authors: Mircea Boscoianu, Cristian Molder, Janel Arhip, Mihai I. Stanciu, Lulian C. Vizitiu
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

Automatic license plate recognition (ALPR) is a pattern recognition application of great importance for access, traffic surveillance and law enforcement. Therefore many studies are concentrated on creating new algorithms or improving their performance. Many authors have presented algorithms that are based on individual methods such as skeleton features, neural networks or template matching for recognizing the license plate symbols. In this paper we present a novel approach for decisional fusion of several recognition methods, as well as new classification features. The classification results are proven to be significantly better that each of the method considered individually. For better results, syntax corrections are also considered. Several trainable and nontrainable decisional fusion rules have been taken into account, evidencing each of the classification methods at their best. Experimental results are shown, the results being very encouraging by obtaining a symbol good recognition rate (GRC) of more than 99.4% on a real license plate database.
Evolutionary Optimization of Trading Strategies
Authors: Jiarui Ni, Longbing Cao, Chengqi Zhang
Venue: Proceeding of the 2008 conference on Applications of Data Mining in E-Business and Finance (2008)

It is a non-trivial task to effectively and efficiently optimize trading strategies, not to mention the optimization in real-world situations. This paper presents a general definition of this optimization problem, and discusses the application of evolutionary technologies (genetic algorithm in particular) to the optimization of trading strategies. Experimental results show that this approach is promising.
Smart cheaters do prosper: defeating trust and reputation systems
Authors: Reid Kerr, Robin Cohen
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Traders in electronic marketplaces may behave dishonestly, cheating other agents. A multitude of trust and reputation systems have been proposed to try to cope with the problem of cheating. These systems are often evaluated by measuring their performance against simple agents that cheat randomly. Unfortunately, these systems are not often evaluated from the perspective of security---can a motivated attacker defeat the protection? Previously, it was argued that existing systems may suffer from vulnerabilities that permit effective, profitable cheating despite the use of the system. In this work, we experimentally substantiate the presence of these vulnerabilities by successfully implementing and testing a number of such 'attacks', which consist only of sequences of sales (honest and dishonest) that can be executed in the system. This investigation also reveals two new, previously-unnoted cheating techniques. Our success in executing these attacks compellingly makes a key point: security must be a central design goal for developers of trust and reputation systems.
Aspect-Oriented Use Cases and Crosscutting Interfaces for Reconfigurable Behavior Modeling
Authors: Lina Nemuraite, Milda Balandyte
Venue: Proceeding of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS'2006 (2007)

Aspect-oriented development has become one of the most intensively investigated themes in software development. In this paper, the method is proposed for reconfigurable modeling of aspect-oriented information system when <<Core>> and <<Aspect>> concerns may be represented separately and combined in different ways without changing their models or implementation. <<Aspect>> concerns are consistently represented during development process starting from <<Aspect>> use cases till crosscutting interfaces and templates for tailoring aspects for specific contexts. Examples from IT-Europe project are given where aspect-oriented concepts were used for modeling behavior of software agents performing self-management functionality of IT Knowledge Portal. The work is supported by Lithuanian State Science and Studies Foundation according to Eureka programme project “IT-Europe” (Reg. No 3473).
System approach to synthesis, modeling and control of complex dynamical systems
Authors: Armen G. Bagdasaryan
Venue: WSEAS Transactions on Systems and Control (2009)

The basic features of complex dynamical and control systems, including systems having hierarchical structure, are considered. Special attention is paid to the problems of synthesis of dynamical models of complex systems, construction of efficient control models, and to the development of simulation techniques. An approach to the synthesis of dynamic models of complex systems that integrates expert knowledge with the process of modeling is proposed. A set-theoretic model of complex system is defined and briefly analyzed. A mathematical model of complex dynamical system with control, based on aggregate description, is also proposed. The structure of the model is described, and architecture of computer simulation system is presented, requirements to and components of computer simulation systems are analyzed.
Angular momentum guided motion concatenation
Authors: Hubert P. H. Shum, Taku Komura, Pranjul Yadav
Venue: Computer Animation and Virtual Worlds (2009)

In this paper, we propose a new method to concatenate two dynamic full-body motions such as punches, kicks, and flips by using the angular momentum as a cue. Through the observation of real humans, we have identified two patterns of angular momentum that make the transition of such motions efficient. Based on these observations, we propose a new method to concatenate two full-body motions in a natural manner. Our method is useful for applications where dynamic, full-body motions are required, such as 3D computer games and animations. Copyright &copy; 2009 John Wiley & Sons, Ltd. We propose a new method to concatenate two dynamic full-body motions such as punches, kicks, and flips by using the angular momentum as a cue. Through the observation of real humans, we have identified two patterns of angular momentum that make the transition of such motions efficient. Based on these observations, we propose a new method to concatenate two full-body motions in a natural manner.