ppxscal/embedding_network huggingface dataset:
Absoft tools Fortran integrated development environment
Authors: Tony Goelz
Venue: ACM SIGPLAN Fortran Forum (2008)

Although the roots of the Fortran language go back to the days of punch cards, it is still very much in use today and Integrated Development Environments are becoming increasingly popular with Fortran developers. An Integrated Development Environment (IDE) is a software tool that is used during all phases of program development. By combining the separate tasks of source code editing, compiling, linking, and debugging in a single unified interface, an IDE minimizes the amount of time spent learning separate tools. This article is an introduction to Absoft's Absoft Tools Integrated Development Environment for Fortran and C&copy;++ programming. It provides an overview of the key features and presents an example of using the IDE to build an open source Fortran subroutine library.
Performance of a Hierarchical Cluster-Based Wireless Sensor Network
Authors: Yung-Fa Huang, Neng-Chung Wang, Ming-Che Chen
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

This paper proposes a clustering scheme to improve energy efficiency for cluster-based wireless sensor networks (WSNs). In order to reduce the energy dissipation of transmitting sensing data at each sensor, the proposed fixed algorithm uniformly divides the sensing area into clusters where the cluster head is deployed in the center of the cluster area. Moreover, to improve the energy efficiency in the cluster based on the fixed clustering, the cluster head is elected by the LEACH scheme. Simulation results show that the proposed low-energy fixed clustering (LEFC) definitely reduces the energy consumption of the sensors and outperform LEACH with more 60% network lifetime.
Weak sharp minima revisited, Part III: error bounds for differentiable convex inclusions
Authors: James V. Burke, Sien Deng
Venue: Mathematical Programming: Series A and B (2008)

The notion of weak sharp minima unifies a number of important ideas in optimization. Part I of this work provides the foundation for the theory of weak sharp minima in the infinite-dimensional setting. Part II discusses applications of these results to linear regularity and error bounds for nondifferentiable convex inequalities. This work applies the results of Part I to error bounds for differentiable convex inclusions. A number of standard constraint qualifications for such inclusions are also examined.
Bio-MEMS fabricated artificial capillaries for tissue engineering
Authors: G. J. Wang, C. L. Chen, S. H. Hsu, Y. L. Chiang
Venue: Microsystem Technologies (2005)

In this report, we focus on the microfabrication and cell seeding issues of artificial blood capillaries for tissue engineering. Two different fabrication methods (stainless steel electroforming and silicon electroforming) and a number of materials (PC, Polycarbonate and biocompatible material PLGA, poly lactide-co-glycolides) are implemented to build the vascular network. The vascular network is then used as the scaffold to cultivate the bovine endothelial cell (BEC). During the period of cell cultivation, oxygen and nutrient need to be continuously delivered by a circular pressurizing system. In cell culture, encouraging results are obtained through the dynamical seeding of the BEC on the scaffolds. A systematic cell culture process has been developed after repeated experiments. Successful seeding efficiencies are obtained by using the developed systematic cell culture process.
Joint Routing and 2D Transform Optimization for Irregular Sensor Network Grids Using Wavelet Lifting
Authors: Godwin Shen, Antonio Ortega
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

We address the joint optimization of routing and compression for wireless sensor networks using a lifting-based 2D transform that can be computed along arbitrary routing trees. The proposed 2D transform allows for unidirectional computation, thereby eliminating costly backward transmissions often required by existing 2D transforms. We also propose a framework for optimizing the transform by selecting among a different set of coding schemes (i.e., different levels in the wavelet decomposition). Since our transform can operate on arbitrary routing trees, we focus on the problem of jointly optimizing routing trees based on inter-node data correlation and inter-node distance. The two extreme solutions would be i) to route data along paths that maximize inter-node data correlation (at the risk of increasing transport costs), corresponding to a minimum spanning tree (MST), or ii) to follow shortest path tree (SPT) routing (where inter-node data correlation may not be as high). We propose an optimization technique that exhaustively searches for the optimal tree over a set of combinations of MST and SPT. We also propose a heuristic approximation algorithm that is amenable for use on larger networks and with which we observe total cost reductions close to 10% for some of the data.
Generalized models based on neural networks and multiple linear regression
Authors: Pero Radonja, Srdjan Stankovic, Dragana Drazic, Bratislav Matovic
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

