ppxscal/embedding_network huggingface dataset:
Display-Action-Response Model for User Interface Requirements: Case Study
Authors: Joy Beatty, Mike Alexander
Venue: Proceedings of the Second International Workshop on Requirements Engineering Visualization (2007)

The application of visual modeling techniques to software requirements elicitation and documentation practices holds promise for sizable improvement over traditional requirements management practices. This paper provides a case study of the use of the displayaction- response (DAR) model for capturing and organizing software user interface (UI) requirements visually. We applied the DAR model during a project for a large technology manufacturing company. Based on feedback elicited and received during that project, the strengths and areas for improvement within the model are identified. Areas for future work are identified and discussed.
Self-adjustment of resource allocation for grid applications
Authors: Daniel M. Batista, Nelson L. S. da Fonseca, Flavio K. Miyazawa, Fabrizio Granelli
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Grids involve coordinated resource sharing and problem solving in heterogeneous dynamic environments to meet the needs of a generation of researchers requiring large amounts of bandwidth and more powerful computational resources. The lack of resource ownership by grid schedulers and fluctuations in resource availability require mechanisms which will enable grids to adjust themselves to cope with fluctuations. The lack of a central controller implies a need for self-adaptation. Grids must thus be enabled with the ability to discover, monitor and manage the use of resources so they can operate autonomously. Two different approaches have been conceived to match the resource demands of grid applications to resource availability: Dynamic scheduling and adaptive scheduling. However, these two approaches fail to address at least one of three important issues: (i) the production of feasible schedules in a reasonable amount of time in relation to that required for the execution of an application; (ii) the impact of network link availability on the execution time of an application; and (iii) the necessity of migrating codes to decrease the execution time of an application. To overcome these challenges, this paper proposes a procedure for enabling grid applications, composed of various dependent tasks, to deal with the availability of hosts and links bandwidth. This procedure involves task scheduling, resource monitoring and task migration, with the goal of decreasing the execution time of grid applications. The procedure differs from other approaches in the literature because it constantly considers changes in resource availability, especially network bandwidth availability, to trigger task migration. The proposed procedure is illustrated via simulation using various scenarios involving fluctuation of resource availability. An additional contribution of this paper is the introduction of a set of schedulers offering solutions which differ in terms of both schedule length and computational complexity. The distinguishing aspect of this set of schedulers is the consideration of time requirements in the production of feasible schedules. Performance is then evaluated considering various network topologies and task dependencies.
A 3 - 5 GHz CMOS high linearity ultra wideband low noise amplifier in 0.18µ CMOS
Authors: Long Bu, Joanne E. DeGroat
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

In this paper, the significance of linearity for UWB front-end circuit is discussed. The effects of strong narrow band interferer on UWB signal are investigated. Wideband linearization techniques for UWB LNA are first proposed in this work. A high linearity UWB LNA is designed in TSMC 0.18µ CMOS process The simulation results show that the designed LNA exhibits very high IIP3 (6.9∼13.8 dBm) while maintaining low noise figure (3∼6 dB) over the design frequency range (3-5 GHz).
Rate allocation and network lifetime problems for wireless sensor networks
Authors: Y. Thomas Hou, Yi Shi, Hanif D. Sherali
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Since the objective of maximizing the sum of rates of all the nodes in the network can lead to a severe bias in rate allocation among the nodes, we advocate the use of lexicographical max-min (LMM) rate allocation. To calculate the LMM rate allocation vector, we develop a polynomial-time algorithm by exploiting the parametric analysis (PA) technique from linear program (LP), which we call serial LP with Parametric Analysis (SLP-PA). We show that the SLP-PA can be also employed to address the LMM node lifetime problem much more efficiently than a state-of-the-art algorithm proposed in the literature. More important, we show that there exists an elegant duality relationship between the LMM rate allocation problem and the LMM node lifetime problem. Therefore, it is sufficient to solve only one of the two problems. Important insights can be obtained by inferring duality results for the other problem.
On Determining the Projected Sphere Center and Its Application in Optical Tracking Systems
Authors: Yinqiang Zheng, Yuncai Liu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this article, we explain why and how to identify the projected sphere center, i.e. the projection of the sphere center, in passive-mode based optical tracking systems using infrared reflective spheres as markers. We first present the algebraic representation of the ‘deviation’, defined by their Euclidian distance in the image coordinate system, between the projected sphere center and the center of the elliptical contour of the sphere’s image, and show that the common approximation to substitute the later for the former is not always appropriate in terms of accuracy. Then, we give the projective equation of a sphere in matrix form, thus paving the way for the linear estimation of the projected sphere center. Sufficient experiments indicate that this proposed method enlarges the manipulating volume of the optical tracking system and improves the precision of locating surgical instruments.
Brief Communication: On the relationship between GC content and the number of predicted microRNA binding sites by MicroInspector
Authors: Nicole Davis, Natasha Biddlecom, David Hecht, Gary B. Fogel
Venue: Computational Biology and Chemistry (2008)

