ppxscal/embedding_network huggingface dataset:
Static Members and Cycles in Java Software
Authors: Hayden Melton, Ewan Tempero
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

The static modifier is a convenient way to make class members "global" in object-oriented software systems. Given this, we wondered if static members significantly contribute to the long dependency cycles among the classes that we observed in a previous empirical study of Java software. In this paper, we examine 81 open source Java applications. We find empirical evidence that classes that declare a non-private static field or method that is accessed from within another class are likely to be involved in dependency cycles.
Structured Programming: Agony and/or Ecstacy
Authors: J. R. Town
Venue: Computer (1975)

It has been observed, and perhaps with good reason, that structured programming is a big pain in the neck. And yet, those who profess to have tried it also claim they like it. Furthermore, they insist they will never do without it again. Is it possible that the nay-sayers and the professed believers are talking about the same thing? Probably not. There is at least a subtle distinction which lies somewhere near the heart of the continuing structured programming controversy. 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
Program Specification Applied to a Text Formatter
Authors: M. S. Feather
Venue: IEEE Transactions on Software Engineering (1982)

Presentation of the fonnal specification of a small text formatter illustrates an approach to the construction of formal specifications. The key features of this approvach are described, and their beneficial influence on the construction and organization of specifications of tasks, especially those for which no concise descriptions are possible, are discussed. The intent is that in addition to serving as formal descriptions of tasks, such specifications will be of use in the processes of verification, development, and maintenance of their implementations.
Towards adding probabilities and correlations to interval computations
Authors: Daniel Berleant, Martine Ceberio, Gang Xiang, Vladik Kreinovich
Venue: International Journal of Approximate Reasoning (2007)

The paper is a continuation of our previous work towards the use of probability information in interval computations. While in the previous work, bounds on the first order moments are taken into account, the contribution of this article is to deal with correlations. Specifically, in this paper, we develop a new method that takes into account both correlation among measured parameters and bounds on their expected values when doing interval computation.
Logical nano-computation in enzymatic reaction networks
Authors: Martin Stetter, Bernd Schürmann, Michael Hofstetter
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

We propose a way to implement logical operations at the nanoscale by means of enzymatic reaction networks such as kinase-phosphatase networks. For this we suggest and analyze a small recurrent enzymatic reaction network with only four molecule species which contains a positive and a double negative feedback loop. The system is shown to have bistable regimes, the phase boundaries of which are analytically determined. We show that, by adjustment of the total concentrations of the species relative to the range of concentrations of the input substances, it is possible to flexibly implement logical AND, OR, and NOT gates with variable input sensitivity and output dynamic range. Finally, a realistic kinase-phosphatase implementation of the circuit is provided.
Analytic Technique of Drillstem Failure Based on Support Vector Machine Technology and Clustering Theory
Authors: Tie Yan, Xue-liang Bi, Chang-jiang Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

An analyzed model of drillstem failure reason has been constructed based on SVM technology and clustering analysis theory in this paper, and the optimal kernel function and several appropriate factors also have been obtained by training the sample data. Using the drillstem failure data come from Daqing oilfield, according to the requirements of the model, the data have been pretreated and analyzed, finally the essential reasons for the drillstem failure here have been obtained successfully; what's more, six precautionary measures have been pointed out to solve the very problems in this paper. As showing in the paper, the new model is realer and more reliable to calculate and analyze the drillstem failure in drilling engineering, and it has been proved to provide a new technique to enrich the basic theory of drilling engineering.
Recognition of Unstained Live Drosophila Cells in Microscope Images
Authors: Marko Tscherepanow, Nickels Jensen, Franz Kummert
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

In order to localise tagged proteins in living cells, the surrounding cells must be recognised first. Based on previous work regarding cell recognition in bright-field images, we propose an approach to the automated recognition of unstained live Drosophila cells, which are of high biological relevance. In order to achieve this goal, the original methods were extended to enable the additional application of an alternative microscopy technique, since the exclusive usage of bright-field images does not allow for an accurate segmentation of the considered cells. In order to cope with the increased number of parameters to be set, a genetic algorithm is applied. Furthermore, the employed segmentation and classification techniques needed to be adapted to the new cell characteristics. Therefore, a modified active contour approach and an enhanced feature set, allowing for a more detailed description of the obtained segments, are introduced.
Surrogate Cost Techniques in Countable Classification
Authors: S. L. Hantler
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

