ppxscal/embedding_network huggingface dataset:
XMem: type-safe, transparent, shared memory for cross-runtime communication and coordination
Authors: Michal Wegiel, Chandra Krintz
Venue: Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation (2008)

Developers commonly build contemporary enterprise applications using type-safe, component-based platforms, such as J2EE, and architect them to comprise multiple tiers, such as a web container, application server, and database engine. Administrators increasingly execute each tier in its own managed runtime environment (MRE) to improve reliability and to manage system complexity through the fault containment and modularity offered by isolated MRE instances. Such isolation, however, necessitates expensive cross-tier communication based on protocols such as object serialization and remote procedure calls. Administrators commonly co-locate communicating MREs on a single host to reduce communication overhead and to better exploit increasing numbers of available processing cores. However, state-of-the-art MREs offer no support for more efficient communication between co-located MREs, while fast inter-process communication mechanisms, such as shared memory, are widely available as a standard operating system service on most modern platforms. To address this growing need, we present the design and implementation of XMem ? type-safe, transparent, shared memory support for co-located MREs. XMem guarantees type-safety through coordinated, parallel, multi-process class loading and garbage collection. To avoid introducing any level of indirection, XMem manipulates virtual memory mapping. In addition, object sharing in XMem is fully transparent: shared objects are identical to local objects in terms of field access, synchronization, garbage collection, and method invocation, with the only difference being that sharedto-private pointers are disallowed. XMem facilitates easy integration and use by existing communication technologies and software systems, such as RMI, JNDI, JDBC, serialization/XML, and network sockets. We have implemented XMem in the open-source, productionquality HotSpot Java Virtual Machine. Our experimental evaluation, based on core communication technologies underlying J2EE, as well as using open-source server applications, indicates that XMem significantly improves throughput and response time by avoiding the overheads imposed by object serialization and network communication.
Genetic neural networks for modeling dipole antennas
Authors: Petr Šmíd, Zbynek Raida, Zbynek Lukeš
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

The paper deals with original genetic neural networks for modeling wire dipole antennas. A novel approach to learning artificial neural networks (ANN) by genetic algorithms (GA) is described. The goal is to compare the learning abilities of neural antenna models trained by the GA and models trained by gradient algorithms. Developing the original design method based on genetic models of designed electromagnetic structures is the motivation of this work. Two types of ANN, the recurrent Elman ANN and the feed-forward one, are implemented in MATLAB. Results of training abilities are discussed.
Development of multiple robotic fish cooperation platform
Authors: Jinyan Shao, Long Wang, Junzhi Yu
Venue: International Journal of Systems Science (2007)

This article presents the development of a multiple robotic fish cooperation platform, which is established by employing a group of radio-controlled, multi-link fish-like robots. This work is inspired by the observation from nature that the capability of one single fish is limited, as in order to survive the atrocious circumstances in the sea, fish often swim in schools. The analogical situations occur in the robotic fish case. In engineering applications, most missions are so complex that they must be accomplished by effective cooperation of multiple fish robots. The platform presented in this article, as a novel test bed for multiple robotic fish cooperation, can be applied to different types of complex tasks. More importantly, it provides a good platform to test and verify all kinds of algorithms and strategies for cooperation of multiple underwater mobile robots. We use two cooperative tasks as examples to heuristically demonstrate the performance of this platform.
Factoring univariate polynomials over the rationals (abstract only)
Authors: Andrew Novocin
Venue: ACM Communications in Computer Algebra (2008)

This poster presents an algorithm for factoring polynomials over the rationals which follows the approach of the van Hoeij algorithm. The key theoretical novelty in our approach is that it is set up in a way that will make it possible to prove a new complexity result. Another difference of this algorithm from prior algorithms is the practical improvement which we call early termination. Our algorithm should outperform prior algorithms in many common classes of polynomials (including irreducibles).
Improved lower bounds for Shellsort
Authors: C. G. Plaxton
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors give improved lower bounds for Shellsort based on a new and relatively simple proof idea. The lower bounds obtained are both stronger and more general than the previously known bounds. In particular, they hold for nonmonotone increment sequences and adaptive Shellsort algorithms, as well as for some recently proposed variations of Shellsort.
Composition and Execution of Secure Workflows in WSRF-Grids
Authors: Tim Dörnemann, Matthew Smith, Bernd Freisleben
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

