ppxscal/embedding_network huggingface dataset:
Very high resolution etching of magnetic nanostructures in organic gases
Authors: X. Kong, D. Krása, H. P. Zhou, W. Williams, S. McVitie, J. M. R. Weaver, C. D. W. Wilkinson
Venue: Microelectronic Engineering (2008)

Two methods for high resolution dry etching of permalloy (NiFe) and iron (Fe) nanostructures are presented and discussed. The first involves the use of carbon monoxide (CO) and ammonia (NH"3) as etching gases, the second uses methane (CH"4), hydrogen (H"2) and oxygen (O"2). In both etching processes volatile metallo-organic compounds are the resulting reaction products. The patterned and dry etched thin films were observed with SEM and TEM to study the quality of each of the two processes. It is found that the CO/NH"3 process yields higher etch rates, higher selectively with respect to the SiN mask used, and less redeposition than the CH"4/H"2/O"2 process.
Preparation and Evaluation of Polyactin Microparticles from Supercritical CO2 Processing
Authors: Jianhong Bi, Jinglan Zhao, Lang Bao, Yan Liu, Caosong Wu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

This paper reports the use of a coating process based on supercritical fluid technology to prepare a solvent-free microparticles, loaded with a polymannopeptide (polyactin,PAA) for enhanceing optimal host response in cancer immunotherapy.Microparticles were characterized as regards their morphology, drug content and in vitro release . A prolonged release of the PAA had been achieved over a 24 h period from microparticles coated with the lipidic compound, which produced a more homogeneous, film-forming coating. Furthermore, it was shown that PAA did not undergo any degradation under the supercritical conditions used in the coating process. In vitro immunoactivity and anti-tumor effect analysis results showed that the PAA microsphere could efficiently trigger the induction of cytotoxic T lymphocytes (CTL) in a sustained manner.
Representational power of restricted boltzmann machines and deep belief networks
Authors: Nicolas Le Roux, Yoshua Bengio
Venue: Neural Computation (2008)

Deep belief networks (DBN) are generative neural network models with many layers of hidden explanatory factors, recently introduced by Hinton, Osindero, and Teh (2006) along with a greedy layer-wise unsupervised learning algorithm. The building block of a DBN is a probabilistic model called a restricted Boltzmann machine (RBM), used to represent one layer of the model. Restricted Boltzmann machines are interesting because inference is easy in them and because they have been successfully used as building blocks for training deeper models. We first prove that adding hidden units yields strictly improved modeling power, while a second theorem shows that RBMs are universal approximators of discrete distributions. We then study the question of whether DBNs with more layers are strictly more powerful in terms of representational power. This suggests a new and less greedy criterion for training RBMs within DBNs.
Full-wave analysis of a microstrip coupled lines filters using the novel method
Authors: Essam A. Hashish, Hossam A. Saker
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

In this paper, a new eigenmode algorithm, based on the method of lines and the generalized transmission line (GTL) equations is applied on full-wave analysis of (3-D) MMIC components. The analytical calculation in the direction of propagation enables the analysis of structures of very short or long interconnections between single discontinuities. The analysis is developed by non-equidistant discretization to reduce the discretization window. This technique is applied to compute the scattering parameters of some coupled lines microstrip filters.
Optimal due date assignment in multi-machine scheduling environments
Authors: Dvir Shabtay, George Steiner
Venue: Journal of Scheduling (2008)

We study two due date assignment problems in various multi-machine scheduling environments. We assume that each job can be assigned an arbitrary non-negative due date, but longer due dates have higher cost. The first problem is to minimize a cost function, which includes earliness, tardiness and due date assignment costs. In the second problem, we minimize an objective function which includes the number of tardy jobs and due date assignment costs. We settle the complexity of many of these problems by either showing that they are $\mathcal{NP}$ -hard or by providing a polynomial time solution for them. We also include approximation and non-approximability results for several parallel-machine problems.
A Markov random field model for mode detection in cluster analysis
Authors: Ahmed Moussa, Abderrahmane Sbihi, Jack-Gérard Postaire
Venue: Pattern Recognition Letters (2008)

A statistical clustering approach is proposed, based on Markov random field models. A discrete field derived from the raw data set is considered as a field of measures. A hidden field, computed using a new potential function, is used to detect the modes that correspond to domains of high local concentrations of observations. Results obtained on artificially generated and real data sets demonstrate the efficiency of this new approach for unsupervised pattern classification.
Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm
Authors: Chieh-Yuan Tsai, Chuang-Cheng Chiu
Venue: Computational Statistics Data Analysis (2008)

