ppxscal/embedding_network huggingface dataset:
A concurrent distributed deadlock detection/resolution algorithm for distributed systems
Authors: Cheng Xin, Yang Xiaozong
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

Numerous deadlock detection algorithms were proposed for distributed systems, but most of them assumed the static wait-for graph (WFG), which is inconsistent with the dynamic application environment of distributed systems, in fact they can not run concurrently. A novel instance of diffusion-computation algorithms is proposed in this paper to resolve the concurrency problem. In our algorithm, a Dynamic WFG (DWFG) is raised, where the blocked transactions creating or quitting is responded to the nodes joining or disappearing in DWFG. Three additional detection termination conditions are assigned for the concurrent running of the proposed algorithm: the being detected node is a leaf or quitted, or fault occurs in the system. By these methods the concurrent running detections can terminate eventually and the deadlock can be resolved correctly. The correctness of the proposed algorithm is proven. Performance evaluation shows the time and message complexity of our algorithm outperforms the existing algorithms under a static WFG.
Relationships between Structures of Hydroxyflavone Derivatives and their Anti-oxidative Activities
Authors: Younghee Park, Sunhee Lee, Yoongho Lim
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Primuletin, chrysin, and luteolin belong to hydroxyflavones. Although they have small differences in their hydroxyl groups, these make big differences in their biological activities. In order to elucidate relationships between structures of hydroxyflavones and their biological activities, we tested anti-oxidative effects of 20 hydroxyflavone derivatives belonged to flavonoids, which are well-known to possess antioxidative effects. 1,1-Diphenyl-2-picryl-hydrazyl (DPPH) radical scavenging assay, one of experiments to screen anti-oxidative effects, was performed for biological activities of hydroxyflavone derivatives. Twenty commercially available hydroxyflavones were tested for their anti-oxidative effects. For structure-activity relationship calculations, comparative molecular field analysis (CoMPA) was carried out. Based on the CoMPA contour maps, electronegative substituents are favorable for high DPPH radical scavenging effect. It is well agreed with the results obtained from the CoMPA contour maps where electronegative substituents are favorable because ortho positioned hydroxyl groups can cause larger electronegativity than separated hydroxyl groups. For high DPPH radical scavenging effect, hydroxyflavones should contain ortho positioned hydroxyl groups in their structures.
Solution of a system of linear equations with fuzzy numbers
Authors: Rostislav Horčík
Venue: Fuzzy Sets and Systems (2008)

In this paper, the interval nature of fuzzy numbers is revealed by showing that many interesting results from classical interval analysis transfer also into the fuzzy case. The paper deals with a solution of a fuzzy interval system of linear equations, i.e., a system in which fuzzy intervals (numbers) appear instead of crisp numbers.
On Resource Allocation in Architectural Models
Authors: Dionisio de Niz, Peter H. Feiler
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Resource allocation decisions are critical for the design of embedded real-time systems. Today’s trend to software integration makes these decisions tightly coupled to the software architecture. In this paper we discuss the use of architectural models to guide and maintain the integrity of the resource allocation decision at different levels of refinement of the system design. We discuss the budgeting process to split the development process into different teams, the use of bin packing techniques for low level resource allocation and the isolation strategies to separate the different criticality levels of these systems.
Notes on searching in multidimensional monotone arrays
Authors: A. Aggarwal
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

A two-dimensional array A=(a/sub i,j/) is called monotone if the maximum entry in its ith row lies below or to the right of the maximum entry in its (i- 1)-st row. An array A is called totally monotone if every 2*2 subarray (i.e., every 2*2 minor) is monotone. The notion of two-dimensional totally monotone arrays is generalized to multidimensional arrays, and a wide variety of problems are exhibited involving computational geometry, dynamic programming, VLSI river routing, and finding certain kinds of shortest paths that can be solved efficiently by finding maxima in totally monotone arrays.
Buckling analysis of a composite shell with multiple delaminations based on a higher order zig-zag theory
Authors: Jinho Oh, Maenghyo Cho, Jun-Sik Kim
Venue: Finite Elements in Analysis and Design (2008)