BPEL is the de-facto standard for business process modeling in today’s enterprises and is a promising candidate for the integration of business and Grid applications. While BPEL works well for traditional web services, it has a number of drawbacks with respect to the more complex world of WSRF-based Grid computing, especially where security is concerned. In this paper, a solution that extends the BPEL security approach to encompass secure Grid application interactions is presented. The proposed approach is capable of handling both web service and Grid service resources and their corresponding security mechanisms. The BPEL language is extended by security-related settings. An implementation of a GSI-compliant BPEL engine that can also manage the lifetime of proxy certificates is presented.
Impact of dynamic voltage and frequency scaling on the architectural vulnerability of GALS architectures
Authors: Niranjan Soundararajan, Narayanan Vijaykrishnan, Anand Sivasubramaniam
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Aggressive technology scaling is increasing the impact of soft errors on microprocessor reliability. Dynamic Voltage Frequency Scaling (DFVS) algorithms are conventionally studied from a performance per watt basis. But applying DVFS impacts reliability as well. Since DVFS affects the occupancy of different pipeline structures, they impact the soft error masking seen at the architectural level. Architectural Vulnerability Factors (AVF) captures this masking and in this work we study the impact of DVFS on AVF in a GALS environment. We show that the AVF of pipeline structures could vary by as much as 80% between different DVFS algorithms. Since AVF has a significant impact on the Mean Time To Failure (MTTF) of a system, these results indicate that when choosing a particular DVFS algorithm their reliability impact cannot be ignored. Hence we provide the Vulnerability Efficiency for the DVFS algorithms which captures their ability to optimize performance, power and reliability. Our results show that a Non-DVFS environment optimizes vulnerability efficiency better than any of the DVFS algorithms.
Predicting the quality and usability of spoken dialogue services
Authors: Sebastian Möller, Klaus-Peter Engelbrecht, Robert Schleicher
Venue: Speech Communication (2008)

In this paper, we compare different approaches for predicting the quality and usability of spoken dialogue systems. The respective models provide estimations of user judgments on perceived quality, based on parameters which can be extracted from interaction logs. Different types of input parameters and different modeling algorithms have been compared using three spoken dialogue databases obtained with two different systems. The results show that both linear regression models and classification trees are able to cover around 50% of the variance in the training data, and neural networks even more. When applied to independent test data, in particular to data obtained with different systems and/or user groups, the prediction accuracy decreases significantly. The underlying reasons for the limited predictive power are discussed. It is shown that - although an accurate prediction of individual ratings is not yet possible with such models - they may still be used for taking decisions on component optimization, and are thus helpful tools for the system developer.
Timing-driven via placement heuristics for three-dimensional ICs
Authors: Vasilis F. Pavlidis, Eby G. Friedman
Venue: Integration, the VLSI Journal (2008)

The dependence of the interconnect delay on the interplane via location in three-dimensional (3-D) ICs is investigated in this paper. The delay of these interconnects can be significantly decreased by optimally placing the interplane vias. The via locations that minimize the propagation delay of two-terminal interconnects consisting of multiple interplane vias under the distributed Elmore delay model are determined. For interconnect trees, the interplane via locations that minimize the summation of the weighted delay of the sinks of the tree are also determined. For these interconnect structures, the interplane via locations are obtained both through geometric programming and near-optimal heuristics. Placement constraints are imposed such that the path is negligibly affected. The proposed heuristics are used to implement efficient algorithms that exhibit lower computational times as compared to general optimization solvers with negligible loss of optimality. Various interplane via placement scenarios are considered. Simulation results indicate delay improvements for relatively short point-to-point interconnects of up to 32% with optimally placed interplane vias. For interconnect trees, the maximum improvement in delay for optimally placed interplane vias is 19%. The proposed algorithms can be integrated into a design flow for 3-D circuits to enhance placement and routing where timing is a primary design criterion.
Spoken Dialog System for Next Generation Knowledge Access
Authors: Hideki Kashioka, Susumu Akamine, Takafumi Nakanishi, Hisashi Miyamori, Koji Zettsu, Yutaka Kidawara, Satoshi Nakamura
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

Nowadays we can get most information through the Internet. However, we have a trouble to pick up expected information from the huge results with conventional search engines. Especially in mobile terminal, we are confronted with great difficulties for two factors. One is that most of users cannot make an appropriate query because their request is vague with theirselves. The other is that the retrieved information has huge variation and mobile terminal has small area for displaying them. Therefore, we aim to develop technologies for the users to input their requests by familiar way and clarify what they want to know with displaying the retrieved information with suitable method. This paper shows our development dialog system on Kyoto tourist information assistance in a client-server fashion.
Block size selection of parallel LU and QR on PVP-based and RISC-based supercomputers
Authors: Yunquan Zhang, Ying Chen, Yuan Tang
Venue: Proceedings of the 2007 Asian technology information program's (ATIP's) 3rd workshop on High performance computing in China: solution approaches to impediments for high performance computing (2007)