K-means is one of the most popular and widespread partitioning clustering algorithms due to its superior scalability and efficiency. Typically, the K-means algorithm treats all features fairly and sets weights of all features equally when evaluating dissimilarity. However, a meaningful clustering phenomenon often occurs in a subspace defined by a specific subset of all features. To address this issue, this paper proposes a novel feature weight self-adjustment (FWSA) mechanism embedded into K-means in order to improve the clustering quality of K-means. In the FWSA mechanism, finding feature weights is modeled as an optimization problem to simultaneously minimize the separations within clusters and maximize the separations between clusters. With this objective, the adjustment margin of a feature weight can be derived based on the importance of the feature to the clustering quality. At each iteration in K-means, all feature weights are adaptively updated by adding their respective adjustment margins. A number of synthetic and real data are experimented on to show the benefits of the proposed FWAS mechanism. In addition, when compared to a recent similar feature weighting work, the proposed mechanism illustrates several advantages in both the theoretical and experimental results.
Mobile Mining and Information Management in HealthNet Scenarios
Authors: Philipp Kranen, David Kensche, Saim Kim, Nadine Zimmermann, Emmanuel Müller, Christoph Quix, Xiang Li, Thomas Gries, Thomas Seidl, Matthias Jarke, Steffen Leonhardt
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

Health and mobility of elderly people is gaining importance in aging societies. New communication-based methods to provide health services with personal health care devices are considered promising elements of first-class medical care services for everybody. To achieve this vision, several technological issues have to be solved: (i) body sensors to monitor vital functions have to be developed; (ii) these sensors should be integrated into textile structures to guarantee ease of use and patient acceptance; (iii)the collected sensor data has to be analyzed to detect emergency situations and to reduce the data volume; (iv) relevant data has to be integrated with other information systems in the work environment of medical experts. These challenges are addressed within the HealthNet project at RWTH Aachen University. The goal of the project is to develop a framework in which health professional scan remotely monitor and diagnose mobile patients. The described demonstration presents our results of the first three issues mentioned above while focusing on the employed data mining and management techniques.
Indecomposable r-graphs and some other counterexamples
Authors: Romeo Rizzi
Venue: Journal of Graph Theory (1999)