We study the problem of classification when the set of classes is a -compact metric space, by means of surrogate cost minimization. We give a natural sufficient condition for the optimal classifier to be of the form T f when the func- tion f minimizes a surrogate for the actual loss defined on pairs of classes. Sequences of functions whose expectations converge to the infimum of the expectations of all such func- tions can then be found by minimizing the sample averages of training sets. In particular, we show how to use surrogate cost minimization when the set of classes is countable and give an example. Keywords: Optimal estimation, classification, surrogate cost
Cross-layer modeling of capacity in wireless networks: Application to UMTS/HSDPA, IEEE802.11 WLAN and IEEE802.16 WiMAX
Authors: Mariana Dirani, Chadi Tarhini, Tijani Chahed
Venue: Computer Communications (2007)

We investigate in this work the cross-layer modeling of the capacity of wireless systems in the presence of two types of flows: streaming and elastic, under a dynamic configuration wherein users join the system and leave it after a finite duration. For streaming traffic, this duration is independent of the resources these flows get from the network. This is not the case of (TCP-based) elastic traffic whose flows have a service rate that is proportional to the share of resources each flow gets from the network, as obtained in a cross-layer manner from lower layers. We focus in this paper on the MAC/PHY layer and consider three different types of scheduling: CDMA with opportunistic scheduling, used in UMTS/HSDPA, CSMA/CA in use in IEEE802.11 WLAN and OFDMA as in IEEE802.16 WiMax.
Multimodal Optimization by Decomposition of the Search Space in Regions
Authors: Juan J. Flores, Julio Barrera, Felix Calderon
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

A multimodal function is a function with more than one optimum. This work proposes a method for automatic deter- mination of regions of the search space of a given function. Those regions guarantee enclose one an optimum. Based on an initial sampling of the search space, an incremental convex hull algorithm is used to incrementally grow regions that enclose one optimum. After applying the method we can use any optimization algorithm on each of the deter- mined region; comparing with genetic algorithms for multi- modal functions, the proposed method eliminates the use of parameters like radius in fitness sharing.
Modeling and Simulation of Extended Fuzzy Timing Workflow Nets Based on Possibility Theory
Authors: Yanhua Du, Yushun Fan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

According to the practical need for uncertain time modeling and analysis in WfMSs, based on possibility theory, the paper firstly introduces fuzzy time and puts forward the concept of Extended Fuzzy Timing Workflow Nets (EFTWFN). Then, we present the modeling method to construct the EFTWFN models of concurrent workflows with resource constraints. Subsequently, the simulation of fuzzy time and transition firing possibility of EFTWFN models are discussed, and the simulation method of EFTWFN models is proposed. In the end, our modeling and simulation methods are validated by explaining a real example of manufacturing enterprise with CPN Tools.
Girls Teaching Girls: Free-Choice Collaborative Learning Through Social Computing
Authors: Matthew R. Peters
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

This extended abstract is a brief overview of a dissertation project involving collaborative learning through debugging tasks and the participatory design of instructional activities in computing for young girls.
Managing software development in globally distributed teams
Authors: Michael A. Cusumano
Venue: Communications of the ACM (2008)

Surveying the basic elements needed for globally distributed teams to function smoothly and efficiently.
Patterns, symmetry, and symmetry breaking
Authors: Liping Zhao
Venue: Communications of the ACM (2008)

Explaining software patterns by breaking the symmetry created by programming languages.
Special Feature: Data Structuring Facilities for Interactive Videotex Systems
Authors: F. W. Tompa
Venue: Computer (1981)

Replacing the underlying tree structure with an array of pages and removing the visibility of page identifiers will improve videotex páge organization and access.
Preventing Software Piracy
Authors: C. N. Mooers
Venue: Computer (1977)

For the professional software designer, the hobby and home computer movement has created a curious and at times painful dilemma. On one hand, the movement represents a large and growing market-one in obvious need of professionally developed software. On the other hand, that same market offers a very narrow profit margin. Worst of all, it seems to be characterized by a kind of anarchic morality in which all software is fair game for outright rip-off. It may come as a surprise to some that the offenders are not only individuals; among them, in fact, are a few of our largest and most highly respected corporations.
A New Approach for Function Approximation Based on Adaptive Particle Swarm Optimization
Authors: Fei Han, Qing-Hua Ling
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In this paper, a new approach for function approximation problem is proposed to obtain better generalization performance and faster convergent rate. It is well known that gradient-based learning algorithm for feedforward neural networks (FNN) such as backpropagation (BP) algorithm is apt to be trapped in local minima, which leads to worse generalization performance and slower convergence rate. Therefore, in the new approach, first, adaptive particle swarm optimization (APSO) is applied to train network to search global minima. Second, with the trained weights produced by APSO, the network is trained with a constrained learning algorithm (CLA). Moreover, the CLA in the new approach can improve convergence capability by decreasing the input-to-output mapping sensitivity of the network and penalizing the high frequency component in the training data. Due to combined APSO with the CLA, the new approach has better generalization performance and convergence rate. Finally, simulation results are given to verify the efficiency and effectiveness of the proposed learning approach.
A Study of Walking Motion for Game Character with a Player's Emotional Factors Applied
Authors: Hyunah Kang, Mijin Kim
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