In this paper, we proposed a unified framework and tried to address the optimal block size selection problem for parallel blocked LU and QR factorization algorithm used in ScaLAPACK package, since they use two dimensional block cyclic data distribution fashion [12], block size plays important role in determining the final performance. Through the analysis with our proposed framework and experiments on small scale system configuration, we found that among all factors that affect performance, load balance and local block size selection play key roles in determining the optimal block size on two different type parallel computing platforms: SR2201 (PVP(Pseudo-Vector Processing) based MPP machine) and DAWNING 3000(RISC-based SMP cluster). In fact, the optimal parallel block size is determined by the processor grid shape and problem size. Based on this observation, optimal block size prediction formula for double precision real parallel blocked LU and QR on SR2201 and DAWNING3000 with processor grid shape and problem size as parameters were given, whose prediction results can match well with the large scale system configuration and large problem size experimental results. The application of our framework on other parallel machines and on other applications program wound be the future work.
The Heaviside function and laplace transforms
Authors: M. P. Legua, I. Morales, L. M. Sánchez Ruiz
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Integral transforms are frequently used in solving physical problems which involve integral and ordinary differential equations with constant coefficients as those arising in the analysis of electronic circuits. As a consequence of this most of them not only may be quickly computed with the aid of computer algebraic systems but the most commonly used mathematical software have also got subroutines that facilitate its handling and even force the general solving methods to use them. Usually these programs enable a combined use of the integral transforms along discontinuous functions that do appear in technology such as jump functions or even distributions which are, by definition, the dual to the smooth functions of compact support, with a particular topology, and are commonly called generalized functions. One of these distributions is the delta impulse which is conveniently implemented in many programs. In this paper we are going to revisit the well known Laplace transform which finely seconds the Fourier transform in solving and analyzing physical problems in which even jumps and discontinuous functions might occur. Despite the fact that the discontinuous Heaviside functions do appear and are properly included in the solution of differential equations in which there is some delay, we will pay attention to the fact that they are commonly missed when providing the solution of casual systems in which delayed functions are not present.
Evaluation of radiometric resolution on land use/land cover mapping in an agricultural area
Authors: N. Rama Rao, P. K. Garg, S. K. Ghosh
Venue: International Journal of Remote Sensing (2007)

Motivated by the increasing availability and importance of high radiometric resolution remote sensing data, this study aims to determine whether current generation high radiometric resolution remote sensing data could be used accurately for land use/land cover classification in place of traditional moderate radiometric resolution multispectral data. A comparative study has been carried out to evaluate the utility of the simulated 12-bit LISS-III sensor compared with that of the original 7-bit LISS-III sensor for land use/land cover classification. It has been found that there is a small increase of 3% in overall accuracy by using the high radiometric resolution (12-bit) LISS-III data over the moderate radiometric resolution (7-bit) LISS-III data for land use/land cover classification. A 4-6% difference in classification accuracy of simulated LISS-III for cotton, chillies, black gram, and sugar cane indicates the usefulness of high radiometric resolution data for ground classes that are more heterogeneous within the same class. This study suggests that high radiometric resolution satellite data may not be a requisite for accurate land use/land cover mapping, whereas the spectral bandwidth, band placement, and method of classification parameters may be more important.
Original papers: Real-time recognition of sick pig cough sounds
Authors: V. Exadaktylos, M. Silva, J. -M. Aerts, C. J. Taylor, D. Berckmans
Venue: Computers and Electronics in Agriculture (2008)

This paper extends existing cough identification methods and proposes a real-time method for identifying sick pig cough sounds. The analysis and classification is based on the frequency domain characteristics of the signal, while an improved procedure to extract the reference is presented. This technique evaluates fuzzy c-means clustering to parts of the training signals and provides a frequency content reference that mirrors the characteristics of sick pig cough. The extraction of the reference is performed in such a way that allows for the identification process to be implemented in real-time applications that would speed up the diagnosis and treatment process and improve animal welfare in pig houses. Preliminary results for the evaluation of the algorithm are based on individual sounds of healthy and sick animals acquired in laboratory conditions. An 85% overall correct classification ratio is achieved with 82% of the sick cough sounds being correctly identified.
Wireless System for Microwave Test Signal Generation
Authors: Qizhang Yin, William R. Eisenstadt, Tian Xia
Venue: IEEE Design Test (2008)

