Search

Neste trabalho, investiga-se a distribuição dos sufixos -ção e -mento nos dialetos de Porto Alegre, Florianópolis e Curitiba. A partir de estudos anteriores sobre tais afixos, analisaram-se fatores de natureza linguística, como tonicidade (oxítona, paroxítona e proparoxítona), número de sílabas, tipos de verbos (de estado, de ação, de processo e de ação-processo), características da base (se com alomorfia ou sem, por exemplo), prefixação, sufixação, terminações, entre outros. Analisaram-se, também, fatores de natureza extralinguística, como escolaridade (primário e secundário), sexo (feminino e masculino), faixa etária (mais de 50 anos e menos de 50 anos) e localidade (Porto Alegre, Florianópolis e Curitiba). Para a investigação, fez-se uso de dados de fala extraídos de 46 entrevistas do projeto Variação Linguística na Região Sul do Brasil – VARSUL e de um teste de produtividade baseado em pseudopalavras propostas pela pesquisadora, aplicado a 31 informantes. Para a análise quantitativa dos resultados, foram utilizados os programas que compõem o pacote VARBRUL 2S, a fim de se levantarem as frequências de uso de cada um dos afixos envolvidos. A análise dos resultados mostrou que, de forma geral, -ção é o sufixo preferido na alternância de uso entre -ção e -mento. Além disso, observou-se que fatores como tipo de verbo, conjugação, algumas terminações, assim como a iteratividade ou o número de sílabas podem influenciar o falante em sua escolha pelo uso de um sufixo e não de outro. Os achados dessa pesquisa confirmam grande parte de nossas questões e permitem que se observe em que medida esse dialeto se iguala ou não a outros já estudados. Para tanto, usamos como fonte, especialmente, Aronoff (1976), Basilio (1980, 1996, 1999, 2000, 2011), Villalva (1986), Sandmann (1996), Rocha (1999, 2008), Monteiro (2002), Maroneze (2005), Bastos (2006, 2012), Grodt (2009) e Souza (2010). In this paper, the distribution of the suffixes “-ção” and “mento” are investigate, considering the dialects used in Porto Alegre, Florianópolis and Curitiba. As of previous studies about such suffixes, linguistic nature factors were analyzed, such as tonicity (oxytone, paroxytone and proparoxytone), number of syllables, typos of verbs (stative verbs, action verbs, process verbs and action-process verbs), characteristics of bases (with allomorph or without it, for instance), prefix and suffix word formation, termination, among others. Factors of extralinguistic nature were also analyzed, such as schooling (primary and secondary), sex (feminine and masculine), age-group (older than 50 and younger than 50) and locality (Porto Alegre, Florianópolis and Curitiba). For the investigation, speaking data extracted from 46 interviews of the project called Linguistic Variation in the South Region of Brasil – VARSUL – were used, as well as a test of productivity based on pseudo words proposed by the researcher, applied to 31 informants. For the quantitative analyses of the results, the programs which form the VARBRUL 2S package were used, in order to obtain the frequencies of usage of each affix involved. The analysis of the results has shown that, in general, “-ção” is the favorite suffix in the alternance of usage between “-ção” and “-mento”. Besides, factors like type of verb, conjugation, some terminations were verified, as well as the iteration or the number of syllables which can influence the speakers in their choice for the usage of a suffix over others. The findings of this research confirm a large part of our hypotheses and allow us to observe in what extent this dialect equalizes or not to others already studied. For this purpose, we especially used, as our bibliographic source, Aronoff (1976), Basilio (1980, 1996, 1999, 2000, 2011), Rocha (1999, 2008), Villalva (1986), Sandmann (1996), Monteiro (2002), Maroneze (2005), Bastos (2006,2012), Grodt (2009) and Souza (2010).