MicroRNA GC content and length is believed to play a role in the prediction of putative microRNA targets. MicroInspector was evaluated to determine the extent to which these characteristics of microRNAs play a role in binding site predictive accuracy. A strong bias towards under predicting the number of expected bindings sites for low GC content sequences was observed, especially for microRNAs with
Modeling the determinants of Internet use
Authors: Yu-Li Chen
Venue: Computers Education (2008)

The purpose of the study is to build a model that predicts the level of Internet use by teachers of English as a foreign language in the northern Taiwanese higher education institutions. It examines interactional relationships among variables associated with barriers and issues of technology application as a means of analyzing the extent and the nature of Internet-integration instruction. A multivariate hypothesized model was tested using structural equation modeling to analyze statistically the variables examined in the study. The resulting model is found to have a good statistical fit. Teacher training, classroom pedagogy, and perceived capability have direct effect on Internet use, whereas institutional support, constructivist thinking, beliefs, and attitudes affect Internet use indirectly. These seven variables account for approximately 58.6% of the variance of Internet use. Teacher training appears to be the most dominant determinant of Internet use. More opportunities for professional development focused on technology applications in language instruction are crucial.
Solution of load-flow problem using fuzzy linear regression approach
Authors: Adnan S. Borisly, A. K. Al-Othman
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

This paper presents a new approach to solve the load-flow problem using Tanaka's Fuzzy Linear Regression formulation (FLR). The load-flow model is formulated as a fuzzy linear optimization problem, where the objective is to minimize the sum of the spread of the states, subject to double inequality constraints on each pre-specified active and reactive power to guarantee that the original membership is included in the state membership. Linear programming is employed to obtain the middle and the symmetric spread for every state variable. The estimated middle corresponds to the value of the state. While the symmetric spreads in the membership functions of the state variables represents the uncertainty (vagueness) around the state. The proposed formulation has been applied to various test systems. The outcome is very encouraging and proves that proposed (FLR) is very applicable and shows reliability, accuracy in solving the power-flow problem.
Clustering heteroskedastic time series by model-based procedures
Authors: Edoardo Otranto
Venue: Computational Statistics Data Analysis (2008)

Financial time series are often characterized by similar volatility structures. The detection of clusters of series displaying similar behavior could be important in understanding the differences in the estimated processes, without having to study and compare the estimated parameters across all the series. This is particularly relevant when dealing with many series, as in financial applications. The volatility of a time series can be characterized in terms of the underlying GARCH process. Using Wald tests and the Autoregressive metrics to measure the distance between GARCH processes, it is shown that it is possible to develop a clustering algorithm, which can provide three classifications (with increasing degree of deepness) based on the heteroskedastic patterns of the time series. The number of clusters is detected automatically and it is not fixed a priori or a posteriori. The procedure is evaluated by simulations and applied to the sector indices of the Italian market.
Verification of new generators trip-off scheme for a long transmission system by EMTP
Authors: Danzhen Gu, Qian Ai, Chen Chen, Hui Fu, Changyi Li
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

Long transmission lines will weaken the electric connection between power plants, which have several generators, and power systems, to which the power plant will provide power. In southeastern of china, there exits the same topological structure. The trip-off scheme of generators in power plant is very rigorous, albeit Fixed Compensation (FC) has been used to promote transient stability. After development in these years, the end-point power gird has been reinforced, so the old scheme should be modified. This paper employs Electromagnetic Transients Program (EMTP) as a simulation tool to verify the new scheme with field tests parameters, and hopes the conclusions can give operators some positive suggestions.
Exploring an unknown graph
Authors: X. Deng, C. H. Papadimitriou
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

