ppxscal/embedding_network huggingface dataset:
The anisotropic structure of the human left and right ventricles
Authors: P. Schmid, P. Niederer, P. P. Lunkenheimer, F. Torrent-Guasp
Venue: Technology and Health Care (1997)

An important determinant of cardiac output derives from the structure of the ventricular wall given by the arrangement of the cardiac muscle fibres. A key feature of this arrangement is both a global and local anisotropy. First, a preparation method necessary for analyzing the main aspects of spatial fibre architecture is outlined. Global anisotropy can be described by a gross band-like structure wrapping both left and right ventricles while local anisotropy results form the arrangement of the individual muscle fibres within the band. In pathologic cases this basic structure may be disturbed leading to cardiac failure. Second, a Finite Element model, formulated on the basis of Magnetic Resonance measurements has been devised which is intended to reflect the global as well as the local anisotropy of the ventricles in order to further the understanding of cardiac performance.
Equipartite Gregarious 5-Cycle Systems and Other Results
Authors: Benjamin R. Smith
Venue: Graphs and Combinatorics (2007)

A k-cycle decomposition of a complete multipartite graph is said to be gregarious if each k-cycle in the decomposition has its vertices in k different partite sets. Equipartite 3-cycle systems are 3-GDDs (and so are automatically gregarious), and necessary and sufficient conditions for their existence are known. The cases of equipartite gregarious 4-, 6- and 8-cycle systems have also been dealt with (using techniques that could be applied in the case of any even length cycle). Here we give necessary and sufficient conditions for the existence of a gregarious 5-cycle decomposition of the complete equipartite graph Km(n) (in effect the first odd length cycle case for which the gregarious constraint has real meaning). In doing so, we also define some general cyclic constructions for the decomposition of certain complete equipartite graphs into gregarious p-cycles (where p is an odd prime).
Forward-secure signatures in untrusted update environments: efficient and generic constructions
Authors: Benoît Libert, Jean-Jacques Quisquater, Moti Yung
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

Forward-secure signatures (FSS) prevent forgeries for past time periods when an attacker obtains full access to the signer's storage. To simplify the integration of these primitives into standard security architectures, Boyen, Shacham, Shen and Waters recently introduced the concept of forward-secure signatures with untrusted updates where private keys are additionally protected by a second factor (derived from a password). Key updates can be made on encrypted version of signing keys so that passwords only come into play for signing messages. The scheme put forth by Boyen et al. relies on bilinear maps and does not require the random oracle. The latter work also suggested the integration of untrusted updates in the Bellare-Miner forward-secure signature and left open the problem of endowing other existing FSS systems with the same second factor protection. This paper solves this problem by showing how to adapt the very efficient generic construction of Malkin, Micciancio and Miner (MMM) to untrusted update environments. More precisely, our modified construction - which does not use random oracles either - obtains a forward-secure signature with untrusted updates from any 2-party multi-signature in the plain public key model. In combination with Bellare and Neven's multi-signatures, our generic method yields implementations based on standard assumptions such as RSA, factoring or the hardness of computing discrete logarithms. Like the original MMM scheme, it does not require to set a bound on the number of time periods at key generation.
The Limits of Silicon
Authors: W. Myers
Venue: Computer (1978)

A glimpse at the ultimate limits of silicon integrated circuits was provided for the benefit of 804 conference registrants at COMPCON Spring 78 in San Francisco last month. But even though we may be approaching the limits of the currently most popular computer technology, our need for computational power seems limitless, both at the low end in expanding applications of microprocessors and at the high end in vast scientific computations. That, at least, appeared to be the tenor of the oneday preconference tutorial as well as a sampling of the sessions that bore directly upon the conference theme-"Computer Technology: Status, Limits, Alternatives." The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Novel Term Weighting Scheme for Automated Text Categorization
Authors: Hongzhi Xu, Chunping Li
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Term weighting is an important task for text classifica- tion. Inverse document frequency(IDF) is one of the most popular methods for this task; however, in some situa- tions, such as supervised learning for text categorization, it doesn't weight terms properly, because it neglects the cat- egory information and assumes that a term that occurs in smaller set of documents should get a higher weight. There have been several term weighting schemes that consider the category information. In this paper, we present a new term weighting scheme that considers more information provided by the term distribution among different categories. The ex- periments show that our method is more effective than three other popular schemes.
On the correctness issues in two-process mutual exclusion algorithms
Authors: Jayasri Banerjee, Anup Kumar Bandyopadhyay, Ajit Kumar Mandal
Venue: ACM SIGSOFT Software Engineering Notes (2007)