Para luchar contra los desastres naturales, especialmente los incendios forestales, se quiere hacer uso de las técnicas de visión por computador y las nuevas tecnologías en general de modo que se pueda geolocalizar elementos detectados sobre el terreno. Una posible manera de realizar esto es determinar a qué zona o punto geográfico corresponde una imagen tomada por un vehículo aéreo no tripulado (UAV), emparejando esta imagen con un ortomapa del cual ya sabemos las coordenadas de cada pixel. Para ello se quiere evaluar si la técnica estándar usada para emparejar dos imágenes sirve para emparejar una imagen con un ortomapa. En este artículo se describe el estado del arte actual de los detectores y descriptores de características locales, describiendo y posteriormente evaluando los más utilizados. Por último se analizan los resultados obtenidos y se determina, tanto para los detectores como para los descriptores, cual se adapta mejor al problema planteado. To combat natural disasters, especially forest fires, we want to use computer vision techniques and the new technologies in general in order to geolocate ground elements. One way to do it is determine wich área or geographic point corresponds an image taken by an unmanned aerial vehicle (UAV), matching this image with an ortomapa which we know the coordinates of each pixel. For this purpose we want to review if the standard technique used to match two images allow to match an image whit an ortomapa. This paper describes the local features detectors and descriptors state of the art, describing and subsequently evaluating the most used. Finally the results are analized and determined for both detectors as descriptors, which is better suited to the proposed problem. Per lluitar contra els desastres naturals, especialment els incendis forestals, es vol fer us de les tècniques de visió per computador i les noves tecnologies en general de manera que es pugui geolocalitzar elements detectats sobre el terreny. Una possible manera de realitzar això és determinar a què zona o punt geogràfic correspon una imatge presa per un vehicle no tripulat (UAV), aparellant aquesta imatge amb un ortomapa del qual ja coneixem les coordenades de cada pixel. Per aquest motiu es vol avaluar si la tècnica estàndard que es fa servir per emparellar dues imatges serveix per emparellar una imatge amb un ortomapa. En aquest article es descriu l'estat de l'art actual dels detectors i descriptors de característiques locals, descrivint i seguidament avaluant els més utilitzats. Per últim s'analitzen els resultats obtinguts i es determina, tant pels detectors com pels descriptors, quin s'adapta millor al problema plantejat.

The purpose of this research paper is to clarify the actual condition of the delay of block formation in housing estate of slope ground developed by the land readjustment business. Therefore, we selected 14 districts developed in slope ground for detached house as a research object from 51 districts where the land readjustment business ended after 1975 approximately in the Fukuyama City, while we considered the use zoning and the development scale. Then, we secularly examined the number of constructed lot, not constructed lot, change lot with moving out and lot for store, cram school and so on which arose naturally in the block, and studied the delay of development from the viewpoint of the rate of vacancy, the spontaneous development facility and so on. (1) The plotting of the lot from 25 to 35 per 1 ha is possible, when the improvement of public facility is not considered. The other, it remains the plotting of the lot from 15 to 25 per 1 ha even in the case over 40ha, when the improvement of public facility is considered. (2) The rate of not constructed lot, which shows the delay of development of housing estate by the land readjustment business, is around 10%, even if it passed 30 years after the business ended. (3) The case from 10% to 15% is approximately the most part on the proportion, which unused ground (farmland) in which the building has not been built, occupies for all plot numbers. However, the azimuth of slope influences the difference between the numerical value. (4) The lot of the favorable condition such as the good of the sunshine is easy to remain as an unused site.

Let H be a graph with κ1 components and κ2 blocks, and let G be a minor-minimal 2-connected graph having H as a minor. This paper proves that |E(G)|−|E(H)|⩽α(κ1−1)+β(κ2−1) for all (α,β) such that α+β⩾5,2α+5β⩾20, and β⩾3. Moreover, if one of the last three inequalities fails, then there are graphs G and H for which the first inequality fails.

Polymeric maleimido–quaternary ammonium (QA) compounds have been shown to function as molecular tape measures when covalently tethered to external cysteine residues of a Shaker K+ channel (Blaustein R.O., P.A. Cole, C. Williams, and C. Miller. 2000. Nat. Struct. Biol. 7:309–311). For sufficiently long compounds, the cysteine–maleimide tethering reaction creates a high concentration, at the channel's pore, of a TEA-like moiety that irreversibly blocks current. This paper investigates a striking feature of the maleimide–cysteine tethering kinetics. Strong blockers—those that induce substantial levels (>80%) of irreversible inhibition of current—react with channel cysteines much more rapidly than weak blockers and, when delivered to channels with four cysteine targets, react with multiexponential kinetics. This behavior is shown to arise from the ability of a strong blocker to concentrate its maleimide end near a channel's cysteine target by exploiting the reversible pore-blocking affinity of its QA headgroup.