A new three-node triangular shell element based on a higher order zig-zag theory is developed for laminated composite shells with multiple delaminations. The baseline higher order zig-zag composite shell theory for multiple delaminations has been developed in a general curvilinear coordinate system and in general tensor notation. All the complicated curvatures of the surface including twisting curvatures can be described in an exact manner since the developed shell finite element is based on the geometrically exact surface representation. It is therefore possible to apply the present finite element formulation to the composite structures with arbitrary shaped multiple delaminations, general layup configurations and arbitrary boundary conditions. The slopes of deflections are included as independent degrees of freedom, which require the normal slope continuities between element interfaces. The nonconforming shape functions of Specht's three-node triangular plate bending element are employed to interpolate out-of-plane displacements. The developed element passes the bending and twisting patch tests for flat surface configurations. The element is then used to analyze the linear buckling problem of composite cylindrical shells with multiple delaminations. Throughout the numerical examples, it is demonstrated that the developed shell finite element is numerically efficient because it has minimal nodal degrees of freedom to describe the composite shells having multiple delaminations. The finite element realization of a higher order zig-zag shell theory with multiple delaminations can be served as a powerful numerical tool to analyze the complicated shell structures for the critical buckling loads as well as the corresponding mode shapes.
Oriented spontaneously formed nano-structures on poly(dimethylsiloxane) films and stamps treated in O2 plasmas
Authors: Katerina Tsougeni, George Boulousis, Evangelos Gogolides, Angeliki Tserepi
Venue: Microelectronic Engineering (2008)

A plasma-based methodology to fabricate oriented, spontaneously formed nano-structures on poly(dimethylsiloxane) PDMS films and stamps is described. Oxygen plasma treatment of PDMS produces spontaneously-formed wavy structures with high nano-scale amplitude and with periodicity of a few 100'snm as revealed by atomic force microscopy (AFM). We present two plasma-based methods for the fabrication of such oriented nano-structures on PDMS films and stamps, and discuss the effect of pattern dimension on periodicity. This simple oxygen plasma treatment to orient spontaneously formed nano-structures, with wavelength in the sub-micrometer range, may be used to print, for example, fine patterns of biologically active molecules onto surfaces with high spatial frequency.
Real-time automatic tag recommendation
Authors: Yang Song, Ziming Zhuang, Huajing Li, Qiankun Zhao, Jia Li, Wang-Chien Lee, C. Lee Giles
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Tags are user-generated labels for entities. Existing research on tag recommendation either focuses on improving its accuracy or on automating the process, while ignoring the efficiency issue. We propose a highly-automated novel framework for real-time tag recommendation. The tagged training documents are treated as triplets of (words, docs, tags), and represented in two bipartite graphs, which are partitioned into clusters by Spectral Recursive Embedding (SRE). Tags in each topical cluster are ranked by our novel ranking algorithm. A two-way Poisson Mixture Model (PMM) is proposed to model the document distribution into mixture components within each cluster and aggregate words into word clusters simultaneously. A new document is classified by the mixture model based on its posterior probabilities so that tags are recommended according to their ranks. Experiments on large-scale tagging datasets of scientific documents (CiteULike) and web pages del.icio.us) indicate that our framework is capable of making tag recommendation efficiently and effectively. The average tagging time for testing a document is around 1 second, with over 88% test documents correctly labeled with the top nine tags we suggested.
The many faces of optimism: a unifying approach
Authors: István Szita, András Lőrincz
Venue: Proceedings of the 25th international conference on Machine learning (2008)

The exploration-exploitation dilemma has been an intriguing and unsolved problem within the framework of reinforcement learning. "Optimism in the face of uncertainty" and model building play central roles in advanced exploration methods. Here, we integrate several concepts and obtain a fast and simple algorithm. We show that the proposed algorithm finds a near-optimal policy in polynomial time, and give experimental evidence that it is robust and efficient compared to its ascendants.
Theoretical study about the RBSOA of a monolithic ESBT® (emitter-switched bipolar transistor) versus the saturation level before the switching-off
Authors: V. Enea, D. Kroell, M. Messina, C. Ronsisvalle
Venue: Microelectronics Journal (2008)

One of the main strength points of the new power actuator emitter-switched bipolar transistor (ESBT^(R)) is its excellent safe operating area: as a matter of fact the emitter-switching concept enables the driving of the bipolar transistor in a much safer way compared to the traditional base-switching one. Nevertheless, at very high current density, well above the working ones, its ruggedness decreases a little when the saturation level, just before the turn-off, is extremely low or extremely high. This paper explains that in these conditions the device switches off not exactly in emitter-switching conditions or it is not properly sized.
Surveillance and Quality Evaluation System for Real-Time Audio Signal Streaming
Authors: Jiri Schimmel, Jiri Prinosil, Jiri Misurec
Venue: Proceedings of the Seventh International Conference on Networking (2008)