Correctness issues in two process mutual exclusion algorithms are investigated. A new theorem is proposed and proved that describes the key concept involved in such algorithms. For the purpose of proving the techniques developed in [3] are used. Result of this theorem is applied to two different algorithms of which one could be proved incorrect. Technique developed in [3] is also used to prove the correct algorithm.
Limited verification of identities to induce false-name-proofness
Authors: Vincent Conitzer
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

In open, anonymous environments such as the Internet, mechanism design is complicated by the fact that a single agent can participate in the mechanism under multiple identifiers. One way to address this is to design false-name-proof mechanisms, which choose the outcome in such a way that agents have no incentive to use more than one identifier. Unfortunately, there are inherent limitations on what can be achieved with false-name-proof mechanisms, and at least in some cases, these limitations are crippling. An alternative approach is to verify the identities of all agents. This imposes significant overhead and removes any benefits from anonymity. In this paper, we propose a middle ground. Based on the reported preferences, we check, for various subsets of the reports, whether the reports in the subset were all submitted by different agents. If they were not, then we discard some of them. We characterize when such a limited verification protocol induces false-name-proofness for a mechanism, that is, when the combination of the mechanism and the verification protocol gives the agents no incentive to use multiple identifiers. This characterization leads to various optimization problems for minimizing verification effort. We study how to solve these problems. Throughout, we use combinatorial auctions (using the Clarke mechanism) and majority voting as examples.
Method for determining natural design principles of biological control circuits
Authors: William S. Hlavacek, Michael A. Savageau
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

We illustrate a method of controlled mathematical comparison for determining design principles of biological control circuits. The method involves the comparison of alternative circuits that differ in a single process, that are constrained so as to eliminate extraneous differences, and that are compared quantitatively on the basis of a priori criteria for functional effectiveness. We use this method to compare two forms of coupling that are important in the regulation of repressible gene expression. The first form, which is called complete uncoupling, is marked by a constant level of regulator protein. The second form, which is called perfect coupling, is marked by a level of regulator protein that varies coordinately with the level of repressible enzyme under control. Our results indicate that, for a large class of systems, performance is better with perfect coupling than with complete uncoupling if the regulator protein is a repressor, and conversely, that performance is better with complete uncoupling than with perfect coupling if the regulator protein is an activator. These results lead to testable predictions that are consistent with available data.
Providing Support for Model Composition in Metamodels
Authors: Robert France, Franck Fleurey, Raghu Reddy, Benoit Baudry, Sudipto Ghosh
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

In aspect-oriented modeling (AOM), a design is de- scribed using a set of design views. It is sometimes neces- sary to compose the views to obtain an integrated view that can be analyzed by tools. Analysis can uncover conflicts and interactions that give rise to undesirable emergent be- havior. Design models tend to have complex structures and thus manual model composition can be arduous and error- prone. Tools that automate significant parts of model com- position are needed if AOM is to gain industrial acceptance. One way of providing automated support for compos- ing models written in a particular language is to define model composition behavior in the metamodel defining the language. In this paper we show how this can be done by extending the UML metamodel with behavior describ- ing symmetric, signature-based composition of UML model elements. We also describe an implementation of the meta- model that supports systematic composition of UML class models.
A Combining Approach for Chinese Word Segmentation
Authors: Aiqing Wang, Sen Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In Chinese and many other Asian languages which are based on non-ASCII alphabet, words are not delimited with whitespace (space, tab etc.), and word boundaries must therefore be reconstructed. Further syntactic analysis is based on the output of word segmentation result. Ambiguity and unregistered words are the most important problems in Chinese word segmentation. In this paper we analyzed the ambiguous reasons and presented a one-pass scan method for the detection and modification of ambiguous cases. To deal with the unregistered words and special words (such as names), we proposed a combination method that can recognize new words, hence the accuracy can be increased. In the realization, we used the bi-section search method to look up words in a large dictionary (more than 40,000 items), and the average search cost for a word is less than 16 operations, so the speed is satisfactory if the system is embedded into Chinese understanding systems or Chinese speech processing systems.
Technical steps towards one-to-one electrode-neuron interfacing with neural circuits reconstructed in vitro
Authors: E. Claverol-Tinturé, X. Rosell, J. Cabestany
Venue: Neurocomputing (2007)