It has been revealed that Android devices and iPhones track their users by default. This is not some attempt at spying on users, but an attempt at getting as much data as possible by crowdsourcing information. It’s a prime example of data correlation and how the users aren’t really the targets of this massive data gathering operation., This paper was written in 2014 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20141002 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

In recent years, the popularity of porous concrete block has grown in the industry but there is still lack of knowledge on how and when porous concrete block is appropriate. The objectives of this paper is to presents and study a pre-view of porous concrete block used for pavement by using different size of aggregate and effect of permeability on porous concrete block during heavy raining season. Large volume of surface water runoff needs to handle during this season to prevent water ponding on the roads surface. Porous concrete blocks has proved to be effective and meet most of the requirement to solve the problem. The investigation on the different size of aggregate use in porous concrete block and its performance is very limited. However, further researches are ongoing by the authors to study performance of porous concrete block for pavement in mechanical and chemical properties will evaluate. Various tests were carried out to evaluate durability of porous concrete block made with 10 to 8 mm and 8 to 5 mm size of aggregate in concrete mix. On the other hand, the results of compressive strength, porosity and clogging test from previous investigation were present in this study.

Over the course of renewing or updating their IT and network infrastructure many clients will make extensive use of IT infrastructure and network virtualization. During this process, there is a need to address the rising Intranet threat level. The traditional perimeter security paradigm alone is no longer sufficient. A solution is in demand that allows segmenting the site network into many (typically 5 to some 100 in extreme cases) network zones. The traffic between these zones should be controlled in such a way that unwanted traffic is blocked and allowed traffic is intelligently analyzed to eventually stop malware from spreading. It should also stop attacks and attempts at using backdoors or remote control of the system., This paper was written in 2014 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20140821 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

This article gives you an overview of our analysis and should easily allow you to understand the steps and join in on the work. JSXBIN is a concatenation of JSX and BIN. The first part, JSX, is the default file extension for Adobe ExtendedScript files. That's basically an extended version of JavaScript. Adobe's ExtendScript Tookit (ESTK) is an editor to create these scripts and is used in the Adobe Creative Suite (CS). The BIN part of the extension probably refers to binary., This paper was written in 2014 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20140515 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

This is the tale of how I got locked out of my Twitter Account. During the digital journey of me trying to get it back, I discovered important safety rules when dealing with Twitter, how their system has security gaps leading to the lockout being useless and how Twitter manages to keep their user numbers growing. So here’s an account of how the little blue bird goes about doing things., This paper was written in 2014 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20140508 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

A very powerful method of a security check is the Source Code Analysis (SCA). In such an analysis, the code of specific software is examined to determine vulnerabilities. This article will show you the basics of such a review., This paper was written in 2014 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20140424 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

Firewalls are one of the most complicated devices of a network to configure, manage and troubleshoot because every action affects the entire network, its security and all processes. A firewall defines security for a business at the perimeter level. Thus, Network Administrators must be able to effectively manage the firewall to ensure the IT infrastructure is protected against unauthorized access and potential malicious traffic from outside., This paper was written in 2014 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20140403 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

I have to admit, I’m not in love with the new Windows 8 user interface. The design formerly known as Metro is just not right for everyday work on a desktop workstation, there are plenty of other glitches, but I’m going not going to get into those right now. Because everybody is painfully aware of them and rumour has it that Microsoft has finally gotten the message. [1], This paper was written in 2014 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20140213 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

