ppxscal/embedding_network huggingface dataset:
J-Orchestra: Enhancing Java programs with distribution capabilities
Authors: Eli Tilevich, Yannis Smaragdakis
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2009)

J-Orchestra is a system that enhances centralized Java programs with distribution capabilities. Operating at the bytecode level, J-Orchestra transforms a centralized Java program (i.e., running on a single Java Virtual Machine (JVM)) into a distributed one (i.e., running across multiple JVMs). This transformation effectively separates distribution concerns from the core functionality of a program. J-Orchestra follows a semiautomatic transformation process. Through a GUI, the user selects program elements (at class granularity) and assigns them to network locations. Based on the user's input, the J-Orchestra backend automatically partitions the program through compiler-level techniques, without changes to the JVM or to the Java Runtime Environment (JRE) classes. By means of bytecode engineering and code generation, J-Orchestra substitutes method calls with remote method calls, direct object references with proxy references, etc. It also translates Java language features (e.g., static methods and fields, inheritance, inner classes, new object construction, etc.) for efficient distributed execution. We detail the main technical issues that J-Orchestra addresses, including its mechanism for program transformation in the presence of unmodifiable code (e.g., in JRE classes) and the translation of concurrency and synchronization constructs to work correctly over the network. We further discuss a case study of transforming a large, commercial, third-party application for efficient execution in a client server environment and outline the architectural characteristics of centralized programs that are amenable to automated distribution with J-Orchestra.
Proceedings of the Singaporeanfrench Ipal Symposium 2009: Sinfra09
Authors: Wee-Kheng Leow, Feng Ding, Hao Li
Venue:  (2009)

This Singaporean-French Symposium aims to strengthen existing research collaboration between French and Singapore scientists, and to explore and develop new collaborations in IPAL (Image Perception, Access & Language) - the Singaporean-French international research lab created between the French National Research Center (CNRS), the National University of Singapore (NUS), the Institute for Infocomm Research (I2 R-A*STAR) and the Joseph Fourier University (UJF). SinFra'09 welcomes researchers and collaborators under IPAL organizations and those who wish to collaborate with IPAL. The symposium proposes Tutorials and Scientific Sessions in relevant Singaporean - French common interest fields, related to the present and possible future activities in IPAL. We seek submissions of high-quality, original work in the following areas: existing IPAL areas like Medical Image Analysis and Access, Mobile Information Access, and also new areas of collaboration between French and Singaporean scientists, such as interactive digital media, cognitive vision and audio, video surveillance and security, real-time/embedded systems, media and sensors networks, programming languages, language-based security and quantum informatics.
Emergence of language: hidden states and local environments
Authors: Jaak Henno
Venue: Proceeding of the 2008 conference on Information Modelling and Knowledge Bases XIX (2008)

Here is considered emergence of language in an environment, where agents communicate about issues which are not observable at the moment of communication, e.g. they search food and exits in a labyrinth and communication helps them to achieve their goals (food, exits). In such a situation message's receiver can not observe message's object at the moment when message is received. It is shown, that these non-observable objects can be mapped to observable objects using local environments. Agents do not build representations of the external word, instead of reasoning on representations of the world they access the world directly through perceptions and actions and their perceptions influence their behaviour. Messages from other agents, i.e. emerging language also change their behaviour and increases effectiveness of the whole population. Language is described via two mappings: syntax (i.e. syntactic objects, words) is interpreted in semantics by the meaning mapping; the speech mapping creates for semantic objects their syntactic denotations. Words in agents language gradually become mediated semantic objects, i.e. obtain the same significance (trigger the same actions) as the actual real-word situations which they denote.
Development of a data warehouse for Lymphoma cancer diagnosis and treatment decision support
Authors: Teh Ying Wah, Ong Suan Sim
Venue: WSEAS Transactions on Information Science and Applications (2009)

Data warehousing is becoming an indispensable component in data mining process and business intelligence. Data warehouses often act as a data collector, data integrator and data provider in the data mining process. This paper reviews the development and use of a clinical data warehouse specific to the Lymphoma or Lymph Node cancer, which could be used by doctors, physicians and other health professionals, in conjunction with a Clinical Decision Support System (DSS), to support the clinical process as well as to formulate the appropriate model to improve the quality of diagnosis and treatment recommendation decision making. This paper proposes a 5-stage sequential methodology for the clinical data warehouse development. Research on the evaluation of the developed data warehouse and how it would support the data mining process will be discussed in a separate paper.
Color Transfer in Images Based on Separation of Chromatic and Achromatic Colors
Authors: Jae Hyup Kim, Do Kyung Shin, Young Shik Moon
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