An r-graph is any graph that can be obtained as a conic combination of its own 1-factors. An r-graph G(V, E) is said to be indecomposable when its edge set E cannot be partitioned as E = E1 &cup; E2 so that Gi(V, Ei) is an ri-graph for i = 1, 2 and, for some r1, r2. We give an indecomposable r-graph for every integer r &ge; 4. This answers a question raised in [Seymour, Proc London Math Soc 38 (1979, 423&ndash;460], and has interesting consequences for the Schrijver System of the T-cut polyhedron to be given in [Rizzi, 1997, to appear]. A graph in which every two 1-factors intersect is said to be poorly matchable. Every poorly matchable r-graph is indecomposable. We show that for every r &ge; 4 that &ldquo;being indecomposable&rdquo; does not imply &ldquo;being poorly matchable.&rdquo; Next we give a poorly matchable r-graph for every r &ge; 4. The article provides counterexamples to some conjectures of Seymour. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 1&ndash;15, 1999
Encapsulating and exploiting change with changeboxes
Authors: Marcus Denker, Tudor Gîrba, Adrian Lienhard, Oscar Nierstrasz, Lukas Renggli, Pascal Zumkehr
Venue: Proceedings of the 2007 international conference on Dynamic languages: in conjunction with the 15th International Smalltalk Joint Conference 2007 (2007)

Real world software systems change continuously to meet new demands. Most programming languages and development environments, however, are more concerned with limiting the effects of change rather than enabling and exploiting change. Various techniques and technologies to exploit change have been developed over the years, but there exists no common support for these approaches. We propose Changeboxes as a general-purpose mechanism for encapsulating change as a first-class entity in a running software system. Changeboxes support multiple, concurrent and possibly inconsistent views of software artifacts within the same running system. Since Changeboxes are first-class, they can be manipulated to control the scope of change in a running system. Furthermore, Changeboxes capture the semantics of change. Changeboxes can be used, for example, to encapsulate refactorings, or to replay or analyze the history of changes. In this paper we introduce Changeboxes by means of a prototype implementation. We illustrate the benefits that Changeboxes offer for evolving software systems, and we present the results of a preliminary performance evaluation that assesses the costs associated with Changeboxes while suggesting possible strategies for improvement.
FreePad: a novel handwriting-based text input for pen and touch interfaces
Authors: A. Bharath, Sriganesh Madhvanath
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

The last decade has seen tremendous growth in mobile devices such as Pocket PCs, mobile phones, Tablet PCs and notebooks. Most of these devices enable interaction through a stylus or touch interface, powered by handwriting recognition (HWR) capability. In this paper, we propose a novel input method that addresses some of the issues that arise due to the constraints posed by these devices in accepting handwriting input. For instance, many of the devices have a small writing area making "continuous" input difficult if not impossible, and the process of handwriting input demands significant user attention. The proposed solution is inspired by touch-typing, and appreciably reduces user's effort in the interaction, and it is especially suited for very small writing areas. The approach has been demonstrated using a prototype system that recognizes handwritten English words, and its accuracy has been evaluated using a standard dataset of handwritten words. A preliminary user study has also been carried out to understand user acceptance of the proposed technique.
Use of LFSR for Sensor Network Security: A New Approach
Authors: Kalpana Sharma, Vikash Varun, U. Maulick, Rohit Kumar, Vikrant Jain
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

One of the widely used security mechanism for sensor network is the software – hardware implementation of cryptographic algorithms. If the confidential data is lost as a result of adversary effect, then the whole sensor network is prone to get exposed to the intruder. What we need is a strong mechanism, to protect such sensitive data. In this paper we present a technique where we mask all the intermediate input and output data with some values in order to de-correlate information leaked, if any, so that the original/actual information is not exposed to the attacker. An architecture is proposed which is embedded on the sensor node to incorporate built in security feature at the chip level itself. This is done by the addition of a new hardware component called an LFSR, at the chip level itself, which is capable of generating random numbers to mask the output. As far as the clustering technique used is concerned, we’ve considered the hierarchical clustering to ease data aggregation.
Interactive High-Resolution Isosurface Ray Casting on Multicore Processors
Authors: Qin Wang, Joseph JaJa
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

We present a new method for the interactive rendering of isosurfaces using ray casting on multi-core processors. This method consists of a combination of an object-order traversal that coarsely identifies possible candidate 3D data blocks for each small set of contiguous pixels, and an isosurface ray casting strategy tailored for the resulting limited-size lists of candidate 3D data blocks. While static screen partitioning is widely used in the literature, our scheme performs dynamic allocation of groups of ray casting tasks to ensure almost equal loads among the different threads running on multi-cores while maintaining spatial locality. We also make careful use of memory management environment commonly present in multi-core processors. We test our system on a two-processor Clovertown platform, each consisting of a Quad-Core 1.86 GHz Intel Xeon Processor, for a number of widely different benchmarks. The detailed experimental results show that our system is efficient and scalable, and achieves high cache performance and excellent load balancing, resulting in an overall performance that is superior to any of the previous algorithms. In fact, we achieve an interactive isosurface rendering on a 1024x1024 screen for all the datasets tested up to the maximum size of the main memory of our platform.
Formulating Pseudo-Natural Language
Authors: Sudharsan R. Iyengar
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

We present the formulation of primitive verbal pattern and show its use in natural language. These verbal patterns are presented as the production of sounds based on simple timing and note patterns. Superimposing syllables on these verbal patterns yield words. Vedic Chants have been used as a medium for effective and efficient memorization and verbal communication. We illustrate the use of repetitive tonal phrases in Vedic chants. Such simple and fundamental mnemonic characteristics is used together with syllables is used for word formulation. Association of basic semantic concepts with formulated words and a rudimentary sentence formulation scheme are presented. Formulated sentence can be used for communication and conversation purposes.
Undirected connectivity in log-space
Authors: Omer Reingold
Venue: Journal of the ACM (JACM) (2008)

We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4/3(&sdot;) obtained by Armoni, Ta-Shma, Wigderson and Zhou (JACM 2000). As undirected st-connectivity is complete for the class of problems solvable by symmetric, nondeterministic, log-space computations (the class SL), this algorithm implies that SL &equals; L (where L is the class of problems solvable by deterministic log-space computations). Independent of our work (and using different techniques), Trifonov (STOC 2005) has presented an O(log n log log n)-space, deterministic algorithm for undirected st-connectivity. Our algorithm also implies a way to construct in log-space a fixed sequence of directions that guides a deterministic walk through all of the vertices of any connected graph. Specifically, we give log-space constructible universal-traversal sequences for graphs with restricted labeling and log-space constructible universal-exploration sequences for general graphs.
An Ontology Framework for Managing Security Attacks and Defences in Component Based Software Systems
Authors: Artem Vorobiev, Jun Han, Nargiza Bekmamedova
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Software systems become increasingly distributed, involving many independent and collaborating components working towards achieving system goals. At the same time, security attacks on these systems have also grown being more sophisticated and are quite difficult to identify and mitigate, in particular including distributed attacks. In this paper, we argue that one way to detect and resist against such attacks is through the collaboration of a system’s constituent components. To achieve collaborative defense in a distributed component-based system, a common basis (vocabulary) is needed for the components to communicate and work with each other in detecting attacks and devising countermeasures. We adopt an ontological approach to establishing such a common base and introduce ontologies concerning security attacks and defenses. The ontologies specify the security concepts and their relationships in a way understandable to both humans and software agents. We use a case study involving Mitnick attacks to demonstrate how system components use the ontologies to detect and counter attacks.
Load squared: Adding logic close to memory to reduce the latency of indirect loads in embedded and general systems
Authors: Sami Yehia, Jean-Francois Collard, Olivier Temam
Venue: Journal of Embedded Computing (2006)

Indirect memory accesses, where a load is fed by another load, are ubiquitous because of rich data structures and sophisticated software conventions, such as the use of linkage tables and position independent code. Unfortunately, they can be costly: if both loads miss, two round trips to memory are required even though the role of the first load is often limited to fetching the address of the second load. To reduce the total latency of such indirect accesses, a new instruction called load squared is introduced. A load squared does two fetches, the first fetch reading the target address of the second. (An offset is optionally added to the result of the first fetch.) The load squared operation is performed by memory-side logic (typically, the memory controller if it isn't located on the main processor chip). In this study, load squared is not an architecturally visible instruction: the micro-architecture transparently decides which loads should be replaced by loads squared. We show that performance is sometimes improved significantly, and never degraded.
Flow in planar graphs with multiple sources and sinks
Authors: G. L. Miller
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Given a planar network with many sources and sinks, the problem of computing the maximum flow from the sources to the sinks is investigated. An algorithm that runs in O(log/sup 2/n) time using O(n/sup 1.5/) processors on an exclusive-read-exclusive-write parallel random-access machine (EREW PRAM) is obtained, when the amount of flow (demand) at each source and sink is assumed as input. When the demands are unknown, the problem remains open. However, in the special case in which the sources and sinks are all on one face (and the demands unknown), an algorithm that computes the maximum flow with time complexity O(log/sup 3/n log log n) using O(n/sup 1.5/) processors is given. The results also hold for more general networks, namely, when the edge capacities have both lower and upper bounds.
Methods and Tools for Collaborative Networked Organizations, 1 edition
Authors: Luis Camarinha-Matos, Hamideh Afsarmanesh, Martin Ollus, Luis Camarinha-Matos, Hamideh Afsarmanesh, Martin Ollus
Venue:  (2008)

Collaborative Networked Organizations represent one of the most relevant organizational paradigms in industry and services. A large number of developments in recent years have turned Collaborative Networks into a pervasive phenomenon in all socio-economic sectors. The main aim of this book is to provide a comprehensive set of reference materials derived from the results of the ECOLEAD project in one organized volume. The ECOLEAD project, a large 4-year European initiative, involved 28 organizations (from academia, research and industry), from 14 countries (in Europe and Latin America). Three main types of results from ECOLEAD are presented: (i) Conceptual frameworks and models, (ii) Methods and processes, and (iii) Software tools and systems. Furthermore, the experience and lessons learned with a number of large pilot implementations in real-world running networks of enterprises are also included as an indication of the assessment/validation of the project results. Methods and Tools for Collaborative Networked Organizations provides valuable elements for researchers and practitioners involved in the design, implementation, and management of collaborative forms in industry and services.
Forum Theatre as a requirements gathering methodology in the design of a home telecommunication system for older adults
Authors: M. Rice, A. Newell, M. Morgan
Venue: Behaviour & Information Technology (2007)

The ability to elicit requirements in the design of new technology has proved to be particularly problematic with older generations of users who have not grown up with the same level of familiarity and understanding of present day user interfaces as younger generations have. It is also widely acknowledged that older people are poorly represented in the development process of mainstream technology. In this paper, we critically examine how 'Forum Theatre' can be used as a requirements gathering methodology in the development of a novel digital television (DTV) based communication system. We demonstrate how live theatre established a 'common ground' between audience participants and actors in the facilitation of new ideas, and discuss how live theatre can be used to stimulate interest and understanding from designers and relevant professionals in the development of an unfamiliar and largely undefined technology for older adults.
A Monte Carlo comparison of estimators for a bivariate probit model with selection
Authors: R. Belkar, D. G. Fiebig
Venue: Mathematics and Computers in Simulation (2008)

A Monte Carlo experiment is undertaken to examine the small sample properties of three alternative estimators of a bivariate probit model with selection. The three estimators are the censored probit estimator, single-equation probit applied to the selected sub-sample and single-equation probit applied to the full sample. These estimators are compared in terms of properties of coefficient estimates and predicted probabilities. While no estimator dominates in all possible situations a clear recommendation follows from an overall evaluation of the relative performance of the three estimators. Ignoring the selection problem through use of a single-equation probit can often lead to very poor estimator and predictor performance. Both single-equation probit estimators have properties that can vary dramatically over the different design points. The properties of censored probit vary much less than the two single-equation estimators and this robustness characteristic tends to favour its use.