The unmanned airborne system (UAS) remote sensing using lightweight multi- and hyperspectral imaging sensors offer new possibilities for the environmental monitoring applications. Based on the accurate measurements of the way in which the object reflect and emit energy, wide range of affecting variables can be monitored. Condition for reliable applications is reliable and accurate input data. In many applications, installation of geometric and radiometric reference targets in the object area is challenging, for instance, in forest or water areas. On the other hand, UASs are often operated in very poor conditions, under clouds or under variable cloud cover. Our objective is to develop an autonomous hyperspectral UAS imaging system and data processing chain that does not require any ground reference targets. Prerequisites for this kind of a system are an appropriate sensor setup, stable and wellcalibrated instruments and rigorous data processing. In this paper, we will describe the new hyperspectral UAS imaging system that is under development. Important applications for the proposed system include precision agriculture, forest monitoring and water quality monitoring. Finally, we will consider the use of the system in forest inventory application and present the first results of the summer 2014 campaigns.

The analysis of complex networks is a rapidly growing topic with many applications in different domains. The analysis of large graphs is often made via unsupervised classification of vertices of the graph. Community detection is the main way to divide a large graph into smaller ones that can be studied separately. However another definition of a cluster is possible, which is based on the structural distance between vertices. This definition includes the case of community clusters but is more general in the sense that two vertices may be in the same group even if they are not connected. Methods for detecting communities in undirected graphs have been recently reviewed by Fortunato. In this paper we expand Fortunato's work and make a review of methods and algorithms for detecting essentially structurally homogeneous subsets of vertices in binary or weighted and directed and undirected graphs.

In this paper, a method to compute the solution of a system of linear equations by means of Neville elimination is described using two kinds of partitioning techniques: Block and Block-striped. This type of approach is especially suited to the case of totally positive linear systems, which is present in different fields of application. Although Neville elimination carried out more floating point operations than Gaussian elimination in some cases, in this study we confirm that these advantages disappear when we use multiprocessor systems. On the other hand, the overall parallel run time of Neville elimination is better than Gauss time as Neville elimination uses a lower cost communication model.

It happened again. Someone’s stealing our data without our knowledge. This time, it’s not the NSA or any other international agency of spies. This time, our televisions record what we watch and when we watch it. The Blogspot-User DoctorBeet discovered this [1] recently., This paper was written in 2013 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20131205 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

Everyone needs access to data, whether it is online or offline. Sometimes, there is a need to transfer data between two devices (hopefully both with encrypted storage). In recent years, TrueCrypt has helped us to keep data secure, but still requires the user to work rigorously, requires the ability to run software on a device, expose the pass phrases to keyboard sniffing attacks and is limited to some device+OS combinations., This paper was written in 2013 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20131114 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

Microsoft has developed several tools that help security professionals in the difficult task to keep Windows operating systems safe, like the Microsoft Baseline Security Analyzer (MBSA) or the Security Compliance Manager (SCM). This time we like to give an overview of another interesting piece of windows security software: the Enhanced Mitigation Experience Toolkit (EMET)., This paper was written in 2013 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20130502 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

Dealing with large logfiles is pretty simple. We will see how to extract information from an exported Firewall-1 logfile and format it for our need., This paper was written in 2013 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20130124 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

A perfect dominating set of a graph G = ( V , E ) is a subset D of V such that every vertex not in D is adjacent to exactly one vertex in D . The perfect domination problem is to find the minimum size of a perfect dominating set of a graph. Suppose moreover that every vertex v ϵ V has a cost c ( v ) and every edge eϵE has a cost c ( e ). The weighted perfect domination problem is to find a perfect dominating set D such that its total cost c ( D ) = ∑{ c ( v ): ϵD } + ∑{ c ( u , v ): u ∉ D , vϵD and ( u , v ) ϵ E } is minimum. We also consider the following three variants of perfect domination. A perfect dominating set. D is called independent (resp. connected, total) if the subgraph 〈 D 〉 induced by D has no edge (resp. is connected, has no isolated vertex). This paper first proves that the three variants of perfect domination are NP-complete for bipartite graphs and chordal graphs, except for the connected perfect domination in chordal graphs. We then present linear-time algorithms for the weighted perfect domination problem and its three variants in block graphs.

WAF or Web Application Firewall is a fancy marketing name to describe technology that existed long before this term became common. In fact the technology behind WAF used to be called full application reverse-proxy and basically allows to forward, inspect and sanitize (or block) protocol requests to an application server., This paper was written in 2012 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20121213 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