From several commercialized games the technique of changing facial expressions is imported, and a design method of a game character for the player's empathy is expected to be diversified in the future. In this paper, as a design method of a game character for the player's empathy, this thesis makes walking motion for the game character applied with "human-emotion" factors as statistics variation of a game character in RPG genre. After this thesis implements analyzed emotions of human facial expression and walking motions applied with emotion in examples of character animation theory, this thesis divides walking motion applied with human-emotion factors into 8 types through relationship to statistics factors in RPG genre. And then these are applied to a knight character, which has the most similarity with human's physical feature of the game characters in RPG genre, and makes walking motion as variable statistics. As a game player controls the game character applied with "human-emotion' factors, the effect of the player's empathy about the game character becomes higher, and the level of immersion in game play is also expected to increase.
Benefits and challenges of new mobile service development in R&D network
Authors: Marko T. Heikkinen, Johanna Still
Venue: Personal and Ubiquitous Computing (2008)

The competitive environment of organizations has changed remarkably in line with rapid technological development and globalization of markets. This has lead to a situation where the amount of resources and knowledge needed in the development of new offerings has become overwhelming for a single organization. Consequently, nowadays organizations--both commercial and non-commercial--are performing research and development activities in networks consisting of multiple types of actors. This is also the case in industries developing new services for consumers' mobile handhelds. This paper introduces a network view to new mobile service development and argues that a thorough understanding of acting in the network environment is a pre-requisite for successful mobile service creation. This viewpoint is emphasized in an information-rich case study, which describes the formation and operations of a network, which created a new mobile service for a sports team.
Adaptive subcarrier and bit allocation in OFDMA systems supporting heterogeneous services
Authors: Guanding Yu, Zhaoyang Zhang, Peiliang Qiu
Venue: Wireless Personal Communications: An International Journal (2007)

Orthogonal Frequency Division Multiple Access (OFDMA) is an efficient multiple access method for the future wireless systems. This paper studies the adaptive subcarrier and bit allocation problem in OFDMA systems to support heterogeneous services. The goal of the considered resource optimization technique is to maximize the total system throughput under the overall transmit power constraint while guaranteeing the QoS requirement of realtime users and supporting proportional fairness among non-realtime users. First, we introduce a Rate Adaptive (RA) resource allocation algorithm for non-realtime users and a Margin Adaptive (MA) algorithm for realtime users. Then, based on the previous algorithms, a novel algorithm is proposed to allocate the resource to both classes of users, which makes an efficient tradeoff between the resource usage of realtime users and non-realtime users. The algorithm is locally optimal solution provided that the MA and RA algorithms are utilized. Also, to reduce the computational complexity, a suboptimal method based on the balancing of the average power per subcarrier is also introduced. Monte Carlo simulation results show that all the proposed algorithms outperform the existing counterparts. The results also show that the suboptimal method for heterogeneous services can efficiently reduce the computational complexity at the cost of very little performance degradation.
Experiments with Highleyman's Data
Authors: J. H. Munson, R. O. Duda, P. E. Hart
Venue: IEEE Transactions on Computers (1968)

Abstract The results of three experiments with Highleyman's hand-printed characters are reported. Nearest-neighbor classification is used to explain the high error rates (42 to 60 percent) obtained by general statistical procedures. An error rate of 32 percent is obtained by preceding piecewise-linear classification by edge-detecting preprocessing. The minimum human error rate is estimated, and suggested as a performance standard.
A finite element model for the simulation of hydrometra
Authors: St. Weiss, M. Bajka, A. Nava, E. Mazza, P. Niederer
Venue: Technology and Health Care (2004)

The behaviour of the human uterus under an internal (intracavital) pressure of 150 mm Hg (20 kPa) was modelled. The application of such an intracavital or intrauterine pressure corresponds to the procedure which is performed at the beginning of hysteroscopy (hydrometra). Homogenous, isotropic material laws were implemented in a three dimensional, finite element model. The volume of the distended uterine cavity was calculated with different parameters obtained from in vivo aspiration experiments on human uteri as well as from ex vivo tensile tests on rabbit uteri for comparison purposes. The calculated results were in general agreement with in vivo measurements of hydrometra performed at the University Hospital of Zurich.
Metaheuristic downhill simplex method in combinatorial optimization
Authors: L. F. Gulyanitskii, I. V. Sergienko
Venue: Cybernetics and Systems Analysis (2007)

