ppxscal/embedding_network huggingface dataset:
PSISA: an algorithm for indexing and searching protein structure using suffix arrays
Authors: Tarek F. Gharib, Ahmed Salah, Abdel-Badeeh M. Salem
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Protein Structure Indexing using Suffix Array (PSISA) is a new technique provides the ability to retrieve similarities of proteins based on the proteins structures. Indexing the protein structure is one approach of searching for protein similarities. In this paper we developed our proposed technique based on novel use of suffix array. We start by converting protein structure into a sequence by extracting local feature vectors; normalization is applied to these vectors components and converts these normalized vectors into a sequence. Sequence is indexed using the suffix array structure, which is used effectively in the searching process to retrieve proteins with similar structure. Proteins with high structural similarities are ranked according to their alignment score against the query protein. The experimental results, which based on the structural classification of proteins (SCOP) dataset, show that our method outperforms existing similar methods in memory utilization. Our results show an enhancement in the memory usage with factor exceeds 35%.
A New Matrix Method for Reconstruction of Band-Limited Periodic Signals from the Sets of Integrated Values
Authors: Predrag Petrovic
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper presents a new method for reconstruction of trigonometric polynomials, a specific class of bandlimited signals, from a number of integrated values of input signals. It is applied in signal reconstruction, spectral estimation, system identification, as well as in other important signal processing problems. The proposed method of processing can be used for precise rms measurements of periodic signal (or power and energy) based on the presented signal reconstruction. Based on the value of the integral of the original input (analogue) signal, with a known frequency spectrum but unknown amplitudes and phases, a reconstruction of its basic parameters is done by the means of derived analytical and summarized expressions. Subsequent calculation of all relevant indicators related to the monitoring and processing of ac voltage and current signals is provided in this manner. Computer simulation demonstrating the precision of these algorithms. We investigate the errors related to the signal reconstruction, and provide an error bound around the reconstructed time domain waveform.
Inside risksReducing risks of implantable medical devices
Authors: Kevin Fu
Venue: Communications of the ACM (2009)

A prescription to improve security and privacy of pervasive health care.
Opportunistic channels: mobility-aware event delivery
Authors: Yuan Chen, Karsten Schwan, Dong Zhou
Venue: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware (2003)

The delivery of data in pervasive systems has to deal with end host mobility. One problem is how to create appropriate, application-level data provisioning topologies, termed data brokers, to best match underlying network connectivity, end user locations, and the locales of their network access. Another problem is how to balance workloads in such overlay networks, in response to mobility and to changes in available processing and communication resources. This paper improves the performance of data provisioning by dynamically changing broker topologies and end users' assignments to brokers. Specifically, using publish/subscribe as a communication paradigm, a new abstraction, termed an opportunistic event channel, enables dynamic broker creation, deletion, and movement. Experimental and simulation results demonstrate the ability of opportunistic channels to optimize event delivery and processing when end users move across different network access points. The technique is to 'opportunistically' follow network-level handoffs across network access points with application-level handoffs of a user's broker functionality to a new, 'closer' broker. The potential load imbalances across brokers caused by such handoffs are also addressed. Opportunistic channels are realized with the JECho event infrastructure. Performance advantages attained from their use can be substantial, with the cost of sending a message from a publisher to a mobile subscriber improved by up to 50%. Load balancing improves event delivery even for moderate numbers of event subscribers.
Computer education for managers
Authors: James E. Oberg, Jack Butler, Bernard F. King,  Jr., Stephen Ruth
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Data processing is still a specialized trade, carried out by specialists. They talk to each other in a private jargon. They do not as a rule encourage outsiders to try to understand their craft.
IMine: Index Support for Item Set Mining
Authors: Elena Baralis, Tania Cerquitelli, Silvia Chiusano
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

This paper presents the IMine index, a general and compact structure which provides tight integration of itemset extraction in a relational DBMS. Since no constraint is enforced during the index creation phase, IMine provides a complete representation of the original database. To reduce the I/O cost, data accessed together during the same extraction phase are clustered on the same disk block. The IMine index structure can be efficiently exploited by different itemset extraction algorithms. In particular, IMine data access methods currently support the FP-growth and LCM v.2 algorithms, but they can straightforwardly support the enforcement of various constraint categories. The IMine index has been integrated into the PostgreSQL DBMS and exploits its physical level access methods. Experiments, run for both sparse and dense data distributions, show the efficiency of the proposed index and its linear scalability also for large datasets. Itemset mining supported by the IMine index shows performance always comparable with, and sometimes better than, state of the art algorithms accessing data on flat file.
Do you know?: recommending people to invite into your social network
Authors: Ido Guy, Inbal Ronen, Eric Wilcox
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