Matrix lower rank approximations such as non- negative matrix factorization (NMF) have been successfully used to solve many data mining tasks. In this paper, we propose a new matrix lower rank approximation called Bounded Matrix Low Rank Approximation (BMA) which imposes a lower and an upper bound on every element of a lower rank matrix that best approximates a given matrix with missing elements. This new approximation models many real world problems, such as recommender systems, and performs better than other methods, such as singular value decompositions (SVD) or NMF. We present an efficient algorithm to solve BMA based on coordinate descent method. BMA is different from NMF as it imposes bounds on the approximation itself rather than on each of the low rank factors. We show that our algorithm is scalable for large matrices with missing elements on multi core systems with low memory. We present substantial experimental results illustrating that the proposed method outperforms the state of the art algorithms for recommender systems such as Stochastic Gradient Descent, Alternating Least Squares with regularization, SVD++, Bias-SVD on real world data sets such as Jester, Movielens, Book crossing, Online dating and Netflix.

Name used to indicate the significance of the specific rule. Rule Name appears throughout all the applications (for example, SmartView Tracker, SmartReporter, and so on), and offers a clue as to why it is being used., This paper was written in 2012 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20120510 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

Let k be a field of characteristic p > 0, and let G be a finite group. The first result of this paper is an explicit formula for the determinant of the Cartan matrix of the Mackey algebra μ k (G) of G over k. The second one is a formula for the rank of the Cartan matrix of the cohomological Mackey algebra coμ k (G) of G over k, and a characterization of the groups G for which this matrix is nonsingular. The third result is a generalization of this rank formula and characterization to blocks of coμ k (G): in particular, if b is a block of kG, the Cartan matrix of the corresponding block coμ k (b) of coμ k (G) is nonsingular if and only if b is nilpotent with cyclic defect groups.

Since the pioneer works of composer Tom Johnson, many questions arise about block designs. The aim of this paper is to propose some new graphical representations suitable for composers and analysts, and to study the relationship between pcsets and small t-designs. After a short introduction on the combinatorial aspects of t-designs, we emphasize the musical perspectives open by these mathematical objects.

In this paper, a 3-point block method based on Backward Diffeerentiation Formulas (BDF) which is called 3BBDF for solving first order Ordinary Diffeerential Equations (ODEs) using fixed step size is presented. This method will compute the solutions of Initial Value Problems (IVPs) at three points simultaneously on the x-axis. The zero stability of the derived 3BBDF is also investigated. The e±ciency of the 3BBDF is compared with the classical fixed step size BDF method. Numerical results indicate that the resulting 3BBDF method outperform the BDF method in terms of execution times and less number of steps taken to complete the integration in the given interval.

As variáveis contextuais, especificadoras dos cenários de jogo, interferem na tomada de decisão das atletas aquando da realização do ataque e do bloco. Pretendeu-se efectuar a análise exploratória das variáveis: a) disponibilidade da central para o ataque rápido; b) movimentações do bloco antes do passe; c) oposição do bloco, assim como, estudar as relações existentes entre elas, no jogo de Voleibol feminino. Após validação do instrumento de observação (construção e conteúdo) foram analisadas 472 sequências de ataque e de bloco resultantes de 18 sets, duma Poule de Apuramento para o Campeonato da Europa de 2005. A fiabilidade da observação foi comprovada através do índice de fiabilidade Kappa e os procedimentos estatísticos utilizados foram as frequências, percentagens e teste do Qui-Quadrado. Os principais resultados indicam que: i) em mais de metade das sequências observadas não há uma real disponibilidade da central para atacar; ii) a situação de espera das blocadoras perante o passe de ataque é a mais comum; iii) o bloco duplo é o mais utilizado, sendo seguido pelo bloco individual; iv) todas as relações estudadas (disponibilidade da central para o ataque rápido e movimentações do bloco antes do passe; disponibilidade da central para o ataque rápido e oposição do bloco; movimentações do bloco antes do passe e oposição do bloco) apresentam um grau de associação moderado. Com este estudo demonstrou-se que a disponibilidade da central para o ataque rápido influiu decisivamente nas acções do bloco adversário, antes e após o passe de ataque. The contextual specifier variables of the match scenarios, interfere with the athletes’ tactical decision making, when attacking and blocking. This paper intended to explore the following variables: a) availability of the middle attacker for the quick attack; b) block movements previous to the set; c) block opposition, and also, study the relationships between the three variables, within the women’s Volleyball game. After validating the observation instrument (construct and content validation), we analyzed 472 sequences of attack and block, from 18 sets relative to a Classification Pool relating to the 2005 European Championships. The observation reliability was asserted through Kappa’s Reliability Index. The statistical procedures used were frequencies, percentages and Chi-Square. The main results show that: i) in more than half of the sequences, the middle attacker isn’t available for the quick attack; ii) before the set, the block tends to wait, instead of moving; iii) the double block is the most common, followed by individual block; iv) every relationship studied revealed a moderate degree of association. With this study it has been demonstrated that the availability of the middle attacker for the quick attack influences the actions of the opposite block in a decisive way, before and after the set.