This paper deals with the design of an algorithm and application for an automatic system of real-time audio signal quality surveillance on personal computers. This system works without any knowledge of how the audio signal is processed. The audio signal quality and possible signal failures are monitored by being compared with the original signal in the time-frequency domain. The system supports several audio formats from mono to 5.1 and downmix for comparison between different audio formats. For high performance, SIMD technologies are used. The whole system consists of several local surveillance applications (clients) and a server application with SNMP client that monitors the local application states using the TCP/IP network.
A Hybrid Approach for Modeling and Assessing Performance of Embedded Systems in a Biologically Critical Application
Authors: Claudio Talarico, David Freiberger, Tyler Jones, Brandon Hopkins, Charlie Herr, Min-sung Koh, Esteban Rodriguez-Marek
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

This paper presents a hybrid approach for modeling and assessing the performance of embedded systems. Toward this objective, we pursue an implementation independent methodology where system behavior is represented by executable models that are based on both analytical and simulation methods. To illustrate and validate our approach we apply it to the design of a robotic system for the artificial insemination of endangered species. The solution adopted reduces assessment time by modeling system behavior only in terms of the performance metrics of interest. The two performance metrics used to assess the application considered are the velocity of the robotic arm tied to the sperm membrane and the force with which the arm hits the target (i.e., the egg’s membrane). Formally, the desired behavior is captured through a C/C++ executable model, which uses finite state machines (FSM) as the underlying model of computation (MOC). The results obtained demonstrate the robustness of the proposed method both in terms of design time and accuracy.
Advanced Collage CAPTCHA
Authors: Mohammad Shirali-Shahreza, Sajad Shirali-Shahreza
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Some Internet websites for providing services to their customers, ask them to register in the website. Unfortunately hackers write programs to make automatic false enrollments which waste the website’s resources. To solve this problem, systems known as CAPTCHA (Completely Automated Public Turing test to tell Computers and Humans Apart) have been introduced to distinguish between human user and computer program. One of the CAPTCHA methods is Collage CAPTCHA. In this method some shapes are shown with distortion and the user is asked to choose a specific object. In this paper we increase the resistance of this method to attacks. For this purpose, we also show some other objects on the right of the screen. Some of these objects are same as the previous objects, but have the different shapes. Now we ask the user to choose a specific object and also its same object on the right of the screen. The user will be passed the test if he chooses the two similar objects correctly.In this method because the computer program should also recognize the similar object, the possibility of passing the test by computer is more reduced.
Rapid application specific floating-point unit generation with bit-alignment
Authors: Yee Jern Chong, Sri Parameswaran
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

While ASIPs have allowed designers to create processors with custom instructions to target specific applications, floatingpoint units are still instantiated as fixed general-purpose units, which wastes area if not fully utilized. Therefore, there is a need for custom FPUs for embedded systems. The creation of a custom FPU requires the selection of a subset of the full floating-point instruction set and the implementation of this subset in hardware, such that the runtime of the application is minimized. To minimize area, it is desirable to merge the datapaths for each of the floating-point operations, so that redundant hardware is minimized. Floating-point datapaths are complex and contain components with varying bit-widths, so sharing components of different bit-widths is necessary. However, this introduces the problem of bit-alignment, which involves determining how smaller resources should be aligned within larger resources when merged. This is a problem that has been largely neglected in previous work. Thus, this paper presents a novel algorithm for solving the bit-alignment problem, which neatly integrates into the datapath merging process. By solving this bit-alignment problem, automatic datapath merging can be made available for FPU generation. To explore the trade-offs between area and performance, a rapid design space exploration was performed to determine which FP operations should be implemented in hardware rather than emulated. Our results show that more floating-point hardware does not necessarily equate to lower run-time if the additional hardware increases delay. We found that bit-alignment reduced area by an average of 22.5% in our benchmarks, compared to an average of 14.1% without bit-alignment.
Mathematical symbol recognition with support vector machines
Authors: Christopher Malon, Seiichi Uchida, Masakazu Suzuki
Venue: Pattern Recognition Letters (2008)

Single-character recognition of mathematical symbols poses challenges from its two-dimensional pattern, the variety of similar symbols that must be recognized distinctly, the imbalance and paucity of training data available, and the impossibility of final verification through spell check. We investigate the use of support vector machines to improve the classification of InftyReader, a free system for the OCR of mathematical documents. First, we compare the performance of SVM kernels and feature definitions on pairs of letters that InftyReader usually confuses. Second, we describe a successful approach to multi-class classification with SVM, utilizing the ranking of alternatives within InftyReader's confusion clusters. The inclusion of our technique in InftyReader reduces its misrecognition rate by 41%.
Designing a sketch recognition front-end: user perception of interface elements
Authors: Paul Wais, Aaron Wolin, Christine Alvarado
Venue: Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling (2007)