Developed generalized models are based on neural networks, linear and multiple linear regression. Applications of the generalized (regional) models in estimation of the most important general (common) characteristic of the whole region is done. Testing of the regional models with real, referent data is performed by regression analyses, also. The obtained correlation coefficients between referent data and corresponding data computed using the regional models based on linear and multiple linear regression are very height, 0.9971 and 0.9955 respectively. In the case of application of neural networks correlation coefficients is the largest, 0.9985.
Mining temporal mobile sequential patterns in location-based service environments
Authors: Vincent S. Tseng, Eric Hsueh-Chan Lu, Cheng-Hsien Huang
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

In recent years, a number of studies have been done on Location-Based Service (LBS) due to the wide applications. One important research issue is the tracking and prediction of users&#x2019; mobile behavior. In this paper, we propose a novel data mining algorithm named TMSP-Mine for efficiently discovering the Temporal Mobile Sequential Patterns (TMSPs) of users in LBS environments. To our best knowledge, this is the first work on mining the mobile sequential patterns associated with moving paths and time intervals in LBS environments. Furthermore, we propose novel location prediction strategies that utilize the discovered TMSPs to effectively predict the next movement of mobile users. Finally, we conducted a series of experiments to evaluate the performance of the proposed method under different system conditions by varying various parameters.
Implementation approach of ERP with mass customization
Authors: Y. Zhao, Y. S. Fan
Venue: International Journal of Computer Integrated Manufacturing (2007)

This paper analyses the shortage of traditional enterprise resource planning (ERP) systems in the current dynamic and competitive enterprise environment. The new-generation ERP system needs to be frequently customized with low cost, high quality and efficiency, as is similar to the product of mass customization (MC). Owing to this kind of similarity, an implementation framework of ERP with MC principles (MC-ERP) is proposed based on the three fundamental principles of MC. An enterprise modelling-based enterprise total solution, which is the starting point of this framework, is introduced. In order to solve the function deployment approach, which is a key technology of the framework, an approach based on quality function deployment methodology is also discussed. For realization and validation, the architecture of a toolset for implementing MC-ERP is finally proposed, and the enterprise modelling tool, the kernel of this toolset, has been developed.
Individuation and Construction of Web Courses
Authors: Zhonghua Wang, Yan Yu, Yifeng Wang, Lulu Chen, Shumei Gong
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Web-based education encouraged learner-centered, individualized study way. After analyzing the individualization situation of the web course in our country, aiming at the problem of the common deficiency of individualization in web course, combining with the Chinese E-Learning Technology Standard(CELTS),this paper constructed the systematic frame of the learner-based web course, and primarily debated how to realize the individualization of web course based on the learners' characteristics, and also it's advantage.
A survey on the history of transaction management: from flat to grid transactions
Authors: Ting Wang, Jochem Vonk, Benedikt Kratz, Paul Grefen
Venue: Distributed and Parallel Databases (2008)

Transactions have been around since the Seventies to provide reliable information processing in automated information systems. Originally developed for simple `debit-credit' style database operations in centralized systems, they have moved into much more complex application domains including aspects like distribution, process-orientation and loose coupling. The amount of published research work on transactions is huge and a number of overview papers and books already exist. A concise historic analysis providing an overview of the various phases of development of transaction models and mechanisms in the context of growing complexity of application domains is still missing, however. To fill this gap, this paper presents a historic overview of transaction models organized in several `transaction management eras', thereby investigating numerous transaction models ranging from the classical flat transactions, via advanced and workflow transactions to the Web Services and Grid transaction models. The key concepts and techniques with respect to transaction management are investigated. Placing well-known research efforts in historical perspective reveals specific trends and developments in the area of transaction management. As such, this paper provides a comprehensive, structured overview of developments in the area.
Algorithm 876: Solving Fredholm Integral Equations of the Second Kind in Matlab
Authors: Kendall E. Atkinson, Lawrence F. Shampine
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