This paper proves that the problem of finding connected vertex cover in a 2-connected planar graph ( CVC-2 ) with maximum degree 4 is NP-complete. The motivation for proving this result is to give a shorter and simpler proof of NP-Completeness of TRA-MLC (the Top Right Access point Minimum-Length Corridor) problem [1], by finding the reduction from CVC-2. TRA-MLC has many applications in laying optical fibre cables for data communication and electrical wiring in floor plans.The problem of finding connected vertex cover in any planar graph ( CVC ) with maximum degree 4 is NP-complete [2]. We first show that CVC-2 belongs to NP and then we find a polynomial reduction from CVC to CVC-2. Let a graph G0 and an integer K form an instance of CVC, where G0 is a planar graph and K is an upper bound on the size of the connected vertex cover in G0. We construct a 2-connected planar graph, say G, by identifying the blocks and cut vertices of G0, and then finding the planar representation of all the blocks of G0, leading to a plane graph G1. We replace the cut vertices with cycles in such a way that the resultant graph G is a 2-connected planar graph with maximum degree 4. We consider L = K -2t+3 t i=1 di where t is the number of cut vertices in G1 and di is the number of blocks for which ith cut vertex is common. We prove that G will have a connected vertex cover with size less than or equal to L if and only if G0 has a connected vertex cover of size less than or equal to K., {"references":["A. Gonzalez-Gutierrez and T. F. Gonzalez, \" Complexity of the Minimum-Length Corridor Problem\", J. Comp. eometry, Theory and Applns.,Els. vol. 37, no. 2,2007,pp. 72-103.","M.R.Garey and D. S. Johnson, \"The Rectilinear Steiner Tree Problem is\nNP - complete\",J. Appl. Math.(SIAM), vol. 32, no. 4, 1977, pp. 826-834.","D.B.West, Introduction to Graph Theory, Prentice Hall of India, 1999.","J.A.Bondy and U. S. R. Murty, Graph Theory With Applications, The\nMacmillan press Ltd, 1976","R.Weiskircher, \"Drawing Planar Graphs\", from M.Kaufmann & D. Wagner (Eds.): Drawing Graphs, LNCS 2025,Springer-Verlag, 2001,\npp. 23-45.","D.Jungnickel, Graphs, Networks and Algorithms, Springer-verlag, 2005.","M.R.Garey & D.S.Johnson, Computers and Intractability: A Guide to the\nTheory of NP-Completeness, W.H. Freeman & Co., 1979.","M.R.Garey, D.S.Johnson and Stockmeyer, \"Some simplified NP-complete\nproblems\",Proc. of the sixth annual ACM Symposium on theory of\ncomputing, 1974, pp. 47-63","C.H.Papadimitriou & K.Steiglitz, Combinatorial optimization: Algorithms\nand Complexity, Prentice Hall India, 1997."]}