In this paper, we propose the method which transfers the color style of a source image into an arbitrary given reference image. Misidentification problem of color cause wrong indexing in low saturation. Therefore, the proposed method does indexing after image separating chromatic and achromatic color from saturation. The proposed method is composed of the following four steps. In the first step, using threshold, pixels in image are separated chromatic and achromatic color components from saturation. In the second step, separated pixels are indexed using cylindrical metric. In the third step, the number and positional dispersion of pixel decide the order of priority for each index color. And average and standard deviation of each index color be calculated. In the final step, color be transferred in Lab color space, and post processing to removal noise and pseudo-contour. Experimental results show that the proposed method is effective on indexing and color transfer.
Algorithm, software, and hardware optimizations for Delaunay mesh generation on simultaneous multithreaded architectures
Authors: Christos D. Antonopoulos, Filip Blagojevic, Andrey N. Chernikov, Nikos P. Chrisochoides, Dimitrios S. Nikolopoulos
Venue: Journal of Parallel and Distributed Computing (2009)

This article focuses on the optimization of PCDM, a parallel, two-dimensional (2D) Delaunay mesh generation application, and its interaction with parallel architectures based on simultaneous multithreading (SMT) processors. We first present the step-by-step effect of a series of optimizations on performance. These optimizations improve the performance of PCDM by up to a factor of six. They target issues that very often limit the performance of scientific computing codes. We then evaluate the interaction of PCDM with a real SMT-based SMP system, using both high-level metrics, such as execution time, and low-level information from hardware performance counters.
Balanced Introduction to Computer Science, 2nd edition
Authors: David Reed
Venue:  (2007)

For Introduction to Computing and the Web courses in departments of Math and Computer Science. This thoughtfully written text uses the Internet as a central theme, studying its history, technology, and current use. Experimental problems use Web-based tools, enabling students to learn programming fundamentals by developing their own interactive Web pages with HTML and JavaScript. Integrating breadth-based and depth-based chapters, Reed covers a broad range of topics balanced with programming depth in a hands-on, tutorial style. Supplements Include: *Power Point Lecture Slides*Figures*Labs*Solutions Bridge Page: www.prenhall.com/reed Author Website: www.dave-reed.com/book
Conclusions from the introduction of a nanoelectronics course in the studies curriculum of the technological educational institution of Athens
Authors: D. Triantis, C. Anastasiadis
Venue: Proceedings of the 1st WSEAS international conference on Nanotechnology (2009)

The problem of implementation of new courses and material in new curricula within the existing is one that preoccupies the academic communities. This work presents our engrossment and the first conclusions cropped from the introduction of a Nanoelectronics course in the Studies Curriculum of the Department of Electronics of the Technological Educational Institution of Athens in 2008 for the first time. The introduction of this course attracted the students' interest, as is described by the results of the enquiry that took place with the use of suitable questionnaire. On the other hand, the increased students' interest urged them to approach instruction methods outside the classroom reaching even postgraduate studies related to Nanoelectronics and Nanotechnology at large.
More on the Size of Higman-Haines Sets: Effective Constructions
Authors: Hermann Gruber, Markus Holzer, Martin Kutrib
Venue: Fundamenta Informaticae (2009)

A not so well-known result in formal language theory is that the Higman-Haines sets for any language are regular [11, Theorem 4.4]. It is easily seen that these sets cannot be effectively computed in general. The Higman-Haines sets are the languages of all scattered subwords of a given language as well as the sets of all words that contain some word of a given language as a scattered subword. Recently, the exact level of unsolvability of Higman-Haines sets was studied in [8]. Here we focus on language families whose Higman-Haines sets are effectively constructible. In particular, we study the size of descriptions of Higman-Haines sets for the lower classes of the Chomsky hierarchy, namely for the family of regular, linear context-free, and context-free languages. We prove upper and lower bounds on the size of descriptions of these sets for general and unary languages.
Model driven development of context aware software systems
Authors: Andrea Sindico, Vincenzo Grassi
Venue: International Workshop on Context-Oriented Programming (2009)

This paper presents the first results of an ongoing work towards the realization of a model driven development framework for context awareness. Its core element consists of a domain specific modeling language called CAMEL (Context Awareness ModEling Language), and defined as a UML extension. CAMEL can be used to enrich a UML model of an application with elements related to contexts and context dependent behaviors. The resulting UML+CAMEL model is the starting point for model transformation aimed at generating executable code or other artifacts. CAMEL is implemented by an Eclipse plugin.
Keynote lecture 1: four open mathematical problems related to computer graphics and geometric modeling
Authors: Ron Goldman
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