It is desired to explore all edges of an unknown directed, strongly connected graph. At each point one has a map of all nodes and edges visited, one can recognize these nodes and edges upon seeing them again, and it is known how many unexplored edges emanate from each node visited. The goal is to minimize the ratio of the total number of edges traversed to the optimum number of traversals had the graph been known. For Eulerian graphs this ratio cannot be better than 2, and 2 is achievable by a simple algorithm. In contrast, the ratio is unbounded when the deficiency of the graph (the number of edges that have to be added to make it Eulerian) is unbounded. The main result is an algorithm that achieves a bounded ratio when the deficiency is bounded; unfortunately the ratio is exponential in the deficiency. It is also shown that, when partial information about the graph is available, minimizing the worst-case ratio is PSPACE-complete.
Locating relevant text within XML documents
Authors: Jaap Kamps, Marijn Koolen, Mounia Lalmas
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Traditional document retrieval has shown to be a competitive approach in XML element retrieval, which is counter-intuitive since the element retrieval task requests all and only relevant document parts to be retrieved. This paper conducts a comparative analysis of document and element retrieval, highlights the relative strengths and weaknesses of both approaches, and explains the relative effectiveness of document retrieval approaches at element retrieval tasks.
Proof verification and hardness of approximation problems
Authors: S. Arora
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The class PCP(f(n),g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that used O(f(n)) random bits, queries O(g(n)) bits of its oracle and behaves as follows: If x in L then there exists an oracle y such that the machine accepts for all random choices but if x not in L then for every oracle y the machine rejects with high probability. Arora and Safra (1992) characterized NP as PCP(log n, (loglogn)/sup O(1)/). The authors improve on their result by showing that NP=PCP(logn, 1). The result has the following consequences: (1) MAXSNP-hard problems (e.g. metric TSP, MAX-SAT, MAX-CUT) do not have polynomial time approximation schemes unless P=NP; and (2) for some epsilon >0 the size of the maximal clique in a graph cannot be approximated within a factor of n/sup epsilon / unless P=NP.
Multiple-implementation testing for XACML implementations
Authors: Nuo Li, JeeHyun Hwang, Tao Xie
Venue: Proceedings of the 2008 workshop on Testing, analysis, and verification of web services and applications (2008)

Many Web applications enhance their security via access-control systems. XACML is a standardized policy language, which has been widely used in access-control systems. In an XACML-based access-control system, policies, requests, and responses are written in XACML. An XACML implementation implements XACML functionalities to validate XACML requests against XACML policies. To ensure the quality of an XACML-based access-control system, we need an effective means to test whether the XACML implementation correctly implements XACML functionalities. The test inputs of an XACML implementation are XACML policies and requests. The test outputs are XACML responses. This paper proposes an approach to detect defects in XACML implementations via observing the behaviors of different XACML implementations for the same test inputs. As XACML has been widely used, we can collect different XACML implementations, and test them with the same XACML polices and requests to observe whether the different implementations produce different responses. Based on the analysis of different responses, we can detect defects in different XACML implementations. We show the feasibility of the proposed approach with a preliminary study on three XACML implementations.
Third-party Copyright Liability after Grokster
Authors: Alfred C. Yen
Venue: Information and Communications Technology Law (2007)

This Article, the original version of which was published in the Minnesota Law Review (vol. 91, pp. 184 - 240), studies the construction of third party copyright liability after the recent Supreme Court case Metro-Goldwyn-Mayer Studios Inc. v. Grokster, Ltd. This inquiry is important because third party copyright liability has become a controversial area of law that affects the viability of entire industries. Unfortunately, the law governing third party copyright liability is unclear. Grokster involved a claim of third party liability against defendants whose technology supported the sharing of music over the Internet, and it represents the Supreme Court's attempt to bring coherence to the relevant law. Grokster is a difficult case to understand. It added a new cause of action for inducement to the law of third party copyright liability, but the meaning of inducement is unclear, especially when one considers the incoherent structure of pre-Grokster law. Future courts will find it challenging to interpret Grokster in a way that creates an effective, coherent structure for the law third party copyright liability. This Article was among the first to comprehensively analyze Grokster and its effect on the theory and construction of third party copyright liability in the United States. This effort includes a survey of pre-Grokster law, the application of tort theory to expose the structure of conflicts in the law, an explanation of the rationale and implications of Grokster, and the construction of a coherent framework for third party copyright liability. The Article concludes that Grokster made important theoretical and practical choices about the law that are appropriately sensitive to the costs and benefits of third party copyright liability.
The Receptor Guided 3D-QSAR Method is a Powerful Tool to Design More Potent IGF-1R Inhibitors
Authors: Muhammad Muddassar, F. A. Pasha, Hwan Won Chung, Kyung Ho Yoo, Chang Hyun Oh, Seung Joo Cho
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Insulin-like growth factor 1 receptor (IGF-1R) has proven as a key oncology target. Recently derivatives of 1,3-disubstituted-imidazo[1,5-] pyrazine have been found as potent IGF-IR inhibitors. Three dimensional quantitative structure activity relationship (3D-QSAR) studies have been performed for this series of compounds and validity of 3D-QSAR models compared for two major alignment schemes, namely ligand-based and receptor-guided alignment schemes. As a result, receptor guided alignment schemes yielded better 3D-QSAR models for both comparative molecular field analysis (CoMFA) (q2=0.53, r2=0.95) and comparative molecular similarity indices analysis (CoMSIA) (q2=0.51, r2=0.86). This might arise from the more accurate inhibitor alignment using structural information of the active site. Therefore the receptor-guided 3D-QSAR may be helpful to design more potent IGF-1R inhibitors as well as to understand the inhibitor binding.
Probabilistic relaxation labelling using the Fokker-Planck equation
Authors: Hongfang Wang, Edwin R. Hancock
Venue: Pattern Recognition (2008)

In this paper we develop a new formulation of probabilistic relaxation labelling using the theory of diffusion processes on graphs. Our aim is to tackle the problem of labelling objects consistently and unambiguously using information concerning label consistency and initial label probabilities. We abstract this problem using a support graph with each graph node an object-label assignment. Initial object-label probabilities then evolve across the graph under the governance of the Fokker-Planck equation in terms of an infinitesimal generator matrix computed from the edge weights of the support graph. In this way we effectively kernelise probabilistic relaxation. Encouraging results are obtained in applying the new relaxation process in the applications of scene labelling, data classification, and feature correspondence matching.
Obstacles in Worst-Case Execution Time Analysis
Authors: Raimund Kirner, Peter Puschner
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

The analysis of the worst-case execution time (WCET) requires detailed knowledge of the program behavior. In practice it is still not possible to obtain all needed information automatically. In this paper we present the current state of the art of WCET analysis and point to the main problems to be solved. The most eminent problem is the state problem, i.e., the precise determination of possible processor states at different program locations. The path problem refers to the fact that current tools are not able to calculate all (in)feasible paths automatically. We discuss how the main open problems manifest themselves in static and in measurement-based WCET analysis methods.
RotBoost: A technique for combining Rotation Forest and AdaBoost
Authors: Chun-Xia Zhang, Jiang-She Zhang
Venue: Pattern Recognition Letters (2008)

This paper presents a novel ensemble classifier generation technique RotBoost, which is constructed by combining Rotation Forest and AdaBoost. The experiments conducted with 36 real-world data sets available from the UCI repository, among which a classification tree is adopted as the base learning algorithm, demonstrate that RotBoost can generate ensemble classifiers with significantly lower prediction error than either Rotation Forest or AdaBoost more often than the reverse. Meanwhile, RotBoost is found to perform much better than Bagging and MultiBoost. Through employing the bias and variance decompositions of error to gain more insight of the considered classification methods, RotBoost is seen to simultaneously reduce the bias and variance terms of a single tree and the decrement achieved by it is much greater than that done by the other ensemble methods, which leads RotBoost to perform best among the considered classification procedures. Furthermore, RotBoost has a potential advantage over AdaBoost of suiting parallel execution.
Unintended consequences of computer-mediated communications
Authors: Laurie McAulay
Venue: Behaviour & Information Technology (2007)

This paper explores the unintended consequences of computer-mediated communications by adopting a typology suggested by the sociologist Robert Merton. The typology is used to present a thematic analysis drawn from the literature on computer-mediated communications and two new studies. The first study considered the impact of computer-mediated technology on communicative behaviour in general, and involved 22 managers working in locations in the UK and USA. The second study focused on electronic mail and drew upon the responses of 70 managers. The paper suggests that Merton's analysis of unintended consequences provides a framework which expands our ability to explain issues associated with the implementation of computer-mediated communications and discusses intervention and laissez-faire as two implicit responses evident in the recent literature.
The complexity of parallel prefix problems on small domains
Authors: S. Chaudhuri
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors study the complexity of some prefix problems in the CRCW PRAM model. The main result is an Omega ( alpha (n)) lower bound for chaining, matching a previous upper bound and solving an open problem. They give reductions to show an Omega ( alpha (n)) lower bound on the complexity of the prefix maxima and range maxima problems even when the domain is (1,...,n). An interesting consequence is that prefix maximum is strictly harder than simple maximum. They also give a reduction to show an Omega ( alpha (n)) lower bound on a parenthesis matching problem, matching the upper bound. No lower bounds were previously known for any of these problems. The lower bounds contribute to the study of very fast parallel algorithms by introducing techniques for proving lower bounds for small domain problems.