This paper provides a theoretical framework of dispute settlement to explain the surge in blocking incidence of GATT panel reports during the 1980s and the variations in withdrawn incidence versus total disputes across di®erent decades of the GATT regime. The study first suggests the role of the degree of legal controversy over a panel ruling in determining countries' incentives to block (appeal) a panel report under the GATT (WTO) regime. The study then analyzes the effects of political power on countries' incentives to use, and their interactions in using, the dispute settlement mechanism, when two-sided asymmetric information exists regarding panel judgement.

Digital watermarking is the method of hiding or embedding any form of digital data in another multimedia data like image, audio, video, text, etc. The image to which another image is hidden is the cover image or original image and the hidden image is known as watermark. This paper proposes a block based image watermarking algorithm which uses cryptographic algorithm to find out the positions of the cover image in which the watermark is to be embedded. Two different keys are generated using Diffie Hellman Key Exchange algorithm and using these keys the positions of cover image to which the watermark bits are to be embedded are found out. Experimental results show that this method can withstand different geometrical attacks and is robust than other methods.

The purpose of the present paper is two-fold: on the one hand, to show the existence of a correspondence unifying Brauer's and Glauberman's ones (see Theorem 4.6), and, on the other hand, to give an alternative proof of Watanabe's equivalence in [Atumi Watanabe, The Glauberman character correspondence and perfect isometries for blocks of finite groups, J. Algebra 216 (1999) 548–565]. By the way, we give a short proof of the coincidence of the Clifford extensions associated with a pair of Glauberman correspondent irreducible representations (see Corollary 4.16), a question that, surprisingly enough, has only been partially solved recently (see [Morton Harris, Markus Linckelmann, On the Glauberman and Watanabe correspondences for blocks of finite p-solvable groups, Trans. Amer. Math. Soc. 354 (2002) 3435–3453] and [Shigeo Koshitani, Gerhard Michler, Glauberman correspondence of p-blocks of finite groups, J. Algebra 243 (2001) 504–517]).

Let G be a connected graph and Â? ( G ) = S z ( G ) - W ( G ) , where W ( G ) and S z ( G ) are the Wiener and Szeged indices of G , respectively. A well-known result of KlavÂ?ar, Rajapakse, and Gutman states that Â? ( G ) Â? 0 , and by a result of Dobrynin and Gutman Â? ( G ) = 0 if and only if each block of G is complete. In this paper, a path-edge matrix for the graph G is presented by which it is possible to classify the graphs in which Â? ( G ) = 2 . It is also proved that there is no graph G with the property that Â? ( G ) = 1 or Â? ( G ) = 3 . Finally, it is proved that, for a given positive integer k , k Â? 1 , 3 , there exists a graph G with Â? ( G ) = k . HighlightsÂ? We prove that there is no graph G such that Â? ( G ) = S z ( G ) - W ( G ) is equal to 1 or 3. Â? We prove that Â? ( G ) = 2 if and only if G is a member of a class K 2 . Â? For every non-negative integer n Â? 1 or 3, there exists a graph G such that Â? ( G ) = n . Â? If a block B of G contains an isometric cycle of length n Â? 4 , then Â? ( G ) Â? n .

Suppose f is a map from an interval [ a , b ] into itself with a periodic orbit consisting of the points p 1 p 2 ⋯ p n . This paper begins with an analysis of the structure of periodic orbits for interval maps. Blocks are defined and used to describe this structure. With these structural theorems in place, results relating blocks of p 1 , p 2 , … , p n to irreducibility in the inverse limit of { [ a , b ] , f } are proved. Assuming p 1 , p 2 , … , p n is a Markov partition for f, necessary and sufficient conditions are given for two points of the inverse limit to belong to the same composant. This characterization of composants is used to show that the inverse limit is an E 0 -type continuum.

The purpose of this paper is to investigate the following: 1. What methods of scheduling, namely intermittent or block, are used most by clinicians working in Utah public schools. 2. What is the average size and composition of caseloads of Utah public school clinicians. Conclusions are drawn as to the implications of the data collected and based on these conclusions, recommendations are made.