Four unsolved problems that originate from research in Computer Graphics and Geometric Modeling will be presented. The first problem involves understanding the notion oscillation for Bezier surfaces, the freeform polynomial surfaces most common in Computer Graphics and Geometric Modeling. The second problem concerns generating smooth (C2) surfaces via subdivision from triangular or quadrilateral meshes of arbitrary topology. The third problem is related to Bezier curves and univariate Bernstein polynomials, and concerns the combinatorics of symmetrizing multiaffine functions. The fourth and final problem pertains to fractals and asks if there is an algorithm to determine whether two arbitrary sets of contractive affine transformations generate the same fractal.
Characterization of a novel nine-transistor SRAM cell
Authors: Zhiyu Liu, Volkan Kursun
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Data stability of SRAM cells has become an important issue with the scaling of CMOS technology. Memory banks are also important sources of leakage since the majority of transistors are utilized for on-chip caches in today's high performance microprocessors. A new nine-transistor (9T) SRAM cell is proposed in this paper for simultaneously reducing leakage power and enhancing data stability. The proposed 9T SRAM cell completely isolates the data from the bit lines during a read operation. The read static-noise-margin of the proposed circuit is thereby enhanced by 2 × as compared to a conventional six-transistor (6T) SRAM cell. The idle 9T SRAM cells are placed into a super cutoff sleep mode, thereby reducing the leakage power consumption by 22.9% as compared to the standard 6T SRAM cells in a 65-nm CMOS technology. The leakage power reduction and read stability enhancement provided with the new circuit technique are also verified under process parameter variations.
An Intelligent Process Monitoring System in Complex Manufacturing Environment
Authors: Sung Ho Ha, Boo Sik Kang
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

In high-tech industries, most manufacturing processes are complexly intertwined, in that manufacturers or engineers can hardly control a whole set of processes. They are only capable of looking after each individual process. They have difficulty in verifying the cause of process abnormalities from isolating special cause variability within a number of common causes, and in predicting future processes. In this paper, we present an intelligent process monitoring and prediction system (IPMS) for the semiconductor industry that has complex and dynamic manufacturing characteristics. The system is based on artificial neural networks, and is used to monitor and control a whole set of processes over a period of time. The IPMS consists of three major functions: Feature extraction, process pattern analysis, and process stability evaluation and prediction. The system has strong applicative advantages in manufacturing situations whereby control of a variety of quality variables is interrelated.
Anisotropic Regularization for Inverse Problems with Application to the Wiener Filter with Gaussian and Impulse Noise
Authors: Micha Feigin, Nir Sochen
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

Most inverse problems require a regularization term on the data. The classic approach for the variational formulation is to use the L 2 norm on the data gradient as a penalty term. This however acts as a low pass filter and thus is not good at preserving edges in the reconstructed data.In this paper we propose a novel approach whereby an anisotropic regularization is used to preserve object edges. This is achieved by calculating the data gradient over a Riemannian manifold instead of the standard Euclidean space using the Laplace-Beltrami approach. We also employ a modified fidelity term to handle impulse noise.This approach is applicable to both scalar and vector valued images. The result is demonstrate via the Wiener filter with several approaches for minimizing the functional including a novel GSVD based spectral approach applicable to functionals containing gradient based features.
State machines are child's play: observing children ages 9 to 11 playing Escape Machine
Authors: Michael Philetus Weller, Ellen Yi-Luen Do, Mark D. Gross
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

We developed Escape Machine, a puzzle game in which children control the behavior of characters in a maze by manipulating a tangible state machine built with Posey, our computationally-enhanced hub-and-strut construction kit. We observed children ages nine to eleven playing the game in several sessions. The qualitative results of this observation validate the promise of Posey and Escape Machine to engage children in manipulating algorithmic specifications for behavior.
Adaptive Support of Inter-Domain Collaborative Protocols using Web Services and Software Agents
Authors: Adomas Svirskas, Michael Wilson, Bob Roberts, Ioannis Ignatiadis
Venue: Proceeding of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS'2006 (2007)

This paper explores the challenges of constructing an architecture for inter-organisational collaborative interactions based on Service Oriented Architecture (SOA), Web services choreographies and software agents. We present an approach to harmonisation of the “global” or neutral definition of business collaborations, with partner-specific implementations, which can differ in terms of platform, environment, implementation technology, etc. By introducing the concept of pluggable business service handlers into our architecture we draw on the work carried out by ebXML initiative, business services interfaces, in particular. Due to increasing need for better management of collaborative interactions, Virtual Organisations (VO) become an important tool for creation and maintenance of federated trust domains among the collaboration partners. We look into the software agents abilities to serve as the background support mechanism for the automation and management of the Virtual Organisations lifecycle.
Set-valued ordered information systems
Authors: Yuhua Qian, Chuangyin Dang, Jiye Liang, Dawei Tang
Venue: Information Sciences: an International Journal (2009)