The electrical interfacing with cultured networks of neurons by means of multielectrode arrays (MEAs) is an area of intensive research given the potential of this technique to aid in the extraction of the algorithms that support neurocomputation in brain tissue. To this end, we have previously described the polymer-on-multielectrode technology (PoM [E. Claverol-Tinture, M. Ghirardi, F. Fiumara, X. Rosell, J. Cabestany. Multielectrode arrays with elastomeric microstructures for neuronal patterning towards interfacing with uni-dimensional neuronal networks. J. Neural Eng. 2(2) (2005) L1-7] and demonstrated single-site recordings from patterned invertebrate cells. The realisation of the full potential of PoM is dependent on its successful application to vertebrate cells and to the recording of activity in ensembles of neurons. Here, we describe progress in these directions, specifically towards the development of vertebrate neuronal cultures devoid of glial layers compatible with PoM devices, the connection of pairs of invertebrate neurons threading microchannels and the recordings of synaptic and spike-like activity.
Fixed access network technologies
Authors: A. F. Cameron, D. J. Thorne, K. T. Foster, S. I. Fisher
Venue: BT Technology Journal (2007)

Telecommunications operators around the world are facing flat or declining revenues in their traditional services and expanding commercial and political demand for ubiquitous broadband access. This creates two opposing pressures -- to cut costs radically and to invest heavily in new technology. The traditional fixed access network is central to both of these issues and this paper describes the technology that is being developed to meet these challenges.
KiF: a stateful SIP fuzzer
Authors: Humberto J. Abdelnur, Radu State, Olivier Festor
Venue: Proceedings of the 1st international conference on Principles, systems and applications of IP telecommunications (2007)

With the recent evolution in the VoIP market, where more and more devices and services are being pushed on a very promising market, assuring their security becomes crucial. Among the most dangerous threats to VoIP, failures and bugs in the software implementation will still rank high on the list of vulnerabilities. In this paper we address the issue of detecting such vulnerabilities using a stateful fuzzer. We describe an automated attack approach capable to self-improve and to track the state context of a target device. We implemented our approach and were able to discover vulnerabilities in market leading and well known equipments and software.
The Study of Compost Quality Evaluation Modeling Method Based on Fuzzy Neural Network for Sewage Treatment
Authors: Jingwen Tian, Meijuan Gao, Yujuan Xiang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Because of the complicated interaction of the sludge compost components, it makes the quality evaluation system of sludge compost appear the fuzziness. According to the physical circumstances of sludge compost, a compost quality evaluation modeling method based on fuzzy neural network is presented. We select the index of sludge compost quality and take the high temperature duration, degrdn rate, nitrogen content, average oxygen concentration and maturity degree as the evaluation parameters. We construct the structure of fuzzy neural network that used for the quality evaluation of sludge compost, and adopt the Levenberg-Marquart optimizing algorithm to train fuzzy neural network. With the ability of strong self-learning and function approach of fuzzy neural network, the modeling method can truly evaluate the sludge compost quality by learning the index information of sludge compost quality. The experimental results show that this method is feasible and effective.
A Fast Incremental Clustering Algorithm Based on Grid and Density
Authors: Chen Zhuo, Liu Xiang-shuang, Zhuang Xiao-dong
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

In this paper, a fast incremental clustering algorithm based on grid and density called ICGD is implemented in order to realize the real time clustering of the dynamic data. The innovations of this algorithm is capturing the shape of data space by condensation points, and using grid-based and density-based clustering methods based on the theories of climbing hill algorithm and connectedness to cluster the data, guided by the difference data to implement incremental cluster. The algorithm has the ability of grid-based and density-based clustering methods' good features, overcoming the traditional grid-based clustering method's shortcoming of clustering quality debasement resulted by little or no consideration of data distribution when partitioning the grids. They can also decrease the number of region query and calculate in traditional density-based clustering method, which consequently reduces the I/O cost. Experimental results show that it can realize incremental clustering process effectively and accurately.
Genetic Programming meets Model-Driven Development
Authors: Thomas Weise, Michael Zapf, Mohammad Ullah Khan, Kurt Geihs
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

Genetic programming is known to provide good solutions for many problems like the evolution of network protocols and distributed algorithms. Then, it is most likely a hardwired module of a design framework where it assists the engineer in optimizing specific aspects in system development. In this paper we show how the utility of genetic programming can be increased remarkably by isolating it as a component and integrating it into the model-driven software development process. Our genetic programming framework produces XMI-encoded UML models that can easily be loaded into widely available modeling tools, which in turn offer code generation as well as additional analysis and test capabilities. We use the evolution of a distributed election algorithm as an example to illustrate how genetic programming can be combined with model-driven development.
Cultured Differential Particle Swarm Optimization for Numerical Optimization Problems
Authors: Sheng Liu, Xingyu Wang, Xiaoming You
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

A cultural algorithm based on differential particle swarm optimization (DPSO) is proposed in this paper. The main novel feature of this approach is the use of DPSO as a population space. DPSO is a hybrid-optimized algorithm based principally on the introduction of the differential variation mechanism into the PSO algorithm, which will maintain swarm diversity. The knowledge sources contained in the belief space of the cultural algorithm are specifically designed according to the DPSO evolution population. Different knowledge sources are used to influence the variation operator of DPSO, in order to enhance search ability and reduce the computational cost. The simulation results of typical function optimization problems show that the proposed algorithm has good optimization quality.
Tate Pairing with Strong Fault Resiliency
Authors: Erdinc Ozturk, Gunnar Gaubatz, Berk Sunar
Venue: Proceedings of the Workshop on Fault Diagnosis and Tolerance in Cryptography (2007)

We present a novel non-linear error coding framework which incorporates strong adversarial fault detection capabilities into identity based encryption schemes built using Tate pairing computations. The presented algorithms provide quantifiable resilience in a well defined strong attacker model. Given the emergence of fault attacks as a serious threat to pairing based cryptography, the proposed technique solves a key problem when incorporated into software and hardware implementations.
The Reconstruction of Three-Dimensional Objects from Two Orthogonal Projections and its Application to Cardiac Cineangiography
Authors: Shi-Kuo Chang
Venue: IEEE Transactions on Computers (1973)

A method is developed for the reconstruction of a two-dimensional convex symmetric object from two orthogonal projections. To reconstruct a three-dimensional object, the object is divided into thin slices and the slices are individually reconstructed. An experimental result of the reconstruction of a clay model from its X-ray pictures is described. Applicability of this technique to cardiac cineangiography is discussed.
Measuring business cycle turning points in Japan with the Markov Switching Panel model
Authors: Shyh-Wei Chen
Venue: Mathematics and Computers in Simulation (2007)

This paper employs a Markov Switching Panel model to measure business cycle turning points in Japan. This Markov Switching Panel model is simple and can easily be estimated following Hamilton's [J.D. Hamilton, A new approach to the economic analysis of nonstationary time series and the business cycle, Econometrica 57 (1989) 357-384] method. We find that this model is highly capable of identifying Japanese recessionary dates, and it also has a forecast performance that is equal to that of the Markov Switching Vector Autoregressive model. The implication that emerges here is that governments, their agencies and other business leaders in Japan and elsewhere should also employ the Markov Switching Panel model to secure complementary data.
Connectivity of Random Logic
Authors: M. Feuer
Venue: IEEE Transactions on Computers (1982)

This paper develops a relation between the partitioning properties of computer logic and the distribution of connection lengths. The computation of length distributions is important for wirability analysis and delay estimation. The principal result is that an exponential partitioning function leads to an inverse power law length distribution.
Data morphing: an adaptive, cache-conscious storage technique
Authors: Richard A. Hankins, Jignesh M. Patel
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

The number of processor cache misses has a critical impact on the performance of DBMSs running on servers with large main-memory configurations. In turn, the cache utilization of database systems is highly dependent on the physical organization of the records in main-memory. A recently proposed storage model, called PAX, was shown to greatly improve the performance of sequential file-scan operations when compared to the commonly implemented N-ary storage model. However, the PAX storage model can also demonstrate poor cache utilization for other common operations, such as index scans. Under a workload of heterogenous database operations, neither the PAX storage model nor the N-ary storage model is optimal. In this paper, we propose a flexible data storage technique called Data Morphing. Using Data Morphing, a cache-efficient attribute layout, called a partition, is first determined through an analysis of the query workload. This partition is then used as a template for storing data in a cache-efficient way. We present two algorithms for computing partitions, and also present a versatile storage model that accommodates the dynamic reorganization of the attributes in a file. Finally, we experimentally demonstrate that the Data Morphing technique provides a significant performance improvement over both the traditional N-ary storage model and the PAX model.