We present here the algorithms and user interface of a Matlab program, Fie, that solves numerically Fredholm integral equations of the second kind on an interval [a,b] to a specified, modest accuracy. The kernel function K(s,t) is moderately smooth on [a,b] &times;[a,b] except possibly across the diagonal s&thinsp;=&thinsp;t. If the interval is finite, provides for kernel functions that behave in a variety of ways across the diagonal, that is, K(s,t) may be smooth, have a discontinuity in a low-order derivative, have a logarithmic singularity, or have an algebraic singularity. Fie also solves a large class of integral equations with moderately smooth kernel function on [0,&thinsp;&infin;&thinsp;).
In silico Ligand-Based (LB) and Docking-Based (DB) 3D-QSAR Study of Potent Chk2 Inhibitors
Authors: F. A. Pasha, M. Muddassar, So Ha Lee, Taebo Sim, Jung-Mi Hah, Seung Joo Cho
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Isothiazole carboxamidine compounds are potent ATP competitive Chk2 inhibitors. A series of compounds with Chk2 inhibitory activity were taken from literature and different 3D-QSAR models have been generated with Comparative molecular field analysis (CoMFA) and comparative molecular similarity indices analysis (CoMSIA). In first scheme LB-QSAR models were generated using fully optimized geometries by PM3 approach giving reasonable statistics of CoMFA (q2=0.88, r2=0.96 and r2predictive=0.60) and CoMSIA(q2=0.918 r2=0.99 and r2predictive=0.55). In second and third scheme the ligands 7 docked in to receptor protein (PDB 2CN8). Consequently, two most plausible modes were identified and used as initial templates. The docked conformer based CoMFA model shows good correlation with activity (q2=0.91, r2=0.99 and r2predictive =0.84). Whereas in CoMSIA, the steric and hydrophobic and donor field jointly give a better statistics (q2=0.92 r2=0.99 and r2predictive =0.53). These findings might be helpful to design more potent Chk2 inhibitors.
Automated reverse engineering of hard-coded GUI layouts
Authors: Christof Lutteroth
Venue: Proceedings of the ninth conference on Australasian user interface - Volume 76 (2008)

Most GUIs are specified in the form of source code, which hard-codes information relating to the layout of graphical controls. This representation is very lowlevel, and makes GUIs hard to maintain. We suggest a reverse engineering approach that is able to recover a higher-level layout representation of a hardcoded GUI using the Auckland Layout Model, which is based on the mathematical notion of linear programming. This approach allows developers to use existing code and existing tools, as well as specifications on a higher level of abstraction. We show how existing hard-coded GUIs can be extended to support dynamic layout adjustment with very little effort, and how GUIs can be beautified automatically during reverse engineering.
Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video
Venue: International Workshop on Network and Operating System Support for Digital Audio and Video (2006)

With great excitement, we welcome you to the 16th Annual International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV). The workshop continues to be at the forefront of multimedia research. This year's proceedings include works on Internet gaming, sensor networks, peer-to-peer streaming, mobility, security, and more from researchers in industry and academia. We are honored to have Kevin Jeffay of University of North Carolina, Chapel Hill join us as our keynote speaker. We selected Kevin as recognition of his contributions to the multimedia field, and to NOSSDAV specifically. Kevin has been a long time participant at NOSSDAV workshops including helping to organize the inaugural workshop in 1990. This year, we received 74 submissions from all over the world, and we accepted 23 for publication. The quality of submitted works was very high, making this a great year for NOSSDAV and ensuring its continued status as a highly referenced workshop. Every submitted paper received three reviews and a summary of a separate discussion by the three reviewers. Summaries were written by one of the three reviewers. We are grateful for the hard work of our technical program committee - they did an outstanding job. The participation of stellar researchers on the TPC is a complement to the previous NOSSDAV workshops.
On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates
Authors: R. Smolensky
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The author investigates the question of whether or not a specific Boolean function in n variables can be interpolated by an analytic function in the same variables whose partial derivatives of all orders span a subspace of low dimension in the space of analytic functions. The upper and lower bounds for this dimension yield some weak circuit lower bounds. For a particular function, an Omega (n/log n)-size lower bound is obtained for its computation by a circuit whose gates are symmetric. For the same function an Omega (n) lower bound is obtained for the circuit with mod/sub k/ gates.
Globally convergent real-time differentiation via second order sliding modes
Authors: Alessandro Pisano, Elio Usai
Venue: International Journal of Systems Science (2007)

In this article the design of a new real-time differentiator featuring global convergence properties is considered. Such a problem is tackled by means of a second-order sliding mode differentiator (2-SMD) with adjustable gain and switching logic. Due to its finite-time convergence and relaxed information demand regarding the signal to differentiate, the proposed differentiator appears well suited to be combined with output-feedback controllers. In order to point out the effectiveness and the convergence features of the proposed 2-SMD, some simulations related to a global output feedback stabilisation problem are presented.
Textural Classification of Mammographic Parenchymal Patterns with the SONNET Self-Organizing Neural Network
Authors: Daniel Howard, Simon C. Roberts
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