A wireless, embedded signal delivery system for RF or microwave embedded test of ICs is demonstrated. Compared to conventional RF test methods, the proposed test scheme has the potential benefits of testing multiple circuits simultaneously with a single RF test source and simplified test signal delivery. A preliminary application of this wireless embedded test is presented through an example low-noise amplifier measurement; wireless 5-GHz LNA measurement results agree with network analyzer measurements.
Effects of Retinoic Acid-induced PKC-d on the Insulin Like Growth Factor-I (IGF-I)System is Involved in Reactive Oxygen Species (ROS) in MCF-7 Cells
Authors: Young-Il Oh, Sang-Hoon Kim, Jong-Hoon Kim, Chang-Won Kang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

All-trans retinoic acid (RA) as a useful therapeutic anti-cancer agent is known to induce apoptosis and growth inhibition of human breast cancer cells (MCF-7 cells). Whereas insulin like growth factor-I (IGF-I) plays an important role in proliferation of cancer cells. RA dose- and time- dependently decreased in the level of secretion and synthesis of IGF-I. The treatment with 10-8M RA for 72h significantly increased in the phospho-protein kinase C (PKC)-δ activity. PKC-δ inhibitor rottlerin prevented the Ra-induced inhibition of secretion and synthesis of IGF-I. The treatment with 10-8M RA for 72h also increased the level of TBARS, and the increase was blocked by rottlerin as well as antioxidants such as GSH and DPI. Similarly these antioxidants also recovered the RA-induced inhibition of secretion and synthesis of IGF-I. These results indicate that RA-induced inhibition of secretion and synthesis of IGF-I were associated with the PKC-δ dependent mechanism and put in evidence that the interaction of PKC-δ and ROS.
Materiality and change: Challenges to building better theory about technology and organizing
Authors: Paul M. Leonardi, Stephen R. Barley
Venue: Information and Organization (2008)

Researchers have had difficulty accommodating materiality in voluntaristic theories of organizing. Although materiality surely shapes how people use technologies, materiality's role in organizational change remains under-theorized. We suggest that scholars have had difficulty grappling with materiality because they often conflate the distinction between the material and social with the distinction between determinism and voluntarism. We explain why such conflation is unnecessary and outline four challenges that researchers must address before they can reconcile the reality of materiality with the notion that outcomes of technological change are socially constructed.
Flashproxy: transparently enabling rich web content via remote execution
Authors: Alex Moshchuk, Steven D. Gribble, Henry M. Levy
Venue: Proceeding of the 6th international conference on Mobile systems, applications, and services (2008)

It is now common for Web sites to use active Web content, such as Flash, Silverlight, or Java applets, to support rich, interactive applications. For many mobile devices, however, supporting active content is problematic. First, the physical resource requirements of the browser plug-ins that execute active content may exceed the capabilities of the device. Second, plug-ins are simply not available for many devices. Finally, active code and the plug-ins that execute it often contain security flaws, potentially exposing a user's device or private data to harm. This paper explores a proxy-based approach for transparently supporting active Web content on mobile devices. Our approach uses a proxy to splice active content out of Web pages and replace it with an AJAX-based remote display component. The spliced active content executes within a remote sandbox on the proxy, but it appears embedded in the Web page on the mobile device's browser. To demonstrate the viability of this approach, we have designed, implemented, and evaluated Flashproxy. By using Flashproxy, any mobile Web browser that supports JavaScript transparently inherits the ability to access sites that contain Flash programs. The major challenge in Flashproxy is in trapping and handling interactions between the Flash program and its execution environment, including browser interactions. Flashproxy uses binary rewriting of Flash bytecode to interpose on such interactions, redirecting them through a JavaScript-based RPC layer to the user's browser. Our evaluation of Flashproxy shows that it is transparent, performant, and compatible with nearly all Flash programs that we examined.
On the existence of pseudorandom generators
Authors: O. Goldreich
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

Pseudorandom generators are known to exist, assuming the existence of functions that cannot be efficiently inverted on the distributions induced by applying the function iteratively polynomially many times. This sufficient condition is also necessary, but it is difficult to check whether particular functions, assumed to be one-way, are also one-way on their iterates. This raises the fundamental question of whether the mere existence of one-way functions suffices for the construction of pseudorandom generators. Progress toward resolving this question is presented. Regular functions in which every image of a k-bit string has the same number of preimages of length k are considered. It is shown that if a regular function is one-way, then pseudorandom generators do exist. In particular, assuming the intractability of general factoring, it can be proved that the pseudorandom generators do exist. Another application is the construction of a pseudorandom generator based on the assumed intractability of decoding random linear codes.