In this paper we describe a novel UI and system for providing users with recommendations of people to invite into their explicit enterprise social network. The recommendations are based on aggregated information collected from various sources across the organization and are displayed in a widget, which is part of a popular enhanced employee directory. Recommended people are presented one by one, with detailed reasoning as for why they were recommended. Usage results are presented for a period of four months that indicate an extremely significant impact on the number of connections created in the system. Responses in the organization's blogging system, a survey with over 200 participants, and a set of interviews we conducted shed more light on the way the widget is used and implications of the design choices made.
A real time signal processing technique for MIDI generation
Authors: Farshad Arvin, Shyamala Doraisamy
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

This paper presents a new hardware interface using a microcontroller which processes audio music signals to standard MIDI data. A technique for processing music signals by extracting note parameters from music signals is described. An algorithm to convert the voice samples for real time processing without complex calculations is proposed. A high frequency microcontroller as the main processor is deployed to execute the outlined algorithm. The MIDI data generated is transmitted using the EIA-232 protocol. The analyses of data generated show the feasibility of using microcontrollers for real time MIDI generation hardware interface.
A Simplicial Approach for Discrete Fixed Point Theorems
Authors: Xi Chen, Xiaotie Deng
Venue: Algorithmica (2009)

We present a new discrete fixed point theorem based on a variation of the direction-preserving maps over simplicial structures. We show that the result is more general than the recent discrete fixed point theorem of Iimura et al. (J. Math. Econ. 41(8):1030&#x2013;1036, [2005]) by deriving it from ours. The simplicial approach applied in the development of the new theorem reveals a clear structural comparison with the classical approach for the continuous case.
An area reduction method for digital filter using redundancy of SD number system
Authors: Sang-Hun Yoon, Jin-Doo Jeong, Jong-Wha Chong
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

In this paper, an area efficient digital filter design method is proposed. The conventional area efficient filter design methods have the problems of long critical path delay since they make deep logic depth due to adder sharing. In this paper, we propose a method which can reduce filter size using the redundancy of the signed digit (SD) number system based on the flattened-coefficient method which can share adders while maintain the critical path delay. Simulation results show that the proposed structure can save the number of adders and registers 22% and 26%, respectively, than the conventional methods can do.
Renaissance computing: an initiative for promoting student participation in computing
Authors: Leen-Kiat Soh, Ashok Samal, Stephen Scott, Stephen Ramsay, Etsuko Moriyama, George Meyer, Brian Moore, William G. Thomas, Duane F. Shell
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

We report on a recently funded project called Renaissance Computing, an initiative for promoting student participation in computing. We propose a radical re-thinking not only of our core curriculum in CS, but of the role of CS at the university level. In our conception, ''computational thinking'' is neither easily separated from other endeavors nor easily balkanized into a single department. We thus imagine a CS curriculum that is inextricably linked to other domains. Our proposed initiative covers introductory, depth, and capstone courses, targeting both CS majors and minors. It is also aimed to develop interdisciplinary CS courses in sciences, engineering, arts, and humanities. Furthermore, the framework embraces collaborative learning to help improve learning.
Diagrammatic Representation and Inference: 5th International Conference, Diagrams 2008, Herrsching, Germany, September 19-21, 2008, Proceedings (Lecture ... / Lecture Notes in Artificial Intelligence), 1 edition
Authors: Gem Stapleton, John Howse, John Lee
Venue:  (2008)

This book constitutes the refereed proceedings of the 5th International Conference on Theory and Application of Diagrams, Diagrams 2008, held in Herrsching, Germany, in September 2008. The 25 revised papers and 28 poster papers presented together with 3 keynote papers and 2 tutorial papers were carefully reviewed and selected from 70 submissions. The papers are organized in topical sections on diagram aesthetics and layout, psychological and cognitive issues, applications of diagrams, theoretical aspects, diagrams in education, as well as understanding and comprehension.
A Reliable Broadcast Method for Vehicular Ad Hoc Networks Considering Fragmentation and Intersection Problems
Authors: Samaneh Khakbaz, Mahmood Fathy
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Vehicular Ad hoc Networks (VANETs) are new network environment for intelligent transportation systems. Many of applications in VANETs are based on dissemination of information, so broadcasting is one of the fundamental services in these networks. Broadcasting in VANET is a challenging task since these networks often lack continuous end-to-end connectivity and also have different road topologies. In this paper we present a broadcast method that improves the reception rates of broadcast messages by overcoming problem of connectivity gaps and omitting unreliability that occurs at intersections. We have simulated our method in NS2, simulation results show our method delivers message to most of vehicles by assuring propagating message in all roads and passing connectivity gaps.
Research on Multilevel Control Model of Network Performance Based on Multi-agent
Authors: Bin Wu, Hongying Zhang, He Sun
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

With the increasing of the complexity of computer networks, the research of network management system has become more and more important. Firstly, in order to make the network performance management satisfy the need of the fault-tolerant, learning ability and organizational ability, network performance multilevel control model is researched in this paper by combining with multi-Agent technology and Multilevel control theory. Then, on the basis of utilizing the distribution and collaboration of Multi-Agent to implement the monitoring, analysis and forecast of network performance, the control of network performance is fulfilled through the multilevel control method. Thirdly, the proposed model in this paper is implemented using JBuilder2006, which is able to implement the intelligent management of network performance for different key equipments in the network. Finally, the system is applied on a certain local area network. The experimental results show that it can significantly improve the availability ratio of the network and realize the optimal performance of the network.
An application CTL formula based on problem solving methodology
Authors: Laura F. Cacovean, Emil M. Popa, Cristina I. Brumar, Iulian Pah
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

This paper show a study of case using a new proposes methodology in [6] which it develops approach to solve problem in which domain experts of the problem handle the IT concepts using own natural language but don't and vice-versa. This proposes idea starts as a base for the computation education. In this methodology of computer-solved solution is followed as the problems inside of domain experts of the application domain (AD) they develops algorithms for the solution of the problem using the natural language of their problem domain and informatics technology (IT) experts develops software tools which can execute algorithms developed of AD experts without translation these in programs. We using as example a CTL formula and show how a programming language experts can develop this model without associative programming. We illustrate the use of computational emancipation in language processing with the following problem: (M, s) = ⊨f? where M is a model of a parse system and s is a state of the a model and f is a model CTL formula we want to is satisfied of systems.
A Review and Development of 3-D Accelerator Technology for Games
Authors: Huang Xu, CuiPing Wang
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

In this paper we attempt to review the current technology of 3D accelerators for animating graphics used in games and visual simulation systems, together with associated techniques and software architectures. Topics covered include OpenGL, DirectX, anti-aliasing, motion blur and depth of field. A summary of work in progress is given in the conclusions section.
The linear models of brightness sensation
Authors: Hans Giger Franz Fankhauser
Venue: Journal of Visualization (2008)

An analysis and mathematical comparison of models underlying the phenomena of brightness and contrast are presented. The concept of self-excitation which has not so far been considered is introduced into the structure of the models. Mach Bands can be described by two essentially different but formally identical mechanisms. The phenomenon allows neither a functional explanation in terms of models presented heretofore nor an answer to the question whether data processing is based in the human visual system on integrating of differentiating of on both.
Reduction of uncertainty using sensitivity analysis methods for infinite random sets of indexable type
Authors: Diego A. Alvarez
Venue: International Journal of Approximate Reasoning (2009)

In this paper we deal with the question ''which is the best way to spend our resources in order to decrease the width of the interval [Bel(F),Pl(F)] in Dempster-Shafer evidence theory?''. A solution based on sensitivity analysis techniques using the Hartley-like measure of nonspecificity is proposed. This technique is a generalization of an approach introduced by Ferson and Tucker [S. Ferson, W.T. Tucker, Sensitivity in risk analysis with uncertain numbers, Report SAND2006-2801, Sandia National Laboratories, Albuquerque, NM, July 2006. ; S. Ferson, W.T. Tucker, Sensitivity analysis using probability bounding, Reliability Engineering and System Safety 91 (10-11) (2006) 1435-1442], which does not require the calculation of the probability box associated to the output Dempster-Shafer structure after the application of the extension principle for random sets. The proposed technique is computationally much more efficient than the one of Ferson and Tucker by several orders of magnitude. Finally, the extension principle of Dubois and Prade [D. Dubois, H. Prade, Random sets and fuzzy interval analysis, Fuzzy Sets and Systems 42 (1) (1991) 87-101] is generalized for infinite random sets of indexable type.
A combined finite and infinite element approach for modeling spherically symmetric transient subsurface flow
Authors: Wenjun Dong, A. P. S. Selvadurai
Venue: Computers Geosciences (2009)

This paper presents a finite element-infinite element coupling approach for modeling a spherically symmetric transient flow problem in a porous medium of infinite extent. A finite element model is used to examine the flow potential distribution in a truncated bounded region close to the spherical cavity. In order to give an appropriate artificial boundary condition at the truncated boundary, a transient infinite element, that is developed to describe transient flow in the exterior unbounded domain, is coupled with the finite element model. The coupling procedure of the finite and infinite elements at their interface is described by means of the boundary integro-differential equation rather than through a matrix approach. Consequently, a Neumann boundary condition can be applied at the truncated boundary to ensure the C^1-continuity of the solution at the truncated boundary. Numerical analyses indicate that the proposed finite element-infinite element coupling approach can generate a correct artificial truncated boundary condition to the finite element model for the unbounded flow transport problem.
From a Circular-Arc Model to a Proper Circular-Arc Model
Authors: Yahav Nussbaum
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

We are given a circular-arc graph, represented by a circular-arc model; our goal is to decide whether the graph is a proper circular-arc graph. We do so in time linear in the number of vertices of the graph, regardless of the number of edges which may be quadratic in the number of vertices. For every input graph, we either provide a proper circular-arc model for the graph, or a forbidden subgraph induced in the graph.
Modelling Grid5000 point availability with SAN
Authors: Leonardo Brenner, Paulo Fernandes, Jean-Michel Fourneau, Brigitte Plateau
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

The point availability is the probability that a system is available at time t. As grids need a lot of resources to be really operational, the evolution of their availability with time or depending on a maintenance process is a hot topic. But as grids contain a lot of resources, it is quite difficult to model and solve this problem. Here we advocate a component based description which is associated to a tensor based numerical approach.
A novel thermal optimization flow using incremental floorplanning for 3D ICs
Authors: Xin Li, Yuchun Ma, Xianlong Hong
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Thermal issue is a critical challenge in 3D IC design. To eliminate hotspots, physical layouts are always adjusted by shifting or duplicating hot blocks. However, these modifications may degrade the packing area as well as interconnect distribution greatly. In this paper, we propose some novel thermal-aware incremental changes to optimize these multiple objectives including thermal issue in 3D ICs. Furthermore, to avoid random incremental modification, which may be inefficient and need long runtime to converge, here potential gain is modeled for each candidate incremental change. Based on the potential gain, a novel thermal optimization flow to intelligently choose the best incremental operation is presented. We distinguish the thermal-aware incremental changes in three different categories: migrating computation, growing unit and moving hotspot. Mixed integer linear programming (MILP) models are devised according to these different incremental changes. Experimental results show that migrating computation, growing unit and moving hotspot can reduce max on-chip temperature by 7%, 13% and 15% respectively on MCNC/GSRC benchmarks. Still, experimental results also show that the thermal optimization flow can reduce max on-chip temperature by 14% compared to an existing 3D floorplan tool CBA, and achieve better area and total wirelength improvement than individual operations do.
An obsolescence management framework for system baseline evolution&mdash;Perspectives through the system life cycle
Authors: Tom Herald, Dinesh Verma, Caroline Lubert, Robert Cloutier
Venue: Systems Engineering (2009)

In military, civil, and commercial systems there exists a need to affordably manage the operational effectiveness of the system of interest through the acquisition and operational stages of its life cycle. Once a system design is baselined and instantiated, then the challenge during development, production, and utilization life cycle stages is to maintain the currency of the physical system baseline to facilitate affordable system support. In essence, the system must adapt to potentially frequent asynchronous obsolescence of its constituent elements, requirements growth (driven by the operational environmental and external constraints such as funding, schedule or risk), and external environment changes. This paper specifically addresses the impact that system element obsolescence has on a system baseline during the various system life cycle phases and provides a framework for affordable system evolution. Literature search and consolidation has articulated six integral components that comprise a comprehensive evolution framework through bottoms-up obsolescence management of constituent system elements. Each of the obsolescence management components is tangibly addressed in terms of each system life cycle phase and the available tools and methods. Additionally, each of the obsolescence management framework components is analyzed for life cycle phase applicability and then extended further with the criticality and type of analysis to be done for that life cycle phase. In this way, a project can determine which studies to perform, while in a specific life cycle phase, that maximizes the insight of impending obsolescence for a particular system. &copy; 2008 Wiley Periodicals, Inc. Syst Eng