In nationwide mammography screening thousands of mammography examinations must be processed. Each consists of two standard views of each breast, and each must be examined by the eyes of an experienced radiologist to determine whether or not to recall the subject, or to undergo a closer mammographic, ultrasound and or more invasive examination. The eyes of the very experienced radiologist are alerted to a mammogram that deserves to be recalled and it is submitted that an ability to pick out anomaly of texture in mammography screening is a very important characteristic of successful outcomes in screening. We digitized a large number of pristine mammography images with a highly accurate scanner and processed textural statistics derived from 450 of these images through a SONNET self-organizing neural network to produce an organization of the mammography archive. In this paper we describe some aspects of this work. The best result produced 39 stable classes and produced relatively narrow classes with an average within-class distance of 1.01 whilst retaining a typical average between-class distance of 2.00. The chief features that discriminated class encodings were the two textural features: angular second moment and contrast. The search for multiscale features over a diverse set of mammograms represents a very challenging problem owing to the high dimensionality of the potential search space.
Use of IKONOS satellite data to identify informal settlements in Dehradun, India
Authors: S. Jain
Venue: International Journal of Remote Sensing (2007)

This research highlights the potential of IKONOS satellite data to identify the temporary structures in a part of Dehradun, India. Houses with plastic roof covers reveal dark grey tone in merged IKONOS product, which helps to extract information about the people living below poverty line. Extent of these areas can be quantified using classification technique successfully. Mixing of shadow pixels with temporary structures poses limitation and need further research.
Partial Disclosure of Searchable Encrypted Data with Support for Boolean Queries
Authors: Yasuhiro Ohtaki
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The setting in which Alice wishes to disclose log entries to Bob, only of which contain a keyword specified by him was studied. Suppose that Alice also wishes to keep other entries secret to Bob, even after the disclosure, then how could Alice convince Bob that the undisclosed entries surely do not contain the keyword? Such can be ensured with a variation of searchable encryption scheme; With Alice's help, Bob can search through the encrypted log and specify the entries which contain the keyword. It is a common step to extend a simple search to a search with boolean queries, such as AND and OR. However, it is not simple to disclose entries which contain more than a single keyword, without leaking information on the undisclosed entries. In this paper, a scheme to disclose entries which match a boolean query is proposed. By using a Bloom filter as an encoded index, the scheme reduces the frequencies of comparison and the size of matching data, at the sacrifice of faultlessness.
On the role of timing masking in reliable logic circuit design
Authors: Smita Krishnaswamy, Igor L. Markov, John P. Hayes
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Soft errors, once only of concern in memories, are beginning to affect logic as well. Determining the soft error rate (SER) of a combinational circuit involves three main masking mechanisms: logic, timing and electrical. Most previous papers focus on logic and electrical masking. Here, we develop static and statistical analysis techniques to estimate timing masking through the error-latching window of each gate. Our SER analysis algorithms incorporating timing masking are 10--100x faster than comparable evaluators and can be used in synthesis and layout. We show that 62% of gates identified as error-critical using timing masking would not be identifiable by considering only logic masking. Furthermore, hardening the top 10% of error-critical gates leads to a 43% reduction in the SER. We also propose to decrease the error-latching window of each gate by relocating it such that path lengths to primary outputs are equalized. Our results show that this technique yields 14% improvement in SER with no area overhead.
Precomputation of privacy policy parameters for auditing SQL queries
Authors: S. K. Gupta, Vikram Goyal, Anand Gupta
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

A privacy auditing framework for Hippocratic databases accepts an audit expression and returns all user queries stored in User Access Log (UAL) that satisfy the expression. The audit expression is formed by the audit officer. The expression specifies a target data (sensitive data subject to disclosure review), a time duration and privacy policy parameters related constraints. Determining privacy policy parameters for an audit expression is a tedious task in absence of any assistance to the audit officer, as privacy policy of an enterprise can be complex. We therefore propose and present a malafide intention based framework for their precomputation, which maps a target data description or a malafide intention of an attacker to privacy parameters and hence assists the auditing officer in formation of a precise and unambiguous audit expression. The framework also makes the task of target data specification easier by the use of defined malafide intentions for a domain.
A Novel Outlier Detection Scheme for Network Intrusion Detection Systems
Authors: Komsit Prakobphol, Justin Zhan
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Network intrusion detection system serves as a second line of defense to intrusion prevention. Anomaly detection approach is important in order to detect new attacks. This paper adopted connectivity-based outlier detection scheme from statistical field to detect anomaly behavior in network intrusion detection. We also evaluated the capability of this new approach with the data set from KDD Cup 1999 data mining competition. The results indicated that the connectivity-based scheme outperform current anomaly detection approach in the capability to detect attacks and low false alarm rate.