Set-valued ordered information systems can be classified into two categories: disjunctive and conjunctive systems. Through introducing two new dominance relations to set-valued information systems, we first introduce the conjunctive/disjunctive set-valued ordered information systems, and develop an approach to queuing problems for objects in presence of multiple attributes and criteria. Then, we present a dominance-based rough set approach for these two types of set-valued ordered information systems, which is mainly based on substitution of the indiscernibility relation by a dominance relation. Through the lower/upper approximation of a decision, some certain/possible decision rules from a so-called set-valued ordered decision table can be extracted. Finally, we present attribute reduction (also called criteria reduction in ordered information systems) approaches to these two types of ordered information systems and ordered decision tables, which can be used to simplify a set-valued ordered information system and find decision rules directly from a set-valued ordered decision table. These criteria reduction approaches can eliminate those criteria that are not essential from the viewpoint of the ordering of objects or decision rules.
On the role of autonomics in emerging grid ecosystems
Authors: Manish Parashar
Venue: Proceedings of the 6th international conference industry session on Grids meets autonomic computing (2009)

Significant strategic investments are quickly realizing a pervasive computational infrastructure that integrates computers, networks, data archives, instruments, observatories, and embedded sensors and actuators. This in turn has the potential for enabling new paradigms and practices in computational science and engineering those that symbiotically and opportunistically combine computations, experiments, observations, and real-time information. However the ability of scientists to realize this potential is being severely hampered primarily due to the increased complexity and dynamism of the applications and the computing infrastructure. Autonomic computing has the potential to fundamentally address these challenges. In this talk, I will motivate autonomics for computational science and engineering. I will then describe research efforts at TASSL, Rutgers University as part of the NSF Center for Autonomic Computing aimed at enabling autonomic scientific and engineering applications that can address the challenges of (and benefit from) pervasive computational ecosystems.
Effective I/O scheme based on RTP for multimedia communication systems
Authors: Nam-Sup Park, Chong-Sun Hwang
Venue: Journal of Computer Science and Technology (2006)

The prime standard for audio/video transport in IP networks is the Real-time Transport Protocol (RTP), and it is targeted at useful services for the transport of real-time multimedia data. RTP was originally designed for use in multicast conferences, using the lightweight sessions model. RTP (in particular, the data part) is so tightly coupled to the application that a number of people have developed libraries that implement RTP. However, little is known about the RTP overheads between user area and kernel area within operating system. Actually, unnecessary copying between user area and kernel area lowers the system efficiency. In this paper, we present the design and implementation of Enhanced Multimedia Input/Output Scheme based on LINUX. We brought focus to the crossover architecture supporting RTP. Our contributions are able to be summarized into two components: 1) Enhanced Input/Output (EIO) scheme based on LINUX improves tile transmission speed by reducing the overheads generated from data copy and context switch between user area and kernel area. And this enables server-based system to transport multimedia data more efficiently. 2) Furthermore, Enhanced Input/Output scheme with RTP (EIORTP) scheme supports efficient multimedia data transmission architecture. The two schemes improve the performance of massive multimedia data transmission.
Note: Matchings and independent sets of a fixed size in regular graphs
Authors: Teena Carroll, David Galvin, Prasad Tetali
Venue: Journal of Combinatorial Theory Series A (2009)

We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size @? in a d-regular graph on N vertices. For 2@?N bounded away from 0 and 1, the logarithm of the bound we obtain agrees in its leading term with the logarithm of the number of matchings of size @? in the graph consisting of N2d disjoint copies of K"d","d. This provides asymptotic evidence for a conjecture of S. Friedland et al. We also obtain an analogous result for independent sets of a fixed size in regular graphs, giving asymptotic evidence for a conjecture of J. Kahn. Our bounds on the number of matchings and independent sets of a fixed size are derived from bounds on the partition function (or generating polynomial) for matchings and independent sets.
3D modeling in a web browser to formulate content-based 3D queries
Authors: René Berndt, Sven Havemann, Dieter Fellner
Venue: Proceedings of the 14th International Conference on 3D Web Technology (2009)

We present a framework for formulating domain-dependent 3D search queries suitable for content-based 3D search over the web. Users are typically not willing to spend much time to create a 3D query object. They expect to quickly see a result set in which they can navigate by further differentiating the query object. Our system innovates by using a streamlined parametric 3D modeling engine on both client and server side. Parametric tools have greater expressiveness, they allow shape manipulation through a few high-level parameters, as well as incremental assembly of query objects. Short command strings are sent from client to server to keep the query objects on both sides in sync. This reduces turnaround times and allows asynchronous updates of live result sets.