Programs that can recognize students' hand-drawn diagrams have the potential to revolutionize education by breaking down the barriers between diagram creation and simulation. Much recent work focuses on building robust recognition engines, but understanding how to support this new interaction paradigm from a user's perspective is an equally important and less well understood problem. We present a user study that investigates four critical sketch recognition user interface issues: how users integrate the process of triggering recognition into their work, when users prefer to indicate which portions of the diagram should be recognized, how users prefer to receive recognition feedback, and how users perceive recognition errors. We find that user preferences emphasize the importance of system reliability, the minimization of distractions, and the maximization of predictability.
Abduction for Accessing Information Sources
Authors: Carlo Meghini, Yannis Tzitzikas, Nicolas Spyratos
Venue: Fundamenta Informaticae (2008)

We consider a general form of information sources, consisting of a set of objects classified by terms arranged in a taxonomy. The query-based access to the information stored in sources of this kind, is plagued with uncertainty, due, among other things, to the possible linguisticmismatch between the user and the object classification. To overcome this uncertainty in all situations in which the user is not finding the desired information and is not willing or able to state a new query, the study proposes to extend the classification, in a way that is as reasonable as possible with respect to the original one. By equating reasonableness with logical implication, the sought extension turns out to be an explanation of the classification, captured by abduction. The problem of query evaluation on information sources extended in this way is studied and a polynomial time algorithm is provided for the general case, in which no hypothesis is made on the structure of the taxonomy. The algorithm is successively specialized on a most common kind of information sources, namely sources whose taxonomy can be represented as a directed acyclic graph. It is shown that query evaluation on extended sources is easier for this kind of sources. Finally, two applications of the method are presented, which capture very important aspects of information access: information browsing and query result ranking.
A domain specific embedded language in C++ for automatic differentiation, projection, integration and variational formulations
Authors: Christophe Prud'homme
Venue: Scientific Programming (2006)

In this article, we present a domain specific embedded language in C++ that can be used in various contexts such as numerical projection onto a functional space, numerical integration, variational formulations and automatic differentiation. Albeit these tools operate in different ways, the language overcomes this difficulty by decoupling expression constructions from evaluation. The language is implemented using expression templates and meta-programming techniques and uses various Boost libraries. The language is exercised on a number of non-trivial examples and a benchmark presents the performance behavior on a few test problems.
A convergence rate theorem for finite difference approximations to delta functions
Authors: John D. Towers
Venue: Journal of Computational Physics (2008)

We prove a rate of convergence theorem for approximations to certain integrals over codimension one manifolds in R^n. The type of manifold involved here is defined by the zero level set of a smooth mapping u:R^n@?R. Our approximations are based on the two finite difference methods for discretizing delta functions presented in [16]. We included a convergence proof in that paper, but only proved rates of convergence in some greatly simplified situations. Numerical experiments indicated that our two methods were at least first and second order accurate, respectively. In this note we prove those empirical convergence rates for the two algorithms under fairly general hypotheses.
Cyber Science Infrastructure (CSI) for Promoting Research Activities of Academia and Industries in Japan
Authors: Shigeki Yamada
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

The National Institute of Informatics (NII) is promoting the construction of the Cyber Science Infrastructure (CSI) through cooperation and other organizations, in order to promote Japan’s academic and research educational activities and to further strengthen international competitiveness.This talk presents the NII’s strategic efforts to the following four areas, as expanding the various development projects and operations it has implemented to date within the framework of the CSI.
Lifelog Image Analysis Based on Activity Situation Models Using Contexts from Wearable Multi Sensors
Authors: Katsuhiro Takata, Jianhua Ma, Bernady O. Apduhan, Runhe Huang, Norio Shiratori
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Lifelog is a set of continuously captured data records of our daily activities. The lifelog in this study includes several types of media data/information acquired from wearable multi sensors which capture video images, individual’s body motions, biological information, location information, and so on. We propose an integrated technique to process the lifelog which is composed of both captured video (called lifelog images) and other sensed data. Our proposed technique is based on two models; i.e., the space-oriented model and the action-oriented model. By using the two modeling techniques, we can analyze the lifelog images to find representative images in video scenes using both the pictorial visual features and the individual’s context information, and likewise represent the individual’s life experiences in some semantic and structured ways for future efficient retrievals and exploitations. The resulting structured lifelog images were evaluated using the vision-based only approach and the proposed technique. Our proposed integrated technique exhibited better results.