In most disciplines where research is involved, there exists an occasional problem of having minimal facilities and/or funds for conducting experiments. This often necessitates the use of designs known as incomplete block designs. Since the calculations needed to provide an appropriate statistical analysis are somewhat tedious, particularJ..y in the larger designs, it is advantageous to have computer programs to do the necessary calculations. There are several computer programs at Utah State University written in Fortran II language with Forcom subroutines that perform the analyses for incomplete block designs. These programs, for the most part, were authored by Justus Seely and Dr. Rex L. Hurst, Head, Department of Applied Statistics and Computer Science at U.S.U. Only four of these available programs are covered in this paper. These programs are converted to Fortran IV language using the binary coded decimal system (BCD). The programs involved are Balanced Lattices, Designs Arranged in Replications, Designs Arranged in Groups of Replications, and Designs Not Arranged in Replications or Groups of Replications. The three latter programs will hereinafter be referred to as Type I, Type II, and Type III, respectively. The programs will be written in double precision instead of single precision in order to increase computational accuracy. In single precision the number of significant digits carried accurately in the IBM 360 mod 44 computer is limited to seven. Since the numbers that represent the data need to be squared and summed, the size of number that could be used would have to be rather small, preferably less than four digits. With double precision the number of digits carried accurately is fourteen. This now presents the opportunity to use larger numbers to represent the data, but it is advisable to use numbers with less than six digits if possible.

Banks, credit card issuers and online traders are all confronted with the problem of fraud. This article discusses how malicious activities can be identified and responded to, based on the behavior of fraudsters and their access attempts., This paper was written in 2017 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20170615 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

For the past 15 years, the subject of Intrusion Prevention Systems (IPS) has been present in the heads of those who work in applied computer security. However, just like Intrusion Detection Systems (IDS) they’ve been a bit neglected as of late. The subject seemed too complex and too difficult to handle. This article will focus on the Protection Filters that TippingPoint provides. HP’s approach and the program’s structure is being looked at dissected., This paper was written in 2013 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20131211 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

Slowly but surely, blockchain is emerging from the shadow of Bitcoin. Bitcoin is a cryptocurrency that is traded in the virtual realm. This trading is only made possible by the use of a blockchain, which is used to verify the digital transactions. This article discusses how blockchains work and the possibilities they offer, which are likely to form a large part of commerce in the future, bringing change to large parts of our society., This paper was written in 2016 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20160623 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

During the 1950s and 1960s, the Belgian building market was flooded with new (or improved) building materials and construction techniques. The periodical and technical literature of that time frequently reports on different kinds of lightweight concrete, new types of glazing, insulation materials, prefabricated panels made of wood, cement, asbestos or plastics,... This remarkable increase in the range of available construction materials during the post-war period stands in sharp contrast to present-day knowledge on these materials: this noted discrepancy is all too often corroborated by current renovation practice, falling short of appropriate renovation or restoration strategies. Besides treating technical and practical aspects of this new generation of building materials (material characteristics and physical properties), this paper will also investigate socio-economic and cultural aspects of these innovations in post-war construction practice: how and why were these materials developed and commercializedin that particular time and space? How was knowledge on these materials disseminated? In which types of buildings or assemblies were they ideally applied? How did the manufacturers propagate these new materials? How did these new materials influence the building practice and the architectural design practice? These questions will be answered by means of a close reading of representative Belgian architectural periodicals of that time (e.g. Bouwen & Wonen, Architecture).

Massive rise of AI research and other channels. AI research inevitably requires an interdisciplinary approach. Psychology and AI are inseparable. AI strikes humanity where it hurts: vulnerability, replacement. Further series will include: brain, conscience, behavior, ethics, practice., This paper was written in 2018 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20180215 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.

Skype [1] has been a very popular means to make voice and video calls for the past few years. Its popularity is in no small part due to the ease of use, which leads to a big user base and a plus in attractiveness. From a user’s point of view, Skype has many advantages. From the point of view of a company that is concerned about the protection of its own network, however, Skype turns out to be a nightmare. This article takes a look at the difficulties Skype brings as well as the resulting risks., This paper was written in 2014 as part of a research project at scip AG, Switzerland. It was initially published online at https://www.scip.ch/en/?labs.20140918 and is available in English and German. Providing our clients with innovative research for the information technology of the future is an essential part of our company culture.