The concept of combinatorial objects is formalized. It allows strict definition of a combinatorial optimization problem (COP). An efficient metaheuristic method to solve COPs (H-method) is considered. It includes stochastic local search algorithms as a built-in procedure. A parallel implementation of the H-method is set forth and analyzed. The results from a numerical experiment and solution of some well-known COPs on personal computers and on the SKIT cluster supercomputer are presented.
ECPD Accreditation Guidlines Preliminary Computer Science and Engineering Programs
Venue: Computer (1978)

As a constituent member organization of the Engineers' Council for Professional Development, the IEEE provides one or more members to ECPD accreditation teams sent to evaluate engineering programs at institutions throughout the US. The policies, method of evaluation, and general criteria for accreditation are described in "Objectives and Procedures for Accrediting Programs in Engineering in the United States," published in the latest Annual Report of ECPD.* The guidelines set forth below, compiled by a subcommittee of the IEEE Educational Activities Board, are intended to supplement the ECPD publication in order to assist the IEEE visitor in evaluation of computer science and engineering programs.** 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 Hybrid BIST Scheme for Multiple Heterogeneous Embedded Memories
Authors: Li-Ming Denq, Cheng-Wen Wu
Venue: Proceedings of the 16th Asian Test Symposium (2007)

It is common that an SOC contains hundreds or even thousands of heterogeneous embedded memories. Many of these embedded memories have wide data words, leading to high routing penalty from the BIST circuits. Previous BIST schemes solve the problem using serial interface, e.g., based on the IEEE 1500 architecture and novel scan approaches, to reduce the routing area overhead. However, serial approaches do not allow at-speed test and diagnosis, and are very slow. In this paper, we propose a hybrid BIST architecture that reduces the routing penalty, while allowing at-speed test and diagnosis of the memory cores. The test time is close to that of a typical parallel BIST method. Experimental results show that the proposed BIST can effectively reduce the area overhead.
Contractual barriers to transparency in electronic voting
Authors: Joseph Lorenzo Hall
Venue: Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology (2007)

We analyze a data set of 55 contracts between state and local election jurisdictions and voting system vendors for transparency-inhibiting terms and provisions. We discuss the advantages and disadvantages of certain provisions and make recommendations that jurisdictions can follow to better support transparency in the elections process.
Using Trust Metric to Detect Malicious Behaviors in WSNs
Authors: Zhang Mingwu, Yang Bo, Qi Yu, Zhang Wenzheng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In order to enhance transaction security in wireless sensor networks, it is important to evaluate nodes' trustworthiness. Malicious nodes may strategically alter their behavior for concealing malicious behavior and prompting their reputation. Collusive or malicious behaviors might change the system trust entropy due to their voting ratings are biased. In this paper, according to the basic theory of Shanon informational entropy, the trust entropy and standard structure entropy of distributed entities trustworthiness evaluation are proposed, which be used to detect whether the malicious behavior happened in sensor systems. By simulating experiment, it can detect whether malicious behavior happened where the system is attacked either maliciously, randomly or collusively. Especially in collusive attack, the malicious nodes will boost their clique reputation and drop honest nodes by bad mouthing attack.
A Programmable Fully-Integrated GPS receiver in 0.18µm CMOS with Test Circuits
Authors: Mahta Jenabi, Noushin Riahi, Ali Fotowat-Ahmady
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

A 0.18¿m single chip GPS receiver with 19.5 mA power consumption is implemented in 6.5 mm2. A serial input digital control with additional testing structure not adding more than 4% to the Si area are used to the actual RF circuits in case of problems minimizing the number of Si runs.
Layer-Encoded MBMS Channel Allocation for Mobile Networks
Authors: Ai-Chun Pang, Shun-Ren Yang, ChenKuang Yang
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

The multimedia broadcast/multicast service (MBMS) originally proposed by UMTS supports the delivery of multimedia streams to a group of mobile subscribers. With the heterogeneity of device capability and the variety of subscriber preference, an MBMS source has to provide multiple levels of service quality to its group members. To achieve this, it is essential to adopt the layer-encoding (i.e., scalable-coding) technique to encode multiple layers of multimedia data. This paper investigates the distribution of layer-encoded multimedia data for UMTS MBMS. Specifically, we propose a new channel allocation scheme for layer-encoded MBMS. The performance of our scheme is evaluated through our simulation model.